| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 817998 | OAleksa | 동굴 (IOI13_cave) | C++14 | 0 ms | 0 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>
//#include "factories.h"
//#include "wall.h"
#include "cave.h"
#define f first
#define s second
#define int long long
using namespace std;
// const int maxn = 5010;
// vector<int> kurac(maxn), kurac2(maxn);
// int n;
// int tryCombination(int s[]) {
// int x = 1;
// for(int i = 0;i < n;i++) {
// if(kurac[i] == s[i])
// ++x;
// else
// break;
// }
// if(x == n)
// x = -1;
// return x;
// }
void exploreCave(int N) {
int s[N], d[N];
for(int i = 0;i < N;i++)
s[i] = 0;
for(int i = 0;i < N;i++)
d[i] = -1;
vector<int> vis(N);
for(int i = 1;i <= N;i++) {
//trazim suprotno od o
int l = 0, r = N - 1;
int br = tryCombination(s);
int o = (br > i || br == -1);
while(l < r) {
int mid = (l + r) / 2;
for(int j = l;j <= mid;j++) {
if(!vis[j])
s[j] = !s[j];
}
br = tryCombination(s);
int o1 = (br > i || br == -1);
if(o != o1)
r = mid;
else
l = mid + 1;
o = o1;
}
vis[l] = 1;
s[l] = !s[l];
d[l] = i;
}
answer(s, d);
}
// signed main()
// {
// ios_base::sync_with_stdio(false);
// cin.tie(0);
// cout.tie(0);
// int tt = 1;
// //cin >> tt;
// while(tt--) {
// cin >> n;
// for(int i = 0;i < n;i++)
// cin >> kurac[i];
// for(int i = 0;i < n;i++)
// cin >> kurac2[i];
// exploreCave(n);
// }
// return 0;
// }