oj.uz

Submission #225701

# Submission time Handle Problem Language Result Execution time Memory
225701 2020-04-21T10:33:17 Z LittleFlowers__ Travelling Merchant (APIO17_merchant) C++14
100 / 100
 284 ms 4472 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define in ({int x=0;int c=getchar(),n=0;for(;!isdigit(c);c=getchar()) n=(c=='-');for(;isdigit(c);c=getchar()) x=x*10+c-'0';n?-x:x;})
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int rnd(int l,int r){return l+rng()%(r-l+1);}
#define fasty ios_base::sync_with_stdio(0),cin.tie(0);
#define forinc(a,b,c) for(int a=b,_c=c;a<=_c;++a)
#define fordec(a,b,c) for(int a=b,_c=c;a>=_c;--a)
#define forv(a,b) for(auto&a:b)
#define fi first
#define se second
#define pb push_back
#define ii pair<int,int>
#define mt make_tuple
#define all(a) a.begin(),a.end()
#define reset(f, x) memset(f, x, sizeof(f))
#define bit(x,i) ((x>>(i-1))&1)
#define on(x,i) (x|(1ll<<(i-1)))
#define off(x,i) (x&~(1<<(i-1)))
#define gg exit(0);

const int N=110,
          K=1010,
          INF=1e15;

int n,m,k;
int buy[N][K],sell[N][K];
int to[N][N],inc[N][N];
long double f[N][N];


int chk(int val){
    forinc(i,1,n) forinc(j,1,n) if(to[i][j]<INF) f[i][j]=(long double)inc[i][j]-(long double)to[i][j]*val; else f[i][j]=-INF;
    forinc(t,1,n) forinc(i,1,n) forinc(j,1,n) f[i][j]=max(f[i][j],f[i][t]+f[t][j]);
	forinc(i,1,n) if(f[i][i]>=0) return 1;
	return 0;
}


main(){
    #define task "merchant"
    //freopen(task".inp","r",stdin);
    //freopen(task".out","w",stdout);

    n=in,m=in,k=in;
    forinc(i,1,n) forinc(j,1,k) buy[i][j]=in, sell[i][j]=in;
    forinc(i,1,n)  forinc(j,1,n) to[i][j]=INF;
    forinc(i,1,m){
        int u=in,v=in;
        to[u][v]=min(to[u][v],in);
    }
    forinc(t,1,n) forinc(i,1,n) forinc(j,1,n) to[i][j]=min(to[i][j],to[i][t]+to[t][j]);
    forinc(t,1,k) forinc(i,1,n) forinc(j,1,n) if(sell[j][t]>0 && buy[i][t]>0) inc[i][j]=max(inc[i][j],sell[j][t]-buy[i][t]);
    int le=1,mi,ri=1e9,ret=0;
    while(le<=ri){
        mi=(le+ri)/2;
        if(chk(mi)) ret=mi, le=mi+1; else ri=mi-1;
    }
    cout<<ret<<"\n";
}

Compilation message

merchant.cpp:41:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main(){
      ^

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 264 ms 3448 KB Output is correct
2 Correct 230 ms 1448 KB Output is correct
3 Correct 247 ms 1528 KB Output is correct
4 Correct 35 ms 896 KB Output is correct
5 Correct 34 ms 896 KB Output is correct
6 Correct 35 ms 896 KB Output is correct
7 Correct 35 ms 896 KB Output is correct
8 Correct 5 ms 512 KB Output is correct
9 Correct 36 ms 896 KB Output is correct
10 Correct 35 ms 896 KB Output is correct
11 Correct 35 ms 896 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 34 ms 896 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 896 KB Output is correct
2 Correct 34 ms 896 KB Output is correct
3 Correct 35 ms 896 KB Output is correct
4 Correct 32 ms 1144 KB Output is correct
5 Correct 35 ms 1024 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 36 ms 896 KB Output is correct
8 Correct 34 ms 1024 KB Output is correct
9 Correct 35 ms 896 KB Output is correct
10 Correct 35 ms 896 KB Output is correct
11 Correct 37 ms 1152 KB Output is correct
12 Correct 36 ms 1024 KB Output is correct
13 Correct 35 ms 896 KB Output is correct
14 Correct 35 ms 1024 KB Output is correct
15 Correct 36 ms 1024 KB Output is correct
16 Correct 43 ms 896 KB Output is correct
17 Correct 35 ms 1024 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 35 ms 1024 KB Output is correct
20 Correct 36 ms 1024 KB Output is correct
21 Correct 36 ms 1024 KB Output is correct
22 Correct 35 ms 896 KB Output is correct
23 Correct 35 ms 896 KB Output is correct
24 Correct 35 ms 896 KB Output is correct
25 Correct 35 ms 896 KB Output is correct
26 Correct 5 ms 512 KB Output is correct
27 Correct 36 ms 896 KB Output is correct
28 Correct 35 ms 896 KB Output is correct
29 Correct 35 ms 896 KB Output is correct
30 Correct 5 ms 384 KB Output is correct
31 Correct 34 ms 896 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 251 ms 1912 KB Output is correct
2 Correct 281 ms 4088 KB Output is correct
3 Correct 240 ms 1664 KB Output is correct
4 Correct 254 ms 1912 KB Output is correct
5 Correct 241 ms 1912 KB Output is correct
6 Correct 247 ms 1680 KB Output is correct
7 Correct 35 ms 1024 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 35 ms 1024 KB Output is correct
10 Correct 36 ms 1024 KB Output is correct
11 Correct 36 ms 1024 KB Output is correct
12 Correct 35 ms 896 KB Output is correct
13 Correct 35 ms 896 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 896 KB Output is correct
2 Correct 34 ms 896 KB Output is correct
3 Correct 35 ms 896 KB Output is correct
4 Correct 32 ms 1144 KB Output is correct
5 Correct 35 ms 1024 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 36 ms 896 KB Output is correct
8 Correct 34 ms 1024 KB Output is correct
9 Correct 35 ms 896 KB Output is correct
10 Correct 35 ms 896 KB Output is correct
11 Correct 37 ms 1152 KB Output is correct
12 Correct 36 ms 1024 KB Output is correct
13 Correct 35 ms 896 KB Output is correct
14 Correct 35 ms 1024 KB Output is correct
15 Correct 36 ms 1024 KB Output is correct
16 Correct 43 ms 896 KB Output is correct
17 Correct 251 ms 1912 KB Output is correct
18 Correct 281 ms 4088 KB Output is correct
19 Correct 240 ms 1664 KB Output is correct
20 Correct 254 ms 1912 KB Output is correct
21 Correct 241 ms 1912 KB Output is correct
22 Correct 247 ms 1680 KB Output is correct
23 Correct 35 ms 1024 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 35 ms 1024 KB Output is correct
26 Correct 36 ms 1024 KB Output is correct
27 Correct 36 ms 1024 KB Output is correct
28 Correct 35 ms 896 KB Output is correct
29 Correct 35 ms 896 KB Output is correct
30 Correct 242 ms 1536 KB Output is correct
31 Correct 242 ms 1784 KB Output is correct
32 Correct 260 ms 2808 KB Output is correct
33 Correct 248 ms 1792 KB Output is correct
34 Correct 247 ms 1772 KB Output is correct
35 Correct 247 ms 1784 KB Output is correct
36 Correct 278 ms 4216 KB Output is correct
37 Correct 5 ms 384 KB Output is correct
38 Correct 5 ms 512 KB Output is correct
39 Correct 245 ms 1528 KB Output is correct
40 Correct 239 ms 1656 KB Output is correct
41 Correct 241 ms 1536 KB Output is correct
42 Correct 242 ms 1660 KB Output is correct
43 Correct 238 ms 1408 KB Output is correct
44 Correct 5 ms 384 KB Output is correct
45 Correct 40 ms 1024 KB Output is correct
46 Correct 36 ms 1152 KB Output is correct
47 Correct 36 ms 1024 KB Output is correct
48 Correct 278 ms 4472 KB Output is correct
49 Correct 284 ms 4344 KB Output is correct
50 Correct 5 ms 384 KB Output is correct
51 Correct 264 ms 3448 KB Output is correct
52 Correct 230 ms 1448 KB Output is correct
53 Correct 247 ms 1528 KB Output is correct
54 Correct 35 ms 896 KB Output is correct
55 Correct 34 ms 896 KB Output is correct
56 Correct 35 ms 896 KB Output is correct
57 Correct 35 ms 896 KB Output is correct
58 Correct 5 ms 512 KB Output is correct
59 Correct 36 ms 896 KB Output is correct
60 Correct 35 ms 896 KB Output is correct
61 Correct 35 ms 896 KB Output is correct
62 Correct 5 ms 384 KB Output is correct
63 Correct 34 ms 896 KB Output is correct