Submission #2409651


Source Code Expand

#include<stdio.h>
#include<math.h>
#include<algorithm>
#include<queue>
#include<deque>
#include<stack>
#include<string>
#include<string.h>
#include<vector>
#include<set>
#include<map>
#include<bitset>
#include<stdlib.h>
#include<cassert>
#include<time.h>
#include<bitset>
using namespace std;
const long long mod=1000000007;
const long long inf=mod*mod;
const long long d2=(mod+1)/2;
const long double EPS=1e-10;
const long double PI=acos(-1.0);
int ABS(int a){return max(a,-a);}
long long ABS(long long a){return max(a,-a);}
long double ABS(long double a){return max(a,-a);}
int p[60];
int q[60];
int t[60][60];
int can[60][60][60];
int main(){
	int a;scanf("%d",&a);
	for(int i=0;i<a;i++)scanf("%d",p+i);
	for(int i=0;i<a;i++)scanf("%d",q+i);
	long long ret=0;
	for(int i=0;i<60;i++)can[0][i][i]=1;
	for(int i=1;i<60;i++)for(int j=0;j<60;j++)for(int k=0;k<60;k++){
		can[i][j][k]=can[i-1][j][k]|can[i-1][j%i][k];
	}
	for(int i=0;i<a;i++){
		if(p[i]==q[i])continue;
		if(p[i]/2<q[i]){
			printf("-1\n");return 0;
		}
	}
	for(int i=0;i<a;i++)t[i][p[i]]=1;
	for(int i=50;i>=1;i--){
		bool nd=false;
		for(int j=0;j<a;j++){
			bool ok=false;
			for(int k=0;k<60;k++){
				if(t[j][k]&&can[i-1][k][q[j]]){
					ok=true;
		//			printf("%d %d %d\n",i,j,k);
				}
			}
			if(!ok)nd=true;
		}
		if(nd){
			ret+=(1LL<<i);
			for(int j=0;j<a;j++){
				for(int k=0;k<60;k++){
					t[j][k%i]|=t[j][k];
				}
			}
		}
	}
	printf("%lld\n",ret);
}

Submission Info

Submission Time
Task C - Remainder Game
User tozangezan
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1499 Byte
Status WA
Exec Time 2 ms
Memory 1024 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:31:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  int a;scanf("%d",&a);
                      ^
./Main.cpp:32:37: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  for(int i=0;i<a;i++)scanf("%d",p+i);
                                     ^
./Main.cpp:33:37: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  for(int i=0;i<a;i++)scanf("%d",q+i);
                                     ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 700
Status
AC × 5
AC × 56
WA × 2
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 1 ms 1024 KB
02.txt AC 1 ms 1024 KB
03.txt AC 1 ms 1024 KB
04.txt AC 1 ms 1024 KB
05.txt AC 2 ms 1024 KB
06.txt AC 1 ms 1024 KB
07.txt AC 1 ms 1024 KB
08.txt WA 1 ms 1024 KB
09.txt WA 2 ms 1024 KB
10.txt AC 1 ms 1024 KB
11.txt AC 1 ms 1024 KB
12.txt AC 1 ms 1024 KB
13.txt AC 1 ms 1024 KB
14.txt AC 1 ms 1024 KB
15.txt AC 1 ms 1024 KB
16.txt AC 1 ms 1024 KB
17.txt AC 1 ms 1024 KB
18.txt AC 1 ms 1024 KB
19.txt AC 1 ms 1024 KB
20.txt AC 1 ms 1024 KB
21.txt AC 2 ms 1024 KB
22.txt AC 1 ms 1024 KB
23.txt AC 1 ms 1024 KB
24.txt AC 1 ms 1024 KB
25.txt AC 1 ms 1024 KB
26.txt AC 1 ms 1024 KB
27.txt AC 1 ms 1024 KB
28.txt AC 1 ms 1024 KB
29.txt AC 1 ms 1024 KB
30.txt AC 1 ms 1024 KB
31.txt AC 1 ms 1024 KB
32.txt AC 1 ms 1024 KB
33.txt AC 1 ms 1024 KB
34.txt AC 1 ms 1024 KB
35.txt AC 1 ms 1024 KB
36.txt AC 1 ms 1024 KB
37.txt AC 1 ms 1024 KB
38.txt AC 1 ms 1024 KB
39.txt AC 1 ms 1024 KB
40.txt AC 1 ms 1024 KB
41.txt AC 1 ms 1024 KB
42.txt AC 1 ms 1024 KB
43.txt AC 1 ms 1024 KB
44.txt AC 1 ms 1024 KB
45.txt AC 1 ms 1024 KB
46.txt AC 1 ms 1024 KB
47.txt AC 1 ms 1024 KB
48.txt AC 1 ms 1024 KB
49.txt AC 1 ms 1024 KB
50.txt AC 1 ms 1024 KB
51.txt AC 1 ms 1024 KB
52.txt AC 1 ms 1024 KB
53.txt AC 1 ms 1024 KB
s1.txt AC 1 ms 1024 KB
s2.txt AC 1 ms 1024 KB
s3.txt AC 1 ms 1024 KB
s4.txt AC 1 ms 1024 KB
s5.txt AC 1 ms 1024 KB