oj.uz

답안 #1050654

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1050654 2024-08-09T12:10:37 Z Zicrus 사탕 분배 (IOI21_candies) C++17
0 / 100
 77 ms 16720 KB 
#include <bits/stdc++.h>
#include "candies.h"
using namespace std;

typedef long long ll;

ll n, q;
vector<pair<ll, ll>> cap;
vector<pair<ll, ll>> tim;
vector<ll> sum;

vector<int> distribute_candies(vector<int> c, vector<int> l,
                               vector<int> r, vector<int> v) {
    n = c.size(); q = v.size();
    cap = vector<pair<ll, ll>>(n);
    tim = {{n-1, 0}};
    sum = vector<ll>(q+1);
    for (int i = 0; i < q; i++) {
        sum[i+1] = sum[i] + v[i];
    }
    for (int i = 0; i < n; i++) {
        cap[i] = {c[i], i};
    }
    sort(cap.begin(), cap.end());

    for (int i = 0; i < q; i++) {
        ll mx = cap[tim.back().first].first;
        ll nw = sum[i+1] - sum[abs(tim.back().second)];
        if (tim.back().second < 0) nw += mx;
        while (tim.size() > 1 && (nw < 0 || nw > mx)) {
            tim.pop_back();
            nw = sum[i+1] - sum[abs(tim.back().second)];
            if (tim.back().second < 0) nw += mx;
        }
        
        ll left = -1, right = tim.back().first;
        while (left < right) {
            ll mid = (left+right+1) / 2;
            ll v = sum[i+1] - sum[abs(tim.back().second)];
            if (tim.back().second < 0) v += cap[mid].first;
            if (v < 0 || v > cap[mid].first) {
                left = mid;
            }
            else {
                right = mid-1;
            }
        }
        if (left == tim.back().first) tim.back().second = v[i] < 0 ? (i+1) : -(i+1);
        else if (left >= 0) tim.push_back({left, v[i] < 0 ? (i+1) : -(i+1)});
    }

    vector<int> res(n);
    for (int i = 0; i < n; i++) {
        while (i > tim.back().first) tim.pop_back();
        res[cap[i].second] = sum[q] - sum[abs(tim.back().second)];
        if (tim.back().second < 0) res[cap[i].second] += cap[i].first;
    }
    return res;
}

Subtask #1
0 / 3.0

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

Subtask #2
0 / 8.0

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

Subtask #3
0 / 27.0

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

Subtask #4
0 / 29.0

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

Subtask #5
0 / 33.0

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