oj.uz

Submission #827116

# Submission time Handle Problem Language Result Execution time Memory
827116 2023-08-16T08:53:40 Z tomruk Comparing Plants (IOI20_plants) C++17
32 / 100
 274 ms 22884 KB 
#include "plants.h"
#include <bits/stdc++.h>
#define N 200005
using namespace std;
struct SegTree{
	vector<pair<int,int>> t;
	vector<int> lazy;
	int n;
	SegTree(int sz,vector<int> a){
		n = sz;
		t.assign(4*n,{0,0});
		lazy.assign(4*n,0);
		build(1,0,n-1,a);
	}
	void build(int v,int tl,int tr,vector<int> &a){
		if(tl == tr){
			t[v] = {a[tl],tl};
			return;
		}
		int tm = (tl + tr)/2;
		build(v*2,tl,tm,a);
		build(v*2 + 1,tm+1,tr,a);
		t[v] = t[v*2];
		if(t[v*2 + 1].first < t[v].first)
			t[v] = t[v*2+1];
	}
	void push(int v){
		t[v*2].first += lazy[v];
		lazy[v*2] += lazy[v];
		t[v*2 + 1].first += lazy[v];
		lazy[v*2 + 1] += lazy[v];
		lazy[v] = 0;
	}
	void upd(int v,int tl,int tr,int l,int r,int val){
		if(tr < l || r < tl)
			return;
		if(l <= tl && tr <= r){
			t[v].first += val;
			lazy[v] += val;
			return;
		}
		push(v);
		int tm = (tl + tr)/2;
		upd(v*2,tl,tm,l,r,val);
		upd(v * 2 + 1,tm+1,tr,l,r,val);
		t[v] = t[v*2];
		if(t[v*2 + 1].first < t[v].first)
			t[v] = t[v*2+1];
	}
	pair<int,int> get(int v,int tl,int tr,int l,int r){
		if(tr < l || r < tl)
			return {1e9,0};
		if(l <= tl && tr <= r){
			return t[v];
		}
		push(v);
		int tm = (tl + tr)/2;
		auto a = get(v*2,tl,tm,l,r);
		auto b = get(v*2+1,tm+1,tr,l,r);
		if(b.first < a.first)
			return b;
		return a;
	}
	void upd(int l,int r,int val){
		upd(1,0,n-1,l,r,val);
	}
	pair<int,int> get(int l,int r){
		return get(1,0,n-1,l,r);
	}
};
int k;
int a[N];
vector<int> adj[N];
int group[N];
bool ok[N];
int cnt = 1;
void dfs(int v){
	cout << v << endl;
	for(auto u:adj[v]){
		group[u] = group[v];
		dfs(u);
	}
	a[v] = cnt++;
}
int pre[N];
int n;
void init(int _k, vector<int> r) {
	k = _k;
	n  = r.size();
	if(k == 2){
		for(int i = 0;i<n;i++){
			pre[i] = r[i] + (i?pre[i-1]:0);
		}
		return;
	}
	SegTree t(n,r);
	vector<int> x;
	for(int i = n-1;i>=0;i--){
		auto p1 = t.get(0,n-1);
		auto p2 = t.get(p1.second + k,n-1);
		if(p2.first == 0)
			p1 = p2;
		assert(p1.first == 0);
		a[p1.second] = i;
		if(p1.second)
			t.upd(max(0,p1.second-k + 1),p1.second - 1,-1);
		if(p1.second - k + 1 < 0){
			t.upd(p1.second-k + 1 + n,n-1,-1);
		}
		t.upd(p1.second,p1.second,1e9);
		// for(int j = 0;j<=n-1;j++){
		// 	cout << t.get(j,j).first << ' ';
		// }
		// cout << endl;
		// cout << i << ' ' << p1.second << endl;
	}
	// for(int i = n-1;i>=0;){
	// 	vector<int> p;
	// 	for(int j = 0;j<n;j++){
	// 		if(t.get(j,j).first == 0)
	// 			p.push_back(j);
	// 	}
	// 	vector<int> tmp;
	// 	int maxi = -1e9;
	// 	for(auto u:p){
	// 		if(maxi + k - 1 < u)
	// 			tmp.push_back(u);
	// 		maxi = u;
	// 	}
	// 	int x = tmp.back() + k-1 - n;
	// 	p.clear();
	// 	for(auto u:tmp){
	// 		if(u <= x)
	// 			continue;
	// 		p.push_back(u);
	// 	}
	// 	assert(p.size());
	// 	for(auto u:p){
	// 		if(u)
	// 			t.upd(max(0,u-k + 1),u - 1,-1);
	// 		if(u - k + 1 < 0){
	// 			t.upd(u-k + 1 + n,n-1,-1);
	// 		}
	// 		t.upd(u,u,1e9);
	// 		a[u] = i;
	// 	}
	// 	i -= p.size();
	// }
}

int compare_plants(int x, int y) {
	if(k == 2){
		if(pre[y-1] - (x?pre[x-1]:0) == 0){
			return 1;
		}
		if(pre[y-1] - (x?pre[x-1]:0) == y-x){
			return -1;
		}
		if(pre[n-1] - (pre[y-1] - (x?pre[x-1]:0)) == 0){
			return -1;
		}
		if(pre[n-1] - (pre[y-1] - (x?pre[x-1]:0)) == n - (y-x)){
			return 1;
		}
		return 0;
	}
	if(a[x] > a[y])
		return 1;
	if(a[x] < a[y])
		return -1;
	return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 4 ms 4948 KB Output is correct
4 Correct 2 ms 5012 KB Output is correct
5 Correct 4 ms 4948 KB Output is correct
6 Correct 50 ms 8712 KB Output is correct
7 Correct 49 ms 10128 KB Output is correct
8 Correct 63 ms 12492 KB Output is correct
9 Correct 62 ms 12492 KB Output is correct
10 Correct 62 ms 12592 KB Output is correct
11 Correct 62 ms 12492 KB Output is correct
12 Correct 66 ms 12584 KB Output is correct
13 Correct 71 ms 12604 KB Output is correct
14 Correct 62 ms 12616 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 2 ms 5008 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 3 ms 5012 KB Output is correct
6 Correct 4 ms 5168 KB Output is correct
7 Correct 52 ms 9900 KB Output is correct
8 Correct 4 ms 5076 KB Output is correct
9 Correct 5 ms 5156 KB Output is correct
10 Correct 49 ms 9816 KB Output is correct
11 Correct 45 ms 9776 KB Output is correct
12 Correct 46 ms 9900 KB Output is correct
13 Correct 48 ms 9900 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 2 ms 5008 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 3 ms 5012 KB Output is correct
6 Correct 4 ms 5168 KB Output is correct
7 Correct 52 ms 9900 KB Output is correct
8 Correct 4 ms 5076 KB Output is correct
9 Correct 5 ms 5156 KB Output is correct
10 Correct 49 ms 9816 KB Output is correct
11 Correct 45 ms 9776 KB Output is correct
12 Correct 46 ms 9900 KB Output is correct
13 Correct 48 ms 9900 KB Output is correct
14 Correct 88 ms 10756 KB Output is correct
15 Correct 274 ms 22824 KB Output is correct
16 Correct 64 ms 10884 KB Output is correct
17 Correct 259 ms 22816 KB Output is correct
18 Correct 188 ms 22444 KB Output is correct
19 Correct 185 ms 22852 KB Output is correct
20 Correct 232 ms 22884 KB Output is correct

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Runtime error 7 ms 9940 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 2 ms 4936 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Runtime error 6 ms 10004 KB Execution killed with signal 6
6 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4904 KB Output is correct
3 Correct 3 ms 5008 KB Output is correct
4 Runtime error 7 ms 9940 KB Execution killed with signal 6
5 Halted 0 ms 0 KB -

Subtask #7
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 4 ms 4948 KB Output is correct
4 Correct 2 ms 5012 KB Output is correct
5 Correct 4 ms 4948 KB Output is correct
6 Correct 50 ms 8712 KB Output is correct
7 Correct 49 ms 10128 KB Output is correct
8 Correct 63 ms 12492 KB Output is correct
9 Correct 62 ms 12492 KB Output is correct
10 Correct 62 ms 12592 KB Output is correct
11 Correct 62 ms 12492 KB Output is correct
12 Correct 66 ms 12584 KB Output is correct
13 Correct 71 ms 12604 KB Output is correct
14 Correct 62 ms 12616 KB Output is correct
15 Correct 2 ms 4948 KB Output is correct
16 Correct 3 ms 4948 KB Output is correct
17 Correct 2 ms 5008 KB Output is correct
18 Correct 2 ms 4948 KB Output is correct
19 Correct 3 ms 5012 KB Output is correct
20 Correct 4 ms 5168 KB Output is correct
21 Correct 52 ms 9900 KB Output is correct
22 Correct 4 ms 5076 KB Output is correct
23 Correct 5 ms 5156 KB Output is correct
24 Correct 49 ms 9816 KB Output is correct
25 Correct 45 ms 9776 KB Output is correct
26 Correct 46 ms 9900 KB Output is correct
27 Correct 48 ms 9900 KB Output is correct
28 Correct 88 ms 10756 KB Output is correct
29 Correct 274 ms 22824 KB Output is correct
30 Correct 64 ms 10884 KB Output is correct
31 Correct 259 ms 22816 KB Output is correct
32 Correct 188 ms 22444 KB Output is correct
33 Correct 185 ms 22852 KB Output is correct
34 Correct 232 ms 22884 KB Output is correct
35 Correct 2 ms 4948 KB Output is correct
36 Runtime error 7 ms 9940 KB Execution killed with signal 6
37 Halted 0 ms 0 KB -