Submission #312900

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
312900	2020-10-14T14:59:23 Z	DanerZein	Counting Mushrooms (IOI20_mushrooms)	C++14	80.427 / 100	10 ms	896 KB

mushrooms

#include "mushrooms.h"
#include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
int punt[100000];
int hongos=280;
void crear(int n,bool sw){
  if(sw==1){
    int p=n;
    punt[0]=n;
    int j=1;
    while(true){
      p--;
      punt[j]=punt[j+1]=p;
      j+=2;
      if(p==0) break;
    }
  }
  else{
    int p=0;
    punt[0]=0;
    int j=1;
    while(true){
      p++;
      punt[j]=punt[j+1]=p;
      j+=2;
      if(p==n) break;
    }
  }
}
int count_mushrooms(int n) {
  int res=1;
  int ca,cb;
  vi pa,pb;
  pa.push_back(0);
  ca=cb=0;
  bool sw1=0;
  if(n==1) return 1;
  if(n==2){
    vi aux;
    aux.push_back(0);
    aux.push_back(1);
    if(!use_machine(aux)) return 2;
    else return 1;
  }
  //vi a,b;
  for(int i=1;i<=2;i++){
    vector<int> aux;
    aux.push_back(i);
    aux.push_back(0);
    if(!use_machine(aux)) pa.push_back(i);
    else pb.push_back(i);
  }
  if(pa.size()>pb.size()) sw1=1;
  for(int i=3;i<=min(hongos,n-1);i+=2){
    vector<int> aux;
    aux.push_back(i);
    if(sw1==1) aux.push_back(pa[0]);
    else aux.push_back(pb[0]);
    if(i+1<=min(hongos,n-1)) aux.push_back(i+1);
    if(sw1==1) aux.push_back(pa[1]);
    else aux.push_back(pb[1]);
    int y=use_machine(aux);
    // for(int j=0;j<aux.size();j++) cout<<aux[j]<<" ";
    //cout<<y<<endl;
    if(aux.size()==3){
      if(sw1==0){
	if(y==1)
	  pa.push_back(i);
	else
	  pb.push_back(i);
      }
      else{
	if(y==1) pb.push_back(i);
	else pa.push_back(i);
      }
    }
    else{
      if(sw1==1){
	if(y==0){
	  pa.push_back(i);
	  pa.push_back(i+1);
	}
	if(y==1){
	  pa.push_back(i+1);
	  pb.push_back(i);
	}
	if(y==2){
	  pa.push_back(i);
	  pb.push_back(i+1);
	}
	if(y==3){
	  pb.push_back(i);
	  pb.push_back(i+1);
	}
      }
      else{
	if(y==0){
	  pb.push_back(i+1);
	  pb.push_back(i);
	}
	if(y==1){
	  pa.push_back(i);
	  pb.push_back(i+1);
	}
	if(y==2){
	  pb.push_back(i);
	  pa.push_back(i+1);
	}
	if(y==3){
	  pa.push_back(i);
	  pa.push_back(i+1);
	}
      }
    }
    //if(pa.size()==2 or pb.size()==2) break;
  }
  ca=pa.size();
  res=ca;
  cb=pb.size();
  memset(punt,0,sizeof punt);
  bool sw=0;
  if(ca>=cb) sw=1;
  int c=max(ca,cb);
  crear(c,sw);
  //for(int i=0;i<=4;i++) cout<<punt[i]<<" ";
  //cout<<endl;
  for(int i=hongos+1;i<n;i+=c){
    vector<int> aux;
    if(i+c>=n){
      int h=n-i;
      crear(h,sw);
    }
    for(int j=0;j<c;j++){
      if(i+j<n)aux.push_back(i+j);
      if(sw==1)
	aux.push_back(pa[j]);
      else
	aux.push_back(pb[j]);
    }
    //for(int j=0;j<aux.size();j++) cout<<aux[j]<<" ";
    //cout<<endl;
    //cout<<punt[use_machine(aux)]<<endl;
    res+=(punt[use_machine(aux)]);
  }
  //  cout<<res<<endl;
  return res;
}

Subtask #1

80.427 / 100.0

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