oj.uz

Submission #303907

# Submission time Handle Problem Language Result Execution time Memory
303907 2020-09-20T18:23:44 Z rocks03 Cave (IOI13_cave) C++14
0 / 100
 2 ms 384 KB 
#include "cave.h"
#include<bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void answer(int S[], int D[]);
int tryCombination(int S[]);

void exploreCave(int N){
    int ans[N], d[N];
    for(int i = 0; i < N; i++){
        ans[i] = rng() % 2;
    }
    memset(d, -1, sizeof(d));
    vector<int> mn(N, 0);
    int res = tryCombination(ans);
    while(res != -1){
        for(int i = 0; i < N; i++){
            if(d[i] != -1 || mn[i] > res){
                continue;
            }
            ans[i] ^= 1;
            int res2 = tryCombination(ans);
            if(res2 == -1){
                res = res2;
                break;
            }
            if(res2 < res){
                ans[i] ^= 1;
                d[i] = res2;
            } else if(res == res2){
                mn[i] = res;
                continue;
            } else if(res > res2){
                d[i] = res;
                res = res2;
            }
        }
    }
    for(int i = 0; i < N; i++){
        if(d[i] == -1){
            ans[i] ^= 1;
            d[i] = tryCombination(ans);
            ans[i] ^= 1;
        }
    }
    answer(ans, d);
}

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 384 KB too much calls on tryCombination()
2 Halted 0 ms 0 KB -

Subtask #2
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 384 KB too much calls on tryCombination()
2 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

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

Subtask #4
0 / 30.0

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

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 384 KB too much calls on tryCombination()
2 Halted 0 ms 0 KB -