# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
417631 | Trickster | Cave (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.
//Suleyman Atayew
#include <algorithm>
#include <iostream>
#include <string.h>
#include <stdio.h>
#include <vector>
#include <bitset>
#include <queue>
#include <cmath>
#include <map>
#include <set>
#define maxN 200010
#define ff first
#define ss second
#define pb push_back
#define ll long long
#define mod 1000000007
#define pii pair <int, int>
#define sz(a) (int)(a.size())
ll bigmod(ll a, ll b) { if(b==0)return 1; ll ret = bigmod(a, b/2); return ret * ret % mod * (b%2 ? a : 1) % mod; }
using namespace std;
int n;
pii arr[maxN];
void exploreCave(int N) {
n = N;
for(int i = 0; i < n; i++) arr[i].ff = -1;
for(int i = 0; i < n; i++) {
vector <int> cur;
for(int h = 0; h < n; h++) {
if(arr[h].ff == -1) cur.pb(0);
else cur.pb(arr[h].ss);
}
int x = tryCombination(cur);
int tp = 0;
if(x == i) tp = 1;
int l = 1, r = n, md;
while(l <= r) {
md = (l+r)/2;
vector <int> cur;
for(int h = 0; h < n; h++) {
if(arr[h].ff == -1) cur.pb(tp);
else cur.pb(arr[h].ss);
}
int x = tryCombination(cur);
if(x > i) {
l = md+1;
ans = md;
} else {
r = md-1;
}
}
arr[ans] = {tp, i};
}
vector <int> S, D;
for(int i = 0; i < n; i++) S.pb(arr[i].ff), D.pb(arr[i].ss);
answer(S, D);
}