Submission #1298420

#TimeUsernameProblemLanguageResultExecution timeMemory
1298420gesp3011v2동굴 (IOI13_cave)C++20
12 / 100
7 ms512 KiB
#include "cave.h"
#include <bits/stdc++.h>
using namespace std;

void exploreCave(int N){
int a[N],b[N];
iota(b,b+N,0);
memset(a,0,sizeof a);
do{
    int ans=tryCombination(a);
    if(ans==-1)break;
    a[ans]=1;
}while(1);
answer(a,b);
}
#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...