oj.uz

답안 #840908

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
840908 2023-08-31T20:50:35 Z HD1 봉쇄 시간 (IOI23_closing) C++17
8 / 100
 131 ms 50864 KB 
#include "closing.h"
#include<bits/stdc++.h>
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define sz(x) ll(x.size())
#define ff first
#define ss second
#define pb push_back
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, ll> ii;
const int MAX=1e6;
const ll mod=1e9+7;
ll distx[MAX], disty[MAX];
vector<ii>gfo[MAX];
vector<ll> ans;
void dfsx(int u, int f){
    for(auto x:gfo[u]){
        int v=x.ff;
        ll w1=x.ss;
        if(v!=f){
            distx[v]=distx[u]+w1;
            dfsx(v,u);
        }
    }
    return;
}
void dfsy(int u, int f){
    for(auto x:gfo[u]){
        int v=x.ff;
        ll w1=x.ss;
        if(v!=f){
            disty[v]=disty[u]+w1;
            dfsy(v,u);
        }
    }
    return;
}
void clen(int n){
    ans.clear();
    for(int i=0; i<=n; i++){
        gfo[i].clear();
        distx[i]=0;
        disty[i]=0;
    }
    return;
}
int max_score(int N, int X, int Y, long long K, vector<int> U, vector<int> V, vector<int> W){
    for(ll i=0; i<sz(U) ; i++){
        gfo[U[i]].pb({V[i],W[i]});
        gfo[V[i]].pb({U[i],W[i]});
    }
    dfsx(X,X);
    dfsy(Y,Y);
    for(int i=0; i<N; i++){
        ans.pb(distx[i]);
        ans.pb(disty[i]);
    }
    sort(all(ans));
    ll cont=0, sum=0;
    for(int x:ans){
        sum+=x;
        if(sum<=K)cont++;
        else break;
    }
    clen(N);
    return cont;
}

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 10 ms 23764 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 129 ms 48324 KB Output is correct
2 Correct 131 ms 50864 KB Output is correct
3 Correct 74 ms 26380 KB Output is correct

Subtask #2
0.0 / 9.0

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

Subtask #3
0.0 / 12.0

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

Subtask #4
0.0 / 14.0

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

Subtask #5
0.0 / 9.0

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