oj.uz

답안 #461186

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
461186 2021-08-09T13:43:19 Z mtxas 동굴 (IOI13_cave) C++14
100 / 100
 349 ms 532 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];
}
void exploreCave(int N){
    n = N;
    _for(j, 0, n){ // randam, kuris kontroliuoja j-tasias duris
        int _res = tryCombination(S); if(_res == -1) _res = n;
        bool wasOpen = _res > j;
        int L = 0, R = N-1, k = (L+R)/2;
        while(L<R){
            keisk(L, k); int res = tryCombination(S);
            if(res == -1) res = n;
            bool isOpen = res > j; keisk(L, k);
            if(isOpen != wasOpen) R = k;
            else L = k+1;
            k = (L+R)/2;
        }
        D[k] = j;
       // cout<<"jungiklis "<<k<<" kontroliuoja "<<j<<"-asias duris\n";
        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:68:5: note: in expansion of macro '_for'
   68 |     _for(j, 0, n){ // randam, kuris kontroliuoja j-tasias duris
      |     ^~~~
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

# 결과 실행 시간 메모리 Grader output
1 Correct 141 ms 392 KB Output is correct
2 Correct 136 ms 400 KB Output is correct
3 Correct 200 ms 412 KB Output is correct
4 Correct 128 ms 412 KB Output is correct
5 Correct 239 ms 524 KB Output is correct
6 Correct 182 ms 332 KB Output is correct
7 Correct 258 ms 392 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 532 KB Output is correct
13 Correct 180 ms 412 KB Output is correct
14 Correct 180 ms 460 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 242 ms 408 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 222 ms 408 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 245 ms 516 KB Output is correct
7 Correct 194 ms 420 KB Output is correct
8 Correct 328 ms 412 KB Output is correct
9 Correct 327 ms 408 KB Output is correct
10 Correct 326 ms 408 KB Output is correct
11 Correct 194 ms 404 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 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 204 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 332 KB Output is correct
11 Correct 1 ms 288 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 292 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 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 204 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 332 KB Output is correct
11 Correct 1 ms 288 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 292 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 0 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 29 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 40 ms 316 KB Output is correct
24 Correct 39 ms 332 KB Output is correct
25 Correct 54 ms 332 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 28 ms 356 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 28 ms 368 KB Output is correct
31 Correct 28 ms 368 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 292 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 40 ms 348 KB Output is correct
36 Correct 39 ms 356 KB Output is correct
37 Correct 1 ms 204 KB Output is correct

Subtask #5
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 141 ms 392 KB Output is correct
2 Correct 136 ms 400 KB Output is correct
3 Correct 200 ms 412 KB Output is correct
4 Correct 128 ms 412 KB Output is correct
5 Correct 239 ms 524 KB Output is correct
6 Correct 182 ms 332 KB Output is correct
7 Correct 258 ms 392 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 532 KB Output is correct
13 Correct 180 ms 412 KB Output is correct
14 Correct 180 ms 460 KB Output is correct
15 Correct 242 ms 408 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 222 ms 408 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 245 ms 516 KB Output is correct
21 Correct 194 ms 420 KB Output is correct
22 Correct 328 ms 412 KB Output is correct
23 Correct 327 ms 408 KB Output is correct
24 Correct 326 ms 408 KB Output is correct
25 Correct 194 ms 404 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 204 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 332 KB Output is correct
36 Correct 1 ms 288 KB Output is correct
37 Correct 1 ms 204 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 292 KB Output is correct
40 Correct 1 ms 204 KB Output is correct
41 Correct 1 ms 204 KB Output is correct
42 Correct 0 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 29 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 40 ms 316 KB Output is correct
49 Correct 39 ms 332 KB Output is correct
50 Correct 54 ms 332 KB Output is correct
51 Correct 1 ms 204 KB Output is correct
52 Correct 1 ms 204 KB Output is correct
53 Correct 28 ms 356 KB Output is correct
54 Correct 1 ms 204 KB Output is correct
55 Correct 28 ms 368 KB Output is correct
56 Correct 28 ms 368 KB Output is correct
57 Correct 1 ms 204 KB Output is correct
58 Correct 1 ms 292 KB Output is correct
59 Correct 1 ms 204 KB Output is correct
60 Correct 40 ms 348 KB Output is correct
61 Correct 39 ms 356 KB Output is correct
62 Correct 1 ms 204 KB Output is correct
63 Correct 126 ms 400 KB Output is correct
64 Correct 118 ms 380 KB Output is correct
65 Correct 229 ms 412 KB Output is correct
66 Correct 122 ms 332 KB Output is correct
67 Correct 262 ms 528 KB Output is correct
68 Correct 175 ms 408 KB Output is correct
69 Correct 296 ms 412 KB Output is correct
70 Correct 1 ms 204 KB Output is correct
71 Correct 0 ms 204 KB Output is correct
72 Correct 186 ms 408 KB Output is correct
73 Correct 205 ms 428 KB Output is correct
74 Correct 177 ms 408 KB Output is correct
75 Correct 224 ms 408 KB Output is correct
76 Correct 0 ms 204 KB Output is correct
77 Correct 1 ms 204 KB Output is correct
78 Correct 240 ms 400 KB Output is correct
79 Correct 195 ms 408 KB Output is correct
80 Correct 322 ms 408 KB Output is correct
81 Correct 330 ms 424 KB Output is correct
82 Correct 349 ms 412 KB Output is correct
83 Correct 194 ms 404 KB Output is correct
84 Correct 1 ms 300 KB Output is correct
85 Correct 28 ms 332 KB Output is correct
86 Correct 180 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 40 ms 332 KB Output is correct
90 Correct 41 ms 336 KB Output is correct
91 Correct 40 ms 332 KB Output is correct
92 Correct 317 ms 412 KB Output is correct
93 Correct 300 ms 420 KB Output is correct
94 Correct 321 ms 408 KB Output is correct
95 Correct 1 ms 204 KB Output is correct
96 Correct 1 ms 204 KB Output is correct
97 Correct 193 ms 332 KB Output is correct
98 Correct 28 ms 304 KB Output is correct
99 Correct 183 ms 408 KB Output is correct
100 Correct 1 ms 204 KB Output is correct
101 Correct 29 ms 364 KB Output is correct
102 Correct 28 ms 332 KB Output is correct
103 Correct 183 ms 416 KB Output is correct
104 Correct 1 ms 204 KB Output is correct
105 Correct 1 ms 204 KB Output is correct
106 Correct 1 ms 204 KB Output is correct
107 Correct 40 ms 332 KB Output is correct
108 Correct 41 ms 372 KB Output is correct
109 Correct 298 ms 416 KB Output is correct
110 Correct 311 ms 408 KB Output is correct
111 Correct 1 ms 204 KB Output is correct