Submission #677874

#	Time	Username	Problem	Language	Result	Execution time	Memory
677874		APROHACK	사탕 분배 (IOI21_candies)	C++17	3 / 100	5050 ms	13556 KiB

candies

#include "candies.h"
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define ff first
#define ss second
using namespace std;
int n, q;
vector<int>s;
std::vector<int> distribute_candies(std::vector<int> c, std::vector<int> l,
                                    std::vector<int> r, std::vector<int> v) {
    n = c.size();
    q = l.size();
    for (int i = 0; i < n; i++)
    {
        s.pb(0);
    }
    
    for(int i = 0 ; i < q ; i  ++){
        for(int j = l[i] ; j <= r[i] ; j  ++){
            if(v[i] > 0){
                s[j] = min(c[j], v[i]+s[j]);
                //cout << "s[" << j << "] = " << s[j] << endl; 
            }else{
                s[j] = max(0, s[j]+v[i] );
                // << "s[" << j << "] = " << s[j] << endl;
            }
        }
    }

    return s;
}

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