# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
306879 | ivan24 | Counting Mushrooms (IOI20_mushrooms) | C++14 | 3 ms | 640 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 <bits/stdc++.h>
using namespace std;
using ll = int;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef pair<ll,ll> ii;
typedef vector<ii> vii;
typedef vector<vii> vvii;
#define F first
#define S second
class Solver{
private:
ll n;
vi isChecked, type, ctr;
vvi byType;
void add_type(ll x, bool t){
if (type[x] != -1) return;
type[x] = t;
byType[t].push_back(x);
ctr[t]++;
}
void addOne(ll x){
ll res = use_machine(vi{0,x});
add_type(x,res);
}
bool addTwo(ll x, ll y){
bool t = 0;
if (byType[t].size() < 2){
t = 1;
}
ll res = use_machine(vi{x,byType[t][0],y,byType[t][1]});
add_type(x,(res&1) ? !t : t);
add_type(y,(res&2) ? !t : t);
}
public:
Solver(ll n): n(n), isChecked(n,0), type(n,-1), ctr(2,0), byType(2){
type[0] = 0;
ctr[0]++;
byType[0].push_back(0);
}
int solve(){
addOne(1);
if (n > 2){
addOne(2);
for (ll i = 2; n > 2*i; i++){
addTwo(2*i-1,2*i);
}
if (type[n-1] == -1){
addOne(n-1);
}
}
return ctr[0];
}
};
int count_mushrooms(int n) {
Solver mySolver(n);
return mySolver.solve();
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |