Submission #831848

#	Time	Username	Problem	Language	Result	Execution time	Memory
831848		Essa2006	사탕 분배 (IOI21_candies)	C++17	3 / 100	82 ms	8036 KiB

candies

#include<bits/stdc++.h>
#include "candies.h"
using namespace std;
#define ll long long 
#define FF first
#define SS second
#define all(a) a.begin(), a.end()
#define mod (ll)(1000000007)
 
vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v) {
    int n=c.size(), q=l.size();
    vector<int>p(n);
    bool all_pos=1;
    for(int j=0;j<q;j++){
        if(v[j]<0)
            all_pos=0;
    }
    if((ll)n*q<=1e8){
        for(int i=0;i<n;i++){
            for(int j=0;j<q;j++){
                if(i>=l[j] && i<=r[j]){
                    p[i]=min(c[i], max(0, p[i]+v[j]));
                }
            }
        }
        return p;
    }
    if(all_pos){
        vector<int>pp=p;
        for(int j=0;j<q;j++){
            pp[l[j]]+=v[j];
            if(r[j]!=n-1)
                pp[r[j]+1]-=v[j];
        }
        for(int i=0;i<n;i++){
            if(i)
                pp[i]+=pp[i-1];
            p[i]=min((ll)pp[i], (ll)c[i]);
        }
        return p;
    }
    
}
 
//int main() {
//    int n;
//    assert(1 == scanf("%d", &n));
//    std::vector<int> c(n);
//    for(int i = 0; i < n; ++i) {
//        assert(scanf("%d", &c[i]) == 1);
//    }
//
//    int q;
//    assert(1 == scanf("%d", &q));
//    std::vector<int> l(q), r(q), v(q);
//    for(int i = 0; i < q; ++i) {
//        assert(scanf("%d %d %d", &l[i], &r[i], &v[i]) == 3);
//    }
//
//    std::vector<int> ans = distribute_candies(c, l, r, v);
//
//    for(int i = 0; i < n; ++i) {
//        if (i > 0) {
//            printf(" ");
//        }
//        printf("%d", ans[i]);
//    }
//    printf("\n");
//    fclose(stdout);
//    return 0;
//}

Compilation message (stderr)

candies.cpp: In function 'std::vector<int> distribute_candies(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
candies.cpp:43:1: warning: control reaches end of non-void function [-Wreturn-type]
   43 | }
      | ^

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