답안 #963181

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
963181	2024-04-14T16:39:53 Z	happy_node	송금 (JOI19_remittance)	C++17	0 / 100	1 ms	2396 KB

remittance

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
 
const int MX=1e6+5;
int N;
ll A[MX], B[MX];
 
int main() {
	cin.tie(0); ios_base::sync_with_stdio(0);
 
	cin>>N;
	for(int i=0;i<N;i++) cin>>A[i]>>B[i];
 
	for(int k=0;k<51;k++) {
		for(int i=0;i<N;i++) {
			if(A[i]>B[i]) {
				ll nxt=min(A[i]/2,(A[i]-B[i])/2);
				A[i]-=2*nxt;
				A[(i+1)%N]+=nxt;
			}
		}
	}
 
	bool ok=1;
	for(int i=0;i<N;i++) 
		ok&=A[i]==B[i];
 
	cout<<(ok?"Yes":"No")<<'\n';
}

Subtask #1

0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	1 ms	2396 KB	Output is correct
4	Correct	1 ms	2396 KB	Output is correct
5	Correct	1 ms	2396 KB	Output is correct
6	Correct	1 ms	2396 KB	Output is correct
7	Correct	0 ms	2396 KB	Output is correct
8	Incorrect	0 ms	2396 KB	Output isn't correct
9	Halted	0 ms	0 KB	-

Subtask #2

0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	1 ms	2396 KB	Output is correct
4	Correct	1 ms	2396 KB	Output is correct
5	Correct	1 ms	2396 KB	Output is correct
6	Correct	1 ms	2396 KB	Output is correct
7	Correct	0 ms	2396 KB	Output is correct
8	Incorrect	0 ms	2396 KB	Output isn't correct
9	Halted	0 ms	0 KB	-

Subtask #3

0 / 45.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	1 ms	2396 KB	Output is correct
4	Correct	1 ms	2396 KB	Output is correct
5	Correct	1 ms	2396 KB	Output is correct
6	Correct	1 ms	2396 KB	Output is correct
7	Correct	0 ms	2396 KB	Output is correct
8	Incorrect	0 ms	2396 KB	Output isn't correct
9	Halted	0 ms	0 KB	-