답안 #487955

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
487955 2021-11-17T07:51:46 Z Mahdi 여행하는 상인 (APIO17_merchant) C++17
100 / 100
89 ms 1292 KB
#include<bits/stdc++.h>
#pragma GCC optimize ("Ofast")
using namespace std;
#define all(v) v.begin(), v.end()
#define pii pair<int, int>
#define pil pair<int, ll>
#define pll pair<ll, ll>
#define F first
#define S second
typedef long long ll;
const int N=105, K=1e3+5;
int n, m, k, b[N][K], s[N][K], dis[N][N], a[N][N];
bool c[N][N];
ll d[N][N];

bool ok(ll x){
    for(int i=0;i<n;++i){
        for(int j=0;j<n;++j)
            d[i][j]=-x*dis[i][j]+a[i][j];
    }
    for(int o=0;o<n;++o){
        for(int i=0;i<n;++i){
            for(int j=0;j<n;++j){
                if(c[i][o] && c[o][j])
                    d[i][j]=max(d[i][j], d[i][o]+d[o][j]);
            }
        }
        for(int i=0;i<n;++i){
            if(d[i][i]>0)
                return 1;
        }
    }
    for(int i=0;i<n;++i){
        for(int j=i+1;j<n;++j){
            if(c[i][j] && c[j][i] && d[i][j]+d[j][i]>=0)
                return 1;
        }
    }
    return 0;
}

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin>>n>>m>>k;
    for(int i=0;i<n;++i){
        for(int j=0;j<k;++j)
            cin>>b[i][j]>>s[i][j];
    }
    for(int i=0;i<n;++i){
        fill(dis[i], dis[i]+n, 1e9+5);
        dis[i][i]=0;
    }
    int u, v, w;
    for(int i=0;i<m;++i){
        cin>>u>>v>>w;
        dis[--u][--v]=w;
    }
    for(int o=0;o<n;++o){
        for(int i=0;i<n;++i){
            for(int j=0;j<n;++j)
                dis[i][j]=min(dis[i][j], dis[i][o]+dis[o][j]);
        }
    }
    for(int i=0;i<n;++i){
        for(int j=0;j<n;++j){
            if(dis[i][j]==5+1e9)
                dis[i][j]=0;
            else
                c[i][j]=1;
        }
    }
    for(int i=0;i<n;++i){
        for(int j=0;j<n;++j){
            for(int o=0;o<k;++o){
                if(b[i][o]!=-1 && s[j][o]!=-1)
                    a[i][j]=max(a[i][j], s[j][o]-b[i][o]);
            }
        }
    }
    int l=0, r=1e9;
    while(l<r-1){
        int mid=(l+r)/2;
        if(ok(mid))
            l=mid;
        else
            r=mid;
    }
    cout<<l;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 55 ms 1164 KB Output is correct
2 Correct 35 ms 1228 KB Output is correct
3 Correct 24 ms 1248 KB Output is correct
4 Correct 5 ms 716 KB Output is correct
5 Correct 4 ms 716 KB Output is correct
6 Correct 5 ms 716 KB Output is correct
7 Correct 4 ms 716 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 3 ms 716 KB Output is correct
10 Correct 3 ms 716 KB Output is correct
11 Correct 4 ms 716 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 4 ms 792 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 716 KB Output is correct
2 Correct 4 ms 716 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 3 ms 716 KB Output is correct
5 Correct 3 ms 716 KB Output is correct
6 Correct 4 ms 716 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 4 ms 792 KB Output is correct
9 Correct 5 ms 716 KB Output is correct
10 Correct 4 ms 716 KB Output is correct
11 Correct 5 ms 716 KB Output is correct
12 Correct 5 ms 716 KB Output is correct
13 Correct 6 ms 716 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 2 ms 716 KB Output is correct
16 Correct 3 ms 716 KB Output is correct
17 Correct 2 ms 716 KB Output is correct
18 Correct 3 ms 716 KB Output is correct
19 Correct 6 ms 716 KB Output is correct
20 Correct 4 ms 716 KB Output is correct
21 Correct 4 ms 716 KB Output is correct
22 Correct 5 ms 716 KB Output is correct
23 Correct 5 ms 716 KB Output is correct
24 Correct 5 ms 716 KB Output is correct
25 Correct 5 ms 716 KB Output is correct
26 Correct 0 ms 332 KB Output is correct
27 Correct 7 ms 716 KB Output is correct
28 Correct 5 ms 716 KB Output is correct
29 Correct 4 ms 716 KB Output is correct
30 Correct 4 ms 716 KB Output is correct
31 Correct 3 ms 716 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 716 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 7 ms 716 KB Output is correct
4 Correct 5 ms 716 KB Output is correct
5 Correct 4 ms 716 KB Output is correct
6 Correct 4 ms 716 KB Output is correct
7 Correct 3 ms 716 KB Output is correct
8 Correct 35 ms 1208 KB Output is correct
9 Correct 81 ms 1292 KB Output is correct
10 Correct 37 ms 1228 KB Output is correct
11 Correct 41 ms 1228 KB Output is correct
12 Correct 41 ms 1180 KB Output is correct
13 Correct 33 ms 1228 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 716 KB Output is correct
2 Correct 4 ms 716 KB Output is correct
3 Correct 5 ms 716 KB Output is correct
4 Correct 5 ms 716 KB Output is correct
5 Correct 6 ms 716 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 2 ms 716 KB Output is correct
8 Correct 3 ms 716 KB Output is correct
9 Correct 2 ms 716 KB Output is correct
10 Correct 3 ms 716 KB Output is correct
11 Correct 6 ms 716 KB Output is correct
12 Correct 4 ms 716 KB Output is correct
13 Correct 4 ms 716 KB Output is correct
14 Correct 5 ms 716 KB Output is correct
15 Correct 5 ms 716 KB Output is correct
16 Correct 5 ms 716 KB Output is correct
17 Correct 35 ms 1208 KB Output is correct
18 Correct 81 ms 1292 KB Output is correct
19 Correct 37 ms 1228 KB Output is correct
20 Correct 41 ms 1228 KB Output is correct
21 Correct 41 ms 1180 KB Output is correct
22 Correct 33 ms 1228 KB Output is correct
23 Correct 5 ms 716 KB Output is correct
24 Correct 0 ms 332 KB Output is correct
25 Correct 7 ms 716 KB Output is correct
26 Correct 5 ms 716 KB Output is correct
27 Correct 4 ms 716 KB Output is correct
28 Correct 4 ms 716 KB Output is correct
29 Correct 3 ms 716 KB Output is correct
30 Correct 55 ms 1164 KB Output is correct
31 Correct 35 ms 1228 KB Output is correct
32 Correct 24 ms 1248 KB Output is correct
33 Correct 5 ms 716 KB Output is correct
34 Correct 4 ms 716 KB Output is correct
35 Correct 5 ms 716 KB Output is correct
36 Correct 4 ms 716 KB Output is correct
37 Correct 0 ms 332 KB Output is correct
38 Correct 3 ms 716 KB Output is correct
39 Correct 3 ms 716 KB Output is correct
40 Correct 4 ms 716 KB Output is correct
41 Correct 0 ms 332 KB Output is correct
42 Correct 4 ms 792 KB Output is correct
43 Correct 32 ms 1228 KB Output is correct
44 Correct 35 ms 1228 KB Output is correct
45 Correct 43 ms 1216 KB Output is correct
46 Correct 36 ms 1228 KB Output is correct
47 Correct 37 ms 1264 KB Output is correct
48 Correct 37 ms 1268 KB Output is correct
49 Correct 87 ms 1220 KB Output is correct
50 Correct 0 ms 332 KB Output is correct
51 Correct 0 ms 332 KB Output is correct
52 Correct 33 ms 1228 KB Output is correct
53 Correct 38 ms 1228 KB Output is correct
54 Correct 21 ms 1292 KB Output is correct
55 Correct 35 ms 1276 KB Output is correct
56 Correct 36 ms 1228 KB Output is correct
57 Correct 0 ms 332 KB Output is correct
58 Correct 5 ms 716 KB Output is correct
59 Correct 5 ms 716 KB Output is correct
60 Correct 4 ms 716 KB Output is correct
61 Correct 89 ms 1232 KB Output is correct
62 Correct 85 ms 1204 KB Output is correct
63 Correct 0 ms 332 KB Output is correct