oj.uz

Submission #944830

# Submission time Handle Problem Language Result Execution time Memory
944830 2024-03-13T06:17:15 Z Darren0724 Travelling Merchant (APIO17_merchant) C++17
100 / 100
 64 ms 4612 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long 
#define all(x) x.begin(),x.end()
#define abcorz ios_base::sync_with_stdio(false);cin.tie(0);
const int N=105;
const int M=10005;
const int INF=1.05e9;
const int mod=1e9+7;
int n,m,k;
vector<int> v[N];
vector<int> a(M),b(M),c(M);
vector dis(N,vector(N,INF));
vector adj(N,vector<int>(N,0));
inline void chmin(int &a,int b){
    a=(a>b?b:a);
}
void run(){
    for(int k=1;k<=n;k++){
        for(int i=1;i<=n;i++){
            for(int j=1;j<=n;j++){
                chmin(dis[i][j],dis[i][k]+dis[k][j]);
            }
        }
    }
}
int solve(int t){
    vector<vector<int>> dis1(n+1,vector<int>(n+1,INF));
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            if(i==j||dis[i][j]==INF)continue;
            dis1[i][j]=dis[i][j]*t-adj[i][j];
        }
    }
    for(int k=1;k<=n;k++){
        for(int i=1;i<=n;i++){
            for(int j=1;j<=n;j++){
                chmin(dis1[i][j],dis1[i][k]+dis1[k][j]);
            }
        }
    }
    int flag=0;
    for(int i=1;i<=n;i++){
        flag|=(dis1[i][i]<=0);
    }
    return flag;
}
int32_t main(){
    abcorz;
    cin>>n>>m>>k;
    for(int i=1;i<=n;i++){
        for(int j=0;j<k*2;j++){
            int p;cin>>p;
            v[i].push_back(p);
        }
    }
    for(int i=0;i<m;i++){
        cin>>a[i]>>b[i]>>c[i];
        dis[a[i]][b[i]]=c[i];
    }
    run();
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            int mx=0;
            for(int k1=0;k1<k;k1++){
                if(v[j][k1*2+1]!=-1&&v[i][k1*2]!=-1){
                    mx=max(mx,v[j][k1*2+1]-v[i][k1*2]);
                }
            }
            adj[i][j]=mx;
        }
    }
    int l=0,r=INF;
    while(r-l>1){
        int mid=(l+r)>>1;
        if(solve(mid))l=mid;
        else r=mid;
    }
    cout<<l<<endl;
    return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 61 ms 2396 KB Output is correct
2 Correct 27 ms 932 KB Output is correct
3 Correct 31 ms 928 KB Output is correct
4 Correct 4 ms 856 KB Output is correct
5 Correct 4 ms 860 KB Output is correct
6 Correct 4 ms 860 KB Output is correct
7 Correct 7 ms 860 KB Output is correct
8 Correct 1 ms 860 KB Output is correct
9 Correct 4 ms 856 KB Output is correct
10 Correct 4 ms 856 KB Output is correct
11 Correct 4 ms 860 KB Output is correct
12 Correct 1 ms 860 KB Output is correct
13 Correct 4 ms 860 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 856 KB Output is correct
2 Correct 1 ms 860 KB Output is correct
3 Correct 4 ms 860 KB Output is correct
4 Correct 4 ms 860 KB Output is correct
5 Correct 4 ms 860 KB Output is correct
6 Correct 4 ms 856 KB Output is correct
7 Correct 4 ms 856 KB Output is correct
8 Correct 33 ms 1116 KB Output is correct
9 Correct 51 ms 2548 KB Output is correct
10 Correct 28 ms 856 KB Output is correct
11 Correct 31 ms 1116 KB Output is correct
12 Correct 34 ms 1372 KB Output is correct
13 Correct 29 ms 860 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 928 KB Output is correct
2 Correct 4 ms 860 KB Output is correct
3 Correct 4 ms 860 KB Output is correct
4 Correct 4 ms 860 KB Output is correct
5 Correct 5 ms 888 KB Output is correct
6 Correct 1 ms 856 KB Output is correct
7 Correct 4 ms 860 KB Output is correct
8 Correct 4 ms 860 KB Output is correct
9 Correct 4 ms 860 KB Output is correct
10 Correct 4 ms 972 KB Output is correct
11 Correct 4 ms 860 KB Output is correct
12 Correct 4 ms 860 KB Output is correct
13 Correct 4 ms 860 KB Output is correct
14 Correct 5 ms 860 KB Output is correct
15 Correct 5 ms 1020 KB Output is correct
16 Correct 4 ms 856 KB Output is correct
17 Correct 33 ms 1116 KB Output is correct
18 Correct 51 ms 2548 KB Output is correct
19 Correct 28 ms 856 KB Output is correct
20 Correct 31 ms 1116 KB Output is correct
21 Correct 34 ms 1372 KB Output is correct
22 Correct 29 ms 860 KB Output is correct
23 Correct 4 ms 856 KB Output is correct
24 Correct 1 ms 860 KB Output is correct
25 Correct 4 ms 860 KB Output is correct
26 Correct 4 ms 860 KB Output is correct
27 Correct 4 ms 860 KB Output is correct
28 Correct 4 ms 856 KB Output is correct
29 Correct 4 ms 856 KB Output is correct
30 Correct 61 ms 2396 KB Output is correct
31 Correct 27 ms 932 KB Output is correct
32 Correct 31 ms 928 KB Output is correct
33 Correct 4 ms 856 KB Output is correct
34 Correct 4 ms 860 KB Output is correct
35 Correct 4 ms 860 KB Output is correct
36 Correct 7 ms 860 KB Output is correct
37 Correct 1 ms 860 KB Output is correct
38 Correct 4 ms 856 KB Output is correct
39 Correct 4 ms 856 KB Output is correct
40 Correct 4 ms 860 KB Output is correct
41 Correct 1 ms 860 KB Output is correct
42 Correct 4 ms 860 KB Output is correct
43 Correct 29 ms 860 KB Output is correct
44 Correct 31 ms 1112 KB Output is correct
45 Correct 45 ms 3032 KB Output is correct
46 Correct 33 ms 1116 KB Output is correct
47 Correct 30 ms 1116 KB Output is correct
48 Correct 30 ms 1116 KB Output is correct
49 Correct 64 ms 4432 KB Output is correct
50 Correct 1 ms 860 KB Output is correct
51 Correct 1 ms 860 KB Output is correct
52 Correct 28 ms 988 KB Output is correct
53 Correct 30 ms 860 KB Output is correct
54 Correct 29 ms 860 KB Output is correct
55 Correct 36 ms 1012 KB Output is correct
56 Correct 32 ms 860 KB Output is correct
57 Correct 1 ms 856 KB Output is correct
58 Correct 5 ms 856 KB Output is correct
59 Correct 5 ms 860 KB Output is correct
60 Correct 5 ms 860 KB Output is correct
61 Correct 55 ms 4612 KB Output is correct
62 Correct 54 ms 4588 KB Output is correct
63 Correct 1 ms 860 KB Output is correct