oj.uz

Submission #544898

# Submission time Handle Problem Language Result Execution time Memory
544898 2022-04-03T05:33:40 Z zaneyu Travelling Merchant (APIO17_merchant) C++14
100 / 100
 123 ms 3764 KB 
/*input
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

*/
#include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<long long,null_type,less_equal<long long>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("bmi,bmi2,lzcnt,popcnt")

//order_of_key #of elements less than x
// find_by_order kth element
using ll=long long;
using ld=long double;
using pii=pair<ll,ll>;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()),c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
const ll maxn=2e3+5;
const ll maxlg=__lg(maxn)+2;
const ll INF64=4e18;
const int INF=0x3f3f3f3f;
const ll MOD=998244353;
const ld PI=acos(-1);
const ld eps=1e-6;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
template<typename T1,typename T2>
ostream& operator<<(ostream& out,pair<T1,T2> P){
    out<<P.f<<' '<<P.s;
    return out;
}
template<typename T>
ostream& operator<<(ostream& out,vector<T> V){
    REP(i,sz(V)) out<<V[i]<<((i!=sz(V)-1)?" ":"");
    return out;
}
ll mult(ll a,ll b){
    return a*b%MOD;
}
ll mypow(ll a,ll b){
    a%=MOD;
    if(a==0) return 0;
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1) res=(res*a)%MOD;
        a=(a*a)%MOD;
        b>>=1;
    }
    return res;
}
int arr[105][maxn];
int n,m,k;
vector<pair<int,pii>> ed;
ll dist[105][105];
ll d[105][105];
ll add[105][105];
bool wk(ll mid){
    REP(i,n) REP(j,n){
        if(d[i][j]==INF64) dist[i][j]=-INF64;
        else dist[i][j]=add[i][j]-d[i][j]*mid;
    }
    REP(k,n) REP(i,n) REP(j,n) MXTO(dist[i][j],dist[i][k]+dist[k][j]);
    //REP(i,n) REP(j,n) cout<<i<<' '<<j<<' '<<dist[i][j]<<'\n';
    REP(i,n) if(dist[i][i]>=0){
        return true;
    }
    return false;
}
int32_t main(){
    ios::sync_with_stdio(false),cin.tie(0);
    cin>>n>>m>>k;
    REP(i,n) REP(j,2*k) cin>>arr[i][j];
    REP(i,n) REP(j,n) d[i][j]=INF64;
    REP(i,m){
        int a,b,c;
        cin>>a>>b>>c;
        --a,--b;
        ed.pb({c,{a,b}});
        d[a][b]=c;
    }
    REP(k,n) REP(i,n) REP(j,n) MNTO(d[i][j],d[i][k]+d[k][j]);
    //REP(i,n) REP(j,n) cout<<i<<' '<<j<<' '<<d[i][j]<<'\n';
    REP(i,n){
        REP(j,n){
            add[i][j]=0;
            REP(a,k){
                if(arr[i][a*2]!=-1 and arr[j][a*2+1]!=-1) MXTO(add[i][j],arr[j][a*2+1]-arr[i][a*2]);
            }
            //cout<<i<<' '<<j<<' '<<add[i][j]<<'\n';
        }
    }
    ll l=0,r=INF;
    while(l<r){
        ll mid=(l+r+1)/2;
        if(wk(mid)) l=mid;
        else r=mid-1;
    }
    cout<<l;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 2532 KB Output is correct
2 Correct 29 ms 980 KB Output is correct
3 Correct 38 ms 972 KB Output is correct
4 Correct 5 ms 596 KB Output is correct
5 Correct 5 ms 596 KB Output is correct
6 Correct 5 ms 596 KB Output is correct
7 Correct 19 ms 596 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 4 ms 596 KB Output is correct
10 Correct 18 ms 596 KB Output is correct
11 Correct 5 ms 676 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 18 ms 724 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 724 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 5 ms 724 KB Output is correct
4 Correct 6 ms 728 KB Output is correct
5 Correct 6 ms 728 KB Output is correct
6 Correct 6 ms 724 KB Output is correct
7 Correct 5 ms 676 KB Output is correct
8 Correct 33 ms 1108 KB Output is correct
9 Correct 82 ms 3136 KB Output is correct
10 Correct 33 ms 1120 KB Output is correct
11 Correct 36 ms 1156 KB Output is correct
12 Correct 58 ms 1280 KB Output is correct
13 Correct 33 ms 1132 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 596 KB Output is correct
2 Correct 6 ms 672 KB Output is correct
3 Correct 5 ms 596 KB Output is correct
4 Correct 19 ms 664 KB Output is correct
5 Correct 10 ms 724 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 5 ms 596 KB Output is correct
8 Correct 5 ms 600 KB Output is correct
9 Correct 5 ms 596 KB Output is correct
10 Correct 7 ms 712 KB Output is correct
11 Correct 8 ms 724 KB Output is correct
12 Correct 7 ms 732 KB Output is correct
13 Correct 5 ms 724 KB Output is correct
14 Correct 19 ms 596 KB Output is correct
15 Correct 6 ms 852 KB Output is correct
16 Correct 4 ms 596 KB Output is correct
17 Correct 33 ms 1108 KB Output is correct
18 Correct 82 ms 3136 KB Output is correct
19 Correct 33 ms 1120 KB Output is correct
20 Correct 36 ms 1156 KB Output is correct
21 Correct 58 ms 1280 KB Output is correct
22 Correct 33 ms 1132 KB Output is correct
23 Correct 5 ms 724 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 5 ms 724 KB Output is correct
26 Correct 6 ms 728 KB Output is correct
27 Correct 6 ms 728 KB Output is correct
28 Correct 6 ms 724 KB Output is correct
29 Correct 5 ms 676 KB Output is correct
30 Correct 63 ms 2532 KB Output is correct
31 Correct 29 ms 980 KB Output is correct
32 Correct 38 ms 972 KB Output is correct
33 Correct 5 ms 596 KB Output is correct
34 Correct 5 ms 596 KB Output is correct
35 Correct 5 ms 596 KB Output is correct
36 Correct 19 ms 596 KB Output is correct
37 Correct 1 ms 340 KB Output is correct
38 Correct 4 ms 596 KB Output is correct
39 Correct 18 ms 596 KB Output is correct
40 Correct 5 ms 676 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 18 ms 724 KB Output is correct
43 Correct 43 ms 980 KB Output is correct
44 Correct 41 ms 1108 KB Output is correct
45 Correct 46 ms 1840 KB Output is correct
46 Correct 32 ms 1108 KB Output is correct
47 Correct 33 ms 1176 KB Output is correct
48 Correct 45 ms 1108 KB Output is correct
49 Correct 98 ms 3340 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 1 ms 336 KB Output is correct
52 Correct 28 ms 980 KB Output is correct
53 Correct 34 ms 1488 KB Output is correct
54 Correct 32 ms 980 KB Output is correct
55 Correct 36 ms 1024 KB Output is correct
56 Correct 32 ms 980 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 7 ms 724 KB Output is correct
59 Correct 7 ms 724 KB Output is correct
60 Correct 7 ms 724 KB Output is correct
61 Correct 123 ms 3764 KB Output is correct
62 Correct 92 ms 3756 KB Output is correct
63 Correct 1 ms 336 KB Output is correct