답안 #578396

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
578396	2022-06-16T14:02:04 Z	SlavicG	버섯 세기 (IOI20_mushrooms)	C++17	80.427 / 100	10 ms	720 KB

mushrooms

#include "mushrooms.h"
#include "bits/stdc++.h"
using namespace std;

#define pb push_back
#define sz(a) (int)a.size()

int count_mushrooms(int n) {
	vector<int> a(n, -1);
	a[0] = 0;
	if(n <= 226) {
        for(int i = 1; i < n; ++i) {
            int x = use_machine({i - 1, i});
            if(x) a[i] = !a[i - 1];
            else a[i] = a[i - 1];
        }
        int ans = 0;
        for(int i = 0; i < n; ++i) if(a[i] == 0) ++ans;
        return ans;
	}

	vector<int> A;
	vector<int> B;
	A.pb(0);
	int x = use_machine({0, 1});
	if(x == 0) A.pb(1);
	else B.pb(1);
	x = use_machine({0, 2});
	if(x == 0) A.pb(2);
	else B.pb(2);

    for(auto x: A) a[x] = 0;
    for(auto x: B) a[x] = 1;
	if(sz(A) >= 2) {
        for(int i = 3; i + 1 < min(n, 275); i += 2) {
            vector<int> v;
            v.pb(A[0]);
            v.pb(i);
            v.pb(A[1]);
            v.pb(i + 1);
            int x = use_machine(v);
            if(x & 2) {
                B.pb(i);
            } else A.pb(i);
            if(x & 1) {
                B.pb(i + 1);
            } else A.pb(i + 1);
        }
	} else {
        for(int i = 3; i + 1 < min(n, 275); i += 2) {
            vector<int> v;
            v.pb(B[0]);
            v.pb(i);
            v.pb(B[1]);
            v.pb(i + 1);
            int x = use_machine(v);
            if(x & 2) {
                A.pb(i);
            } else B.pb(i);
            if(x & 1) {
                A.pb(i + 1);
            } else B.pb(i + 1);
        }
	}

    int cnt = 0;
	for(auto x: A) {
        ++cnt;
        a[x] = 0;
	}
	for(auto x: B) a[x] = 1;
	vector<int> v;
	for(int i = 0; i < n; ++i) {
        if(a[i] == -1) v.pb(i);
	}
	if(sz(B) >= sz(A)) {
        assert(sz(B) >= 1);
        for(int i = 0; i < sz(v); i += sz(B)) {
            vector<int> f;
            int idx = 0;
            for(int j = i; j < sz(v) && j < i + sz(B); ++j) {
                f.pb(B[idx++]);
                f.pb(v[j]);
            }
            int x = use_machine(f);
            cnt += (x / 2) + (x % 2);
        }
        return cnt;
	} else {
        assert(sz(A) >= 1);
        cnt += sz(v);
        for(int i = 0; i < sz(v); i += sz(A)) {
            vector<int> f;
            int idx = 0;
            for(int j = i; j < sz(v) && j < i + sz(A); ++j) {
                f.pb(A[idx++]);
                f.pb(v[j]);
            }
            int x = use_machine(f);
            cnt -= (x / 2) + (x % 2);
        }
        return cnt;
	}
}

Subtask #1

80.427 / 100.0

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