답안 #598106

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
598106	2022-07-17T15:40:40 Z	ogibogi2004	버섯 세기 (IOI20_mushrooms)	C++14	80.7143 / 100	10 ms	456 KB

mushrooms

#include "mushrooms.h"
#include <bits/stdc++.h>
using namespace std;
const int K=250;
int count_mushrooms(int n) {
    vector<int>A,B;
    A.push_back(0);
    int cnta=1;
    int decided=-1;
    for(int i=1;i<n;)
    {
        int last=i;
        if(decided==0)
        {
            vector<int>v;
            for(int j=0;j<A.size()&&j<K&&i+j<n;j++)
            {
                last=i+j;
                if(i+j>=n)break;
                v.push_back(i+j);
                v.push_back(A[j]);
            }
            int f=use_machine(v);
            cnta+=v.size()/2-(f+1)/2;
            if(f%2==0)
            {
                A.push_back(i);
            }
            else
            {
                B.push_back(i);
            }
        }
        else if(decided==1)
        {
            vector<int>v;
            for(int j=0;j<B.size()&&j<K&&i+j<n;j++)
            {
                last=i+j;
                if(i+j>=n)break;
                v.push_back(i+j);
                v.push_back(B[j]);
            }
            int f=use_machine(v);
            cnta+=(f+1)/2;
            if(f%2==0)
            {
                B.push_back(i);
            }
            else
            {
                A.push_back(i);
            }
        }
        else
        {
            if(A.size()>B.size())
            {
                vector<int>v;
                for(int j=0;j<A.size()&&j<K&&i+j<n;j++)
                {
                    last=i+j;
                    if(i+j>=n)break;
                    v.push_back(i+j);
                    v.push_back(A[j]);
                }
                int f=use_machine(v);
                cnta+=v.size()/2-(f+1)/2;
                if(f%2==0)
                {
                    A.push_back(i);
                }
                else
                {
                    B.push_back(i);
                }
            }
            else
            {
                vector<int>v;
                for(int j=0;j<B.size()&&j<K&&i+j<n;j++)
                {
                    last=i+j;
                    if(i+j>=n)break;
                    v.push_back(i+j);
                    v.push_back(B[j]);
                }
                int f=use_machine(v);
                cnta+=(f+1)/2;
                if(f%2==0)
                {
                    B.push_back(i);
                }
                else
                {
                    A.push_back(i);
                }
            }
            if(A.size()==K)decided=0;
            else if(B.size()==K)decided=1;
        }
        //cout<<last<<" "<<cnta<<endl;
        i=last+1;
    }
    return cnta;
}

Compilation message

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

Subtask #1

80.7143 / 100.0

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