oj.uz

Submission #762409

# Submission time Handle Problem Language Result Execution time Memory
762409 2023-06-21T11:31:17 Z Kaztaev_Alisher Meteors (POI11_met) C++17
74 / 100
 209 ms 65536 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 int N = 3e5+5 , inf = 2e9 + 7;
const ll INF = 1e18 ,   mod = 1e9+7 , P = 6547;	

int p[N] , n , m , k , L[N] , R[N] , res[N];
ll t[N]; 
int l[N] , r[N] , c[N];
vector<int> g[N] , v;
deque<pair<int,int>> q;
void upd(int i, int x) {
	for(; i <= m; i |= (i + 1)) t[i] += x , v.push_back(i);
}

void updlr(int l, int r, int x){
    upd(l, x); upd(r + 1, -x);
}
ll get(int i){
    ll res = 0;
    for(; i > 0; i = (i & (i + 1)) - 1) res += t[i];
    ll con = 1000000000;
    return min(res,con);
}
void cl(){
	while(v.size()){
		t[v.back()] = 0;
		v.pop_back();
	}
}
void solve(){
	cin >> n >> m;
	for(int i = 1; i <= m; i++) {
		int a;
		cin >> a;
		g[a].push_back(i);
	}
	for(int i = 1; i <= n; i++) cin >> p[i];
	cin >> k;
	for(int i = 1; i <= n; i++) {
		L[i] = 1;
		R[i] = k;
		q.push_back(make_pair((k+1)/2,i));
	}
	for(int i = 1; i <= k; i++) cin >> l[i] >> r[i] >> c[i];
	for(int _ = 1; _ < 20; _++){
		cl();
		sort(all(q));
		for(int i = 1; i <= k; i++){
			if(l[i] > r[i]){
				updlr(l[i],m,c[i]);
				updlr(1,r[i],c[i]);
			} else  updlr(l[i],r[i],c[i]);
			while(!q.empty() && q.front().F == i){
				int x = q.front().S;
				q.pop_front();
				ll sum = p[x];
				for(int y : g[x]) sum -= get(y);
				if(sum <= 0){
					res[x] = i;
					R[x] = i-1;
				} else {
					L[x] = i+1; 
				}
				if(L[x] <= R[x]) q.push_back({(L[x]+R[x])/2,x});
			}
		}
	}
	for(int 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 5 ms 7508 KB Output is correct
2 Correct 5 ms 7508 KB Output is correct
3 Correct 5 ms 7508 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7500 KB Output is correct
2 Correct 5 ms 7508 KB Output is correct
3 Correct 5 ms 7596 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 120 ms 13028 KB Output is correct
2 Correct 199 ms 17856 KB Output is correct
3 Correct 146 ms 13464 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 163 ms 17340 KB Output is correct
2 Correct 166 ms 17356 KB Output is correct
3 Correct 204 ms 17984 KB Output is correct
4 Correct 38 ms 9400 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 120 ms 17088 KB Output is correct
2 Correct 142 ms 17976 KB Output is correct
3 Correct 73 ms 12256 KB Output is correct
4 Correct 149 ms 13600 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 168 ms 16960 KB Output is correct
2 Correct 184 ms 17340 KB Output is correct
3 Correct 122 ms 12860 KB Output is correct
4 Correct 200 ms 18064 KB Output is correct

Subtask #7
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 209 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 207 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -