제출 #828288

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
828288		Magikarp4000	사탕 분배 (IOI21_candies)	C++17	0 / 100	83 ms	8824 KiB

candies

#include "candies.h"
#include <bits/stdc++.h>
using namespace std;
#define OPTM ios_base::sync_with_stdio(0); cin.tie(0);
#define INF int(1e9+7)
#define ln '\n' 
#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define us unsigned short
#define FOR(i,s,n) for (int i = s; i < n; i++)
#define FORR(i,n,s) for (int i = n; i > s; i--)
#define FORX(u, arr) for (auto u : arr)
#define PB push_back
#define F first
#define S second
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define UM unordered_map
#define US unordered_set
#define PQ priority_queue
#define ALL(v) v.begin(), v.end()
const ll LLINF = 1e18+1;

const int MAXN = 2e5+5;
int n,q;
int d[MAXN];
vector<int32_t> res;

vector<int32_t> distribute_candies(vector<int32_t> c, vector<int32_t> l, vector<int32_t> r, vector<int32_t> v) {
    n = c.size(), q = l.size();
    res.resize(n);
    FOR(i,0,q) {
        if (d[l[i]] < 1e9) d[l[i]] += v[i];
        if (d[r[i]+1] < 1e9) d[r[i]+1] += -v[i];
    }
    FOR(i,1,n) d[i] += d[i-1];
    FOR(i,0,n) res[i] = min(c[i], d[i]);
    return res;
}

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