답안 #436366

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
436366 2021-06-24T12:59:01 Z PiejanVDC 사탕 분배 (IOI21_candies) C++17
3 / 100
5000 ms 7364 KB
#include "candies.h"
#include <bits/stdc++.h>
using namespace std;

vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v) {
    int n = c.size(), q = v.size();
    vector<int>ans(n,0);
    for(int i = 0 ; i < q ; i++) {
        for(int j = l[i] ; j <= r[i] ; j++) ans[j]=(v[i]>0?min(c[j],ans[j]+v[i]):max(0,ans[j]+v[i]));
    }
    return ans;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 4 ms 332 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5039 ms 7344 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 201 ms 4960 KB Output is correct
3 Correct 195 ms 3828 KB Output is correct
4 Execution timed out 5046 ms 7364 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 204 KB Output is correct
3 Correct 462 ms 5016 KB Output is correct
4 Correct 501 ms 2740 KB Output is correct
5 Execution timed out 5075 ms 7236 KB Time limit exceeded
6 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 4 ms 332 KB Output is correct
6 Execution timed out 5039 ms 7344 KB Time limit exceeded
7 Halted 0 ms 0 KB -