제출 #677876

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
677876		APROHACK	Distributing Candies (IOI21_candies)	C++17	3 / 100	106 ms	13856 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;
void initialize(){
    for (int i = 0; i < n; i++){
        s.pb(0);
    }
}


void case1(vector<int> c, vector<int> l, vector<int> r, vector<int> v){
    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;
                }
            }
        }
}

void case2(vector<int> c, vector<int> l, vector<int> r, vector<int> v){
    ll prefix[n+2];
    for(int i =0 ; i < q ; i ++){
        prefix[l[i]]+=v[i];
        prefix[r[i]+1]-= v[i];
    }
    int cuenta =0 ;
    for(int i = 0 ; i <n ; i ++){
        cuenta+=prefix[i];
        s[i] = min(cuenta, c[i]);
    }

}
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();
    initialize();
    if(n<=2000 and q <= 2000){
        case1(c, l, r, v);
    }
    else{
        case2(c, l, r, v);
    }
    

    return s;
}

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