oj.uz

Submission #202455

# Submission time Handle Problem Language Result Execution time Memory
202455 2020-02-16T07:45:00 Z darkkcyan Travelling Merchant (APIO17_merchant) C++17
21 / 100
 1000 ms 2424 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) {
    DB("check " << 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 * 2) 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
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 2040 KB Output is correct
2 Correct 7 ms 1400 KB Output is correct
3 Execution timed out 1084 ms 1272 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 892 KB Output is correct
2 Correct 112 ms 888 KB Output is correct
3 Correct 57 ms 888 KB Output is correct
4 Correct 47 ms 1016 KB Output is correct
5 Correct 162 ms 888 KB Output is correct
6 Correct 5 ms 504 KB Output is correct
7 Correct 28 ms 888 KB Output is correct
8 Correct 42 ms 888 KB Output is correct
9 Correct 46 ms 888 KB Output is correct
10 Correct 90 ms 888 KB Output is correct
11 Correct 172 ms 888 KB Output is correct
12 Correct 105 ms 888 KB Output is correct
13 Correct 161 ms 888 KB Output is correct
14 Correct 137 ms 1096 KB Output is correct
15 Correct 162 ms 892 KB Output is correct
16 Correct 163 ms 888 KB Output is correct
17 Correct 75 ms 888 KB Output is correct
18 Correct 5 ms 504 KB Output is correct
19 Correct 208 ms 1016 KB Output is correct
20 Correct 184 ms 888 KB Output is correct
21 Correct 126 ms 888 KB Output is correct
22 Correct 194 ms 1016 KB Output is correct
23 Correct 103 ms 888 KB Output is correct
24 Correct 5 ms 888 KB Output is correct
25 Correct 125 ms 888 KB Output is correct
26 Correct 5 ms 508 KB Output is correct
27 Correct 165 ms 888 KB Output is correct
28 Correct 137 ms 888 KB Output is correct
29 Correct 178 ms 888 KB Output is correct
30 Correct 7 ms 508 KB Output is correct
31 Correct 6 ms 888 KB Output is correct

Subtask #3
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 530 ms 1652 KB Output is correct
2 Execution timed out 1056 ms 2424 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 892 KB Output is correct
2 Correct 112 ms 888 KB Output is correct
3 Correct 57 ms 888 KB Output is correct
4 Correct 47 ms 1016 KB Output is correct
5 Correct 162 ms 888 KB Output is correct
6 Correct 5 ms 504 KB Output is correct
7 Correct 28 ms 888 KB Output is correct
8 Correct 42 ms 888 KB Output is correct
9 Correct 46 ms 888 KB Output is correct
10 Correct 90 ms 888 KB Output is correct
11 Correct 172 ms 888 KB Output is correct
12 Correct 105 ms 888 KB Output is correct
13 Correct 161 ms 888 KB Output is correct
14 Correct 137 ms 1096 KB Output is correct
15 Correct 162 ms 892 KB Output is correct
16 Correct 163 ms 888 KB Output is correct
17 Correct 530 ms 1652 KB Output is correct
18 Execution timed out 1056 ms 2424 KB Time limit exceeded
19 Halted 0 ms 0 KB -