oj.uz

답안 #363325

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
363325 2021-02-05T14:29:09 Z ryansee 버섯 세기 (IOI20_mushrooms) C++14
100 / 100
 10 ms 752 KB 
#include "mushrooms.h"
 
#include "bits/stdc++.h"
using namespace std;
 
#define FAST ios_base::sync_with_stdio(false); cin.tie(0);
#define pb push_back
#define eb emplace_back
#define ins insert
#define f first
#define s second
#define cbr cerr<<"hi\n"
#define mmst(x, v) memset((x), v, sizeof ((x)))
#define siz(x) ll(x.size())
#define all(x) (x).begin(), (x).end()
#define lbd(x,y) (lower_bound(all(x),y)-x.begin())
#define ubd(x,y) (upper_bound(all(x),y)-x.begin())
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
inline long long rand(long long x, long long y) { return rng() % (y+1-x) + x; } //inclusive
string inline to_string(char c) {string s(1,c);return s;} template<typename T> inline T gcd(T a,T b){ return a==0?llabs(b):gcd(b%a,a); }
 
using ll=long long; 
using ld=long double;
#define FOR(i,s,e) for(int i=s;i<=ll(e);++i)
#define DEC(i,s,e) for(ll i=s;i>=ll(e);--i)
using pi=pair<ll,ll>; using spi=pair<ll,pi>; using dpi=pair<pi,pi>; 
 
long long LLINF = 1e18;
int INF = 1e9+1e6;
#define MAXN (200006)
int B = 1, T = 100;
vector<int> join(int x, deque<int> dq) {
	vector<int> v;
	if(~x) v.eb(x);
	for(auto i:dq) v.eb(i);
	return v;
}
int count_mushrooms(int n) {
	deque<int> dq, co[2];
	FOR(i,1,n-1) dq.eb(i);
	co[0].eb(0);
	
	while(dq.size() && (max(co[0].size(), co[1].size()) < 3 || min(co[0].size(), co[1].size()) < 2) && max(co[0].size(), co[1].size()) < T) {
		if(max(co[0].size(), co[1].size()) < 2 || dq.size() == 1) {
			int res = use_machine({0, dq.front()});
			co[res].eb(dq.front()), dq.pop_front();
		} else {
			int x = dq.front(); dq.pop_front();
			int y = dq.front(); dq.pop_front();
			vector<int> v;
			if(co[0].size()>1) v.eb(co[0][0]);
			else v.eb(co[1][0]);
			v.eb(x);
			if(co[0].size()>1) v.eb(co[0][1]);
			else v.eb(co[1][1]);
			v.eb(y);
			int res = use_machine(v);
			auto declare=[&](int x,bool b){
				co[b].eb(x);
			};
			if(co[0].size()>1) {
				if(res & 1) declare(y, 1);
				else declare(y, 0);
				if(res > 1) declare(x, 1);
				else declare(x, 0);
			} else {
				if(res & 1) declare(y, 0);
				else declare(y, 1);
				if(res > 1) declare(x, 0);
				else declare(x, 1);
			}
		}
	} // change the above
	while(max(co[0].size(), co[1].size()) < T) {
		if(siz(dq) < 5) break;
		bool b = co[1].size() > co[0].size();
		if(b) co[0].swap(co[1]);
		if(co[0].size() < 3 || co[1].size() < 2) return 0;
		int x=dq.front(); dq.pop_front();
		int y=dq.front(); dq.pop_front();
		int z=dq.front(); dq.pop_front();
		vector<int> v = {co[0][0], x, co[0][1], y, co[0][2], z};
		int res = use_machine(v);
		if(res&1) co[1].eb(z), res ^= 1;
		else co[0].eb(z);
		if(res == 0) {
			co[0].eb(x), co[0].eb(y);
		} else if(res == 4) {
			co[1].eb(x), co[1].eb(y);
		} else if(res == 2) {
			// one of (x, y) is B, one A
			int w = dq.front(); dq.pop_front();
			int t = dq.front(); dq.pop_front();
			v = {w, co[0][0], t, co[0][1], x, co[0][2], co[1][0], y, co[1][1]};
			res = use_machine(v);
			-- res;
			if(res & 1) co[1].eb(w), res ^= 1;
			else co[0].eb(w);
			if(res == 0) {
				co[0].eb(t), co[0].eb(x), co[1].eb(y);
			} else if(res == 2) {
				co[1].eb(t), co[0].eb(x), co[1].eb(y);
			} else if(res == 4) {
				co[0].eb(t), co[1].eb(x), co[0].eb(y);
			} else if(res == 6) {
				co[1].eb(t), co[1].eb(x), co[0].eb(y);
			} else assert(0);
		} else assert(0);
		if(b) co[1].swap(co[0]);
	}
	
	int ans = co[0].size();
	int b = 0;
	if(co[b].size() < B) b = 1;
	for(int i=0;i<siz(dq);i+=B) {
		B = max(co[0].size(), co[1].size());
		if(siz(co[b]) ^ B) b ^= 1;
		vector<int> tmp;
		FOR(j,i,min((int)siz(dq)-1, i+B-1)) {
			tmp.eb(co[b][j-i]);
			tmp.eb(dq[j]);
		}
		int res = use_machine(tmp), cnt = 0;
		if(res & 1) ++ cnt, -- res, co[!b].eb(dq[min((int)siz(dq)-1, i+B-1)]);
		else co[b].eb(dq[min((int)siz(dq)-1, i+B-1)]);
		res /= 2;
		cnt += res;
		if(b==0) ans += min((int)siz(dq)-1, i+B-1) - i + 1 - cnt;
		else ans += cnt;
	}
	return ans;
}

Compilation message

mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:43:133: warning: comparison of integer expressions of different signedness: 'const long unsigned int' and 'int' [-Wsign-compare]
   43 |  while(dq.size() && (max(co[0].size(), co[1].size()) < 3 || min(co[0].size(), co[1].size()) < 2) && max(co[0].size(), co[1].size()) < T) {
      |                                                                                                     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
mushrooms.cpp:74:40: warning: comparison of integer expressions of different signedness: 'const long unsigned int' and 'int' [-Wsign-compare]
   74 |  while(max(co[0].size(), co[1].size()) < T) {
      |        ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
mushrooms.cpp:114:18: warning: comparison of integer expressions of different signedness: 'std::deque<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  114 |  if(co[b].size() < B) b = 1;
      |     ~~~~~~~~~~~~~^~~

Subtask #1
100.0 / 100.0

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