| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 605631 |
2022-07-25T20:16:45 Z |
1ne |
Meteors (POI11_met) |
C++14 |
|
3467 ms |
36716 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--;
}
vector<int>order(n);
iota(order.begin(),order.end(),0);
int pos = -1;
vector<int>ans(n);
Segment_Tree st;
st.init(m);
function<void(int,int,vector<int>&)>solve = [&](int left,int right,vector<int>&temp){
if (left == right){
for (auto x:temp){
ans[x] = left;
}
return;
}
int mid = (left + right)>>1;
if (pos > mid){
for (int i = mid + 1;i<=pos;++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);
}
}
pos = mid;
}
else{
for (int i = pos + 1;i<=mid;++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);
}
}
pos = mid;
}
vector<int>f,s;
for (auto x:temp){
long long sum = 0;
for (auto y:arr[x]){
sum+=st.query(y,y);
if (sum >=brr[x])break;
}
//cout<<x.index<<" "<<mid<<" "<<k<<'\n';
if (sum>=brr[x]){
f.push_back(x);
}
else s.push_back(x);
}
temp.clear();
if (!f.empty()){
solve(left,mid,f);
}
if (!s.empty()){
solve(mid + 1,right,s);
}
};
solve(0,k,order);
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 |
2 ms |
340 KB |
Output is correct |
| 2 |
Correct |
2 ms |
340 KB |
Output is correct |
| 3 |
Correct |
3 ms |
340 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
340 KB |
Output is correct |
| 2 |
Correct |
2 ms |
340 KB |
Output is correct |
| 3 |
Correct |
3 ms |
340 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
101 ms |
3860 KB |
Output is correct |
| 2 |
Correct |
231 ms |
6340 KB |
Output is correct |
| 3 |
Correct |
333 ms |
4296 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
262 ms |
3968 KB |
Output is correct |
| 2 |
Correct |
288 ms |
3992 KB |
Output is correct |
| 3 |
Correct |
186 ms |
5824 KB |
Output is correct |
| 4 |
Correct |
83 ms |
3608 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
137 ms |
3772 KB |
Output is correct |
| 2 |
Correct |
214 ms |
5960 KB |
Output is correct |
| 3 |
Correct |
51 ms |
1492 KB |
Output is correct |
| 4 |
Correct |
276 ms |
4708 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
118 ms |
3380 KB |
Output is correct |
| 2 |
Correct |
223 ms |
4004 KB |
Output is correct |
| 3 |
Correct |
218 ms |
3448 KB |
Output is correct |
| 4 |
Correct |
297 ms |
5452 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1666 ms |
29480 KB |
Output is correct |
| 2 |
Correct |
233 ms |
18020 KB |
Output is correct |
| 3 |
Correct |
278 ms |
6248 KB |
Output is correct |
| 4 |
Correct |
3467 ms |
33292 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1655 ms |
26996 KB |
Output is correct |
| 2 |
Correct |
406 ms |
18144 KB |
Output is correct |
| 3 |
Correct |
88 ms |
5064 KB |
Output is correct |
| 4 |
Correct |
3054 ms |
36716 KB |
Output is correct |
