oj.uz

Submission #1065842

# Submission time Handle Problem Language Result Execution time Memory
1065842 2024-08-19T12:17:17 Z vjudge1 Counting Mushrooms (IOI20_mushrooms) C++17
80.7143 / 100
 11 ms 1624 KB 
#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;
}

void op2() {
    if(PozRamase.size() < 2) {
        op1();
        return;
    }
    int cul = 0;
    vi P;
    vi Noi;
    if(A.size() > B.size()) {
        copy(A.begin(), A.end(), back_inserter(P));
        cul = 0;
    }
    else {
        copy(B.begin(), B.end(), back_inserter(P));
        cul = 1;
    }
    while(PozRamase.size() > 1 && P.size() >= Noi.size() + 2) {
        Noi.push_back(get_poz());
    }
    P.resize(Noi.size() + 1);
    vi QRY;
    for(int i = 0; i < P.size(); ++i) {
        if(i) QRY.push_back(Noi[i - 1]);
        QRY.push_back(P[i]);
    }
    int ultp = get_poz();
    QRY.push_back(ultp);

    int nr = use_machine(QRY);

    int cul_ult = (nr & 1) ^ cul;
    if(!cul_ult) A.insert(ultp), ++nra;
    else B.insert(ultp);

    nr /= 2;

    if(!cul) nr = Noi.size() - nr;
    nra += nr;
    ///and that's about it;
}

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

Compilation message

mushrooms.cpp: In function 'void op2()':
mushrooms.cpp:71:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   71 |     for(int i = 0; i < P.size(); ++i) {
      |                    ~~^~~~~~~~~~

Subtask #1
80.7143 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 456 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 8 ms 1624 KB Output is correct
8 Correct 9 ms 1368 KB Output is correct
9 Correct 10 ms 1368 KB Output is correct
10 Partially correct 8 ms 1376 KB Output is partially correct
11 Partially correct 7 ms 1292 KB Output is partially correct
12 Partially correct 8 ms 1388 KB Output is partially correct
13 Correct 10 ms 1388 KB Output is correct
14 Correct 6 ms 856 KB Output is correct
15 Partially correct 7 ms 1368 KB Output is partially correct
16 Partially correct 8 ms 1288 KB Output is partially correct
17 Correct 5 ms 856 KB Output is correct
18 Correct 6 ms 1368 KB Output is correct
19 Partially correct 8 ms 1368 KB Output is partially correct
20 Partially correct 7 ms 1368 KB Output is partially correct
21 Partially correct 10 ms 1316 KB Output is partially correct
22 Partially correct 10 ms 1368 KB Output is partially correct
23 Correct 8 ms 1372 KB Output is correct
24 Correct 4 ms 1112 KB Output is correct
25 Partially correct 8 ms 1380 KB Output is partially correct
26 Partially correct 9 ms 1368 KB Output is partially correct
27 Partially correct 7 ms 1368 KB Output is partially correct
28 Partially correct 10 ms 1368 KB Output is partially correct
29 Partially correct 8 ms 1624 KB Output is partially correct
30 Partially correct 9 ms 1368 KB Output is partially correct
31 Partially correct 10 ms 1384 KB Output is partially correct
32 Partially correct 6 ms 1368 KB Output is partially correct
33 Partially correct 7 ms 1368 KB Output is partially correct
34 Partially correct 8 ms 1388 KB Output is partially correct
35 Partially correct 8 ms 1624 KB Output is partially correct
36 Partially correct 7 ms 1372 KB Output is partially correct
37 Partially correct 7 ms 1392 KB Output is partially correct
38 Partially correct 7 ms 1368 KB Output is partially correct
39 Partially correct 11 ms 1368 KB Output is partially correct
40 Partially correct 9 ms 1624 KB Output is partially correct
41 Partially correct 7 ms 1368 KB Output is partially correct
42 Partially correct 11 ms 1388 KB Output is partially correct
43 Partially correct 7 ms 1368 KB Output is partially correct
44 Partially correct 11 ms 1368 KB Output is partially correct
45 Partially correct 7 ms 1368 KB Output is partially correct
46 Partially correct 7 ms 1368 KB Output is partially correct
47 Partially correct 9 ms 1368 KB Output is partially correct
48 Partially correct 9 ms 1368 KB Output is partially correct
49 Partially correct 7 ms 1368 KB Output is partially correct
50 Partially correct 6 ms 1368 KB Output is partially correct
51 Partially correct 11 ms 1368 KB Output is partially correct
52 Partially correct 8 ms 1368 KB Output is partially correct
53 Partially correct 7 ms 1364 KB Output is partially correct
54 Partially correct 7 ms 1368 KB Output is partially correct
55 Partially correct 9 ms 1368 KB Output is partially correct
56 Partially correct 10 ms 1368 KB Output is partially correct
57 Partially correct 7 ms 1368 KB Output is partially correct
58 Partially correct 7 ms 1368 KB Output is partially correct
59 Partially correct 7 ms 1620 KB Output is partially correct
60 Partially correct 7 ms 1624 KB Output is partially correct
61 Partially correct 7 ms 1368 KB Output is partially correct
62 Correct 0 ms 344 KB Output is correct
63 Correct 0 ms 344 KB Output is correct
64 Correct 0 ms 344 KB Output is correct
65 Correct 1 ms 344 KB Output is correct
66 Correct 0 ms 344 KB Output is correct
67 Correct 0 ms 344 KB Output is correct
68 Correct 1 ms 344 KB Output is correct
69 Correct 0 ms 344 KB Output is correct
70 Correct 0 ms 344 KB Output is correct
71 Correct 0 ms 344 KB Output is correct
72 Correct 1 ms 344 KB Output is correct
73 Correct 0 ms 344 KB Output is correct
74 Correct 0 ms 344 KB Output is correct
75 Correct 0 ms 344 KB Output is correct
76 Correct 0 ms 344 KB Output is correct
77 Correct 0 ms 344 KB Output is correct
78 Correct 0 ms 344 KB Output is correct
79 Correct 0 ms 344 KB Output is correct
80 Correct 0 ms 344 KB Output is correct
81 Correct 0 ms 344 KB Output is correct
82 Correct 0 ms 372 KB Output is correct
83 Correct 0 ms 344 KB Output is correct
84 Correct 0 ms 344 KB Output is correct
85 Correct 0 ms 344 KB Output is correct
86 Correct 0 ms 344 KB Output is correct
87 Correct 0 ms 344 KB Output is correct
88 Correct 0 ms 344 KB Output is correct
89 Correct 0 ms 344 KB Output is correct
90 Correct 0 ms 344 KB Output is correct
91 Correct 0 ms 344 KB Output is correct