Submission #2410663


Source Code Expand

#include <cstdio>
#include <cstring>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#define INF 1000000000000000000LL
using namespace std;

int main()
{
	int n, a[51], b[51];
	scanf("%d", &n);
	for(int i=0; i<n; i++){
		scanf("%d", &a[i]);
	}
	for(int i=0; i<n; i++){
		scanf("%d", &b[i]);
		if(a[i]<b[i]){
			printf("%d\n", -1); 
			return 0;
		}
	}
	long long int p2[51];
	p2[0]=1;
	for(int i=1; i<=50; i++){
		p2[i]=p2[i-1]*2;
	}
	long long int d[51][51];
	for(int i=0; i<=50; i++){
		for(int j=0; j<=50; j++){
			if(i==j){
				d[i][j]=0;
			}else{
				d[i][j]=INF;
			}
		}
	}
	for(int i=1; i<=50; i++){
		for(int j=0; j<=i-1; j++){
			for(int k=j+1; k<=i-j; k++){
				if((i-j)%k==0){
					d[i][j]=p2[k];
					break;
				}
			}
		}
	}
	for(int k=0; k<=50; k++){
		for(int i=0; i<=50; i++){
			for(int j=0; j<=50; j++){
				if(d[i][j]>d[i][k]+d[k][j]) d[i][j]=d[i][k]+d[k][j];
			}
		}
	}

	long long int ans=0;
	while(1){
		long long int dmax=0;
		int e=0;
		for(int i=0; i<n; i++){
            if(d[a[i]][b[i]]>=INF){
              e=2;
              break;
            }
			if(dmax<d[a[i]][b[i]]){
				dmax=d[a[i]][b[i]];
				e=1;
			}
		}
		if(e==0){
			break;
		}else if(e==2){
          printf("%d\n", -1);
          return 0;
        }
		int k;
		for(int i=0; i<=50; i++){
			if(dmax>=p2[i]) k=i;
		}
		ans=ans+p2[k];
		for(int i=0; i<n; i++){
			if(d[a[i]%k][b[i]]<=d[a[i]][b[i]]){
             
				a[i]=a[i]%k;
			}
          
		}
	}
	printf("%lld\n", ans);
	return 0;
}

Submission Info

Submission Time
Task C - Remainder Game
User chocorusk
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1632 Byte
Status WA
Exec Time 1 ms
Memory 128 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:15:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
                 ^
./Main.cpp:17:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &a[i]);
                     ^
./Main.cpp:20:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &b[i]);
                     ^

Judge Result

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