oj.uz

Submission #62757

# Submission time Handle Problem Language Result Execution time Memory
62757 2018-07-30T01:59:09 Z Benq Travelling Merchant (APIO17_merchant) C++11
100 / 100
 142 ms 13548 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 100001;

template<int SZ> struct Topo {
    int N, in[SZ];
    vi res, adj[SZ];
    
    void addEdge(int x, int y) {
    	adj[x].pb(y), in[y] ++;
    }
    
    void sort() {
        queue<int> todo;
        F0R(i,N) if (in[i] == 0) todo.push(i);
        while (sz(todo)) {
            int x = todo.front(); todo.pop();
            res.pb(x);
            for (int i: adj[x]) {
                in[i] --;
                if (!in[i]) todo.push(i);
            }
        }
    }
};

int N,M,K,B[100][1000],S[100][1000];
int prof[100][100],dist[100][100];
array<ll,100> tmp;
vi adj[100];

bool ok(int mid) {
    F0R(i,N) {
        adj[i].clear();
        tmp[i] = 0;
    }
    F0R(i,N) {
        auto TMP = tmp;
        F0R(j,N) F0R(k,N) if (j != k && dist[j][k] != MOD) 
            TMP[k] = max(TMP[k],tmp[j]+prof[j][k]-(ll)dist[j][k]*mid);
        tmp = TMP;
    }
    Topo<100> T = Topo<100>(); T.N = N;
    F0R(j,N) F0R(k,N) if (j != k && dist[j][k] != MOD) {
        ll d = tmp[j]+prof[j][k]-(ll)dist[j][k]*mid;
        if (tmp[k] < d) return 1;
        else if (tmp[k] == d) T.addEdge(j,k);
    }
    T.sort();
    return sz(T.res) != N;
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> N >> M >> K;
    F0R(i,N) F0R(j,K) cin >> B[i][j] >> S[i][j];
    F0R(i,N) F0R(j,N) if (i != j) dist[i][j] = MOD;
    F0R(i,M) {
        int V,W,T; cin >> V >> W >> T; V--, W--;
        dist[V][W] = min(dist[V][W],T);
    }
    F0R(k,N) F0R(i,N) F0R(j,N) dist[i][j] = min(dist[i][j],dist[i][k]+dist[k][j]);
    F0R(i,N) F0R(j,N) {
        F0R(k,K) if (B[i][k] != -1 && S[j][k] != -1)
            prof[i][j] = max(prof[i][j],S[j][k]-B[i][k]);
        // cout << "AH " << i << " " << j << " " << prof[i][j] << " " << dist[i][j] << "\n";
    }
    
    ok(6);
    int lo = 0, hi = MOD;
    while (lo < hi) {
        int mid = (lo+hi+1)/2;
        if (ok(mid)) lo = mid;
        else hi = mid-1;
    }
    cout << lo;
}

/* Look for:
* the exact constraints (multiple sets are too slow for n=10^6 :( ) 
* special cases (n=1?)
* overflow (ll vs int?)
* array bounds
*/

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 114 ms 2424 KB Output is correct
2 Correct 75 ms 2656 KB Output is correct
3 Correct 78 ms 2656 KB Output is correct
4 Correct 18 ms 2656 KB Output is correct
5 Correct 15 ms 2656 KB Output is correct
6 Correct 13 ms 2656 KB Output is correct
7 Correct 15 ms 2656 KB Output is correct
8 Correct 5 ms 2656 KB Output is correct
9 Correct 13 ms 2656 KB Output is correct
10 Correct 14 ms 2656 KB Output is correct
11 Correct 11 ms 2656 KB Output is correct
12 Correct 4 ms 2656 KB Output is correct
13 Correct 11 ms 2656 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 2656 KB Output is correct
2 Correct 14 ms 2656 KB Output is correct
3 Correct 14 ms 2712 KB Output is correct
4 Correct 17 ms 2712 KB Output is correct
5 Correct 13 ms 2712 KB Output is correct
6 Correct 3 ms 2712 KB Output is correct
7 Correct 11 ms 2804 KB Output is correct
8 Correct 11 ms 2804 KB Output is correct
9 Correct 11 ms 2804 KB Output is correct
10 Correct 12 ms 2828 KB Output is correct
11 Correct 13 ms 2916 KB Output is correct
12 Correct 11 ms 2916 KB Output is correct
13 Correct 14 ms 2916 KB Output is correct
14 Correct 13 ms 2916 KB Output is correct
15 Correct 15 ms 3068 KB Output is correct
16 Correct 13 ms 3068 KB Output is correct
17 Correct 12 ms 3068 KB Output is correct
18 Correct 4 ms 3068 KB Output is correct
19 Correct 13 ms 3176 KB Output is correct
20 Correct 15 ms 3248 KB Output is correct
21 Correct 16 ms 3296 KB Output is correct
22 Correct 12 ms 3296 KB Output is correct
23 Correct 10 ms 3296 KB Output is correct
24 Correct 13 ms 2656 KB Output is correct
25 Correct 15 ms 2656 KB Output is correct
26 Correct 5 ms 2656 KB Output is correct
27 Correct 13 ms 2656 KB Output is correct
28 Correct 14 ms 2656 KB Output is correct
29 Correct 11 ms 2656 KB Output is correct
30 Correct 4 ms 2656 KB Output is correct
31 Correct 11 ms 2656 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 72 ms 3880 KB Output is correct
2 Correct 129 ms 5724 KB Output is correct
3 Correct 122 ms 5724 KB Output is correct
4 Correct 84 ms 5880 KB Output is correct
5 Correct 82 ms 6156 KB Output is correct
6 Correct 84 ms 6312 KB Output is correct
7 Correct 12 ms 3068 KB Output is correct
8 Correct 4 ms 3068 KB Output is correct
9 Correct 13 ms 3176 KB Output is correct
10 Correct 15 ms 3248 KB Output is correct
11 Correct 16 ms 3296 KB Output is correct
12 Correct 12 ms 3296 KB Output is correct
13 Correct 10 ms 3296 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 2656 KB Output is correct
2 Correct 14 ms 2656 KB Output is correct
3 Correct 14 ms 2712 KB Output is correct
4 Correct 17 ms 2712 KB Output is correct
5 Correct 13 ms 2712 KB Output is correct
6 Correct 3 ms 2712 KB Output is correct
7 Correct 11 ms 2804 KB Output is correct
8 Correct 11 ms 2804 KB Output is correct
9 Correct 11 ms 2804 KB Output is correct
10 Correct 12 ms 2828 KB Output is correct
11 Correct 13 ms 2916 KB Output is correct
12 Correct 11 ms 2916 KB Output is correct
13 Correct 14 ms 2916 KB Output is correct
14 Correct 13 ms 2916 KB Output is correct
15 Correct 15 ms 3068 KB Output is correct
16 Correct 13 ms 3068 KB Output is correct
17 Correct 72 ms 3880 KB Output is correct
18 Correct 129 ms 5724 KB Output is correct
19 Correct 122 ms 5724 KB Output is correct
20 Correct 84 ms 5880 KB Output is correct
21 Correct 82 ms 6156 KB Output is correct
22 Correct 84 ms 6312 KB Output is correct
23 Correct 12 ms 3068 KB Output is correct
24 Correct 4 ms 3068 KB Output is correct
25 Correct 13 ms 3176 KB Output is correct
26 Correct 15 ms 3248 KB Output is correct
27 Correct 16 ms 3296 KB Output is correct
28 Correct 12 ms 3296 KB Output is correct
29 Correct 10 ms 3296 KB Output is correct
30 Correct 85 ms 6312 KB Output is correct
31 Correct 123 ms 6416 KB Output is correct
32 Correct 118 ms 6876 KB Output is correct
33 Correct 75 ms 6876 KB Output is correct
34 Correct 70 ms 6916 KB Output is correct
35 Correct 70 ms 6992 KB Output is correct
36 Correct 142 ms 9072 KB Output is correct
37 Correct 2 ms 9072 KB Output is correct
38 Correct 4 ms 9072 KB Output is correct
39 Correct 71 ms 9072 KB Output is correct
40 Correct 119 ms 9072 KB Output is correct
41 Correct 91 ms 9072 KB Output is correct
42 Correct 79 ms 9216 KB Output is correct
43 Correct 112 ms 9216 KB Output is correct
44 Correct 2 ms 9216 KB Output is correct
45 Correct 13 ms 9216 KB Output is correct
46 Correct 13 ms 9216 KB Output is correct
47 Correct 15 ms 9216 KB Output is correct
48 Correct 125 ms 11624 KB Output is correct
49 Correct 125 ms 13548 KB Output is correct
50 Correct 3 ms 13548 KB Output is correct
51 Correct 114 ms 2424 KB Output is correct
52 Correct 75 ms 2656 KB Output is correct
53 Correct 78 ms 2656 KB Output is correct
54 Correct 18 ms 2656 KB Output is correct
55 Correct 15 ms 2656 KB Output is correct
56 Correct 13 ms 2656 KB Output is correct
57 Correct 15 ms 2656 KB Output is correct
58 Correct 5 ms 2656 KB Output is correct
59 Correct 13 ms 2656 KB Output is correct
60 Correct 14 ms 2656 KB Output is correct
61 Correct 11 ms 2656 KB Output is correct
62 Correct 4 ms 2656 KB Output is correct
63 Correct 11 ms 2656 KB Output is correct