# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
433869 | ismoilov | Remittance (JOI19_remittance) | C++14 | 1 ms | 204 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define IOS ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define all(x) (x).begin(), (x).end()
#define fp(a,i,c) for(int (a) = (i); (a) < (c); (a)++)
#define fpp(a,i,c) for(int (a) = (i); (a) <= (c); (a)++)
#define fm(a,i,c) for(int (a) = (i); (a) > (c); (a)--)
#define fmm(a,i,c) for(int (a) = (i); (a) >= (c); (a)--)
bool check(int n)
{
if(n==0)
return 1;
return (ceil(log2(n)) == floor(log2(n)));
}
void S()
{
int n;
cin >> n;
vector <int> b(n);
fp(i,0,n){
int x, y;
cin >> x >> y;
b[i] = x - y;
}
/*if(done){
cout << "Yes";
return;
}*/
// cout << endl;
bool yes = 0;
fp(i,0,n){
vector <int> a;
a = b;
if(a[i] < 0)
continue;
int s = a[i] / 2;
a[i] %= 2;
bool ok = 1;
// cout << i << " " << s << endl;
fpp(j,1,2*n){
a[(i+j)%n] += s;
// cout << i << " " << j << " " << a[(i+j)%n] << " " << s << endl;
if(a[(i+j)%n] < 0){
ok = 0;
break;
}
s = a[(i+j)%n]/2;
a[(i+j)%n] %= 2;
if(j > n)
ok &= (a[(i+j)%n] == 0);
}
yes |= (ok && s == 0);
}
cout << (yes ? "Yes" : "No");
}
int main()
{
IOS;
S();
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |