Submission #1288115

#TimeUsernameProblemLanguageResultExecution timeMemory
1288115LIAHow to Avoid Disqualification in 75 Easy Steps (CEOI23_avoid)C++17
10 / 100
1 ms448 KiB
#include "avoid.h" #include <vector> #include <bits/stdc++.h> using namespace std; // #include "sample_grader.cpp" #define ll int #define vll vector<ll> std::pair<int, int> scout(int r, int h) { ll ans = 0; vector<vector<ll>> ask(r); for (ll i = 1; i <= 1000; ++i) { for (ll j = 0; j < 10; ++j) { if (i & (1LL << j)) { ask[j].push_back(i); } } } for (auto it : ask) { send(it); } vll ansi = wait(); for (ll i = 0; i < 10; ++i) { if (ansi[i] == 1) ans |= (1LL << i); } return {ans, ans}; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...