oj.uz

답안 #927423

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
927423 2024-02-14T20:30:36 Z aykhn 봉쇄 시간 (IOI23_closing) C++17
29 / 100
 1000 ms 37748 KB 
#include <bits/stdc++.h>
#include "closing.h"

using namespace std;

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[2][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 < 2; j++)
    {
        for (int i = 0; i < N; i++)
        {
            p[j][i] = (i ? p[j][i - 1] : 0) + d[j][i];
        }
    }
    for (int i = 0; i < n; i++)
    {
        for (int j = i; j < n; j++)
        {
            if (max(i, X) > min(j, Y)) continue;
            long long k1 = k;
            for (int k = i; k <= j; k++) k1 -= max(d[0][k], d[1][k]);
            for (int k = X; k < i; k++) k1 -= d[0][k];
            for (int k = j + 1; k <= Y; k++) k1 -= d[1][k];
            if (k1 < 0) continue;
            int res = max(j, Y) - min(i, X) + 1 + (j - i + 1); 
            vector<long long> v;
            for (int k = 0; k < min(i, X); k++) v.push_back(d[0][k]);
            for (int k = max(j, Y) + 1; k < n; k++) v.push_back(d[1][k]);
            sort(v.begin(), v.end());
            for (int i = 0; i < v.size(); i++)
            {
                k1 -= v[i];
                if (k1 < 0) break;
                res++;
            }
            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:76:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   76 |             for (int i = 0; i < v.size(); i++)
      |                             ~~^~~~~~~~~~

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 11100 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 104 ms 31692 KB Output is correct
2 Correct 115 ms 37748 KB Output is correct
3 Correct 53 ms 11592 KB Output is correct

Subtask #2
9.0 / 9.0

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

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 11096 KB Output is correct
2 Correct 2 ms 11100 KB Output is correct
3 Correct 2 ms 11096 KB Output is correct
4 Correct 2 ms 11100 KB Output is correct
5 Correct 2 ms 11100 KB Output is correct
6 Correct 2 ms 11096 KB Output is correct
7 Correct 2 ms 11100 KB Output is correct
8 Correct 3 ms 11100 KB Output is correct
9 Correct 2 ms 11100 KB Output is correct
10 Correct 2 ms 11096 KB Output is correct
11 Correct 2 ms 11100 KB Output is correct
12 Correct 3 ms 11100 KB Output is correct
13 Correct 2 ms 11100 KB Output is correct
14 Correct 4 ms 11100 KB Output is correct
15 Correct 2 ms 11236 KB Output is correct
16 Correct 2 ms 11100 KB Output is correct
17 Correct 2 ms 11100 KB Output is correct
18 Correct 3 ms 11100 KB Output is correct
19 Correct 148 ms 11272 KB Output is correct
20 Correct 4 ms 11096 KB Output is correct
21 Correct 212 ms 11280 KB Output is correct
22 Correct 23 ms 11100 KB Output is correct
23 Correct 41 ms 11096 KB Output is correct
24 Correct 42 ms 11096 KB Output is correct

Subtask #4
0.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 11096 KB Output is correct
2 Correct 2 ms 11100 KB Output is correct
3 Correct 2 ms 11096 KB Output is correct
4 Correct 2 ms 11100 KB Output is correct
5 Correct 2 ms 11100 KB Output is correct
6 Correct 2 ms 11096 KB Output is correct
7 Correct 2 ms 11100 KB Output is correct
8 Correct 3 ms 11100 KB Output is correct
9 Correct 2 ms 11100 KB Output is correct
10 Correct 2 ms 11096 KB Output is correct
11 Correct 2 ms 11100 KB Output is correct
12 Correct 3 ms 11100 KB Output is correct
13 Correct 2 ms 11100 KB Output is correct
14 Correct 4 ms 11100 KB Output is correct
15 Correct 2 ms 11236 KB Output is correct
16 Correct 2 ms 11100 KB Output is correct
17 Correct 2 ms 11100 KB Output is correct
18 Correct 3 ms 11100 KB Output is correct
19 Correct 148 ms 11272 KB Output is correct
20 Correct 4 ms 11096 KB Output is correct
21 Correct 212 ms 11280 KB Output is correct
22 Correct 23 ms 11100 KB Output is correct
23 Correct 41 ms 11096 KB Output is correct
24 Correct 42 ms 11096 KB Output is correct
25 Correct 18 ms 11356 KB Output is correct
26 Execution timed out 1085 ms 11612 KB Time limit exceeded
27 Halted 0 ms 0 KB -

Subtask #5
0.0 / 9.0

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