oj.uz

Submission #962656

# Submission time Handle Problem Language Result Execution time Memory
962656 2024-04-14T06:24:01 Z danikoynov Cave (IOI13_cave) C++14
100 / 100
 689 ms 868 KB 
#include "cave.h"
#include<bits/stdc++.h>

using namespace std;
typedef long long ll;

const int maxn = 5010;

int used[maxn], s[maxn], d[maxn], b[maxn];
int arr[maxn];

int try_comb(vector < int > v)
{
     for (int i = 0; i < v.size(); i ++)
          arr[i] = v[i];
     return tryCombination(arr);
}
void exploreCave(int N)
{

     for (int pos = 0; pos < N; pos ++)
     {
          vector < int > comb;
          int bit = 0;
          for (int i = 0; i < N; i ++)
          {
               if (!used[i])
                    comb.push_back(bit);
               else
                    comb.push_back(b[i]);
          }

          int door = try_comb(comb);
          if (door != -1 && door <= pos)
               bit ^= 1;

               ///cout << bit << endl;
          comb.clear();
          int lf = 0, rf = N - 1;
          while(lf <= rf)
          {
               int mf = (lf + rf) / 2;
               comb.clear();
               for (int i = 0; i <= mf; i ++)
               {
                    if (!used[i])
                         comb.push_back(bit);
                    else
                         comb.push_back(b[i]);
               }
               for (int i = mf + 1; i < N; i ++)
               {
                    if (!used[i])
                         comb.push_back(bit ^ 1);
                    else
                         comb.push_back(b[i]);
               }

               int ret = try_comb(comb);
               /**for (int i = 0; i < comb.size(); i ++)
                    cout << comb[i] << " ";
               cout << endl;
               cout << "ret " << ret << endl;*/
               if (ret != -1 && ret <= pos)
                    lf = mf + 1;
               else
                    rf = mf - 1;
          }

          used[lf] = 1;
          s[lf] = pos;
          b[lf] = bit;
          //cout << "found " << lf << " " << bit << " " << pos << endl;
     }
     /**for (int i = 0; i < N; i ++)
     {
          cout << b[i] << " ";
     }
     cout << endl;
     for (int i = 0; i < N; i ++)
     {
          cout << s[i] << " ";
     }
     cout << endl;*/
     answer(b, s);
}

Compilation message

cave.cpp: In function 'int try_comb(std::vector<int>)':
cave.cpp:14:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   14 |      for (int i = 0; i < v.size(); i ++)
      |                      ~~^~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 310 ms 576 KB Output is correct
2 Correct 338 ms 620 KB Output is correct
3 Correct 495 ms 640 KB Output is correct
4 Correct 330 ms 588 KB Output is correct
5 Correct 572 ms 608 KB Output is correct
6 Correct 500 ms 636 KB Output is correct
7 Correct 501 ms 600 KB Output is correct
8 Correct 1 ms 432 KB Output is correct
9 Correct 1 ms 608 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 503 ms 860 KB Output is correct
13 Correct 495 ms 636 KB Output is correct
14 Correct 490 ms 608 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 517 ms 596 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 535 ms 640 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 559 ms 864 KB Output is correct
7 Correct 571 ms 632 KB Output is correct
8 Correct 642 ms 604 KB Output is correct
9 Correct 659 ms 852 KB Output is correct
10 Correct 680 ms 848 KB Output is correct
11 Correct 541 ms 868 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 604 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 436 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 464 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 604 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 436 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 464 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 68 ms 540 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 356 KB Output is correct
23 Correct 83 ms 524 KB Output is correct
24 Correct 83 ms 348 KB Output is correct
25 Correct 89 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 600 KB Output is correct
28 Correct 73 ms 528 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 70 ms 348 KB Output is correct
31 Correct 72 ms 524 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 1 ms 600 KB Output is correct
35 Correct 83 ms 604 KB Output is correct
36 Correct 83 ms 528 KB Output is correct
37 Correct 0 ms 344 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 310 ms 576 KB Output is correct
2 Correct 338 ms 620 KB Output is correct
3 Correct 495 ms 640 KB Output is correct
4 Correct 330 ms 588 KB Output is correct
5 Correct 572 ms 608 KB Output is correct
6 Correct 500 ms 636 KB Output is correct
7 Correct 501 ms 600 KB Output is correct
8 Correct 1 ms 432 KB Output is correct
9 Correct 1 ms 608 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 503 ms 860 KB Output is correct
13 Correct 495 ms 636 KB Output is correct
14 Correct 490 ms 608 KB Output is correct
15 Correct 517 ms 596 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 535 ms 640 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 559 ms 864 KB Output is correct
21 Correct 571 ms 632 KB Output is correct
22 Correct 642 ms 604 KB Output is correct
23 Correct 659 ms 852 KB Output is correct
24 Correct 680 ms 848 KB Output is correct
25 Correct 541 ms 868 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 604 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 0 ms 436 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 464 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 344 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 1 ms 344 KB Output is correct
44 Correct 1 ms 348 KB Output is correct
45 Correct 68 ms 540 KB Output is correct
46 Correct 1 ms 344 KB Output is correct
47 Correct 1 ms 356 KB Output is correct
48 Correct 83 ms 524 KB Output is correct
49 Correct 83 ms 348 KB Output is correct
50 Correct 89 ms 348 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Correct 1 ms 600 KB Output is correct
53 Correct 73 ms 528 KB Output is correct
54 Correct 1 ms 348 KB Output is correct
55 Correct 70 ms 348 KB Output is correct
56 Correct 72 ms 524 KB Output is correct
57 Correct 1 ms 344 KB Output is correct
58 Correct 1 ms 344 KB Output is correct
59 Correct 1 ms 600 KB Output is correct
60 Correct 83 ms 604 KB Output is correct
61 Correct 83 ms 528 KB Output is correct
62 Correct 0 ms 344 KB Output is correct
63 Correct 316 ms 624 KB Output is correct
64 Correct 319 ms 600 KB Output is correct
65 Correct 491 ms 868 KB Output is correct
66 Correct 324 ms 856 KB Output is correct
67 Correct 513 ms 636 KB Output is correct
68 Correct 477 ms 848 KB Output is correct
69 Correct 513 ms 636 KB Output is correct
70 Correct 1 ms 348 KB Output is correct
71 Correct 0 ms 348 KB Output is correct
72 Correct 495 ms 612 KB Output is correct
73 Correct 475 ms 636 KB Output is correct
74 Correct 495 ms 600 KB Output is correct
75 Correct 550 ms 604 KB Output is correct
76 Correct 0 ms 348 KB Output is correct
77 Correct 1 ms 348 KB Output is correct
78 Correct 536 ms 600 KB Output is correct
79 Correct 555 ms 604 KB Output is correct
80 Correct 652 ms 604 KB Output is correct
81 Correct 638 ms 600 KB Output is correct
82 Correct 689 ms 636 KB Output is correct
83 Correct 553 ms 600 KB Output is correct
84 Correct 1 ms 348 KB Output is correct
85 Correct 69 ms 532 KB Output is correct
86 Correct 487 ms 604 KB Output is correct
87 Correct 1 ms 348 KB Output is correct
88 Correct 1 ms 348 KB Output is correct
89 Correct 91 ms 532 KB Output is correct
90 Correct 83 ms 348 KB Output is correct
91 Correct 82 ms 348 KB Output is correct
92 Correct 653 ms 852 KB Output is correct
93 Correct 668 ms 644 KB Output is correct
94 Correct 644 ms 640 KB Output is correct
95 Correct 1 ms 604 KB Output is correct
96 Correct 1 ms 344 KB Output is correct
97 Correct 498 ms 604 KB Output is correct
98 Correct 73 ms 348 KB Output is correct
99 Correct 537 ms 608 KB Output is correct
100 Correct 1 ms 344 KB Output is correct
101 Correct 70 ms 520 KB Output is correct
102 Correct 69 ms 516 KB Output is correct
103 Correct 503 ms 604 KB Output is correct
104 Correct 1 ms 348 KB Output is correct
105 Correct 1 ms 348 KB Output is correct
106 Correct 1 ms 344 KB Output is correct
107 Correct 84 ms 528 KB Output is correct
108 Correct 81 ms 344 KB Output is correct
109 Correct 644 ms 636 KB Output is correct
110 Correct 665 ms 636 KB Output is correct
111 Correct 0 ms 348 KB Output is correct