oj.uz

Submission #478523

# Submission time Handle Problem Language Result Execution time Memory
478523 2021-10-07T21:46:47 Z 4ndrelus Potatoes and fertilizers (LMIO19_bulves) C++17
100 / 100
 185 ms 17912 KB 
#define DEBUG 0
#define TESTSETS 0
#if DEBUG
    #include <ultimate_power_2.h>
#else 
    #include <bits/stdc++.h>
    #define echo(...) {}
#endif
/* ------- utils ------- */
#define debug if(DEBUG)
#define P2(x) (1LL<<(x))
#define st first
#define nd second
#define mt make_tuple
#define gottagofast() ios::sync_with_stdio(0); cin.tie(0);
#define band(x, y) ((x) & (y))
#define bor(x, y) ((x) | (y))
#define all(x) (x).begin(), (x).end()
#define len(x) (int)(x).size()
#define ffor(i, a, b) for(int i = (a), i##e = (b); i <= i##e; i++)
#define dfor(i, a, b) for(int i = (a), i##e = (b); i >= i##e; i--)

#define forx(i, a, b) for(int i = (a), i##e = (b); i < i##e; i++) //!!! eXclusive
#define dforx(i, a, b) for(int i = (a), i##e = (b); i > i##e; i--)//!!! eXclusive

using namespace std;
using LL = long long;
using ULL = unsigned long long;
constexpr LL INF = LLONG_MAX / 2 - 1;
constexpr int iINF = INT_MAX / 2 - 1;
LL MOD = 1'000'000'007;
int clamp(int x, int a, int b) { assert(a <= b); return min(max(x, a), b); }
template<class T> T sum(const vector<T>& vector) { return accumulate(vector.begin(), vector.end(), static_cast<T>(0)); }
template<class T> T max(const vector<T>& vector) { return *max_element(vector.begin(), vector.end()); }
template<class T> T min(const vector<T>& vector) { return *min_element(vector.begin(), vector.end()); }
template<class T> int popcnt(T x) { int c = 0; while (x > 0) c += x & 1, x >>= 1; return c; }
template<class T, class U> pair<T, U> operator+(const pair<T, U>& a, const pair<T, U>& b) { return { a.st + b.st, a.nd + b.nd }; }
vector<LL> factorize(LL x)
{
    assert(x > 0);
    vector<LL> f;
    while (x % 2 == 0)
        f.push_back(2),
        x /= 2;
    for (LL d = 3; d * d <= x; d += 2)
        while (x % d == 0)
            f.push_back(d),
            x /= d;
    if (x > 1)
        f.push_back(x);
    return f;
}
vector<pair<LL, int>> compress(vector<LL> v)
{
    vector<pair<LL, int>> p;
    sort(all(v));
    for (int i = 0, j; i < len(v); i = j) {
        for (j = i + 1; j < len(v) && v[i] == v[j]; j++);
        p.emplace_back(v[i], j - i);
    }
    return p;
}
int randx(int a, int b) { return rand() % (b-a) + a; }//rand exclusive [a, b)
LL fpow(LL a, LL b)
{
    if (b == 0) return 1;
    if (b % 2 == 1) return fpow(a, b - 1) * a % MOD;
    LL p = fpow(a, b / 2);
    return p * p % MOD;
}
LL iceil(LL a, LL b)
{
    assert(a > 0);
    return (a - 1) / b + 1;
}
/* --------------------- */

int n; 
vector<LL> a, b;

void Input()
{
    cin >> n; a = vector<LL>(n); b = vector<LL>(n);
    forx(i, 0, n)
        cin >> a[i] >> b[i];
}

void Solve()
{
    vector<LL> x(n+1, 0);
    forx(i, 0, n)
        x[i+1] = a[i] - b[i] + x[i];
    echo(x);
    /*auto x = a;
    forx(i, 0, n)x[i] -= i;
    x.insert(x.begin(), 0);*/
    

    LL adjust = 0;
    forx(i, 1, n+1) {
        if (x[i] < 0)
            adjust += -x[i],
            x[i] = 0;
     /*   else if (x[i] > x[n])
            adjust += x[i] - x[n],
            x[i] = a[n-1];*/
    }
    priority_queue<LL> pq; LL b = 0;
    forx(i, 1, n + 1) {
        pq.push(x[i]);
        pq.push(x[i]);
        b += pq.top() - x[i];
        pq.pop();
    }

    LL a = 0;
    while (x[n] < pq.top()) {
        a -= 1;
        b += pq.top();
        pq.pop();
    }
    
    cout << a*x[n]+b+adjust << "\n";
}

void Brute()
{
    
}

int main()
{
    gottagofast();
    int z = 1; 
    #if TESTSETS
        cin >> z; 
    #endif 
    forx(case_num, 0, z) {
        Input();
        echo(c::green, "---------------");
        Solve();
        echo(c::green, "---------------");
        Brute();
    }
}

Subtask #1
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 16 ms 2128 KB Output is correct
5 Correct 32 ms 3744 KB Output is correct
6 Correct 103 ms 8256 KB Output is correct
7 Correct 142 ms 16192 KB Output is correct
8 Correct 173 ms 16196 KB Output is correct
9 Correct 118 ms 16204 KB Output is correct
10 Correct 106 ms 16204 KB Output is correct
11 Correct 131 ms 16332 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 16 ms 2128 KB Output is correct
5 Correct 32 ms 3744 KB Output is correct
6 Correct 103 ms 8256 KB Output is correct
7 Correct 142 ms 16192 KB Output is correct
8 Correct 173 ms 16196 KB Output is correct
9 Correct 118 ms 16204 KB Output is correct
10 Correct 106 ms 16204 KB Output is correct
11 Correct 131 ms 16332 KB Output is correct
12 Correct 48 ms 4336 KB Output is correct
13 Correct 115 ms 13180 KB Output is correct
14 Correct 130 ms 17840 KB Output is correct
15 Correct 185 ms 17852 KB Output is correct
16 Correct 183 ms 17828 KB Output is correct
17 Correct 96 ms 17852 KB Output is correct
18 Correct 2 ms 332 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 1 ms 460 KB Output is correct
10 Correct 1 ms 460 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 1 ms 460 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 2 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 2 ms 460 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 1 ms 460 KB Output is correct
17 Correct 1 ms 460 KB Output is correct
18 Correct 1 ms 460 KB Output is correct

Subtask #5
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 1 ms 460 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 16 ms 2128 KB Output is correct
12 Correct 32 ms 3744 KB Output is correct
13 Correct 103 ms 8256 KB Output is correct
14 Correct 142 ms 16192 KB Output is correct
15 Correct 173 ms 16196 KB Output is correct
16 Correct 118 ms 16204 KB Output is correct
17 Correct 106 ms 16204 KB Output is correct
18 Correct 131 ms 16332 KB Output is correct
19 Correct 48 ms 4336 KB Output is correct
20 Correct 115 ms 13180 KB Output is correct
21 Correct 130 ms 17840 KB Output is correct
22 Correct 185 ms 17852 KB Output is correct
23 Correct 183 ms 17828 KB Output is correct
24 Correct 96 ms 17852 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 460 KB Output is correct
27 Correct 2 ms 460 KB Output is correct
28 Correct 1 ms 460 KB Output is correct
29 Correct 1 ms 460 KB Output is correct
30 Correct 1 ms 460 KB Output is correct
31 Correct 1 ms 460 KB Output is correct
32 Correct 2 ms 332 KB Output is correct
33 Correct 38 ms 5964 KB Output is correct
34 Correct 93 ms 13176 KB Output is correct
35 Correct 159 ms 17832 KB Output is correct
36 Correct 134 ms 17860 KB Output is correct
37 Correct 152 ms 17856 KB Output is correct
38 Correct 141 ms 17908 KB Output is correct
39 Correct 114 ms 17852 KB Output is correct
40 Correct 109 ms 16724 KB Output is correct
41 Correct 90 ms 17852 KB Output is correct
42 Correct 91 ms 17852 KB Output is correct
43 Correct 88 ms 17912 KB Output is correct
44 Correct 97 ms 17844 KB Output is correct
45 Correct 179 ms 17852 KB Output is correct
46 Correct 128 ms 17860 KB Output is correct
47 Correct 113 ms 15312 KB Output is correct