| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 605621 |
2022-07-25T19:59:37 Z |
1ne |
Meteors (POI11_met) |
C++14 |
|
6000 ms |
43904 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;
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);
Segment_Tree st;
st.tree.resize(2 * m - 1);
st.m = m - 1;
while(changed){
changed = false;
st.update(0,m - 1,0,2);
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,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;
}
}
}
}
for (auto x:ans){
x++;
if (x > k)cout<<"NIE\n";
else cout<<x<<'\n';
}
return 0;
}
| # |
Verdict |
Execution time |
Memory |
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 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
460 KB |
Output is correct |
| 2 |
Correct |
4 ms |
340 KB |
Output is correct |
| 3 |
Correct |
6 ms |
468 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
484 ms |
5768 KB |
Output is correct |
| 2 |
Correct |
609 ms |
8476 KB |
Output is correct |
| 3 |
Correct |
575 ms |
7828 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
558 ms |
7108 KB |
Output is correct |
| 2 |
Correct |
599 ms |
7120 KB |
Output is correct |
| 3 |
Correct |
542 ms |
8632 KB |
Output is correct |
| 4 |
Correct |
96 ms |
5212 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
235 ms |
6344 KB |
Output is correct |
| 2 |
Correct |
377 ms |
9080 KB |
Output is correct |
| 3 |
Correct |
233 ms |
2856 KB |
Output is correct |
| 4 |
Correct |
592 ms |
8372 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
597 ms |
5360 KB |
Output is correct |
| 2 |
Correct |
489 ms |
7120 KB |
Output is correct |
| 3 |
Correct |
508 ms |
5768 KB |
Output is correct |
| 4 |
Correct |
606 ms |
9924 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
6042 ms |
43904 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
6061 ms |
42672 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
