# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1071982 | edogawa_something | How to Avoid Disqualification in 75 Easy Steps (CEOI23_avoid) | C++17 | 1 ms | 344 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "avoid.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vii;
typedef pair<ll,ll> pii;
#define F first
#define S second
#define all(v) v.begin(),v.end()
#define pb push_back
const ll M=5e5+10;
const ll inf=2e18;
pair<int, int> scout(int R, int H) {
for(int bit=0;bit<10;bit++) {
vector<int>v;
for(int i=1;i<=1000;i++) {
if((i&(1<<bit))>0)
v.pb(i);
}
send(v);
}
vector<int>v=wait();
int ans=0;
for(int i=0;i<v.size();i++) {
ans+=(v[i]*(1<<i));
}
return {ans,ans};
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |