oj.uz

Submission #303918

# Submission time Handle Problem Language Result Execution time Memory
303918 2020-09-20T18:59:53 Z rocks03 Cave (IOI13_cave) C++14
13 / 100
 109 ms 640 KB 
#include "cave.h"
#include<bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ff first
#define ss second
#define pb push_back
#define SZ(x) ((int) (x).size())
using namespace std;

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

int recur(int res, int l, int r, vector<int>&v, int ans[]){
    if(l == r){
        return v[l];
    }
    int m = (l + r) / 2;
    for(int i = l; i <= m; i++){
        ans[v[i]] ^= 1;
    }
    int res2 = tryCombination(ans);
    for(int i = l; i <= m; i++){
        ans[v[i]] ^= 1;
    }
    if(res != res2){
        return recur(res, l, m, v, ans);
    } else{
        return recur(res, m+1, r, v, ans);
    }
}

void exploreCave(int N){
    int ans[N], d[N];
    memset(ans, 0, sizeof(ans));
    memset(d, -1, sizeof(d));
    while(true){
        vector<int> v;
        for(int i = 0; i < N; i++){
            if(d[i] == -1){
                v.pb(i);
            }
        }
        if(!SZ(v)) break;
        int res = tryCombination(ans);
        if(res == -1) break;
        int get = recur(res, 0, SZ(v) - 1, v, ans);
        d[get] = res;
        ans[get] ^= 1;
    }
    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 109 ms 476 KB Answer is wrong
2 Halted 0 ms 0 KB -

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 512 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 13 ms 512 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 11 ms 512 KB Output is correct
7 Correct 11 ms 512 KB Output is correct
8 Correct 15 ms 512 KB Output is correct
9 Correct 16 ms 640 KB Output is correct
10 Correct 15 ms 512 KB Output is correct
11 Correct 11 ms 512 KB Output is correct

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Incorrect 1 ms 256 KB Answer is wrong
8 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Incorrect 1 ms 256 KB Answer is wrong
8 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Incorrect 109 ms 476 KB Answer is wrong
2 Halted 0 ms 0 KB -