# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
110974 | 2019-05-13T12:43:11 Z | nxteru | 여행하는 상인 (APIO17_merchant) | C++14 | 54 ms | 3576 KB |
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef double D; typedef pair<ll,ll> P; typedef pair<ll,P> T; #define M 1000000007 #define F first #define S second #define PB push_back #define INF 100000000000000000 ll n,m,k,s[105][1005],b[105][1005],d[105][105]; vector<T>g[105]; bool check(ll x){ for(int i=0;i<n;i++)for(int j=0;j<n;j++)d[i][j]=INF; for(int i=0;i<n;i++){ for(int j=0;j<g[i].size();j++){ d[i][g[i][j].F]=x*g[i][j].S.S-g[i][j].S.F; } } for(int l=0;l<n;l++){ for(int i=0;i<n;i++){ for(int j=0;j<n;j++){ if(d[i][l]!=INF&&d[l][j]!=INF)d[i][j]=min(d[i][j],d[i][l]+d[l][j]); } if(d[i][i]<=0)return true; } } return false; } int main(void){ scanf("%lld%lld%lld",&n,&m,&k); for(int i=0;i<n;i++){ for(int j=0;j<k;j++){ scanf("%lld%lld",&s[i][j],&b[i][j]); } } for(int i=0;i<n;i++)for(int j=0;j<n;j++)d[i][j]=INF; for(int i=0;i<m;i++){ ll v,w,t; scanf("%lld%lld%lld",&v,&w,&t); v--,w--; d[v][w]=t; } for(int i=0;i<n;i++)d[i][i]=0; for(int l=0;l<n;l++){ for(int i=0;i<n;i++){ for(int j=0;j<n;j++){ d[i][j]=min(d[i][j],d[i][l]+d[l][j]); } } } for(int i=0;i<n;i++){ for(int j=0;j<n;j++){ if(i==j||d[i][j]==INF)continue; ll ma=0; for(int l=0;l<k;l++){ if(s[i][l]!=-1&&b[j][l]!=-1){ ma=max(ma,b[j][l]-s[i][l]); } } g[i].PB(T(j,P(ma,d[i][j]))); } } ll l=0,r=INF; while(r-l>1){ ll x=(l+r)/2LL; if(check(x))l=x; else r=x; } printf("%lld\n",l); }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 54 ms | 3576 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 11 ms | 896 KB | Output is correct |
2 | Correct | 12 ms | 896 KB | Output is correct |
3 | Correct | 13 ms | 896 KB | Output is correct |
4 | Correct | 15 ms | 896 KB | Output is correct |
5 | Correct | 14 ms | 896 KB | Output is correct |
6 | Correct | 3 ms | 384 KB | Output is correct |
7 | Correct | 10 ms | 840 KB | Output is correct |
8 | Correct | 11 ms | 896 KB | Output is correct |
9 | Correct | 11 ms | 768 KB | Output is correct |
10 | Correct | 11 ms | 896 KB | Output is correct |
11 | Correct | 16 ms | 896 KB | Output is correct |
12 | Correct | 11 ms | 896 KB | Output is correct |
13 | Correct | 12 ms | 896 KB | Output is correct |
14 | Correct | 12 ms | 928 KB | Output is correct |
15 | Correct | 17 ms | 896 KB | Output is correct |
16 | Correct | 12 ms | 768 KB | Output is correct |
17 | Correct | 15 ms | 896 KB | Output is correct |
18 | Correct | 2 ms | 384 KB | Output is correct |
19 | Correct | 13 ms | 896 KB | Output is correct |
20 | Correct | 12 ms | 896 KB | Output is correct |
21 | Correct | 14 ms | 896 KB | Output is correct |
22 | Correct | 14 ms | 896 KB | Output is correct |
23 | Correct | 12 ms | 896 KB | Output is correct |
24 | Correct | 15 ms | 1024 KB | Output is correct |
25 | Correct | 14 ms | 896 KB | Output is correct |
26 | Correct | 2 ms | 384 KB | Output is correct |
27 | Correct | 13 ms | 768 KB | Output is correct |
28 | Correct | 10 ms | 768 KB | Output is correct |
29 | Correct | 10 ms | 896 KB | Output is correct |
30 | Correct | 2 ms | 384 KB | Output is correct |
31 | Correct | 16 ms | 896 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 51 ms | 1792 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 11 ms | 896 KB | Output is correct |
2 | Correct | 12 ms | 896 KB | Output is correct |
3 | Correct | 13 ms | 896 KB | Output is correct |
4 | Correct | 15 ms | 896 KB | Output is correct |
5 | Correct | 14 ms | 896 KB | Output is correct |
6 | Correct | 3 ms | 384 KB | Output is correct |
7 | Correct | 10 ms | 840 KB | Output is correct |
8 | Correct | 11 ms | 896 KB | Output is correct |
9 | Correct | 11 ms | 768 KB | Output is correct |
10 | Correct | 11 ms | 896 KB | Output is correct |
11 | Correct | 16 ms | 896 KB | Output is correct |
12 | Correct | 11 ms | 896 KB | Output is correct |
13 | Correct | 12 ms | 896 KB | Output is correct |
14 | Correct | 12 ms | 928 KB | Output is correct |
15 | Correct | 17 ms | 896 KB | Output is correct |
16 | Correct | 12 ms | 768 KB | Output is correct |
17 | Incorrect | 51 ms | 1792 KB | Output isn't correct |
18 | Halted | 0 ms | 0 KB | - |