oj.uz

Submission #1032037

# Submission time Handle Problem Language Result Execution time Memory
1032037 2024-07-23T10:26:10 Z Turkhuu Closing Time (IOI23_closing) C++17
9 / 100
 1000 ms 19020 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;
    for (int lx = 0; lx <= X; lx++) {
        for (int rx = X; rx < N; rx++) {
            for (int ly = 0; ly <= Y; ly++) {
                for (int ry = Y; ry < N; ry++) {
                    if (sx[rx + 1] - sx[lx] + sy[ry + 1] - sy[ly] <= K) {
                        ans = max(ans, rx - lx + 1 + ry - ly + 1);
                    }
                }
            }
        }
    }
    for (int l2 = 0; l2 < N; l2++) {
        for (int r2 = l2; r2 < N; r2++) {
            for (int l1 = 0; l1 <= min(X, l2); l1++) {
                for (int r1 = max(Y, r2); r1 < N; r1++) {
                    if (s2[r2 + 1] - s2[l2] + sx[l2] - sx[l1] + sy[r1 + 1] - sy[r2 + 1] <= K) {
                        ans = max(ans, r1 - l1 + 1 + r2 - l2 + 1);
                    }
                }
            }
        }
    }
    return ans;
}

Subtask #0
0.0 / 0.0

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

Subtask #1
0.0 / 8.0

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

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 412 KB Output is correct
5 Correct 1 ms 432 KB Output is correct
6 Correct 2 ms 432 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 440 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct

Subtask #3
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 412 KB Output is correct
5 Correct 1 ms 432 KB Output is correct
6 Correct 2 ms 432 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 440 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 4 ms 440 KB Output is correct
14 Correct 4 ms 348 KB Output is correct
15 Correct 3 ms 348 KB Output is correct
16 Correct 0 ms 436 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 436 KB Output is correct
19 Execution timed out 1066 ms 348 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #4
0.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 412 KB Output is correct
5 Correct 1 ms 432 KB Output is correct
6 Correct 2 ms 432 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 440 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 4 ms 440 KB Output is correct
14 Correct 4 ms 348 KB Output is correct
15 Correct 3 ms 348 KB Output is correct
16 Correct 0 ms 436 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 436 KB Output is correct
19 Execution timed out 1066 ms 348 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #5
0.0 / 9.0

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

Subtask #6
0.0 / 11.0

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

Subtask #7
0.0 / 10.0

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

Subtask #8
0.0 / 10.0

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

Subtask #9
0.0 / 17.0

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