oj.uz

Submission #762352

# Submission time Handle Problem Language Result Execution time Memory
762352 2023-06-21T10:34:36 Z vjudge1 Meteors (POI11_met) C++17
74 / 100
 2719 ms 61332 KB 
#include <bits/stdc++.h>
 
#define ios 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(a) a.begin() , a.end()
#define F first
#define S second
 
using namespace std;
using ll = long long;
 
const ll N = 3e5+5 , inf = 2e9 + 7;
const ll INF = 1e18 ,   mod = 1e9+7 , P = 6547;	

ll p[N] , n , m , k , L[N] , R[N] , res[N];
ll t[N*4]; 
ll l[N] , r[N] , c[N];
vector<ll> g[N] , q[N] , q1[N];
void build(ll v , ll tl , ll tr){
	t[v] = 0;
	if(tl == tr) return;
	ll tm = (tl+tr) >> 1;
	build(v*2,tl,tm);
	build(v*2+1,tm+1,tr);
}
void upd(ll v, ll tl , ll tr , ll l , ll r , ll val){
	if(l <= tl && tr <= r){
		t[v] += val;
		return;
	}
	if(tl > r || tr < l) return;
	ll tm = (tl+tr) >> 1;
	upd(v*2,tl,tm,l,r,val);
	upd(v*2+1,tm+1,tr,l,r,val);
}
ll get(ll v, ll tl , ll tr , ll pos){
	if(tl == tr) return t[v];
	ll tm = (tl+tr) >> 1;
	if(tm >= pos) return get(v*2,tl,tm,pos)+t[v];
	else return get(v*2+1,tm+1,tr,pos)+t[v];
}
void solve(){
	cin >> n >> m;
	for(ll i = 1; i <= m; i++) {
		ll a;
		cin >> a;
		g[a].push_back(i);
	}
	for(ll i = 1; i <= n; i++) cin >> p[i];
	cin >> k;
	for(ll i = 1; i <= n; i++) {
		L[i] = 1;
		R[i] = k;
		q[(L[i]+R[i])/2].push_back(i);
	}
	for(ll i = 1; i <= k; i++) cin >> l[i] >> r[i] >> c[i];
	for(int _ = 1; _ <= 20; _++){
		build(1,1,m);
		for(ll i = 1; i <= k; i++){
			if(l[i] > r[i]){
				upd(1,1,m,l[i],m,c[i]);
				upd(1,1,m,1,r[i],c[i]);
			} else {
				upd(1,1,m,l[i],r[i],c[i]);
			}
			for(ll x : q[i]){
				ll sum = p[x];
				for(ll y : g[x]) sum -= get(1,1,m,y);
				if(sum <= 0){
					res[x] = i;
					R[x] = i-1;
				} else {
					L[x] = i+1; 
				}
				if(L[x]  <= R[x]) q[(L[x]+R[x])/2].push_back(x);
			}
			q[i].clear();
		}
	}
	for(ll i = 1; i <= n; i++) {
		if(res[i] == 0){
			cout << "NIE\n";
		} else {
			cout << res[i] << "\n";
		}
	}
}
/*

*/
signed main(){
	ios;
	solve();
	return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 21588 KB Output is correct
2 Correct 16 ms 21588 KB Output is correct
3 Correct 15 ms 21608 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 21588 KB Output is correct
2 Correct 15 ms 21636 KB Output is correct
3 Correct 15 ms 21588 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 306 ms 25184 KB Output is correct
2 Correct 355 ms 28580 KB Output is correct
3 Correct 334 ms 27404 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 314 ms 26604 KB Output is correct
2 Correct 321 ms 26628 KB Output is correct
3 Correct 353 ms 28892 KB Output is correct
4 Correct 79 ms 25764 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 154 ms 25684 KB Output is correct
2 Correct 215 ms 29172 KB Output is correct
3 Correct 153 ms 22744 KB Output is correct
4 Correct 321 ms 28180 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 320 ms 24244 KB Output is correct
2 Correct 300 ms 26624 KB Output is correct
3 Correct 310 ms 24692 KB Output is correct
4 Correct 342 ms 30156 KB Output is correct

Subtask #7
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2719 ms 61332 KB Output is correct
2 Incorrect 1439 ms 39236 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2645 ms 59172 KB Output is correct
2 Incorrect 1040 ms 39236 KB Output isn't correct
3 Halted 0 ms 0 KB -