oj.uz

Submission #319192

# Submission time Handle Problem Language Result Execution time Memory
319192 2020-11-04T12:52:16 Z AmineWeslati Travelling Merchant (APIO17_merchant) C++14
100 / 100
 102 ms 4324 KB 
//Never stop trying
/*#pragma GCC target ("avx2")
#pragma GCC optimize ("Ofast")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")*/
#include "bits/stdc++.h"
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef long long ll;
#define int ll
typedef string str;
typedef double db;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector<pi> vpi;
typedef vector<str> vs;
typedef vector<ld> vd;
#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)

const int MOD = 1e9 + 7; //998244353
const ll INF = 1e18;
const int MX = 2e5 + 10;
const int nx[4] = {0, 0, 1, -1}, ny[4] = {1, -1, 0, 0}; //right left down up

template<class T> using V = vector<T>;
template<class T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }

ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); } // divide a by b rounded up
//constexpr int log2(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
//mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());

ll random(ll a, ll b){
    return a + rng() % (b - a + 1);
}

#ifndef LOCAL  
#define cerr if(false) cerr
#endif
#define dbg(x) cerr << #x << " : " << x << endl; 
#define dbgs(x,y) cerr << #x << " : " << x << " / " << #y << " : " << y << endl;
#define dbgv(v) cerr << #v << " : " << "[ "; for(auto it : v) cerr << it << ' '; cerr << ']' << endl;
#define here() cerr << "here" << endl;

void IO() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
}

int n, m, x;
ll b[101][1001], s[101][1001];
ll graph[101][101], profit[101][101], graph2[101][101];

void floyd_warshall(ll adj[101][101]) {
    FOR(i, 1, n + 1)
        FOR(j, 1, n + 1)
            FOR(k, 1, n + 1)
                adj[j][k] = min(adj[j][k], adj[j][i] + adj[i][k]);
}

int32_t main() {
    boost; IO();

    cin >> n >> m >> x;
    FOR(i, 1, n + 1) {
        FOR(j, 1, n + 1) graph[i][j] = INF;
        FOR(j, 1, x + 1) cin >> b[i][j] >> s[i][j];
    }
    FOR(i, 0, m) {
        int u, v, w;
        cin >> u >> v >> w;
        graph[u][v] = w;
    }
    floyd_warshall(graph);
    FOR(i, 1, n + 1) FOR(j, 1, n + 1) FOR(k, 1, x + 1) 
        if (s[j][k] != -1 && b[i][k] != -1)
            profit[i][j] = max(profit[i][j], s[j][k] - b[i][k]);

    ll l = 1, r = 1e9;
    while (l <= r) {
        ll mid = (l + r) / 2;
        FOR(i, 1, n + 1) FOR(j, 1, n + 1)
            graph2[i][j] = mid * min(graph[i][j], INF / mid) - profit[i][j];
        floyd_warshall(graph2);
        bool has_nonnegative_cycle = false;
        FOR(i, 1, n + 1) if (graph2[i][i] <= 0) has_nonnegative_cycle = true;
        if (has_nonnegative_cycle) l = mid + 1;
        else r = mid - 1;
    }
    cout << r;

    return 0;
}

/* Careful!!!
    .Array bounds
    .Infinite loops
    .Uninitialized variables / empty containers
    .Multisets are shit

   Some insights:
    .Binary search
    .Graph representation
    .Write brute force code
    .Change your approach
*/

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 2028 KB Output is correct
2 Correct 36 ms 1260 KB Output is correct
3 Correct 38 ms 1260 KB Output is correct
4 Correct 6 ms 876 KB Output is correct
5 Correct 7 ms 876 KB Output is correct
6 Correct 6 ms 876 KB Output is correct
7 Correct 7 ms 876 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 6 ms 876 KB Output is correct
10 Correct 6 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 10 ms 1132 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 1644 KB Output is correct
2 Correct 97 ms 2276 KB Output is correct
3 Correct 42 ms 1632 KB Output is correct
4 Correct 46 ms 1764 KB Output is correct
5 Correct 48 ms 1644 KB Output is correct
6 Correct 40 ms 1516 KB Output is correct
7 Correct 7 ms 876 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 7 ms 1004 KB Output is correct
10 Correct 7 ms 1004 KB Output is correct
11 Correct 7 ms 1004 KB Output is correct
12 Correct 7 ms 876 KB Output is correct
13 Correct 6 ms 876 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1004 KB Output is correct
2 Correct 6 ms 876 KB Output is correct
3 Correct 7 ms 876 KB Output is correct
4 Correct 6 ms 1024 KB Output is correct
5 Correct 7 ms 1004 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 6 ms 876 KB Output is correct
8 Correct 7 ms 876 KB Output is correct
9 Correct 6 ms 876 KB Output is correct
10 Correct 9 ms 896 KB Output is correct
11 Correct 7 ms 1004 KB Output is correct
12 Correct 7 ms 1004 KB Output is correct
13 Correct 7 ms 1004 KB Output is correct
14 Correct 8 ms 896 KB Output is correct
15 Correct 8 ms 1000 KB Output is correct
16 Correct 6 ms 1004 KB Output is correct
17 Correct 46 ms 1644 KB Output is correct
18 Correct 97 ms 2276 KB Output is correct
19 Correct 42 ms 1632 KB Output is correct
20 Correct 46 ms 1764 KB Output is correct
21 Correct 48 ms 1644 KB Output is correct
22 Correct 40 ms 1516 KB Output is correct
23 Correct 7 ms 876 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 7 ms 1004 KB Output is correct
26 Correct 7 ms 1004 KB Output is correct
27 Correct 7 ms 1004 KB Output is correct
28 Correct 7 ms 876 KB Output is correct
29 Correct 6 ms 876 KB Output is correct
30 Correct 40 ms 1420 KB Output is correct
31 Correct 41 ms 1644 KB Output is correct
32 Correct 58 ms 2656 KB Output is correct
33 Correct 40 ms 1644 KB Output is correct
34 Correct 41 ms 1676 KB Output is correct
35 Correct 41 ms 1644 KB Output is correct
36 Correct 99 ms 4068 KB Output is correct
37 Correct 1 ms 492 KB Output is correct
38 Correct 1 ms 492 KB Output is correct
39 Correct 38 ms 1388 KB Output is correct
40 Correct 43 ms 1536 KB Output is correct
41 Correct 40 ms 1516 KB Output is correct
42 Correct 39 ms 1516 KB Output is correct
43 Correct 38 ms 1388 KB Output is correct
44 Correct 1 ms 364 KB Output is correct
45 Correct 11 ms 1132 KB Output is correct
46 Correct 8 ms 1004 KB Output is correct
47 Correct 9 ms 1004 KB Output is correct
48 Correct 102 ms 4228 KB Output is correct
49 Correct 102 ms 4324 KB Output is correct
50 Correct 1 ms 364 KB Output is correct
51 Correct 65 ms 2028 KB Output is correct
52 Correct 36 ms 1260 KB Output is correct
53 Correct 38 ms 1260 KB Output is correct
54 Correct 6 ms 876 KB Output is correct
55 Correct 7 ms 876 KB Output is correct
56 Correct 6 ms 876 KB Output is correct
57 Correct 7 ms 876 KB Output is correct
58 Correct 1 ms 492 KB Output is correct
59 Correct 6 ms 876 KB Output is correct
60 Correct 6 ms 876 KB Output is correct
61 Correct 7 ms 876 KB Output is correct
62 Correct 1 ms 492 KB Output is correct
63 Correct 10 ms 1132 KB Output is correct