oj.uz

답안 #1010538

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1010538 2024-06-29T07:56:09 Z thinknoexit 봉쇄 시간 (IOI23_closing) C++17
35 / 100
 125 ms 13648 KB 
#include "closing.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int n;
int pl[3030], pr[3030];
ll qs[3030];
ll qsx[3030], qsy[3030], qsmx[3030];
ll vx[3030], vy[3030];
int max_score(int N, int X, int Y, ll K, vector<int> U, vector<int> V, vector<int> W) {
    n = N;
    int x = X + 1, y = Y + 1;
    for (int i = 1;i < n;i++) {
        qs[i] = qs[i - 1] + W[i - 1];
    }
    for (int i = 1;i <= n;i++) {
        vx[i] = qs[max(x, i) - 1] - qs[min(x, i) - 1];
        vy[i] = qs[max(y, i) - 1] - qs[min(y, i) - 1];
        qsx[i] = qsx[i - 1] + vx[i];
        qsy[i] = qsy[i - 1] + vy[i];
        qsmx[i] = qsmx[i - 1] + max(vx[i], vy[i]);
    }
    int mx = 0;
    { // not intercept
        vector<bool> vis(n + 1, false);
        priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>> pq;
        pq.push({ 0ll, x });
        pq.push({ 0ll, -y });
        ll cost = 0;
        while (!pq.empty()) {
            auto x = pq.top();
            pq.pop();
            int v = x.second, vv = abs(x.second);
            if (vis[vv]) continue;
            vis[vv] = 1;
            if (cost + x.first > K) break;
            cost += x.first;
            mx++;
            if (vv != 1 && !vis[vv - 1])
                pq.push({ (v < 0) ? vy[vv - 1] : vx[vv - 1], (v < 0) ? v + 1 : v - 1 });
            if (vv != n && !vis[vv + 1])
                pq.push({ (v < 0) ? vy[vv + 1] : vx[vv + 1], (v < 0) ? v - 1 : v + 1 });
        }
    }
    pl[0] = x - 1, pr[0] = y + 1;
    for (int i = 1;i <= n;i++) {
        pl[i] = pl[i - 1], pr[i] = pr[i - 1];
        if (pl[i] == 0 && pr[i] == n + 1) continue;
        if (pr[i] == n + 1) pl[i]--;
        else if (pl[i] == 0) pr[i]++;
        else {
            if (vx[pl[i]] < vy[pr[i]])
                pl[i]--;
            else
                pr[i]++;
        }
    }
    // intercept    
    for (int l = 1;l <= y;l++) {
        for (int r = max(l, x);r <= n;r++) {
            int cnt = (r - l + 1) * 2;
            ll cost = qsmx[r] - qsmx[l - 1];
            if (r < y) cost += qsy[y] - qsy[r], cnt += y - r;
            if (x < l) cost += qsx[l - 1] - qsx[x - 1], cnt += l - x;
            if (cost > K) continue;
            int L = min(x, l) - 1, R = max(y, r) + 1;
            int lo = 0, hi = n;
            while (lo < hi) {
                int mi = (lo + hi + 1) / 2;
                ll w = 0;
                if (pl[mi] <= L) w += qsx[L] - qsx[pl[mi]];
                if (R <= pr[mi]) w += qsy[pr[mi] - 1] - qsy[R - 1];
                if (cost + w > K) hi = mi - 1;
                else lo = mi;
            }
            cnt += max(0, L - pl[lo]) + max(0, pr[hi] - R);
            mx = max(mx, cnt);
        }
    }
    return mx;
}

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 Runtime error 48 ms 13648 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #2
9.0 / 9.0

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

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 448 KB Output is correct
8 Correct 0 ms 448 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 452 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 3 ms 344 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 448 KB Output is correct
8 Correct 0 ms 448 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 452 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 3 ms 344 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 2 ms 348 KB Output is correct
26 Correct 47 ms 724 KB Output is correct
27 Correct 5 ms 604 KB Output is correct
28 Correct 96 ms 604 KB Output is correct
29 Correct 125 ms 604 KB Output is correct
30 Correct 5 ms 600 KB Output is correct
31 Correct 18 ms 600 KB Output is correct
32 Correct 13 ms 600 KB Output is correct

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 -