| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 413937 | cfalas | 버섯 세기 (IOI20_mushrooms) | C++14 | 106 ms | 200 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;
#define mp make_pair
#define INF 10000000
#define MOD 1000000007
#define MID ((l+r)/2)
#define HASHMOD 2305843009213693951
#define ll long long
#define ull unsigned long long
#define F first
#define S second
typedef pair<ll, ll> ii;
typedef pair<ii, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef map<int, int> mii;
#define EPS 1e-6
#define FOR(i,n) for(int i=0;i<((int)(n));i++)
#define FORi(i,a,b) for(int i=((int)(a));i<((int)(b));i++)
#define FOA(v, a) for(auto v : a)
int count_mushrooms(int n) {
int ans=1;
vi a;
vi b;
a.push_back(0);
int last=0;
FORi(i,1,n){
if(a.size()==3 || b.size()==3) break;
int x = use_machine({0,i});
if(x) b.push_back(i);
else a.push_back(i), ans++;
last = i;
}
vi c;
if(a.size()==3) c = a;
else c = b;
FORi(i,last+1,n){
if(i+2<n){
int x = use_machine({c[0], i, c[1], i+1, c[2], i+2});
int cur = 0;
if(x==0) cur+=3;
else if(x==1 || x==2) cur+=2;
else if(x==3 || x==4) cur++;
if(a.size()==3) ans+=cur;
else ans+=3-cur;
i+=2;
}
else{
ans += 1 - use_machine({0,i});
}
}
return ans;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
