oj.uz

답안 #303463

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
303463 2020-09-20T10:32:16 Z dacin21 버섯 세기 (IOI20_mushrooms) C++14
90.7631 / 100
 14 ms 504 KB 
#include "mushrooms.h"
#include <bits/stdc++.h>
using namespace std;

using ll = long long;
int count_mushrooms(int n) {
    auto use = [&](vector<int> const&x){ return use_machine(x);};
    vector<char> s(n);
    // first find 2 equal ones
    const int k = min(n, 3);
    for(int i=1; i<k; ++i){
        if(use({0, i})){
            ++s[i];
        }
    }
    if(n == k){
        return count(s.begin(), s.end(), 0);
    }
    // now find sqrt(n) equal ones
    int i = k;
    {
        int me = 0;
        if(2*accumulate(s.begin(), s.begin()+k, 0) > k){
            me = 1;
        }
        vector<int> pool;
        for(int j=0; j<k; ++j){
            if(s[j] == me) pool.push_back(j);
        }
        assert(pool.size() >= 2);
        const int l = min(n, k + int(0.7*sqrt(n)));
        //debug << named(l) << "\n";
        while(i<l && i+2 < n){
            const int x = use({i, pool[0], i+1, pool[1]});
            s[i] = me ^ (x%2==1);
            s[i+1] = me ^ (x/2==1);
            i += 2;
        }
    }
    // now count
    int ans = 0;
    //debug << k << " : " << decltype(s)(s.begin(), s.begin()+i) << "\n";
    {
        array<vector<int>, 2> occ;
        for(int j=0; j<i; ++j){
            occ[s[j]].push_back(j);
        }
        //debug << named(occ) << "\n";
        while(i < n){
            const int me = (occ[1].size()>occ[0].size());
            auto&pool = occ[me];
            const int U = min<int>(n-i, occ[me].size()-1);
            //const int U = min<int>(n-i, (occ[0].size()+occ[1].size()+1)/2-1);
            vector<int> q(1, pool[0]);
            for(int j=0; j<U; ++j){
                q.push_back(i++);
                q.push_back(pool[j+1]);
            }
            bool did = false;
            if(i<n){
                did = true;
                q.push_back(i++);
            }
            int r = use(q);
            if(did){
                if(r%2 == 0){
                    occ[me].push_back(q.back());
                } else {
                    occ[!me].push_back(q.back());
                    --r;
                }
            }
            r /= 2;
            if(me == 0) r = U-r;
            ans += r;
        }
        ans += occ[0].size();
    }
    return ans;

}

Subtask #1
90.7631 / 100.0

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