oj.uz

Submission #253865

# Submission time Handle Problem Language Result Execution time Memory
253865 2020-07-29T00:35:22 Z fivefourthreeone Travelling Merchant (APIO17_merchant) C++17
100 / 100
 170 ms 3604 KB 
#include <bits/stdc++.h>
#define owo(i,a, b) for(int i=(a);i<(b); ++i)
#define uwu(i,a, b) for(int i=(a)-1; i>=(b); --i)
#define senpai push_back
#define ttgl pair<int, int>
#define ayaya cout<<"ayaya~"<<endl
 
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
gp_hash_table<int, int> mp;
using ll = long long;
using ld = long double;
const ll MOD = 1000000007;
const ll root = 62;
int gcd(int a,int b){return b?gcd(b,a%b):a;}
ll binpow(ll a,ll b){ll res=1;while(b){if(b&1)res=(res*a)%MOD;a=(a*a)%MOD;b>>=1;}return res;}
ll modInv(ll a){return binpow(a, MOD-2);}
const double PI = acos(-1);
const double eps = -1e6;
const int INF = 0x3f3f3f3f;
const int NINF = 0xc0c0c0c0;
const ll INFLL = 0x3f3f3f3f3f3f3f3f;
const ll NINFLL = 0xc0c0c0c0c0c0c0c0;
const int mxN = 101;
const int mxK = 1001;
vector<ttgl> adj[mxN];
ll graph[mxN][mxN];
int best[mxN][mxN];
int dist[mxN][mxN];
ll findist[mxN][mxN];
int stuff[mxN][2][mxK];
int n, m, k;
bool check(int tt) {
    owo(i, 0, n) {
        owo(j, 0, n) {
            if(i==j)  {
                graph[i][j] = 1;
            }else if(dist[i][j]!=INF) {
                graph[i][j] = -(best[i][j]-1LL*dist[i][j]*tt);
            }else {
                graph[i][j] = INFLL;
            }
            //cout<<i<<" "<<j<<" "<<graph[i][j]<<" "<<dist[i][j]<<" "<<best[i][j]<<"\n";
            findist[i][j] = graph[i][j];
        }
    }
    owo(k, 0, n) owo(i, 0, n) owo(j, 0, n) {
        if (findist[i][k] + findist[k][j] < findist[i][j]) {
            findist[i][j] = findist[i][k] + findist[k][j];
        }
    }
    owo(i, 0, n) {
        if(findist[i][i]<=0)return true;
    }
    return false;
}
int main() {
    //freopen("file.in", "r", stdin);
    //freopen("file.out", "w", stdout);
    mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
    cin.tie(0)->sync_with_stdio(0);
    cin>>n>>m>>k;
    owo(i, 0, n) {
        owo(j, 0, 2*k) {
            cin>>stuff[i][j&1][j/2];
        }
    }
    int a, b, c;
    owo(i, 0, m) {
        cin>>a>>b>>c;
        a--; b--;
        adj[a].senpai({b, c});
    }
    memset(best, -1, sizeof(best));
    memset(dist, INF, sizeof(dist));
    owo(i, 0, n) {
        dist[i][i] = 0;
        priority_queue<ttgl, vector<ttgl>, greater<ttgl>> pq;
        pq.push({0, i});
        while(!pq.empty()) {
            auto p = pq.top();
            //cout<<i<<" "<<p.second<<" "<<p.first<<"\n";
            pq.pop();
            if(p.first!=dist[i][p.second])continue;
            if(p.second!=i) {
                best[i][p.second] = 0;
                owo(nn, 0, k) {
                    if(stuff[i][0][nn]!=-1&&stuff[p.second][1][nn]!=-1) {
                        //cout<<i<<" "<<p.second<<" "<<stuff[p.second][1][nn]<<" "<<stuff[i][0][nn]<<"\n";
                        best[i][p.second] = max(best[i][p.second], stuff[p.second][1][nn]-stuff[i][0][nn]);   
                    }
                }
            }
            for(auto v: adj[p.second]) {
                if(dist[i][p.second] + v.second<dist[i][v.first]) {
                    dist[i][v.first] = dist[i][p.second]+v.second;
                    pq.push({dist[i][v.first], v.first});
                }
            }
        }
    }
    check(2);
    int l = 0;
    int r = INF;
    while(l<r) {
        int mid = (l+r+1)/2;
        if(check(mid)) l = mid;
        else r = mid-1;
    }
    cout<<l<<"\n";
    return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 64 ms 2680 KB Output is correct
2 Correct 36 ms 1408 KB Output is correct
3 Correct 34 ms 1408 KB Output is correct
4 Correct 7 ms 896 KB Output is correct
5 Correct 6 ms 896 KB Output is correct
6 Correct 5 ms 896 KB Output is correct
7 Correct 7 ms 1024 KB Output is correct
8 Correct 0 ms 512 KB Output is correct
9 Correct 6 ms 896 KB Output is correct
10 Correct 6 ms 896 KB Output is correct
11 Correct 7 ms 896 KB Output is correct
12 Correct 1 ms 512 KB Output is correct
13 Correct 6 ms 896 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 117 ms 1552 KB Output is correct
2 Correct 170 ms 3192 KB Output is correct
3 Correct 88 ms 1528 KB Output is correct
4 Correct 123 ms 1656 KB Output is correct
5 Correct 112 ms 1536 KB Output is correct
6 Correct 60 ms 1408 KB Output is correct
7 Correct 17 ms 896 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 17 ms 896 KB Output is correct
10 Correct 11 ms 896 KB Output is correct
11 Correct 9 ms 896 KB Output is correct
12 Correct 7 ms 896 KB Output is correct
13 Correct 8 ms 896 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 896 KB Output is correct
2 Correct 6 ms 896 KB Output is correct
3 Correct 6 ms 896 KB Output is correct
4 Correct 6 ms 896 KB Output is correct
5 Correct 18 ms 896 KB Output is correct
6 Correct 1 ms 512 KB Output is correct
7 Correct 10 ms 896 KB Output is correct
8 Correct 11 ms 896 KB Output is correct
9 Correct 6 ms 896 KB Output is correct
10 Correct 7 ms 896 KB Output is correct
11 Correct 8 ms 896 KB Output is correct
12 Correct 9 ms 896 KB Output is correct
13 Correct 7 ms 896 KB Output is correct
14 Correct 7 ms 896 KB Output is correct
15 Correct 9 ms 1024 KB Output is correct
16 Correct 7 ms 896 KB Output is correct
17 Correct 117 ms 1552 KB Output is correct
18 Correct 170 ms 3192 KB Output is correct
19 Correct 88 ms 1528 KB Output is correct
20 Correct 123 ms 1656 KB Output is correct
21 Correct 112 ms 1536 KB Output is correct
22 Correct 60 ms 1408 KB Output is correct
23 Correct 17 ms 896 KB Output is correct
24 Correct 1 ms 512 KB Output is correct
25 Correct 17 ms 896 KB Output is correct
26 Correct 11 ms 896 KB Output is correct
27 Correct 9 ms 896 KB Output is correct
28 Correct 7 ms 896 KB Output is correct
29 Correct 8 ms 896 KB Output is correct
30 Correct 40 ms 1436 KB Output is correct
31 Correct 39 ms 1408 KB Output is correct
32 Correct 54 ms 1784 KB Output is correct
33 Correct 34 ms 1408 KB Output is correct
34 Correct 36 ms 1408 KB Output is correct
35 Correct 36 ms 1408 KB Output is correct
36 Correct 136 ms 3320 KB Output is correct
37 Correct 1 ms 512 KB Output is correct
38 Correct 1 ms 512 KB Output is correct
39 Correct 35 ms 1408 KB Output is correct
40 Correct 35 ms 1536 KB Output is correct
41 Correct 37 ms 1408 KB Output is correct
42 Correct 35 ms 1408 KB Output is correct
43 Correct 34 ms 1408 KB Output is correct
44 Correct 1 ms 512 KB Output is correct
45 Correct 9 ms 1024 KB Output is correct
46 Correct 9 ms 1024 KB Output is correct
47 Correct 8 ms 1024 KB Output is correct
48 Correct 120 ms 3604 KB Output is correct
49 Correct 114 ms 3576 KB Output is correct
50 Correct 1 ms 512 KB Output is correct
51 Correct 64 ms 2680 KB Output is correct
52 Correct 36 ms 1408 KB Output is correct
53 Correct 34 ms 1408 KB Output is correct
54 Correct 7 ms 896 KB Output is correct
55 Correct 6 ms 896 KB Output is correct
56 Correct 5 ms 896 KB Output is correct
57 Correct 7 ms 1024 KB Output is correct
58 Correct 0 ms 512 KB Output is correct
59 Correct 6 ms 896 KB Output is correct
60 Correct 6 ms 896 KB Output is correct
61 Correct 7 ms 896 KB Output is correct
62 Correct 1 ms 512 KB Output is correct
63 Correct 6 ms 896 KB Output is correct