oj.uz

Submission #388179

# Submission time Handle Problem Language Result Execution time Memory
388179 2021-04-10T11:16:05 Z Ahmadsm2005 Counting Mushrooms (IOI20_mushrooms) C++14
80.427 / 100
 12 ms 328 KB 
#include<bits/stdc++.h>
#include "mushrooms.h"
using namespace std;
///Square ROOT 142
vector<int>REM;
vector<int>A,B;
int LAST,SQR=141;
/*int use_machine(vector<int>F){
for(int i=0;i<F.size();i++)
cout<<F[i]<<' ';
int X;
cin>>X;
return X;
}*/
int count_mushrooms(int n){
vector<int>m;
A.push_back(0);
m.push_back(0),m.push_back(1);
if(use_machine(m))
B.push_back(1);
else
A.push_back(1);
if(n==2){
return A.size();
}
m.pop_back(),m.push_back(2);
if(use_machine(m))
B.push_back(2);
else
A.push_back(2);
LAST=3;
for(int i=3;i<n;i+=2){
vector<int>TEMP;
if(i+1==n){
TEMP.push_back(0),TEMP.push_back(i);
if(use_machine(TEMP))
B.push_back(i);
else
A.push_back(i);
return A.size();
}
if(A.size()>=2){
TEMP.push_back(A[0]),TEMP.push_back(i),TEMP.push_back(A[1]),TEMP.push_back(i+1);
int ANS=use_machine(TEMP);
if(!ANS)
A.push_back(i),A.push_back(i+1);
else if(ANS==1)
A.push_back(i),B.push_back(i+1);
else if(ANS==2)
A.push_back(i+1),B.push_back(i);
else
B.push_back(i),B.push_back(i+1);
}
else{
TEMP.push_back(B[0]),TEMP.push_back(i),TEMP.push_back(B[1]),TEMP.push_back(i+1);
int ANS=use_machine(TEMP);
if(!ANS)
B.push_back(i),B.push_back(i+1);
else if(ANS==1)
B.push_back(i),A.push_back(i+1);
else if(ANS==2)
B.push_back(i+1),A.push_back(i);
else
A.push_back(i),A.push_back(i+1);
}
LAST=i+2;
if(A.size()>=SQR||B.size()>=SQR){
break;
}
}
bool SWAP=0;
int AA=0;
AA=A.size();
if(B.size()>=SQR)
A=B,SWAP=1;
for(int l=LAST;l<n;l+=SQR){
vector<int>LIST,TEMP;
for(int x=l;x<min(n,l+SQR);x++){
LIST.push_back(x);
}
TEMP.push_back(A[0]);
for(int i=0;i<LIST.size();i++){
TEMP.push_back(LIST[i]);
if(i+1!=LIST.size())
TEMP.push_back(A[i+1]);
}
if(SWAP)
AA+=(use_machine(TEMP)+1)/2;
else
AA+=(LIST.size()-(use_machine(TEMP)+1)/2);
}
return AA;
}

Compilation message

mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:67:12: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   67 | if(A.size()>=SQR||B.size()>=SQR){
      |    ~~~~~~~~^~~~~
mushrooms.cpp:67:27: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   67 | if(A.size()>=SQR||B.size()>=SQR){
      |                   ~~~~~~~~^~~~~
mushrooms.cpp:74:12: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   74 | if(B.size()>=SQR)
      |    ~~~~~~~~^~~~~
mushrooms.cpp:82:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   82 | for(int i=0;i<LIST.size();i++){
      |             ~^~~~~~~~~~~~
mushrooms.cpp:84:7: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   84 | if(i+1!=LIST.size())
      |    ~~~^~~~~~~~~~~~~

Subtask #1
80.427 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 1 ms 200 KB Output is correct
5 Correct 2 ms 200 KB Output is correct
6 Correct 2 ms 200 KB Output is correct
7 Correct 7 ms 200 KB Output is correct
8 Correct 7 ms 200 KB Output is correct
9 Correct 7 ms 200 KB Output is correct
10 Partially correct 8 ms 200 KB Output is partially correct
11 Partially correct 8 ms 200 KB Output is partially correct
12 Partially correct 7 ms 200 KB Output is partially correct
13 Correct 7 ms 200 KB Output is correct
14 Correct 6 ms 200 KB Output is correct
15 Partially correct 7 ms 200 KB Output is partially correct
16 Partially correct 8 ms 200 KB Output is partially correct
17 Correct 4 ms 200 KB Output is correct
18 Correct 7 ms 200 KB Output is correct
19 Partially correct 8 ms 200 KB Output is partially correct
20 Partially correct 6 ms 300 KB Output is partially correct
21 Partially correct 8 ms 200 KB Output is partially correct
22 Partially correct 8 ms 200 KB Output is partially correct
23 Partially correct 9 ms 200 KB Output is partially correct
24 Correct 5 ms 200 KB Output is correct
25 Partially correct 8 ms 200 KB Output is partially correct
26 Partially correct 8 ms 200 KB Output is partially correct
27 Partially correct 8 ms 200 KB Output is partially correct
28 Partially correct 7 ms 200 KB Output is partially correct
29 Partially correct 8 ms 200 KB Output is partially correct
30 Partially correct 8 ms 200 KB Output is partially correct
31 Partially correct 8 ms 200 KB Output is partially correct
32 Partially correct 8 ms 200 KB Output is partially correct
33 Partially correct 8 ms 200 KB Output is partially correct
34 Partially correct 8 ms 200 KB Output is partially correct
35 Partially correct 7 ms 304 KB Output is partially correct
36 Partially correct 8 ms 200 KB Output is partially correct
37 Partially correct 10 ms 200 KB Output is partially correct
38 Partially correct 8 ms 200 KB Output is partially correct
39 Partially correct 8 ms 200 KB Output is partially correct
40 Partially correct 8 ms 328 KB Output is partially correct
41 Partially correct 12 ms 308 KB Output is partially correct
42 Partially correct 7 ms 200 KB Output is partially correct
43 Partially correct 8 ms 200 KB Output is partially correct
44 Partially correct 8 ms 204 KB Output is partially correct
45 Partially correct 7 ms 200 KB Output is partially correct
46 Partially correct 9 ms 200 KB Output is partially correct
47 Partially correct 8 ms 200 KB Output is partially correct
48 Partially correct 7 ms 200 KB Output is partially correct
49 Partially correct 8 ms 200 KB Output is partially correct
50 Partially correct 8 ms 200 KB Output is partially correct
51 Partially correct 8 ms 200 KB Output is partially correct
52 Partially correct 8 ms 200 KB Output is partially correct
53 Partially correct 8 ms 200 KB Output is partially correct
54 Partially correct 7 ms 200 KB Output is partially correct
55 Partially correct 8 ms 200 KB Output is partially correct
56 Partially correct 8 ms 204 KB Output is partially correct
57 Partially correct 7 ms 200 KB Output is partially correct
58 Partially correct 8 ms 200 KB Output is partially correct
59 Partially correct 8 ms 200 KB Output is partially correct
60 Partially correct 8 ms 200 KB Output is partially correct
61 Partially correct 8 ms 204 KB Output is partially correct
62 Correct 0 ms 200 KB Output is correct
63 Correct 0 ms 200 KB Output is correct
64 Correct 0 ms 200 KB Output is correct
65 Correct 1 ms 200 KB Output is correct
66 Correct 0 ms 200 KB Output is correct
67 Correct 0 ms 200 KB Output is correct
68 Correct 0 ms 200 KB Output is correct
69 Correct 1 ms 200 KB Output is correct
70 Correct 1 ms 200 KB Output is correct
71 Correct 0 ms 200 KB Output is correct
72 Correct 0 ms 200 KB Output is correct
73 Correct 0 ms 200 KB Output is correct
74 Correct 1 ms 200 KB Output is correct
75 Correct 0 ms 200 KB Output is correct
76 Correct 0 ms 200 KB Output is correct
77 Correct 0 ms 200 KB Output is correct
78 Correct 0 ms 200 KB Output is correct
79 Correct 1 ms 284 KB Output is correct
80 Correct 0 ms 204 KB Output is correct
81 Correct 0 ms 200 KB Output is correct
82 Correct 0 ms 200 KB Output is correct
83 Correct 0 ms 200 KB Output is correct
84 Correct 0 ms 200 KB Output is correct
85 Correct 1 ms 200 KB Output is correct
86 Correct 0 ms 200 KB Output is correct
87 Correct 0 ms 200 KB Output is correct
88 Correct 0 ms 200 KB Output is correct
89 Correct 0 ms 200 KB Output is correct
90 Correct 0 ms 200 KB Output is correct
91 Correct 0 ms 200 KB Output is correct