Submission #2852650
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef long long ll; #define rep(i,a) for(int i=0;i<(a);i++) const ll MOD=1000000007; int use[55]; ll beki[55]; const ll INF=LLONG_MAX; int main(){ beki[0]=1; rep(i,51) beki[i+1]=2*beki[i]; int N; cin>>N; int A[N],B[N]; rep(i,N) cin>>A[i]; rep(i,N) cin>>B[i]; for(int i=1;i<=51;i++) use[i]=1; for(int i=51;i>=1;i--){ use[i]=0; ll G[55][55]; rep(j,55) rep(k,55){ if(j==k) G[j][k]=0; else G[j][k]=INF; } for(int j=51;j>=1;j--) for(int k=j;k>=1;k--){ if(use[k]) G[j][j%k]=min(G[j][j%k],beki[k]); } rep(l,51) rep(j,51) rep(k,51) if(G[j][l]!=INF&&G[l][k]!=INF){ G[j][k]=min(G[j][k],G[j][l]+G[l][k]); } bool flag=0; rep(j,N) if(G[A[j]][B[j]]==INF) flag=1; if(flag&&i==51){ cout<<-1<<endl; return 0; } if(flag) use[i]=1; } ll ans=0; for(int i=1;i<=50;i++) if(use[i]) ans+=beki[i]; cout<<ans<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Remainder Game |
User | misosoup |
Language | C++14 (GCC 5.4.1) |
Score | 700 |
Code Size | 1010 Byte |
Status | AC |
Exec Time | 10 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 | 9 ms | 256 KB |
02.txt | AC | 9 ms | 256 KB |
03.txt | AC | 9 ms | 256 KB |
04.txt | AC | 9 ms | 256 KB |
05.txt | AC | 10 ms | 256 KB |
06.txt | AC | 9 ms | 256 KB |
07.txt | AC | 9 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 | 9 ms | 256 KB |
13.txt | AC | 9 ms | 256 KB |
14.txt | AC | 9 ms | 256 KB |
15.txt | AC | 9 ms | 256 KB |
16.txt | AC | 10 ms | 256 KB |
17.txt | AC | 9 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 | 9 ms | 256 KB |
25.txt | AC | 9 ms | 256 KB |
26.txt | AC | 9 ms | 256 KB |
27.txt | AC | 9 ms | 256 KB |
28.txt | AC | 9 ms | 256 KB |
29.txt | AC | 9 ms | 256 KB |
30.txt | AC | 10 ms | 256 KB |
31.txt | AC | 9 ms | 256 KB |
32.txt | AC | 9 ms | 256 KB |
33.txt | AC | 9 ms | 256 KB |
34.txt | AC | 9 ms | 256 KB |
35.txt | AC | 9 ms | 256 KB |
36.txt | AC | 9 ms | 256 KB |
37.txt | AC | 9 ms | 256 KB |
38.txt | AC | 9 ms | 256 KB |
39.txt | AC | 9 ms | 256 KB |
40.txt | AC | 9 ms | 256 KB |
41.txt | AC | 9 ms | 256 KB |
42.txt | AC | 9 ms | 256 KB |
43.txt | AC | 9 ms | 256 KB |
44.txt | AC | 9 ms | 256 KB |
45.txt | AC | 9 ms | 256 KB |
46.txt | AC | 9 ms | 256 KB |
47.txt | AC | 10 ms | 256 KB |
48.txt | AC | 10 ms | 256 KB |
49.txt | AC | 9 ms | 256 KB |
50.txt | AC | 9 ms | 256 KB |
51.txt | AC | 9 ms | 256 KB |
52.txt | AC | 9 ms | 256 KB |
53.txt | AC | 10 ms | 256 KB |
s1.txt | AC | 9 ms | 256 KB |
s2.txt | AC | 9 ms | 256 KB |
s3.txt | AC | 1 ms | 256 KB |
s4.txt | AC | 9 ms | 256 KB |
s5.txt | AC | 9 ms | 256 KB |