oj.uz

Submission #1107829

# Submission time Handle Problem Language Result Execution time Memory
1107829 2024-11-02T07:11:56 Z coolboy19521 Closing Time (IOI23_closing) C++17
0 / 100
 40 ms 5088 KB 
#include "closing.h"
#include "bits/stdc++.h"

using ll = long long;
using namespace std;

int max_score(int N, int X, int Y, ll K,
              vector<int> U, vector<int> V, vector<int> W)
{
    return W[1];
    ll lo = 0, hi = K;

    vector<ll> x(N), y(N);
    for (int i = X - 1; 0 <= i; i --) {
        x[i] = x[i + 1] + W[i];
    }
    for (int i = X + 1; i < N; i ++) {
        x[i] = x[i - 1] + W[i - 1];
    }
    for (int i = Y + 1; i < N; i ++) {
        y[i] = y[i - 1] + W[i - 1];
    }
    for (int i = Y - 1; 0 <= i; i --) {
        y[i] = y[i + 1] + W[i];
    }

    auto check = [&](ll mm){
        ll r = 0;
        ll c = 0;
        for (int i = 0; i < N; i ++) {
            ll mx = max(x[i], y[i]);
            ll mn = min(x[i], y[i]);
            if (mx < mm) {
                r += mx;
                c ++;
            } else if (mn < mm) {
                r += mn;
                c ++;
            }
        }
        return r <= K;
    };

    while (lo < hi) {
        ll mi = (lo + hi + 1) / 2;

        if (check(mi)) {
            lo = mi;
        } else {
            hi = mi - 1;
        }
    }

    int c = 0;
    ll r = 0;
    vector<int> vp;
    for (int i = 0; i < N; i ++) {
        ll mx = max(x[i], y[i]);
        ll mn = min(x[i], y[i]);
        if (mx < lo) {
            r += mx;
            c += 2;
        } else if (mn < lo) {
            r += mn;
            c ++;
        }
        if (mx == lo) {
            vp.push_back(-2);
        } else if (mx != mn && mn == lo) {
            vp.push_back(-1);
        }
    }

    sort(begin(vp),end(vp));

    for (int i : vp) {
        if (r + lo <= K) {
            r += lo;
            c -= i;
        }
    }

    return c;
}

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 336 KB 1st lines differ - on the 1st token, expected: '6', found: '3'
2 Halted 0 ms 0 KB -

Subtask #1
0.0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 40 ms 5088 KB 1st lines differ - on the 1st token, expected: '451', found: '331139'
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 336 KB 1st lines differ - on the 1st token, expected: '3', found: '1'
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 336 KB 1st lines differ - on the 1st token, expected: '3', found: '1'
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 336 KB 1st lines differ - on the 1st token, expected: '3', found: '1'
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 336 KB 1st lines differ - on the 1st token, expected: '6', found: '3'
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 336 KB 1st lines differ - on the 1st token, expected: '6', found: '3'
2 Halted 0 ms 0 KB -

Subtask #7
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 336 KB 1st lines differ - on the 1st token, expected: '6', found: '3'
2 Halted 0 ms 0 KB -

Subtask #8
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 336 KB 1st lines differ - on the 1st token, expected: '6', found: '3'
2 Halted 0 ms 0 KB -

Subtask #9
0.0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 336 KB 1st lines differ - on the 1st token, expected: '6', found: '3'
2 Halted 0 ms 0 KB -