제출 #945626

#제출 시각아이디문제언어결과실행 시간메모리
945626ezzzayCommuter Pass (JOI18_commuter_pass)C++14
0 / 100
2 ms6492 KiB
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ff first
#define ss second
#define pb push_back
const int N=2e5+5;
vector<pair<int,int>>v[N];
int dist[N];
signed main(){
    cout<<0;
    return 0;
    int n,m,s,t,x,y;
    cin>>n>>m>>s>>t>>x>>y;
    for(int i=0;i<m;i++){
        int a,b,c;
        cin>>a>>b>>c;
        v[a].pb({b,c});
        v[b].pb({a,c});
    }
    priority_queue<pair<int,int>>q;
    q.push({0,s});
   // while()
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...