Submission #1362769

#TimeUsernameProblemLanguageResultExecution timeMemory
1362769mariaclaraHow to Avoid Disqualification in 75 Easy Steps (CEOI23_avoid)C++20
10 / 100
0 ms344 KiB
#include "avoid.h"
#include<bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
#define mk make_pair 
#define pb push_back
#define fr first 
#define sc second 

pii scout(int R, int H) {
    int N = 1000;

    for(int b = 0; b <= 9; b++) {
        vi pos;

        for(int i = 1; i <= N; i++)
            if(i & (1<<b)) pos.pb(i);

        send(pos);
    }

    vi rsp = wait();

    int ans = 0;

    for(int b = 0; b <= 9; b++) 
        if(rsp[b]) ans += (1<<b);

    return mk(ans, ans);
}
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...