제출 #753576

#제출 시각아이디문제언어결과실행 시간메모리
753576nonono악어의 지하 도시 (IOI11_crocodile)C++14
100 / 100
468 ms66880 KiB
#include "crocodile.h" #include "bits/stdc++.h" using namespace std; int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]){ vector<pair<int, int>> adj[N]; for(int i = 0; i < M; i ++){ adj[R[i][0]].push_back({R[i][1], L[i]}); adj[R[i][1]].push_back({R[i][0], L[i]}); } int T[N]; for(int i = 0; i < N; i ++) T[i] = 0; priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq; for(int i = 0; i < K; i ++){ pq.push({0, P[i]}); T[P[i]] = 1; } while(!pq.empty()){ int u = pq.top().second; int du = pq.top().first; pq.pop(); T[u] ++ ; if(T[u] == 2){ if(!u) return du; for(auto [v, w] : adj[u]){ if(T[v] >= 2) continue ; pq.push({du + w, v}); } } } return -1; }

컴파일 시 표준 에러 (stderr) 메시지

crocodile.cpp: In function 'int travel_plan(int, int, int (*)[2], int*, int, int*)':
crocodile.cpp:32:22: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   32 |             for(auto [v, w] : adj[u]){
      |                      ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...