#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll d[105][105], p[105][105], t[105][105];
ll s[105][2005], b[105][2005];
int n, m, k;
inline void fw(ll re[105][105]){
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
for(int l = 1; l <= n; l++)
re[j][l] = min(re[j][l], re[j][i] + re[i][l]);
}
bool check(ll val){
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
t[i][j] = d[i][j] * val - p[i][j];
fw(t);
for(int i = 1; i <= n; i++){
if(t[i][i] <= 0) return 1;
}
return 0;
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin>>n>>m>>k;
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
d[i][j] = 100000000000;
for(int i = 1; i <= n; i++){
for(int j = 1; j <= k; j++){
cin>>b[i][j]>>s[i][j];
}
}
while(m--){
int v, u, t;
cin>>v>>u>>t;
d[v][u] = t;
}
fw(d);
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++){
if(d[i][j] == 100000000000)
continue;
for(int l = 1; l <= k; l++){
if(s[i][l] == -1 || s[j][l] == -1) continue;
p[i][j] = max(p[i][j], s[j][l] - b[i][l]);
}
}
}
long long l = 0, r = 100000000000;
while(l != r){
ll m = (l + r + 1) >> 1;
if(check(m)) l = m;
else r = m - 1;
}
cout<<l;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
99 ms |
4216 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
8 ms |
1020 KB |
Output is correct |
2 |
Incorrect |
8 ms |
888 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
51 ms |
1656 KB |
Output is correct |
2 |
Correct |
100 ms |
4700 KB |
Output is correct |
3 |
Correct |
49 ms |
1636 KB |
Output is correct |
4 |
Incorrect |
52 ms |
1784 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
8 ms |
1020 KB |
Output is correct |
2 |
Incorrect |
8 ms |
888 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |