# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
306248 | gs18115 | Counting Mushrooms (IOI20_mushrooms) | C++14 | 10 ms | 384 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"mushrooms.h"
#include<iostream>
#include<vector>
#include<algorithm>
#define ep emplace
#define eb emplace_back
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;
typedef pair<int,int>pi;
typedef pair<ll,ll>pl;
const int inf=1e9+7;
const ll INF=1e18;
inline int query(initializer_list<int>v)
{
vector<int>nv;
for(int t:v)
nv.eb(t);
return use_machine(nv);
}
inline void get(int o,int p,vector<int>&av,vector<int>&bv)
{
int i=av[0],j=av[1];
int c=query({i,o,j,p});
(c/2==0?av:bv).eb(o);
(c%2==0?av:bv).eb(p);
return;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |