# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
479975 | robell | Cave (IOI13_cave) | C++17 | 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.
#pragma GCC optimize("O2")
#include <bits/stdc++.h>
#include "cave.h"
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag, tree_order_statistics_node_update> indexed_set;
typedef long long ll;
#define pb push_back
#define eb emplace_back
#define countbits __builtin_popcount
#define beg0 __builtin_clz
#define terminal0 __builtin_ctz
int mod=1e9+7;
void setIO(){
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
}
void setIO(string f){
freopen((f+".in").c_str(),"r",stdin);
freopen((f+".out").c_str(),"w",stdout);
setIO();
}
void exploreCave(int N){
int pos[N];
memset(pos,0,sizeof(pos));
int ans[N];
for (int i=0;i<N;i++){
pos[i]=1;
for (int j=0;j<N;j++){
if (j!=i){
pos[j]=0;
}
}
int door = tryCombination(pos);
ans[i]=door;
}
int keys[N];
int doors[N];
for (int i=0;i<N;i++){
keys[i]=i;
doors[i]=ans[i];
}
answer(keys,doors);
}
int main(){
setIO();
}