oj.uz

Submission #1034854

# Submission time Handle Problem Language Result Execution time Memory
1034854 2024-07-25T20:16:29 Z xnqs Meteors (POI11_met) C++17
74 / 100
 4113 ms 37676 KB 
#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <utility>
#include <algorithm>
#include <cstring>

struct Operation {
	int l, r, amt;
	Operation():
		l(0), r(0), amt(0) {}
	Operation(int l, int r, int amt):
		l(l), r(r), amt(amt) {}
};

struct ParallelBSQuery {
	int color;
	int l, r, m;
	ParallelBSQuery():
		color(0), l(0), r(0), m(0) {}
	ParallelBSQuery(int color, int l, int r):
		color(color), l(l), r(r), m((l+r)>>1) {}
};

int x, q, ops;
int color[300005];
int target[300005];
int ans[300005];
int64_t tree[1200005];
int64_t lazy[1200005];
std::vector<Operation> operations;
std::vector<ParallelBSQuery> queries;
std::vector<int> owned_by[300005];

void push(int node, int l, int r) {
	tree[node] += lazy[node];
	if (l!=r) {
		lazy[node<<1] += lazy[node];
		lazy[node<<1|1] += lazy[node];
	}
	lazy[node] = 0;
}

void update(int node, int l, int r, int st, int fi, int val) {
	push(node,l,r);
	if (l>fi||r<st) {
		return;
	}
	if (st<=l&&r<=fi) {
		lazy[node] += val;
		push(node,l,r);
		return;
	}

	int m = (l+r)>>1;
	update(node<<1,l,m,st,fi,val);
	update(node<<1|1,m+1,r,st,fi,val);
	tree[node] = tree[node<<1] + tree[node<<1|1];
}

int64_t query(int node, int l, int r, int st, int fi) {
	push(node,l,r);
	if (l>fi||r<st) {
		return 0;
	}
	if (st<=l&&r<=fi) {
		return tree[node];
	}

	int m = (l+r)>>1;
	return query(node<<1,l,m,st,fi) + query(node<<1|1,m+1,r,st,fi);
}

int64_t get_sum(int color) {
	int64_t ret = 0;
	for (const auto& i : owned_by[color]) {
		ret += query(1,1,x,i,i);
	}
	return ret;
}

int main() {
	std::ios_base::sync_with_stdio(false);
	std::cin.tie(NULL);
	std::cout.tie(NULL);

	std::cin >> q >> x;
	for (int i = 1; i <= x; i++) {
		std::cin >> color[i];
		owned_by[color[i]].emplace_back(i);
	}

	for (int i = 1; i <= q; i++) {
		std::cin >> target[i];
	}

	std::cin >> ops;
	operations.reserve(ops);
	for (int i = 0, l, r, amt; i < ops; i++) {
		std::cin >> l >> r >> amt;
		operations.emplace_back(l,r,amt);
	}

	for (int i = 0; i < q; i++) {
		ans[i+1] = -1;
		queries.emplace_back(i+1,0,ops-1);
	}

	for (int iterations = 0; iterations < 19; iterations++) {
		memset(tree,0,sizeof(tree));
		memset(lazy,0,sizeof(lazy));
		std::sort(queries.begin(),queries.end(),[](const ParallelBSQuery& a, const ParallelBSQuery& b) {
			return a.m < b.m;
		});

		int scanline = 0;
		for (auto& [color, l, r, m] : queries) {
			if (l>r) {
				continue;
			}

			while (scanline<=m) {
				auto [i, j, amt] = operations[scanline];
				if (i>j) {
					update(1,1,x,1,j,amt);
					update(1,1,x,i,x,amt);
				}
				else {
					update(1,1,x,i,j,amt);
				}
				++scanline;
			}

			int64_t cand = get_sum(color);
			if (cand>=target[color]) {
				ans[color] = m;
				r = m-1;
			}
			else {
				l = m+1;
			}

			m = (l+r)>>1;
		}
	}

	for (int i = 1; i <= q; i++) {
		if (ans[i]==-1) std::cout << "NIE\n";
		else std::cout << ans[i]+1 << "\n";
	}
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 26204 KB Output is correct
2 Correct 23 ms 26372 KB Output is correct
3 Correct 24 ms 26204 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 26204 KB Output is correct
2 Correct 22 ms 26200 KB Output is correct
3 Correct 24 ms 26200 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 429 ms 27628 KB Output is correct
2 Correct 472 ms 28360 KB Output is correct
3 Correct 460 ms 28124 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 438 ms 27868 KB Output is correct
2 Correct 458 ms 27860 KB Output is correct
3 Correct 515 ms 28372 KB Output is correct
4 Correct 149 ms 27604 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 274 ms 27736 KB Output is correct
2 Correct 423 ms 28628 KB Output is correct
3 Correct 87 ms 26936 KB Output is correct
4 Correct 466 ms 28240 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 225 ms 27216 KB Output is correct
2 Correct 420 ms 27868 KB Output is correct
3 Correct 436 ms 27484 KB Output is correct
4 Correct 465 ms 28628 KB Output is correct

Subtask #7
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 4113 ms 37676 KB Output is correct
2 Incorrect 2821 ms 32316 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3906 ms 37056 KB Output is correct
2 Incorrect 1590 ms 32176 KB Output isn't correct
3 Halted 0 ms 0 KB -