oj.uz

답안 #166481

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
166481 2019-12-02T15:13:54 Z combi1k1 여행하는 상인 (APIO17_merchant) C++14
100 / 100
 163 ms 3448 KB 
#include<bits/stdc++.h>

using namespace std;

#define ll  long long

int s[101][1000];
int b[101][1000];
int d[101][101];
int w[101][101];

int main()  {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    int n;  cin >> n;
    int m;  cin >> m;
    int k;  cin >> k;

    for(int i = 0 ; i < n ; ++i)
    for(int j = 0 ; j < k ; ++j)
        cin >> b[i][j],
        cin >> s[i][j];

    memset(d,0x3f,sizeof d);

    for(int i = 0 ; i < n ; ++i)    d[i][i] = 0;
    for(int i = 0 ; i < m ; ++i)    {
        int x;  cin >> x;   --x;
        int y;  cin >> y;   --y;
        int t;  cin >> t;
        d[x][y] = t;
    }

    for(int T = 0 ; T < n ; ++T)
    for(int i = 0 ; i < n ; ++i)
    for(int j = 0 ; j < n ; ++j)
        d[i][j] = min(d[i][j],d[i][T] + d[T][j]);

    for(int P = 0 ; P < k ; ++P)
    for(int i = 0 ; i < n ; ++i)
    for(int j = 0 ; j < n ; ++j)    if (b[i][P] >= 0 && s[j][P] >= 0)
        w[i][j] = max(w[i][j],s[j][P] - b[i][P]);

    vector<vector<ll> > dd(n,vector<ll>(n));

    int l = 0;
    int r = 1e9 + 7;

    for(; l + 1 < r ;)  {
        m = (l + r) / 2;
        for(int i = 0 ; i < n ; ++i)
        for(int j = 0 ; j < n ; ++j)
            dd[i][j] = w[i][j] - 1ll * m * d[i][j];

        bool ok = 0;

        for(int T = 0 ; T < n ; ++T)
        for(int i = 0 ; i < n ; ++i)
        for(int j = 0 ; j < n ; ++j)    {
            ll  nxt = dd[i][T] + dd[T][j];

            if (dd[i][j] < nxt)
                dd[i][j] = nxt;
            if (i == j && i != T && nxt >= 0)
                ok = 1;
        }

        if (ok) l = m;
        else    r = m;
    }
    cout << l << 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 113 ms 1272 KB Output is correct
2 Correct 54 ms 1272 KB Output is correct
3 Correct 57 ms 1272 KB Output is correct
4 Correct 10 ms 760 KB Output is correct
5 Correct 10 ms 760 KB Output is correct
6 Correct 6 ms 888 KB Output is correct
7 Correct 11 ms 888 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 10 ms 844 KB Output is correct
10 Correct 11 ms 760 KB Output is correct
11 Correct 11 ms 760 KB Output is correct
12 Correct 2 ms 504 KB Output is correct
13 Correct 14 ms 912 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 808 KB Output is correct
2 Correct 10 ms 888 KB Output is correct
3 Correct 11 ms 892 KB Output is correct
4 Correct 10 ms 760 KB Output is correct
5 Correct 16 ms 888 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 10 ms 760 KB Output is correct
8 Correct 11 ms 760 KB Output is correct
9 Correct 10 ms 888 KB Output is correct
10 Correct 14 ms 760 KB Output is correct
11 Correct 13 ms 892 KB Output is correct
12 Correct 12 ms 888 KB Output is correct
13 Correct 10 ms 760 KB Output is correct
14 Correct 12 ms 760 KB Output is correct
15 Correct 13 ms 888 KB Output is correct
16 Correct 10 ms 760 KB Output is correct
17 Correct 19 ms 888 KB Output is correct
18 Correct 2 ms 504 KB Output is correct
19 Correct 19 ms 888 KB Output is correct
20 Correct 14 ms 1016 KB Output is correct
21 Correct 13 ms 888 KB Output is correct
22 Correct 11 ms 760 KB Output is correct
23 Correct 12 ms 888 KB Output is correct
24 Correct 6 ms 888 KB Output is correct
25 Correct 11 ms 888 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 10 ms 844 KB Output is correct
28 Correct 11 ms 760 KB Output is correct
29 Correct 11 ms 760 KB Output is correct
30 Correct 2 ms 504 KB Output is correct
31 Correct 14 ms 912 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 143 ms 1332 KB Output is correct
2 Correct 163 ms 3136 KB Output is correct
3 Correct 98 ms 1400 KB Output is correct
4 Correct 125 ms 1544 KB Output is correct
5 Correct 117 ms 1532 KB Output is correct
6 Correct 71 ms 1400 KB Output is correct
7 Correct 19 ms 888 KB Output is correct
8 Correct 2 ms 504 KB Output is correct
9 Correct 19 ms 888 KB Output is correct
10 Correct 14 ms 1016 KB Output is correct
11 Correct 13 ms 888 KB Output is correct
12 Correct 11 ms 760 KB Output is correct
13 Correct 12 ms 888 KB Output is correct

Subtask #4
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 808 KB Output is correct
2 Correct 10 ms 888 KB Output is correct
3 Correct 11 ms 892 KB Output is correct
4 Correct 10 ms 760 KB Output is correct
5 Correct 16 ms 888 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 10 ms 760 KB Output is correct
8 Correct 11 ms 760 KB Output is correct
9 Correct 10 ms 888 KB Output is correct
10 Correct 14 ms 760 KB Output is correct
11 Correct 13 ms 892 KB Output is correct
12 Correct 12 ms 888 KB Output is correct
13 Correct 10 ms 760 KB Output is correct
14 Correct 12 ms 760 KB Output is correct
15 Correct 13 ms 888 KB Output is correct
16 Correct 10 ms 760 KB Output is correct
17 Correct 143 ms 1332 KB Output is correct
18 Correct 163 ms 3136 KB Output is correct
19 Correct 98 ms 1400 KB Output is correct
20 Correct 125 ms 1544 KB Output is correct
21 Correct 117 ms 1532 KB Output is correct
22 Correct 71 ms 1400 KB Output is correct
23 Correct 19 ms 888 KB Output is correct
24 Correct 2 ms 504 KB Output is correct
25 Correct 19 ms 888 KB Output is correct
26 Correct 14 ms 1016 KB Output is correct
27 Correct 13 ms 888 KB Output is correct
28 Correct 11 ms 760 KB Output is correct
29 Correct 12 ms 888 KB Output is correct
30 Correct 63 ms 1272 KB Output is correct
31 Correct 63 ms 1400 KB Output is correct
32 Correct 79 ms 1824 KB Output is correct
33 Correct 60 ms 1428 KB Output is correct
34 Correct 59 ms 1400 KB Output is correct
35 Correct 60 ms 1400 KB Output is correct
36 Correct 129 ms 3192 KB Output is correct
37 Correct 2 ms 420 KB Output is correct
38 Correct 2 ms 376 KB Output is correct
39 Correct 59 ms 1276 KB Output is correct
40 Correct 59 ms 1372 KB Output is correct
41 Correct 63 ms 1272 KB Output is correct
42 Correct 59 ms 1400 KB Output is correct
43 Correct 57 ms 1272 KB Output is correct
44 Correct 2 ms 376 KB Output is correct
45 Correct 14 ms 888 KB Output is correct
46 Correct 14 ms 888 KB Output is correct
47 Correct 13 ms 888 KB Output is correct
48 Correct 115 ms 3448 KB Output is correct
49 Correct 115 ms 3420 KB Output is correct
50 Correct 2 ms 376 KB Output is correct
51 Correct 113 ms 1272 KB Output is correct
52 Correct 54 ms 1272 KB Output is correct
53 Correct 57 ms 1272 KB Output is correct
54 Correct 10 ms 760 KB Output is correct
55 Correct 10 ms 760 KB Output is correct
56 Correct 6 ms 888 KB Output is correct
57 Correct 11 ms 888 KB Output is correct
58 Correct 2 ms 376 KB Output is correct
59 Correct 10 ms 844 KB Output is correct
60 Correct 11 ms 760 KB Output is correct
61 Correct 11 ms 760 KB Output is correct
62 Correct 2 ms 504 KB Output is correct
63 Correct 14 ms 912 KB Output is correct