oj.uz

답안 #1022213

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1022213 2024-07-13T11:06:19 Z HappyCapybara 사탕 분배 (IOI21_candies) C++17
3 / 100
 5000 ms 13396 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, 0);
    for (int i=0; i<q; i++){
        for (int j=l[i]; j<=r[i]; j++){
            if (v[i] < 0) s[j] = max(0, s[j]+v[i]);
            else s[j] = min(c[j], s[j]+v[i]);
        }
    }
    return s;
}

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 448 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 2 ms 556 KB Output is correct

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5072 ms 12116 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 133 ms 8036 KB Output is correct
3 Correct 118 ms 5956 KB Output is correct
4 Execution timed out 5051 ms 13396 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 311 ms 7784 KB Output is correct
4 Correct 292 ms 4024 KB Output is correct
5 Execution timed out 5026 ms 10832 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 448 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 2 ms 556 KB Output is correct
6 Execution timed out 5072 ms 12116 KB Time limit exceeded
7 Halted 0 ms 0 KB -