Submission #290615

#TimeUsernameProblemLanguageResultExecution timeMemory
290615Ruba_KCave (IOI13_cave)C++14
0 / 100
73 ms512 KiB
#include "cave.h" #include<bits/stdc++.h> using namespace std ; void exploreCave(int N) { int arr[N] = {} , pos[N]; memset(arr , 0 , sizeof arr); for(int i = 0 ; i < N ; i ++){ int ret = tryCombination(arr); for(int j = i + 1 ; j < N ; j ++)arr[j] = 1 ; int ret2 = tryCombination(arr); if(ret == ret2)arr[i] = 1 , pos[i] = ret ; else{ arr[i] = 1 ; ret = tryCombination(arr); pos[i] = ret ; arr[i] = 0 ; } for(int j = i + 1 ; j < N ; j ++) arr[j] = 0 ; } answer(arr , pos); }
#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...