# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
103983 | 2019-04-03T13:43:53 Z | autumn_eel | Travelling Merchant (APIO17_merchant) | C++14 | 47 ms | 3320 KB |
#include <bits/stdc++.h> #define rep(i,n)for(int i=0;i<(n);i++) using namespace std; typedef long long ll; int d[200][200]; int b[200][2000],s[200][2000]; int main(){ int n,m,K;cin>>n>>m>>K; rep(i,n)rep(j,K)scanf("%d%d",&b[i][j],&s[i][j]); memset(d,0x3f,sizeof(d)); rep(i,n)d[i][i]=0; rep(i,m){ int a,b,c;scanf("%d%d%d",&a,&b,&c);a--;b--; d[a][b]=c; } rep(k,n)rep(i,n)rep(j,n){ d[i][j]=min(d[i][j],d[i][k]+d[k][j]); } int Max=0; for(int i=1;i<n;i++){ rep(j,K){ if(b[0][j]==-1||s[i][j]==-1)continue; Max=max(Max,(s[i][j]-b[0][j])/(d[0][i]+d[i][0])); } } cout<<Max<<endl; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 47 ms | 3320 KB | Output is correct |
2 | Correct | 5 ms | 1280 KB | Output is correct |
3 | Correct | 4 ms | 1280 KB | Output is correct |
4 | Correct | 3 ms | 896 KB | Output is correct |
5 | Correct | 3 ms | 896 KB | Output is correct |
6 | Correct | 3 ms | 896 KB | Output is correct |
7 | Correct | 3 ms | 896 KB | Output is correct |
8 | Correct | 3 ms | 640 KB | Output is correct |
9 | Correct | 4 ms | 940 KB | Output is correct |
10 | Correct | 3 ms | 896 KB | Output is correct |
11 | Correct | 3 ms | 896 KB | Output is correct |
12 | Correct | 2 ms | 640 KB | Output is correct |
13 | Correct | 4 ms | 896 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 896 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 7 ms | 1536 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 896 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |