oj.uz

답안 #1059996

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1059996 2024-08-15T09:57:21 Z aykhn 봉쇄 시간 (IOI23_closing) C++17
43 / 100
 432 ms 40904 KB 
#include <bits/stdc++.h>
#include "closing.h"
 
using namespace std;
 
struct BIT
{
    int n;
    vector<long long> ft;
    void init(int N)
    {
        n = N + 5;
        ft.assign(n + 5, 0);
    }
    void add(int pos, long long val)
    {
        for (pos = pos + 1; pos <= n; pos += pos & -pos) ft[pos] += val;
    }
    long long get(int pos, long long res = 0)
    {
        for (pos = pos + 1; pos > 0; pos -= pos & -pos) res += ft[pos];
        return res;
    }
};
 
const int MXN = 2e5 + 5;
 
int n, x, y;
long long k;
vector<array<long long, 2>> adj[MXN];
long long d[2][MXN], p[3][MXN];
 
void dfs(int a, int p, int t)
{
    for (const array<long long, 2> &v : adj[a])
    {
        if (v[0] == p) continue;
        d[t][v[0]] = d[t][a] + v[1];
        dfs(v[0], a, t);
    }
}
 
int max_score(int N, int X, int Y, long long K, vector<int> U, vector<int> V, vector<int> W)
{
    n = N, x = X, y = Y, k = K;
    for (int i = 0; i < n; i++)
    {
        d[0][i] = d[1][i] = 0;
        adj[i].clear();
    }
    int f = 1;
    for (int i = 0; i < n - 1; i++)
    {
        adj[U[i]].push_back({V[i], W[i]});
        adj[V[i]].push_back({U[i], W[i]});
        f &= U[i] == i && V[i] == i + 1;
    }
    dfs(x, x, 0);
    dfs(y, y, 1);
    int ans = 0;
    {
        vector<long long> v;
        for (int i = 0; i < n; i++) v.push_back(min(d[0][i], d[1][i]));
        sort(v.begin(), v.end());
        long long k1 = k;
        for (int i = 0; i < n; i++)
        {
            k1 -= v[i];
            if (k1 < 0) break;
            ans++;
        }
    }
    if (!f) return ans;
    for (int j = 0; j < 3; j++)
    {
        for (int i = 0; i < N; i++)
        {
            if (j < 2) p[j][i] = (i ? p[j][i - 1] : 0) + d[j][i];
            else p[j][i] = (i ? p[j][i - 1] : 0) + max(d[0][i], d[1][i]);
        }
    }
    for (int i = 0; i < n && d[0][i] <= d[1][i]; i++)
    {
        BIT ft, cnt;
        ft.init(n), cnt.init(n);
        vector<array<long long, 2>> v;
        vector<int> idx(n, -1);
        for (int j = 0; j < min(i, X); j++) v.push_back({d[0][j], j});
        for (int j = max(i, Y) + 1; j < n; j++) v.push_back({d[1][j], j});
        sort(v.begin(), v.end());
        for (int j = 0; j < v.size(); j++)
        {
            idx[v[j][1]] = j;
            ft.add(j, v[j][0]);
            cnt.add(j, 1);
        }
        for (int j = i; j < n; j++)
        {
            if (idx[j] != -1) ft.add(idx[j], -v[idx[j]][0]), cnt.add(idx[j], -1);
            if (max(i, X) > min(j, Y)) continue;
            long long k1 = k - (p[2][j] - (i ? p[2][i - 1] : 0));
            if (X < i) k1 -= p[0][i - 1] - (X ? p[0][X - 1] : 0);
            if (j < Y) k1 -= p[1][Y] - p[1][j];
            if (k1 < 0) continue;
            int res = max(j, Y) - min(i, X) + 1 + (j - i + 1); 
            int l = 0, r = n - 1;
            while (l < r)
            {
                int mid = (l + r + 1) >> 1;
                if (ft.get(mid) <= k1) l = mid;
                else r = mid - 1;
            }
            if (ft.get(l) <= k1) res += cnt.get(l);
            ans = max(ans, res);
        }
    }
    return ans;
}

Compilation message

closing.cpp: In function 'int max_score(int, int, int, long long int, std::vector<int>, std::vector<int>, std::vector<int>)':
closing.cpp:91:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::array<long long int, 2> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   91 |         for (int j = 0; j < v.size(); j++)
      |                         ~~^~~~~~~~~~

Subtask #0
0.0 / 0.0

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

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 80 ms 31180 KB Output is correct
2 Correct 103 ms 40904 KB Output is correct
3 Correct 46 ms 13652 KB Output is correct

Subtask #2
9.0 / 9.0

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

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 12636 KB Output is correct
2 Correct 2 ms 12636 KB Output is correct
3 Correct 3 ms 12636 KB Output is correct
4 Correct 2 ms 12636 KB Output is correct
5 Correct 2 ms 12636 KB Output is correct
6 Correct 3 ms 12632 KB Output is correct
7 Correct 2 ms 12636 KB Output is correct
8 Correct 2 ms 12636 KB Output is correct
9 Correct 2 ms 12636 KB Output is correct
10 Correct 2 ms 12636 KB Output is correct
11 Correct 2 ms 12636 KB Output is correct
12 Correct 2 ms 12808 KB Output is correct
13 Correct 2 ms 12636 KB Output is correct
14 Correct 2 ms 12636 KB Output is correct
15 Correct 2 ms 12636 KB Output is correct
16 Correct 2 ms 12636 KB Output is correct
17 Correct 2 ms 12636 KB Output is correct
18 Correct 2 ms 12912 KB Output is correct
19 Correct 12 ms 12784 KB Output is correct
20 Correct 2 ms 12632 KB Output is correct
21 Correct 7 ms 12636 KB Output is correct
22 Correct 2 ms 12892 KB Output is correct
23 Correct 3 ms 12636 KB Output is correct
24 Correct 2 ms 12636 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 12636 KB Output is correct
2 Correct 2 ms 12636 KB Output is correct
3 Correct 3 ms 12636 KB Output is correct
4 Correct 2 ms 12636 KB Output is correct
5 Correct 2 ms 12636 KB Output is correct
6 Correct 3 ms 12632 KB Output is correct
7 Correct 2 ms 12636 KB Output is correct
8 Correct 2 ms 12636 KB Output is correct
9 Correct 2 ms 12636 KB Output is correct
10 Correct 2 ms 12636 KB Output is correct
11 Correct 2 ms 12636 KB Output is correct
12 Correct 2 ms 12808 KB Output is correct
13 Correct 2 ms 12636 KB Output is correct
14 Correct 2 ms 12636 KB Output is correct
15 Correct 2 ms 12636 KB Output is correct
16 Correct 2 ms 12636 KB Output is correct
17 Correct 2 ms 12636 KB Output is correct
18 Correct 2 ms 12912 KB Output is correct
19 Correct 12 ms 12784 KB Output is correct
20 Correct 2 ms 12632 KB Output is correct
21 Correct 7 ms 12636 KB Output is correct
22 Correct 2 ms 12892 KB Output is correct
23 Correct 3 ms 12636 KB Output is correct
24 Correct 2 ms 12636 KB Output is correct
25 Correct 5 ms 12636 KB Output is correct
26 Correct 432 ms 13372 KB Output is correct
27 Correct 228 ms 13340 KB Output is correct
28 Correct 217 ms 13148 KB Output is correct
29 Correct 272 ms 13148 KB Output is correct
30 Correct 174 ms 13340 KB Output is correct
31 Correct 14 ms 13148 KB Output is correct
32 Correct 27 ms 13148 KB Output is correct

Subtask #5
0.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 12636 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 1 ms 12636 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 1 ms 12636 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 1 ms 12636 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 1 ms 12636 KB 1st lines differ - on the 1st token, expected: '6', found: '5'
2 Halted 0 ms 0 KB -