oj.uz

답안 #709124

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
709124 2023-03-13T06:34:09 Z ono_de206 악어의 지하 도시 (IOI11_crocodile) C++14
46 / 100
 4 ms 2772 KB 
#include "crocodile.h"
#include<bits/stdc++.h>
using namespace std;

#define pb push_back

const int inf = 1e9 + 10;
const int mxn = 1e5 + 10;
int a[mxn], is[mxn], n;
vector<pair<int, int>> g[mxn];
map<int, int> mp;

int solve(int x) {
  if(mp.find(x) != mp.end()) return mp[x];
  if(is[x]) return 0;
  vector<int> tmp;
  int &ret = mp[x];
  ret = inf;
  for(auto [y, t] : g[x]) {
    tmp.pb(solve(y) + t);
  }
  sort(tmp.begin(), tmp.end());
  ret = tmp[1];
  return ret;
}

int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]) {
  n = N;
  for(int i = 0; i < M; i++) {
    int x = R[i][0];
    int y = R[i][1];
    g[x].pb({y, L[i]});
    g[y].pb({x, L[i]});
  }
  for(int i = 0; i < K; i++) {
    is[P[i]] = 1;
  }
  return solve(0);
}

Compilation message

crocodile.cpp: In function 'int solve(int)':
crocodile.cpp:19:12: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   19 |   for(auto [y, t] : g[x]) {
      |            ^

Subtask #1
46.0 / 46.0

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

Subtask #2
0 / 43.0

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

Subtask #3
0 / 11.0

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