oj.uz

Submission #818136

# Submission time Handle Problem Language Result Execution time Memory
818136 2023-08-10T02:42:23 Z jlallas384 Comparing Plants (IOI20_plants) C++17
27 / 100
 654 ms 28476 KB 
#include "plants.h"
#include <bits/stdc++.h>
using namespace std;
 
struct tree{
	pair<int,int> mn;
	tree *lc, *rc;
	int l,r,lz = 0;
	tree(int i, int j, vector<int> &a){
		l = i, r = j;
		if(l == r){
			mn = {a[l], l};
			lc = nullptr , rc = nullptr;
		}else{
			int m = (l + r) / 2;
			lc = new tree(l, m, a), rc = new tree(m + 1, r, a);
			mn = min(lc->mn, rc->mn);
		}
	}
	void push(){
		if(l != r){
			lc->lz += lz;
			lc->mn.first = max(0, lc->mn.first - lz);
			rc->lz += lz;
			rc->mn.first = max(0, rc->mn.first - lz);
		}
		lz = 0;
	}
	void dec(int i, int j){
		push();
		if(i > j){
			dec(0, j), dec(i, r);
			return;
		}else if(r < i || j < l) return;
		else if(i <= l && r <= j){
			lz++;
			mn.first = max(mn.first - 1, 0);
		}else{
			lc->dec(i, j), rc->dec(i, j);
			mn = min(lc->mn, rc->mn);
		}
	}
	pair<int,int> qry(int i, int j){
		push();
		if(i > j) return min(qry(0, j), qry(i, r));
		if(r < i || j < l) return {1e9, 1e9};
		if(i <= l && r <= j) return mn;
		return min(lc->qry(i,j), rc->qry(i,j));
	}
	void rem(int i){
		push();
		if(l == r){
			mn.first = 1e9;
		}else{
			if(i <= lc->r) lc->rem(i);
			else rc->rem(i);
			mn = min(lc->mn, rc->mn);
		}
	}
};
 
vector<int> ans;
void init(int k, std::vector<int> r) {
	int n = r.size();
	ans.resize(n);
	tree *t = new tree(0, n - 1, r);
	set<int> st, valid;
	auto add = [&](int x){
		st.insert(x);
		valid.insert(x);
		if(st.size() == 1) return;
		auto it = st.upper_bound(x);
		if(it != st.end() && *it - x < k){
			valid.erase(*it);
		}else if(it == st.end() && *st.begin() + n - x < k){
			valid.erase(*st.begin());
		}
		it = st.lower_bound(x);
		if(it == st.begin() && x + n - *st.rbegin() < k){
			valid.erase(x);
		}else if(it != st.begin() && x - *prev(it) < k){
			valid.erase(x);
		}
	};
	for(int i = 0; i < n; i++) if(r[i] == 0){
		add(i);
	}
	for(int val = n - 1; val >= 0; val--){
		assert(valid.size() == 1);
		int x = *valid.begin();
		t->dec((x - k + 1 + n) % n, (x - 1 + n) % n);
		while(true){
			auto [v, i] = t->qry((x - k + 1 + n) % n, (x - 1 + n) % n);
			if(v != 0) break;
			else{
				t->rem(i);
				add(i);
			}
		}
		ans[x] = val;
		valid.erase(x);
		st.erase(x);
		t->rem(x);
		auto it = st.upper_bound(x);
		if(it != st.end()) add(*it);
		else if(it == st.end()) add(*st.begin());
	}
}
 
int compare_plants(int x, int y) {
	if(ans[x] > ans[y]) return 1;
	else return -1;
}

Subtask #1
0 / 5.0

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

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 240 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 3 ms 468 KB Output is correct
7 Correct 49 ms 3564 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 3 ms 468 KB Output is correct
10 Correct 53 ms 3568 KB Output is correct
11 Correct 47 ms 3648 KB Output is correct
12 Correct 46 ms 3660 KB Output is correct
13 Correct 50 ms 3576 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 240 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 3 ms 468 KB Output is correct
7 Correct 49 ms 3564 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 3 ms 468 KB Output is correct
10 Correct 53 ms 3568 KB Output is correct
11 Correct 47 ms 3648 KB Output is correct
12 Correct 46 ms 3660 KB Output is correct
13 Correct 50 ms 3576 KB Output is correct
14 Correct 84 ms 5164 KB Output is correct
15 Correct 654 ms 23788 KB Output is correct
16 Correct 83 ms 5168 KB Output is correct
17 Correct 634 ms 23784 KB Output is correct
18 Correct 443 ms 28476 KB Output is correct
19 Correct 400 ms 23812 KB Output is correct
20 Correct 579 ms 23800 KB Output is correct

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 340 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

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

Subtask #6
0 / 15.0

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

Subtask #7
0 / 25.0

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