oj.uz

답안 #769594

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
769594 2023-06-29T20:23:43 Z YassirSalama 사탕 분배 (IOI21_candies) C++17
0 / 100
 193 ms 41184 KB 
#include "candies.h"
#include<bits/stdc++.h>
#include <vector>
using namespace std;
#define ll long long
const int MAXN=2e5;
ll tree[4*MAXN];
ll lazy[4*MAXN];
vector<int> cc;
// int n;
vector<int> ans;
// int q;
void push(int node,int l,int r){
    if(lazy[node]){
        tree[node]+=(r-l+1)*lazy[node];
        if(l!=r) lazy[node<<1]+=lazy[node],
                 lazy[node<<1|1]+=lazy[node];
        lazy[node]=0;
    }
}
void update(int node,int l,int r,int ql,int qr,int v){
    push(node,l,r);
    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);
    tree[node]=tree[node<<1]+tree[node<<1|1];
}
void build(int node,int l,int r){
    push(node,l,r);
    push(node<<1,l,(l+r)/2);
    push(node<<1|1,1+(l+r)/2,r);
    if(l==r){
        if(cc[l]<tree[node]) ans.push_back(cc[l]);
        else ans.push_back((int)tree[node]);
        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,0LL,sizeof lazy);
    memset(tree,0LL,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.clear();
    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);
    }
    // for(int i=0;i<n;i++){
        // ll x=query(1,0,n-1,i);
        // s[i]=min(x,(long long)c[i]);
    // }
    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 5 ms 12756 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 193 ms 41184 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

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 4 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 5 ms 12756 KB Output isn't correct
3 Halted 0 ms 0 KB -