제출 #872319

#제출 시각아이디문제언어결과실행 시간메모리
872319Ahmed_SolymanAutobus (COCI22_autobus)C++14
0 / 70
44 ms4416 KiB
/* In the name of Allah made by: Ahmed_Solyman */ #include <bits/stdc++.h> #include <ext/rope> using namespace std; using namespace __gnu_cxx; #pragma GCC optimize("-Ofast") #pragma GCC optimize("-O1") //-------------------------------------------------------------// typedef long long ll; typedef unsigned long long ull; #define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0); #define PI acos(-1) #define lb lower_bound #define ub upper_bound #define endl '\n' #define all(v) v.begin(),v.end() #define allr(v) v.rbegin(),v.rend() #define sum_to(n) (n*(n+1))/2 #define pb push_back #define pf push_front #define fil(arr,x) memset(arr,x,sizeof(arr)) const ll mod=1e9+7; int dx[8]={0,1,0,-1,1,1,-1,-1}; int dy[8]={1,0,-1,0,1,-1,-1,1}; //-------------------------------------------------------------// ll lcm(ll a,ll b) { return (max(a,b)/__gcd(a,b))*min(a,b); } void person_bool(bool x) { cout<<(x?"YES":"NO")<<endl; } int main() { //freopen("input.txt","r",stdin); //freopen("output.txt","w",stdout); fast int n,m;cin>>n>>m; vector<vector<vector<int>>>dist(n+5,vector<vector<int>>(n+5,vector<int>(n+5,1e9))); for(int i=0;i<n;i++){ int u,v,w; cin>>u>>v>>w; dist[u][v][1]=min(dist[u][v][1],w); } int k,q;cin>>k>>q; for(int j=2;j<=min(k,n);j++){ for(int u=1;u<=n;u++){ for(int v=1;v<=n;v++){ for(int b=1;b<=n;b++){ dist[u][v][j]=min(dist[u][v][j],dist[u][b][j-1]+dist[b][v][j-1]); } } } } while(q--){ int u,v;cin>>u>>v; cout<<(dist[u][v][k]==1e9?-1:dist[u][v][k])<<endl; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...