Submission #944905

# Submission time Handle Problem Language Result Execution time Memory
944905 2024-03-13T07:48:38 Z nguyentunglam Counting Mushrooms (IOI20_mushrooms) C++17
80.427 / 100
6 ms 788 KB
#include "mushrooms.h"
#include<bits/stdc++.h>
using namespace std;
int a[20010], order[20010];
vector<int> A, B;
int usemachine(vector<int> ask) {
    vector<int> nxt;
    for(int &j : ask) nxt.push_back(order[j]);
    return use_machine(nxt);
}
int count_mushrooms(int n) {
    for(int i = 1; i < n; i++) order[i] = i;
    //random_shuffle(order + 1, order + n);
    if (n == 2) return 1 + (usemachine({0, 1}) == 0);
 
    a[1] = usemachine({0, 1});
    a[2] = usemachine({0, 2});
    int x, y, type = 0;
    if (a[1] + a[2] == 2) {
        type = 1;
        x = 1; y = 2;
    }
    else {
        type = 0;
        if (a[1] == 0) x = 0, y = 1;
        else x = 0, y = 2;
    }
 
    int T = min(280, n);
    int ed = 2;
    for(int i = 4; i < T; i += 2) {
        int tmp = usemachine({x, i - 1, y, i});
 
        if (tmp / 2 > 0) a[i - 1] = type ^ 1;
        else a[i - 1] = type;
 
        if (tmp % 2) a[i] = type ^ 1;
        else a[i] = type;
        ed = i;
    }
 
    for(int i = 0; i <= ed; i++) {
        if (!a[i]) A.push_back(i);
        else B.push_back(i);
    }
    bool ok = 0;
    int tmp = 0;
    if (A.size() < B.size()) swap(A, B), ok = 1;
    int sz = A.size(), cnt = 0;
    for(int i = ed + 1; i < n; i += sz) {
        vector<int> ask;
        for(int j = i; j < n && j < i + sz; j++) {
            ask.push_back(A[j - i]);
            ask.push_back(j);
            cnt++;
        }
        tmp += (usemachine(ask) + 1) / 2;
    }
    if (!ok) return A.size() + cnt - tmp;
    return B.size() + tmp;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 456 KB Output is correct
6 Correct 1 ms 464 KB Output is correct
7 Correct 4 ms 528 KB Output is correct
8 Correct 4 ms 528 KB Output is correct
9 Correct 5 ms 532 KB Output is correct
10 Partially correct 5 ms 532 KB Output is partially correct
11 Partially correct 5 ms 784 KB Output is partially correct
12 Partially correct 5 ms 532 KB Output is partially correct
13 Correct 5 ms 528 KB Output is correct
14 Correct 3 ms 504 KB Output is correct
15 Partially correct 5 ms 536 KB Output is partially correct
16 Partially correct 4 ms 532 KB Output is partially correct
17 Correct 3 ms 500 KB Output is correct
18 Correct 4 ms 536 KB Output is correct
19 Partially correct 5 ms 528 KB Output is partially correct
20 Partially correct 5 ms 528 KB Output is partially correct
21 Partially correct 5 ms 788 KB Output is partially correct
22 Partially correct 5 ms 528 KB Output is partially correct
23 Partially correct 4 ms 532 KB Output is partially correct
24 Correct 3 ms 504 KB Output is correct
25 Partially correct 4 ms 532 KB Output is partially correct
26 Partially correct 5 ms 528 KB Output is partially correct
27 Partially correct 5 ms 528 KB Output is partially correct
28 Partially correct 5 ms 536 KB Output is partially correct
29 Partially correct 5 ms 524 KB Output is partially correct
30 Partially correct 5 ms 528 KB Output is partially correct
31 Partially correct 4 ms 528 KB Output is partially correct
32 Partially correct 4 ms 536 KB Output is partially correct
33 Partially correct 4 ms 528 KB Output is partially correct
34 Partially correct 5 ms 528 KB Output is partially correct
35 Partially correct 5 ms 532 KB Output is partially correct
36 Partially correct 5 ms 528 KB Output is partially correct
37 Partially correct 5 ms 528 KB Output is partially correct
38 Partially correct 5 ms 528 KB Output is partially correct
39 Partially correct 5 ms 532 KB Output is partially correct
40 Partially correct 4 ms 528 KB Output is partially correct
41 Partially correct 5 ms 536 KB Output is partially correct
42 Partially correct 5 ms 532 KB Output is partially correct
43 Partially correct 5 ms 528 KB Output is partially correct
44 Partially correct 5 ms 528 KB Output is partially correct
45 Partially correct 4 ms 528 KB Output is partially correct
46 Partially correct 5 ms 536 KB Output is partially correct
47 Partially correct 5 ms 528 KB Output is partially correct
48 Partially correct 5 ms 532 KB Output is partially correct
49 Partially correct 4 ms 532 KB Output is partially correct
50 Partially correct 5 ms 532 KB Output is partially correct
51 Partially correct 5 ms 532 KB Output is partially correct
52 Partially correct 4 ms 532 KB Output is partially correct
53 Partially correct 5 ms 532 KB Output is partially correct
54 Partially correct 5 ms 528 KB Output is partially correct
55 Partially correct 4 ms 532 KB Output is partially correct
56 Partially correct 6 ms 532 KB Output is partially correct
57 Partially correct 5 ms 532 KB Output is partially correct
58 Partially correct 5 ms 528 KB Output is partially correct
59 Partially correct 5 ms 524 KB Output is partially correct
60 Partially correct 4 ms 532 KB Output is partially correct
61 Partially correct 5 ms 532 KB Output is partially correct
62 Correct 1 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 0 ms 344 KB Output is correct
66 Correct 1 ms 344 KB Output is correct
67 Correct 0 ms 344 KB Output is correct
68 Correct 0 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 0 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 344 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 1 ms 392 KB Output is correct
90 Correct 0 ms 344 KB Output is correct
91 Correct 0 ms 344 KB Output is correct