oj.uz

Submission #874566

# Submission time Handle Problem Language Result Execution time Memory
874566 2023-11-17T09:49:57 Z amogususus Travelling Merchant (APIO17_merchant) C++17
100 / 100
 59 ms 3644 KB 
#pragma GCC optimize("O2,unroll-loops,inline")
#pragma GCC target("avx2,bmi,bmi2,popcnt")
#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define pb push_back
#define endl '\n'
#define all(x) x.begin(),x.end()
#define pll pair<ll,ll>
#define plll pair<pll,pll>
#define open(name) if(fopen(name".inp", "r")){freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout);}
using namespace std;
const int maxN=102;
const int mod=998244353;
ll n,m,k,a[maxN][1002],b[maxN][1002],d[maxN][maxN],c[maxN][maxN],dis[maxN][maxN];
vector<pll> adj[maxN];
void dijkstra(ll s){
    priority_queue<pll,vector<pll>,greater<pll>> pq;
    memset(d[s],1,sizeof d[s]);
    pq.push({0,s});d[s][s]=0;
    while(!pq.empty()){
        ll dist=pq.top().first,u=pq.top().second;pq.pop();
        if(d[s][u]<dist)continue;
        for(auto x:adj[u]){
            ll v=x.first,w=x.second;
            if(d[s][v]>d[s][u]+w)d[s][v]=d[s][u]+w,pq.push({d[s][v],v});
        }
    }
}
bool check(ll x){
    for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)
        if(i!=j&&d[i][j]<1e12)dis[i][j]=x*d[i][j]-c[i][j];
        else dis[i][j]=1e18;
    for(int k=1;k<=n;k++)for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)
        dis[i][j]=min(dis[i][j],dis[i][k]+dis[k][j]);
    for(int i=1;i<=n;i++)if(dis[i][i]<=0)return 1;
    return 0;
}
void Enter(){
    cin>>n>>m>>k;
    for(int i=1;i<=n;i++)for(int j=1;j<=k;j++)cin>>a[i][j]>>b[i][j];
    for(int i=1;i<=m;i++){
        ll u,v,w;cin>>u>>v>>w;
        adj[u].pb({v,w});
    }
    for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)for(int z=1;z<=k;z++)if(b[j][z]!=-1&&a[i][z]!=-1)c[i][j]=max(c[i][j],b[j][z]-a[i][z]);
    for(int i=1;i<=n;i++)dijkstra(i);
    ll l=0,r=1e9+2;
    while(l<r){
        ll mid=l+r>>1;
        if(check(mid))l=mid+1;
        else r=mid;
    }
    cout<<l-1;
}
//amogus
signed main(){
    //open("tbrackets");
    cin.tie(nullptr);ios_base::sync_with_stdio(NULL);
    //ll t=1;cin>>t;while(t--)
    Enter();
}

Compilation message

merchant.cpp: In function 'void Enter()':
merchant.cpp:50:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   50 |         ll mid=l+r>>1;
      |                ~^~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 2952 KB Output is correct
2 Correct 24 ms 1372 KB Output is correct
3 Correct 24 ms 1372 KB Output is correct
4 Correct 4 ms 860 KB Output is correct
5 Correct 4 ms 860 KB Output is correct
6 Correct 4 ms 856 KB Output is correct
7 Correct 4 ms 860 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 3 ms 956 KB Output is correct
10 Correct 4 ms 860 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 4 ms 860 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 3 ms 956 KB Output is correct
5 Correct 4 ms 860 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 4 ms 856 KB Output is correct
10 Correct 4 ms 860 KB Output is correct
11 Correct 4 ms 860 KB Output is correct
12 Correct 4 ms 860 KB Output is correct
13 Correct 4 ms 860 KB Output is correct
14 Correct 0 ms 460 KB Output is correct
15 Correct 4 ms 860 KB Output is correct
16 Correct 4 ms 856 KB Output is correct
17 Correct 4 ms 976 KB Output is correct
18 Correct 5 ms 1048 KB Output is correct
19 Correct 5 ms 860 KB Output is correct
20 Correct 4 ms 860 KB Output is correct
21 Correct 4 ms 860 KB Output is correct
22 Correct 4 ms 860 KB Output is correct
23 Correct 4 ms 1116 KB Output is correct
24 Correct 4 ms 1004 KB Output is correct
25 Correct 4 ms 860 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 4 ms 904 KB Output is correct
28 Correct 5 ms 988 KB Output is correct
29 Correct 4 ms 860 KB Output is correct
30 Correct 4 ms 860 KB Output is correct
31 Correct 4 ms 860 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 860 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 4 ms 904 KB Output is correct
4 Correct 5 ms 988 KB Output is correct
5 Correct 4 ms 860 KB Output is correct
6 Correct 4 ms 860 KB Output is correct
7 Correct 4 ms 860 KB Output is correct
8 Correct 26 ms 1796 KB Output is correct
9 Correct 48 ms 3124 KB Output is correct
10 Correct 26 ms 1624 KB Output is correct
11 Correct 27 ms 1876 KB Output is correct
12 Correct 26 ms 1624 KB Output is correct
13 Correct 27 ms 1628 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 856 KB Output is correct
2 Correct 4 ms 860 KB Output is correct
3 Correct 4 ms 860 KB Output is correct
4 Correct 4 ms 860 KB Output is correct
5 Correct 4 ms 860 KB Output is correct
6 Correct 0 ms 460 KB Output is correct
7 Correct 4 ms 860 KB Output is correct
8 Correct 4 ms 856 KB Output is correct
9 Correct 4 ms 976 KB Output is correct
10 Correct 5 ms 1048 KB Output is correct
11 Correct 5 ms 860 KB Output is correct
12 Correct 4 ms 860 KB Output is correct
13 Correct 4 ms 860 KB Output is correct
14 Correct 4 ms 860 KB Output is correct
15 Correct 4 ms 1116 KB Output is correct
16 Correct 4 ms 1004 KB Output is correct
17 Correct 26 ms 1796 KB Output is correct
18 Correct 48 ms 3124 KB Output is correct
19 Correct 26 ms 1624 KB Output is correct
20 Correct 27 ms 1876 KB Output is correct
21 Correct 26 ms 1624 KB Output is correct
22 Correct 27 ms 1628 KB Output is correct
23 Correct 4 ms 860 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 4 ms 904 KB Output is correct
26 Correct 5 ms 988 KB Output is correct
27 Correct 4 ms 860 KB Output is correct
28 Correct 4 ms 860 KB Output is correct
29 Correct 4 ms 860 KB Output is correct
30 Correct 45 ms 2952 KB Output is correct
31 Correct 24 ms 1372 KB Output is correct
32 Correct 24 ms 1372 KB Output is correct
33 Correct 4 ms 860 KB Output is correct
34 Correct 4 ms 860 KB Output is correct
35 Correct 4 ms 856 KB Output is correct
36 Correct 4 ms 860 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 3 ms 956 KB Output is correct
39 Correct 4 ms 860 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 24 ms 1776 KB Output is correct
44 Correct 25 ms 1628 KB Output is correct
45 Correct 35 ms 2748 KB Output is correct
46 Correct 25 ms 1624 KB Output is correct
47 Correct 26 ms 1756 KB Output is correct
48 Correct 26 ms 1624 KB Output is correct
49 Correct 51 ms 3552 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 24 ms 1540 KB Output is correct
53 Correct 26 ms 1868 KB Output is correct
54 Correct 25 ms 1372 KB Output is correct
55 Correct 25 ms 1372 KB Output is correct
56 Correct 25 ms 1368 KB Output is correct
57 Correct 1 ms 348 KB Output is correct
58 Correct 5 ms 1188 KB Output is correct
59 Correct 6 ms 1368 KB Output is correct
60 Correct 5 ms 1152 KB Output is correct
61 Correct 59 ms 3644 KB Output is correct
62 Correct 58 ms 3596 KB Output is correct
63 Correct 0 ms 344 KB Output is correct