oj.uz

Submission #718450

# Submission time Handle Problem Language Result Execution time Memory
718450 2023-04-04T06:11:58 Z baojiaopisu Counting Mushrooms (IOI20_mushrooms) C++14
86.59 / 100
 11 ms 512 KB 
#include "mushrooms.h"
#include <vector>
#include <iostream> 
#include <algorithm>    
#include <array>        
#include <random>      
#include <chrono>       

using namespace std;
#define pb push_back
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int count_mushrooms(int n) {
	vector<int> a, b;
	vector<int> not_solved;
	for(int i = 1; i < n; i++) not_solved.pb(i);

	a.pb(0);
	shuffle(not_solved.begin(), not_solved.end(), rng);
	int res = 1;

	while(not_solved.size()) {
		if(a.size() >= b.size()) {
			if(a.size() >= 150) {
				vector<int> r;
				while(not_solved.size() && r.size() < a.size()) {
					r.pb(not_solved.back());
					not_solved.pop_back();
				}

				vector<int> ask;
				for(int i = 0; i < (int)a.size(); i++) {
					if(i < r.size()) ask.pb(r[i]);
					ask.pb(a[i]);
				}

				int x = use_machine(ask);
				res += r.size() - ((x + 1) / 2);
				if(x & 1) {
					b.pb(r[0]);
					swap(r[0], r[r.size() - 1]);
					r.pop_back();
				} else {
					a.pb(r[0]);
					swap(r[0], r[r.size() - 1]);
					r.pop_back();
				}
			} else {
				if(a.size() == 1 || not_solved.size() == 1) {
					int u = not_solved.back();
					not_solved.pop_back();
					if(use_machine({a[0], u})) {
						b.pb(u);
					} else {
						++res;
						a.pb(u);
					}
				} else {
					int u = not_solved.back();
					not_solved.pop_back();
					int v = not_solved.back();
					not_solved.pop_back();
					int d = use_machine({a[0], u, a[1], v});
					if(d & 1) b.pb(v); else a.pb(v), res++;
					if(d & 2) b.pb(u); else a.pb(u), res++;
				}
			}
		} else {
			if(b.size() >= 150) {
				vector<int> r;
				while(not_solved.size() && r.size() < b.size()) {
					r.pb(not_solved.back());
					not_solved.pop_back();
				}

				vector<int> ask;
				for(int i = 0; i < (int)b.size(); i++) {
					if(i < r.size()) ask.pb(r[i]);
					ask.pb(b[i]);
				}

				int x = use_machine(ask);
				if(x & 1) {
					a.pb(r[0]);
					swap(r[0], r[r.size() - 1]);
					r.pop_back();
				} else {
					b.pb(r[0]);
					swap(r[0], r[r.size() - 1]);
					r.pop_back();
				}
				res += (x + 1) / 2;
			} else {
				if(b.size() == 1 || not_solved.size() == 1) {
					int u = not_solved.back();
					not_solved.pop_back();
					if(use_machine({b[0], u})) {
						a.pb(u);
						++res;
					} else b.pb(u);
				} else {
					int u = not_solved.back();
					not_solved.pop_back();
					int v = not_solved.back();
					not_solved.pop_back();
					int d = use_machine({b[0], u, b[1], v});
					if(d & 1) a.pb(v), res++; else b.pb(v);
					if(d & 2) a.pb(u), res++; else b.pb(u);
				}
			}
		}
	}

	return res;
}

Compilation message

mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:33:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |      if(i < r.size()) ask.pb(r[i]);
      |         ~~^~~~~~~~~~
mushrooms.cpp:78:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   78 |      if(i < r.size()) ask.pb(r[i]);
      |         ~~^~~~~~~~~~

Subtask #1
86.59 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 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 1 ms 208 KB Output is correct
6 Correct 2 ms 316 KB Output is correct
7 Correct 6 ms 464 KB Output is correct
8 Correct 6 ms 464 KB Output is correct
9 Correct 7 ms 464 KB Output is correct
10 Correct 7 ms 464 KB Output is correct
11 Partially correct 11 ms 464 KB Output is partially correct
12 Correct 6 ms 464 KB Output is correct
13 Correct 7 ms 464 KB Output is correct
14 Correct 5 ms 336 KB Output is correct
15 Partially correct 7 ms 464 KB Output is partially correct
16 Partially correct 7 ms 464 KB Output is partially correct
17 Correct 4 ms 336 KB Output is correct
18 Correct 7 ms 464 KB Output is correct
19 Partially correct 9 ms 464 KB Output is partially correct
20 Correct 10 ms 464 KB Output is correct
21 Partially correct 7 ms 464 KB Output is partially correct
22 Partially correct 9 ms 464 KB Output is partially correct
23 Correct 9 ms 464 KB Output is correct
24 Correct 3 ms 408 KB Output is correct
25 Partially correct 7 ms 464 KB Output is partially correct
26 Partially correct 7 ms 464 KB Output is partially correct
27 Partially correct 7 ms 464 KB Output is partially correct
28 Partially correct 7 ms 464 KB Output is partially correct
29 Partially correct 8 ms 464 KB Output is partially correct
30 Partially correct 7 ms 464 KB Output is partially correct
31 Partially correct 8 ms 464 KB Output is partially correct
32 Partially correct 8 ms 464 KB Output is partially correct
33 Partially correct 7 ms 464 KB Output is partially correct
34 Partially correct 7 ms 464 KB Output is partially correct
35 Partially correct 7 ms 464 KB Output is partially correct
36 Partially correct 7 ms 464 KB Output is partially correct
37 Partially correct 10 ms 464 KB Output is partially correct
38 Partially correct 8 ms 464 KB Output is partially correct
39 Partially correct 7 ms 464 KB Output is partially correct
40 Partially correct 7 ms 464 KB Output is partially correct
41 Partially correct 8 ms 464 KB Output is partially correct
42 Partially correct 7 ms 464 KB Output is partially correct
43 Partially correct 10 ms 464 KB Output is partially correct
44 Partially correct 6 ms 512 KB Output is partially correct
45 Partially correct 10 ms 464 KB Output is partially correct
46 Partially correct 8 ms 464 KB Output is partially correct
47 Partially correct 7 ms 464 KB Output is partially correct
48 Partially correct 7 ms 464 KB Output is partially correct
49 Partially correct 9 ms 464 KB Output is partially correct
50 Partially correct 8 ms 464 KB Output is partially correct
51 Partially correct 7 ms 464 KB Output is partially correct
52 Partially correct 7 ms 464 KB Output is partially correct
53 Partially correct 7 ms 464 KB Output is partially correct
54 Partially correct 7 ms 464 KB Output is partially correct
55 Partially correct 6 ms 464 KB Output is partially correct
56 Partially correct 7 ms 464 KB Output is partially correct
57 Partially correct 8 ms 464 KB Output is partially correct
58 Partially correct 9 ms 464 KB Output is partially correct
59 Partially correct 8 ms 464 KB Output is partially correct
60 Partially correct 7 ms 464 KB Output is partially correct
61 Partially correct 7 ms 464 KB Output is partially correct
62 Correct 1 ms 208 KB Output is correct
63 Correct 0 ms 208 KB Output is correct
64 Correct 1 ms 220 KB Output is correct
65 Correct 0 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 1 ms 208 KB Output is correct
70 Correct 0 ms 208 KB Output is correct
71 Correct 1 ms 336 KB Output is correct
72 Correct 0 ms 208 KB Output is correct
73 Correct 0 ms 208 KB Output is correct
74 Correct 1 ms 284 KB Output is correct
75 Correct 0 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 1 ms 208 KB Output is correct
84 Correct 1 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 1 ms 208 KB Output is correct
89 Correct 1 ms 208 KB Output is correct
90 Correct 1 ms 208 KB Output is correct
91 Correct 0 ms 208 KB Output is correct