oj.uz

답안 #435746

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
435746 2021-06-23T16:36:24 Z illyakr 사탕 분배 (IOI21_candies) C++17
3 / 100
 128 ms 8124 KB 
#include <bits/stdc++.h>
#include "candies.h"
using namespace std;

int n, q;
bool scbl = true;
int ans[201010];
std::vector<int> distribute_candies(std::vector<int> c, std::vector<int> l,
                                    std::vector<int> r, std::vector<int> v) {
    n = c.size(); q = v.size();
    vector<int> res(n);
    for (int i = 0; i < q; i++)
        if (v[i] < 0){scbl = false;break;}

    if (n * q <= 100000000) {
        for (int i = 0; i < q; i++) {
            for (int j = l[i]; j <= r[i]; j++) {
                res[j] += v[i];
                if (res[j] < 0)res[j] = 0;
                else if (res[j] > c[j])res[j] = c[j];
            }
        }
        return res;
    }
    if (scbl) {
        for (int i = 0; i < q; i++) {
            ans[l[i]] += v[i];
            ans[r[i] + 1] -= v[i];
        }
        for (int i = 1; i < n; i++)
            ans[i] += ans[i - 1];
        for (int i = 0; i < n; i++)ans[i] = min(ans[i], c[i]);
        for (int i = 0; i < n; i++)res[i] = ans[i];
        return res;
    }
    exit(1);
}

/**
3
10 15 13
2
0 2 20
0 1 -11


0 4 13
*/

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 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 8 ms 368 KB Output is correct

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 128 ms 8124 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Runtime error 68 ms 4964 KB Execution failed because the return code was nonzero
3 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Runtime error 73 ms 4972 KB Execution failed because the return code was nonzero
4 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# 결과 실행 시간 메모리 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 8 ms 368 KB Output is correct
6 Incorrect 128 ms 8124 KB Output isn't correct
7 Halted 0 ms 0 KB -