oj.uz

Submission #907265

# Submission time Handle Problem Language Result Execution time Memory
907265 2024-01-15T10:30:27 Z Captain_Georgia Cave (IOI13_cave) C++17
100 / 100
 154 ms 736 KB 
#include "cave.h"
 
#include <bits/stdc++.h>
using namespace std;
 
void exploreCave(int n)
{
    int v[n],res[n];
    vector<int>ind;
    for(int i=0;i<n;i++){
        ind.push_back(i);
    }
    for(int i=0;i<n;i++){
        for(auto &j:ind){
            v[j] = 0;
        }
        int k = tryCombination(v);
        ///cerr << k << endl;
        if(k == -1 || k > i){
            for(auto &j:ind){
                v[j] = 1;
            }
            int l = 1 , r = ind.size();
            auto chek = [&](int ml,int mr) -> bool {
                for(int j=ml;j<=mr;j++){
                    v[ind[j]]++;
                    v[ind[j]]%=2;
                    ///cerr << v[ind[j]] << "    ";
                }
                ///cerr << endl;
                int tmp = tryCombination(v);
                for(int j=ml;j<=mr;j++){
                    v[ind[j]]++;
                    v[ind[j]]%=2;
                    ///cerr << v[ind[j]] << "   ";
                }
                ///cerr << endl;
                return ((tmp > i) || (tmp == -1));
            };
            int ans = -1;
            while(l < r){
                int mid=(l+r)>>1;
                ///cerr<<"typ 0 :: \n";
                if(chek(l-1,mid-1)){
                    r = mid;
                }
                else{
                    l = mid + 1;
                }
            }
            ans = r;
            ///cout<<ind[ans - 1]<<"   "<<ind.size()<<endl;
            assert(ans - 1 < ind.size());
            v[ind[ans - 1]] = 0;
            res[ind[ans - 1]] = i;
            if(find(ind.begin(),ind.end(),ind[ans - 1]) != ind.end())
                ind.erase(find(ind.begin(),ind.end(),ind[ans - 1]));
        }
        else{
            int l = 1 , r = ind.size();
            auto chek = [&](int ml,int mr) -> bool {
                for(int j=ml;j<=mr;j++){
                    v[ind[j]]++;
                    v[ind[j]]%=2;
                    ///cerr << v[ind[j]] << "    ";
                }
                ///cerr << endl;
                int tmp = tryCombination(v);
                ///cerr << tmp << endl;
                for(int j=ml;j<=mr;j++){
                    v[ind[j]]++;
                    v[ind[j]]%=2;
                    ///cerr << v[ind[j]] << "   ";
                }
                ///cerr << endl;
                return ((tmp > i) || (tmp == -1));
            };
            while(l < r){
                int mid=(l+r)>>1;
                ///cerr<<"typ 1 :: \n";
                if(chek(l-1,mid-1)){
                    r = mid;
                }
                else{
                    l = mid + 1;
                }
            }
            int ans = r;
            ///cout<<ind[ans - 1]<<"   "<<ind.size()<<endl;
            res[ind[ans - 1]] = i;
            v[ind[ans - 1]] = 1;
            if(find(ind.begin(),ind.end(),ind[ans - 1]) != ind.end()){
                ind.erase(find(ind.begin(),ind.end(),ind[ans - 1]));
            }
        }
    }
 
    answer(v,res);
}

Compilation message

In file included from /usr/include/c++/10/cassert:44,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:33,
                 from cave.cpp:3:
cave.cpp: In function 'void exploreCave(int)':
cave.cpp:53:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |             assert(ans - 1 < ind.size());
      |                    ~~~~~~~~^~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 472 KB Output is correct
2 Correct 76 ms 348 KB Output is correct
3 Correct 125 ms 604 KB Output is correct
4 Correct 82 ms 348 KB Output is correct
5 Correct 134 ms 604 KB Output is correct
6 Correct 126 ms 604 KB Output is correct
7 Correct 135 ms 612 KB Output is correct
8 Correct 1 ms 352 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 118 ms 612 KB Output is correct
13 Correct 121 ms 604 KB Output is correct
14 Correct 123 ms 604 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 134 ms 604 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 132 ms 604 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 135 ms 596 KB Output is correct
7 Correct 131 ms 604 KB Output is correct
8 Correct 135 ms 604 KB Output is correct
9 Correct 137 ms 604 KB Output is correct
10 Correct 154 ms 604 KB Output is correct
11 Correct 128 ms 604 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 508 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 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 508 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 1 ms 348 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 352 KB Output is correct
19 Correct 1 ms 352 KB Output is correct
20 Correct 19 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 19 ms 348 KB Output is correct
24 Correct 19 ms 348 KB Output is correct
25 Correct 19 ms 508 KB Output is correct
26 Correct 1 ms 444 KB Output is correct
27 Correct 0 ms 440 KB Output is correct
28 Correct 18 ms 352 KB Output is correct
29 Correct 1 ms 532 KB Output is correct
30 Correct 24 ms 516 KB Output is correct
31 Correct 18 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 19 ms 348 KB Output is correct
36 Correct 20 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 472 KB Output is correct
2 Correct 76 ms 348 KB Output is correct
3 Correct 125 ms 604 KB Output is correct
4 Correct 82 ms 348 KB Output is correct
5 Correct 134 ms 604 KB Output is correct
6 Correct 126 ms 604 KB Output is correct
7 Correct 135 ms 612 KB Output is correct
8 Correct 1 ms 352 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 118 ms 612 KB Output is correct
13 Correct 121 ms 604 KB Output is correct
14 Correct 123 ms 604 KB Output is correct
15 Correct 134 ms 604 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 132 ms 604 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 135 ms 596 KB Output is correct
21 Correct 131 ms 604 KB Output is correct
22 Correct 135 ms 604 KB Output is correct
23 Correct 137 ms 604 KB Output is correct
24 Correct 154 ms 604 KB Output is correct
25 Correct 128 ms 604 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 1 ms 508 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 1 ms 348 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 352 KB Output is correct
44 Correct 1 ms 352 KB Output is correct
45 Correct 19 ms 348 KB Output is correct
46 Correct 1 ms 348 KB Output is correct
47 Correct 1 ms 348 KB Output is correct
48 Correct 19 ms 348 KB Output is correct
49 Correct 19 ms 348 KB Output is correct
50 Correct 19 ms 508 KB Output is correct
51 Correct 1 ms 444 KB Output is correct
52 Correct 0 ms 440 KB Output is correct
53 Correct 18 ms 352 KB Output is correct
54 Correct 1 ms 532 KB Output is correct
55 Correct 24 ms 516 KB Output is correct
56 Correct 18 ms 348 KB Output is correct
57 Correct 1 ms 348 KB Output is correct
58 Correct 1 ms 348 KB Output is correct
59 Correct 1 ms 348 KB Output is correct
60 Correct 19 ms 348 KB Output is correct
61 Correct 20 ms 348 KB Output is correct
62 Correct 1 ms 348 KB Output is correct
63 Correct 82 ms 600 KB Output is correct
64 Correct 81 ms 592 KB Output is correct
65 Correct 126 ms 604 KB Output is correct
66 Correct 82 ms 348 KB Output is correct
67 Correct 134 ms 604 KB Output is correct
68 Correct 118 ms 604 KB Output is correct
69 Correct 134 ms 604 KB Output is correct
70 Correct 0 ms 348 KB Output is correct
71 Correct 0 ms 348 KB Output is correct
72 Correct 120 ms 604 KB Output is correct
73 Correct 120 ms 604 KB Output is correct
74 Correct 118 ms 604 KB Output is correct
75 Correct 134 ms 604 KB Output is correct
76 Correct 0 ms 348 KB Output is correct
77 Correct 0 ms 348 KB Output is correct
78 Correct 132 ms 596 KB Output is correct
79 Correct 133 ms 604 KB Output is correct
80 Correct 136 ms 604 KB Output is correct
81 Correct 138 ms 604 KB Output is correct
82 Correct 146 ms 616 KB Output is correct
83 Correct 125 ms 604 KB Output is correct
84 Correct 1 ms 348 KB Output is correct
85 Correct 18 ms 508 KB Output is correct
86 Correct 113 ms 736 KB Output is correct
87 Correct 1 ms 348 KB Output is correct
88 Correct 1 ms 348 KB Output is correct
89 Correct 21 ms 348 KB Output is correct
90 Correct 19 ms 512 KB Output is correct
91 Correct 20 ms 512 KB Output is correct
92 Correct 128 ms 604 KB Output is correct
93 Correct 134 ms 604 KB Output is correct
94 Correct 136 ms 604 KB Output is correct
95 Correct 1 ms 348 KB Output is correct
96 Correct 1 ms 440 KB Output is correct
97 Correct 119 ms 604 KB Output is correct
98 Correct 19 ms 348 KB Output is correct
99 Correct 119 ms 604 KB Output is correct
100 Correct 1 ms 348 KB Output is correct
101 Correct 19 ms 348 KB Output is correct
102 Correct 18 ms 348 KB Output is correct
103 Correct 116 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 348 KB Output is correct
107 Correct 19 ms 512 KB Output is correct
108 Correct 19 ms 348 KB Output is correct
109 Correct 126 ms 604 KB Output is correct
110 Correct 129 ms 604 KB Output is correct
111 Correct 1 ms 348 KB Output is correct