oj.uz

답안 #858175

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
858175 2023-10-07T14:29:55 Z Danilo21 봉쇄 시간 (IOI23_closing) C++17
0 / 100
 1000 ms 1725896 KB 
#include <bits/stdc++.h>

#define ll long long
#define ld long double
#define pb push_back
#define fi first
#define se second
#define en '\n'
#define sp ' '
#define tb '\t'
#define ri(n) int n; cin >> n
#define rl(n) ll n; cin >> n
#define rs(s) string s; cin >> s
#define rc(c) char c; cin >> c
#define rv(v) for (auto &x : v) cin >> x
#define pven(v) for (auto x : v) cout << x << en
#define pv(v) for (auto x : v) cout << x << sp; cout << en
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define yes cout << "YES" << en
#define no cout << "NO" << en
#define smin(a, b) a = min(a, b)
#define smax(a, b) a = max(a, b)
#define ssort(a, b) if (a < b) swap(a, b)
#define bitcnt(a) (__builtin_popcountll(a))
#define bithigh(a) (63-__builtin_clzll(a))
#define lg bithigh
#define highpow(a) (1LL << (ll)lg(a))

using namespace std;

const ll LINF = 2e18;
const int mxN = 1e6+10, INF = 2e9;
ll n, x, y, k, a[mxN];
vector<array<ll, 2> > g[mxN];
bool vis[mxN];

int BFS(const vector<int>& sources){

    priority_queue<array<ll, 2>,
            vector<array<ll, 2> >,
            greater<array<ll, 2> > > pq;
    for (int s : sources) pq.push({0, s});
    int cnt = 0;
    ll sum = 0;
    while (pq.size()){
        auto [d, s] = pq.top(); pq.pop();
        if (sum + d > k) break;
        sum += d;
        cnt++;
        vis[s] = 1;
        a[s] = d;
        for (auto [u, w] : g[s])
            if (!vis[u])
                pq.push({d + w, u});
    }
    return cnt;
}

int Solve1(){ return BFS({x, y}); }

int Next(int s, int p){

    for (auto [u, w] : g[s])
        if (u^p) return u;
    return -1;
}

int Solve2(){

    int s = 0;
    for (; s < n; s++)
        if (g[s].size() == 1)
            break;

    return -1;
}

int Solve3(){

    return -1;
}

ll Dist(int s, int p, ll d){

    if (s == y) return d;
    ll dist = 0;
    for (auto [u, w] : g[s])
        if (u^p) smax(dist, Dist(u, s, d + w));
    return dist;
}

int max_score(int N, int X, int Y, long long K, vector<int> U, vector<int> V, vector<int> W){

    n = N; k = K;
    x = X; y = Y;
    for (int i = 0; i < n-1; i++){
        g[U[i]].pb({V[i], W[i]});
        g[V[i]].pb({U[i], W[i]});
    }
    if (Dist(x, -1, 0) > 2*k) return Solve1();
    int mx = 0;
    for (int i = 0; i < n; i++)
        smax(mx, (int)g[i].size());
    if (mx <= 2) return Solve2();
    return Solve3();
}

Compilation message

closing.cpp: In function 'int Solve1()':
closing.cpp:60:27: warning: narrowing conversion of 'x' from 'long long int' to 'int' [-Wnarrowing]
   60 | int Solve1(){ return BFS({x, y}); }
      |                           ^
closing.cpp:60:27: warning: narrowing conversion of 'x' from 'long long int' to 'int' [-Wnarrowing]
closing.cpp:60:30: warning: narrowing conversion of 'y' from 'long long int' to 'int' [-Wnarrowing]
   60 | int Solve1(){ return BFS({x, y}); }
      |                              ^
closing.cpp:60:30: warning: narrowing conversion of 'y' from 'long long int' to 'int' [-Wnarrowing]

Subtask #0
0.0 / 0.0

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

Subtask #1
0.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 83 ms 46676 KB Output is correct
2 Correct 95 ms 55176 KB Output is correct
3 Execution timed out 1110 ms 1725896 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #2
0.0 / 9.0

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

Subtask #3
0.0 / 12.0

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

Subtask #4
0.0 / 14.0

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

Subtask #5
0.0 / 9.0

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

Subtask #6
0.0 / 11.0

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

Subtask #7
0.0 / 10.0

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

Subtask #8
0.0 / 10.0

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

Subtask #9
0.0 / 17.0

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