# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1200761 | mr_junk | 자매 도시 (APIO20_swap) | C++17 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
//include "stub.h"
#define file(s) if (fopen(s".in", "r")) freopen(s".in", "r", stdin), freopen(s".out", "w", stdout)
#define int long long
using namespace std;
const int NN=1e2+60,N=1e6+70,MOD=1e9+7,inf=1e18+7,pr1=420,K=(int)(sqrt(2e5));
int binpow (int num,int pw,int MOD1=MOD){
if (pw==0) return 1;
int x=binpow(num,pw/2,MOD1); x=x*x%MOD1;
if (pw%2==1) x=x*num%MOD1;
return x%MOD1;}
vector<pair<int,int>> g[N];
int getMinimumFuelCapacity(int X,int Y){
return -1;
}
void init(int N,int M,int U[],int V[],int W[]){
for(int i=0;i<M;i++){
g[U[i]].push_back({V[i],W[i]});
g[V[i]].push_back({U[i],W[i]});
}int q;
cin>>q;
while(q--){
int x,y;
cin>>x>>y;
cout<<getMinimumFuelCapacity(x,y)<<"\n";
}
}
void junk(){
int n,m;
cin>>n>>m;
int u[m],v[m],w[m];
for(int i=0;i<m;i++){
cin>>u[i]>>v[i]>>w[i];
}init(n,m,u,v,w);
}
signed main(/*ITS OVER ANAKIN. I HAVE A HIGH GROUND*/){//file("");
cin.tie(0)->sync_with_stdio(0);
int Test=1;//cin>>Test;
while(Test--){junk();}
/*YOU UNDERESTIMATE MY POWER*/}