oj.uz

답안 #305078

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
305078 2020-09-22T14:21:50 Z MarcoMeijer 버섯 세기 (IOI20_mushrooms) C++14
100 / 100
 9 ms 384 KB 
#include "mushrooms.h"
#include <bits/stdc++.h>
using namespace std;

// macros
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define FOR(a,b) for(auto& a : b)
#define all(a) a.begin(), a.end()
#define INF 1e9
#define EPS 1e-9
#define pb push_back
#define popb pop_back
#define fi first
#define se second
#define sz size()

int mx=195;

int count_mushrooms(int n) {
    if(n <= 227) {
        int ans = 1;
        REP(i,1,n) ans += 1-use_machine({0,i});
        return ans;
    }
    int cur = 0;
    vi a[2]; bool swp = 0;
    a[0].pb(cur++);

    // A_
    while(a[0].size() < 2 && a[1].size() < 2) {
        a[use_machine({a[0][0], cur})].pb(cur);
        cur++;
    }
    if(a[1].size() > a[0].size()) swap(a[0],a[1]), swp^=1;

    // A_A_
    while(a[0].size() < 3 && a[1].size() < 3) {
        vi m;
        m.pb(a[0][0]);
        m.pb(cur);
        m.pb(a[0][1]);
        m.pb(cur+1);
        int res = use_machine(m);
        a[(res&2)==2].pb(cur);
        a[(res&1)==1].pb(cur+1);
        cur += 2;
    }
    if(a[1].size() > a[0].size()) swap(a[0],a[1]), swp^=1;

    // A_A_A_ => A_A_
    while(cur < mx && a[1].size() < 2) {
        vi m;
        m.pb(a[0][0]);
        m.pb(cur);
        m.pb(a[0][1]);
        m.pb(cur+1);
        m.pb(a[0][2]);
        m.pb(cur+2);
        int res = use_machine(m);
        a[(res&1)==1].pb(cur+2);
        if(res&2) {
            m.clear();
            m.pb(a[0][0]);
            m.pb(cur);
            m.pb(a[0][1]);
            m.pb(cur+1);
            res = use_machine(m);
            a[(res&2)==2].pb(cur);
            a[(res&1)==1].pb(cur+1);
        } else {    
            a[(res&4)==4].pb(cur  );
            a[(res&4)==4].pb(cur+1);
        }
        cur += 3;
        if(a[1].size() > a[0].size()) swap(a[0],a[1]), swp^=1;
    }

    // A_A_A_ => B_BA_A_A_
    while(cur < mx) {
        vi m;
        m.pb(a[0][0]);
        m.pb(cur);
        m.pb(a[0][1]);
        m.pb(cur+1);
        m.pb(a[0][2]);
        m.pb(cur+2);
        int res = use_machine(m);
        a[(res&1)==1].pb(cur+2);
        if(res&2) {
            m.clear();
            m.pb(a[1][0]);
            m.pb(cur);
            m.pb(a[1][1]);
            m.pb(a[0][0]);
            m.pb(cur+1);
            m.pb(a[0][1]);
            m.pb(cur+3);
            m.pb(a[0][2]);
            m.pb(cur+4);
            res = use_machine(m)-1;
            a[(res&2)==2].pb(cur+3);
            a[(res&1)==1].pb(cur+4);
            if(res&4) {
                a[0].pb(cur);
                a[1].pb(cur+1);
            } else {
                a[1].pb(cur);
                a[0].pb(cur+1);
            }
            cur += 5;
        } else {
            a[(res&4)==4].pb(cur+1);
            a[(res&4)==4].pb(cur  );
            cur += 3;
        }
    }
    if(a[1].size() > a[0].size()) swap(a[0],a[1]), swp^=1;

    int ans = a[swp].size();
    while(cur < n) {
        vi m;
        FOR(i,a[0]) {
            m.pb(i);
            m.pb(cur++);
            if(cur == n) break;
        }
        int res = use_machine(m);
        if(swp) ans += (res+1)/2;
        else ans += m.size()/2 - (res+1)/2;
        
        a[(res&1)==1].pb(cur-1);
        if(a[1].size() > a[0].size()) swap(a[0],a[1]), swp^=1;
    }
    return ans;
}

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 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 2 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 7 ms 376 KB Output is correct
8 Correct 6 ms 256 KB Output is correct
9 Correct 8 ms 376 KB Output is correct
10 Correct 7 ms 256 KB Output is correct
11 Correct 7 ms 384 KB Output is correct
12 Correct 7 ms 256 KB Output is correct
13 Correct 6 ms 384 KB Output is correct
14 Correct 4 ms 256 KB Output is correct
15 Correct 8 ms 256 KB Output is correct
16 Correct 7 ms 256 KB Output is correct
17 Correct 4 ms 256 KB Output is correct
18 Correct 7 ms 256 KB Output is correct
19 Correct 9 ms 256 KB Output is correct
20 Correct 7 ms 384 KB Output is correct
21 Correct 8 ms 384 KB Output is correct
22 Correct 7 ms 256 KB Output is correct
23 Correct 6 ms 384 KB Output is correct
24 Correct 4 ms 384 KB Output is correct
25 Correct 7 ms 384 KB Output is correct
26 Correct 7 ms 256 KB Output is correct
27 Correct 6 ms 380 KB Output is correct
28 Correct 7 ms 384 KB Output is correct
29 Correct 7 ms 256 KB Output is correct
30 Correct 7 ms 256 KB Output is correct
31 Correct 8 ms 256 KB Output is correct
32 Correct 7 ms 384 KB Output is correct
33 Correct 7 ms 256 KB Output is correct
34 Correct 9 ms 256 KB Output is correct
35 Correct 7 ms 384 KB Output is correct
36 Correct 7 ms 256 KB Output is correct
37 Correct 9 ms 256 KB Output is correct
38 Correct 7 ms 256 KB Output is correct
39 Correct 7 ms 256 KB Output is correct
40 Correct 7 ms 384 KB Output is correct
41 Correct 7 ms 256 KB Output is correct
42 Correct 7 ms 256 KB Output is correct
43 Correct 7 ms 256 KB Output is correct
44 Correct 6 ms 380 KB Output is correct
45 Correct 8 ms 384 KB Output is correct
46 Correct 7 ms 256 KB Output is correct
47 Correct 9 ms 256 KB Output is correct
48 Correct 6 ms 256 KB Output is correct
49 Correct 7 ms 384 KB Output is correct
50 Correct 7 ms 256 KB Output is correct
51 Correct 7 ms 376 KB Output is correct
52 Correct 9 ms 256 KB Output is correct
53 Correct 7 ms 384 KB Output is correct
54 Correct 9 ms 256 KB Output is correct
55 Correct 9 ms 256 KB Output is correct
56 Correct 9 ms 256 KB Output is correct
57 Correct 7 ms 256 KB Output is correct
58 Correct 8 ms 384 KB Output is correct
59 Correct 7 ms 384 KB Output is correct
60 Correct 7 ms 256 KB Output is correct
61 Correct 9 ms 376 KB Output is correct
62 Correct 0 ms 256 KB Output is correct
63 Correct 0 ms 256 KB Output is correct
64 Correct 0 ms 256 KB Output is correct
65 Correct 0 ms 256 KB Output is correct
66 Correct 0 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 0 ms 256 KB Output is correct
70 Correct 0 ms 256 KB Output is correct
71 Correct 0 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 256 KB Output is correct
75 Correct 0 ms 256 KB Output is correct
76 Correct 1 ms 256 KB Output is correct
77 Correct 0 ms 256 KB Output is correct
78 Correct 1 ms 256 KB Output is correct
79 Correct 0 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 0 ms 256 KB Output is correct
83 Correct 0 ms 256 KB Output is correct
84 Correct 0 ms 256 KB Output is correct
85 Correct 1 ms 384 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