oj.uz

답안 #927268

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
927268 2024-02-14T14:54:50 Z velislavgarkov 버섯 세기 (IOI20_mushrooms) C++14
91.8699 / 100
 5 ms 728 KB 
#include "mushrooms.h"
#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
const int BUCK=64;
vector <int> br[2], mach;
int find_eq(int n) {
    bool fl=false;
    int start=3, gr=2*BUCK;
    if (n<=300) {
        fl=true;
        gr=n;
    }
    for (int i=3;i<gr;i+=2) {
        if (i==n-1) {
            start=n-1;
            break;
        }
        int type;
        if (br[0].size()>1) type=0;
        else type=1;
        int s=use_machine({i,br[type][0],i+1,br[type][1]});
        if (s==0) {
            br[type].push_back(i);
            br[type].push_back(i+1);
        } else if (s==1) {
            br[!type].push_back(i);
            br[type].push_back(i+1);
        } else if (s==2) {
            br[type].push_back(i);
            br[!type].push_back(i+1);
        } else {
            br[!type].push_back(i);
            br[!type].push_back(i+1);
        }
        start=i+2;
        //if (br[0].size()>BUCK || br[1].size()>BUCK) break;
    }
    if (start==n-1) {
        if (!use_machine({0,n-1})) br[0].push_back(n-1);
        else br[1].push_back(n-1);
    }
    if (fl) start=-1;
    return start;
}
int count_mushrooms(int n) {
    br[0].push_back(0);
    if (!use_machine({0,1})) br[0].push_back(1);
    else br[1].push_back(1);
    if (n==2) return br[0].size();
    if (!use_machine({0,2})) br[0].push_back(2);
    else br[1].push_back(2);
    if (n==3) return br[0].size();

    int start=find_eq(n);
    if (start==-1) return br[0].size();
    
    int cur, last;
    if (br[0].size()>=br[1].size()) cur=0;
    else cur=1;
    int ans=br[0].size();
    for (int i=start;i<n;i+=last) {
        if (!mach.empty()) mach.clear();
        for (int j=0;j<br[cur].size() && i+j<n;j++) {
            mach.push_back(i+j);
            mach.push_back(br[cur][j]);
        }
        int s=use_machine(mach);
        last=br[cur].size();
        if (s%2==0) br[cur].push_back(i);
        else br[!cur].push_back(i);
        if (cur==1) ans+=(s+1)/2;
        else ans+=mach.size()/2-(s+1)/2;
        if (br[0].size()>=br[1].size()) cur=0;
        else cur=1;
    }
    return ans;
}

Compilation message

mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:65:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   65 |         for (int j=0;j<br[cur].size() && i+j<n;j++) {
      |                      ~^~~~~~~~~~~~~~~

Subtask #1
91.8699 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 440 KB Output is correct
6 Correct 1 ms 448 KB Output is correct
7 Correct 4 ms 448 KB Output is correct
8 Correct 4 ms 448 KB Output is correct
9 Correct 4 ms 448 KB Output is correct
10 Correct 4 ms 472 KB Output is correct
11 Partially correct 4 ms 476 KB Output is partially correct
12 Correct 5 ms 464 KB Output is correct
13 Correct 4 ms 452 KB Output is correct
14 Correct 3 ms 464 KB Output is correct
15 Partially correct 5 ms 472 KB Output is partially correct
16 Partially correct 5 ms 600 KB Output is partially correct
17 Correct 2 ms 460 KB Output is correct
18 Correct 4 ms 700 KB Output is correct
19 Partially correct 4 ms 724 KB Output is partially correct
20 Correct 4 ms 464 KB Output is correct
21 Correct 5 ms 464 KB Output is correct
22 Partially correct 4 ms 728 KB Output is partially correct
23 Correct 4 ms 460 KB Output is correct
24 Correct 2 ms 468 KB Output is correct
25 Partially correct 5 ms 472 KB Output is partially correct
26 Partially correct 5 ms 720 KB Output is partially correct
27 Partially correct 4 ms 468 KB Output is partially correct
28 Partially correct 5 ms 468 KB Output is partially correct
29 Partially correct 4 ms 468 KB Output is partially correct
30 Partially correct 4 ms 468 KB Output is partially correct
31 Partially correct 4 ms 472 KB Output is partially correct
32 Partially correct 4 ms 472 KB Output is partially correct
33 Partially correct 4 ms 628 KB Output is partially correct
34 Partially correct 4 ms 468 KB Output is partially correct
35 Partially correct 4 ms 472 KB Output is partially correct
36 Partially correct 4 ms 468 KB Output is partially correct
37 Partially correct 5 ms 472 KB Output is partially correct
38 Partially correct 5 ms 700 KB Output is partially correct
39 Partially correct 4 ms 472 KB Output is partially correct
40 Partially correct 5 ms 472 KB Output is partially correct
41 Partially correct 4 ms 472 KB Output is partially correct
42 Partially correct 4 ms 472 KB Output is partially correct
43 Partially correct 5 ms 468 KB Output is partially correct
44 Partially correct 4 ms 468 KB Output is partially correct
45 Partially correct 4 ms 468 KB Output is partially correct
46 Partially correct 4 ms 472 KB Output is partially correct
47 Partially correct 4 ms 476 KB Output is partially correct
48 Partially correct 4 ms 468 KB Output is partially correct
49 Partially correct 4 ms 472 KB Output is partially correct
50 Partially correct 4 ms 468 KB Output is partially correct
51 Partially correct 4 ms 468 KB Output is partially correct
52 Partially correct 5 ms 720 KB Output is partially correct
53 Partially correct 4 ms 724 KB Output is partially correct
54 Partially correct 4 ms 472 KB Output is partially correct
55 Partially correct 4 ms 476 KB Output is partially correct
56 Partially correct 4 ms 476 KB Output is partially correct
57 Partially correct 4 ms 616 KB Output is partially correct
58 Partially correct 4 ms 720 KB Output is partially correct
59 Partially correct 5 ms 708 KB Output is partially correct
60 Partially correct 5 ms 472 KB Output is partially correct
61 Partially correct 4 ms 468 KB Output is partially correct
62 Correct 0 ms 344 KB Output is correct
63 Correct 0 ms 344 KB Output is correct
64 Correct 0 ms 344 KB Output is correct
65 Correct 0 ms 344 KB Output is correct
66 Correct 0 ms 344 KB Output is correct
67 Correct 0 ms 344 KB Output is correct
68 Correct 0 ms 344 KB Output is correct
69 Correct 1 ms 344 KB Output is correct
70 Correct 1 ms 344 KB Output is correct
71 Correct 0 ms 344 KB Output is correct
72 Correct 0 ms 344 KB Output is correct
73 Correct 0 ms 344 KB Output is correct
74 Correct 0 ms 344 KB Output is correct
75 Correct 0 ms 344 KB Output is correct
76 Correct 1 ms 344 KB Output is correct
77 Correct 1 ms 344 KB Output is correct
78 Correct 0 ms 344 KB Output is correct
79 Correct 0 ms 344 KB Output is correct
80 Correct 0 ms 344 KB Output is correct
81 Correct 0 ms 344 KB Output is correct
82 Correct 0 ms 344 KB Output is correct
83 Correct 1 ms 344 KB Output is correct
84 Correct 0 ms 344 KB Output is correct
85 Correct 0 ms 344 KB Output is correct
86 Correct 0 ms 344 KB Output is correct
87 Correct 0 ms 344 KB Output is correct
88 Correct 0 ms 344 KB Output is correct
89 Correct 0 ms 344 KB Output is correct
90 Correct 0 ms 344 KB Output is correct
91 Correct 0 ms 388 KB Output is correct