답안 #802217

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
802217	2023-08-02T11:08:25 Z	lollipop	버섯 세기 (IOI20_mushrooms)	C++17	80.7143 / 100	8 ms	536 KB

mushrooms

#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
#define ll long long
#define pb push_back
#define s second
#define f first
#define pf push_front
#define inf 100000000000000000
#define bitebi __builtin_popcountll
#define FOR( i , n ) for( int i = 0 ; i < n ; i ++ )
#define YES cout <<"YES\n"
#define NO cout << "NO\n"
#define debug cout << "Here Fine" << endl ;
#define pr pair < int , int >
#define fbo find_by_order // returns iterator
#define ook order_of_key // returns strictly less numbers than key
using namespace std ;
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,fma")
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
const double Pi=acos(-1.0);
const double EPS=1E-8;
const int mod =  1000000007 ;
const int mod1 = 998244353 ;
const int NN = 2e5 + 10 ;
//mt19937 R(time(0));
int myrandom (int i) { return std::rand()%i;}
map < int , int > ma , ma1 ;

#include "mushrooms.h"

// int use_machine(std::vector<int> x){

// }


int count_mushrooms(int n){
    vector < int > a , A , b , B ;
    a.pb( 0 ) ;
    for( int j = 1 ; j < n ; j ++ ){
      int sss = a.size() ;
      int sss1 = b.size() ;
      if( sss >= sss1 ){
        int lf = ( n - j ) ;
        int jj = j ;
        int ss = a.size() ;
        int mn = min( ss , lf ) ;
        vector < int > v ;
        int nw = 0 ;
        FOR( kk , mn ){
          v.pb( a[ kk ] ) ;
          v.pb( jj ) ; jj ++ ;
          nw ++ ;
        }
        int x = use_machine( v ) ;
        if( x % 2 == 1 ){
           b.pb( jj - 1 ) ; 
        } else a.pb( jj - 1 )  ;
         int cc = 0 ;
         while( x > 0 ){
          cc ++ ; x-= 2 ;
         }
         cc = nw - cc ;
        if( x % 2 == 0 ) cc -- ;
         while( cc -- ) A.pb( 1 ) ;
         j = jj - 1 ;
      }
      else{
        int lf = ( n - j ) ;
        int jj = j ;
        int sus = b.size() ;
        int mn = min( sus , lf ) ;
        vector < int > v ;
        FOR( kk , mn ){
          v.pb( b[ kk ] ) ;
          v.pb( jj ) ; jj ++ ;
        }
        int x = use_machine( v ) ;
        if( x % 2 == 1 ){
           a.pb( jj - 1 ) ; 
        } else b.pb( jj - 1 ) ;
        int X = x ;
         while( x > 0 ){
          A.pb( 1 ) ;
           x-= 2 ;
         }
         if( X % 2 == 1 ) A.pop_back();
        j = jj - 1 ;
      }
    }
    int sis = a.size() + A.size() ;
    return sis ;
}

//int use_machine(std::vector<int> x)

Subtask #1

80.7143 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	208 KB	Output is correct
2	Correct	1 ms	208 KB	Output is correct
3	Correct	1 ms	208 KB	Output is correct
4	Correct	1 ms	208 KB	Output is correct
5	Correct	2 ms	208 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	5 ms	464 KB	Output is correct
8	Correct	8 ms	464 KB	Output is correct
9	Correct	5 ms	472 KB	Output is correct
10	Partially correct	6 ms	396 KB	Output is partially correct
11	Partially correct	7 ms	336 KB	Output is partially correct
12	Partially correct	6 ms	380 KB	Output is partially correct
13	Correct	7 ms	336 KB	Output is correct
14	Correct	4 ms	336 KB	Output is correct
15	Partially correct	6 ms	372 KB	Output is partially correct
16	Partially correct	4 ms	420 KB	Output is partially correct
17	Correct	3 ms	328 KB	Output is correct
18	Correct	6 ms	328 KB	Output is correct
19	Partially correct	5 ms	416 KB	Output is partially correct
20	Partially correct	5 ms	376 KB	Output is partially correct
21	Partially correct	7 ms	312 KB	Output is partially correct
22	Partially correct	6 ms	336 KB	Output is partially correct
23	Correct	7 ms	420 KB	Output is correct
24	Correct	3 ms	464 KB	Output is correct
25	Partially correct	6 ms	368 KB	Output is partially correct
26	Partially correct	6 ms	496 KB	Output is partially correct
27	Partially correct	5 ms	348 KB	Output is partially correct
28	Partially correct	6 ms	412 KB	Output is partially correct
29	Partially correct	7 ms	368 KB	Output is partially correct
30	Partially correct	6 ms	432 KB	Output is partially correct
31	Partially correct	5 ms	324 KB	Output is partially correct
32	Partially correct	7 ms	332 KB	Output is partially correct
33	Partially correct	5 ms	336 KB	Output is partially correct
34	Partially correct	5 ms	344 KB	Output is partially correct
35	Partially correct	5 ms	416 KB	Output is partially correct
36	Partially correct	6 ms	400 KB	Output is partially correct
37	Partially correct	7 ms	304 KB	Output is partially correct
38	Partially correct	5 ms	304 KB	Output is partially correct
39	Partially correct	6 ms	496 KB	Output is partially correct
40	Partially correct	7 ms	488 KB	Output is partially correct
41	Partially correct	5 ms	536 KB	Output is partially correct
42	Partially correct	5 ms	372 KB	Output is partially correct
43	Partially correct	7 ms	336 KB	Output is partially correct
44	Partially correct	5 ms	416 KB	Output is partially correct
45	Partially correct	6 ms	444 KB	Output is partially correct
46	Partially correct	7 ms	372 KB	Output is partially correct
47	Partially correct	5 ms	420 KB	Output is partially correct
48	Partially correct	5 ms	420 KB	Output is partially correct
49	Partially correct	6 ms	316 KB	Output is partially correct
50	Partially correct	5 ms	412 KB	Output is partially correct
51	Partially correct	6 ms	336 KB	Output is partially correct
52	Partially correct	6 ms	416 KB	Output is partially correct
53	Partially correct	5 ms	336 KB	Output is partially correct
54	Partially correct	6 ms	336 KB	Output is partially correct
55	Partially correct	5 ms	336 KB	Output is partially correct
56	Partially correct	6 ms	364 KB	Output is partially correct
57	Partially correct	5 ms	308 KB	Output is partially correct
58	Partially correct	5 ms	324 KB	Output is partially correct
59	Partially correct	7 ms	364 KB	Output is partially correct
60	Partially correct	6 ms	472 KB	Output is partially correct
61	Partially correct	7 ms	356 KB	Output is partially correct
62	Correct	0 ms	208 KB	Output is correct
63	Correct	0 ms	208 KB	Output is correct
64	Correct	0 ms	208 KB	Output is correct
65	Correct	1 ms	208 KB	Output is correct
66	Correct	1 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	0 ms	208 KB	Output is correct
70	Correct	0 ms	208 KB	Output is correct
71	Correct	0 ms	208 KB	Output is correct
72	Correct	0 ms	208 KB	Output is correct
73	Correct	0 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	1 ms	208 KB	Output is correct
78	Correct	0 ms	208 KB	Output is correct
79	Correct	1 ms	208 KB	Output is correct
80	Correct	0 ms	208 KB	Output is correct
81	Correct	1 ms	208 KB	Output is correct
82	Correct	1 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	1 ms	208 KB	Output is correct
86	Correct	1 ms	276 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