oj.uz

Submission #202457

# Submission time Handle Problem Language Result Execution time Memory
202457 2020-02-16T07:46:59 Z darkkcyan Travelling Merchant (APIO17_merchant) C++17
100 / 100
 806 ms 4216 KB 
// vim: foldmethod=marker
// Sat Feb 15 23:04:31 MSK 2020: start 
// Sat Feb 15 23:15:57 MSK 2020: done coding
// Sat Feb 15 23:26:12 MSK 2020: ok samples.
#include <bits/stdc++.h>
using namespace std;

#define llong long long 
#define len(x) ((int)x.size())
#define rep(i,n) for (int i = -1; ++ i < n; )
#define rep1(i,n) for (int i = 0; i ++ < n; )
#define rand __rand
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());  // or mt19937_64
template<class T = int> T rand(T range = numeric_limits<T>::max()) { return (T)(rng() % range); }

/*{{{*/
#define CONCAT_(x, y) x##y
#define CONCAT(x, y) CONCAT_(x, y)
#ifdef LOCAL_DEBUG   
int debug = 1;
#define DB(...) stringstream CONCAT(ss, __LINE__); CONCAT(ss, __LINE__) << __VA_ARGS__; debug_block CONCAT(dbbl, __LINE__)(CONCAT(ss, __LINE__).str())
#else
int debug = 0;
#define DB(...)
#endif
int __db_level = 0;
#define clog if (debug) cerr << string(__db_level * 2, ' ')
struct debug_block {
    string name;
    debug_block(const string& name_): name(name_) { clog << "{ " << name << endl; ++__db_level; }
    ~debug_block() { --__db_level; clog << "} " << name << endl; }
};
#define deb(...) "[" << #__VA_ARGS__ << "] = [" << __VA_ARGS__ << "]"
#define debln(...)  clog << "[" << #__VA_ARGS__ << "] = [" << __VA_ARGS__ << "]" << endl
#define _ << ", " <<
template<class U, class V>
ostream& operator<<(ostream& out, const pair<U, V>& p) { return out << "(" << p.first _ p.second << ")"; }
template<class A, class B>
ostream& operator<<(ostream& out, const tuple<A, B>& t) { return out << "(" << get<0>(t) _ get<1>(t) << ")"; }
template<class A, class B, class C>
ostream& operator<<(ostream& out, const tuple<A, B, C>& t) { return out << "(" << get<0>(t) _ get<1>(t) _ get<2>(t) << ")"; }
template<class T> ostream& operator<<(ostream& out, const vector<T>& container) { 
    out << "{";
    if (len(container)) out << container[0];
    rep1(i, len(container) - 1) out _ container[i];
    return out << "}";
}
template<class x> vector<typename x::value_type> $v(const x& a) { return vector<typename x::value_type>(a.begin(), a.end()); }
#define ptrtype(x) typename iterator_traits<x>::value_type
template<class u> vector<ptrtype(u)> $v(u a, u b) { return vector<ptrtype(u)>(a, b); }
/*}}}*/
// ACTUAL SOLUTION BELOW ////////////////////////////////////////////////////////////

const int maxn = 111;
const int maxk = 1010;
const llong inf = (llong)1e12;
int n, m, k;
llong buy_cost[maxn][maxk], sell_cost[maxn][maxk];
llong dist[maxn][maxn];
llong profit[maxn][maxn];

llong cur_ans[maxn];
bool in_queue[maxn];
int cnt_vis[maxn];
int dfs_state[maxn];

inline llong edge_dist(int u, int v, llong ans) {
    if (dist[u][v] == 0) return 0;
    return dist[u][v] * min(LLONG_MAX / dist[u][v], ans);
}

bool detect_zero_cycle(int u, llong ans) {
    dfs_state[u] = 1;
    rep1(v, n) {
        if (dfs_state[v] == 2) continue;
        llong new_dist = cur_ans[u] - edge_dist(u, v, ans) + profit[u][v];
        if (new_dist != cur_ans[v]) continue;
        if (dfs_state[v] == 1) return true;
        if (detect_zero_cycle(v, ans)) return true;
    }
    dfs_state[u] = 2;
    return false;
}

bool check(llong ans) {
    rep1(i, n) {
        cur_ans[i] = -inf;
        cnt_vis[i] = 0;
        in_queue[i] = false;
        dfs_state[i] = 0;
    }

    queue<int> qu;
    rep1(i, n) {
        if (cnt_vis[i]) continue;
        for (qu.emplace(i), cur_ans[i] = 0, in_queue[i] = 1; len(qu); qu.pop()) {
            int u = qu.front();
            ++cnt_vis[u];
            in_queue[u] = false;

            if (cnt_vis[u] > n) return true;
            rep1(v, n) {
                llong new_dist = cur_ans[u] - edge_dist(u, v, ans) + profit[u][v];
                if (new_dist <= cur_ans[v]) continue;
                cur_ans[v] = new_dist;
                if (!in_queue[v]) {
                    qu.emplace(v);
                    in_queue[v] = true;
                }
            }
        }

        if (detect_zero_cycle(i, ans)) return true;
    }
    return false;
}

int main(void) {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n >> m >> k;
    rep1(i, n) {
        dist[i][i] = 0;
        for (int f = i + 1; f <= n; ++f)
            dist[i][f] = dist[f][i] = inf;
    }

    rep1(i, n) rep(f, k) {
        cin >> buy_cost[i][f] >> sell_cost[i][f];
    }

    rep(i, m) {
        int u, v; llong d;
        cin >> u >> v >> d;
        dist[u][v] = min(dist[u][v], d);
    }

    rep1(mid, n) rep1(u, n) rep1(v, n) {
        dist[u][v] = min(dist[u][mid] + dist[mid][v], dist[u][v]);
    }

    memset(profit, 0, sizeof(profit));
    rep(thing, k) {
        rep1(u, n) {
            if (buy_cost[u][thing] == -1) continue;
            rep1(v, n) {
                if (sell_cost[v][thing] == -1) continue;
                profit[u][v] = max(profit[u][v], sell_cost[v][thing] - buy_cost[u][thing]);
            }
        }
    }

    rep1(i, n) profit[i][i] = -inf;
    
    llong low = 0, high = 1;
    while (check(high)) {
        low = high;
        high <<= 1;
    }

    while (low < high) {
        llong mid = low + (high - low + 1) / 2;
        if (check(mid)) low = mid;
        else high = mid - 1;
    }
    cout << low << endl;

    return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 2040 KB Output is correct
2 Correct 7 ms 1272 KB Output is correct
3 Correct 618 ms 1400 KB Output is correct
4 Correct 35 ms 888 KB Output is correct
5 Correct 38 ms 888 KB Output is correct
6 Correct 6 ms 888 KB Output is correct
7 Correct 66 ms 888 KB Output is correct
8 Correct 5 ms 504 KB Output is correct
9 Correct 86 ms 928 KB Output is correct
10 Correct 72 ms 1016 KB Output is correct
11 Correct 93 ms 888 KB Output is correct
12 Correct 6 ms 504 KB Output is correct
13 Correct 6 ms 888 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 944 KB Output is correct
2 Correct 59 ms 1016 KB Output is correct
3 Correct 31 ms 888 KB Output is correct
4 Correct 26 ms 888 KB Output is correct
5 Correct 86 ms 888 KB Output is correct
6 Correct 5 ms 504 KB Output is correct
7 Correct 17 ms 888 KB Output is correct
8 Correct 24 ms 888 KB Output is correct
9 Correct 26 ms 888 KB Output is correct
10 Correct 48 ms 888 KB Output is correct
11 Correct 91 ms 888 KB Output is correct
12 Correct 58 ms 892 KB Output is correct
13 Correct 85 ms 1016 KB Output is correct
14 Correct 73 ms 888 KB Output is correct
15 Correct 85 ms 1016 KB Output is correct
16 Correct 83 ms 888 KB Output is correct
17 Correct 41 ms 888 KB Output is correct
18 Correct 5 ms 504 KB Output is correct
19 Correct 106 ms 888 KB Output is correct
20 Correct 98 ms 1016 KB Output is correct
21 Correct 68 ms 892 KB Output is correct
22 Correct 100 ms 888 KB Output is correct
23 Correct 58 ms 888 KB Output is correct
24 Correct 6 ms 888 KB Output is correct
25 Correct 66 ms 888 KB Output is correct
26 Correct 5 ms 504 KB Output is correct
27 Correct 86 ms 928 KB Output is correct
28 Correct 72 ms 1016 KB Output is correct
29 Correct 93 ms 888 KB Output is correct
30 Correct 6 ms 504 KB Output is correct
31 Correct 6 ms 888 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 273 ms 1656 KB Output is correct
2 Correct 553 ms 2172 KB Output is correct
3 Correct 529 ms 1528 KB Output is correct
4 Correct 140 ms 1784 KB Output is correct
5 Correct 806 ms 1656 KB Output is correct
6 Correct 447 ms 1568 KB Output is correct
7 Correct 41 ms 888 KB Output is correct
8 Correct 5 ms 504 KB Output is correct
9 Correct 106 ms 888 KB Output is correct
10 Correct 98 ms 1016 KB Output is correct
11 Correct 68 ms 892 KB Output is correct
12 Correct 100 ms 888 KB Output is correct
13 Correct 58 ms 888 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 944 KB Output is correct
2 Correct 59 ms 1016 KB Output is correct
3 Correct 31 ms 888 KB Output is correct
4 Correct 26 ms 888 KB Output is correct
5 Correct 86 ms 888 KB Output is correct
6 Correct 5 ms 504 KB Output is correct
7 Correct 17 ms 888 KB Output is correct
8 Correct 24 ms 888 KB Output is correct
9 Correct 26 ms 888 KB Output is correct
10 Correct 48 ms 888 KB Output is correct
11 Correct 91 ms 888 KB Output is correct
12 Correct 58 ms 892 KB Output is correct
13 Correct 85 ms 1016 KB Output is correct
14 Correct 73 ms 888 KB Output is correct
15 Correct 85 ms 1016 KB Output is correct
16 Correct 83 ms 888 KB Output is correct
17 Correct 273 ms 1656 KB Output is correct
18 Correct 553 ms 2172 KB Output is correct
19 Correct 529 ms 1528 KB Output is correct
20 Correct 140 ms 1784 KB Output is correct
21 Correct 806 ms 1656 KB Output is correct
22 Correct 447 ms 1568 KB Output is correct
23 Correct 41 ms 888 KB Output is correct
24 Correct 5 ms 504 KB Output is correct
25 Correct 106 ms 888 KB Output is correct
26 Correct 98 ms 1016 KB Output is correct
27 Correct 68 ms 892 KB Output is correct
28 Correct 100 ms 888 KB Output is correct
29 Correct 58 ms 888 KB Output is correct
30 Correct 230 ms 1400 KB Output is correct
31 Correct 236 ms 1628 KB Output is correct
32 Correct 329 ms 2680 KB Output is correct
33 Correct 343 ms 1620 KB Output is correct
34 Correct 341 ms 1528 KB Output is correct
35 Correct 323 ms 1656 KB Output is correct
36 Correct 159 ms 4100 KB Output is correct
37 Correct 6 ms 504 KB Output is correct
38 Correct 5 ms 504 KB Output is correct
39 Correct 304 ms 1400 KB Output is correct
40 Correct 146 ms 1528 KB Output is correct
41 Correct 74 ms 1520 KB Output is correct
42 Correct 350 ms 1400 KB Output is correct
43 Correct 431 ms 1528 KB Output is correct
44 Correct 5 ms 504 KB Output is correct
45 Correct 43 ms 1020 KB Output is correct
46 Correct 29 ms 1016 KB Output is correct
47 Correct 27 ms 1016 KB Output is correct
48 Correct 232 ms 4216 KB Output is correct
49 Correct 447 ms 4216 KB Output is correct
50 Correct 5 ms 504 KB Output is correct
51 Correct 40 ms 2040 KB Output is correct
52 Correct 7 ms 1272 KB Output is correct
53 Correct 618 ms 1400 KB Output is correct
54 Correct 35 ms 888 KB Output is correct
55 Correct 38 ms 888 KB Output is correct
56 Correct 6 ms 888 KB Output is correct
57 Correct 66 ms 888 KB Output is correct
58 Correct 5 ms 504 KB Output is correct
59 Correct 86 ms 928 KB Output is correct
60 Correct 72 ms 1016 KB Output is correct
61 Correct 93 ms 888 KB Output is correct
62 Correct 6 ms 504 KB Output is correct
63 Correct 6 ms 888 KB Output is correct