oj.uz

Submission #959429

# Submission time Handle Problem Language Result Execution time Memory
959429 2024-04-08T08:01:05 Z AlperenT_ Travelling Merchant (APIO17_merchant) C++17
45 / 100
 162 ms 3904 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 = 102 + 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; 


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)); 
            }
        }
    }
    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 ;
        }
    }
    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 =4e9 ;
    while(r-l>1){
        int mid = (l+r)/2 ;
        if(ch(mid) == 1)l=mid ;
        else r = mid ;
    }
    rep(i , 1, n){
        rep(j , 1, n){
            sp[j] = inf ;
        }
        rep(j , 1, n){
            if(j == i)continue ;
            sp[j] = (-w[i][j] + (l+1)*d[i][j]);
        }
        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]*(l+1))); 
                }
            }
        }
        if(sp[i] == 0){
            cout << l+1 << "\n"; 
            exit(0) ;
        }
    }
    cout << l << "\n";
    return 0;
}
/*
*/

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 156 ms 3800 KB Output is correct
2 Correct 141 ms 1468 KB Output is correct
3 Correct 137 ms 1468 KB Output is correct
4 Correct 12 ms 856 KB Output is correct
5 Correct 12 ms 860 KB Output is correct
6 Correct 12 ms 860 KB Output is correct
7 Correct 12 ms 860 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 13 ms 860 KB Output is correct
10 Correct 6 ms 860 KB Output is correct
11 Correct 15 ms 860 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 11 ms 1052 KB Output is correct

Subtask #2
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 860 KB Output is correct
2 Correct 12 ms 860 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 13 ms 860 KB Output is correct
5 Correct 6 ms 860 KB Output is correct
6 Correct 15 ms 860 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 11 ms 1052 KB Output is correct
9 Correct 15 ms 860 KB Output is correct
10 Correct 12 ms 856 KB Output is correct
11 Correct 14 ms 1032 KB Output is correct
12 Correct 11 ms 860 KB Output is correct
13 Correct 13 ms 860 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 9 ms 856 KB Output is correct
16 Correct 11 ms 860 KB Output is correct
17 Correct 10 ms 860 KB Output is correct
18 Correct 11 ms 1032 KB Output is correct
19 Correct 14 ms 860 KB Output is correct
20 Correct 6 ms 860 KB Output is correct
21 Correct 7 ms 860 KB Output is correct
22 Incorrect 12 ms 856 KB Output isn't correct
23 Halted 0 ms 0 KB -

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 139 ms 1628 KB Output is correct
2 Correct 162 ms 3904 KB Output is correct
3 Correct 146 ms 1628 KB Output is correct
4 Correct 140 ms 1848 KB Output is correct
5 Correct 40 ms 1840 KB Output is correct
6 Correct 143 ms 1628 KB Output is correct
7 Correct 13 ms 856 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 6 ms 860 KB Output is correct
10 Correct 6 ms 860 KB Output is correct
11 Correct 12 ms 856 KB Output is correct
12 Correct 13 ms 860 KB Output is correct
13 Correct 10 ms 860 KB Output is correct

Subtask #4
0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 860 KB Output is correct
2 Correct 12 ms 856 KB Output is correct
3 Correct 14 ms 1032 KB Output is correct
4 Correct 11 ms 860 KB Output is correct
5 Correct 13 ms 860 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 9 ms 856 KB Output is correct
8 Correct 11 ms 860 KB Output is correct
9 Correct 10 ms 860 KB Output is correct
10 Correct 11 ms 1032 KB Output is correct
11 Correct 14 ms 860 KB Output is correct
12 Correct 6 ms 860 KB Output is correct
13 Correct 7 ms 860 KB Output is correct
14 Incorrect 12 ms 856 KB Output isn't correct
15 Halted 0 ms 0 KB -