Submission #774087

#TimeUsernameProblemLanguageResultExecution timeMemory
774087TrumlingCave (IOI13_cave)C++14
13 / 100
9 ms424 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()
//tryCombination
void exploreCave(int N) 
{
int s[N]={ },d[N];
for(int i=0;i<N;i++)
{
    s[i]=1;
    int pos=tryCombination(s);
    d[i]=pos;
    s[i]=0;
}

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...