제출 #605592

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
605592		1ne	새로운 문제 (POI11_met)	C++14	0 / 100	6037 ms	18520 KiB

met

#include<bits/stdc++.h>
using namespace std;
struct node{
	long long l,r,v;
};
const int maxn = 300005;
long long tree[maxn];
int m;
void update(int x, long long val){
	while(x<=m){
		tree[x]+=val;
		x+=(x&-x);
 
	}
}
long long read(int x){
	long long s=0;
	while(x>0){
		s+=tree[x];
		x-=(x&-x);
	}
	return s;
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	int n;cin>>n>>m;
	vector<vector<int>>arr(n);
	for (int i = 0;i<m;++i){
		int x;cin>>x;
		arr[x - 1].push_back(i);
	}
	vector<long long>brr(n);
	for (int i = 0;i<n;++i)cin>>brr[i];
	int k;cin>>k;
	vector<node>edge(k);
	for (int i = 0;i<k;++i){
		cin>>edge[i].l>>edge[i].r>>edge[i].v;
		edge[i].l--;
		edge[i].r--;
	}
	vector<int>l(n),r(n);
	queue<int>q;
	int pos = -1;
	for (int i = 0;i<n;++i){
		q.push(i);
		l[i] = 0,r[i] = k;
	}
	vector<int>ans(n,-1);
	while(!q.empty()){
		int u = q.front();
		q.pop();
		if (l[u] == r[u]){
			ans[u] = l[u];
			continue;
		}
		int mid = (l[u] + r[u])>>1;
		if (pos > mid){
			for (int i = mid + 1;i<=pos;++i){
				if (edge[i].l<=edge[i].r){
					update(edge[i].l + 1,-edge[i].v),update(edge[i].r + 2,edge[i].v);
				}
				else{
					update(1,-edge[i].v);
					update(edge[i].r + 2,edge[i].v);
					update(edge[i].r + 1,-edge[i].v);
				}
			}
			pos = mid;
		}
		else{
			for (int i = pos + 1;i<=mid;++i){
				if (edge[i].l<=edge[i].r){
					update(edge[i].l + 1,edge[i].v),update(edge[i].r + 2,-edge[i].v);
				}
				else{
					update(1,edge[i].v);
					update(edge[i].r + 2,-edge[i].v);
					update(edge[i].l + 1,edge[i].v);
				}
			}
			pos = mid;
		}
		long long counts = 0;
		for (auto x:arr[u]){
			counts+=read(x + 1);
			if (counts >=brr[u])break;
		}
		if (counts < brr[u]){
			q.push(u);
			l[u] = mid + 1;
		}
		else {
			q.push(u);
			r[u] = mid;
		}
	}
	for (auto x:ans){
		x++;
		if (x > k)cout<<"NIE\n";
		else cout<<x<<'\n';
	}
	return 0;
}

• Subtask 1: 0 / 12
• Subtask 2: 0 / 12
• Subtask 3: 0 / 12
• Subtask 4: 0 / 12
• Subtask 5: 0 / 13
• Subtask 6: 0 / 13
• Subtask 7: 0 / 13
• Subtask 8: 0 / 13