# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
677898 | qwerasdfzxcl | Remittance (JOI19_remittance) | C++17 | 1085 ms | 8180 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;
map<vector<char>, bool> visited;
int n;
void dfs(vector<char> a){
visited[a] = 1;
for (int i=0;i<n;i++){
for (int j=1;j*2<=a[i];j++){
auto na = a;
na[i] -= j*2;
na[(i+1)%n] += j;
if (!visited[na]) dfs(na);
}
}
}
int main(){
scanf("%d", &n);
vector<char> 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);
}
dfs(a);
if (visited[b]) printf("Yes\n");
else printf("No\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... |