oj.uz

Submission #865254

# Submission time Handle Problem Language Result Execution time Memory
865254 2023-10-24T06:51:42 Z vjudge1 Meteors (POI11_met) C++17
61 / 100
 2640 ms 45560 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];
int cnt[N];
int sl[N];
void AlemAmenov(){
	
	cin >> n >> m;
	for(int i=1; i <= m; i++){
		cin >> a[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 <= 30; gg++){
		for(int i=1; i <= m; i++){
			q[i].clear();
			sl[i] = 0;
		}
		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);
			}
			cnt[i] = 0;
		}
		for(int i=1; i <= k; i++){		
			if(f[i].l <= f[i].r){
				sl[f[i].l] += f[i].p;
				sl[f[i].r+1] -= f[i].p;
			}
			else {
				sl[1] += f[i].p;
				sl[f[i].r+1] -= f[i].p;
			
				sl[f[i].l] += f[i].p;
			}
			if(q[i].size()){
				int s=0;
				for(int j=1; j <= m; j++){
					s+=sl[j];
					cnt[a[j]] += s;
				}
			}
			for(int j : q[i]){
				if(b[j] <= cnt[j]){
					c[j].r = i-1;
					c[j].ans = i;
				}
				else c[j].l = i+1;
			}
			if(q[i].size()){
				for(int j=1; j <= m; j++){
					cnt[a[j]] = 0;
				}
			}
		}
	}
	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 3 ms 16732 KB Output is correct
2 Correct 3 ms 16732 KB Output is correct
3 Correct 4 ms 16732 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 16728 KB Output is correct
2 Correct 3 ms 16732 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 50 ms 19792 KB Output is correct
2 Correct 84 ms 24448 KB Output is correct
3 Correct 2640 ms 21680 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1397 ms 21248 KB Output is correct
2 Correct 1476 ms 21072 KB Output is correct
3 Correct 63 ms 24584 KB Output is correct
4 Correct 207 ms 21076 KB Output is correct

Subtask #5
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 973 ms 20152 KB Output is correct
2 Correct 1267 ms 25276 KB Output is correct
3 Incorrect 17 ms 16984 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 192 ms 19188 KB Output is correct
2 Correct 1757 ms 21084 KB Output is correct
3 Correct 572 ms 19540 KB Output is correct
4 Correct 2037 ms 26012 KB Output is correct

Subtask #7
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 423 ms 45560 KB Output is correct
2 Incorrect 141 ms 24916 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1338 ms 41904 KB Output is correct
2 Incorrect 136 ms 24912 KB Output isn't correct
3 Halted 0 ms 0 KB -