Submission #992812

#TimeUsernameProblemLanguageResultExecution timeMemory
992812Yazan_SACave (IOI13_cave)C++17
0 / 100
8 ms528 KiB
#include "cave.h" #include<bits/stdc++.h> #define endl "\n" // /*/*(last choice)*/ #define int long long #define all(x) x.begin(), x.end() #define ll long long using namespace std; /* int tryCombination(int S[]); void answer(int S[], int D[]); void exploreCave(int N); */ void exploreCave(int N) { int d[N]={},s[N]={}; for(int i=0; i<N; i++){ s[i]=1; d[i]=tryCombination(s)-1; 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...