oj.uz

답안 #1081610

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1081610 2024-08-30T08:06:50 Z GrindMachine 버섯 세기 (IOI20_mushrooms) C++17
80.7143 / 100
 7 ms 704 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long int ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define pb push_back
#define endl '\n'
#define conts continue
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define sz(a) (int)a.size()

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &x, T y){
	x = min(x,y);
}

template<typename T>
void amax(T &x, T y){
	x = max(x,y);
}

template<typename A,typename B>
string to_string(pair<A,B> p);

string to_string(const string &s){
	return "'"+s+"'";
}

string to_string(const char* s){
	return to_string((string)s);
}

string to_string(bool b){
	return b?"true":"false";
}

template<typename A>
string to_string(A v){
	string res = "{";
	trav(x,v){
		res += to_string(x)+",";
	}
	if(res.back() == ',') res.pop_back();
	res += "}";
	return res;
}

template<typename A,typename B>
string to_string(pair<A,B> p){
	return "("+to_string(p.ff)+","+to_string(p.ss)+")";
}

#define debug(x) cout << "[" << #x << "]: "; cout << to_string(x) << endl

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = 1e9 + 5;
const ll inf2 = (ll)1e18 + 5;

#include "mushrooms.h"

int count_mushrooms(int n) {
	int B = min(n,2);

	vector<int> a(B);
	rep1(i,B-1){
		vector<int> v = {i-1,i};
		a[i] = a[i-1]^use_machine(v);
	}

	vector<int> v0,v1;
	rep(i,B){
		if(!a[i]){
			v0.pb(i);
		}
		else{
			v1.pb(i);
		}
	}

	int ptr = B-1;
	int ans = count(all(a),0);

	while(ptr < n-1){
		int siz = max(sz(v0),sz(v1));

		if(sz(v0) > sz(v1)){
			vector<int> v;
			for(int i = ptr+1; i < n; ++i){
				if(sz(v) >= siz) break;
				ptr = i;
				v.pb(i);
			}

			vector<int> ask;
			rep(i,sz(v)){
				ask.pb(v0[i]);
				ask.pb(v[i]);
			}

			int res = use_machine(ask);
			int sum = (sz(v)-1)*2+1;
			res = sum-res;

			if(res&1){
				ans++;
				v0.pb(v.back());
			}
			else{
				v1.pb(v.back());
			}

			ans += res/2;
		}
		else{
			vector<int> v;
			for(int i = ptr+1; i < n; ++i){
				if(sz(v) >= siz) break;
				ptr = i;
				v.pb(i);
			}

			vector<int> ask;
			rep(i,sz(v)){
				ask.pb(v1[i]);
				ask.pb(v[i]);
			}

			int res = use_machine(ask);

			if(res&1){
				ans++;
				v0.pb(v.back());
			}
			else{
				v1.pb(v.back());
			}

			ans += res/2;
		}
	}


	return ans;

	// for (int i = 0; i < n; i++)
	// 	m.push_back(i);
	// int c1 = use_machine(m);
	// m = {0, 1};
	// int c2 = use_machine(m);
	// return c1+c2;
}

Subtask #1
80.7143 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 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 2 ms 344 KB Output is correct
7 Correct 3 ms 344 KB Output is correct
8 Correct 3 ms 344 KB Output is correct
9 Correct 6 ms 464 KB Output is correct
10 Partially correct 4 ms 472 KB Output is partially correct
11 Partially correct 6 ms 704 KB Output is partially correct
12 Partially correct 3 ms 344 KB Output is partially correct
13 Correct 3 ms 344 KB Output is correct
14 Correct 2 ms 600 KB Output is correct
15 Partially correct 5 ms 456 KB Output is partially correct
16 Partially correct 4 ms 472 KB Output is partially correct
17 Correct 3 ms 344 KB Output is correct
18 Correct 3 ms 344 KB Output is correct
19 Partially correct 3 ms 452 KB Output is partially correct
20 Partially correct 5 ms 344 KB Output is partially correct
21 Partially correct 3 ms 344 KB Output is partially correct
22 Partially correct 4 ms 480 KB Output is partially correct
23 Correct 4 ms 344 KB Output is correct
24 Correct 2 ms 344 KB Output is correct
25 Partially correct 7 ms 344 KB Output is partially correct
26 Partially correct 4 ms 344 KB Output is partially correct
27 Partially correct 6 ms 344 KB Output is partially correct
28 Partially correct 3 ms 480 KB Output is partially correct
29 Partially correct 7 ms 344 KB Output is partially correct
30 Partially correct 6 ms 344 KB Output is partially correct
31 Partially correct 5 ms 600 KB Output is partially correct
32 Partially correct 5 ms 476 KB Output is partially correct
33 Partially correct 3 ms 344 KB Output is partially correct
34 Partially correct 4 ms 456 KB Output is partially correct
35 Partially correct 5 ms 344 KB Output is partially correct
36 Partially correct 7 ms 456 KB Output is partially correct
37 Partially correct 4 ms 344 KB Output is partially correct
38 Partially correct 4 ms 344 KB Output is partially correct
39 Partially correct 4 ms 476 KB Output is partially correct
40 Partially correct 5 ms 600 KB Output is partially correct
41 Partially correct 4 ms 456 KB Output is partially correct
42 Partially correct 4 ms 452 KB Output is partially correct
43 Partially correct 4 ms 344 KB Output is partially correct
44 Partially correct 4 ms 484 KB Output is partially correct
45 Partially correct 3 ms 344 KB Output is partially correct
46 Partially correct 3 ms 480 KB Output is partially correct
47 Partially correct 7 ms 444 KB Output is partially correct
48 Partially correct 4 ms 344 KB Output is partially correct
49 Partially correct 7 ms 472 KB Output is partially correct
50 Partially correct 4 ms 344 KB Output is partially correct
51 Partially correct 7 ms 472 KB Output is partially correct
52 Partially correct 3 ms 440 KB Output is partially correct
53 Partially correct 4 ms 452 KB Output is partially correct
54 Partially correct 7 ms 344 KB Output is partially correct
55 Partially correct 4 ms 344 KB Output is partially correct
56 Partially correct 6 ms 344 KB Output is partially correct
57 Partially correct 3 ms 464 KB Output is partially correct
58 Partially correct 4 ms 344 KB Output is partially correct
59 Partially correct 5 ms 480 KB Output is partially correct
60 Partially correct 4 ms 344 KB Output is partially correct
61 Partially correct 6 ms 600 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 0 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 0 ms 344 KB Output is correct
73 Correct 0 ms 344 KB Output is correct
74 Correct 0 ms 392 KB Output is correct
75 Correct 0 ms 344 KB Output is correct
76 Correct 1 ms 344 KB Output is correct
77 Correct 0 ms 344 KB Output is correct
78 Correct 1 ms 344 KB Output is correct
79 Correct 0 ms 344 KB Output is correct
80 Correct 1 ms 368 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 0 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 1 ms 344 KB Output is correct
91 Correct 0 ms 344 KB Output is correct