oj.uz

Submission #363975

# Submission time Handle Problem Language Result Execution time Memory
363975 2021-02-07T17:44:09 Z bigDuck Travelling Merchant (APIO17_merchant) C++14
100 / 100
 145 ms 4716 KB 
#include<bits/stdc++.h>
using namespace std;
#define INIT  ios_base :: sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define mp make_pair
#define pb push_back
#define ft first
#define sc second
#define ll long long
#define pii pair<int, int>
#define count_bits __builtin_popcount
#define int ll

int t, n, m, k, a[300010], q, l, r;


int b[101][1001], s[101][1001];
int c[101][101];








int d[101][101];
int p[101][101];
vector<pii> g[101];



void dijkstra(int s){
    multiset<pii> ms;
    ms.insert({0, s});
    d[s][s]=0;
    bool v[101]; memset(v, 0, sizeof(v));
    while(!ms.empty()){
        int nod=(ms.begin())->sc; ms.erase(ms.begin());
        v[nod]=true;
        for(pii pr:g[nod]){
            int u=pr.ft, c=pr.sc;
            if(v[u]){continue;}
            auto it=ms.find({d[s][u], u});
            if(it==ms.end()){
                d[s][u]=d[s][nod]+c;
                ms.insert({d[s][u], u});
            }
            else{
                if(d[s][u]>(d[s][nod]+c) ){
                    ms.erase(it);
                    d[s][u]=d[s][nod]+c;
                    ms.insert({d[s][u], u});
                }
            }
        }
    }
}


int g1[101][101];
int inf=(1e18)*4;
void build(int r){
for(int i=1; i<=n; i++){
    for(int j=1; j<=n; j++){
        g1[i][j]=inf;
    }
}
for(int i=1; i<=n; i++){
    g1[i][i]=0;
}


for(int i=1; i<=n; i++){
    for(int j=1; j<=n;j++){
        if(d[i][j]>0){
                if( (c[i][j]>d[i][j]) && (d[i][j]>0) ){c[i][j]=min(d[i][j], c[i][j]);}
            g1[i][j]=r*d[i][j]-p[i][j];
        }
    }
}

}






vector<int> g2[101];
int v2[101];
bool dfs(int s){
    v2[s]=1;
    bool b=false;
    for(int u:g2[s]){
        if(v2[u]==1){ v2[s]=-1; return true;}
        if(v2[u]==-1){continue;}
        b=(b||dfs(u));
    }
    v2[s]=-1;
    return b;
}





bool BellmanFord(int r){
    build(r);
    for(int k=1; k<=n; k++){
        for(int i=1; i<=n; i++){
            for(int j=1; j<=n; j++){
                    g1[i][j]=min(g1[i][j], g1[i][k]+g1[k][j]);

                    if(j!=i){
                if( (g1[i][j]+g1[j][i])<=g1[i][i] ){
                    return true;
                }
            }
            }
        }
    }
    bool exists=false;
    for(int i=1; i<=n; i++){

        for(int j=1; j<=n; j++){
            if(j!=i){
                if( (g1[i][j]+g1[j][i])<=g1[i][i] ){
                    return true;
                }
            }
        }
    }
    return exists;
}



int32_t main(){
INIT
cin>>n>>m>>k;
for(int i=1; i<=n; i++){
    for(int j=1; j<=k; j++){
        cin>>b[i][j]>>s[i][j];
    }
}
for(int i=1; i<=m; i++){
    int u, v, C;
    cin>>u>>v>>C;
    c[u][v]=C;
    g[u].pb({v, C});
}

for(int i=1;i<=n; i++){
    dijkstra(i);
}
for(int i=1; i<=n; i++){
    for(int j=1; j<=n; j++){
        //p[i][j]=-1;
        if(d[i][j]>0){
            for(int l=1; l<=k; l++){
                if( (s[j][l]>=0) && (b[i][l]>=0) ){
                p[i][j]=max(p[i][j], s[j][l]-b[i][l]);
                }
            }
        }
    }
}



int l=1, r=1000000001, m=(l+r)>>1ll;

while(l<r){
    m=(l+r)>>1ll;
    if(BellmanFord(m)){
        l=m+1;
    }
    else{
        r=m;
    }
    m=(l+r)>>1ll;
}

cout<<(m-1);
//cout<<BellmanFord(m)<<"\n";
return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 82 ms 2284 KB Output is correct
2 Correct 54 ms 1388 KB Output is correct
3 Correct 34 ms 1388 KB Output is correct
4 Correct 8 ms 876 KB Output is correct
5 Correct 7 ms 876 KB Output is correct
6 Correct 8 ms 876 KB Output is correct
7 Correct 6 ms 1004 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 7 ms 876 KB Output is correct
10 Correct 9 ms 876 KB Output is correct
11 Correct 7 ms 876 KB Output is correct
12 Correct 1 ms 492 KB Output is correct
13 Correct 9 ms 1004 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 1004 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 9 ms 1004 KB Output is correct
4 Correct 9 ms 1132 KB Output is correct
5 Correct 9 ms 1004 KB Output is correct
6 Correct 9 ms 1004 KB Output is correct
7 Correct 5 ms 876 KB Output is correct
8 Correct 52 ms 1644 KB Output is correct
9 Correct 111 ms 2284 KB Output is correct
10 Correct 59 ms 1536 KB Output is correct
11 Correct 59 ms 1644 KB Output is correct
12 Correct 61 ms 1644 KB Output is correct
13 Correct 48 ms 1516 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 876 KB Output is correct
2 Correct 6 ms 876 KB Output is correct
3 Correct 8 ms 1004 KB Output is correct
4 Correct 8 ms 1004 KB Output is correct
5 Correct 9 ms 1004 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 7 ms 876 KB Output is correct
8 Correct 8 ms 1004 KB Output is correct
9 Correct 6 ms 876 KB Output is correct
10 Correct 5 ms 1004 KB Output is correct
11 Correct 9 ms 1004 KB Output is correct
12 Correct 7 ms 1004 KB Output is correct
13 Correct 9 ms 1004 KB Output is correct
14 Correct 7 ms 1004 KB Output is correct
15 Correct 12 ms 1132 KB Output is correct
16 Correct 7 ms 876 KB Output is correct
17 Correct 52 ms 1644 KB Output is correct
18 Correct 111 ms 2284 KB Output is correct
19 Correct 59 ms 1536 KB Output is correct
20 Correct 59 ms 1644 KB Output is correct
21 Correct 61 ms 1644 KB Output is correct
22 Correct 48 ms 1516 KB Output is correct
23 Correct 9 ms 1004 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 9 ms 1004 KB Output is correct
26 Correct 9 ms 1132 KB Output is correct
27 Correct 9 ms 1004 KB Output is correct
28 Correct 9 ms 1004 KB Output is correct
29 Correct 5 ms 876 KB Output is correct
30 Correct 82 ms 2284 KB Output is correct
31 Correct 54 ms 1388 KB Output is correct
32 Correct 34 ms 1388 KB Output is correct
33 Correct 8 ms 876 KB Output is correct
34 Correct 7 ms 876 KB Output is correct
35 Correct 8 ms 876 KB Output is correct
36 Correct 6 ms 1004 KB Output is correct
37 Correct 1 ms 364 KB Output is correct
38 Correct 7 ms 876 KB Output is correct
39 Correct 9 ms 876 KB Output is correct
40 Correct 7 ms 876 KB Output is correct
41 Correct 1 ms 492 KB Output is correct
42 Correct 9 ms 1004 KB Output is correct
43 Correct 50 ms 1516 KB Output is correct
44 Correct 53 ms 1768 KB Output is correct
45 Correct 60 ms 2812 KB Output is correct
46 Correct 54 ms 1756 KB Output is correct
47 Correct 59 ms 1900 KB Output is correct
48 Correct 57 ms 1900 KB Output is correct
49 Correct 113 ms 4332 KB Output is correct
50 Correct 1 ms 492 KB Output is correct
51 Correct 1 ms 492 KB Output is correct
52 Correct 48 ms 1516 KB Output is correct
53 Correct 88 ms 1900 KB Output is correct
54 Correct 52 ms 1516 KB Output is correct
55 Correct 45 ms 1516 KB Output is correct
56 Correct 43 ms 1516 KB Output is correct
57 Correct 1 ms 364 KB Output is correct
58 Correct 10 ms 1132 KB Output is correct
59 Correct 9 ms 1132 KB Output is correct
60 Correct 9 ms 1132 KB Output is correct
61 Correct 141 ms 4588 KB Output is correct
62 Correct 145 ms 4716 KB Output is correct
63 Correct 1 ms 364 KB Output is correct