# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
59363 | 2018-07-21T19:33:27 Z | duality | Travelling Merchant (APIO17_merchant) | C++11 | 133 ms | 5168 KB |
#include <bits/stdc++.h> using namespace std; #define pb push_back #define mp make_pair typedef long long int LLI; typedef pair<int,int> pii; typedef vector<int> vi; typedef vector<pii> vpii; int B[100][1000],S[100][1000]; int dist[100][100],profit[100][100]; LLI dist2[100][100]; int main() { int i,j; int N,M,K; int u,v,t; scanf("%d %d %d",&N,&M,&K); for (i = 0; i < N; i++) { for (j = 0; j < K; j++) scanf("%d %d",&B[i][j],&S[i][j]); } for (i = 0; i < N; i++) fill(dist[i],dist[i]+N,1e9); for (i = 0; i < M; i++) { scanf("%d %d %d",&u,&v,&t); u--,v--; dist[u][v] = min(dist[u][v],t); } int k; for (k = 0; k < N; k++) { for (i = 0; i < N; i++) { for (j = 0; j < N; j++) dist[i][j] = min(dist[i][j],dist[i][k]+dist[k][j]); } } for (i = 0; i < N; i++) { for (j = 0; j < N; j++) { int m = 0; for (k = 0; k < K; k++) { if ((B[i][k] != -1) && (S[j][k] != -1)) m = max(m,S[j][k]-B[i][k]); } profit[i][j] = m; } } LLI l = 0,r = 1e10; while (l < r) { LLI m = (l+r+1) / 2; for (i = 0; i < N; i++) { for (j = 0; j < N; j++) dist2[i][j] = profit[i][j]-m*dist[i][j]; } for (k = 0; k < N; k++) { for (i = 0; i < N; i++) { for (j = 0; j < N; j++) dist2[i][j] = max(dist2[i][j],dist2[i][k]+dist2[k][j]); } } for (i = 0; i < N; i++) { if (dist2[i][i] >= 0) break; } if (i < N) l = m; else r = m-1; } printf("%lld\n",l); return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 133 ms | 2552 KB | Output is correct |
2 | Incorrect | 57 ms | 2664 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 12 ms | 2664 KB | Output is correct |
2 | Correct | 9 ms | 2664 KB | Output is correct |
3 | Correct | 15 ms | 2664 KB | Output is correct |
4 | Correct | 10 ms | 2664 KB | Output is correct |
5 | Correct | 18 ms | 2664 KB | Output is correct |
6 | Correct | 3 ms | 2664 KB | Output is correct |
7 | Incorrect | 15 ms | 2664 KB | Output isn't correct |
8 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 65 ms | 3164 KB | Output is correct |
2 | Correct | 121 ms | 4980 KB | Output is correct |
3 | Correct | 59 ms | 4980 KB | Output is correct |
4 | Incorrect | 81 ms | 5168 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 12 ms | 2664 KB | Output is correct |
2 | Correct | 9 ms | 2664 KB | Output is correct |
3 | Correct | 15 ms | 2664 KB | Output is correct |
4 | Correct | 10 ms | 2664 KB | Output is correct |
5 | Correct | 18 ms | 2664 KB | Output is correct |
6 | Correct | 3 ms | 2664 KB | Output is correct |
7 | Incorrect | 15 ms | 2664 KB | Output isn't correct |
8 | Halted | 0 ms | 0 KB | - |