# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
365717 | qwerasdfzxcl | Counting Mushrooms (IOI20_mushrooms) | C++14 | 9 ms | 516 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;
typedef long long ll;
vector<int> m;
vector<int> a, b, val;
int cur_state;
bool visited[20020];
/*
int use_machine(vector<int> &v){
int ret=0;
for (int x:v) printf("%d ", x);
printf("\n");
//scanf("%d", &ret);
for (int i=1;i<(int)v.size();i++) if ((v[i]>=100 && v[i-1]<100)||(v[i-1]>=100 && v[i]<100)) ret++;
printf("ret: %d\n", ret);
return ret;
}*/
void odd(int tmp){
int abc=2;
if (tmp&1) abc=1;
if (cur_state==abc) b.push_back(m[0]);
else a.push_back(m[0]);
}
void update(){
if (a.size()>b.size()) cur_state=1;
else cur_state=2;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |