oj.uz

답안 #304254

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
304254 2020-09-21T05:04:49 Z juggernaut 버섯 세기 (IOI20_mushrooms) C++14
92.623 / 100
 10 ms 512 KB 
#include"mushrooms.h"
#include<bits/stdc++.h>
//#include"stub.cpp"
using namespace std;
int count_mushrooms(int n){
    vector<int>a,b,id;
    int i=1,res=1,j;
    for(;i<n;i++)id.push_back(i);
    srand(time(NULL));
    random_shuffle(id.begin(),id.end());
    i=1;
    a.push_back(0);
    while(i<min(n,3)){
        if(use_machine({0,id[i-1]}))b.push_back(id[i-1]);
        else a.push_back(id[i-1]),res++;
        i++;
    }
    while(i+1<min(170,n)){
        if(a.size()>b.size()){
            j=use_machine({a[0],id[i-1],a[1],id[i]});
            if(j&1)b.push_back(id[i]);
            else a.push_back(id[i]),res++;
            if(j&2)b.push_back(id[i-1]);
            else a.push_back(id[i-1]),res++;
        }else{
            j=use_machine({b[0],id[i-1],b[1],id[i]});
            if(j&1)a.push_back(id[i]),res++;
            else b.push_back(id[i]);
            if(j&2)a.push_back(id[i-1]),res++;
            else b.push_back(id[i-1]);
        }
        i+=2;
    }
    while(i<n){
        if(a.size()>b.size()){
            vector<int>v;
            for(j=0;j<a.size()&&i+j<n;j++){
                v.push_back(a[j]);
                v.push_back(id[i+j-1]);
            }
            i+=j;
            j=use_machine(v);
            if(j&1)b.push_back(v.back());
            else a.push_back(v.back());
            j++;
            j>>=1;
            res+=(((int(v.size()))>>1))-j;
        }else{
            vector<int>v;
            for(j=0;j<b.size()&&i+j<n;j++){
                v.push_back(b[j]);
                v.push_back(id[i+j-1]);
            }
            i+=j;
            j=use_machine(v);
            if(j&1)a.push_back(v.back());
            else b.push_back(v.back());
            j++;
            j>>=1;
            res+=j;
        }
    }
    return res;
}

Compilation message

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

Subtask #1
92.623 / 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 1 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 7 ms 512 KB Output is correct
8 Correct 8 ms 512 KB Output is correct
9 Correct 7 ms 512 KB Output is correct
10 Correct 7 ms 512 KB Output is correct
11 Partially correct 8 ms 512 KB Output is partially correct
12 Correct 7 ms 512 KB Output is correct
13 Correct 7 ms 512 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Partially correct 8 ms 512 KB Output is partially correct
16 Partially correct 8 ms 512 KB Output is partially correct
17 Correct 4 ms 384 KB Output is correct
18 Correct 7 ms 512 KB Output is correct
19 Partially correct 7 ms 512 KB Output is partially correct
20 Correct 7 ms 512 KB Output is correct
21 Correct 9 ms 512 KB Output is correct
22 Partially correct 8 ms 512 KB Output is partially correct
23 Correct 7 ms 512 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Partially correct 8 ms 512 KB Output is partially correct
26 Partially correct 8 ms 512 KB Output is partially correct
27 Partially correct 8 ms 512 KB Output is partially correct
28 Partially correct 8 ms 512 KB Output is partially correct
29 Partially correct 10 ms 512 KB Output is partially correct
30 Partially correct 8 ms 512 KB Output is partially correct
31 Partially correct 8 ms 512 KB Output is partially correct
32 Partially correct 8 ms 512 KB Output is partially correct
33 Partially correct 8 ms 512 KB Output is partially correct
34 Partially correct 8 ms 512 KB Output is partially correct
35 Partially correct 8 ms 512 KB Output is partially correct
36 Partially correct 9 ms 512 KB Output is partially correct
37 Partially correct 8 ms 512 KB Output is partially correct
38 Partially correct 8 ms 512 KB Output is partially correct
39 Partially correct 10 ms 512 KB Output is partially correct
40 Partially correct 8 ms 512 KB Output is partially correct
41 Partially correct 8 ms 512 KB Output is partially correct
42 Partially correct 8 ms 512 KB Output is partially correct
43 Partially correct 8 ms 512 KB Output is partially correct
44 Partially correct 10 ms 512 KB Output is partially correct
45 Partially correct 7 ms 512 KB Output is partially correct
46 Partially correct 8 ms 512 KB Output is partially correct
47 Partially correct 8 ms 512 KB Output is partially correct
48 Partially correct 8 ms 512 KB Output is partially correct
49 Partially correct 9 ms 488 KB Output is partially correct
50 Partially correct 8 ms 512 KB Output is partially correct
51 Partially correct 8 ms 512 KB Output is partially correct
52 Partially correct 8 ms 512 KB Output is partially correct
53 Partially correct 8 ms 512 KB Output is partially correct
54 Partially correct 10 ms 512 KB Output is partially correct
55 Partially correct 8 ms 512 KB Output is partially correct
56 Partially correct 8 ms 512 KB Output is partially correct
57 Partially correct 7 ms 512 KB Output is partially correct
58 Partially correct 8 ms 512 KB Output is partially correct
59 Partially correct 8 ms 512 KB Output is partially correct
60 Partially correct 7 ms 512 KB Output is partially correct
61 Partially correct 8 ms 512 KB Output is partially 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 0 ms 256 KB Output is correct
75 Correct 0 ms 256 KB Output is correct
76 Correct 0 ms 256 KB Output is correct
77 Correct 0 ms 256 KB Output is correct
78 Correct 0 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 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 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 0 ms 256 KB Output is correct