Submission #1141022

#TimeUsernameProblemLanguageResultExecution timeMemory
1141022AliyyiakbarCave (IOI13_cave)C++20
0 / 100
36 ms516 KiB
#include "cave.h"
#include "bits/stdc++.h"
using namespace std;

void exploreCave(int n)
{
    int s[n], d[n];
    memset(s, 0, sizeof(s));
    for (int i = 0; i < n; ++i)
    {
        int from = tryCombination(s);
        if (from == -1)     break;
        for (int j = 0; j < n; ++j)
        {
            s[j] = !s[j];
            int to = tryCombination(s);
            if (to == -1 || to > from)
            {
                break;
            }
            s[j] = !s[j];
        }
    }
    // assert(tryCombination(s) == -1);
    for (int i = 0; i < n; ++i)
    {
        s[i] = !s[i];
        int pos = tryCombination(s);
        d[pos] = i;
        s[i] = !s[i];
    }
    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...