oj.uz

답안 #830227

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
830227 2023-08-19T00:12:00 Z Edu175 버섯 세기 (IOI20_mushrooms) C++17
56.927 / 100
 9 ms 336 KB 
#include "mushrooms.h"
#include <bits/stdc++.h>
#define pb push_back
#define fst first
#define snd second
#define fore(i,a,b) for(ll i=a,ioi=b;i<ioi;i++)
#define SZ(x) ((int)x.size())
#define ALL(x) x.begin(),x.end()
#define mset(a,v) memset((a),(v),sizeof(a))
#define imp(v) for(auto dfh:v)cout<<dfh<<" ";cout<<"\n"
using namespace std;
typedef long long ll;
typedef pair<ll,ll> ii;
const ll MAXN=2e4+5;

ll ask(vector<ll>a){
	vector<int>ai;
	for(auto i:a)ai.pb(i);
	return use_machine(ai);
}

const ll B=95;

int count_mushrooms(int N){
	ll n=N;
	vector<ll>a[2];
	a[0]={0};
	ll w=2,p=n;
	fore(i,1,n){
		if(SZ(a[0])==B){
			w=0; p=i;
			break;
		}
		if(SZ(a[1])==B){
			w=1; p=i;
			break;
		}
		if(ask({0,i}))a[1].pb(i);
		else a[0].pb(i);
	}
	ll res=SZ(a[0]);
	for(ll i=p;i<n;i+=SZ(a[w])){
		vector<ll>v;
		ll k=0;
		fore(j,i,min(n,i+SZ(a[w]))){
			v.pb(j); k++;
			v.pb(a[w][j-i]);
		}
		ll resi=(ask(v)+1)/2;
		if(w==0)resi=k-resi;
		res+=resi;
	}
	return res;
}

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