oj.uz

Submission #135726

# Submission time Handle Problem Language Result Execution time Memory
135726 2019-07-24T10:07:32 Z Talant Cave (IOI13_cave) C++17
100 / 100
 757 ms 768 KB 
#include "cave.h"
//#include "grader.cpp"
#include <bits/stdc++.h>

#define sc second
#define fr first
#define mk make_pair
#define pb push_back

using namespace std;

const int NN = (1e6 + 5);
const int inf = (1e9 + 7);

int n;
int ans[NN],s[NN],u[NN];
int rs[NN];

void exploreCave(int N) {
      n = N;

      for (int i = 0; i < n; i ++) {
            for (int j = 0; j < n; j ++) u[j] = 1;
            for (int j = 0; j < i; j ++) u[ans[j]] = s[ans[j]];

            int last = tryCombination(u);
            int l = 0,r = n - 1,fl = 1;

            while (r - l > 1) {
                  int m = (r + l) >> 1;
                  for (int j = m + 1; j <= r; j ++) u[j] = fl ^ 1;
                  for (int j = 0; j < i; j ++) u[ans[j]] = s[ans[j]];

                  int cur = tryCombination(u);
//                  for (int j = 0; j < n; j ++)
//                        cout << u[j] << " ";
//                  cout << endl;
//                  cout << l << " " << r << " " << cur << endl;
                  if ((cur != i && last != i) || (cur == i && last == i)) r = m;
                  else l = m + 1,fl ^= 1;
                  last = cur;
            }
            if (l == r) {
                  ans[i] = l;
                  s[l] = (last == i ? (fl ^ 1) : fl);
            }
            else {
                  u[r] = fl ^ 1;
                  for (int j = 0; j < i; j ++) u[ans[j]] = s[ans[j]];
                  int cur = tryCombination(u);
                  if ((cur == i && last == i) || (cur != i && last != i)) {
                        ans[i] = l;
                        s[l] = (cur == i ? (fl ^ 1) : (fl));
                  }
                  else {
                        ans[i] = r;
                        s[r] = (cur == i ? fl : (fl ^ 1));
                  }
            }
      }
      for (int i = 0; i < n; i ++)
            rs[ans[i]] = i;
      answer(s,rs);
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 437 ms 512 KB Output is correct
2 Correct 443 ms 512 KB Output is correct
3 Correct 681 ms 512 KB Output is correct
4 Correct 446 ms 536 KB Output is correct
5 Correct 632 ms 768 KB Output is correct
6 Correct 622 ms 640 KB Output is correct
7 Correct 673 ms 580 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 512 KB Output is correct
10 Correct 6 ms 512 KB Output is correct
11 Correct 5 ms 512 KB Output is correct
12 Correct 656 ms 640 KB Output is correct
13 Correct 545 ms 640 KB Output is correct
14 Correct 612 ms 508 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 571 ms 588 KB Output is correct
2 Correct 6 ms 512 KB Output is correct
3 Correct 627 ms 544 KB Output is correct
4 Correct 6 ms 452 KB Output is correct
5 Correct 6 ms 512 KB Output is correct
6 Correct 688 ms 516 KB Output is correct
7 Correct 571 ms 548 KB Output is correct
8 Correct 717 ms 640 KB Output is correct
9 Correct 728 ms 532 KB Output is correct
10 Correct 754 ms 524 KB Output is correct
11 Correct 614 ms 520 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 512 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 6 ms 368 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 6 ms 384 KB Output is correct
7 Correct 7 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 512 KB Output is correct
10 Correct 6 ms 512 KB Output is correct
11 Correct 6 ms 384 KB Output is correct
12 Correct 6 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 512 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 6 ms 368 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 6 ms 384 KB Output is correct
7 Correct 7 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 512 KB Output is correct
10 Correct 6 ms 512 KB Output is correct
11 Correct 6 ms 384 KB Output is correct
12 Correct 6 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 512 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 6 ms 512 KB Output is correct
18 Correct 6 ms 384 KB Output is correct
19 Correct 6 ms 332 KB Output is correct
20 Correct 71 ms 516 KB Output is correct
21 Correct 6 ms 384 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 98 ms 512 KB Output is correct
24 Correct 96 ms 512 KB Output is correct
25 Correct 82 ms 384 KB Output is correct
26 Correct 6 ms 384 KB Output is correct
27 Correct 5 ms 512 KB Output is correct
28 Correct 90 ms 484 KB Output is correct
29 Correct 6 ms 384 KB Output is correct
30 Correct 104 ms 516 KB Output is correct
31 Correct 98 ms 512 KB Output is correct
32 Correct 5 ms 512 KB Output is correct
33 Correct 5 ms 512 KB Output is correct
34 Correct 6 ms 384 KB Output is correct
35 Correct 93 ms 512 KB Output is correct
36 Correct 90 ms 620 KB Output is correct
37 Correct 6 ms 384 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 437 ms 512 KB Output is correct
2 Correct 443 ms 512 KB Output is correct
3 Correct 681 ms 512 KB Output is correct
4 Correct 446 ms 536 KB Output is correct
5 Correct 632 ms 768 KB Output is correct
6 Correct 622 ms 640 KB Output is correct
7 Correct 673 ms 580 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 512 KB Output is correct
10 Correct 6 ms 512 KB Output is correct
11 Correct 5 ms 512 KB Output is correct
12 Correct 656 ms 640 KB Output is correct
13 Correct 545 ms 640 KB Output is correct
14 Correct 612 ms 508 KB Output is correct
15 Correct 571 ms 588 KB Output is correct
16 Correct 6 ms 512 KB Output is correct
17 Correct 627 ms 544 KB Output is correct
18 Correct 6 ms 452 KB Output is correct
19 Correct 6 ms 512 KB Output is correct
20 Correct 688 ms 516 KB Output is correct
21 Correct 571 ms 548 KB Output is correct
22 Correct 717 ms 640 KB Output is correct
23 Correct 728 ms 532 KB Output is correct
24 Correct 754 ms 524 KB Output is correct
25 Correct 614 ms 520 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 5 ms 512 KB Output is correct
28 Correct 5 ms 384 KB Output is correct
29 Correct 6 ms 368 KB Output is correct
30 Correct 5 ms 384 KB Output is correct
31 Correct 6 ms 384 KB Output is correct
32 Correct 7 ms 384 KB Output is correct
33 Correct 5 ms 384 KB Output is correct
34 Correct 5 ms 512 KB Output is correct
35 Correct 6 ms 512 KB Output is correct
36 Correct 6 ms 384 KB Output is correct
37 Correct 6 ms 384 KB Output is correct
38 Correct 5 ms 384 KB Output is correct
39 Correct 5 ms 384 KB Output is correct
40 Correct 5 ms 512 KB Output is correct
41 Correct 5 ms 384 KB Output is correct
42 Correct 6 ms 512 KB Output is correct
43 Correct 6 ms 384 KB Output is correct
44 Correct 6 ms 332 KB Output is correct
45 Correct 71 ms 516 KB Output is correct
46 Correct 6 ms 384 KB Output is correct
47 Correct 5 ms 384 KB Output is correct
48 Correct 98 ms 512 KB Output is correct
49 Correct 96 ms 512 KB Output is correct
50 Correct 82 ms 384 KB Output is correct
51 Correct 6 ms 384 KB Output is correct
52 Correct 5 ms 512 KB Output is correct
53 Correct 90 ms 484 KB Output is correct
54 Correct 6 ms 384 KB Output is correct
55 Correct 104 ms 516 KB Output is correct
56 Correct 98 ms 512 KB Output is correct
57 Correct 5 ms 512 KB Output is correct
58 Correct 5 ms 512 KB Output is correct
59 Correct 6 ms 384 KB Output is correct
60 Correct 93 ms 512 KB Output is correct
61 Correct 90 ms 620 KB Output is correct
62 Correct 6 ms 384 KB Output is correct
63 Correct 383 ms 644 KB Output is correct
64 Correct 403 ms 468 KB Output is correct
65 Correct 669 ms 540 KB Output is correct
66 Correct 410 ms 644 KB Output is correct
67 Correct 602 ms 512 KB Output is correct
68 Correct 647 ms 544 KB Output is correct
69 Correct 528 ms 520 KB Output is correct
70 Correct 5 ms 512 KB Output is correct
71 Correct 6 ms 396 KB Output is correct
72 Correct 661 ms 512 KB Output is correct
73 Correct 690 ms 580 KB Output is correct
74 Correct 485 ms 640 KB Output is correct
75 Correct 598 ms 512 KB Output is correct
76 Correct 6 ms 512 KB Output is correct
77 Correct 5 ms 512 KB Output is correct
78 Correct 555 ms 528 KB Output is correct
79 Correct 621 ms 520 KB Output is correct
80 Correct 727 ms 512 KB Output is correct
81 Correct 662 ms 548 KB Output is correct
82 Correct 727 ms 640 KB Output is correct
83 Correct 679 ms 512 KB Output is correct
84 Correct 5 ms 396 KB Output is correct
85 Correct 91 ms 512 KB Output is correct
86 Correct 594 ms 532 KB Output is correct
87 Correct 6 ms 512 KB Output is correct
88 Correct 5 ms 332 KB Output is correct
89 Correct 76 ms 484 KB Output is correct
90 Correct 93 ms 488 KB Output is correct
91 Correct 104 ms 504 KB Output is correct
92 Correct 654 ms 548 KB Output is correct
93 Correct 660 ms 588 KB Output is correct
94 Correct 707 ms 600 KB Output is correct
95 Correct 5 ms 384 KB Output is correct
96 Correct 5 ms 384 KB Output is correct
97 Correct 641 ms 512 KB Output is correct
98 Correct 91 ms 512 KB Output is correct
99 Correct 500 ms 520 KB Output is correct
100 Correct 5 ms 384 KB Output is correct
101 Correct 94 ms 480 KB Output is correct
102 Correct 101 ms 384 KB Output is correct
103 Correct 600 ms 648 KB Output is correct
104 Correct 6 ms 384 KB Output is correct
105 Correct 6 ms 512 KB Output is correct
106 Correct 7 ms 384 KB Output is correct
107 Correct 108 ms 516 KB Output is correct
108 Correct 93 ms 480 KB Output is correct
109 Correct 757 ms 524 KB Output is correct
110 Correct 753 ms 524 KB Output is correct
111 Correct 6 ms 384 KB Output is correct