oj.uz

답안 #586077

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
586077 2022-06-29T19:59:59 Z Valaki2 버섯 세기 (IOI20_mushrooms) C++14
92.623 / 100
 9 ms 340 KB 
#include "mushrooms.h"
#include <bits/stdc++.h>
using namespace std;

#define pb push_back

const int block = 80;

int init(vector<int> &a, vector<int> &b) {
    a.pb(0);
    vector<int> v = {0, 1};
    if(use_machine(v)) {
        b.pb(1);
    } else {
        a.pb(1);
    }
    v = {0, 2};
    if(use_machine(v)) {
        b.pb(2);
    } else {
        a.pb(2);
    }
    return 3;
}

int count_mushrooms(int n) {
    if(n == 2) {
        vector<int> v = {0, 1};
        return 2 - use_machine(v);
    }
    vector<int> a;
    vector<int> b;
    int idx = init(a, b);
    for(int i = 0; i < min(block, n / 2); i++) {
        if(idx == n) {
            break;
        }
        if(idx == n - 1) {
            vector<int> v = {0, idx};
            if(use_machine(v)) {
                b.pb(idx);
            } else {
                a.pb(idx);
            }
            idx++;
            break;
        }
        vector<int> v;
        if((int) a.size() >= 2) {
            v = {a[0], idx, a[1], idx + 1};
            int tmp = use_machine(v);
            if(tmp & 2) {
                b.pb(idx);
            } else {
                a.pb(idx);
            }
            if(tmp & 1) {
                b.pb(idx + 1);
            } else {
                a.pb(idx + 1);
            }
        } else {
            v = {b[0], idx, b[1], idx + 1};
            int tmp = use_machine(v);
            if(tmp & 2) {
                a.pb(idx);
            } else {
                b.pb(idx);
            }
            if(tmp & 1) {
                a.pb(idx + 1);
            } else {
                b.pb(idx + 1);
            }
        }
        idx += 2;
    }
    int ans = 0;
    while(idx < n) {
        bool use_b = false;
        int l = a.size();
        if(b.size() > a.size()) {
            use_b = true;
            l = b.size();
        }
        l = min(l, n - idx);
        int cnt = 0;
        vector<int> v;
        while(cnt < l) {
            if(use_b) {
                v.pb(b[cnt]);
            } else {
                v.pb(a[cnt]);
            }
            v.pb(idx);
            idx++;
            cnt++;
        }
        int tmp = use_machine(v);
        if(!use_b) {
            ans += l - (tmp / 2 + tmp % 2);
            if(tmp % 2) {
                b.pb(idx - 1);
            } else {
                a.pb(idx - 1);
                ans--;
            }
        } else {
            ans += (tmp / 2 + tmp % 2);
            if(tmp % 2) {
                a.pb(idx - 1);
                ans--;
            } else {
                b.pb(idx - 1);
            }
        }
    }
    return ans + (int) a.size();
}

Subtask #1
92.623 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 1 ms 208 KB Output is correct
6 Correct 2 ms 208 KB Output is correct
7 Correct 6 ms 300 KB Output is correct
8 Correct 5 ms 312 KB Output is correct
9 Correct 6 ms 208 KB Output is correct
10 Correct 8 ms 208 KB Output is correct
11 Partially correct 5 ms 340 KB Output is partially correct
12 Correct 6 ms 208 KB Output is correct
13 Correct 6 ms 208 KB Output is correct
14 Correct 4 ms 208 KB Output is correct
15 Partially correct 8 ms 336 KB Output is partially correct
16 Partially correct 6 ms 328 KB Output is partially correct
17 Correct 4 ms 208 KB Output is correct
18 Correct 7 ms 208 KB Output is correct
19 Partially correct 6 ms 208 KB Output is partially correct
20 Correct 6 ms 312 KB Output is correct
21 Correct 6 ms 208 KB Output is correct
22 Partially correct 6 ms 316 KB Output is partially correct
23 Correct 5 ms 208 KB Output is correct
24 Correct 4 ms 308 KB Output is correct
25 Partially correct 7 ms 304 KB Output is partially correct
26 Partially correct 8 ms 316 KB Output is partially correct
27 Partially correct 6 ms 208 KB Output is partially correct
28 Partially correct 8 ms 308 KB Output is partially correct
29 Partially correct 7 ms 316 KB Output is partially correct
30 Partially correct 8 ms 328 KB Output is partially correct
31 Partially correct 7 ms 316 KB Output is partially correct
32 Partially correct 5 ms 208 KB Output is partially correct
33 Partially correct 6 ms 316 KB Output is partially correct
34 Partially correct 6 ms 312 KB Output is partially correct
35 Partially correct 6 ms 320 KB Output is partially correct
36 Partially correct 6 ms 324 KB Output is partially correct
37 Partially correct 5 ms 336 KB Output is partially correct
38 Partially correct 7 ms 332 KB Output is partially correct
39 Partially correct 6 ms 316 KB Output is partially correct
40 Partially correct 5 ms 316 KB Output is partially correct
41 Partially correct 7 ms 208 KB Output is partially correct
42 Partially correct 7 ms 336 KB Output is partially correct
43 Partially correct 7 ms 208 KB Output is partially correct
44 Partially correct 5 ms 332 KB Output is partially correct
45 Partially correct 6 ms 316 KB Output is partially correct
46 Partially correct 6 ms 208 KB Output is partially correct
47 Partially correct 5 ms 208 KB Output is partially correct
48 Partially correct 7 ms 208 KB Output is partially correct
49 Partially correct 8 ms 304 KB Output is partially correct
50 Partially correct 8 ms 320 KB Output is partially correct
51 Partially correct 5 ms 324 KB Output is partially correct
52 Partially correct 6 ms 208 KB Output is partially correct
53 Partially correct 6 ms 324 KB Output is partially correct
54 Partially correct 6 ms 316 KB Output is partially correct
55 Partially correct 6 ms 324 KB Output is partially correct
56 Partially correct 8 ms 308 KB Output is partially correct
57 Partially correct 6 ms 208 KB Output is partially correct
58 Partially correct 8 ms 328 KB Output is partially correct
59 Partially correct 8 ms 324 KB Output is partially correct
60 Partially correct 9 ms 328 KB Output is partially correct
61 Partially correct 8 ms 304 KB Output is partially correct
62 Correct 0 ms 208 KB Output is correct
63 Correct 0 ms 208 KB Output is correct
64 Correct 0 ms 208 KB Output is correct
65 Correct 1 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 0 ms 208 KB Output is correct
70 Correct 2 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 0 ms 208 KB Output is correct
76 Correct 1 ms 208 KB Output is correct
77 Correct 0 ms 208 KB Output is correct
78 Correct 1 ms 256 KB Output is correct
79 Correct 0 ms 208 KB Output is correct
80 Correct 0 ms 208 KB Output is correct
81 Correct 0 ms 208 KB Output is correct
82 Correct 1 ms 208 KB Output is correct
83 Correct 0 ms 208 KB Output is correct
84 Correct 1 ms 208 KB Output is correct
85 Correct 1 ms 208 KB Output is correct
86 Correct 0 ms 208 KB Output is correct
87 Correct 1 ms 208 KB Output is correct
88 Correct 1 ms 208 KB Output is correct
89 Correct 0 ms 208 KB Output is correct
90 Correct 0 ms 208 KB Output is correct
91 Correct 1 ms 208 KB Output is correct