oj.uz

Submission #535610

# Submission time Handle Problem Language Result Execution time Memory
535610 2022-03-10T16:36:36 Z michao Remittance (JOI19_remittance) C++14
0 / 100
 1 ms 340 KB 
#include <bits/stdc++.h>
#define int long long
#define mp make_pair
#define pb push_back
#define ld long double
#define pii pair<int,int>
#define sz(x) (int)x.size()
#define piii pair<pii,pii>
#define precise cout<<fixed<<setprecision(10)
#define st first
#define nd second
#define ins insert
#define vi vector<int>
#define BOOST ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
using namespace std;
const int inf=(int)1e18+9;
const int MAX=1e6+5;
int a[MAX];
int b[MAX];
int32_t main(){
  BOOST;
  int n;
  cin>>n;
  for (int i=0;i<n;i++)cin>>a[i]>>b[i];
  
  for (int ile=1;ile<=40;ile++){
		for (int i=0;i<n;i++){
			int x=max(0LL,a[i]-b[i])/2;
			a[i]-=x*2;
			a[(i+1)%n]+=x;
		}
  }
  bool f1=true,f2=true,maxi=-inf;
  for (int i=0;i<n;i++){
		if (a[i]!=b[i])f1=false;
		if (a[i]-b[i]!=1)f2=false;
  }
  if ((maxi-2>=0 && f2) || f1)cout<<"Yes";
  else cout<<"No";
  return 0; 
}

Subtask #1
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 336 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Incorrect 0 ms 340 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 336 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Incorrect 0 ms 340 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #3
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 336 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Incorrect 0 ms 340 KB Output isn't correct
9 Halted 0 ms 0 KB -