oj.uz

답안 #1003327

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1003327 2024-06-20T08:58:46 Z vjudge1 악어의 지하 도시 (IOI11_crocodile) C++17
0 / 100
 0 ms 348 KB 
#include "crocodile.h"
#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define vl vector<ll>
#define vi vector<int>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define f first
#define s second
#define pb push_back
#define p_b pop_back
using namespace std;
const int sz = 1e3+5;
vector<pii>g[sz];
int vis[sz], dist[sz], ans = INT_MAX, ext[sz], R[sz][2];
void dfs(int node)
{
    vis[node] = 1;
    vector<pii>vect;
    ll k = 0;
    for(auto u : g[node])
    {
        if(vis[u.f])
            continue;
        dist[u.f] = dist[node] + u.s;
        if(ext[u.f])
            k++;
        vect.pb({dist[u.f], u.f});
    }
    sort(all(vect));
    ll cnt = 0;
    for(auto u : vect)
    {
        if(ext[u.s])
            cnt++;
        if(cnt == 2)
            ans = min(ans, u.f);
    }
    for(auto u : vect)
    {
        if(vis[u.s])
            continue;
        dfs(u.s);
    }
}
int travel_plan(int N, int M, int R[][2], int L[], int K, int P[])
{
    for(int i = 0; i < M; i++)
    {
        g[R[i][0]].pb({R[i][1], L[i]});
        g[R[i][1]].pb({R[i][0], L[i]});
    }
    for(int i = 0; i < K; i++)
        ext[P[i]] = 1;
    int res = 0;
    dfs(0);
    return ans;
}

Compilation message

crocodile.cpp: In function 'int travel_plan(int, int, int (*)[2], int*, int, int*)':
crocodile.cpp:58:9: warning: unused variable 'res' [-Wunused-variable]
   58 |     int res = 0;
      |         ^~~

Subtask #1
0 / 46.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -