oj.uz

답안 #466457

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
466457 2021-08-19T10:22:56 Z Killer2501 여행하는 상인 (APIO17_merchant) C++14
100 / 100
 160 ms 4292 KB 
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define task "262144"
#define pll pair<ll, ll>
#define pi pair<pll, pll>
#define fi first
#define se second

using namespace std;
const ll mod = 1e16;
const ll N = 1e2+5;
const int base = 313;
ll n, m, t, k, T, ans, tong, a[N], c[N][N], dp[N][N], b[N][N*10], s[N][N*10], w[N][N];
vector<ll> adj[N];
vector<ll> kq;
ll pw(ll k, ll n)
{
    ll total = 1;
    for(; n; n >>= 1)
    {
        if(n & 1)total = total * k % mod;
        k = k * k % mod;
    }
    return total;
}
bool check(ll x)
{
    for(int i = 1; i <= n; i ++)
    {
        for(int j = 1; j <= n; j ++)
        {
            dp[i][j] = c[i][j] - min(w[i][j], mod/x) * x;
        }
    }
    for(int p = 1; p <= n; p ++)
    {
        for(int i = 1; i <= n; i ++)
        {
            for(int j = 1; j <= n; j ++)
            {
                dp[i][j] = min(mod,max(dp[i][j], dp[i][p] + dp[p][j]));
            }
        }
    }
    for(int i = 1; i <= n; i ++)
    {
        for(int j = 1; j <= n; j ++)
        {
            if(i == j || dp[i][j] == -mod || dp[j][i] == -mod)continue;
            if(dp[i][j] + dp[j][i] >= 0)return true;
        }
    }
    return false;
}
void sol()
{
    cin >> n >> m >> k;
    for(int i = 1; i <= n; i ++)
    {
        for(int j = 1; j <= k; j ++)cin >> b[i][j] >> s[i][j];
        for(int j = 1; j <= n; j ++)
        {
            if(i == j)continue;
            w[i][j] = mod;
        }
    }
    while(m -- > 0)
    {
        ll x, y;
        cin >> x >> y;
        cin >> w[x][y];
    }
    for(int p = 1; p <= n; p ++)
    {
        for(int i = 1; i <= n; i ++)
        {
            for(int j = 1; j <= n; j ++)
            {
                w[i][j] = min(w[i][j], w[i][p]+w[p][j]);
            }
            for(int j = 1; j <= k; j ++)
            {
                if(s[p][j] == -1 || b[i][j] == -1)continue;
                c[i][p] = max(c[i][p], s[p][j]-b[i][j]);
            }
        }
    }
    //for(int i = 1; i <= n; i ++)for(int j = 1; j <= n; j ++)cout << w[i][j] << " " << c[i][j] << '\n';
    ll lf = 1, rt = mod, mid;
    while(lf <= rt)
    {
        mid = (lf + rt) / 2;
        if(check(mid))lf = mid + 1;
        else rt = mid - 1;
    }
    cout << rt;
}
int main()
{
    if(fopen(task".in", "r"))
    {
       freopen(task".in", "r", stdin);
       freopen(task".out", "w", stdout);
    }
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int ntest = 1;
    //cin >> ntest;
    while(ntest -- > 0)
    sol();
}
/*
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

*/

Compilation message

merchant.cpp: In function 'int main()':
merchant.cpp:103:15: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  103 |        freopen(task".in", "r", stdin);
      |        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
merchant.cpp:104:15: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  104 |        freopen(task".out", "w", stdout);
      |        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 122 ms 2116 KB Output is correct
2 Correct 88 ms 1228 KB Output is correct
3 Correct 88 ms 1228 KB Output is correct
4 Correct 13 ms 844 KB Output is correct
5 Correct 13 ms 716 KB Output is correct
6 Correct 13 ms 820 KB Output is correct
7 Correct 13 ms 864 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 13 ms 716 KB Output is correct
10 Correct 13 ms 824 KB Output is correct
11 Correct 13 ms 716 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 14 ms 860 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 820 KB Output is correct
2 Correct 13 ms 864 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 13 ms 716 KB Output is correct
5 Correct 13 ms 824 KB Output is correct
6 Correct 13 ms 716 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 14 ms 860 KB Output is correct
9 Correct 14 ms 884 KB Output is correct
10 Correct 13 ms 856 KB Output is correct
11 Correct 15 ms 844 KB Output is correct
12 Correct 12 ms 844 KB Output is correct
13 Correct 15 ms 844 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 13 ms 856 KB Output is correct
16 Correct 14 ms 900 KB Output is correct
17 Correct 14 ms 844 KB Output is correct
18 Correct 13 ms 896 KB Output is correct
19 Correct 18 ms 900 KB Output is correct
20 Correct 14 ms 904 KB Output is correct
21 Correct 13 ms 844 KB Output is correct
22 Correct 13 ms 880 KB Output is correct
23 Correct 14 ms 904 KB Output is correct
24 Correct 13 ms 852 KB Output is correct
25 Correct 15 ms 844 KB Output is correct
26 Correct 0 ms 332 KB Output is correct
27 Correct 14 ms 844 KB Output is correct
28 Correct 14 ms 900 KB Output is correct
29 Correct 15 ms 904 KB Output is correct
30 Correct 13 ms 860 KB Output is correct
31 Correct 13 ms 856 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 844 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 14 ms 844 KB Output is correct
4 Correct 14 ms 900 KB Output is correct
5 Correct 15 ms 904 KB Output is correct
6 Correct 13 ms 860 KB Output is correct
7 Correct 13 ms 856 KB Output is correct
8 Correct 94 ms 1520 KB Output is correct
9 Correct 150 ms 2204 KB Output is correct
10 Correct 93 ms 1512 KB Output is correct
11 Correct 96 ms 1740 KB Output is correct
12 Correct 101 ms 1736 KB Output is correct
13 Correct 92 ms 1452 KB Output is correct

Subtask #4
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 884 KB Output is correct
2 Correct 13 ms 856 KB Output is correct
3 Correct 15 ms 844 KB Output is correct
4 Correct 12 ms 844 KB Output is correct
5 Correct 15 ms 844 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 13 ms 856 KB Output is correct
8 Correct 14 ms 900 KB Output is correct
9 Correct 14 ms 844 KB Output is correct
10 Correct 13 ms 896 KB Output is correct
11 Correct 18 ms 900 KB Output is correct
12 Correct 14 ms 904 KB Output is correct
13 Correct 13 ms 844 KB Output is correct
14 Correct 13 ms 880 KB Output is correct
15 Correct 14 ms 904 KB Output is correct
16 Correct 13 ms 852 KB Output is correct
17 Correct 94 ms 1520 KB Output is correct
18 Correct 150 ms 2204 KB Output is correct
19 Correct 93 ms 1512 KB Output is correct
20 Correct 96 ms 1740 KB Output is correct
21 Correct 101 ms 1736 KB Output is correct
22 Correct 92 ms 1452 KB Output is correct
23 Correct 15 ms 844 KB Output is correct
24 Correct 0 ms 332 KB Output is correct
25 Correct 14 ms 844 KB Output is correct
26 Correct 14 ms 900 KB Output is correct
27 Correct 15 ms 904 KB Output is correct
28 Correct 13 ms 860 KB Output is correct
29 Correct 13 ms 856 KB Output is correct
30 Correct 122 ms 2116 KB Output is correct
31 Correct 88 ms 1228 KB Output is correct
32 Correct 88 ms 1228 KB Output is correct
33 Correct 13 ms 844 KB Output is correct
34 Correct 13 ms 716 KB Output is correct
35 Correct 13 ms 820 KB Output is correct
36 Correct 13 ms 864 KB Output is correct
37 Correct 0 ms 332 KB Output is correct
38 Correct 13 ms 716 KB Output is correct
39 Correct 13 ms 824 KB Output is correct
40 Correct 13 ms 716 KB Output is correct
41 Correct 1 ms 332 KB Output is correct
42 Correct 14 ms 860 KB Output is correct
43 Correct 91 ms 1404 KB Output is correct
44 Correct 94 ms 1608 KB Output is correct
45 Correct 112 ms 2620 KB Output is correct
46 Correct 92 ms 1584 KB Output is correct
47 Correct 93 ms 1612 KB Output is correct
48 Correct 111 ms 1612 KB Output is correct
49 Correct 152 ms 4060 KB Output is correct
50 Correct 1 ms 332 KB Output is correct
51 Correct 1 ms 332 KB Output is correct
52 Correct 89 ms 1356 KB Output is correct
53 Correct 116 ms 1484 KB Output is correct
54 Correct 90 ms 1460 KB Output is correct
55 Correct 91 ms 1356 KB Output is correct
56 Correct 90 ms 1332 KB Output is correct
57 Correct 1 ms 332 KB Output is correct
58 Correct 15 ms 972 KB Output is correct
59 Correct 15 ms 1040 KB Output is correct
60 Correct 20 ms 972 KB Output is correct
61 Correct 160 ms 4176 KB Output is correct
62 Correct 155 ms 4292 KB Output is correct
63 Correct 1 ms 332 KB Output is correct