oj.uz

답안 #574384

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
574384 2022-06-08T13:03:42 Z wjajjsasqq 사탕 분배 (IOI21_candies) C++17
11 / 100
 5000 ms 10700 KB 
#include "candies.h"
#include <algorithm>
#include <cstdio>
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2,tune=native")

const int INF = 1070000000;

const int N = 200005;
int n, a[N], c[N], C, res[N];
long long inc[N];

std::vector<int> distribute_candies(std::vector<int> c_, std::vector<int> l, std::vector<int> r, std::vector<int> v) {
	n = (int)c_.size();
	std::vector<int> ans(n);
	for (int i = 0; i < n; ++i) c[i] = c_[i];
	if (n <= 2000 && l.size() <= 2000) {
		for (int i = 0; i < (int)l.size(); ++i) {
			int ll = l[i], rr = r[i] + 1, d = v[i];
			for (int j = ll; j < rr; ++j) a[j] += d;
			if (d > 0) {
				for (int j = ll; j < rr; ++j) a[j] = a[j] < c[j] ? a[j] : c[j];
			} else {
				for (int j = ll; j < rr; ++j) a[j] = a[j] < 0 ? 0 : a[j];
			}
		}
		for (int i = 0; i < n; ++i) ans[i] = a[i];
	} else {
		bool pos = 1;
		for (int i = 0; i < (int)v.size(); ++i) if (v[i] < 0) pos = 0;
		if (pos) {
			for (int i = 0; i < (int)l.size(); ++i) {
				inc[l[i]] += v[i];
				inc[r[i] + 1] -= v[i];
			}
			for (int i = 0; i < n; ++i) {
				if (i) inc[i] += inc[i - 1];
				ans[i] = std::min((long long)c[i], inc[i]);
			}
		} else {
			C = c[0];
			for (int i = 0; i < (int)l.size(); ++i) {
				int ll = l[i], rr = r[i] + 1, d = v[i];
				for (int j = ll; j < rr; ++j) ans[j] += d;
				if (d < 0) for (int j = ll; j < rr; ++j) ans[j] = ans[j] < 0 ? 0 : ans[j];
				else for (int j = ll; j < rr; ++j) ans[j] = C < ans[j] ? C : ans[j];
			}
		}
	}
	return ans;
}

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 308 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 2 ms 436 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 104 ms 9700 KB Output is correct
2 Correct 100 ms 10664 KB Output is correct
3 Correct 97 ms 10700 KB Output is correct

Subtask #3
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 435 ms 5036 KB Output is correct
3 Correct 448 ms 4500 KB Output is correct
4 Execution timed out 5032 ms 8036 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Incorrect 1198 ms 5556 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 308 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 2 ms 436 KB Output is correct
6 Correct 104 ms 9700 KB Output is correct
7 Correct 100 ms 10664 KB Output is correct
8 Correct 97 ms 10700 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 435 ms 5036 KB Output is correct
11 Correct 448 ms 4500 KB Output is correct
12 Execution timed out 5032 ms 8036 KB Time limit exceeded
13 Halted 0 ms 0 KB -