oj.uz

Submission #865582

# Submission time Handle Problem Language Result Execution time Memory
865582 2023-10-24T11:12:00 Z vjudge1 Meteors (POI11_met) C++17
61 / 100
 3794 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 int 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;
int a[N];
int b[N];
struct qu{
	int l, r, p;
}f[N];
struct lol{
	int l, r, m, ans;
}c[N];
vector <int> q[N], pp[N];
int p[N*4];
void push(int v, int tl, int tr){
	if(!p[v])return;
	if(tl < tr){
		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){
	push(v, tl, tr);
	if(DA){
		p[v] += x;
		push(v, tl, tr);
		return;
	}
	if(NET)return;
	upd(l, r, x, TL);
	upd(l, r, x, TR);
}
int 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 >> a[i];
		pp[a[i]].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++){
		c[i].l = 1;
		c[i].r = k;
	}
	for(int gg=1; gg <= 20; gg++){
		for(int i=1; i <= m; i++){
			q[i].clear();
		}
		for(int i=1; i <= n; i++){
			if(c[i].l <= c[i].r){
				int md = (c[i].l + c[i].r)/2;
				q[md].pb(i);
			}
		}
		build();
		for(int i=1; i <= k; i++){		
			int l = f[i].l; 
			int r = f[i].r;
			if(f[i].l <= f[i].r){
				upd(l, r, f[i].p);
			}
			else {
				upd(1, r, f[i].p);
				upd(l, m, f[i].p);
			}
			for(int j : q[i]){
				int f=0;
				for(int it : pp[j]){
					f += get(it);
					if(b[j] <= f)break;
				}
				if(b[j] <= f){
					c[j].ans = i;
					c[j].r = i-1;
				}
				else c[j].l = i+1;
			}
		}
	}
	for(int i=1; i <= n; i++){
		if(c[i].ans)cout << c[i].ans << '\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 11 ms 22876 KB Output is correct
2 Correct 10 ms 22876 KB Output is correct
3 Correct 10 ms 22876 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 23128 KB Output is correct
2 Correct 10 ms 22876 KB Output is correct
3 Correct 10 ms 23144 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 408 ms 28500 KB Output is correct
2 Correct 501 ms 31708 KB Output is correct
3 Correct 482 ms 30604 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 463 ms 29984 KB Output is correct
2 Correct 485 ms 29856 KB Output is correct
3 Correct 491 ms 31704 KB Output is correct
4 Correct 89 ms 28024 KB Output is correct

Subtask #5
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 214 ms 28916 KB Output is correct
2 Correct 369 ms 31932 KB Output is correct
3 Incorrect 245 ms 25112 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 445 ms 27888 KB Output is correct
2 Correct 421 ms 29800 KB Output is correct
3 Correct 447 ms 28440 KB Output is correct
4 Correct 487 ms 32976 KB Output is correct

Subtask #7
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3794 ms 65536 KB Output is correct
2 Correct 2078 ms 41396 KB Output is correct
3 Incorrect 1199 ms 31592 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3664 ms 63364 KB Output is correct
2 Correct 1230 ms 41168 KB Output is correct
3 Incorrect 962 ms 32848 KB Output isn't correct
4 Halted 0 ms 0 KB -