oj.uz

답안 #826877

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
826877 2023-08-16T05:48:08 Z Sohsoh84 사탕 분배 (IOI21_candies) C++17
0 / 100
 5000 ms 7292 KB 
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx2")

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

using namespace std;

const int MAXN = 2e5;
const int T = 1000;

int A[MAXN];

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


	for (int s = 0; s < MAXN; s += T) {
		int fl = s, fr = (s + T - 1 >= n ? n - 1 : s + T - 1);

		for (int i = 0; i < q; i++) {
			int tl = (fl > l[i] ? fl : 0);
			int tr = (fr < r[i] ? fr : r[i]);
			for (int j = tl; j <= tr; j++) {
				A[j] = A[j] + v[i];
				A[j] = (A[j] > c[j] ? c[j] : A[j]);
				A[j] = (A[j] < 0 ? 0 : A[j]);
			}	
		}
	}

	return A;
}

Subtask #1
0 / 3.0

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

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5069 ms 7288 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

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

Subtask #4
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 166 ms 5048 KB Output is correct
4 Correct 124 ms 2728 KB Output is correct
5 Execution timed out 5064 ms 7292 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

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