oj.uz

Submission #571091

# Submission time Handle Problem Language Result Execution time Memory
571091 2022-06-01T08:39:33 Z YouAreMyGalaxy Travelling Merchant (APIO17_merchant) C++17
100 / 100
 100 ms 3336 KB 
//Make CSP great again
//Vengeance
#include <bits/stdc++.h>
#define TASK "TESTCODE"
#define Log2(x) 31 - __builtin_clz(x)
using namespace std;
const int N = 1e2, K = 1e3, oo = 2e9;
int d[N + 1][N + 1], prof[N + 1][N + 1];
int n, m, k, b[N + 1][K + 1], s[N + 1][K + 1];
long long dp[N + 1][N + 1];
void read()
{
    cin >> n >> m >> k;
    memset(d, 0x3f, sizeof(d));
    for (int i = 1; i <= n; ++ i)
    {
        //d[i][i] = 0;
        for (int j = 1; j <= k; ++ j)
        {
            cin >> b[i][j] >> s[i][j];
        }
    }
    for (int i = 1; i <= m; ++ i)
    {
        int u, v, w;
        cin >> u >> v >> w;
        d[u][v] = min(d[u][v], w);
    }
}
bool check(int x)
{
    for (int i = 1; i <= n; ++ i)
    {
        for (int j = 1; j <= n; ++ j)
        {
            dp[i][j] =  prof[i][j] - 1LL * x * d[i][j];
            //cerr << dp[i][j] << ' ';
        }
        //cerr << '\n';
    }
    for (int k = 1; k <= n; ++ k)
    {
        for (int i = 1; i <= n; ++ i)
        {
            for (int j = 1; j <= n; ++ j)
            {
                dp[i][j] = max(dp[i][j], dp[i][k] + dp[k][j]);
            }
        }
    }
    /*cerr << '\n';
    for (int i = 1; i <= n; ++ i)
    {
        for (int j = 1; j <= n; ++ j)
        {
            cerr << dp[i][j] << ' ';
        }
        cerr << '\n';
    }*/
    for (int i = 1; i <= n; ++ i)
    {
        if (dp[i][i] >= 0)
        {
            return true;
        }
    }
    return false;
}
void solve()
{
    for (int k = 1; k <= n; ++ k)
    {
        for (int i = 1; i <= n; ++ i)
        {
            for (int j = 1; j <= n; ++ j)
            {
                d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
            }
        }
    }
    for (int i = 1; i <= n; ++ i)
    {
        for (int j = 1; j <= n; ++ j)
        {
            prof[i][j] = 0;
            for (int l = 1; l <= k; ++ l)
            {
                if (b[i][l] < 0 || s[j][l] < 0)
                {
                    continue;
                }
                prof[i][j] = max(prof[i][j], s[j][l] - b[i][l]);
            }
        }
    }
    int low = 1, high = 1e9;
    while(low <= high)
    {
        int mid = (low + high)/2;
        if (check(mid))
        {
            low = mid + 1;
        }
        else
        {
            high = mid - 1;
        }
    }
    cout << high;
    //cout << check(2);
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    if (fopen(TASK".INP", "r"))
    {
        freopen(TASK".INP", "r", stdin);
        //freopen(TASK".OUT", "w", stdout);
    }
    int t = 1;
    bool typetest = false;
    if (typetest)
    {
        cin >> t;
    }
    for (int __ = 1; __ <= t; ++ __)
    {
        //cout << "Case " << __ << ": ";
        read();
        solve();
    }
}

Compilation message

merchant.cpp: In function 'int main()':
merchant.cpp:118:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  118 |         freopen(TASK".INP", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 2424 KB Output is correct
2 Correct 31 ms 1260 KB Output is correct
3 Correct 31 ms 1236 KB Output is correct
4 Correct 6 ms 892 KB Output is correct
5 Correct 6 ms 724 KB Output is correct
6 Correct 5 ms 724 KB Output is correct
7 Correct 6 ms 852 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 7 ms 724 KB Output is correct
10 Correct 6 ms 852 KB Output is correct
11 Correct 6 ms 724 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 7 ms 852 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 724 KB Output is correct
2 Correct 6 ms 852 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 7 ms 724 KB Output is correct
5 Correct 6 ms 852 KB Output is correct
6 Correct 6 ms 724 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 7 ms 852 KB Output is correct
9 Correct 9 ms 732 KB Output is correct
10 Correct 6 ms 724 KB Output is correct
11 Correct 6 ms 724 KB Output is correct
12 Correct 6 ms 724 KB Output is correct
13 Correct 6 ms 880 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 7 ms 728 KB Output is correct
16 Correct 6 ms 724 KB Output is correct
17 Correct 7 ms 724 KB Output is correct
18 Correct 5 ms 724 KB Output is correct
19 Correct 6 ms 860 KB Output is correct
20 Correct 6 ms 756 KB Output is correct
21 Correct 5 ms 736 KB Output is correct
22 Correct 5 ms 852 KB Output is correct
23 Correct 7 ms 888 KB Output is correct
24 Correct 5 ms 724 KB Output is correct
25 Correct 6 ms 860 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 9 ms 880 KB Output is correct
28 Correct 7 ms 852 KB Output is correct
29 Correct 7 ms 860 KB Output is correct
30 Correct 6 ms 848 KB Output is correct
31 Correct 6 ms 712 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 860 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 9 ms 880 KB Output is correct
4 Correct 7 ms 852 KB Output is correct
5 Correct 7 ms 860 KB Output is correct
6 Correct 6 ms 848 KB Output is correct
7 Correct 6 ms 712 KB Output is correct
8 Correct 36 ms 1412 KB Output is correct
9 Correct 80 ms 3260 KB Output is correct
10 Correct 36 ms 1364 KB Output is correct
11 Correct 42 ms 1408 KB Output is correct
12 Correct 53 ms 1364 KB Output is correct
13 Correct 33 ms 1236 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 732 KB Output is correct
2 Correct 6 ms 724 KB Output is correct
3 Correct 6 ms 724 KB Output is correct
4 Correct 6 ms 724 KB Output is correct
5 Correct 6 ms 880 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 7 ms 728 KB Output is correct
8 Correct 6 ms 724 KB Output is correct
9 Correct 7 ms 724 KB Output is correct
10 Correct 5 ms 724 KB Output is correct
11 Correct 6 ms 860 KB Output is correct
12 Correct 6 ms 756 KB Output is correct
13 Correct 5 ms 736 KB Output is correct
14 Correct 5 ms 852 KB Output is correct
15 Correct 7 ms 888 KB Output is correct
16 Correct 5 ms 724 KB Output is correct
17 Correct 36 ms 1412 KB Output is correct
18 Correct 80 ms 3260 KB Output is correct
19 Correct 36 ms 1364 KB Output is correct
20 Correct 42 ms 1408 KB Output is correct
21 Correct 53 ms 1364 KB Output is correct
22 Correct 33 ms 1236 KB Output is correct
23 Correct 6 ms 860 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 9 ms 880 KB Output is correct
26 Correct 7 ms 852 KB Output is correct
27 Correct 7 ms 860 KB Output is correct
28 Correct 6 ms 848 KB Output is correct
29 Correct 6 ms 712 KB Output is correct
30 Correct 57 ms 2424 KB Output is correct
31 Correct 31 ms 1260 KB Output is correct
32 Correct 31 ms 1236 KB Output is correct
33 Correct 6 ms 892 KB Output is correct
34 Correct 6 ms 724 KB Output is correct
35 Correct 5 ms 724 KB Output is correct
36 Correct 6 ms 852 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 7 ms 724 KB Output is correct
39 Correct 6 ms 852 KB Output is correct
40 Correct 6 ms 724 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 7 ms 852 KB Output is correct
43 Correct 33 ms 1236 KB Output is correct
44 Correct 41 ms 1236 KB Output is correct
45 Correct 55 ms 1744 KB Output is correct
46 Correct 38 ms 1328 KB Output is correct
47 Correct 51 ms 1236 KB Output is correct
48 Correct 35 ms 1332 KB Output is correct
49 Correct 88 ms 3112 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 42 ms 1236 KB Output is correct
53 Correct 52 ms 1396 KB Output is correct
54 Correct 38 ms 1296 KB Output is correct
55 Correct 32 ms 1236 KB Output is correct
56 Correct 33 ms 1272 KB Output is correct
57 Correct 1 ms 328 KB Output is correct
58 Correct 7 ms 852 KB Output is correct
59 Correct 9 ms 928 KB Output is correct
60 Correct 8 ms 852 KB Output is correct
61 Correct 100 ms 3336 KB Output is correct
62 Correct 91 ms 3304 KB Output is correct
63 Correct 1 ms 340 KB Output is correct