oj.uz

답안 #1063384

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1063384 2024-08-17T17:43:22 Z qwusha 사탕 분배 (IOI21_candies) C++17
11 / 100
 69 ms 13680 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fi first
#define se second
typedef long double ld;
const ld eps = 1e-8;
mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
const ll inf = 1e18;
const ll mod = 1e9 + 7;

#include "candies.h"


vector<int> distribute_candies(vector<int> c, vector<int> l, vector<int> r, vector<int> v) {
    ll n = c.size();
    int q = l.size();
    vector<int> res(n);
    bool ch = 1;
    for (int i = 0; i < q; i++) {
        if (l[i] != 0 || r[i] != n - 1)
            ch = 0;
    }
    if (ch) {
        vector<int> s = {0};
        int maxi = 0;
        for (int i = 0; i < q; i++) {
            int x = s.back() + v[i];
            x = max(x, 0);
            maxi = max(maxi, x);
            s.push_back(x);
        }
        vector<int> res(n);
        for (int i = 0; i < n; i++) {
            if (maxi > c[i]) {
                res[i] = max(0, s.back() - (maxi - c[i]));
            }
        }
        return res;
    }
    if (n <= 2000 && q <= 2000) {
        for (int qw = 0; qw < l.size(); qw++) {
            for (int i = l[qw]; i <= r[qw]; i++) {
                if (v[qw] > 0) {
                    res[i] = min(res[i] + v[qw], c[i]);
                } else {
                    res[i] = max(res[i] + v[qw], 0);
                }
            }
        }
        return res;
    }
    vector<ll> pref(n + 1);
    for (int qw = 0; qw < q; qw++) {
        pref[l[qw]] += v[qw];
        pref[r[qw] + 1] -= v[qw];
    }
    for (int i = 1; i < n; i++) {
        pref[i] += pref[i - 1];
    }
    for (int i = 0; i < n; i++) {
        res[i] = min((ll)c[i], pref[i]);
    }
    return res;
}

Compilation message

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

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 436 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 2 ms 348 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 69 ms 13680 KB Output is correct
2 Correct 66 ms 12904 KB Output is correct
3 Correct 63 ms 12780 KB Output is correct

Subtask #3
0 / 27.0

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

Subtask #4
0 / 29.0

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

Subtask #5
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 436 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 69 ms 13680 KB Output is correct
7 Correct 66 ms 12904 KB Output is correct
8 Correct 63 ms 12780 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Incorrect 35 ms 8044 KB Output isn't correct
11 Halted 0 ms 0 KB -