oj.uz

Submission #1048117

# Submission time Handle Problem Language Result Execution time Memory
1048117 2024-08-07T23:30:45 Z shjeong Closing Time (IOI23_closing) C++17
35 / 100
 1000 ms 42244 KB 
#include <cstdio>
#include <cassert>
#include <vector>
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
vector<pair<ll,ll>> adj[202020];
vector<ll> l;
bool dfs(ll x, ll y, ll prv=-1){
    if(x==y){
        l.push_back(x);
        return 1;
    }
    for(auto [next,w] : adj[x])if(prv!=next){
        if(dfs(next,y,x)){
            l.push_back(x);
            return 1;
        }
    }
    return 0;
}
ll sum(ll l, ll r, vector<ll> &v){ return l<=r ? v[r] - v[l-1] : 0; }
int max_score(int n, int x, int y, long long K,
              std::vector<int> U, std::vector<int> V, std::vector<int> W)
{
    l.clear();
    for(int i = 0 ; i < n ; i++)adj[i].clear();
    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]});
    vector<vector<ll>> dist(2, vector<ll>(n,-1));
    queue<ll> q; q.push(x); dist[0][x] = 0;
    while(q.size()){
        ll cur = q.front(); q.pop();
        for(auto [next,w] : adj[cur])if(dist[0][next]<0)dist[0][next] = dist[0][cur]+w, q.push(next);
    }
    q.push(y); dist[1][y] = 0;
    while(q.size()){
        ll cur = q.front(); q.pop();
        for(auto [next,w] : adj[cur])if(dist[1][next]<0)dist[1][next] = dist[1][cur]+w, q.push(next);
    }
    vector<ll> res1(n*2+1, 1e18), res2(n*2+1, 1e18);
    res1[0]=res2[0] = 0;
    //경로 내부
    dfs(x,y); reverse(l.begin(),l.end());
    vector<ll> a, b;
    ll t = l.size();
    vector<bool> chk(n);
    for(auto i : l)chk[i] = 1;
    vector<ll> asum(t+1), bsum(t+1), mxsum(t+1);    //1-index
    for(int i = 0 ; i < t ; i++){
        a.push_back(dist[0][l[i]]);
        b.push_back(dist[1][l[i]]);
        asum[i+1] += asum[i], bsum[i+1] += bsum[i], mxsum[i+1] += mxsum[i];
        asum[i+1] += a[i], bsum[i+1] += b[i], mxsum[i+1] += max(a[i],b[i]);
    }
    for(int i = 1 ; i <= t ; i++){
        res1[i] = min(res1[i], sum(1,i,asum));
        res1[i] = min(res1[i], sum(t-i+1,t,bsum));
    }
    for(int i = 1 ; i <= t ; i++){  //교집합 x
        for(int j = i+1 ; j <= t ; j++){
            res1[i + (t-j+1)] = min(res1[i + t-j+1], sum(1,i,asum) + sum(j,t,bsum));
        }
    }
    for(int i = 1 ; i <= t ; i++){
        for(int j = i ; j <= t ; j++){
            res1[t + (j-i+1)] = min<ll>(res1[t + (j-i+1)], sum(1,i-1,asum) + sum(i,j,mxsum) + sum(j+1,t,bsum));
        }
    }
    //경로 외부
    for(int i = 0 ; i < n ; i++)if(!chk[i]){
        auto newres = res2;
        for(int j = 1 ; j <= n*2 ; j++){
            if(j>1)newres[j] = min(newres[j], res2[j-2] + max(dist[0][i], dist[1][i]));
            newres[j] = min(newres[j], res2[j-1] + min(dist[0][i], dist[1][i]));
        }
        res2 = newres;
    }
    ll ret = 0;
    for(int i = 0, j = n*2 ; i <= n*2 ; i++){
        while(j>=0 and res1[i] + res2[j] > K)j--;
        if(j<0)break;
        ret = max<ll>(ret, i+j);
    }
    return ret;
}

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4952 KB Output is correct

Subtask #1
0.0 / 8.0

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

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4952 KB Output is correct
2 Correct 1 ms 4956 KB Output is correct
3 Correct 1 ms 4956 KB Output is correct
4 Correct 1 ms 4956 KB Output is correct
5 Correct 1 ms 4956 KB Output is correct
6 Correct 1 ms 4956 KB Output is correct
7 Correct 1 ms 4956 KB Output is correct
8 Correct 1 ms 4956 KB Output is correct
9 Correct 1 ms 4956 KB Output is correct
10 Correct 1 ms 4956 KB Output is correct
11 Correct 1 ms 5000 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4952 KB Output is correct
2 Correct 1 ms 4956 KB Output is correct
3 Correct 1 ms 4956 KB Output is correct
4 Correct 1 ms 4956 KB Output is correct
5 Correct 1 ms 4956 KB Output is correct
6 Correct 1 ms 4956 KB Output is correct
7 Correct 1 ms 4956 KB Output is correct
8 Correct 1 ms 4956 KB Output is correct
9 Correct 1 ms 4956 KB Output is correct
10 Correct 1 ms 4956 KB Output is correct
11 Correct 1 ms 5000 KB Output is correct
12 Correct 1 ms 4952 KB Output is correct
13 Correct 1 ms 4952 KB Output is correct
14 Correct 1 ms 4956 KB Output is correct
15 Correct 1 ms 4956 KB Output is correct
16 Correct 1 ms 5212 KB Output is correct
17 Correct 2 ms 4956 KB Output is correct
18 Correct 1 ms 4956 KB Output is correct
19 Correct 2 ms 5212 KB Output is correct
20 Correct 2 ms 5212 KB Output is correct
21 Correct 2 ms 5212 KB Output is correct
22 Correct 2 ms 5212 KB Output is correct
23 Correct 1 ms 5212 KB Output is correct
24 Correct 1 ms 5212 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4952 KB Output is correct
2 Correct 1 ms 4956 KB Output is correct
3 Correct 1 ms 4956 KB Output is correct
4 Correct 1 ms 4956 KB Output is correct
5 Correct 1 ms 4956 KB Output is correct
6 Correct 1 ms 4956 KB Output is correct
7 Correct 1 ms 4956 KB Output is correct
8 Correct 1 ms 4956 KB Output is correct
9 Correct 1 ms 4956 KB Output is correct
10 Correct 1 ms 4956 KB Output is correct
11 Correct 1 ms 5000 KB Output is correct
12 Correct 1 ms 4952 KB Output is correct
13 Correct 1 ms 4952 KB Output is correct
14 Correct 1 ms 4956 KB Output is correct
15 Correct 1 ms 4956 KB Output is correct
16 Correct 1 ms 5212 KB Output is correct
17 Correct 2 ms 4956 KB Output is correct
18 Correct 1 ms 4956 KB Output is correct
19 Correct 2 ms 5212 KB Output is correct
20 Correct 2 ms 5212 KB Output is correct
21 Correct 2 ms 5212 KB Output is correct
22 Correct 2 ms 5212 KB Output is correct
23 Correct 1 ms 5212 KB Output is correct
24 Correct 1 ms 5212 KB Output is correct
25 Correct 2 ms 5240 KB Output is correct
26 Correct 29 ms 5772 KB Output is correct
27 Correct 26 ms 5724 KB Output is correct
28 Correct 9 ms 5724 KB Output is correct
29 Correct 14 ms 5792 KB Output is correct
30 Correct 21 ms 5468 KB Output is correct
31 Correct 10 ms 5724 KB Output is correct
32 Correct 10 ms 5724 KB Output is correct

Subtask #5
0.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4952 KB Output is correct
2 Correct 1 ms 4952 KB Output is correct
3 Correct 1 ms 4956 KB Output is correct
4 Correct 1 ms 4956 KB Output is correct
5 Correct 1 ms 4956 KB Output is correct
6 Correct 1 ms 4956 KB Output is correct
7 Correct 1 ms 4956 KB Output is correct
8 Correct 1 ms 4956 KB Output is correct
9 Correct 1 ms 4952 KB Output is correct
10 Correct 1 ms 4956 KB Output is correct
11 Correct 1 ms 4956 KB Output is correct
12 Correct 1 ms 4956 KB Output is correct
13 Correct 1 ms 4956 KB Output is correct
14 Correct 1 ms 4956 KB Output is correct
15 Incorrect 1 ms 4956 KB 1st lines differ - on the 1st token, expected: '11', found: '12'
16 Halted 0 ms 0 KB -

Subtask #6
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4952 KB Output is correct
2 Correct 1 ms 4952 KB Output is correct
3 Correct 1 ms 4956 KB Output is correct
4 Correct 1 ms 4956 KB Output is correct
5 Correct 1 ms 4956 KB Output is correct
6 Correct 1 ms 4956 KB Output is correct
7 Correct 1 ms 4956 KB Output is correct
8 Correct 1 ms 4956 KB Output is correct
9 Correct 1 ms 4956 KB Output is correct
10 Correct 1 ms 4956 KB Output is correct
11 Correct 1 ms 4956 KB Output is correct
12 Correct 1 ms 5000 KB Output is correct
13 Correct 1 ms 4952 KB Output is correct
14 Correct 1 ms 4952 KB Output is correct
15 Correct 1 ms 4956 KB Output is correct
16 Correct 1 ms 4956 KB Output is correct
17 Correct 1 ms 5212 KB Output is correct
18 Correct 2 ms 4956 KB Output is correct
19 Correct 1 ms 4956 KB Output is correct
20 Correct 1 ms 4956 KB Output is correct
21 Correct 1 ms 4952 KB Output is correct
22 Correct 1 ms 4956 KB Output is correct
23 Correct 1 ms 4956 KB Output is correct
24 Correct 1 ms 4956 KB Output is correct
25 Correct 1 ms 4956 KB Output is correct
26 Correct 1 ms 4956 KB Output is correct
27 Incorrect 1 ms 4956 KB 1st lines differ - on the 1st token, expected: '11', found: '12'
28 Halted 0 ms 0 KB -

Subtask #7
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4952 KB Output is correct
2 Correct 1 ms 4952 KB Output is correct
3 Correct 1 ms 4956 KB Output is correct
4 Correct 1 ms 4956 KB Output is correct
5 Correct 1 ms 4956 KB Output is correct
6 Correct 1 ms 4956 KB Output is correct
7 Correct 1 ms 4956 KB Output is correct
8 Correct 1 ms 4956 KB Output is correct
9 Correct 1 ms 4956 KB Output is correct
10 Correct 1 ms 4956 KB Output is correct
11 Correct 1 ms 4956 KB Output is correct
12 Correct 1 ms 5000 KB Output is correct
13 Correct 1 ms 4952 KB Output is correct
14 Correct 1 ms 4952 KB Output is correct
15 Correct 1 ms 4956 KB Output is correct
16 Correct 1 ms 4956 KB Output is correct
17 Correct 1 ms 5212 KB Output is correct
18 Correct 2 ms 4956 KB Output is correct
19 Correct 1 ms 4956 KB Output is correct
20 Correct 2 ms 5212 KB Output is correct
21 Correct 2 ms 5212 KB Output is correct
22 Correct 2 ms 5212 KB Output is correct
23 Correct 2 ms 5212 KB Output is correct
24 Correct 1 ms 5212 KB Output is correct
25 Correct 1 ms 5212 KB Output is correct
26 Correct 1 ms 4956 KB Output is correct
27 Correct 1 ms 4956 KB Output is correct
28 Correct 1 ms 4952 KB Output is correct
29 Correct 1 ms 4956 KB Output is correct
30 Correct 1 ms 4956 KB Output is correct
31 Correct 1 ms 4956 KB Output is correct
32 Correct 1 ms 4956 KB Output is correct
33 Correct 1 ms 4956 KB Output is correct
34 Incorrect 1 ms 4956 KB 1st lines differ - on the 1st token, expected: '11', found: '12'
35 Halted 0 ms 0 KB -

Subtask #8
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4952 KB Output is correct
2 Correct 1 ms 4952 KB Output is correct
3 Correct 1 ms 4956 KB Output is correct
4 Correct 1 ms 4956 KB Output is correct
5 Correct 1 ms 4956 KB Output is correct
6 Correct 1 ms 4956 KB Output is correct
7 Correct 1 ms 4956 KB Output is correct
8 Correct 1 ms 4956 KB Output is correct
9 Correct 1 ms 4956 KB Output is correct
10 Correct 1 ms 4956 KB Output is correct
11 Correct 1 ms 4956 KB Output is correct
12 Correct 1 ms 5000 KB Output is correct
13 Correct 1 ms 4952 KB Output is correct
14 Correct 1 ms 4952 KB Output is correct
15 Correct 1 ms 4956 KB Output is correct
16 Correct 1 ms 4956 KB Output is correct
17 Correct 1 ms 5212 KB Output is correct
18 Correct 2 ms 4956 KB Output is correct
19 Correct 1 ms 4956 KB Output is correct
20 Correct 2 ms 5212 KB Output is correct
21 Correct 2 ms 5212 KB Output is correct
22 Correct 2 ms 5212 KB Output is correct
23 Correct 2 ms 5212 KB Output is correct
24 Correct 1 ms 5212 KB Output is correct
25 Correct 1 ms 5212 KB Output is correct
26 Correct 2 ms 5240 KB Output is correct
27 Correct 29 ms 5772 KB Output is correct
28 Correct 26 ms 5724 KB Output is correct
29 Correct 9 ms 5724 KB Output is correct
30 Correct 14 ms 5792 KB Output is correct
31 Correct 21 ms 5468 KB Output is correct
32 Correct 10 ms 5724 KB Output is correct
33 Correct 10 ms 5724 KB Output is correct
34 Correct 1 ms 4956 KB Output is correct
35 Correct 1 ms 4956 KB Output is correct
36 Correct 1 ms 4952 KB Output is correct
37 Correct 1 ms 4956 KB Output is correct
38 Correct 1 ms 4956 KB Output is correct
39 Correct 1 ms 4956 KB Output is correct
40 Correct 1 ms 4956 KB Output is correct
41 Correct 1 ms 4956 KB Output is correct
42 Incorrect 1 ms 4956 KB 1st lines differ - on the 1st token, expected: '11', found: '12'
43 Halted 0 ms 0 KB -

Subtask #9
0.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4952 KB Output is correct
2 Correct 1 ms 4952 KB Output is correct
3 Correct 1 ms 4956 KB Output is correct
4 Correct 1 ms 4956 KB Output is correct
5 Correct 1 ms 4956 KB Output is correct
6 Correct 1 ms 4956 KB Output is correct
7 Correct 1 ms 4956 KB Output is correct
8 Correct 1 ms 4956 KB Output is correct
9 Correct 1 ms 4956 KB Output is correct
10 Correct 1 ms 4956 KB Output is correct
11 Correct 1 ms 4956 KB Output is correct
12 Correct 1 ms 5000 KB Output is correct
13 Correct 1 ms 4952 KB Output is correct
14 Correct 1 ms 4952 KB Output is correct
15 Correct 1 ms 4956 KB Output is correct
16 Correct 1 ms 4956 KB Output is correct
17 Correct 1 ms 5212 KB Output is correct
18 Correct 2 ms 4956 KB Output is correct
19 Correct 1 ms 4956 KB Output is correct
20 Correct 2 ms 5212 KB Output is correct
21 Correct 2 ms 5212 KB Output is correct
22 Correct 2 ms 5212 KB Output is correct
23 Correct 2 ms 5212 KB Output is correct
24 Correct 1 ms 5212 KB Output is correct
25 Correct 1 ms 5212 KB Output is correct
26 Correct 2 ms 5240 KB Output is correct
27 Correct 29 ms 5772 KB Output is correct
28 Correct 26 ms 5724 KB Output is correct
29 Correct 9 ms 5724 KB Output is correct
30 Correct 14 ms 5792 KB Output is correct
31 Correct 21 ms 5468 KB Output is correct
32 Correct 10 ms 5724 KB Output is correct
33 Correct 10 ms 5724 KB Output is correct
34 Correct 1 ms 4956 KB Output is correct
35 Correct 1 ms 4956 KB Output is correct
36 Correct 1 ms 4952 KB Output is correct
37 Correct 1 ms 4956 KB Output is correct
38 Correct 1 ms 4956 KB Output is correct
39 Correct 1 ms 4956 KB Output is correct
40 Correct 1 ms 4956 KB Output is correct
41 Correct 1 ms 4956 KB Output is correct
42 Incorrect 1 ms 4956 KB 1st lines differ - on the 1st token, expected: '11', found: '12'
43 Halted 0 ms 0 KB -