Submission #774086

#TimeUsernameProblemLanguageResultExecution timeMemory
774086TrumlingCave (IOI13_cave)C++14
12 / 100
8 ms396 KiB
#include "cave.h"
#include <bits/stdc++.h>
using namespace std; 

typedef long long ll;
#define pb push_back
#define F first
#define S second
#define enter cout<<'\n';
#define INF 99999999999999999
#define MOD 1000000007
#define all(x) x.begin(),x.end()

void exploreCave(int N) 
{
int s[N]={ };
ll i=0;
while(i!=-1)
{
s[i]=(1^s[i]);
i=tryCombination(s);
}
int d[N];
for(int i=0;i<N;i++)
d[i]=i;

answer(s,d);
}
#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...