답안 #529924

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
529924 2022-02-24T04:01:59 Z drdilyor 사탕 분배 (IOI21_candies) C++17
3 / 100
5000 ms 13224 KB
#define ll long long
#define ii pair<int, int>
#define vi vector<int>
#define vii vector<pair<int, int>>
#define INF 1000000000
#include <bits/stdc++.h>
using namespace std;

vi distribute_candies(vi c, vi l, vi r, vi v) {
    int n = c.size();
    int q = l.size();
    vi res(n);
    for (int i = 0; i < q; i++) {
        for (int j = l[i]; j <= r[i]; j++) {
            res[j] += v[i];
            if (res[j] > c[j]) res[j] = c[j];
            if (res[j] < 0) res[j] = 0;
        }
    }
    return res;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 304 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 3 ms 332 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5067 ms 7392 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 185 ms 8036 KB Output is correct
3 Correct 184 ms 5908 KB Output is correct
4 Execution timed out 5022 ms 13224 KB Time limit exceeded
5 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 292 KB Output is correct
3 Correct 456 ms 7652 KB Output is correct
4 Correct 463 ms 4004 KB Output is correct
5 Execution timed out 5041 ms 10840 KB Time limit exceeded
6 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 304 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 3 ms 332 KB Output is correct
6 Execution timed out 5067 ms 7392 KB Time limit exceeded
7 Halted 0 ms 0 KB -