Submission #1310871

#TimeUsernameProblemLanguageResultExecution timeMemory
1310871nataliaa동굴 (IOI13_cave)C++20
12 / 100
39 ms516 KiB
#include "cave.h"
#include<bits/stdc++.h>
using namespace std;
void exploreCave(int N) {
    int v[N]={};
    int a[N] ={};
    int vis[N]={};
    for(int i = 0; i < N; i++) {
        for(int j =0; j < N; j++) {
            if(vis[j]==0) a[j] = 0;
        }
        int ind = 0;
        int k = tryCombination(a);
        if(k==i) ind = 1; 
        for(int j =0; j < N; j++) {
            if(vis[j]==0) a[j] = 1-ind;
        }
        
        vis[i] = 1;
        a[i] = ind;
        v[i] =i;
    }
     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...