# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1166425 | mariusharabari | Travelling Merchant (APIO17_merchant) | C++17 | 57 ms | 6208 KiB |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll INF=LLONG_MAX/2;
int n, m, x;
ll b[101][1001], s[101][1001], g[101][101], g2[101][101], p[101][101];
void floyd_warshall(ll v[101][101]){
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
for(int k=1;k<=n;k++)
v[j][k]=min(v[j][k],v[j][i]+v[i][k]);
}
int main(){
iostream::sync_with_stdio(false);
cin.tie(0);
cin>>n>>m>>x;
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++)
g[i][j]=INF;
for(int j=1;j<=x;j++)
cin>>b[i][j]>>s[i][j];
}
int u, v, c;
for(int i=1;i<=m;i++){
# | 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... |