답안 #315650

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
315650	2020-10-23T14:30:24 Z	Sorting	버섯 세기 (IOI20_mushrooms)	C++17	80.1418 / 100	10 ms	512 KB

mushrooms

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

using namespace std;

const int C = 282;

int count_mushrooms(int n){
    int cnt = 1;
    vector<int> a{0}, b;

    for(int i = 1; i < min(n, 3); ++i){
        if(!use_machine(vector<int>{0, i})){
            cnt++;
            a.push_back(i);
        }
        else b.push_back(i);
    }

    for(int i = 3; i < min(n, C + 1); i += 2){
        vector<int> v;
        bool which;
        if(a.size() >= 2){
            v = {a[0], a[1]};
            which = false;
        }
        else{
            v = {b[0], b[1]};
            which = true;
        }

        if(i == min(n, C + 1) - 1){
            if(!use_machine(vector<int>{0, i})){
                cnt++;
                a.push_back(i);
            }
            else b.push_back(i);
            break;
        }

        int t = use_machine({v[0], i, v[1], i + 1});
        if(!which) t = 3 - t;

        if(t & 2){
            cnt++;
            a.push_back(i);
        }
        else b.push_back(i);

        if(t & 1){
            cnt++;
            a.push_back(i + 1);
        }
        else b.push_back(i + 1);
    }

    for(int i = min(n, C + 1); i < n; i += (C / 2)){
        vector<int> v;
        int x = min(C / 2, n - i);
        if(a.size() > b.size()){
            for(int j = 0; j < x; ++j){
                v.push_back(a[j]);
                v.push_back(i + j);
            }
            v.push_back(a[x]);
        }
        else{
            for(int j = 0; j < x; ++j){
                v.push_back(b[j]);
                v.push_back(i + j);
            }
            v.push_back(b[x]);
        }

        int t = use_machine(v);
        if(a.size() > b.size()) cnt += x - t / 2;
        else cnt += t / 2;
    }

    return cnt;
}

Subtask #1

80.1418 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	256 KB	Output is correct
2	Correct	1 ms	256 KB	Output is correct
3	Correct	0 ms	256 KB	Output is correct
4	Correct	0 ms	256 KB	Output is correct
5	Correct	2 ms	256 KB	Output is correct
6	Correct	2 ms	256 KB	Output is correct
7	Partially correct	7 ms	256 KB	Output is partially correct
8	Partially correct	8 ms	384 KB	Output is partially correct
9	Partially correct	7 ms	256 KB	Output is partially correct
10	Partially correct	8 ms	256 KB	Output is partially correct
11	Partially correct	8 ms	256 KB	Output is partially correct
12	Partially correct	6 ms	380 KB	Output is partially correct
13	Partially correct	8 ms	256 KB	Output is partially correct
14	Correct	4 ms	256 KB	Output is correct
15	Partially correct	9 ms	256 KB	Output is partially correct
16	Partially correct	10 ms	256 KB	Output is partially correct
17	Correct	5 ms	256 KB	Output is correct
18	Partially correct	8 ms	384 KB	Output is partially correct
19	Partially correct	9 ms	256 KB	Output is partially correct
20	Partially correct	8 ms	256 KB	Output is partially correct
21	Partially correct	8 ms	256 KB	Output is partially correct
22	Partially correct	10 ms	512 KB	Output is partially correct
23	Partially correct	7 ms	256 KB	Output is partially correct
24	Correct	5 ms	256 KB	Output is correct
25	Partially correct	7 ms	256 KB	Output is partially correct
26	Partially correct	7 ms	384 KB	Output is partially correct
27	Partially correct	7 ms	256 KB	Output is partially correct
28	Partially correct	7 ms	256 KB	Output is partially correct
29	Partially correct	8 ms	384 KB	Output is partially correct
30	Partially correct	10 ms	256 KB	Output is partially correct
31	Partially correct	7 ms	256 KB	Output is partially correct
32	Partially correct	8 ms	256 KB	Output is partially correct
33	Partially correct	8 ms	256 KB	Output is partially correct
34	Partially correct	7 ms	256 KB	Output is partially correct
35	Partially correct	9 ms	384 KB	Output is partially correct
36	Partially correct	8 ms	384 KB	Output is partially correct
37	Partially correct	8 ms	256 KB	Output is partially correct
38	Partially correct	7 ms	256 KB	Output is partially correct
39	Partially correct	6 ms	372 KB	Output is partially correct
40	Partially correct	8 ms	256 KB	Output is partially correct
41	Partially correct	8 ms	256 KB	Output is partially correct
42	Partially correct	7 ms	256 KB	Output is partially correct
43	Partially correct	8 ms	256 KB	Output is partially correct
44	Partially correct	7 ms	256 KB	Output is partially correct
45	Partially correct	9 ms	256 KB	Output is partially correct
46	Partially correct	9 ms	256 KB	Output is partially correct
47	Partially correct	7 ms	256 KB	Output is partially correct
48	Partially correct	7 ms	256 KB	Output is partially correct
49	Partially correct	8 ms	256 KB	Output is partially correct
50	Partially correct	8 ms	256 KB	Output is partially correct
51	Partially correct	9 ms	256 KB	Output is partially correct
52	Partially correct	8 ms	384 KB	Output is partially correct
53	Partially correct	6 ms	376 KB	Output is partially correct
54	Partially correct	9 ms	256 KB	Output is partially correct
55	Partially correct	7 ms	256 KB	Output is partially correct
56	Partially correct	7 ms	256 KB	Output is partially correct
57	Partially correct	7 ms	256 KB	Output is partially correct
58	Partially correct	9 ms	384 KB	Output is partially correct
59	Partially correct	9 ms	256 KB	Output is partially correct
60	Partially correct	8 ms	256 KB	Output is partially correct
61	Partially correct	7 ms	376 KB	Output is partially correct
62	Correct	0 ms	256 KB	Output is correct
63	Correct	0 ms	256 KB	Output is correct
64	Correct	1 ms	256 KB	Output is correct
65	Correct	1 ms	256 KB	Output is correct
66	Correct	1 ms	256 KB	Output is correct
67	Correct	0 ms	384 KB	Output is correct
68	Correct	1 ms	256 KB	Output is correct
69	Correct	1 ms	256 KB	Output is correct
70	Correct	1 ms	256 KB	Output is correct
71	Correct	1 ms	256 KB	Output is correct
72	Correct	1 ms	256 KB	Output is correct
73	Correct	1 ms	256 KB	Output is correct
74	Correct	0 ms	256 KB	Output is correct
75	Correct	0 ms	256 KB	Output is correct
76	Correct	0 ms	256 KB	Output is correct
77	Correct	0 ms	256 KB	Output is correct
78	Correct	0 ms	256 KB	Output is correct
79	Correct	1 ms	256 KB	Output is correct
80	Correct	1 ms	256 KB	Output is correct
81	Correct	1 ms	256 KB	Output is correct
82	Correct	0 ms	256 KB	Output is correct
83	Correct	1 ms	384 KB	Output is correct
84	Correct	1 ms	256 KB	Output is correct
85	Correct	1 ms	256 KB	Output is correct
86	Correct	0 ms	256 KB	Output is correct
87	Correct	0 ms	256 KB	Output is correct
88	Correct	0 ms	256 KB	Output is correct
89	Correct	0 ms	256 KB	Output is correct
90	Correct	0 ms	256 KB	Output is correct
91	Correct	1 ms	256 KB	Output is correct