# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
137089 | ksmzzang2003 | 철도 요금 (JOI16_ho_t3) | C++14 | 261 ms | 24184 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define maxn 200009
using namespace std;
typedef pair <int,int> pii;
int N,M,Q,query[maxn],ans[maxn],dp[maxn];
vector <int> adj[maxn];
vector <pii> adj2[maxn];
pii edge[maxn],dist[maxn];
int main() {
scanf("%d%d%d",&N,&M,&Q);
for(int i=1; i<=M; i++) {
int u,v;
scanf("%d%d",&u,&v);
adj[u].push_back(v);
adj[v].push_back(u);
edge[i] = pii(u,v);
}
for(int i=1; i<=Q; i++) {
int x;
scanf("%d",&x) ;
query[x] = i;
}
for(int i=1; i<=N; i++)
dist[i] = pii(-1,i);
queue <int> q;
dist[1] .first=0 ;
q.push(1);
while(!q.empty()) {
int x = q.front(); q.pop();
for(int next:adj[x]){
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |