oj.uz

답안 #258719

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
258719 2020-08-06T12:19:18 Z aggu_01000101 여행하는 상인 (APIO17_merchant) C++14
100 / 100
 207 ms 4216 KB 
#include <iostream>
#include <assert.h>
#include <algorithm>
#include <vector>
#include <set>
#include <string>
#include <queue>
#include <map>
#include <bits/stdc++.h>
#define initrand mt19937 mt_rand(time(0));
#define rand mt_rand()
#define int long long
#define INF 10000000000;
using namespace std;
#define mid(l, u) ((l+u)/2)
//#define cin fin
//#define cout fout
signed main(){
    int n, m, k;
    cin>>n>>m>>k;
    int mat[n][n], p[n][n];
    int b[n][k], s[n][k];
    for(int i =0;i<n;i++){
        for(int j =0 ;j<n;j++){
            mat[i][j] = INF;
            p[i][j] = INF;
        }
        p[i][i] = 0;
        mat[i][i] = 0;
    }
    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<m;i++){
        int u, v, t;
        cin>>u>>v>>t;
        mat[u-1][v-1] = min(mat[u-1][v-1], t);
    }
    for(int x = 0;x<n;x++){
        for(int i = 0;i<n;i++){
            for(int j = 0;j<n;j++){
                mat[i][j] = min(mat[i][j], mat[i][x] + mat[x][j]);
            }
            p[x][i] = 0;
            for(int j = 0;j<k;j++){
                if(s[i][j]!=-1 && b[x][j]!=-1) p[x][i] = max(p[x][i], s[i][j] - b[x][j]);
            }
        }
    }
    /*for(int i =0 ;i<n;i++){
        for(int j = 0;j<n;j++){
            cout<<"distance from "<<i<<" to "<<j<<" is "<<mat[i][j]<<endl;
        }
    }*/
    int l = 1;
    int u = 1000000001;
    int ans = 0;
    while(l<=u){
        int r = mid(l, u);
        bool found = false;
        int adj[n][n];
        for(int i =0 ;i<n;i++){
            for(int j = 0;j<n;j++){
                adj[i][j] = INF;
                adj[i][j] = min(adj[i][j], -(p[i][j] - r*mat[i][j]));
            }
            adj[i][i] = INF;
        }
        for(int x = 0;x<n;x++){
            for(int i = 0;i<n;i++){
                for(int j = 0;j<n;j++){
                    adj[i][j] = min(adj[i][j], adj[i][x] + adj[x][j]);
                }
            }
        }
        for(int i = 0;i<n;i++){
                if((adj[i][i] + adj[i][i]) <= 0){
                    //cout<<i<<" "<<j<<" "<<adj[i][j]<<" "<<j<<" "<<i<<" "<<adj[j][i]<<endl;
                    found = true;
                }
        }
        //cout<<r<<" "<<found<<endl;
        if(found){
            ans = max(ans, r);
            l = r + 1;
        }
        else{
            u = r-1;
        }
    }
    cout<<ans<<endl;
}
/*
4 5 2
10 9 5 2
6 4 20 15
9 7 10 9
-1 -1 16 11
1 2 3
2 3 3
1 4 1
4 3 1
3 1 1
 */

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 138 ms 2040 KB Output is correct
2 Correct 36 ms 760 KB Output is correct
3 Correct 35 ms 512 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 7 ms 384 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 6 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 0 ms 256 KB Output is correct
13 Correct 7 ms 384 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 384 KB Output is correct
2 Correct 7 ms 384 KB Output is correct
3 Correct 6 ms 384 KB Output is correct
4 Correct 6 ms 384 KB Output is correct
5 Correct 9 ms 512 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 6 ms 384 KB Output is correct
8 Correct 7 ms 384 KB Output is correct
9 Correct 6 ms 384 KB Output is correct
10 Correct 6 ms 384 KB Output is correct
11 Correct 10 ms 512 KB Output is correct
12 Correct 9 ms 512 KB Output is correct
13 Correct 8 ms 384 KB Output is correct
14 Correct 6 ms 384 KB Output is correct
15 Correct 11 ms 512 KB Output is correct
16 Correct 6 ms 384 KB Output is correct
17 Correct 7 ms 384 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 9 ms 512 KB Output is correct
20 Correct 9 ms 512 KB Output is correct
21 Correct 9 ms 512 KB Output is correct
22 Correct 7 ms 384 KB Output is correct
23 Correct 5 ms 384 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 7 ms 384 KB Output is correct
26 Correct 1 ms 256 KB Output is correct
27 Correct 5 ms 384 KB Output is correct
28 Correct 6 ms 384 KB Output is correct
29 Correct 5 ms 384 KB Output is correct
30 Correct 0 ms 256 KB Output is correct
31 Correct 7 ms 384 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 46 ms 640 KB Output is correct
2 Correct 179 ms 3800 KB Output is correct
3 Correct 40 ms 640 KB Output is correct
4 Correct 56 ms 896 KB Output is correct
5 Correct 53 ms 896 KB Output is correct
6 Correct 42 ms 640 KB Output is correct
7 Correct 7 ms 384 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 9 ms 512 KB Output is correct
10 Correct 9 ms 512 KB Output is correct
11 Correct 9 ms 512 KB Output is correct
12 Correct 7 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct

Subtask #4
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 384 KB Output is correct
2 Correct 7 ms 384 KB Output is correct
3 Correct 6 ms 384 KB Output is correct
4 Correct 6 ms 384 KB Output is correct
5 Correct 9 ms 512 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 6 ms 384 KB Output is correct
8 Correct 7 ms 384 KB Output is correct
9 Correct 6 ms 384 KB Output is correct
10 Correct 6 ms 384 KB Output is correct
11 Correct 10 ms 512 KB Output is correct
12 Correct 9 ms 512 KB Output is correct
13 Correct 8 ms 384 KB Output is correct
14 Correct 6 ms 384 KB Output is correct
15 Correct 11 ms 512 KB Output is correct
16 Correct 6 ms 384 KB Output is correct
17 Correct 46 ms 640 KB Output is correct
18 Correct 179 ms 3800 KB Output is correct
19 Correct 40 ms 640 KB Output is correct
20 Correct 56 ms 896 KB Output is correct
21 Correct 53 ms 896 KB Output is correct
22 Correct 42 ms 640 KB Output is correct
23 Correct 7 ms 384 KB Output is correct
24 Correct 0 ms 256 KB Output is correct
25 Correct 9 ms 512 KB Output is correct
26 Correct 9 ms 512 KB Output is correct
27 Correct 9 ms 512 KB Output is correct
28 Correct 7 ms 384 KB Output is correct
29 Correct 5 ms 384 KB Output is correct
30 Correct 36 ms 640 KB Output is correct
31 Correct 42 ms 800 KB Output is correct
32 Correct 90 ms 2296 KB Output is correct
33 Correct 44 ms 768 KB Output is correct
34 Correct 46 ms 892 KB Output is correct
35 Correct 43 ms 896 KB Output is correct
36 Correct 195 ms 4044 KB Output is correct
37 Correct 1 ms 256 KB Output is correct
38 Correct 0 ms 256 KB Output is correct
39 Correct 35 ms 628 KB Output is correct
40 Correct 45 ms 640 KB Output is correct
41 Correct 39 ms 640 KB Output is correct
42 Correct 42 ms 640 KB Output is correct
43 Correct 37 ms 512 KB Output is correct
44 Correct 0 ms 256 KB Output is correct
45 Correct 12 ms 512 KB Output is correct
46 Correct 17 ms 512 KB Output is correct
47 Correct 12 ms 512 KB Output is correct
48 Correct 207 ms 4216 KB Output is correct
49 Correct 204 ms 4216 KB Output is correct
50 Correct 0 ms 256 KB Output is correct
51 Correct 138 ms 2040 KB Output is correct
52 Correct 36 ms 760 KB Output is correct
53 Correct 35 ms 512 KB Output is correct
54 Correct 5 ms 384 KB Output is correct
55 Correct 5 ms 384 KB Output is correct
56 Correct 5 ms 384 KB Output is correct
57 Correct 7 ms 384 KB Output is correct
58 Correct 1 ms 256 KB Output is correct
59 Correct 5 ms 384 KB Output is correct
60 Correct 6 ms 384 KB Output is correct
61 Correct 5 ms 384 KB Output is correct
62 Correct 0 ms 256 KB Output is correct
63 Correct 7 ms 384 KB Output is correct