답안 #1024952

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1024952	2024-07-16T13:11:25 Z	vjudge1	송금 (JOI19_remittance)	C++17	0 / 100	1 ms	600 KB

remittance

#include <bits/stdc++.h>
using namespace std;
 
#define ll long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pld pair<ld, ld>
#define pb push_back
#define fi first
#define se second
#define debug(x) cout << #x << " => " << x << endl
#define all(x) x.begin(),x.end()

int main()
{
	ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
	int n;cin>>n;
	int a[n],b[n],c[n];
	for(int i=0;i<n;i++) cin>>a[i]>>b[i];
	for(int i=0;i<n;i++) c[i]=a[i]-b[i];
	int i=0,cnt=0;
	while(cnt!=n+1)
	{
		if(c[i]<1) cnt++;
		else if(c[i]==1) c[i]-=2,c[(i+1)%n]+=1,cnt=0;
		else c[(i+1)%n]+=(c[i]/2),c[i]%=2,cnt=0;
		i=(i+1)%n;
	}
	bool ok=1;
	for(i=0;i<n;i++) if(c[i]!=0) ok=0;
	cout<<(ok?"Yes":"No");
	return 0;
}

Subtask #1

0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	452 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	344 KB	Output is correct
13	Correct	0 ms	600 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	1 ms	600 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	452 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Incorrect	0 ms	348 KB	Output isn't correct
21	Halted	0 ms	0 KB	-

Subtask #2

0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	452 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	344 KB	Output is correct
13	Correct	0 ms	600 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	1 ms	600 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	452 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Incorrect	0 ms	348 KB	Output isn't correct
21	Halted	0 ms	0 KB	-

Subtask #3

0 / 45.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	452 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	344 KB	Output is correct
13	Correct	0 ms	600 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	1 ms	600 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	452 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Incorrect	0 ms	348 KB	Output isn't correct
21	Halted	0 ms	0 KB	-