#include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
typedef long double ld;
#define chmax(a,b) a=max(a,b);
#define chmin(a,b) a=min(a,b);
#define N 110
#define K 1010
ll n,m,k,d[N][N],v[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]);
}
}
}
ld dist[N];
bool solve(ll t){
/*cout<<"-----"<<t<<endl;
for(int i=1;i<=n;i++){
cout<<i<<":";
for(int j=1;j<=n;j++)cout<<v[i][j]-t*d[i][j]<<" ";
cout<<endl;
}*/
for(int i=1;i<=n;i++)dist[i]=0;
for(int u=0;u<=N;u++){
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++)if(i!=j){
ld ne=dist[i]-(v[i][j]-t*d[i][j]+1e-50);
if(u==N&&dist[j]>ne)return 1;
chmin(dist[j],ne);
}
}
}
return 0;
}
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;
}*/
for(int r=1;r<=n;r++){
for(int i=1;i<=n;i++){
ll ma=0;
for(int j=0;j<k;j++){
if(~s[i][j]&&~b[r][j])ma=max(ma,s[i][j]-b[r][j]);
}
v[r][i]=ma;
}
}
ll l=0,r=2e9,mid;
while(l<r-1){
mid=(l+r)/2;
if(solve(mid))l=mid;
else r=mid;
}
cout<<l<<endl;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
280 ms |
2040 KB |
Output is correct |
2 |
Correct |
210 ms |
1280 KB |
Output is correct |
3 |
Correct |
215 ms |
1400 KB |
Output is correct |
4 |
Correct |
65 ms |
768 KB |
Output is correct |
5 |
Correct |
58 ms |
888 KB |
Output is correct |
6 |
Correct |
61 ms |
856 KB |
Output is correct |
7 |
Correct |
64 ms |
944 KB |
Output is correct |
8 |
Incorrect |
3 ms |
384 KB |
Output isn't correct |
9 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
57 ms |
888 KB |
Output is correct |
2 |
Correct |
55 ms |
896 KB |
Output is correct |
3 |
Correct |
59 ms |
920 KB |
Output is correct |
4 |
Correct |
54 ms |
896 KB |
Output is correct |
5 |
Correct |
86 ms |
924 KB |
Output is correct |
6 |
Incorrect |
3 ms |
384 KB |
Output isn't correct |
7 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
223 ms |
1508 KB |
Output is correct |
2 |
Correct |
325 ms |
2016 KB |
Output is correct |
3 |
Correct |
217 ms |
1400 KB |
Output is correct |
4 |
Correct |
228 ms |
1408 KB |
Output is correct |
5 |
Correct |
205 ms |
1400 KB |
Output is correct |
6 |
Correct |
229 ms |
1528 KB |
Output is correct |
7 |
Correct |
67 ms |
1016 KB |
Output is correct |
8 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
9 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
57 ms |
888 KB |
Output is correct |
2 |
Correct |
55 ms |
896 KB |
Output is correct |
3 |
Correct |
59 ms |
920 KB |
Output is correct |
4 |
Correct |
54 ms |
896 KB |
Output is correct |
5 |
Correct |
86 ms |
924 KB |
Output is correct |
6 |
Incorrect |
3 ms |
384 KB |
Output isn't correct |
7 |
Halted |
0 ms |
0 KB |
- |