Submission #2410655
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef long long ll; #define REP(i,n) for(int i=0,_n=(int)(n);i<_n;++i) #define ALL(v) (v).begin(),(v).end() #define CLR(t,v) memset(t,(v),sizeof(t)) template<class T1,class T2>ostream& operator<<(ostream& os,const pair<T1,T2>&a){return os<<"("<<a.first<<","<<a.second<< ")";} template<class T>void pv(T a,T b){for(T i=a;i!=b;++i)cout<<(*i)<<" ";cout<<endl;} template<class T>void chmin(T&a,const T&b){if(a>b)a=b;} template<class T>void chmax(T&a,const T&b){if(a<b)a=b;} int nextInt() { int x; scanf("%d", &x); return x;} bool edge[51][51]; bool possible(vector<int> a, vector<int> b, int K, ll ans) { CLR(edge, 0); for (int i = 0; i <= 50; i++) edge[i][i] = true; for (int i = 0; i <= 50; i++) { for (int k = 1; k <= 50; k++) { if (k <= K || (ans >> k & 1)) edge[i][i % k] = 1; } } for (int k = 0; k <= 50; k++) { for (int i = 0; i <= 50; i++) { for (int j = 0; j <= 50; j++) { edge[i][j] = edge[i][j] || (edge[i][k] && edge[k][j]); } } } int t = 0; REP(i, a.size()) if (edge[a[i]][b[i]]) t++; return t == (int)a.size(); } int main2() { int N = nextInt(); vector<int> a(N), b(N); REP(i, N) a[i] = nextInt(); REP(i, N) b[i] = nextInt(); if (!possible(a, b, 50, 0)) { cout << -1 << endl; return 0; } ll ans = 0; for (int k = 50; k > 0; k--) { if (possible(a, b, k-1, ans)) { // ok } else { // assert(true == possible(a, b, k, ans)) ans += (1LL << k); } } cout << ans << endl; return 0; } int main() { for (;!cin.eof();cin>>ws) main2(); return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Remainder Game |
User | hs484 |
Language | C++14 (GCC 5.4.1) |
Score | 700 |
Code Size | 1695 Byte |
Status | AC |
Exec Time | 14 ms |
Memory | 256 KB |
Compile Error
./Main.cpp: In function ‘int nextInt()’: ./Main.cpp:14:39: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] int nextInt() { int x; scanf("%d", &x); return x;} ^
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 | 14 ms | 256 KB |
02.txt | AC | 14 ms | 256 KB |
03.txt | AC | 14 ms | 256 KB |
04.txt | AC | 14 ms | 256 KB |
05.txt | AC | 14 ms | 256 KB |
06.txt | AC | 14 ms | 256 KB |
07.txt | AC | 14 ms | 256 KB |
08.txt | AC | 1 ms | 256 KB |
09.txt | AC | 1 ms | 256 KB |
10.txt | AC | 1 ms | 256 KB |
11.txt | AC | 1 ms | 256 KB |
12.txt | AC | 14 ms | 256 KB |
13.txt | AC | 14 ms | 256 KB |
14.txt | AC | 14 ms | 256 KB |
15.txt | AC | 14 ms | 256 KB |
16.txt | AC | 14 ms | 256 KB |
17.txt | AC | 14 ms | 256 KB |
18.txt | AC | 14 ms | 256 KB |
19.txt | AC | 14 ms | 256 KB |
20.txt | AC | 14 ms | 256 KB |
21.txt | AC | 14 ms | 256 KB |
22.txt | AC | 14 ms | 256 KB |
23.txt | AC | 14 ms | 256 KB |
24.txt | AC | 14 ms | 256 KB |
25.txt | AC | 14 ms | 256 KB |
26.txt | AC | 14 ms | 256 KB |
27.txt | AC | 14 ms | 256 KB |
28.txt | AC | 14 ms | 256 KB |
29.txt | AC | 14 ms | 256 KB |
30.txt | AC | 14 ms | 256 KB |
31.txt | AC | 14 ms | 256 KB |
32.txt | AC | 14 ms | 256 KB |
33.txt | AC | 14 ms | 256 KB |
34.txt | AC | 14 ms | 256 KB |
35.txt | AC | 14 ms | 256 KB |
36.txt | AC | 14 ms | 256 KB |
37.txt | AC | 14 ms | 256 KB |
38.txt | AC | 14 ms | 256 KB |
39.txt | AC | 14 ms | 256 KB |
40.txt | AC | 14 ms | 256 KB |
41.txt | AC | 14 ms | 256 KB |
42.txt | AC | 14 ms | 256 KB |
43.txt | AC | 14 ms | 256 KB |
44.txt | AC | 14 ms | 256 KB |
45.txt | AC | 14 ms | 256 KB |
46.txt | AC | 14 ms | 256 KB |
47.txt | AC | 14 ms | 256 KB |
48.txt | AC | 14 ms | 256 KB |
49.txt | AC | 14 ms | 256 KB |
50.txt | AC | 14 ms | 256 KB |
51.txt | AC | 14 ms | 256 KB |
52.txt | AC | 14 ms | 256 KB |
53.txt | AC | 14 ms | 256 KB |
s1.txt | AC | 14 ms | 256 KB |
s2.txt | AC | 13 ms | 256 KB |
s3.txt | AC | 1 ms | 256 KB |
s4.txt | AC | 14 ms | 256 KB |
s5.txt | AC | 14 ms | 256 KB |