oj.uz

Submission #874557

# Submission time Handle Problem Language Result Execution time Memory
874557 2023-11-17T09:05:19 Z fdnfksd Travelling Merchant (APIO17_merchant) C++14
100 / 100
 100 ms 4588 KB 
#include<bits/stdc++.h>
#define TASKNAME "codeforce"
#define pb push_back
#define pli pair<ll,ll>
#define fi first
#define se second
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL);
using namespace std;
using ll=long long;
const ll maxN=2e5;
const ll inf=1e18;
const ll mod=1e9+7;
ll n;
ll d[101][101],c[101][101],dis[101][101];
bool check(ll mid)
{
    //sum(v)>=mid*sum(w)
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++)
        {
            dis[i][j]=inf;
        }
    }
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++)
        {
            if(i!=j&&d[i][j]!=inf)
            {
                dis[i][j]=-(c[i][j]-mid*d[i][j]);
            }
        }
    }
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= n; ++j) {
            for (int t = 1; t <= n; ++t) {
                if(dis[j][t]>dis[j][i]+dis[i][t])
                {
                    dis[j][t]=dis[j][i]+dis[i][t];
                }
            }
        }
    }
    for(int i=1;i<=n;i++)
    {
        //cout << dis[i][i]<<' ';
        if(dis[i][i]<=0) return true;
    }
    return false;
}
ll m,k;
bool vis[101];
vector<pli>g[101];

void dij(ll s)
{
    for(int i=1;i<=n;i++) d[s][i]=inf,vis[i]=false;
    d[s][s]=0;
    priority_queue<pli,vector<pli>,greater<pli>>pq;
    pq.push({d[s][s],s});
    while(!pq.empty())
    {
        ll u=pq.top().se;
        pq.pop();
        if(vis[u]==true) continue;
        vis[u]=true;
        for(auto zz:g[u])
        {
            if(d[s][zz.fi]>d[s][u]+zz.se)
            {
                d[s][zz.fi]=d[s][u]+zz.se;
                pq.push({d[s][zz.fi],zz.fi});
            }
        }
    }
}
ll b[101][1001],s[101][1001];

void solve()
{
    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];
        b[i][0]=s[i][0]=0;
    }
    for(int i=1;i<=m;i++)
    {
        ll u,v,w;
        cin >> u >> v >> w;
        g[u].pb({v,w});
    }
    for(int i=1;i<=n;i++)
    {
        dij(i);
    }
    for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) c[i][j]=0;
    for(int i=1;i<=k;i++)
    {
        for(int j=1;j<=n;j++)
        {
            for(int q=1;q<=n;q++)
            {
                if(j!=q&&b[j][i]!=-1&&s[q][i]!=-1)
                {
                    c[j][q]=max(c[j][q],s[q][i]-b[j][i]);
                }
            }
        }
    }
    ll low=0,high=1e9+10;
    while(low<=high)
    {
        ll mid=low+high>>1;
        if(check(mid)) low=mid+1;
        else high=mid-1;
    }
    cout << high;
}
int main()
{
    fastio
    //freopen(TASKNAME".INP","r",stdin);
    //freopen(TASKNAME".OUT","w",stdout);
    solve();
}

Compilation message

merchant.cpp: In function 'void solve()':
merchant.cpp:116:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  116 |         ll mid=low+high>>1;
      |                ~~~^~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 3436 KB Output is correct
2 Correct 22 ms 1372 KB Output is correct
3 Correct 23 ms 1372 KB Output is correct
4 Correct 4 ms 1112 KB Output is correct
5 Correct 4 ms 1000 KB Output is correct
6 Correct 4 ms 856 KB Output is correct
7 Correct 5 ms 860 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 4 ms 860 KB Output is correct
10 Correct 4 ms 940 KB Output is correct
11 Correct 4 ms 860 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 4 ms 860 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 856 KB Output is correct
2 Correct 5 ms 860 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 4 ms 860 KB Output is correct
5 Correct 4 ms 940 KB Output is correct
6 Correct 4 ms 860 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 4 ms 860 KB Output is correct
9 Correct 5 ms 860 KB Output is correct
10 Correct 4 ms 860 KB Output is correct
11 Correct 4 ms 856 KB Output is correct
12 Correct 4 ms 860 KB Output is correct
13 Correct 8 ms 860 KB Output is correct
14 Correct 1 ms 600 KB Output is correct
15 Correct 4 ms 856 KB Output is correct
16 Correct 7 ms 1052 KB Output is correct
17 Correct 4 ms 1020 KB Output is correct
18 Correct 4 ms 860 KB Output is correct
19 Correct 6 ms 1084 KB Output is correct
20 Correct 5 ms 860 KB Output is correct
21 Correct 6 ms 860 KB Output is correct
22 Correct 5 ms 860 KB Output is correct
23 Correct 6 ms 1116 KB Output is correct
24 Correct 4 ms 860 KB Output is correct
25 Correct 11 ms 1056 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 11 ms 1084 KB Output is correct
28 Correct 7 ms 860 KB Output is correct
29 Correct 8 ms 996 KB Output is correct
30 Correct 4 ms 1072 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 11 ms 1056 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 11 ms 1084 KB Output is correct
4 Correct 7 ms 860 KB Output is correct
5 Correct 8 ms 996 KB Output is correct
6 Correct 4 ms 1072 KB Output is correct
7 Correct 5 ms 860 KB Output is correct
8 Correct 72 ms 1776 KB Output is correct
9 Correct 100 ms 3920 KB Output is correct
10 Correct 55 ms 1660 KB Output is correct
11 Correct 78 ms 1628 KB Output is correct
12 Correct 79 ms 1880 KB Output is correct
13 Correct 34 ms 1624 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 4 ms 860 KB Output is correct
3 Correct 4 ms 856 KB Output is correct
4 Correct 4 ms 860 KB Output is correct
5 Correct 8 ms 860 KB Output is correct
6 Correct 1 ms 600 KB Output is correct
7 Correct 4 ms 856 KB Output is correct
8 Correct 7 ms 1052 KB Output is correct
9 Correct 4 ms 1020 KB Output is correct
10 Correct 4 ms 860 KB Output is correct
11 Correct 6 ms 1084 KB Output is correct
12 Correct 5 ms 860 KB Output is correct
13 Correct 6 ms 860 KB Output is correct
14 Correct 5 ms 860 KB Output is correct
15 Correct 6 ms 1116 KB Output is correct
16 Correct 4 ms 860 KB Output is correct
17 Correct 72 ms 1776 KB Output is correct
18 Correct 100 ms 3920 KB Output is correct
19 Correct 55 ms 1660 KB Output is correct
20 Correct 78 ms 1628 KB Output is correct
21 Correct 79 ms 1880 KB Output is correct
22 Correct 34 ms 1624 KB Output is correct
23 Correct 11 ms 1056 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 11 ms 1084 KB Output is correct
26 Correct 7 ms 860 KB Output is correct
27 Correct 8 ms 996 KB Output is correct
28 Correct 4 ms 1072 KB Output is correct
29 Correct 5 ms 860 KB Output is correct
30 Correct 42 ms 3436 KB Output is correct
31 Correct 22 ms 1372 KB Output is correct
32 Correct 23 ms 1372 KB Output is correct
33 Correct 4 ms 1112 KB Output is correct
34 Correct 4 ms 1000 KB Output is correct
35 Correct 4 ms 856 KB Output is correct
36 Correct 5 ms 860 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 4 ms 860 KB Output is correct
39 Correct 4 ms 940 KB Output is correct
40 Correct 4 ms 860 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 4 ms 860 KB Output is correct
43 Correct 32 ms 1532 KB Output is correct
44 Correct 27 ms 1756 KB Output is correct
45 Correct 47 ms 2900 KB Output is correct
46 Correct 26 ms 1624 KB Output is correct
47 Correct 25 ms 1628 KB Output is correct
48 Correct 26 ms 1768 KB Output is correct
49 Correct 76 ms 4148 KB Output is correct
50 Correct 0 ms 344 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Correct 26 ms 1372 KB Output is correct
53 Correct 25 ms 1884 KB Output is correct
54 Correct 25 ms 1372 KB Output is correct
55 Correct 24 ms 1372 KB Output is correct
56 Correct 24 ms 1372 KB Output is correct
57 Correct 1 ms 344 KB Output is correct
58 Correct 6 ms 1160 KB Output is correct
59 Correct 6 ms 988 KB Output is correct
60 Correct 5 ms 1116 KB Output is correct
61 Correct 73 ms 4588 KB Output is correct
62 Correct 65 ms 4500 KB Output is correct
63 Correct 1 ms 344 KB Output is correct