Submission #1111236

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1111236	2024-11-11T19:38:20 Z	mychecksedad	Remittance (JOI19_remittance)	C++17	0 / 100	1 ms	568 KB

remittance

/* Author : Mychecksdead  */
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define MOD (1000000000+7)
#define MOD1 (998244353)
#define pb push_back
#define all(x) x.begin(), x.end()
#define en cout << '\n'
#define ff first
#define ss second
#define pii pair<int,int>
#define vi vector<int>
const int N = 1e6+100, M = 1e5+10, K = 52, MX = 30;
 
 
int n, A[N], B[N], x[N], nx[N], C[N];
void solve(){
  cin >> n;
  ll SA = 0, SB = 0;
  for(int i = 1; i <= n; ++i){
    cin >> A[i] >> B[i];
    x[i] = 0;
    SA += A[i];
    SB += B[i];
  }
  if(SB==0){
    if(SA==0) cout << "Yes";
    else cout << "No";
    return;
  }
  if(SB > SA){
    cout << "No";
    return;
  }
  bool OK = 1;
  while(OK){
    OK = 0;
    for(int i = 1; i <= n; ++i){
      ll t = (A[i]-B[i]+1)/2;
      A[i] -= 2*t;
      A[i==n?1:i+1] += t;
      if(t>0) OK = 1;
    }
  }

  for(int i = 1; i <= n; ++i) if(A[i]!=B[i]) OK=1;
  if(OK){
    cout << "No";
    return;
  }
  cout << "Yes";
}
 
 
int main(){
  cin.tie(0); ios::sync_with_stdio(0);
  int tt = 1, aa;
  // freopen("in.txt", "r", stdin);
  // freopen("out.txt", "w", stdout);
  while(tt--){
    solve();
    en;
  }
  cerr<<"time taken : "<<(float)clock()/CLOCKS_PER_SEC<<" seconds\n";
  return 0;
} 

Compilation message

remittance.cpp: In function 'int main()':
remittance.cpp:58:15: warning: unused variable 'aa' [-Wunused-variable]
   58 |   int tt = 1, aa;
      |               ^~

Subtask #1

0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	336 KB	Output is correct
2	Correct	1 ms	336 KB	Output is correct
3	Correct	1 ms	336 KB	Output is correct
4	Correct	1 ms	568 KB	Output is correct
5	Correct	1 ms	336 KB	Output is correct
6	Correct	1 ms	336 KB	Output is correct
7	Correct	1 ms	336 KB	Output is correct
8	Correct	1 ms	336 KB	Output is correct
9	Correct	1 ms	336 KB	Output is correct
10	Correct	1 ms	336 KB	Output is correct
11	Correct	1 ms	336 KB	Output is correct
12	Correct	1 ms	336 KB	Output is correct
13	Correct	1 ms	384 KB	Output is correct
14	Correct	1 ms	336 KB	Output is correct
15	Correct	1 ms	336 KB	Output is correct
16	Incorrect	1 ms	336 KB	Output isn't correct
17	Halted	0 ms	0 KB	-

Subtask #2

0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	336 KB	Output is correct
2	Correct	1 ms	336 KB	Output is correct
3	Correct	1 ms	336 KB	Output is correct
4	Correct	1 ms	568 KB	Output is correct
5	Correct	1 ms	336 KB	Output is correct
6	Correct	1 ms	336 KB	Output is correct
7	Correct	1 ms	336 KB	Output is correct
8	Correct	1 ms	336 KB	Output is correct
9	Correct	1 ms	336 KB	Output is correct
10	Correct	1 ms	336 KB	Output is correct
11	Correct	1 ms	336 KB	Output is correct
12	Correct	1 ms	336 KB	Output is correct
13	Correct	1 ms	384 KB	Output is correct
14	Correct	1 ms	336 KB	Output is correct
15	Correct	1 ms	336 KB	Output is correct
16	Incorrect	1 ms	336 KB	Output isn't correct
17	Halted	0 ms	0 KB	-

Subtask #3

0 / 45.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	336 KB	Output is correct
2	Correct	1 ms	336 KB	Output is correct
3	Correct	1 ms	336 KB	Output is correct
4	Correct	1 ms	568 KB	Output is correct
5	Correct	1 ms	336 KB	Output is correct
6	Correct	1 ms	336 KB	Output is correct
7	Correct	1 ms	336 KB	Output is correct
8	Correct	1 ms	336 KB	Output is correct
9	Correct	1 ms	336 KB	Output is correct
10	Correct	1 ms	336 KB	Output is correct
11	Correct	1 ms	336 KB	Output is correct
12	Correct	1 ms	336 KB	Output is correct
13	Correct	1 ms	384 KB	Output is correct
14	Correct	1 ms	336 KB	Output is correct
15	Correct	1 ms	336 KB	Output is correct
16	Incorrect	1 ms	336 KB	Output isn't correct
17	Halted	0 ms	0 KB	-