oj.uz

답안 #1098818

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1098818 2024-10-10T05:37:13 Z KasymK 봉쇄 시간 (IOI23_closing) C++17
0 / 100
 69 ms 26560 KB 
#include "bits/stdc++.h"
using namespace std;
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define tr(i, c) for(auto i = c.begin(); i != c.end(); ++i)
#define wr puts("----------------")
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
const int N = 2e5+5;
vector<pii> adj[N];
ll dis[N];

int max_score(int n, int x, int y, ll k, vector<int> u, vector<int> v, vector<int> w) {
    for(int i = 0; i < n-1; ++i)
        adj[u[i]+1].pb({v[i]+1, w[i]}), adj[v[i]+1].pb({u[i]+1, w[i]});
    vector<ll> A;
    vector<int> D;
    D.pb(x), D.pb(y);
    for(int ad : D){
        memset(dis, -1, sizeof dis);
        queue<int> q;
        q.push(ad);
        dis[ad] = 0;
        while(!q.empty()){
            int x = q.front();
            q.pop();
            for(auto i : adj[x])
                if(dis[i.ff] == -1)
                    dis[i.ff] = dis[x]+1, q.push(i.ff);
        }
        for(int i = 1; i <= n; ++i)
            if(~dis[i])
                A.pb(dis[i]);
    }
    ll sm = 0;
    for(int i = 0; i <= (int)A.size(); ++i)
        if(i == (int)A.size() or (sm+=v[i])>k)
            return i;
}

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:22:16: warning: control reaches end of non-void function [-Wreturn-type]
   22 |     vector<ll> A;
      |                ^

Subtask #0
0.0 / 0.0

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

Subtask #1
0.0 / 8.0

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

Subtask #2
0.0 / 9.0

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

Subtask #6
0.0 / 11.0

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

Subtask #7
0.0 / 10.0

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

Subtask #8
0.0 / 10.0

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

Subtask #9
0.0 / 17.0

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