Submission #1298414

#TimeUsernameProblemLanguageResultExecution timeMemory
1298414scalifrastico_098Cave (IOI13_cave)C++20
12 / 100
13 ms520 KiB
#include "cave.h"
#include <bits/stdc++.h>
using namespace std;
void exploreCave(int n) {
    int a[n], b[n], c[n]; 
    for(int i=0; i<n; i++){b[i]=i;} int s=0;
    for(int i=0; i<n; i++)
    {    
        for(int j=0; j<n; j++)c[j]=0; for(int j=0; j<n; j++)c[j]=a[j];
        c[i]=0;
        int u=tryCombination(c);
        if(u==-1||u>i){a[i]=0;} 
        else{a[i]=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...