oj.uz

답안 #883420

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
883420 2023-12-05T09:13:30 Z nguyentunglam 사탕 분배 (IOI21_candies) C++17
0 / 100
 69 ms 29084 KB 
#include<bits/stdc++.h>
#define fi first
#define se second
#define endl "\n"
#define ii pair<int, int>
using namespace std;

const int N = 1e5 + 10;
vector<int> event[N];

vector<long long> distribute_candies (vector<int> c, vector<int> l, vector<int> r, vector<int> v) {
    vector<long long> p;

    int n = c.size();

    for(int i = 0; i < n; i++) event[i].push_back(0);

    for(int i = 0; i < v.size(); i++)
    {
        for(int j = l[i]; j <= r[i]; j++)
        {
            event[j].push_back(v[i]);
        }
    }

    for(int i = 0; i < n; i++)
    {
        long long sum = 0, border = 0;

        vector<long long> pref;

        for(int &j : event[i]) {
            sum += j;

            pref.push_back(sum);
        }

        long long mx = -1e18, mn = 1e18;

        for(int j = pref.size() - 1; j >= 0; j--)
        {
            mn = min(mn, pref[j]);

            mx = max(mx, pref[j]);

            if (mx - mn <= c[i])
            {
                if (event[i][j] > 0 && mx <= pref[j]) border = pref[j] - c[i];

                if (event[i][j] <= 0 && mn >= pref[j]) border = pref[j];
            }
        }

        p.push_back(sum - border);
    }

    return p;
}

#ifdef ngu
int main() {

    freopen ("task.inp", "r", stdin);
    freopen ("task.out", "w", stdout);

    int n, q; cin >> n >> q;

    vector<int> c(n), l(q), r(q), v(q);

    for(int i = 0; i < n; i++) cin >> c[i];

    for(int i = 0; i < q; i++) cin >> l[i] >> r[i] >> v[i];

    vector<long long> ans = distribute_candies(c, l, r, v);

    for(long long &j : ans) cout << j << " ";
}
#endif // ngu

Compilation message

candies.cpp: In function 'std::vector<long long int> distribute_candies(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
candies.cpp:18:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 |     for(int i = 0; i < v.size(); i++)
      |                    ~~^~~~~~~~~~

Subtask #1
0 / 3.0

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

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 69 ms 29084 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

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

Subtask #4
0 / 29.0

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

Subtask #5
0 / 33.0

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