제출 #1043451

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1043451		DorostWef	사탕 분배 (IOI21_candies)	C++17	38 / 100	5032 ms	18004 KiB

candies

#include "candies.h"

#include <bits/stdc++.h>

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")

#define Min(a,b) ((a)<(b)?(a):(b))
#define Max(a,b) ((a)>(b)?(a):(b))

using namespace std;
const int N = 200004;
int a[N], ll[N], rr[N], cc[N], vv[N];

std::vector<int> distribute_candies(std::vector<int> c, std::vector<int> l,
                                    std::vector<int> r, std::vector<int> v) {
    int n = c.size();
    int q = (int)l.size();
   	for (int i = 0; i < q; i++) {
   		ll[i] = l[i];
   		rr[i] = r[i];
   		vv[i] = v[i];
	}
	for (int i = 0; i < n; i++)
		cc[i] = c[i];
    for (int i = 0; i < q; i++) {
    	for (int j = ll[i]; j <= rr[i]; j++) {
    		a[j] += vv[i];
    		a[j] = Min (a[j], cc[j]);
    		a[j] = Max (a[j], 0);
		}
	}
    std::vector<int> s(n);
    for (int i = 0; i < n; i++)
    	s[i] = a[i];
    return s;
}

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