oj.uz

Submission #865785

# Submission time Handle Problem Language Result Execution time Memory
865785 2023-10-24T16:04:39 Z Nuraly_Serikbay Meteors (POI11_met) C++17
87 / 100
 2817 ms 61188 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
 
#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <cassert>
#include <iomanip>
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <fstream>
#include <unordered_map>
 
using namespace std;
 
typedef long long ll;
typedef long double ld;
 
//#define int long long
 
#define all(x) x.begin(),x.end()
#define pb push_back
#define ent "\n"
 
const int maxn = (int)3e5 + 1;
const int inf = (int)1e9;
 
int n,m;
vector<int>pos[maxn],MID[maxn];
int a[maxn];
int l[maxn],r[maxn],w[maxn];
pair<int,int>seg[maxn];
int t[maxn * 4],q[maxn * 4];
 
void upd(int v,int tl,int tr,int l,int r,int x){
	if(l > tr || r < tl)return;
	if(l <= tl && tr <= r){
		t[v] += x;
		t[v] = min(t[v],inf);
		return;
	}
	int mid = (tl + tr) >> 1;
	upd((v << 1),tl,mid,l,r,x);
	upd((v << 1) + 1,mid + 1,tr,l,r,x);
}
 
ll get(int v,int tl,int tr,int pos){
	if(t[v] >= inf || tl == tr){
		return t[v];
	}
	int mid = (tl + tr) >> 1;
	if(pos <= mid){
		return (t[v] + get((v << 1), tl,mid,pos));
	}
	else{
		return (t[v] + get((v << 1) + 1,mid + 1,tr,pos));
	}
}
 
int ans[maxn];
 
void solve(){
	cin >> n >> m;
	for(int i = 1 ; i <= m ; i ++){
		int o;cin >> o;
		pos[o].pb(i);
	}
	for(int i = 1 ; i <= n ; i ++){
		cin >> a[i];
	}
	int k;cin >> k;
	for(int i = 1 ; i <= k ; i++){
		cin >> l[i] >> r[i] >> w[i];
	}
	for(int i = 1 ; i <= n ; i ++){
		seg[i] = {1, k};
	}
	bool ok = 1;
	while(ok){
		memset (t, 0, sizeof(t));
		ok = 0;
		for(int i = 1 ; i <= n ; i ++){
			if(seg[i].first <= seg[i].second){
				int mid = (seg[i].first + seg[i].second) >> 1;
				MID[mid].pb(i);
				ok = 1;
			}
		}
		for(int i = 1 ; i <= k ; i ++){
			if(l[i] <= r[i]){
				upd(1,1,m,l[i],r[i],w[i]);
			}
			else{
				upd(1,1,m,l[i],m,w[i]);
				upd(1,1,m,1,r[i],w[i]);
			}
			int sum = 0;
			for(int x : MID[i]){
				sum = 0;
				for(int y : pos[x]){
					sum += get(1,1,m,y);
					if(sum >= a[x])break;
				}
				if(sum >= a[x]){
					seg[x].second = i - 1;
					ans[x] = i;
				}
				else{
					seg[x].first = i + 1;
				}
			}
			MID[i].clear();
		}
	}
	for(int i = 1 ; i <= n ; i ++){
		if (ans[i] == 0) cout << "NIE\n";
		else cout << ans[i] << '\n';
	}
}
 
int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int t = 1;
	//cin >> t;
	while(t --){
		solve();
	}
	return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 27740 KB Output is correct
2 Correct 9 ms 27924 KB Output is correct
3 Correct 9 ms 27740 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 27740 KB Output is correct
2 Correct 8 ms 27740 KB Output is correct
3 Correct 9 ms 27736 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 209 ms 28508 KB Output is correct
2 Correct 289 ms 30468 KB Output is correct
3 Correct 265 ms 30040 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 255 ms 29528 KB Output is correct
2 Correct 256 ms 29424 KB Output is correct
3 Correct 260 ms 30548 KB Output is correct
4 Correct 55 ms 29508 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 115 ms 29012 KB Output is correct
2 Correct 148 ms 30912 KB Output is correct
3 Correct 119 ms 27904 KB Output is correct
4 Correct 256 ms 30336 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 235 ms 27996 KB Output is correct
2 Correct 214 ms 29680 KB Output is correct
3 Correct 240 ms 28752 KB Output is correct
4 Correct 271 ms 31736 KB Output is correct

Subtask #7
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2262 ms 42440 KB Output is correct
2 Correct 711 ms 29192 KB Output is correct
3 Correct 623 ms 28024 KB Output is correct
4 Correct 2817 ms 61188 KB Output is correct

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2245 ms 41260 KB Output is correct
2 Correct 606 ms 29144 KB Output is correct
3 Incorrect 512 ms 28132 KB Output isn't correct
4 Halted 0 ms 0 KB -