Submission #623857

#TimeUsernameProblemLanguageResultExecution timeMemory
623857qwerasdfzxclCave (IOI13_cave)C++14
63 / 100
2080 ms504 KiB
#include <bits/stdc++.h> #include "cave.h" using namespace std; typedef long long ll; int a[5050], rans[5050]; bool used[5050]; void exploreCave(int n) { for (int i=0;i<n;i++){ int ret = tryCombination(a), ans1 = 0, ans2 = 0; if (ret > i || ret==-1) ans1 = 0; else ans1 = 1; for (int j=0;j<13;j++){ for (int k=0;k<n;k++) if (!used[k] && (k&(1<<j))){ a[k] = 1; } ret = tryCombination(a); if (ret==i) ans2 |= (1<<j); for (int k=0;k<n;k++) if (!used[k] && (k&(1<<j))){ a[k] = 0; } } if (ans1) ans2 ^= (1<<13)-1; a[ans2] = ans1; used[ans2] = 1; rans[ans2] = i; } answer(a, rans); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...