Submission #922409

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
922409	2024-02-05T13:33:09 Z	Onur_Ilgaz	Meteors (POI11_met)	C++17	74 / 100	401 ms	39812 KB

met

#include <bits/stdc++.h>
#define fast cin.tie(0)->sync_with_stdio(0);
#define int long long
#define inf ((int)1e18)
using namespace std;
const int N = 300005;
vector <int> station[N];
int from[N], to[N], add[N], need[N], ans[N];
int point;

struct BIT {
	int n;
	vector <int> t;
	void init(int size) {
		n = size;
		t.assign((n + 1) * 2, 0);
	}
	void update(int till, int val) {
		while(till) {
			t[till] += val;
			till = till - (till & (-till));
		}
	}
	int query(int ind) {
		int res = 0;
		while(ind <= n) {
			res += t[ind];
			ind = ind + (ind & (-ind));
		}
		return res;
	}
}t;

void f(int l, int r, vector<int>&owner) {
	if(owner.empty()) return;
	if(l == r) {
		for(auto it:owner) {
			ans[it] = l;
		}
		return;
	}
	int m = (l + r) / 2;
	int ul, ur, val;
	auto upd = [&]() {
		t.update(ul-1, -val);
		t.update(ur, val);
		if(ur < ul) {
			t.update(t.n, val);
		}
	};
	while(point < m) {
		point++;
		ul = from[point], ur = to[point], val = add[point];
		upd();
	}
	while(point > m) {
		ul = from[point], ur = to[point], val = -add[point];
		upd();
		point--;
	}
	// now point is at m
	vector <int> left, right;
	for(int it : owner) {
		int sum = 0;
		for(int itt : station[it])
			sum += t.query(itt);
		if(sum >= need[it]) 
			left.push_back(it);
		else 
			right.push_back(it);
	}
	owner.clear();
	f(l, m, left);
	f(m + 1, r, right);
}

int32_t main() {
	fast
	int n, m;
	cin >> n >> m;
	for(int i = 0; i < m; i++) {
		int in;
		cin >> in;
		station[in].push_back(i+1);
	}
	for(int i = 1; i <= n; i++) {
		cin >> need[i];
	}
	int q;
	cin >> q;
	for(int i = 1; i <= q; i++) {
		cin >> from[i] >> to[i] >> add[i];
	}
	vector <int> owner(n);
	for(int i = 0; i < n; i++) owner[i] = i+1;
	from[q+1] = 1, to[q+1] = m, add[q+1] = 0;
	t.init(m);
	f(1, q + 1, owner);
	for(int i = 1; i <= n; i++) {
		if(ans[i] > q) cout << "NIE\n";
		else cout << ans[i] << "\n";
	}
}

Subtask #1

12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	16988 KB	Output is correct
2	Correct	3 ms	16988 KB	Output is correct
3	Correct	4 ms	16984 KB	Output is correct

Subtask #2

12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	16988 KB	Output is correct
2	Correct	4 ms	17036 KB	Output is correct
3	Correct	4 ms	16988 KB	Output is correct

Subtask #3

12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	29 ms	19028 KB	Output is correct
2	Correct	49 ms	24072 KB	Output is correct
3	Correct	49 ms	19036 KB	Output is correct

Subtask #4

12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	45 ms	18776 KB	Output is correct
2	Correct	48 ms	18776 KB	Output is correct
3	Correct	57 ms	22964 KB	Output is correct
4	Correct	23 ms	19804 KB	Output is correct

Subtask #5

13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	29 ms	18780 KB	Output is correct
2	Correct	43 ms	23080 KB	Output is correct
3	Correct	14 ms	17072 KB	Output is correct
4	Correct	49 ms	19260 KB	Output is correct

Subtask #6

13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	30 ms	18136 KB	Output is correct
2	Correct	48 ms	18844 KB	Output is correct
3	Correct	39 ms	18512 KB	Output is correct
4	Correct	58 ms	22356 KB	Output is correct

Subtask #7

0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	395 ms	39812 KB	Output is correct
2	Incorrect	177 ms	24152 KB	Output isn't correct
3	Halted	0 ms	0 KB	-

Subtask #8

0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	401 ms	36572 KB	Output is correct
2	Incorrect	152 ms	24012 KB	Output isn't correct
3	Halted	0 ms	0 KB	-