oj.uz

답안 #602118

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
602118 2022-07-22T15:05:47 Z definitelynotmee 버섯 세기 (IOI20_mushrooms) C++17
92.623 / 100
 13 ms 452 KB 
#include "mushrooms.h"
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
using ll = long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
template<typename T>
using matrix = vector<vector<T>>;

const int initial =175;

int count_mushrooms(int n) {
    if(n <= 3){
        int resp = 1;
        for(int i = 1; i < n; i++)
            resp+=use_machine({0,i})^1;
        return resp;
    }
    vector<int> start(initial,-1);
    start[0] = 1;
    start[1] = use_machine({0,1})^1;
    start[2] = use_machine({0,2})^1;
    int q1 = 0, q2 = 1, qresp = 1;
    if(start[1] != 1){
        if(start[2] != 1){
            q1 = 1, q2 = 2, qresp = 0;
        } else q2 = 2;
    }
    for(int i = 3; i+1 < min(initial,n); i+=2){
        int ret = use_machine({q1,i+1,q2,i});
        for(int j = 0; j < 2; j++){
            if((1<<j)&ret)
                start[i+j] = qresp^1;
            else start[i+j] = qresp;
        }
    }
    if(start[min(initial,n)-1] == -1){
        start[min(initial,n)-1] = use_machine({0,min(initial,n)-1})^1;
    }
    int resp = 0;
    array<vector<int>,2> mush;
    for(int i = 0; i < min(initial,n); i++){
        //cout << start[i] << ' ';
        resp+=start[i];
        mush[start[i]].push_back(i);
    }
    //cout << '\n';

    int id = initial;
    while(id < n){
        int type = mush[0].size() > mush[1].size() ? 0 : 1;
        vector<int> query;
        int ptr = 0, ct = 0;
        while(id < n && ptr < mush[type].size()){
            query.push_back(mush[type][ptr]);
            query.push_back(id);
            ptr++;
            id++;
            ct++;
        }
        int ret = use_machine(query);
        resp+=type ? ct-(ret+1)/2 : (ret+1)/2;
        if(ret&1)
            mush[type^1].push_back(id-1);
        else mush[type].push_back(id-1);
    }
	
	return resp;
}

Compilation message

mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:57:29: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |         while(id < n && ptr < mush[type].size()){
      |                         ~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
92.623 / 100.0

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