oj.uz

Submission #29816

# Submission time Handle Problem Language Result Execution time Memory
29816 2017-07-21T07:50:34 Z Nikefor Cave (IOI13_cave) C++
13 / 100
 29 ms 512 KB 
#include "cave.h"

void exploreCave(int N) {
    int S[N], D[N];
    for(int i=0; i<N; i++) { S[i] = 0; D[i] = -1; }
    if(tryCombination(S)==-1) {
        for(int i=0; i<N; i++) {
            S[i] = 1;
            int d = tryCombination(S);
            D[i] = d;
            S[i] = 0;
        }
    answer(S, D);


    }
    else if(N<=100) {
        while(tryCombination(S)!=-1) {
            int d = tryCombination(S);
            for(int i=0; i<N; i++) {
                if(D[i]!=-1) continue;
                S[i] = 1;
                int t = tryCombination(S);
                if(t<d) D[i] = t;
                if(t>d) { D[i] = d; break;}
                S[i] = 0;
            }
        }
        for(int i=0; i<N; i++) {
            if(D[i]!=-1) continue;
            S[i] = (S[i]+1)%2;
            D[i] = tryCombination(S);
            S[i] = (S[i]+1)%2;

        }
        answer(S, D);

    }
    for(int i=0; i<N; i++) D[i] = i;
    for(int i=0; i<N; i++) {
        if(tryCombination(S)==i) S[i] = 1;
    }
    answer(S, D);
}

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 512 KB Output is correct
2 Correct 18 ms 468 KB Output is correct
3 Correct 18 ms 512 KB Output is correct
4 Correct 19 ms 384 KB Output is correct
5 Correct 27 ms 452 KB Output is correct
6 Correct 17 ms 512 KB Output is correct
7 Correct 29 ms 512 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Incorrect 6 ms 384 KB too much calls on tryCombination()
10 Halted 0 ms 0 KB -

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 384 KB Output is correct
2 Correct 6 ms 460 KB Output is correct
3 Correct 18 ms 384 KB Output is correct
4 Correct 5 ms 460 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 18 ms 384 KB Output is correct
7 Correct 18 ms 512 KB Output is correct
8 Correct 18 ms 384 KB Output is correct
9 Correct 19 ms 384 KB Output is correct
10 Correct 18 ms 400 KB Output is correct
11 Correct 27 ms 512 KB Output is correct

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Incorrect 5 ms 512 KB too much calls on tryCombination()
3 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Incorrect 5 ms 512 KB too much calls on tryCombination()
3 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 384 KB Output is correct
2 Correct 6 ms 460 KB Output is correct
3 Correct 18 ms 384 KB Output is correct
4 Correct 5 ms 460 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 18 ms 384 KB Output is correct
7 Correct 18 ms 512 KB Output is correct
8 Correct 18 ms 384 KB Output is correct
9 Correct 19 ms 384 KB Output is correct
10 Correct 18 ms 400 KB Output is correct
11 Correct 27 ms 512 KB Output is correct
12 Correct 5 ms 512 KB Output is correct
13 Incorrect 5 ms 512 KB too much calls on tryCombination()
14 Halted 0 ms 0 KB -