oj.uz

답안 #712145

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
712145 2023-03-18T08:35:27 Z danikoynov 사탕 분배 (IOI21_candies) C++17
3 / 100
 5000 ms 13284 KB 
#include "candies.h"

#include <bits/stdc++.h>

using namespace std;

const int maxn = 2e5 + 10;

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

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 6 ms 340 KB Output is correct

Subtask #2
0 / 8.0

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

Subtask #3
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 529 ms 8028 KB Output is correct
3 Correct 455 ms 6784 KB Output is correct
4 Execution timed out 5070 ms 13284 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 296 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 1421 ms 7656 KB Output is correct
4 Correct 1357 ms 4776 KB Output is correct
5 Execution timed out 5020 ms 10844 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 6 ms 340 KB Output is correct
6 Execution timed out 5044 ms 12080 KB Time limit exceeded
7 Halted 0 ms 0 KB -