제출 #857491

#제출 시각아이디문제언어결과실행 시간메모리
857491chilinhxyzabc동굴 (IOI13_cave)C++17
0 / 100
137 ms504 KiB
#include <bits/stdc++.h>
#include "cave.h"
using namespace std; 

int Try(int id, int s[]) {
    s[id] = 1 - s[id];
    int door = tryCombination(s);
    s[id] = 1 - s[id];
    return door;
}

void exploreCave(int n) {
    int s[n], d[n];
    for(int i = 0; i < n; i++) {
        d[i] = -1;
    }
    int curDoor = tryCombination(s);
    int curId = 0;
    while(curDoor != -1) {
        while(curId < n && Try(curId, s) != curDoor) {
            curId++;
        }
        d[curId - 1] = curDoor;
        s[curId - 1] = 1 - s[curId - 1];
        curDoor = tryCombination(s);
    }
    for(int i = 0; i < n; i++) {
        if(d[i] == -1) {
            s[i] = 1 - s[i];
            d[i] = tryCombination(s);
            s[i] = 1 - 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...