oj.uz

Submission #959456

# Submission time Handle Problem Language Result Execution time Memory
959456 2024-04-08T08:48:44 Z AlperenT_ Travelling Merchant (APIO17_merchant) C++14
100 / 100
 100 ms 5284 KB 
#include <bits/stdc++.h>

#pragma GCC optimize("O3,unroll-loops")
#define pb push_back
#define F first
#define S second 
#define ld long double
#define int long long
#define all(a) a.begin(),a.end()
#define pii pair <int,int>
#define sz(v) (int)v.size()
#define rep(i , a , b) for(int i=a;i <= (b);i++)
#define per(i , a , b) for(int i=a;i >= (b);i--)
#define deb(x) cout <<#x << " : " << x << "\n" ;
using namespace std ;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int maxn = 202 + 10 , maxk = 1e4, sq = 1e5 , lg = 19,  inf = 1e18+10 , mod = 998244353;
int b[maxn][maxk] , s[maxn][maxk] , d[maxn][maxn] , w[maxn][maxn] , sp[maxn] , n; 
int dis[maxn][maxn] ;

bool ch(int x){
    rep(i , 1, n)sp[i] = 0 ;
    rep(i , 1 ,n+1){
        rep(j , 1 ,n){
            rep(k , 1 , n){
                if(d[j][k] == inf)continue ; 
                sp[k] = min(sp[k] , sp[j] + (-w[j][k] + d[j][k]*x)); 
                if(sp[k] < -(1e17))return 1 ;
            }
        }
    }
    rep(j , 1, n){
        rep(k , 1, n){
            if(d[j][k] == inf)continue ; 
            if(sp[k] > sp[j]+(-w[j][k]+d[j][k]*x))return 1 ;
        }
    }
    rep(i , 1 , n){
        rep(j , 1 , n){
            dis[i][j] = inf ;
            if(d[i][j] == inf)continue ;
            dis[i][j] = (-w[i][j]+d[i][j]*x);
        }
        dis[i][i] =0 ; 
    }
    rep(i , 1 ,n){
        rep(j , 1 ,n){
            rep(k, 1 , n){
                dis[j][k] = min(dis[j][k] , dis[j][i] + dis[i][k]) ; 
            }
        }
    }
    rep(i , 1, n){
        rep(j , 1 , n){
            if(dis[j][i] + (-w[i][j]+d[i][j]*x) == 0)return 1; 
        }
    }
    return 0 ; 
}

signed main(){
    ios_base::sync_with_stdio(false);cin.tie(0);
    int m , k ;
    cin >> n >> m >> k ;
    rep(i , 1, n){
        rep(j , 1, k){
            cin >> b[i][j] >> s[i][j] ;
        }
    }
    rep(i , 1, n){
        rep(j , 1 , n){
            w[i][j] = -inf ;
            if(i == j)continue ;
            w[i][j] = 0 ; 
            rep(z , 1 , k){
                if(b[i][z] == -1 || s[j][z] == -1)continue ;
                w[i][j] = max(w[i][j] , -b[i][z] + s[j][z]) ;
            }
        }
    }
    rep(i , 1, n){
        rep(j , 1 ,n)d[i][j] = inf ;
        d[i][i] = 0; 
    }
    while(m--){
        int v, u , w ;
        cin >> v >> u >> w ;
        d[v][u] = min(d[v][u] , w);
    }
    rep(i ,1 ,n){
        rep(j , 1, n){
            rep(z, 1 , n){
                d[j][z] = min(d[j][z] , d[j][i] + d[i][z]) ; 
            }
        }
    }
    int l = 0, r =1e9 ;
    while(r-l>1){
        int mid = (l+r)/2 ;
        if(ch(mid) == 1)l=mid ;
        else r = mid ;
    }
    cout << l << "\n";
    return 0;
}
/*
*/

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 84 ms 4432 KB Output is correct
2 Correct 65 ms 1624 KB Output is correct
3 Correct 56 ms 1628 KB Output is correct
4 Correct 12 ms 1116 KB Output is correct
5 Correct 9 ms 1112 KB Output is correct
6 Correct 11 ms 1152 KB Output is correct
7 Correct 8 ms 1112 KB Output is correct
8 Correct 1 ms 600 KB Output is correct
9 Correct 8 ms 1148 KB Output is correct
10 Correct 8 ms 1116 KB Output is correct
11 Correct 9 ms 1112 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 8 ms 1224 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 1152 KB Output is correct
2 Correct 8 ms 1112 KB Output is correct
3 Correct 1 ms 600 KB Output is correct
4 Correct 8 ms 1148 KB Output is correct
5 Correct 8 ms 1116 KB Output is correct
6 Correct 9 ms 1112 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 8 ms 1224 KB Output is correct
9 Correct 9 ms 1116 KB Output is correct
10 Correct 8 ms 1160 KB Output is correct
11 Correct 9 ms 1116 KB Output is correct
12 Correct 8 ms 1116 KB Output is correct
13 Correct 9 ms 1116 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 6 ms 1112 KB Output is correct
16 Correct 9 ms 1192 KB Output is correct
17 Correct 5 ms 1116 KB Output is correct
18 Correct 7 ms 1116 KB Output is correct
19 Correct 8 ms 1112 KB Output is correct
20 Correct 7 ms 1116 KB Output is correct
21 Correct 8 ms 1116 KB Output is correct
22 Correct 10 ms 1196 KB Output is correct
23 Correct 9 ms 1116 KB Output is correct
24 Correct 12 ms 1116 KB Output is correct
25 Correct 12 ms 1116 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 7 ms 1112 KB Output is correct
28 Correct 8 ms 1236 KB Output is correct
29 Correct 7 ms 1200 KB Output is correct
30 Correct 8 ms 1176 KB Output is correct
31 Correct 7 ms 1116 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 1116 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 7 ms 1112 KB Output is correct
4 Correct 8 ms 1236 KB Output is correct
5 Correct 7 ms 1200 KB Output is correct
6 Correct 8 ms 1176 KB Output is correct
7 Correct 7 ms 1116 KB Output is correct
8 Correct 65 ms 1880 KB Output is correct
9 Correct 83 ms 4956 KB Output is correct
10 Correct 66 ms 1928 KB Output is correct
11 Correct 68 ms 2136 KB Output is correct
12 Correct 47 ms 2016 KB Output is correct
13 Correct 57 ms 1884 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 1116 KB Output is correct
2 Correct 8 ms 1160 KB Output is correct
3 Correct 9 ms 1116 KB Output is correct
4 Correct 8 ms 1116 KB Output is correct
5 Correct 9 ms 1116 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 6 ms 1112 KB Output is correct
8 Correct 9 ms 1192 KB Output is correct
9 Correct 5 ms 1116 KB Output is correct
10 Correct 7 ms 1116 KB Output is correct
11 Correct 8 ms 1112 KB Output is correct
12 Correct 7 ms 1116 KB Output is correct
13 Correct 8 ms 1116 KB Output is correct
14 Correct 10 ms 1196 KB Output is correct
15 Correct 9 ms 1116 KB Output is correct
16 Correct 12 ms 1116 KB Output is correct
17 Correct 65 ms 1880 KB Output is correct
18 Correct 83 ms 4956 KB Output is correct
19 Correct 66 ms 1928 KB Output is correct
20 Correct 68 ms 2136 KB Output is correct
21 Correct 47 ms 2016 KB Output is correct
22 Correct 57 ms 1884 KB Output is correct
23 Correct 12 ms 1116 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 7 ms 1112 KB Output is correct
26 Correct 8 ms 1236 KB Output is correct
27 Correct 7 ms 1200 KB Output is correct
28 Correct 8 ms 1176 KB Output is correct
29 Correct 7 ms 1116 KB Output is correct
30 Correct 84 ms 4432 KB Output is correct
31 Correct 65 ms 1624 KB Output is correct
32 Correct 56 ms 1628 KB Output is correct
33 Correct 12 ms 1116 KB Output is correct
34 Correct 9 ms 1112 KB Output is correct
35 Correct 11 ms 1152 KB Output is correct
36 Correct 8 ms 1112 KB Output is correct
37 Correct 1 ms 600 KB Output is correct
38 Correct 8 ms 1148 KB Output is correct
39 Correct 8 ms 1116 KB Output is correct
40 Correct 9 ms 1112 KB Output is correct
41 Correct 1 ms 604 KB Output is correct
42 Correct 8 ms 1224 KB Output is correct
43 Correct 75 ms 1624 KB Output is correct
44 Correct 72 ms 2140 KB Output is correct
45 Correct 70 ms 3416 KB Output is correct
46 Correct 79 ms 1880 KB Output is correct
47 Correct 66 ms 2128 KB Output is correct
48 Correct 65 ms 2016 KB Output is correct
49 Correct 88 ms 5284 KB Output is correct
50 Correct 1 ms 344 KB Output is correct
51 Correct 1 ms 576 KB Output is correct
52 Correct 79 ms 1804 KB Output is correct
53 Correct 66 ms 2128 KB Output is correct
54 Correct 56 ms 1884 KB Output is correct
55 Correct 59 ms 1624 KB Output is correct
56 Correct 65 ms 1624 KB Output is correct
57 Correct 1 ms 344 KB Output is correct
58 Correct 9 ms 1116 KB Output is correct
59 Correct 8 ms 1312 KB Output is correct
60 Correct 7 ms 1328 KB Output is correct
61 Correct 100 ms 5220 KB Output is correct
62 Correct 92 ms 5216 KB Output is correct
63 Correct 1 ms 352 KB Output is correct