Submission #1216663

#TimeUsernameProblemLanguageResultExecution timeMemory
1216663nataliaa동굴 (IOI13_cave)C++20
0 / 100
2 ms332 KiB
#include "cave.h"
#include<bits/stdc++.h>
using namespace std;
void exploreCave(int N) {
    int v[N];
    int a[N] ={};
    for(int i = 0; i < N; i++) v[i]= i;
    for(int i = 0; i < N; i++) {
        int k = tryCombination( a);
        if(k>i) {i = k-1;}
        else {
            if(a[i]==0) a[i]=1;
            else a[i]=0;
        }
    }
    return answer( a,v);
}
#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...