답안 #321625

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
321625	2020-11-12T23:38:58 Z	Lawliet	송금 (JOI19_remittance)	C++17	0 / 100	1 ms	492 KB

remittance

#include <bits/stdc++.h>

using namespace std;
typedef long long int lli;

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

int n;

lli diff[MAXN];

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

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

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

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

	xNext += qtd;
	xCross += qtd*p;

	if( xCross >= INF ) impossible();
}

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

	for(int i = 1 ; i <= n ; i++)
	{
		int a, b;
		scanf("%d %d",&a,&b);

		diff[i] = a - b;
	}

	lli xCur = 0;
	lli xCross = 0;

	for(int i = 1 ; i < n ; i++)
	{
		lli xNext = diff[i] + xCur;

		if( xNext < 0 ) addCross( i , -xNext , xCross , xNext );
		if( xNext%2 == 1 ) addCross( i , 1 , xCross , xNext );

		xCur = xNext/2;
	}

	lli s = diff[n] + xCur;

	if( s%2 == 0 && s/2 == xCross ) printf("Yes\n");
	else impossible();
}

Compilation message

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

Subtask #1

0 / 15.0

#	결과	실행 시간	메모리	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	0 ms	364 KB	Output is correct
5	Correct	0 ms	364 KB	Output is correct
6	Correct	0 ms	364 KB	Output is correct
7	Correct	1 ms	384 KB	Output is correct
8	Correct	1 ms	268 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	384 KB	Output is correct
11	Correct	1 ms	492 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	1 ms	492 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	Incorrect	1 ms	364 KB	Output isn't correct
21	Halted	0 ms	0 KB	-

Subtask #2

0 / 40.0

#	결과	실행 시간	메모리	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	0 ms	364 KB	Output is correct
5	Correct	0 ms	364 KB	Output is correct
6	Correct	0 ms	364 KB	Output is correct
7	Correct	1 ms	384 KB	Output is correct
8	Correct	1 ms	268 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	384 KB	Output is correct
11	Correct	1 ms	492 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	1 ms	492 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	Incorrect	1 ms	364 KB	Output isn't correct
21	Halted	0 ms	0 KB	-

Subtask #3

0 / 45.0

#	결과	실행 시간	메모리	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	0 ms	364 KB	Output is correct
5	Correct	0 ms	364 KB	Output is correct
6	Correct	0 ms	364 KB	Output is correct
7	Correct	1 ms	384 KB	Output is correct
8	Correct	1 ms	268 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	384 KB	Output is correct
11	Correct	1 ms	492 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	1 ms	492 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	Incorrect	1 ms	364 KB	Output isn't correct
21	Halted	0 ms	0 KB	-