oj.uz

Submission #245976

# Submission time Handle Problem Language Result Execution time Memory
245976 2020-07-07T22:41:56 Z rrrr10000 Travelling Merchant (APIO17_merchant) C++14
100 / 100
 234 ms 4236 KB 
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n)  for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define pb emplace_back
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define ub(v,k) (upper_bound(all(v),k)-v.begin())
#define fi first
#define se second
#define pi M_PI
#define PQ(T) priority_queue<T>
#define SPQ(T) priority_queue<T,vector<T>,greater<T>>
#define dame(a) {out(a);return 0;}
#define decimal cout<<fixed<<setprecision(15);
#define dupli(a) a.erase(unique(all(a)),a.end())
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef tuple<ll,ll,ll,ll> PPP;
typedef multiset<ll> S;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
using vvvvi=vector<vvvi>;
using vp=vector<P>;
using vvp=vector<vp>;
using vb=vector<bool>;
using vvb=vector<vb>;
const ll inf=1001001001001001001;
const ll INF=1001001001;
const ll mod=1000000007;
const double eps=1e-10;
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}
template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';}
template<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}
template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}
template<class T> void yesno(T b){if(b)out("yes");else out("no");}
template<class T> void YesNo(T b){if(b)out("Yes");else out("No");}
template<class T> void YESNO(T b){if(b)out("YES");else out("NO");}
template<class T> void noyes(T b){if(b)out("no");else out("yes");}
template<class T> void NoYes(T b){if(b)out("No");else out("Yes");}
template<class T> void NOYES(T b){if(b)out("NO");else out("YES");}
void outs(ll a,ll b){if(a>=inf-100)out(b);else out(a);}
ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}
ll modpow(ll a,ll b){ll res=1;a%=mod;while(b){if(b&1)res=res*a%mod;a=a*a%mod;b>>=1;}return res;}
int main(){
    ll n,m,k;cin>>n>>m>>k;
    vvi v(n,vi(k*2));
    rep(i,n)rep(j,k*2)cin>>v[i][j];
    vvi val(n,vi(n));
    rep(i,n)rep(j,n){
        rep(t,k)if(v[j][t*2+1]!=-1&&v[i][t*2]!=-1)chmax(val[i][j],v[j][t*2+1]-v[i][t*2]);
    }
    vvi dis(n,vi(n,inf));
    rep(i,m){
        ll a,b;cin>>a>>b>>dis[a-1][b-1];
    }
    rep(i,n)dis[i][i]=0;
    rep(t,n)rep(i,n)rep(j,n)chmin(dis[i][j],dis[i][t]+dis[t][j]);
    // outvv(dis);outvv(val);
    ll ok=0,ng=1000000005;
    while(ng-ok>1){
        ll md=(ok+ng)/2;
        bool able=false;
        vi dp(n);
        vvi f(n,vi(n,inf));
        rep(i,n)rep(j,n)if(inf/md>dis[i][j]&&i!=j)chmin(f[i][j],md*dis[i][j]-val[i][j]);
        rep(t,n)rep(i,n)rep(j,n)chmin(f[i][j],f[i][t]+f[t][j]);
        rep(i,n)if(f[i][i]<=0)able=true;
        if(able)ok=md;
        else ng=md;
    }
    out(ok);
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 135 ms 3452 KB Output is correct
2 Correct 36 ms 512 KB Output is correct
3 Correct 37 ms 512 KB Output is correct
4 Correct 10 ms 384 KB Output is correct
5 Correct 9 ms 384 KB Output is correct
6 Correct 9 ms 384 KB Output is correct
7 Correct 12 ms 384 KB Output is correct
8 Correct 4 ms 256 KB Output is correct
9 Correct 10 ms 384 KB Output is correct
10 Correct 10 ms 384 KB Output is correct
11 Correct 10 ms 384 KB Output is correct
12 Correct 5 ms 256 KB Output is correct
13 Correct 13 ms 512 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 384 KB Output is correct
2 Correct 10 ms 384 KB Output is correct
3 Correct 11 ms 512 KB Output is correct
4 Correct 12 ms 384 KB Output is correct
5 Correct 18 ms 512 KB Output is correct
6 Correct 5 ms 256 KB Output is correct
7 Correct 11 ms 512 KB Output is correct
8 Correct 11 ms 384 KB Output is correct
9 Correct 10 ms 384 KB Output is correct
10 Correct 11 ms 384 KB Output is correct
11 Correct 17 ms 512 KB Output is correct
12 Correct 14 ms 512 KB Output is correct
13 Correct 11 ms 384 KB Output is correct
14 Correct 12 ms 384 KB Output is correct
15 Correct 16 ms 548 KB Output is correct
16 Correct 11 ms 372 KB Output is correct
17 Correct 20 ms 384 KB Output is correct
18 Correct 5 ms 256 KB Output is correct
19 Correct 20 ms 512 KB Output is correct
20 Correct 22 ms 512 KB Output is correct
21 Correct 16 ms 512 KB Output is correct
22 Correct 12 ms 384 KB Output is correct
23 Correct 11 ms 384 KB Output is correct
24 Correct 9 ms 384 KB Output is correct
25 Correct 12 ms 384 KB Output is correct
26 Correct 4 ms 256 KB Output is correct
27 Correct 10 ms 384 KB Output is correct
28 Correct 10 ms 384 KB Output is correct
29 Correct 10 ms 384 KB Output is correct
30 Correct 5 ms 256 KB Output is correct
31 Correct 13 ms 512 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 120 ms 1016 KB Output is correct
2 Correct 234 ms 3832 KB Output is correct
3 Correct 91 ms 640 KB Output is correct
4 Correct 114 ms 896 KB Output is correct
5 Correct 113 ms 896 KB Output is correct
6 Correct 55 ms 760 KB Output is correct
7 Correct 20 ms 384 KB Output is correct
8 Correct 5 ms 256 KB Output is correct
9 Correct 20 ms 512 KB Output is correct
10 Correct 22 ms 512 KB Output is correct
11 Correct 16 ms 512 KB Output is correct
12 Correct 12 ms 384 KB Output is correct
13 Correct 11 ms 384 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 384 KB Output is correct
2 Correct 10 ms 384 KB Output is correct
3 Correct 11 ms 512 KB Output is correct
4 Correct 12 ms 384 KB Output is correct
5 Correct 18 ms 512 KB Output is correct
6 Correct 5 ms 256 KB Output is correct
7 Correct 11 ms 512 KB Output is correct
8 Correct 11 ms 384 KB Output is correct
9 Correct 10 ms 384 KB Output is correct
10 Correct 11 ms 384 KB Output is correct
11 Correct 17 ms 512 KB Output is correct
12 Correct 14 ms 512 KB Output is correct
13 Correct 11 ms 384 KB Output is correct
14 Correct 12 ms 384 KB Output is correct
15 Correct 16 ms 548 KB Output is correct
16 Correct 11 ms 372 KB Output is correct
17 Correct 120 ms 1016 KB Output is correct
18 Correct 234 ms 3832 KB Output is correct
19 Correct 91 ms 640 KB Output is correct
20 Correct 114 ms 896 KB Output is correct
21 Correct 113 ms 896 KB Output is correct
22 Correct 55 ms 760 KB Output is correct
23 Correct 20 ms 384 KB Output is correct
24 Correct 5 ms 256 KB Output is correct
25 Correct 20 ms 512 KB Output is correct
26 Correct 22 ms 512 KB Output is correct
27 Correct 16 ms 512 KB Output is correct
28 Correct 12 ms 384 KB Output is correct
29 Correct 11 ms 384 KB Output is correct
30 Correct 44 ms 640 KB Output is correct
31 Correct 48 ms 768 KB Output is correct
32 Correct 91 ms 2296 KB Output is correct
33 Correct 47 ms 768 KB Output is correct
34 Correct 44 ms 768 KB Output is correct
35 Correct 45 ms 768 KB Output is correct
36 Correct 208 ms 4088 KB Output is correct
37 Correct 5 ms 256 KB Output is correct
38 Correct 5 ms 384 KB Output is correct
39 Correct 42 ms 640 KB Output is correct
40 Correct 47 ms 768 KB Output is correct
41 Correct 44 ms 640 KB Output is correct
42 Correct 40 ms 640 KB Output is correct
43 Correct 40 ms 640 KB Output is correct
44 Correct 4 ms 256 KB Output is correct
45 Correct 18 ms 512 KB Output is correct
46 Correct 25 ms 640 KB Output is correct
47 Correct 18 ms 512 KB Output is correct
48 Correct 194 ms 4236 KB Output is correct
49 Correct 192 ms 4216 KB Output is correct
50 Correct 5 ms 256 KB Output is correct
51 Correct 135 ms 3452 KB Output is correct
52 Correct 36 ms 512 KB Output is correct
53 Correct 37 ms 512 KB Output is correct
54 Correct 10 ms 384 KB Output is correct
55 Correct 9 ms 384 KB Output is correct
56 Correct 9 ms 384 KB Output is correct
57 Correct 12 ms 384 KB Output is correct
58 Correct 4 ms 256 KB Output is correct
59 Correct 10 ms 384 KB Output is correct
60 Correct 10 ms 384 KB Output is correct
61 Correct 10 ms 384 KB Output is correct
62 Correct 5 ms 256 KB Output is correct
63 Correct 13 ms 512 KB Output is correct