Submission #1167769

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1167769	2025-03-16 13:19:36	Dedibeat	Cave (IOI13_cave)	C++20	0 / 100	1 ms	576 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>
#define pb push_back
#define eb emplace_back
#define F first
#define S second
#define endl '\n'
#define all(x) (x).begin(), (x).end()
#define put(x) cout << (x) << '\n'
using namespace std;
using ll = long long;
void solve(int l, int r, vector<int> pos, int S[], int D[], int N){
    if(l > r) return;
    if(l == r){
        if(tryCombination(S) == l) S[pos[0]] ^= 1;
        return;
    }
    for(int i : pos){
        S[i] = rand() % 2;
    }
    int pivot = tryCombination(S);
    if(pivot == -1){
        return;
    }
    vector<int> lo, hi;
    int s_pivot = -1;
    for(int i : pos){
        S[i] ^= 1;
        int res = tryCombination(S);
        if(res < pivot) lo.push_back(i);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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