제출 #1215702

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1215702		dosts	사탕 분배 (IOI21_candies)	C++20	8 / 100	62 ms	9032 KiB

candies

#include "candies.h"
#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
#define int long long
#define pii pair<int,int>
#define vi vector<int>
#define ff first
#define ss second
#define sp << " " <<
#define all(x) x.begin(),x.end()
#define big(x) ((int)(x.size()))
using namespace std;
const int MOD = 1e9+7, LIM = 1e6+1, inf = 2e9;
std::vector<int32_t> distribute_candies(std::vector<int32_t> c, std::vector<int32_t> l,
                                    std::vector<int32_t> r, std::vector<int32_t> v) {
    int n = c.size(),q = r.size();
    vi a(n,0);
    for (int i = 0;i<q;i++) {
        a[l[i]]+=v[i];
        if (r[i] < n-1) a[r[i]+1]-=v[i];
    }
    for (int i=1;i<n;i++) a[i]+=a[i-1];
    for (int i = 0;i<n;i++) a[i] = min(a[i],(int)c[i]);
    return vector<int32_t>(all(a));
}

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