| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 216205 | MODDI | 동굴 (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 "cave.h"
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vl vector<ll>
#define vll vector<pll>
#define vii vector<pii>
using namespace std;
void exploreCave(int n){
int arr[n], door[n];
memset(arr, 0, sizeof(arr));
memset(door,-1,sizeof(door));
bool vis[n][n];
memset(vis,false,sizeof(vis));
while(true){
int pos = tryCombination(arr);
if(pos == -1){
break;
}
else if(vis[pos])
{
int random;
for(int i = 0; i < n; i++){
if(vis[pos][i] == false){
vis[pos][i] = true;
random = i;
break;
}
else
continue;
}
arr[random] = 1 - arr[random];
int pl = tryCombination(arr);
if(pl == -1)
break;
if(pl <= pos)
arr[random] = 1 - arr[random];
else{
door[random] = pos;
vis[pl] = true;
}
}
else{
arr[pos] = 1 - arr[pos];
vis[pos] = true;
}
}
for(int i = 0; i < n; i++){
if(door[i] != -1)
continue;
arr[i] = 1 - arr[i];
int pos = tryCombination(arr);
//for(int j = 0; j < n;j++)
// cout<<arr[j]<<" ";
//cout<<pos<<endl;
door[i] = pos;
arr[i] = 1 - arr[i];
}
answer(arr, door);
}