Submission #614353

#	Time	Username	Problem	Language	Result	Execution time	Memory
614353		serize	Distributing Candies (IOI21_candies)	C++17	3 / 100	103 ms	8140 KiB

candies

#include <candies.h>
#include <bits/stdc++.h>
#include <cassert>
#include <cstdio>
#include <vector>

using namespace std;
const int MAX = 2e5+10;

std::vector<int> abi(MAX);

inline void add(int k, int v){
    if(k <= 0) return;
    while(k < MAX){
        abi[k]+=v;
        k += k&(-k);
    }
}

inline int read(int k){
    int sum = 0;
    while(k > 0){
        sum += abi[k];
        k -= k&(-k);
    }
    return sum;
}

std::vector<int> distribute_candies(std::vector<int> c, std::vector<int> l,
                                    std::vector<int> r, std::vector<int> v) {
    
    int n = c.size();
    int q = l.size();
    std::vector<int> s(n);
    if(q <= 2000){
        for(int i = 0; i < q; i++){
            for(int j = l[i]; j <= r[i]; j++){
                if(v[i] < 0){
                    s[j] = max(0,s[j]+v[i]);
                }
                else{
                    s[j] = min(c[j],s[j]+v[i]);
                }
            }
        }
        return s;
    }
    for(int i = 0; i < q; i++){
        add(l[i]+1,v[i]);
        add(r[i]+2,-v[i]);
    }
    for(int i = 0; i < n; i++){
        s[i] = min(c[i],read(i+1));
    }
    return s;
}

• Subtask 1: 3 / 3
• Subtask 2: 0 / 8
• Subtask 3: 0 / 27
• Subtask 4: 0 / 29
• Subtask 5: 0 / 33