oj.uz

답안 #921074

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
921074 2024-02-03T09:47:16 Z Arp 악어의 지하 도시 (IOI11_crocodile) C++17
46 / 100
 3 ms 6748 KB 
#include<bits/stdc++.h>
 #include "crocodile.h"
using namespace std;
using i64 = long long;
const i64 inf = 1e18;
const int N = 1e5;
vector<pair<int,int>> adj[N];
bool good[N],vis[N];
i64 dp[N];
 
void dfs(int u){
  vis[u] = true;
  for(auto [v,w] : adj[u]){
    if(vis[v]) continue;
    dfs(v);
  }
  vector<i64> a;
  for(auto [v,w] : adj[u]){
    if(!good[v]) continue;
    i64 T = dp[v] + w;
    a.push_back(T);
  }
  sort(a.begin(),a.end());
  if(a.size() >= 2){
    dp[u] = a[1];
    good[u] = true;
  }
}

void dfs2(int u){
  vis[u] = true;
  vector<i64> a;
  for(auto [v,w] : adj[u]){
    if(!good[v]) continue;
    i64 T = dp[v] + w;
    a.push_back(T);
  }
  sort(a.begin(),a.end());
  if(a.size() >= 2){
    dp[u] = a[1];
    good[u] = true;
  }
   for(auto [v,w] : adj[u]){
    if(vis[v]) continue;
    dfs(v);
  }
} 

int travel_plan(int N,int M,int R[][2],int L[],int K,int P[]){
  for(int i = 0;i<M;i++){
    adj[R[i][0]].emplace_back(R[i][1],L[i]);
    adj[R[i][1]].emplace_back(R[i][0],L[i]);
  }
  for(int i = 0;i<N;i++){
    vis[i] = false;
    good[i] = false;
    dp[i] = inf;
  }
  for(int i = 0;i<K;i++){
    dp[P[i]] = 0;
    good[P[i]] = true;
    vis[P[i]] = true;
  }
  dfs(0);
  for(int i = 0;i<N;i++){
    vis[i] = false;
  }
  for(int i = 0;i<K;i++){
    vis[P[i]] = true;
  }
  dfs2(0);
 // assert(good[0]);
  return (int) dp[0];
}

Subtask #1
46.0 / 46.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 2 ms 6492 KB Output is correct
4 Correct 2 ms 6492 KB Output is correct
5 Correct 2 ms 6492 KB Output is correct
6 Correct 2 ms 6492 KB Output is correct
7 Correct 2 ms 6604 KB Output is correct
8 Correct 2 ms 6492 KB Output is correct

Subtask #2
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 2 ms 6492 KB Output is correct
4 Correct 2 ms 6492 KB Output is correct
5 Correct 2 ms 6492 KB Output is correct
6 Correct 2 ms 6492 KB Output is correct
7 Correct 2 ms 6604 KB Output is correct
8 Correct 2 ms 6492 KB Output is correct
9 Correct 3 ms 6748 KB Output is correct
10 Incorrect 1 ms 6492 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 2 ms 6492 KB Output is correct
4 Correct 2 ms 6492 KB Output is correct
5 Correct 2 ms 6492 KB Output is correct
6 Correct 2 ms 6492 KB Output is correct
7 Correct 2 ms 6604 KB Output is correct
8 Correct 2 ms 6492 KB Output is correct
9 Correct 3 ms 6748 KB Output is correct
10 Incorrect 1 ms 6492 KB Output isn't correct
11 Halted 0 ms 0 KB -