oj.uz

Submission #1032052

# Submission time Handle Problem Language Result Execution time Memory
1032052 2024-07-23T10:38:31 Z Turkhuu Closing Time (IOI23_closing) C++17
0 / 100
 1000 ms 1730740 KB 
#include "closing.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int max_score(int N, int X, int Y, ll K, vector<int> U, vector<int> V, vector<int> W) {
    vector<ll> pfs(N);
    for (int i = 0; i < N - 1; i++) {
        pfs[i + 1] = pfs[i] + W[i];
    }
    auto dis = [&](int x, int y) {
        if (x > y) swap(x, y);
        return pfs[y] - pfs[x];
    };
    vector<ll> one(N), two(N), sx(N + 1), sy(N + 1), s2(N + 1), s1(N + 1);
    for (int i = 0; i < N; i++) {
        tie(one[i], two[i]) = minmax(dis(X, i), dis(Y, i));
        sx[i + 1] = sx[i] + dis(X, i);
        sy[i + 1] = sy[i] + dis(Y, i);
        s1[i + 1] = s1[i] + one[i];
        s2[i + 1] = s2[i] + two[i];
    }
    int ans = 0;
    vector<tuple<ll, int, int>> a;
    for (int lx = 0; lx <= X; lx++) {
        for (int rx = X; rx < N; rx++) {
            a.emplace_back(sx[rx + 1] - sx[lx], lx, rx);
        }
    }
    sort(a.begin(), a.end());
    int M = a.size();
    vector<int> b(M);
    for (int i = 0; i < M; i++) {
        auto [_, l, r] = a[i];
        b[i] = max(i == 0 ? 0 : b[i - 1], r - l + 1);
    }
    for (int ly = 0; ly <= Y; ly++) {
        for (int ry = Y; ry < N; ry++) {
            ll s = sy[ry + 1] - sy[ly];
            if (s > K) continue;
            ans = max(ans, ry - ly + 1 + b[upper_bound(a.begin(), a.end(), tuple<ll, int, int>{K - s, N, N}) - a.begin() - 1]);
        }
    }
    for (int l2 = 0; l2 < N; l2++) {
        for (int r2 = l2; r2 < N; r2++) {
            for (int l1 = 0; l1 <= min(X, l2); l1++) {
                ll s = s2[r2 + 1] - s2[l2] + s1[l2] - s1[l1] - s1[r2 + 1];
                int r1 = upper_bound(s1.begin(), s1.end(), K - s) - s1.begin() - 1;
                if (r1 >= max(Y, r2)) ans = max(ans, r1 - l1 + 1 + r2 - l2 + 1);
            }
        }
    }
    return ans;
}

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct

Subtask #1
0.0 / 8.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1096 ms 1730740 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 9.0

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

Subtask #3
0.0 / 12.0

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

Subtask #4
0.0 / 14.0

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

Subtask #5
0.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 344 KB 1st lines differ - on the 1st token, expected: '3', found: '4'
3 Halted 0 ms 0 KB -

Subtask #6
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 344 KB 1st lines differ - on the 1st token, expected: '3', found: '4'
3 Halted 0 ms 0 KB -

Subtask #7
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 344 KB 1st lines differ - on the 1st token, expected: '3', found: '4'
3 Halted 0 ms 0 KB -

Subtask #8
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 344 KB 1st lines differ - on the 1st token, expected: '3', found: '4'
3 Halted 0 ms 0 KB -

Subtask #9
0.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 344 KB 1st lines differ - on the 1st token, expected: '3', found: '4'
3 Halted 0 ms 0 KB -