oj.uz

답안 #913304

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
913304 2024-01-20T07:18:53 Z abcvuitunggio 봉쇄 시간 (IOI23_closing) C++17
0 / 100
 176 ms 32956 KB 
#include "closing.h"
#include <bits/stdc++.h>
using namespace std;
vector <pair <int, int>> ke[200001];
long long d[200001][2],cur;
int p[200001],ch[200001];
priority_queue <pair <int, int>, vector <pair <int, int>>, greater <pair <int, int>>> q;
void dfs(int u, int par, int i){
    for (auto [v,w]:ke[u])
        if (v!=par){
            d[v][i]=d[u][i]+w;
            p[v]=u;
            dfs(v,u,i);
        }
}
int max_score(int N, int X, int Y, long long K, vector<int> U, vector<int> V, vector<int> W){
    for (int i=0;i<N-1;i++){
        ke[U[i]].push_back({V[i],W[i]});
        ke[V[i]].push_back({U[i],W[i]});
    }
    memset(ch,0,sizeof(ch));
    d[X][0]=d[Y][1]=0;
    dfs(X,X,0);
    dfs(Y,Y,1);
    for (;X!=Y;X=p[X])
        ch[X]=1;
    ch[Y]=1;
    int res=0,cnt=0;
    long long dist=0;
    for (int i=0;i<N;i++){
        q.push({min(d[i][0],d[i][1]),i});
        if (ch[i])
            dist+=min(d[i][0],d[i][1]);
    }
    cur=0;
    while (!q.empty()&&cur+q.top().first<=K){
        cur+=q.top().first;
        res++;
        q.pop();
    }
    while (!q.empty())
        q.pop();
    if (dist<=K){
        for (int i=0;i<N;i++){
            if (ch[i])
                q.push({abs(d[i][0]-d[i][1]),i});
            else
                q.push({min(d[i][0],d[i][1]),i});
            cnt+=ch[i];
        }
        cur=dist;
        while (!q.empty()&&cur+q.top().first<=K){
            cur+=q.top().first;
            int u=q.top().second;
            cnt++;
            q.pop();
            if (!ch[u])
                q.push({abs(d[u][0]-d[u][1]),u});
        }
        while (!q.empty())
            q.pop();
    }
    for (int i=0;i<N;i++)
        ke[i].clear();
    return max(res,cnt);
}

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 7772 KB Output is correct

Subtask #1
0.0 / 8.0

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

Subtask #2
0.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 7772 KB Output is correct
2 Incorrect 2 ms 7768 KB 1st lines differ - on the 1st token, expected: '30', found: '65'
3 Halted 0 ms 0 KB -

Subtask #3
0.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 7772 KB Output is correct
2 Incorrect 2 ms 7768 KB 1st lines differ - on the 1st token, expected: '30', found: '65'
3 Halted 0 ms 0 KB -

Subtask #4
0.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 7772 KB Output is correct
2 Incorrect 2 ms 7768 KB 1st lines differ - on the 1st token, expected: '30', found: '65'
3 Halted 0 ms 0 KB -

Subtask #5
0.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 7772 KB Output is correct
2 Correct 2 ms 7772 KB Output is correct
3 Incorrect 2 ms 7768 KB 1st lines differ - on the 1st token, expected: '30', found: '65'
4 Halted 0 ms 0 KB -

Subtask #6
0.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 7772 KB Output is correct
2 Correct 2 ms 7772 KB Output is correct
3 Incorrect 2 ms 7768 KB 1st lines differ - on the 1st token, expected: '30', found: '65'
4 Halted 0 ms 0 KB -

Subtask #7
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 7772 KB Output is correct
2 Correct 2 ms 7772 KB Output is correct
3 Incorrect 2 ms 7768 KB 1st lines differ - on the 1st token, expected: '30', found: '65'
4 Halted 0 ms 0 KB -

Subtask #8
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 7772 KB Output is correct
2 Correct 2 ms 7772 KB Output is correct
3 Incorrect 2 ms 7768 KB 1st lines differ - on the 1st token, expected: '30', found: '65'
4 Halted 0 ms 0 KB -

Subtask #9
0.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 7772 KB Output is correct
2 Correct 2 ms 7772 KB Output is correct
3 Incorrect 2 ms 7768 KB 1st lines differ - on the 1st token, expected: '30', found: '65'
4 Halted 0 ms 0 KB -