oj.uz

Submission #299102

# Submission time Handle Problem Language Result Execution time Memory
299102 2020-09-14T13:34:30 Z erd1 Cave (IOI13_cave) C++14
25 / 100
 1123 ms 760 KB 
#include "cave.h"

#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define pb push_back
typedef int64_t lld;
typedef pair<int, int> pii;

vector<int> v;
int query[5000] = {}, ans[5000] = {}, pos[5000] = {};
void exploreCave(int N){
  v.resize(N);
  fill(all(v), 1);
  for(int i = 0; i < N; i++){
    for(int j = 0; j < N; j++)
      query[j] = ans[j] || v[j];
    bool correct = (tryCombination(query) != i);
    int l = 0, r = N+1;
    while(r-l > 1){
      for(int j = 0; j < N; j++)
        query[j] = ans[j] || (v[j] && (j < (l+r)/2?correct:!correct));
      if(tryCombination(query) == i)l = (l+r)/2;
      else r = (l+r)/2;
    }
    v[l] = 0;
    ans[i] = correct;
    pos[l] = i;
  }
  answer(ans, pos);
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 403 ms 632 KB Output is correct
2 Correct 415 ms 508 KB Output is correct
3 Correct 596 ms 504 KB Output is correct
4 Correct 401 ms 504 KB Output is correct
5 Correct 588 ms 760 KB Output is correct
6 Correct 604 ms 632 KB Output is correct
7 Correct 588 ms 504 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 1069 ms 652 KB Output is correct
13 Correct 1053 ms 760 KB Output is correct
14 Correct 1043 ms 644 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 597 ms 644 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 634 ms 640 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 571 ms 640 KB Output is correct
7 Correct 693 ms 648 KB Output is correct
8 Correct 1119 ms 660 KB Output is correct
9 Correct 1123 ms 760 KB Output is correct
10 Correct 1114 ms 636 KB Output is correct
11 Correct 700 ms 632 KB Output is correct

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 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Incorrect 1 ms 384 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 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Incorrect 1 ms 384 KB Answer is wrong
6 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 403 ms 632 KB Output is correct
2 Correct 415 ms 508 KB Output is correct
3 Correct 596 ms 504 KB Output is correct
4 Correct 401 ms 504 KB Output is correct
5 Correct 588 ms 760 KB Output is correct
6 Correct 604 ms 632 KB Output is correct
7 Correct 588 ms 504 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 1069 ms 652 KB Output is correct
13 Correct 1053 ms 760 KB Output is correct
14 Correct 1043 ms 644 KB Output is correct
15 Correct 597 ms 644 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 634 ms 640 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 571 ms 640 KB Output is correct
21 Correct 693 ms 648 KB Output is correct
22 Correct 1119 ms 660 KB Output is correct
23 Correct 1123 ms 760 KB Output is correct
24 Correct 1114 ms 636 KB Output is correct
25 Correct 700 ms 632 KB Output is correct
26 Correct 0 ms 384 KB Output is correct
27 Correct 0 ms 384 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Incorrect 1 ms 384 KB Answer is wrong
31 Halted 0 ms 0 KB -