oj.uz

Submission #897833

# Submission time Handle Problem Language Result Execution time Memory
897833 2024-01-03T18:44:05 Z Tenis0206 Travelling Merchant (APIO17_merchant) C++11
100 / 100
 80 ms 2292 KB 
#include <bits/stdc++.h>
#define int long long

using namespace std;

const int nmax = 100;
const int kmax = 1000;
const int oo = INT_MAX;

int n,m,k;

int b[nmax + 5][kmax + 5], s[nmax + 5][kmax + 5];

int d[nmax + 5][nmax + 5], tr[nmax + 5][nmax + 5];

int rez[nmax + 5][nmax + 5];

bool ok(int cost)
{
    for(int i=1; i<=n; i++)
    {
        for(int j=1; j<=n; j++)
        {
            if(tr[i][j] != -oo)
            {
                rez[i][j] = tr[i][j] - d[i][j] * cost;
            }
            else
            {
                rez[i][j] = -oo;
            }
        }
    }
    for(int c=1; c<=n; c++)
    {
        for(int i=1; i<=n; i++)
        {
            for(int j=1; j<=n; j++)
            {
                if(rez[i][c] != -oo && rez[c][j] != -oo)
                {
                    rez[i][j] = max(rez[i][j], rez[i][c] + rez[c][j]);
                }
            }
        }
    }
    for(int i=1; i<=n; i++)
    {
        if(rez[i][i] >= 0)
        {
            return true;
        }
    }
    return false;
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    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 i=1; i<=n; i++)
    {
        for(int j=1; j<=n; j++)
        {
            d[i][j] = oo;
        }
    }
    for(int i=1; i<=m; i++)
    {
        int x,y,c;
        cin>>x>>y>>c;
        d[x][y] = min(d[x][y], c);
    }
    for(int c=1; c<=n; c++)
    {
        for(int i=1; i<=n; i++)
        {
            for(int j=1; j<=n; j++)
            {
                if(d[i][c] != oo && d[c][j] != oo)
                {
                    d[i][j] = min(d[i][j], d[i][c] + d[c][j]);
                }
            }
        }
    }
    for(int i=1; i<=n; i++)
    {
        for(int j=1; j<=n; j++)
        {
            tr[i][j] = 0;
            for(int it=1; it<=k; it++)
            {
                if(b[i][it] == -1 || s[j][it] == -1 || d[i][j] == oo)
                {
                    continue;
                }
                tr[i][j] = max(tr[i][j], s[j][it] - b[i][it]);
            }
        }
    }
    int st = 0;
    int dr = 1e9;
    int rez = 0;
    while(st<=dr)
    {
        int mij = (st + dr) >> 1;
        if(ok(mij))
        {
            rez = mij;
            st = mij + 1;
        }
        else
        {
            dr = mij - 1;
        }
    }
    cout<<rez<<'\n';
    return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 2292 KB Output is correct
2 Correct 38 ms 1496 KB Output is correct
3 Correct 34 ms 1368 KB Output is correct
4 Correct 5 ms 860 KB Output is correct
5 Correct 5 ms 860 KB Output is correct
6 Correct 5 ms 860 KB Output is correct
7 Correct 6 ms 860 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 5 ms 860 KB Output is correct
10 Correct 5 ms 860 KB Output is correct
11 Correct 5 ms 988 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 5 ms 856 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 860 KB Output is correct
2 Correct 6 ms 860 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 5 ms 860 KB Output is correct
5 Correct 5 ms 860 KB Output is correct
6 Correct 5 ms 988 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 5 ms 856 KB Output is correct
9 Correct 5 ms 860 KB Output is correct
10 Correct 5 ms 860 KB Output is correct
11 Correct 5 ms 860 KB Output is correct
12 Correct 4 ms 856 KB Output is correct
13 Correct 5 ms 860 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 5 ms 860 KB Output is correct
16 Correct 6 ms 860 KB Output is correct
17 Correct 6 ms 860 KB Output is correct
18 Correct 5 ms 860 KB Output is correct
19 Correct 5 ms 860 KB Output is correct
20 Correct 5 ms 860 KB Output is correct
21 Correct 6 ms 996 KB Output is correct
22 Correct 5 ms 860 KB Output is correct
23 Correct 5 ms 860 KB Output is correct
24 Correct 5 ms 860 KB Output is correct
25 Correct 5 ms 860 KB Output is correct
26 Correct 0 ms 344 KB Output is correct
27 Correct 5 ms 860 KB Output is correct
28 Correct 5 ms 1024 KB Output is correct
29 Correct 5 ms 860 KB Output is correct
30 Correct 5 ms 860 KB Output is correct
31 Correct 5 ms 860 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 860 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 5 ms 860 KB Output is correct
4 Correct 5 ms 1024 KB Output is correct
5 Correct 5 ms 860 KB Output is correct
6 Correct 5 ms 860 KB Output is correct
7 Correct 5 ms 860 KB Output is correct
8 Correct 36 ms 1628 KB Output is correct
9 Correct 59 ms 2128 KB Output is correct
10 Correct 38 ms 1368 KB Output is correct
11 Correct 37 ms 1624 KB Output is correct
12 Correct 37 ms 1628 KB Output is correct
13 Correct 39 ms 1804 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 860 KB Output is correct
2 Correct 5 ms 860 KB Output is correct
3 Correct 5 ms 860 KB Output is correct
4 Correct 4 ms 856 KB Output is correct
5 Correct 5 ms 860 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 5 ms 860 KB Output is correct
8 Correct 6 ms 860 KB Output is correct
9 Correct 6 ms 860 KB Output is correct
10 Correct 5 ms 860 KB Output is correct
11 Correct 5 ms 860 KB Output is correct
12 Correct 5 ms 860 KB Output is correct
13 Correct 6 ms 996 KB Output is correct
14 Correct 5 ms 860 KB Output is correct
15 Correct 5 ms 860 KB Output is correct
16 Correct 5 ms 860 KB Output is correct
17 Correct 36 ms 1628 KB Output is correct
18 Correct 59 ms 2128 KB Output is correct
19 Correct 38 ms 1368 KB Output is correct
20 Correct 37 ms 1624 KB Output is correct
21 Correct 37 ms 1628 KB Output is correct
22 Correct 39 ms 1804 KB Output is correct
23 Correct 5 ms 860 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 5 ms 860 KB Output is correct
26 Correct 5 ms 1024 KB Output is correct
27 Correct 5 ms 860 KB Output is correct
28 Correct 5 ms 860 KB Output is correct
29 Correct 5 ms 860 KB Output is correct
30 Correct 55 ms 2292 KB Output is correct
31 Correct 38 ms 1496 KB Output is correct
32 Correct 34 ms 1368 KB Output is correct
33 Correct 5 ms 860 KB Output is correct
34 Correct 5 ms 860 KB Output is correct
35 Correct 5 ms 860 KB Output is correct
36 Correct 6 ms 860 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 5 ms 860 KB Output is correct
39 Correct 5 ms 860 KB Output is correct
40 Correct 5 ms 988 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 5 ms 856 KB Output is correct
43 Correct 35 ms 1372 KB Output is correct
44 Correct 37 ms 1628 KB Output is correct
45 Correct 54 ms 2136 KB Output is correct
46 Correct 36 ms 1628 KB Output is correct
47 Correct 38 ms 1628 KB Output is correct
48 Correct 39 ms 1628 KB Output is correct
49 Correct 74 ms 2136 KB Output is correct
50 Correct 1 ms 600 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 35 ms 1372 KB Output is correct
53 Correct 36 ms 1500 KB Output is correct
54 Correct 35 ms 1372 KB Output is correct
55 Correct 35 ms 1548 KB Output is correct
56 Correct 38 ms 1372 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 6 ms 860 KB Output is correct
59 Correct 6 ms 860 KB Output is correct
60 Correct 5 ms 1072 KB Output is correct
61 Correct 78 ms 2276 KB Output is correct
62 Correct 80 ms 2272 KB Output is correct
63 Correct 0 ms 348 KB Output is correct