oj.uz

답안 #604621

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
604621 2022-07-25T08:13:22 Z rrrr10000 버섯 세기 (IOI20_mushrooms) C++14
92.623 / 100
 9 ms 360 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef pair<ll,ll> P;
typedef vector<P> vp;
typedef vector<vp> vvp;
typedef vector<bool> vb;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define REP(i,k,n) for(ll i=(ll)(k);i<(ll)(n);i++)
#define all(a) a.begin(),a.end()
#define fi first
#define se second
#define pb emplace_back
template<class T> void out(T a){cout<<a<<endl;}
#include "mushrooms.h"
int count_mushrooms(int n){
    if(n<=226){
        int ans=1;
        vector<int> ask(2);
        REP(i,1,n){
            ask[1]=i;
            int res=use_machine(ask);
            if(res==0)ans++;
        }
        return ans;
    }
    int B=167,f=0;
    if(B%2==0)B++;
    vi va,vb;va.pb(0);
    {
        REP(i,1,3){
            vector<int> ask(2);
            ask[1]=i;
            int res=use_machine(ask);
            if(res==0)va.pb(i);
            else vb.pb(i);
        }
        if(va.size()<vb.size()){
            swap(va,vb);f^=1;
        }
    }
    {
        for(ll i=3;i<B;i+=2){
            vector<int> ask(4);
            ask[1]=va[0];ask[3]=va[1];
            ask[0]=i;ask[2]=i+1;
            int res=use_machine(ask);
            if(res%2==0)va.pb(i);
            else vb.pb(i);
            if(res/2==0)va.pb(i+1);
            else vb.pb(i+1);
        }
        if(va.size()<vb.size()){
            swap(va,vb);f^=1;
        }
    }
    int ans=0;
    for(ll i=B;i<n;){
        vi al;
        REP(j,i,i+va.size())if(j<n)al.pb(j);
        i+=va.size();
        vector<int> ask(al.size()*2);
        rep(j,al.size())ask[j*2]=al[j];
        rep(j,al.size())ask[j*2+1]=va[j];
        int res=use_machine(ask);
        if(f==1)ans+=res/2;
        else ans+=al.size()-1-res/2;
        if(res%2==0)va.pb(al[0]);
        else vb.pb(al[0]);
        if(va.size()<vb.size()){
            swap(va,vb);f^=1;
        }
    }
    if(f)ans+=vb.size();
    else ans+=va.size();
    return ans;
}

Subtask #1
92.623 / 100.0

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