oj.uz

답안 #605617

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
605617 2022-07-25T19:49:49 Z 1ne Meteors (POI11_met) C++14
74 / 100
 5220 ms 65536 KB 
#include <bits/stdc++.h>
using namespace std;
struct node{
	long long l,r,v;
};
struct dataa{
	long long v = 0;
	pair<long long,int>lazy = {0,0};
	void add(long long left,long long right,pair<long long,int>val){
		if (val.second == 2){
			v = val.first;
		}
		else if (val.second == 1){
			v += val.first;
		}
		if (val.second == 2){
			lazy = val;
		}
		else{
			lazy.first+=val.first;
			if (lazy.second !=2)lazy.second = 1;
		}
	}
};
struct Segment_Tree{
	vector<dataa>tree;
	int m;
	void init(long long n){
		tree.resize(2*n - 1);
		m = n - 1;
	}
	dataa combine(dataa& left,dataa& right){
		dataa res;
		res.v = left.v + right.v;
		return res;
	}
	void push(long long node,long long left,long long right){
		long long mid = (left + right)>>1;
		long long z = node + ((mid - left + 1)<<1);
		if(tree[node].lazy.second!=0){
			tree[node + 1].add(left,mid,tree[node].lazy);
			tree[z].add(mid + 1,right,tree[node].lazy);
			tree[node].lazy.first = 0;
			tree[node].lazy.second =0;
		}
	}
	long long query(long long node,long long left,long long right,long long qleft,long long qright){
		if (qright<left|| qleft > right)return 0;
		if (qleft<=left && qright>=right){
			return tree[node].v;
		}
		push(node,left,right);
		long long mid = (left + right)>>1;
		long long z = node + ((mid - left + 1)<<1);
		long long ans = 0;
		if (qleft<=mid){
			ans+=query(node + 1,left,mid,qleft,qright);
		}
		if (qright > mid){
			ans+=query(z,mid + 1,right,qleft,qright);
		}
		return ans;
	}
	void update(long long node,long long left,long long right,long long uleft,long long uright,long long v,int type){
		if (left > uright || right < uleft) return;
		if (uleft <= left && right <=uright){
			tree[node].add(left,right,make_pair(v,type));
			return;
		}
		push(node,left,right);
		long long mid = (left + right)>>1;
		long long z = node + ((mid - left + 1)<<1);
		if (uleft<=mid){
			update(node + 1,left,mid,uleft,uright,v,type);
		}
		if (uright > mid){
			update(z,mid + 1,right,uleft,uright,v,type);
		}
		tree[node] = combine(tree[node + 1],tree[z]);
	}
	long long query(int qleft,int& qright){
		return query(0,0,m,qleft,qright);
	}
	void update(int uleft,int uright,long long v,int type){
		update(0,0,m,uleft,uright,v,type);
	}
};
 
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	int n,m;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--;
	}
	queue<node>q;
	vector<int>l(n),r(n);
	for (int i = 0;i<n;++i){
		l[i] = 0,r[i] = k;
	}
	vector<int>ans(n,-1);
	bool changed = true;
	vector<vector<int>>need(k + 1);
	for (int i = 0;i<n;++i){
		int mid = (l[i] + r[i])>>1;
		if (l[i] == r[i]){
			ans[i] = l[i];
		}
		else{
			need[mid].push_back(i);
		}
	}
	Segment_Tree st;
	st.init(m);
	while(changed){
		changed = false;
		st.update(0,m - 1,0,2);
		for (int i = 0;i<k;++i){
			if (edge[i].l<=edge[i].r){
				st.update(edge[i].l,edge[i].r,edge[i].v,1);
			}	
			else{
				st.update(edge[i].l,m - 1,edge[i].v,1);
				st.update(0,edge[i].r,edge[i].v,1);
			}
			while(!need[i].empty()){
				int x = need[i].back();
				need[i].pop_back();
				changed = true;
				long long sum = 0;
				for (auto y:arr[x]){
					sum+=st.query(y,y);
					if (sum >= brr[x])break;
				}
				if (sum < brr[x]){
					l[x] = i + 1;
				}
				else{
					r[x] = i;
				}
				if (l[x] == r[x]){
					ans[x] = l[x];
				}
				else{
					need[(l[x] + r[x])>>1].push_back(x);
				}
			}
		}
	}
	for (auto x:ans){
		x++;
		if (x > k)cout<<"NIE\n";
		else cout<<x<<'\n';
	}
	return 0;
}

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 340 KB Output is correct
2 Correct 5 ms 468 KB Output is correct
3 Correct 5 ms 340 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 340 KB Output is correct
2 Correct 4 ms 448 KB Output is correct
3 Correct 5 ms 468 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 457 ms 5964 KB Output is correct
2 Correct 554 ms 8432 KB Output is correct
3 Correct 553 ms 7792 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 501 ms 7096 KB Output is correct
2 Correct 533 ms 7232 KB Output is correct
3 Correct 580 ms 8592 KB Output is correct
4 Correct 94 ms 5144 KB Output is correct

Subtask #5
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 210 ms 6380 KB Output is correct
2 Correct 384 ms 9064 KB Output is correct
3 Correct 199 ms 2932 KB Output is correct
4 Correct 563 ms 8324 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 479 ms 5356 KB Output is correct
2 Correct 508 ms 7244 KB Output is correct
3 Correct 439 ms 5712 KB Output is correct
4 Correct 614 ms 9948 KB Output is correct

Subtask #7
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4010 ms 45016 KB Output is correct
2 Correct 2189 ms 29816 KB Output is correct
3 Correct 1162 ms 12388 KB Output is correct
4 Runtime error 5220 ms 65536 KB Execution killed with signal 9
5 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4621 ms 43332 KB Output is correct
2 Correct 1469 ms 29928 KB Output is correct
3 Correct 1012 ms 10056 KB Output is correct
4 Runtime error 3559 ms 65536 KB Execution killed with signal 9
5 Halted 0 ms 0 KB -