Submission #321628

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
321628	2020-11-13T00:14:45 Z	Lawliet	Remittance (JOI19_remittance)	C++17	15 / 100	1 ms	384 KB

remittance

#include <bits/stdc++.h>

using namespace std;
typedef long long int lli;

const int MAXN = 1000010;
const lli INF = 5000000000000000000LL;

int n;

lli x[MAXN];
lli diff[MAXN];
lli A[MAXN], B[MAXN];

void impossible()
{
	printf("No\n");
	exit(0);
}

void addCross(int i, lli qtd)
{
	if( i >= 62 ) impossible();

	lli p = (1LL << (i - 1));

	if( qtd > INF/p ) impossible();

	x[i] += qtd; x[n] += qtd*p;
	if( x[n] >= INF ) impossible();

	for(int j = i - 1 ; j >= 1 ; j--)
		x[j] += (1LL << (i - j - 1))*qtd;
}

int main()
{
	scanf("%d",&n);

	for(int i = 1 ; i <= n ; i++)
	{
		scanf("%lld %lld",&A[i],&B[i]);
		diff[i] = A[i] - B[i];
	}

	for(int i = 1 ; i < n ; i++)
	{
		x[i] = diff[i] + x[i - 1];

		if( x[i] < 0 ) addCross( i , -x[i] );
		if( x[i]%2 == 1 ) addCross( i , 1 );

		x[i] = x[i]/2;
	}

	lli s = diff[n] + x[n - 1];
	if( s%2 != 0 || s/2 != x[n] ) impossible();

	for(int k = 1 ; k <= 100 ; k++)
	{
		for(int i = 1 ; i <= n ; i++)
		{
			lli send = min( x[i] , A[i]/2 );

			x[i] -= send; A[i] -= 2*send;
			A[(i == n) ? 1 : i + 1] += send;
		}
	}

	for(int i = 1 ; i <= n ; i++)
		if( A[i] != B[i] ) impossible();

	printf("Yes\n");
}

Compilation message

remittance.cpp: In function 'int main()':
remittance.cpp:38:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   38 |  scanf("%d",&n);
      |  ~~~~~^~~~~~~~~
remittance.cpp:42:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   42 |   scanf("%lld %lld",&A[i],&B[i]);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
15.0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	0 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	0 ms	364 KB	Output is correct
7	Correct	0 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	0 ms	364 KB	Output is correct
10	Correct	0 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	0 ms	364 KB	Output is correct
14	Correct	0 ms	364 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	0 ms	364 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct
18	Correct	1 ms	364 KB	Output is correct
19	Correct	1 ms	364 KB	Output is correct
20	Correct	1 ms	364 KB	Output is correct
21	Correct	1 ms	384 KB	Output is correct
22	Correct	0 ms	364 KB	Output is correct
23	Correct	0 ms	364 KB	Output is correct
24	Correct	1 ms	364 KB	Output is correct
25	Correct	0 ms	364 KB	Output is correct
26	Correct	1 ms	364 KB	Output is correct
27	Correct	1 ms	364 KB	Output is correct
28	Correct	1 ms	364 KB	Output is correct
29	Correct	1 ms	364 KB	Output is correct
30	Correct	1 ms	364 KB	Output is correct
31	Correct	1 ms	364 KB	Output is correct
32	Correct	0 ms	364 KB	Output is correct

Subtask #2
0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	0 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	0 ms	364 KB	Output is correct
7	Correct	0 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	0 ms	364 KB	Output is correct
10	Correct	0 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	0 ms	364 KB	Output is correct
14	Correct	0 ms	364 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	0 ms	364 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct
18	Correct	1 ms	364 KB	Output is correct
19	Correct	1 ms	364 KB	Output is correct
20	Correct	1 ms	364 KB	Output is correct
21	Correct	1 ms	384 KB	Output is correct
22	Correct	0 ms	364 KB	Output is correct
23	Correct	0 ms	364 KB	Output is correct
24	Correct	1 ms	364 KB	Output is correct
25	Correct	0 ms	364 KB	Output is correct
26	Correct	1 ms	364 KB	Output is correct
27	Correct	1 ms	364 KB	Output is correct
28	Correct	1 ms	364 KB	Output is correct
29	Correct	1 ms	364 KB	Output is correct
30	Correct	1 ms	364 KB	Output is correct
31	Correct	1 ms	364 KB	Output is correct
32	Correct	0 ms	364 KB	Output is correct
33	Correct	0 ms	364 KB	Output is correct
34	Correct	0 ms	364 KB	Output is correct
35	Correct	0 ms	364 KB	Output is correct
36	Incorrect	0 ms	364 KB	Output isn't correct
37	Halted	0 ms	0 KB	-

Subtask #3
0 / 45.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	0 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	0 ms	364 KB	Output is correct
7	Correct	0 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	0 ms	364 KB	Output is correct
10	Correct	0 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	0 ms	364 KB	Output is correct
14	Correct	0 ms	364 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	0 ms	364 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct
18	Correct	1 ms	364 KB	Output is correct
19	Correct	1 ms	364 KB	Output is correct
20	Correct	1 ms	364 KB	Output is correct
21	Correct	1 ms	384 KB	Output is correct
22	Correct	0 ms	364 KB	Output is correct
23	Correct	0 ms	364 KB	Output is correct
24	Correct	1 ms	364 KB	Output is correct
25	Correct	0 ms	364 KB	Output is correct
26	Correct	1 ms	364 KB	Output is correct
27	Correct	1 ms	364 KB	Output is correct
28	Correct	1 ms	364 KB	Output is correct
29	Correct	1 ms	364 KB	Output is correct
30	Correct	1 ms	364 KB	Output is correct
31	Correct	1 ms	364 KB	Output is correct
32	Correct	0 ms	364 KB	Output is correct
33	Correct	0 ms	364 KB	Output is correct
34	Correct	0 ms	364 KB	Output is correct
35	Correct	0 ms	364 KB	Output is correct
36	Incorrect	0 ms	364 KB	Output isn't correct
37	Halted	0 ms	0 KB	-

Submission #321628

Compilation message

Subtask #1 15.0 / 15.0

Subtask #2 0 / 40.0

Subtask #3 0 / 45.0

Subtask #1
15.0 / 15.0

Subtask #2
0 / 40.0

Subtask #3
0 / 45.0