# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
677911 | qwerasdfzxcl | Remittance (JOI19_remittance) | C++17 | 1 ms | 340 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>
typedef long long ll;
using namespace std;
int n;
void NO(){
printf("No\n");
exit(0);
}
int main(){
scanf("%d", &n);
vector<int> a, b;
for (int i=0;i<n;i++){
int x, y;
scanf("%d %d", &x, &y);
a.push_back(x);
b.push_back(y);
}
for (int i=0;i<1;i++){
ll aS = 0, bS = 0;
for (int j=0;j<n;j++){
aS += (ll)a[j] * (1<<j);
bS += (ll)b[j] * (1<<j);
}
if (aS!=0 && bS==0) NO();
if (aS < bS) NO();
if ((aS - bS) % ((1LL<<n)-1) != 0) NO();
rotate(a.begin(), a.begin()+1, a.end());
rotate(b.begin(), b.begin()+1, b.end());
}
printf("Yes\n");
return 0;
}
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... |