oj.uz

Submission #461199

# Submission time Handle Problem Language Result Execution time Memory
461199 2021-08-09T13:53:21 Z mtxas Cave (IOI13_cave) C++14
100 / 100
 358 ms 536 KB 
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <string>
#include <deque>
#include <cstring>
#include <math.h>
#include <iomanip>
#include <unordered_map>
#include <map>
#include <queue>
#include <stack>
#include <climits>
#include <bitset>
#include <cave.h>
/****************************************************************************
								MACROS
****************************************************************************/
#define ll long long
#define vi vector<int>
#define pb push_back
#define fi first
#define se second
#define _for(a, b, c) for(int (a) = (b); (a) < (c); ++(a))
#define _foreq(a, b, c) for(int (a) = (b); (a) <= (c); ++(a))
#define _forn(a, b, c) for(int (a) = (b); (a) > (c); (a)--)
#define _forneq(a, b, c) for(int (a) = (b); (a) >= (c); (a)--)
#define turbo() cin.tie(NULL); cout.tie(NULL); ios_base::sync_with_stdio(false)
#define _fre() freopen("input.txt", "r", stdin)
#define sz(x) ((int)x.size())
#define all(a) a.begin(), a.end()
#define PI 3.141592654
#define mem(x, val) memset(x, val, sizeof(x))
#define pii pair<int, int>
#define mii map<int, int>
using namespace std;
/****************************************************************************
							STRUCTS
****************************************************************************/
/****************************************************************************
							VARIABLES
****************************************************************************/
const int maxn =5e3;
bool old[maxn];
int S[maxn], D[maxn];
int n;
/****************************************************************************
							FUNCTIONS
****************************************************************************/

/****************************************************************************
								MAIN
****************************************************************************/
/*int tryCombination(int X[]){
    _for(i, 0, n) cout<<S[i]<<" "; cout<<'\n';
    cout<<"Enter answer: "; int ans; cin>>ans;
    return ans;
}
void answer(int A[], int B[]){
    cout<<"D: "; _for(i, 0, n) cout<<D[i]<<" ";
}*/
void keisk(int l, int r){
    _foreq(i, l, r) if(!old[i]) S[i] = !S[i];
}
int tryComb(int X[]){
    int res = tryCombination(X);
    return (res == -1? n: res);
}
void exploreCave(int N){
    n = N;
    _for(j, 0, n){
        bool wasOpen = tryComb(S) > j;
        int L = 0, R = N-1, k = (L+R)/2;
        while(L<R){
            keisk(L, k); bool isOpen = tryComb(S) > j; keisk(L, k);
            if(isOpen != wasOpen) R = k;
            else L = k+1;
            k = (L+R)/2;
        }
        D[k] = j;
        if(!wasOpen) keisk(k, k); old[k] = 1;
    }
    answer(S, D);
}
/*int main(){
    exploreCave(4);
}*/

Compilation message

cave.cpp: In function 'void keisk(int, int)':
cave.cpp:26:33: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   26 | #define _foreq(a, b, c) for(int (a) = (b); (a) <= (c); ++(a))
      |                                 ^
cave.cpp:64:5: note: in expansion of macro '_foreq'
   64 |     _foreq(i, l, r) if(!old[i]) S[i] = !S[i];
      |     ^~~~~~
cave.cpp: In function 'void exploreCave(int)':
cave.cpp:25:31: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   25 | #define _for(a, b, c) for(int (a) = (b); (a) < (c); ++(a))
      |                               ^
cave.cpp:72:5: note: in expansion of macro '_for'
   72 |     _for(j, 0, n){
      |     ^~~~
cave.cpp:82:9: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   82 |         if(!wasOpen) keisk(k, k); old[k] = 1;
      |         ^~
cave.cpp:82:35: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   82 |         if(!wasOpen) keisk(k, k); old[k] = 1;
      |                                   ^~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 116 ms 392 KB Output is correct
2 Correct 119 ms 396 KB Output is correct
3 Correct 223 ms 408 KB Output is correct
4 Correct 166 ms 400 KB Output is correct
5 Correct 234 ms 404 KB Output is correct
6 Correct 199 ms 524 KB Output is correct
7 Correct 335 ms 332 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 175 ms 408 KB Output is correct
13 Correct 231 ms 408 KB Output is correct
14 Correct 194 ms 408 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 268 ms 536 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 253 ms 412 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 237 ms 408 KB Output is correct
7 Correct 187 ms 408 KB Output is correct
8 Correct 357 ms 404 KB Output is correct
9 Correct 358 ms 408 KB Output is correct
10 Correct 341 ms 408 KB Output is correct
11 Correct 201 ms 408 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 296 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 0 ms 204 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 296 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 27 ms 332 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 42 ms 348 KB Output is correct
24 Correct 43 ms 348 KB Output is correct
25 Correct 43 ms 332 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 296 KB Output is correct
28 Correct 29 ms 332 KB Output is correct
29 Correct 1 ms 316 KB Output is correct
30 Correct 28 ms 368 KB Output is correct
31 Correct 35 ms 332 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 42 ms 332 KB Output is correct
36 Correct 45 ms 332 KB Output is correct
37 Correct 0 ms 204 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 116 ms 392 KB Output is correct
2 Correct 119 ms 396 KB Output is correct
3 Correct 223 ms 408 KB Output is correct
4 Correct 166 ms 400 KB Output is correct
5 Correct 234 ms 404 KB Output is correct
6 Correct 199 ms 524 KB Output is correct
7 Correct 335 ms 332 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 175 ms 408 KB Output is correct
13 Correct 231 ms 408 KB Output is correct
14 Correct 194 ms 408 KB Output is correct
15 Correct 268 ms 536 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 253 ms 412 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 237 ms 408 KB Output is correct
21 Correct 187 ms 408 KB Output is correct
22 Correct 357 ms 404 KB Output is correct
23 Correct 358 ms 408 KB Output is correct
24 Correct 341 ms 408 KB Output is correct
25 Correct 201 ms 408 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 296 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 1 ms 204 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 0 ms 204 KB Output is correct
40 Correct 1 ms 204 KB Output is correct
41 Correct 1 ms 204 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Correct 1 ms 204 KB Output is correct
44 Correct 1 ms 204 KB Output is correct
45 Correct 27 ms 332 KB Output is correct
46 Correct 1 ms 204 KB Output is correct
47 Correct 1 ms 204 KB Output is correct
48 Correct 42 ms 348 KB Output is correct
49 Correct 43 ms 348 KB Output is correct
50 Correct 43 ms 332 KB Output is correct
51 Correct 1 ms 204 KB Output is correct
52 Correct 1 ms 296 KB Output is correct
53 Correct 29 ms 332 KB Output is correct
54 Correct 1 ms 316 KB Output is correct
55 Correct 28 ms 368 KB Output is correct
56 Correct 35 ms 332 KB Output is correct
57 Correct 1 ms 204 KB Output is correct
58 Correct 1 ms 204 KB Output is correct
59 Correct 1 ms 204 KB Output is correct
60 Correct 42 ms 332 KB Output is correct
61 Correct 45 ms 332 KB Output is correct
62 Correct 0 ms 204 KB Output is correct
63 Correct 140 ms 332 KB Output is correct
64 Correct 141 ms 400 KB Output is correct
65 Correct 180 ms 404 KB Output is correct
66 Correct 121 ms 452 KB Output is correct
67 Correct 236 ms 408 KB Output is correct
68 Correct 202 ms 408 KB Output is correct
69 Correct 263 ms 512 KB Output is correct
70 Correct 1 ms 332 KB Output is correct
71 Correct 1 ms 296 KB Output is correct
72 Correct 185 ms 528 KB Output is correct
73 Correct 190 ms 524 KB Output is correct
74 Correct 176 ms 532 KB Output is correct
75 Correct 209 ms 332 KB Output is correct
76 Correct 1 ms 204 KB Output is correct
77 Correct 1 ms 296 KB Output is correct
78 Correct 241 ms 400 KB Output is correct
79 Correct 187 ms 332 KB Output is correct
80 Correct 340 ms 416 KB Output is correct
81 Correct 349 ms 452 KB Output is correct
82 Correct 339 ms 408 KB Output is correct
83 Correct 184 ms 400 KB Output is correct
84 Correct 1 ms 292 KB Output is correct
85 Correct 26 ms 312 KB Output is correct
86 Correct 173 ms 416 KB Output is correct
87 Correct 1 ms 204 KB Output is correct
88 Correct 1 ms 204 KB Output is correct
89 Correct 43 ms 348 KB Output is correct
90 Correct 42 ms 304 KB Output is correct
91 Correct 43 ms 332 KB Output is correct
92 Correct 337 ms 408 KB Output is correct
93 Correct 333 ms 404 KB Output is correct
94 Correct 339 ms 408 KB Output is correct
95 Correct 1 ms 204 KB Output is correct
96 Correct 1 ms 296 KB Output is correct
97 Correct 192 ms 416 KB Output is correct
98 Correct 28 ms 332 KB Output is correct
99 Correct 188 ms 400 KB Output is correct
100 Correct 1 ms 204 KB Output is correct
101 Correct 27 ms 348 KB Output is correct
102 Correct 27 ms 332 KB Output is correct
103 Correct 188 ms 408 KB Output is correct
104 Correct 1 ms 204 KB Output is correct
105 Correct 1 ms 204 KB Output is correct
106 Correct 2 ms 204 KB Output is correct
107 Correct 46 ms 348 KB Output is correct
108 Correct 47 ms 344 KB Output is correct
109 Correct 329 ms 332 KB Output is correct
110 Correct 329 ms 408 KB Output is correct
111 Correct 1 ms 204 KB Output is correct