# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
600568 | kig9981 | Counting Mushrooms (IOI20_mushrooms) | C++17 | 10 ms | 528 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>
#ifdef NON_SUBMIT
#define TEST(n) (n)
#define tout cerr
#else
#define TEST(n) ((void)0)
#define tout cin
#endif
using namespace std;
vector<pair<int,int>> V;
vector<int> A, B, Q;
int D[3];
void query2()
{
int a=V[0].first, b=V[1].first, r;
if(A.size()>1) {
r=use_machine({A[0],a,A[1],b});
if(r&1) {
B.push_back(b);
A.push_back(V[1].second);
}
else {
A.push_back(b);
B.push_back(V[1].second);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |