oj.uz

Submission #303942

# Submission time Handle Problem Language Result Execution time Memory
303942 2020-09-20T19:57:02 Z rocks03 Cave (IOI13_cave) C++14
13 / 100
 236 ms 504 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[]);

pii recur(int res, int l, int r, vector<int>&v, int ans[]){
    if(l == r){
        if(res == -1){
            ans[v[l]] ^= 1;
        }
        return {v[l], tryCombination(ans)};
    }
    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(res2 == res){
        return recur(res, m+1, r, v, ans);
    } else if(res2 == -1 || res2 > res){
        return recur(res, l, m, v, ans);
    } else if(res2 < res){
        for(int i = l; i <= m; i++){
            ans[v[i]] ^= 1;
        }
        pii p = recur(res2, l, m, v, ans);
        for(int i = l; i <= m; i++){
            ans[v[i]] ^= 1;
        }
        return p;
    }
}

void exploreCave(int N){
    int ans[N], d[N];
    memset(ans, 0, sizeof(ans));
    memset(d, -1, sizeof(d));
    vector<int> v(N);
    iota(v.begin(), v.end(), 0);
    while(SZ(v)){
        pii p = recur(tryCombination(ans), 0, SZ(v) - 1, v, ans);
        d[p.ff] = p.ss;
        ans[p.ff] ^= 1;
        v.erase(find(v.begin(), v.end(), p.ff));
    }
    answer(ans, d);
}

Compilation message

cave.cpp: In function 'std::pair<int, int> recur(int, int, int, std::vector<int>&, int*)':
cave.cpp:44:1: warning: control reaches end of non-void function [-Wreturn-type]
   44 | }
      | ^

Subtask #1
0 / 12.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 228 ms 504 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 188 ms 472 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 233 ms 476 KB Output is correct
7 Correct 236 ms 504 KB Output is correct
8 Correct 176 ms 504 KB Output is correct
9 Correct 175 ms 472 KB Output is correct
10 Correct 177 ms 504 KB Output is correct
11 Correct 234 ms 504 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 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Incorrect 1 ms 256 KB Answer is wrong
6 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 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Incorrect 1 ms 256 KB Answer is wrong
6 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

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