oj.uz

답안 #441781

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
441781 2021-07-06T07:13:46 Z baluteshih 사탕 분배 (IOI21_candies) C++17
8 / 100
 127 ms 11204 KB 
#include "candies.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define X first
#define Y second
#define pb push_back
#define ALL(v) v.begin(), v.end()
#define SZ(a) ((int)a.size())

vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v) {
    int n = c.size();
    vector<ll> val(n + 1, 0);
    vector<int> rt(n, 0);
    for (int i = 0; i < SZ(l); ++i)
        val[l[i]] += v[i], val[r[i] + 1] -= v[i];
    for (int i = 1; i < n; ++i)
        val[i] += val[i - 1];
    for (int i = 0; i < n; ++i)
        rt[i] = min(val[i], (ll)c[i]);
    return rt;
}

Subtask #1
0 / 3.0

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

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 127 ms 8792 KB Output is correct
2 Correct 119 ms 11100 KB Output is correct
3 Correct 118 ms 11204 KB Output is correct

Subtask #3
0 / 27.0

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

Subtask #4
0 / 29.0

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

Subtask #5
0 / 33.0

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