Submission #1065825

#	Time	Username	Problem	Language	Result	Execution time	Memory
1065825		vjudge1	Counting Mushrooms (IOI20_mushrooms)	C++17	25 / 100	83 ms	1620 KiB

mushrooms

#include "mushrooms.h"
#include <bits/stdc++.h>

using namespace std;

using vi = vector<int>;

set<int> A, B; /// indici despre care stim sigur ca sunt A sau B
int nra = 0;
set<int> PozRamase;

int get_poz() {
    int u = *PozRamase.begin();
    PozRamase.erase(u);
    return u;
}

void op1() {
    if(PozRamase.empty()) return;
    if(PozRamase.size() == 1 || (A.size() < 2 && B.size() < 2)) {
        int nou = get_poz();
        int tip = use_machine(vi{0, nou});
        if(!tip) A.insert(nou), ++nra;
        else B.insert(nou);
        return;
    }
    int p1, p2, tip;
    if(A.size() > 1) {
        p1 = *A.begin(); p2 = *A.rbegin();
        tip = 0;
    } else {
        p1 = *B.begin(); p2 = *B.rbegin();
        tip = 1;
    }

    int nou1 = get_poz(), nou2 = get_poz();

    int nr = use_machine(vi{p1, nou1, p2, nou2});

    if((nr & 1) ^ tip)
        B.insert(nou2);
    else
        A.insert(nou2), ++nra;
    if((!!(nr & 2)) ^ tip) 
        B.insert(nou1);
    else
        A.insert(nou1), ++nra;
}

int count_mushrooms(int n) {
    A.insert(0);
    nra = 1;
    for(int i = 1; i < n; ++i) {
        PozRamase.insert(i);
    }
    for(int i = 0; i < 160; ++i) {
        op1();
    }
    while(!PozRamase.empty()) op1();
    return nra;
}

• Subtask 1: 25 / 100