답안 #826881

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
826881 2023-08-16T05:51:26 Z Sohsoh84 사탕 분배 (IOI21_candies) C++17
38 / 100
5000 ms 7460 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 = 500;
     
    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;
     
    		for (int i = 0; i < q; i++) {
    			int tl = (fl > l[i] ? fl : l[i]);
    			int tr = (fr < r[i] ? fr : r[i]);
    			if (v[i] >= 0) {
    				for (int j = tl; j <= tr; j++) {
    					A[j] = (A[j] + v[i] >= c[j] ? c[j] : A[j] + v[i]);	
    				}
    			} else {
    				for (int j = tl; j <= tr; j++) {
    					A[j] = (A[j] + v[i] >= 0 ? A[j] + v[i] : 0);
    				}
    			}
    		}
    	}
     
    	return A;
    }
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 3 ms 340 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 3210 ms 7372 KB Output is correct
2 Correct 3174 ms 7372 KB Output is correct
3 Correct 3219 ms 7372 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 608 ms 5036 KB Output is correct
3 Correct 65 ms 3776 KB Output is correct
4 Correct 3283 ms 7372 KB Output is correct
5 Correct 3279 ms 7460 KB Output is correct
6 Correct 3281 ms 7372 KB Output is correct
7 Correct 2784 ms 7372 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 647 ms 5036 KB Output is correct
4 Correct 121 ms 2824 KB Output is correct
5 Execution timed out 5065 ms 7280 KB Time limit exceeded
6 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 3 ms 340 KB Output is correct
6 Correct 3210 ms 7372 KB Output is correct
7 Correct 3174 ms 7372 KB Output is correct
8 Correct 3219 ms 7372 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 608 ms 5036 KB Output is correct
11 Correct 65 ms 3776 KB Output is correct
12 Correct 3283 ms 7372 KB Output is correct
13 Correct 3279 ms 7460 KB Output is correct
14 Correct 3281 ms 7372 KB Output is correct
15 Correct 2784 ms 7372 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 647 ms 5036 KB Output is correct
19 Correct 121 ms 2824 KB Output is correct
20 Execution timed out 5065 ms 7280 KB Time limit exceeded
21 Halted 0 ms 0 KB -