oj.uz

답안 #1032147

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1032147 2024-07-23T12:27:25 Z Turkhuu 봉쇄 시간 (IOI23_closing) C++17
9 / 100
 1000 ms 17492 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), s1(N + 1), s2(N + 1);
    for (int i = 0; i < N; i++) {
        tie(one[i], two[i]) = minmax(dis(X, i), dis(Y, i));
        s1[i + 1] = s1[i] + one[i];
        s2[i + 1] = s2[i] + two[i];
    }
    int ans = 0;
    {
        auto a(one); sort(a.begin(), a.end());
        ll sum = 0; int cnt = 0;
        while (cnt < N && sum + a[cnt] <= K) sum += a[cnt++];
        ans = max(ans, cnt);
    }
    for (int i = 0; i <= Y; i++) {
        ll s = s1[N];
        int l = 0, r = N - 1;
        for (int j = i; j < N; j++) {
            s += two[j] - one[j];
            if (r < j) r++;
            while (s > K && (l < min(i, X) || r > max(j, Y))) {
                if (l < min(i, X) && (r == max(j, Y) || one[l] > one[r])) s -= one[l++];
                else s -= one[r--];
            }
            if (s > K) break;
            assert(l <= min(X, i) && r >= max(Y, j));
            // if (j >= X) ans = max(ans, j - i + 1 + r - l + 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] + s1[l2] - s1[l1] + s1[r1 + 1] - s1[r2 + 1] <= K) {
                        ans = max(ans, r1 - l1 + 1 + r2 - l2 + 1);
                    }
                }
            }
        }
    }
    return ans;
}

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB 1st lines differ - on the 1st token, expected: '6', found: '5'
2 Halted 0 ms 0 KB -

Subtask #1
0.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1088 ms 17492 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 352 KB Output is correct
2 Correct 0 ms 356 KB Output is correct
3 Correct 1 ms 352 KB Output is correct
4 Correct 0 ms 356 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 444 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 440 KB Output is correct
9 Correct 1 ms 440 KB Output is correct
10 Correct 1 ms 352 KB Output is correct
11 Correct 1 ms 352 KB Output is correct

Subtask #3
0.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 352 KB Output is correct
2 Correct 0 ms 356 KB Output is correct
3 Correct 1 ms 352 KB Output is correct
4 Correct 0 ms 356 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 444 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 440 KB Output is correct
9 Correct 1 ms 440 KB Output is correct
10 Correct 1 ms 352 KB Output is correct
11 Correct 1 ms 352 KB Output is correct
12 Correct 2 ms 356 KB Output is correct
13 Correct 2 ms 356 KB Output is correct
14 Correct 1 ms 356 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 356 KB Output is correct
17 Correct 1 ms 356 KB Output is correct
18 Correct 1 ms 448 KB Output is correct
19 Execution timed out 1088 ms 348 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #4
0.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 352 KB Output is correct
2 Correct 0 ms 356 KB Output is correct
3 Correct 1 ms 352 KB Output is correct
4 Correct 0 ms 356 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 444 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 440 KB Output is correct
9 Correct 1 ms 440 KB Output is correct
10 Correct 1 ms 352 KB Output is correct
11 Correct 1 ms 352 KB Output is correct
12 Correct 2 ms 356 KB Output is correct
13 Correct 2 ms 356 KB Output is correct
14 Correct 1 ms 356 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 356 KB Output is correct
17 Correct 1 ms 356 KB Output is correct
18 Correct 1 ms 448 KB Output is correct
19 Execution timed out 1088 ms 348 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #5
0.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB 1st lines differ - on the 1st token, expected: '6', found: '5'
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB 1st lines differ - on the 1st token, expected: '6', found: '5'
2 Halted 0 ms 0 KB -

Subtask #7
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB 1st lines differ - on the 1st token, expected: '6', found: '5'
2 Halted 0 ms 0 KB -

Subtask #8
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB 1st lines differ - on the 1st token, expected: '6', found: '5'
2 Halted 0 ms 0 KB -

Subtask #9
0.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB 1st lines differ - on the 1st token, expected: '6', found: '5'
2 Halted 0 ms 0 KB -