oj.uz

Submission #865118

# Submission time Handle Problem Language Result Execution time Memory
865118 2023-10-24T05:42:14 Z vjudge1 Meteors (POI11_met) C++17
24 / 100
 6000 ms 47960 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];
int sz;
int root[N];
struct DO{
	int l, r, sum;
}t[N*4];
int upd(int v, int pos, int tl=1, int tr=m){
	int nv = ++sz;
	t[nv] = t[v];
	if(tl == tr){
		t[nv].sum++;
		return nv; 
	}
	if(pos <= tm)t[nv].l = upd(t[nv].l, pos, tl, tm);
	else t[nv].r = upd(t[nv].r, pos, tm+1, tr);
	t[nv].sum = t[t[nv].l].sum + t[t[nv].r].sum;
	return nv;
}
int get(int v, int l, int r, int tl=1, int tr=m){
	if(NET)return 0;
	if(DA)return t[v].sum;
	return get(t[v].l, l, r, tl, tm) + get(t[v].r, l, r, tm+1, tr);
}
void AlemAmenov(){
	
	cin >> n >> m;
	for(int i=1; i <= m; i++){
		cin >> a[i];
		root[a[i]] = upd(root[a[i]], i);
		// cout << root[a[i]] << ' ';
	}
	for(int i=1; i <= n; i++){
		cin >> b[i];
	}
	cin >> k;
	for(int i=1; i <= n; i++){
		c[i].l = 1;
		c[i].r = k;
	}
	for(int i=1; i <= k; i++){
		cin >> f[i].l >> f[i].r >> f[i].p;
	}
	for(int gg=1; gg <= 20; gg++){
		for(int i=1; i <= n; i++){
			c[i].m = (c[i].l + c[i].r)/2;
			if(c[i].l <= c[i].r){
				int cnt=0;
				for(int j=1; j <= c[i].m; j++){
					if(f[j].l <= f[j].r){
						cnt += get(root[i], f[j].l, f[j].r) * f[j].p;
					}
					else {
						cnt += get(root[i], f[j].l, m) * f[j].p;
						cnt += get(root[i], 1, f[j].r) * f[j].p;
					}
				}
				if(b[i] <= cnt)c[i].ans = c[i].m, c[i].r = c[i].m-1;
				else c[i].l = c[i].m+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 98 ms 8796 KB Output is correct
2 Correct 616 ms 8860 KB Output is correct
3 Correct 149 ms 8792 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 118 ms 8864 KB Output is correct
2 Correct 49 ms 8796 KB Output is correct
3 Correct 676 ms 8884 KB Output is correct

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Execution timed out 6077 ms 29528 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Execution timed out 6060 ms 29604 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 13.0

# Verdict Execution time Memory Grader output
1 Execution timed out 6008 ms 29528 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Execution timed out 6095 ms 29272 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 13.0

# Verdict Execution time Memory Grader output
1 Execution timed out 6042 ms 47356 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Execution timed out 6050 ms 47960 KB Time limit exceeded
2 Halted 0 ms 0 KB -