#include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
#define N 110
#define K 1010
ll n,m,k,d[N][N];
ll s[N][K],b[N][K];
void wf(){
for(int r=1;r<=n;r++){
for(int i=1;i<=n;i++)for(int j=1;j<=n;j++){
d[i][j]=min(d[i][j],d[i][r]+d[r][j]);
}
}
}
int main(){
cin>>n>>m>>k;
for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)d[i][j]=1e17;
for(int i=1;i<=n;i++){
for(int j=0;j<k;j++)cin>>b[i][j]>>s[i][j];
d[i][i]=0;
}
for(int i=0;i<m;i++){
ll x,y,z;cin>>x>>y>>z;
d[x][y]=z;
}
wf();
/*
for(int i=1;i<=n;i++){
cout<<i<<":";
for(int j=1;j<=n;j++)cout<<d[i][j]<<" ";
cout<<endl;
}*/
ll ans=0;
for(int i=2;i<=n;i++){
ll len=d[1][i]+d[i][1];
ll ma=0;
for(int j=0;j<k;j++){
if(b[1][j]==-1)continue;
ma=max(ma,s[i][j]-b[1][j]);
}
ans=max(ans,ma/len);
}
cout<<ans<<endl;
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
72 ms |
1972 KB |
Output is correct |
2 |
Correct |
5 ms |
1280 KB |
Output is correct |
3 |
Correct |
6 ms |
1152 KB |
Output is correct |
4 |
Correct |
4 ms |
768 KB |
Output is correct |
5 |
Correct |
3 ms |
796 KB |
Output is correct |
6 |
Correct |
3 ms |
768 KB |
Output is correct |
7 |
Correct |
5 ms |
896 KB |
Output is correct |
8 |
Correct |
3 ms |
384 KB |
Output is correct |
9 |
Correct |
4 ms |
768 KB |
Output is correct |
10 |
Correct |
3 ms |
768 KB |
Output is correct |
11 |
Correct |
3 ms |
768 KB |
Output is correct |
12 |
Correct |
2 ms |
384 KB |
Output is correct |
13 |
Correct |
5 ms |
896 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
3 ms |
768 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
11 ms |
1312 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
3 ms |
768 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |