Submission #1165239

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1165239	2025-03-11 09:54:29	ty_mxzhn	Cave (IOI13_cave)	C++20	100 / 100	196 ms	548 KiB

cave

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "cave.h"
#include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin() , x.end();
#define sz(x) (int)x.size();
void exploreCave(int N) {
    int S[N] , D[N] , query[N] = {0} , vis[N] = {0};
    for(int i = 0;i<N;i++){// door number
        for(int j = 0;j<N;j++){
            if(vis[j])continue;
            query[j] = 0;
        }
        // cout << "door number : " << i << endl;
        // cout << "asking : ";for(int j = 0;j<N;j++)cout << query[j] << " ";cout << endl;
        bool bl = tryCombination(query) == i;
        // cout << "bl : " << bl << endl;
        // 0 da kapali oluosa bl = true , 1 de kapali oluosa bl = false
        // yani kapi bl de acik , !bl de kapali olur
        int l = 0 , r = N-1;
        while(l < r){
            int mid = (l + r) / 2;
            // sol tarafi !bl yap , eger i de duruosak i soldadir
            for(int j = l;j<=mid;j++){
                if(vis[j])continue;
                query[j] = !bl;
            }
            for(int j = mid+1;j<=r;j++){
                if(vis[j])continue;
                query[j] = bl;
            }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 12 / 12
• Subtask 2: 13 / 13
• Subtask 3: 21 / 21
• Subtask 4: 30 / 30
• Subtask 5: 24 / 24