oj.uz

Submission #355185

# Submission time Handle Problem Language Result Execution time Memory
355185 2021-01-22T09:50:01 Z ryansee Comparing Plants (IOI20_plants) C++14
100 / 100
 3944 ms 211932 KB 
#include "plants.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());    //can be used by calling rng() or shuffle(A, A+n, rng)
inline long long rand(long long x, long long y) { return rng() % (y+1-x) + x; } //inclusivesss
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=int; 
using ld=long double;
#define FOR(i,s,e) for(ll 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 (200002)
 
int n, start, k;
vector<int> R;
ll A[MAXN*2];
inline int cy(ll x) {
	if(x < 0) x += n;
	if(x >= n) x -= n;
	return x;
}
int dist(int x,int y) {
	if(x > y) swap(x, y);
	return min(y-x, n-y+x);	
}
 
struct node {
	int s,e,m;
	spi v;
	ll lazy[3];
	node*l,*r;
	node(int S,int E){
		s=S,e=E,m=(s+e)>>1;
		v=spi(INF, pi(0, -1)), mmst(lazy, 0);
		if(s^e)l=new node(s,m),r=new node(m+1,e),v=min(l->v,r->v);
		else v=spi(R[s], pi(0, s));
	}
	void value() {
		v.f += lazy[0], v.s.f += lazy[1];
		if(s^e) FOR(i,0,1) l->lazy[i]+=lazy[i], r->lazy[i]+=lazy[i];
		lazy[0]=lazy[1]=0;
	}
	void update(int x,int y,pi nval,pi nval2=pi(0, 0)) {
		if(s==x&&e==y) {
			if(nval.s <= 1) lazy[nval.s] += nval.f;
			else lazy[nval.s] = max(lazy[nval.s], nval.f);
			if(nval2.s <= 1) lazy[nval2.s] += nval2.f;
			else lazy[nval2.s] = max(lazy[nval2.s], nval2.f);
			return;
		}
		if(x>m) r->update(x,y,nval,nval2);
		else if(y<=m) l->update(x,y,nval,nval2);
		else l->update(x,m,nval,nval2),r->update(m+1,y,nval,nval2);
		l->value(), r->value();
		v=min(l->v,r->v);
	}
	spi rmq(int x,int y) {
		value();
		if(s==x&&e==y) return v;
		if(x>m) return r->rmq(x,y);
		else if(y<=m) return l->rmq(x,y);
		else return min(l->rmq(x,m),r->rmq(m+1,y));
	}
	void set(int x) {
		A[x] = max(A[x], lazy[2]);
		if(s==e) {
			v = spi(INF, pi(0, -1));
			return;
		}
		if(x>m) r->set(x);
		else l->set(x);
		v = min(l->v, r->v);
	}
} *seg;
void update(int x,int y,pi nval,pi nval2=pi(0,0)) {
	x=cy(x), y=cy(y);
	if(x<=y) seg->update(x,y,nval,nval2);
	else seg->update(x,n-1,nval,nval2), seg->update(0,y,nval,nval2);
}
spi rmq(int x,int y) {
	x=cy(x), y=cy(y);
	if(x<=y) return seg->rmq(x, y);
	else return min(seg->rmq(x, n-1), seg->rmq(0, y));
}
struct node2 {
	int s,e,m;
	pi v;
	node2*l,*r;
	node2(int S,int E){
		s=S,e=E,m=(s+e)>>1;
		v = pi(-INF, -1);
		if(s^e)l=new node2(s,m),r=new node2(m+1,e);
	}
	pi rmq(int x,int y) {
		if(s==x&&e==y) return v;
		if(x>m) return r->rmq(x, y);
		else if(y<=m) return l->rmq(x, y);
		else return max(l->rmq(x, m), r->rmq(m+1, y));
	}
	void set(int x) {
		if(s==e) {
			v = pi(A[s], s);
			return;
		}
		if(x>m) r->set(x);
		else l->set(x);
		v = max(l->v, r->v);
	}
} *seg2;
struct tree {
	int p[18][MAXN*2];
	bitset<MAXN*2> r;
	vector<int> v[MAXN*2];
	tree() {
		mmst(p, 0), r.set();
	}
	void add(int x,int y) {
		if(y==-1||x==y) return;
		r[x]=0, v[y].eb(x);
	}
	void solve() {
		function<void(ll)>dfs=[&](int x) {
			for(auto i:v[x]) p[0][i]=x, dfs(i);
		};
		FOR(i,0,2*n-1) if(r[i]) p[0][i]=2*n, dfs(i);
		FOR(j,1,17) FOR(i,0,2*n-1) if(p[j-1][i]==2*n) p[j][i]=2*n; else p[j][i]=p[j-1][p[j-1][i]];
	}
	inline int h(int x,int l) {
		DEC(i,17,0) if(p[i][x] < l) x = p[i][x];
		return p[0][x];
	}
} t[2];
void init(int K, std::vector<int> r) { k=K, R=r;
	n=r.size();
	seg=new node(0, n-1);
	FOR(i,0,n-1) if(r[i]==0) update(i+1, i+k-1, pi(1, 1));
	while(1) {
		start = seg->rmq(0, n-1).s.s;
		if(start == -1) break;
		seg->set(start);
		update(start+1, start+k-1, pi(A[start]+1, 2), pi(-1, 1));
		update(start-k+1, start-1, pi(A[start]+1, 2), pi(-1, 0));
		vector<int> tmp;
		while(1) {
			spi x = rmq(start-k+1, start-1);
			if(x.f == 0) {
				tmp.eb(x.s.s);
				update(x.s.s+1, x.s.s+k-1, pi(1, 1));
				update(x.s.s, x.s.s, pi(1, 0));
			} else break;
		}
		for(auto i:tmp) update(i, i, pi(-1, 0));
	}
	vector<int> p;
	FOR(i,0,n-1) p.eb(i), p.eb(i+n), A[i+n]=A[i];
	sort(all(p), [](int x,int y){return A[x]<A[y];});
	seg2=new node2(0, 2*n-1);
	for(auto i:p) {
		int target = seg2->rmq(i, min(2*n-1, i+k-1)).s; // connect to shortest tower within k that is taller than you
		t[0].add(i, target);
		seg2->set(i);
	}
	reverse(all(p));
	seg2=new node2(0, 2*n-1);
	for(auto i:p) {
		int target = seg2->rmq(i, min(2*n-1, i+k-1)).s;
		t[1].add(i, target);
		A[i]=-A[i], seg2->set(i), A[i]=-A[i];
	}
	FOR(i,0,1) t[i].solve();
}
int compare_plants(int x, int y) {
	if(dist(x, y) < k) {
		return A[x] < A[y] ? 1 : -1;
	}
	int i = t[0].h(x, y);
	if(i <= y+k-1 && A[y] <= A[i]) {
		return -1;
	}
	i = t[1].h(x, y);
	if(i <= y+k-1 && A[y] >= A[i]) {
		return 1;
	}
	swap(x, y);
	y += n;
	i = t[0].h(x, y);
	if(i <= min(2*n-1, y+k-1) && A[y] <= A[i]) {
		return 1;
	}
	i = t[1].h(x, y);
	if(i <= min(2*n-1, y+k-1) && A[y] >= A[i]) {
		return -1;
	}
	return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 75628 KB Output is correct
2 Correct 44 ms 75628 KB Output is correct
3 Correct 44 ms 75628 KB Output is correct
4 Correct 46 ms 75628 KB Output is correct
5 Correct 45 ms 75756 KB Output is correct
6 Correct 127 ms 78572 KB Output is correct
7 Correct 338 ms 90184 KB Output is correct
8 Correct 2019 ms 196492 KB Output is correct
9 Correct 2145 ms 196204 KB Output is correct
10 Correct 1965 ms 196576 KB Output is correct
11 Correct 1751 ms 198480 KB Output is correct
12 Correct 1645 ms 202716 KB Output is correct
13 Correct 1379 ms 208720 KB Output is correct
14 Correct 1298 ms 208860 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 75628 KB Output is correct
2 Correct 45 ms 75628 KB Output is correct
3 Correct 44 ms 75628 KB Output is correct
4 Correct 45 ms 75628 KB Output is correct
5 Correct 46 ms 75628 KB Output is correct
6 Correct 53 ms 76396 KB Output is correct
7 Correct 149 ms 81516 KB Output is correct
8 Correct 50 ms 75904 KB Output is correct
9 Correct 56 ms 76396 KB Output is correct
10 Correct 147 ms 81644 KB Output is correct
11 Correct 133 ms 81644 KB Output is correct
12 Correct 134 ms 81900 KB Output is correct
13 Correct 145 ms 81516 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 75628 KB Output is correct
2 Correct 45 ms 75628 KB Output is correct
3 Correct 44 ms 75628 KB Output is correct
4 Correct 45 ms 75628 KB Output is correct
5 Correct 46 ms 75628 KB Output is correct
6 Correct 53 ms 76396 KB Output is correct
7 Correct 149 ms 81516 KB Output is correct
8 Correct 50 ms 75904 KB Output is correct
9 Correct 56 ms 76396 KB Output is correct
10 Correct 147 ms 81644 KB Output is correct
11 Correct 133 ms 81644 KB Output is correct
12 Correct 134 ms 81900 KB Output is correct
13 Correct 145 ms 81516 KB Output is correct
14 Correct 312 ms 90440 KB Output is correct
15 Correct 3513 ms 199900 KB Output is correct
16 Correct 307 ms 90824 KB Output is correct
17 Correct 3583 ms 200668 KB Output is correct
18 Correct 1474 ms 211932 KB Output is correct
19 Correct 1630 ms 211932 KB Output is correct
20 Correct 2918 ms 202844 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 75628 KB Output is correct
2 Correct 45 ms 75628 KB Output is correct
3 Correct 167 ms 79724 KB Output is correct
4 Correct 1880 ms 203484 KB Output is correct
5 Correct 2439 ms 203228 KB Output is correct
6 Correct 3517 ms 203004 KB Output is correct
7 Correct 3940 ms 202492 KB Output is correct
8 Correct 3624 ms 201128 KB Output is correct
9 Correct 2115 ms 204588 KB Output is correct
10 Correct 1861 ms 198876 KB Output is correct
11 Correct 1352 ms 208604 KB Output is correct
12 Correct 1539 ms 208604 KB Output is correct
13 Correct 1661 ms 210652 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 75628 KB Output is correct
2 Correct 44 ms 75628 KB Output is correct
3 Correct 45 ms 75628 KB Output is correct
4 Correct 48 ms 75628 KB Output is correct
5 Correct 45 ms 75628 KB Output is correct
6 Correct 47 ms 75756 KB Output is correct
7 Correct 71 ms 76396 KB Output is correct
8 Correct 63 ms 76396 KB Output is correct
9 Correct 69 ms 76524 KB Output is correct
10 Correct 63 ms 76396 KB Output is correct
11 Correct 72 ms 76428 KB Output is correct
12 Correct 69 ms 76396 KB Output is correct
13 Correct 59 ms 76396 KB Output is correct

Subtask #6
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 75776 KB Output is correct
2 Correct 45 ms 75628 KB Output is correct
3 Correct 45 ms 75628 KB Output is correct
4 Correct 45 ms 75628 KB Output is correct
5 Correct 50 ms 76140 KB Output is correct
6 Correct 3210 ms 201036 KB Output is correct
7 Correct 3262 ms 201052 KB Output is correct
8 Correct 3582 ms 201012 KB Output is correct
9 Correct 3779 ms 199848 KB Output is correct
10 Correct 2087 ms 204144 KB Output is correct
11 Correct 2349 ms 207196 KB Output is correct
12 Correct 1665 ms 203356 KB Output is correct
13 Correct 2532 ms 203684 KB Output is correct
14 Correct 3178 ms 202672 KB Output is correct
15 Correct 3640 ms 202408 KB Output is correct
16 Correct 1678 ms 199948 KB Output is correct
17 Correct 2178 ms 196972 KB Output is correct

Subtask #7
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 75628 KB Output is correct
2 Correct 44 ms 75628 KB Output is correct
3 Correct 44 ms 75628 KB Output is correct
4 Correct 46 ms 75628 KB Output is correct
5 Correct 45 ms 75756 KB Output is correct
6 Correct 127 ms 78572 KB Output is correct
7 Correct 338 ms 90184 KB Output is correct
8 Correct 2019 ms 196492 KB Output is correct
9 Correct 2145 ms 196204 KB Output is correct
10 Correct 1965 ms 196576 KB Output is correct
11 Correct 1751 ms 198480 KB Output is correct
12 Correct 1645 ms 202716 KB Output is correct
13 Correct 1379 ms 208720 KB Output is correct
14 Correct 1298 ms 208860 KB Output is correct
15 Correct 44 ms 75628 KB Output is correct
16 Correct 45 ms 75628 KB Output is correct
17 Correct 44 ms 75628 KB Output is correct
18 Correct 45 ms 75628 KB Output is correct
19 Correct 46 ms 75628 KB Output is correct
20 Correct 53 ms 76396 KB Output is correct
21 Correct 149 ms 81516 KB Output is correct
22 Correct 50 ms 75904 KB Output is correct
23 Correct 56 ms 76396 KB Output is correct
24 Correct 147 ms 81644 KB Output is correct
25 Correct 133 ms 81644 KB Output is correct
26 Correct 134 ms 81900 KB Output is correct
27 Correct 145 ms 81516 KB Output is correct
28 Correct 312 ms 90440 KB Output is correct
29 Correct 3513 ms 199900 KB Output is correct
30 Correct 307 ms 90824 KB Output is correct
31 Correct 3583 ms 200668 KB Output is correct
32 Correct 1474 ms 211932 KB Output is correct
33 Correct 1630 ms 211932 KB Output is correct
34 Correct 2918 ms 202844 KB Output is correct
35 Correct 44 ms 75628 KB Output is correct
36 Correct 45 ms 75628 KB Output is correct
37 Correct 167 ms 79724 KB Output is correct
38 Correct 1880 ms 203484 KB Output is correct
39 Correct 2439 ms 203228 KB Output is correct
40 Correct 3517 ms 203004 KB Output is correct
41 Correct 3940 ms 202492 KB Output is correct
42 Correct 3624 ms 201128 KB Output is correct
43 Correct 2115 ms 204588 KB Output is correct
44 Correct 1861 ms 198876 KB Output is correct
45 Correct 1352 ms 208604 KB Output is correct
46 Correct 1539 ms 208604 KB Output is correct
47 Correct 1661 ms 210652 KB Output is correct
48 Correct 46 ms 75628 KB Output is correct
49 Correct 44 ms 75628 KB Output is correct
50 Correct 45 ms 75628 KB Output is correct
51 Correct 48 ms 75628 KB Output is correct
52 Correct 45 ms 75628 KB Output is correct
53 Correct 47 ms 75756 KB Output is correct
54 Correct 71 ms 76396 KB Output is correct
55 Correct 63 ms 76396 KB Output is correct
56 Correct 69 ms 76524 KB Output is correct
57 Correct 63 ms 76396 KB Output is correct
58 Correct 72 ms 76428 KB Output is correct
59 Correct 69 ms 76396 KB Output is correct
60 Correct 59 ms 76396 KB Output is correct
61 Correct 204 ms 79596 KB Output is correct
62 Correct 398 ms 90440 KB Output is correct
63 Correct 2796 ms 200540 KB Output is correct
64 Correct 3440 ms 200924 KB Output is correct
65 Correct 3796 ms 201184 KB Output is correct
66 Correct 3944 ms 200872 KB Output is correct
67 Correct 3680 ms 203464 KB Output is correct
68 Correct 2371 ms 207580 KB Output is correct
69 Correct 2427 ms 210936 KB Output is correct
70 Correct 2004 ms 206436 KB Output is correct
71 Correct 2701 ms 206540 KB Output is correct
72 Correct 3618 ms 206000 KB Output is correct
73 Correct 3861 ms 205936 KB Output is correct
74 Correct 2961 ms 203012 KB Output is correct
75 Correct 2004 ms 200412 KB Output is correct