Submission #830412

#TimeUsernameProblemLanguageResultExecution timeMemory
830412irmuunCave (IOI13_cave)C++17
25 / 100
11 ms468 KiB
#include<bits/stdc++.h> #include "cave.h" using namespace std; #define ll long long #define pb push_back #define ff first #define ss second #define all(s) s.begin(),s.end() #define rall(s) s.rbegin(),s.rend() void exploreCave(int n){ int s[n],d[n]; fill(s,s+n,0); int x=tryCombination(s); if(x==-1){//subtask 2 for(int i=0;i<n;i++){ s[i]=1; x=tryCombination(s); d[i]=x; s[i]=0; } answer(s,d); } iota(d,d+n,0); while(x>-1){ s[x]=1-s[x]; x=tryCombination(s); } 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...