답안 #617905

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
617905 2022-08-01T16:48:44 Z sokratisi 사탕 분배 (IOI21_candies) C++17
3 / 100
5000 ms 13260 KB
#include "candies.h"

#include <vector>

using namespace std;

vector<int> distribute_candies(vector<int> c, vector<int> l,
                                    vector<int> r, vector<int> v) {
    int n = c.size();
    vector<int> s(n, 0);
    int q = l.size();
    for (int i = 0; i < q; i++) {
        for (int j = l[i]; j <= r[i]; j++) {
            if (v[i] > 0) {
                s[j] = min(c[j], s[j] + v[i]);
            }
            else {
                s[j] = max(0, s[j] + v[i]);
            }
        }
    }

    return s;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 3 ms 340 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5076 ms 7652 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 163 ms 8016 KB Output is correct
3 Correct 165 ms 6008 KB Output is correct
4 Execution timed out 5007 ms 13260 KB Time limit exceeded
5 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 404 ms 5012 KB Output is correct
4 Correct 407 ms 2792 KB Output is correct
5 Execution timed out 5058 ms 7244 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 1 ms 300 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 3 ms 340 KB Output is correct
6 Execution timed out 5076 ms 7652 KB Time limit exceeded
7 Halted 0 ms 0 KB -