oj.uz

답안 #1031126

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1031126 2024-07-22T15:15:14 Z happy_node 버섯 세기 (IOI20_mushrooms) C++17
57.0707 / 100
 7 ms 600 KB 
#include "mushrooms.h"
#include <bits/stdc++.h>
using namespace std;

const int B=200;

int count_mushrooms(int N) {
	vector<int> posA, posB;
	posA.push_back(0);

	for(int i=1;i+1<min(N,B);i+=2) {
		int r=use_machine({i,0,i+1});
		if(r==0) {
			posA.push_back(i);
			posA.push_back(i+1);
		} else if(r==1) {
			if(use_machine({0,i})==0) {
				posA.push_back(i);
				posB.push_back(i+1);
			} else {
				posB.push_back(i);
				posA.push_back(i+1);
			}
		} else {
			posB.push_back(i);
			posB.push_back(i+1);
		}
	}

	if((min(N,B)-1)&1) {
		if(use_machine({0,min(N,B)-1})==0) {
			posA.push_back(min(N,B)-1);
		} else {
			posB.push_back(min(N,B)-1);
		}
	} 

	int ans=posA.size();

	if(posA.size()>posB.size()) {
		int s=posA.size();
		for(int i=B;i<N;i+=s) {
			vector<int> qry;
			for(int j=i;j<min(N,i+s);j++) {
				qry.push_back(posA[j-i]);
				qry.push_back(j);
			}	
			int w=use_machine(qry);
			w=(w+1)/2;
			ans+=(qry.size()/2-w);
		}
	} else {
		int s=posB.size();
		for(int i=B;i<N;i+=s) {
			vector<int> qry;
			for(int j=i;j<min(N,i+s);j++) {
				qry.push_back(posB[j-i]);
				qry.push_back(j);
			}	
			int w=use_machine(qry);
			w=(w+1)/2;
			ans+=w;
		}
	}

	return ans;
}

Subtask #1
57.0707 / 100.0

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