제출 #435014

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
435014		Hegdahl	Distributing Candies (IOI21_candies)	C++17	3 / 100	5089 ms	7264 KiB

candies

#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx,avx2,sse,sse2,ssse3,sse4,mmx")

#include "candies.h"
#include <bits/stdc++.h>

#define ar array

using namespace std;

vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v) {
    int n = (int)c.size();
    int q = (int)v.size();

    vector<int> s(n);

    for (int qq = 0; qq < q; ++qq) {
        int i = l[qq], j = r[qq], x = v[qq];
        for (int k = i; k <= j; ++k)
            s[k] += x;

        for (int k = i; k <= j; ++k)
            if (s[k] < 0)
                s[k] = 0;

        for (int k = i; k <= j; ++k)
            if (s[k] > c[k])
                s[k] = c[k];
    }

    return s;
}

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