oj.uz

Submission #922520

# Submission time Handle Problem Language Result Execution time Memory
922520 2024-02-05T15:46:11 Z vjudge1 Meteors (POI11_met) C++17
74 / 100
 4357 ms 59096 KB 
#include <bits/stdc++.h>
#define speed ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define file(s) if (fopen(s".in", "r")) freopen(s".in", "r", stdin), freopen(s".out", "w", stdout)
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define sz(x) (int)x.size()
#define F first
#define S second
#define ll long long
 
const int dx[] = {0, 1, 0, -1, -1, 1, 1, -1};
const int dy[] = {1, 0, -1, 0, -1, 1, -1, 1};
const int maxn = 3e5+7;
const int inf = 1e9;
const int mod = 1e9+7;
 
using namespace std;
 
int n, m, k;
int s[maxn], p[maxn];
int L[maxn], R[maxn], x[maxn];
ll t[4 * maxn], ps[4 * maxn];
vector <int> cur[maxn];
vector <int> have[maxn];
int res[maxn];
 
struct node{
	int sl, sr;
} seg[maxn];
 
void push(int tl, int tr, int v){
	if(tl != tr){
		ps[v * 2] += ps[v];
		ps[v * 2 + 1] += ps[v];
	}
	t[v] += ps[v];
	ps[v] = 0;
}
 
void build(int tl = 1, int tr = m, int v = 1){
	t[v] = ps[v] = 0;
	if(tl == tr) return;
	int md = (tl + tr) / 2;
	build(tl, md, v * 2);
	build(md + 1, tr, v * 2 + 1);
}
 
void update(int l, int r, int val, int tl = 1, int tr = m, int v = 1){
	push(tl, tr, v);
	if(l > tr || tl > r) return;
	else if(l <= tl && tr <= r){
		ps[v] += val;
		push(tl, tr, v);
	}else{
		int md = (tl + tr) / 2;
		update(l, r, val, tl, md, v * 2);
		update(l, r, val, md + 1, tr, v * 2 + 1);
	}
}
 
int get(int pos, int tl = 1, int tr = m, int v = 1){
	push(tl, tr, v);
	if(tl == tr){
		return t[v];
	}else{
		int md = (tl + tr) / 2;
		if(pos <= md) return get(pos, tl, md, v * 2);
		else return get(pos, md + 1, tr, v * 2 + 1);
	}
}
 
void solve(){
	cin >> n >> m;
	for(int i = 1; i <= m; i++){
		cin >> s[i];
		cur[s[i]].pb(i);
	}
	for(int i = 1; i <= n; i++){
		cin >> p[i];
	}
	cin >> k;
	for(int i = 1; i <= k; i++){
		cin >> L[i] >> R[i] >> x[i];
	}
	for(int i = 1; i <= n; i++){
		seg[i].sl = 1; seg[i].sr = k;
	}
	for(int rep = 1; rep <= 19; rep++){
		build();
		bool check = 1;
		for(int i = 1; i <= n; i++){
			if(seg[i].sl <= seg[i].sr){
				int md = (seg[i].sl + seg[i].sr) / 2;
				have[md].pb(i);
				check = 0;
			}
		}
		if(check) break;
		for(int i = 1; i <= k; i++){
			if(L[i] <= R[i]){
				update(L[i], R[i], x[i]);
			}else{
				update(L[i], m, x[i]);
				update(1, R[i], x[i]);
			}
			for(auto x : have[i]){
				ll ans = 0;
				for(auto pos : cur[x]){
					ans += get(pos);
					if(ans >= p[x]) break;
				}
				if(ans >= p[x]){
					res[x] = i;
					seg[x].sr = i - 1;
				}else{
					seg[x].sl = i + 1;
				}
			}
			have[i].clear();
		}
	}
	for(int i = 1; i <= n; i++){
		if(res[i] == 0){
			cout << "NIE\n";
			continue;
		}
		cout << res[i] << '\n';
	}
}
 
signed main(){
	speed
	int test = 1;
//	cin >> test;
	while(test--){
		solve();
	}
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 24924 KB Output is correct
2 Correct 9 ms 24924 KB Output is correct
3 Correct 9 ms 25044 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 24920 KB Output is correct
2 Correct 7 ms 24920 KB Output is correct
3 Correct 8 ms 25180 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 336 ms 26688 KB Output is correct
2 Correct 451 ms 30544 KB Output is correct
3 Correct 405 ms 28188 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 385 ms 27548 KB Output is correct
2 Correct 402 ms 27708 KB Output is correct
3 Correct 424 ms 30524 KB Output is correct
4 Correct 76 ms 27216 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 199 ms 27156 KB Output is correct
2 Correct 312 ms 31280 KB Output is correct
3 Correct 181 ms 25684 KB Output is correct
4 Correct 410 ms 28756 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 375 ms 26204 KB Output is correct
2 Correct 357 ms 27536 KB Output is correct
3 Correct 420 ms 26448 KB Output is correct
4 Correct 440 ms 31940 KB Output is correct

Subtask #7
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 4218 ms 59096 KB Output is correct
2 Incorrect 2058 ms 45912 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 4357 ms 57876 KB Output is correct
2 Incorrect 1154 ms 45128 KB Output isn't correct
3 Halted 0 ms 0 KB -