# | 제출 시각UTC-0 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1127334 | jerzyk | Counting Mushrooms (IOI20_mushrooms) | C++20 | 1 ms | 428 KiB |
#include <bits/stdc++.h>
#include "mushrooms.h"
using namespace std;
#define pb push_back
#define st first
#define nd second
typedef long long ll;
typedef long double ld;
const ll I = 1000'000'000'000'000'000LL;
const int II = 2'000'000'000;
const ll M = 1000'000'007LL;
const int N = 1000'007;
vector<int> pos0, pos1;
int cur = 2, n, ans = 1;
void Opt0()
{
//cerr << ans << " " << " Opt0 \n";
int a = cur, b = cur + 1, c = cur + 2;
cur += 3;
vector<int>q{pos0[0], a, pos0[1], b, pos0[2], c};
int x = use_machine(q);
//cerr << a << " " << b << " " << c << " " << x << "\n";
if(x % 2 == 1)
{
pos1.pb(c);
x -= 1;
}else
{
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |