Submission #2411970
Source Code Expand
#include <bits/stdc++.h> using namespace std; int N; #define MAX_N 50 #define MAX_V 50 int D[MAX_V + 1][MAX_V + 1]; bool A[MAX_N][MAX_V + 1]; int B[MAX_N]; long long R; int main() { cin >> N; for(int v = 0; v <= MAX_V; ++v) for(int w = 0; w <= MAX_V; ++w) { D[v][w] = INT_MAX; for(int k = MAX_V; k >= 1; --k) { if(v % k == w) D[v][w] = k; } if(v == w) D[v][w] = 0; } for(int u = 0; u <= MAX_V; ++u) { for(int v = 0; v <= MAX_V; ++v) for(int w = 0; w <= MAX_V; ++w) { D[v][w] = min(D[v][w], max(D[v][u], D[u][w])); } } for(int i = 0; i < N; ++i) { int a; cin >> a; A[i][a] = true; } for(int i = 0; i < N; ++i) cin >> B[i]; while(true) { int k = 0; for(int i = 0; i < N; ++i) { int c = INT_MAX; for(int v = 0; v <= MAX_V; ++v) { if(A[i][v]) c = min(c, D[v][B[i]]); } k = max(k, c); } if(k == INT_MAX) { cout << -1 << endl; return 0; } if(k == 0) break; R += 1LL << k; for(int i = 0; i < N; ++i) { for(int v = 0; v <= MAX_V; ++v) { if(A[i][v]) A[i][v % k] = true; } } } cout << R << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Remainder Game |
User | shiatsumat |
Language | C++14 (GCC 5.4.1) |
Score | 700 |
Code Size | 1190 Byte |
Status | AC |
Exec Time | 2 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 | 2 ms | 256 KB |
02.txt | AC | 2 ms | 256 KB |
03.txt | AC | 2 ms | 256 KB |
04.txt | AC | 2 ms | 256 KB |
05.txt | AC | 2 ms | 256 KB |
06.txt | AC | 2 ms | 256 KB |
07.txt | AC | 2 ms | 256 KB |
08.txt | AC | 2 ms | 256 KB |
09.txt | AC | 2 ms | 256 KB |
10.txt | AC | 2 ms | 256 KB |
11.txt | AC | 2 ms | 256 KB |
12.txt | AC | 2 ms | 256 KB |
13.txt | AC | 2 ms | 256 KB |
14.txt | AC | 2 ms | 256 KB |
15.txt | AC | 2 ms | 256 KB |
16.txt | AC | 2 ms | 256 KB |
17.txt | AC | 2 ms | 256 KB |
18.txt | AC | 2 ms | 256 KB |
19.txt | AC | 2 ms | 256 KB |
20.txt | AC | 2 ms | 256 KB |
21.txt | AC | 2 ms | 256 KB |
22.txt | AC | 2 ms | 256 KB |
23.txt | AC | 2 ms | 256 KB |
24.txt | AC | 2 ms | 256 KB |
25.txt | AC | 2 ms | 256 KB |
26.txt | AC | 2 ms | 256 KB |
27.txt | AC | 2 ms | 256 KB |
28.txt | AC | 2 ms | 256 KB |
29.txt | AC | 2 ms | 256 KB |
30.txt | AC | 2 ms | 256 KB |
31.txt | AC | 2 ms | 256 KB |
32.txt | AC | 2 ms | 256 KB |
33.txt | AC | 2 ms | 256 KB |
34.txt | AC | 2 ms | 256 KB |
35.txt | AC | 2 ms | 256 KB |
36.txt | AC | 2 ms | 256 KB |
37.txt | AC | 2 ms | 256 KB |
38.txt | AC | 2 ms | 256 KB |
39.txt | AC | 2 ms | 256 KB |
40.txt | AC | 2 ms | 256 KB |
41.txt | AC | 2 ms | 256 KB |
42.txt | AC | 2 ms | 256 KB |
43.txt | AC | 2 ms | 256 KB |
44.txt | AC | 2 ms | 256 KB |
45.txt | AC | 2 ms | 256 KB |
46.txt | AC | 2 ms | 256 KB |
47.txt | AC | 2 ms | 256 KB |
48.txt | AC | 2 ms | 256 KB |
49.txt | AC | 2 ms | 256 KB |
50.txt | AC | 2 ms | 256 KB |
51.txt | AC | 2 ms | 256 KB |
52.txt | AC | 2 ms | 256 KB |
53.txt | AC | 2 ms | 256 KB |
s1.txt | AC | 2 ms | 256 KB |
s2.txt | AC | 2 ms | 256 KB |
s3.txt | AC | 2 ms | 256 KB |
s4.txt | AC | 2 ms | 256 KB |
s5.txt | AC | 2 ms | 256 KB |