oj.uz

Submission #605597

# Submission time Handle Problem Language Result Execution time Memory
605597 2022-07-25T19:26:50 Z 1ne Meteors (POI11_met) C++14
74 / 100
 6000 ms 65536 KB 
#include <bits/stdc++.h>
using namespace std;
struct node{
	long long l,r,v;
};
struct dataa{
	long long v = 0,lazy =0;
	void add(long long left,long long right,long long val){
		v+=val;
		lazy+=val;
	}
};
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!=0){
			tree[node + 1].add(left,mid,tree[node].lazy);
			tree[z].add(mid + 1,right,tree[node].lazy);
			tree[node].lazy = 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){
		if (left > uright || right < uleft) return;
		if (uleft <= left && right <=uright){
			tree[node].add(left,right,v);
			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);
		}
		if (uright > mid){
			update(z,mid + 1,right,uleft,uright,v);
		}
		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){
		update(0,0,m,uleft,uright,v);
	}
};
 
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);
	while(changed){
		changed = false;
		Segment_Tree st;
		st.tree.resize(2 * m - 1);
		st.m = m - 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);
			}
		}
		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);
			}	
			else{
				st.update(edge[i].l,m - 1,edge[i].v);
				st.update(0,edge[i].r,edge[i].v);
			}
			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;
				}
			}
		}
	}
	for (auto x:ans){
		x++;
		if (x > k)cout<<"NIE\n";
		else cout<<x<<'\n';
	}
	return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 420 KB Output is correct
2 Correct 4 ms 340 KB Output is correct
3 Correct 5 ms 340 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 340 KB Output is correct
2 Correct 3 ms 340 KB Output is correct
3 Correct 5 ms 468 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 412 ms 5228 KB Output is correct
2 Correct 520 ms 7660 KB Output is correct
3 Correct 520 ms 7004 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 498 ms 6520 KB Output is correct
2 Correct 499 ms 6456 KB Output is correct
3 Correct 510 ms 7964 KB Output is correct
4 Correct 94 ms 4348 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 267 ms 5516 KB Output is correct
2 Correct 344 ms 8336 KB Output is correct
3 Correct 199 ms 2724 KB Output is correct
4 Correct 579 ms 7600 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 524 ms 4564 KB Output is correct
2 Correct 417 ms 6296 KB Output is correct
3 Correct 470 ms 4860 KB Output is correct
4 Correct 532 ms 8968 KB Output is correct

Subtask #7
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 5322 ms 40540 KB Output is correct
2 Correct 2118 ms 25048 KB Output is correct
3 Correct 1107 ms 12376 KB Output is correct
4 Execution timed out 6054 ms 65108 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #8
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 5526 ms 38800 KB Output is correct
2 Correct 1439 ms 25056 KB Output is correct
3 Correct 943 ms 9904 KB Output is correct
4 Runtime error 5616 ms 65536 KB Execution killed with signal 9
5 Halted 0 ms 0 KB -