# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1096320 | vjudge1 | The Xana coup (BOI21_xanadu) | C++17 | 1062 ms | 67924 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<iostream>
//using namespace std;
//const int N=1e5+5;
//int n,ans=N*2,cnt;
//int a[N],head[N];
//struct node{
// int to,next;
//}edge[N*2];
//void add(int u,int v){
// edge[++cnt].to=v;
// edge[cnt].next=head[u];
// head[u]=cnt;
//}
//bool check(){
// for(int i=1;i<=n;i++) if(a[i]) return false;
// return true;
//}
//void dfs(int u,int sum){
// if(check()) ans=min(ans,sum);
// if(u>n) return;
// for(int i=head[u];i;i=edge[i].next){
// int v=edge[i].to;
// a[v]=1-a[v];
// }
// a[u]=1-a[u];
// dfs(u+1,sum+1);
// for(int i=head[u];i;i=edge[i].next){
// int v=edge[i].to;
// a[v]=1-a[v];
// }
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |