oj.uz

답안 #769609

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
769609 2023-06-29T21:06:15 Z YassirSalama 사탕 분배 (IOI21_candies) C++17
8 / 100
 220 ms 25416 KB 
#include "candies.h"
#include<bits/stdc++.h>
#include <vector>
using namespace std;
const int MAXN=2e5;
long long tree[4*MAXN+1];
long long lazy[4*MAXN+1];
vector<int> cc;
vector<int> ans;
void push(int node,int l,int r){
    if(lazy[node]!=0){
        tree[node]+=lazy[node];
        if(l!=r) lazy[node<<1]+=lazy[node],
                 lazy[node<<1|1]+=lazy[node];
        if(l==r) tree[node]=min(tree[node],(long long)cc[l]);
        lazy[node]=0;
    }
}
void update(int node,int l,int r,int ql,int qr,int v){
    push(node,l,r);
    if(l==r){
        tree[node]=min((long long)cc[l],tree[node]+v);
        return;
    }
    if(ql<=l&&r<=qr){
        lazy[node]+=v;
        push(node,l,r);
        return;
    }
    int mid=(l+r)/2;
    if(ql<=mid) update(node<<1,l,mid,ql,qr,v);
    if(qr>mid) update(node<<1|1,mid+1,r,ql,qr,v);
    push(node<<1,l,mid);
    push(node<<1|1,mid+1,r);
    tree[node]=min(tree[node<<1],tree[node<<1|1]);
}
void build(int node,int l,int r){
    push(node,l,r);
    if(l==r){
        push(node,l,r);
        ans[l]=(min(tree[node],(long long)cc[l]));
        return;
    }
    int mid=(l+r)/2;
    build(node<<1,l,mid);
    build(node<<1|1,mid+1,r);
}
vector<int> distribute_candies(vector<int> c, vector<int> l,
                                    vector<int> r, vector<int> v) {
    // memset(lazy,0,sizeof lazy);
    // memset(tree,0,sizeof tree);
    for(int i=0;i<4*MAXN;i++) tree[i]=0,lazy[i]=0;
    int n = c.size();
    int q = v.size();
    ans.resize(n,0);
    cc=c;
    for(int j=0;j<q;j++){
        int lrr=l[j],rr=r[j],cc=v[j];
        update(1,0,n-1,lrr,rr,cc);
    }
    build(1,0,n-1);
    return ans;
}

Subtask #1
0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 12756 KB Output is correct
2 Incorrect 4 ms 12756 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 220 ms 21436 KB Output is correct
2 Correct 215 ms 25392 KB Output is correct
3 Correct 219 ms 25416 KB Output is correct

Subtask #3
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 12756 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 12756 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 12756 KB Output is correct
2 Incorrect 4 ms 12756 KB Output isn't correct
3 Halted 0 ms 0 KB -