Submission #2412002
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef long long int ll; typedef pair<int, int> pii; typedef pair<ll, ll> pll; const int INF = 1000000000; const ll LINF = (ll) 4000000000000000000; const ll MOD = (ll) 1000000007; const double PI = acos(1.0); const int limit = 100010; #define REP(i,m,n) for(int i = (int)m; i < (int)n; i++) #define rep(i,n) REP(i,0,n) #define rep2(i,n) REP(i,1,n+1) #define rep3(i,n) REP(i,0,n+1) #define REPM(i,m,n) for(int i = (int)m; i >= (int)n; i--) #define REPLL(i,m,n) for(ll i=m;i<(ll)(n);i++) #define repll(i,n) REPLL(i,0,n) #define repll2(i,n) REPLL(i,1,n+1) #define MP make_pair #define YES(n) cout << ((n) ? "YES" : "NO") << endl #define Yes(n) cout << ((n) ? "Yes" : "No") << endl #define Possible(n) cout << ((n) ? "Possible" : "Impossible") << endl #define NP(v) next_permutation(v.begin(),v.end()) #define Size(s) (int) s.size() //------------------------------------------------------ int main() { ll n; cin >> n; ll a[n], b[n]; rep(i, n) cin >> a[i]; rep(i, n) cin >> b[i]; set<ll> st; rep2(i, 50) st.insert(i); REPM(s, 50, 1) { st.erase(s); ll d[51][51]; rep3(i, 50) rep3(j, 50) { if (i == j) d[i][j] = 0; else d[i][j] = LINF; } for (auto a : st) { rep3(i, 50) d[i][i % a] = 1; } rep3(k, 50) rep3(i, 50) rep3(j, 50) d[i][j] = min(d[i][j], d[i][k] + d[k][j]); rep(i, n) { if (d[a[i]][b[i]] == LINF) { st.insert(s); break; } } } if (st.size() == 50) printf("-1\n"); else { ll ans = 0; for (auto s : st) { ans += (ll) pow(2, s); } cout << ans << endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Remainder Game |
User | stoq |
Language | C++14 (GCC 5.4.1) |
Score | 700 |
Code Size | 1867 Byte |
Status | AC |
Exec Time | 11 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 700 / 700 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | s1.txt, s2.txt, s3.txt, s4.txt, s5.txt |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, 38.txt, 39.txt, 40.txt, 41.txt, 42.txt, 43.txt, 44.txt, 45.txt, 46.txt, 47.txt, 48.txt, 49.txt, 50.txt, 51.txt, 52.txt, 53.txt, s1.txt, s2.txt, s3.txt, s4.txt, s5.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | AC | 10 ms | 256 KB |
02.txt | AC | 10 ms | 256 KB |
03.txt | AC | 10 ms | 256 KB |
04.txt | AC | 10 ms | 256 KB |
05.txt | AC | 10 ms | 256 KB |
06.txt | AC | 10 ms | 256 KB |
07.txt | AC | 10 ms | 256 KB |
08.txt | AC | 11 ms | 256 KB |
09.txt | AC | 11 ms | 256 KB |
10.txt | AC | 11 ms | 256 KB |
11.txt | AC | 11 ms | 256 KB |
12.txt | AC | 10 ms | 256 KB |
13.txt | AC | 10 ms | 256 KB |
14.txt | AC | 10 ms | 256 KB |
15.txt | AC | 10 ms | 256 KB |
16.txt | AC | 10 ms | 256 KB |
17.txt | AC | 10 ms | 256 KB |
18.txt | AC | 10 ms | 256 KB |
19.txt | AC | 10 ms | 256 KB |
20.txt | AC | 10 ms | 256 KB |
21.txt | AC | 10 ms | 256 KB |
22.txt | AC | 10 ms | 256 KB |
23.txt | AC | 10 ms | 256 KB |
24.txt | AC | 10 ms | 256 KB |
25.txt | AC | 10 ms | 256 KB |
26.txt | AC | 10 ms | 256 KB |
27.txt | AC | 10 ms | 256 KB |
28.txt | AC | 10 ms | 256 KB |
29.txt | AC | 10 ms | 256 KB |
30.txt | AC | 10 ms | 256 KB |
31.txt | AC | 10 ms | 256 KB |
32.txt | AC | 10 ms | 256 KB |
33.txt | AC | 10 ms | 256 KB |
34.txt | AC | 10 ms | 256 KB |
35.txt | AC | 10 ms | 256 KB |
36.txt | AC | 10 ms | 256 KB |
37.txt | AC | 10 ms | 256 KB |
38.txt | AC | 10 ms | 256 KB |
39.txt | AC | 10 ms | 256 KB |
40.txt | AC | 10 ms | 256 KB |
41.txt | AC | 10 ms | 256 KB |
42.txt | AC | 10 ms | 256 KB |
43.txt | AC | 10 ms | 256 KB |
44.txt | AC | 10 ms | 256 KB |
45.txt | AC | 10 ms | 256 KB |
46.txt | AC | 10 ms | 256 KB |
47.txt | AC | 10 ms | 256 KB |
48.txt | AC | 10 ms | 256 KB |
49.txt | AC | 10 ms | 256 KB |
50.txt | AC | 10 ms | 256 KB |
51.txt | AC | 10 ms | 256 KB |
52.txt | AC | 10 ms | 256 KB |
53.txt | AC | 10 ms | 256 KB |
s1.txt | AC | 10 ms | 256 KB |
s2.txt | AC | 10 ms | 256 KB |
s3.txt | AC | 11 ms | 256 KB |
s4.txt | AC | 10 ms | 256 KB |
s5.txt | AC | 10 ms | 256 KB |