Submission #670691

#	Time	Username	Problem	Language	Result	Execution time	Memory
670691		pzorro	Cave (IOI13_cave)	C++14	0 / 100	99 ms	380 KiB

cave

#include <iostream>
#include <bits/stdc++.h>
#include "cave.h"

using namespace std;

const int MAXN = 5 * 1e3;

int s[MAXN];
int d[MAXN];

int troca(int x){
    if(!x) return 1;
    return 0;
}

void exploreCave(int n){
    for(int i = 0; i < n; i++){
        s[i] = 0;
        d[i] = -1;
    }
    int res;
    for(int i = 0; i < n; i++){
        res = tryCombination(s);
        /*if(res == i){
            for(int j = 0; j < n; j++){
                s[i] = troca(s[i]);
                res = tryCombination(s);
                if(res != i)
                    d[j] = i;
            }
        }*/
        if(res!=i){
            for(int i = 0; i < n; i++){
                if(d[i] == -1)
                    troca(s[i]);
            }
        }
        for(int j = 0; j < n; j++){
            s[i] = troca(s[i]);
            res = tryCombination(s);
            if(res != i)
                d[j] = i;
        }
    }
    answer(s, d);
}

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