oj.uz

Submission #865696

# Submission time Handle Problem Language Result Execution time Memory
865696 2023-10-24T14:13:44 Z vjudge1 Meteors (POI11_met) C++17
100 / 100
 3241 ms 65536 KB 
//gm  --- akezhon
#include <bits/stdc++.h>
//#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define ll long long
#define pb push_back
#define F first
#define S second
#define all(v) v.begin(),v.end()
#define pii pair<int,int>
#define tm (tl+tr)/2
#define TL v+v, tl, tm
#define TR v+v+1, tm+1, tr
#define DA l <= tl && tr <= r
#define NET r < tl || tr < l
#define double long double
using namespace std;
const int N=3e5+7;
const int M=1e9+7;
const int inf=1e9;
int n, m, k, fff;
int b[N];
struct qu{
	int l, r, p;
}f[N];
int l[N];
int r[N];
vector <int> q[N], pos[N];
ll p[N*4];
void push(int v, int tl, int tr){
	if(!p[v] || tl == tr)return;
	p[v+v] += p[v];
	p[v+v+1] += p[v];
	p[v] = 0;	
}
void build(int v=1, int tl=1, int tr=m){
	p[v] = 0;
	if(tl == tr)return;
	build(TL);
	build(TR);
}
void upd(int l, int r, int x, int v=1, int tl=1, int tr=m){
	if(NET)return;
	if(DA){
		p[v] += x;
		return;
	}
	upd(l, r, x, TL);
	upd(l, r, x, TR);
}
ll get(int pos, int v=1, int tl=1, int tr=m){
	push(v, tl, tr);
	if(tl == tr)return p[v];
	if(pos <= tm)return get(pos, TL);
	else return get(pos, TR);
}
void AlemAmenov(){
	
	cin >> n >> m;
	for(int i=1; i <= m; i++){
		cin >> fff;
		pos[fff].pb(i);
	}
	for(int i=1; i <= n; i++){
		cin >> b[i];
	}
	cin >> k;
	for(int i=1; i <= k; i++){
		cin >> f[i].l >> f[i].r >> f[i].p;
	}
	for(int i=1; i <= n; i++){
		l[i] = 1;
		r[i] = k;
	}
	for(int gg=1; gg <= 20; gg++){
		build();
		for(int i=1; i <= k; i++){
			q[i].clear();
		}
		for(int i=1; i <= n; i++){
			if(l[i] <= r[i]){
				int md = (l[i] + r[i])/2;
				q[md].pb(i);
			}
		}
		for(int i=1; i <= k; i++){		
			if(f[i].l <= f[i].r){
				upd(f[i].l, f[i].r, f[i].p);
			}
			else {
				upd(1, f[i].r, f[i].p);
				upd(f[i].l, m, f[i].p);
			}
			for(int j : q[i]){
				ll sum=0;
				for(int it : pos[j]){
					sum += get(it);
					if(b[j] <= sum)break;
				}
				if(sum < b[j])l[j] = i+1;
				else r[j] = i-1;
			}
		}
	}
	for(int i=1; i <= n; i++){
		if(l[i] <= k)cout << l[i] << '\n';
		else cout << "NIE\n";
	}
	
}
signed main(){

	ios_base::sync_with_stdio(0);
	cin.tie(0);
	// freopen("promote.in", "r", stdin);
	// freopen("promote.out", "w", stdout);
	int RealName=1;
	// cin >> RealName;
	// int C=0;
	while(RealName--){
		// cout << "Case " << ++C << ":\n";
		AlemAmenov();
	}

return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 18776 KB Output is correct
2 Correct 7 ms 19032 KB Output is correct
3 Correct 8 ms 18892 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 18780 KB Output is correct
2 Correct 7 ms 18780 KB Output is correct
3 Correct 9 ms 19292 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 259 ms 21896 KB Output is correct
2 Correct 345 ms 23616 KB Output is correct
3 Correct 345 ms 23332 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 311 ms 22844 KB Output is correct
2 Correct 322 ms 22820 KB Output is correct
3 Correct 323 ms 23784 KB Output is correct
4 Correct 69 ms 22612 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 162 ms 22360 KB Output is correct
2 Correct 199 ms 24336 KB Output is correct
3 Correct 144 ms 19004 KB Output is correct
4 Correct 326 ms 23888 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 296 ms 21492 KB Output is correct
2 Correct 276 ms 22924 KB Output is correct
3 Correct 295 ms 21588 KB Output is correct
4 Correct 337 ms 24908 KB Output is correct

Subtask #7
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2654 ms 42540 KB Output is correct
2 Correct 909 ms 31128 KB Output is correct
3 Correct 694 ms 21396 KB Output is correct
4 Correct 3241 ms 65536 KB Output is correct

Subtask #8
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2637 ms 41376 KB Output is correct
2 Correct 837 ms 31116 KB Output is correct
3 Correct 565 ms 21096 KB Output is correct
4 Correct 3238 ms 65536 KB Output is correct