Submission #1315111

#	Time	Username	Problem	Language	Result	Execution time	Memory
1315111		Agageldi	Cave (IOI13_cave)	C++20	33 / 100	30 ms	528 KiB

cave

#include "bits/stdc++.h"
// #include "grader.c"
#include "cave.h"

#define MAXN 500005

int dr[MAXN], vis[MAXN], st[MAXN];

void exploreCave(int N) {
    for(int i = 0; i < N; i++) {
        dr[i] = i;
        st[i] = 1;
    }
    for(int door = 0; door < N; door++) {
        int p = tryCombination(st);
        if(p == door) {
            for(int j = 0; j < N; j++) {
                if(vis[j]) continue;
                st[j] = 1 - st[j];
                int x1 = tryCombination(st);
                if(x1 != p) {
                    vis[j] = 1;
                    dr[j] = door;
                    break;
                }
            }
        }
        else {
            for(int j = 0; j < N; j++) {
                if(vis[j]) continue;
                st[j] = 1 - st[j];
                int x1 = tryCombination(st);
                if(x1 == door) {
                    st[j] = 1 - st[j];
                    vis[j] = 1;
                    dr[j] = door;
                    break;
                }
            }
        }
    }
    answer(st, dr);
}

• Subtask 1: 12 / 12
• Subtask 2: 0 / 13
• Subtask 3: 21 / 21
• Subtask 4: 0 / 30
• Subtask 5: 0 / 24