답안 #803130

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
803130 2023-08-02T23:00:13 Z vjudge1 사탕 분배 (IOI21_candies) C++17
3 / 100
5000 ms 13268 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 = l.size();
    vector<int> s(n);
    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 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5077 ms 12076 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 157 ms 8028 KB Output is correct
3 Correct 140 ms 5964 KB Output is correct
4 Execution timed out 5004 ms 13268 KB Time limit exceeded
5 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 356 ms 7656 KB Output is correct
4 Correct 340 ms 3924 KB Output is correct
5 Execution timed out 5054 ms 10832 KB Time limit exceeded
6 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Execution timed out 5077 ms 12076 KB Time limit exceeded
7 Halted 0 ms 0 KB -