oj.uz

Submission #319193

# Submission time Handle Problem Language Result Execution time Memory
319193 2020-11-04T12:53:41 Z AmineWeslati Travelling Merchant (APIO17_merchant) C++14
100 / 100
 208 ms 2540 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 = 4e18;
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,K;
int B[101][1001],S[101][1001];

int g[101][101],p[101][101],g2[101][101];

void floyd_warshall(int adj[101][101]){
	FOR(k,1,N+1) FOR(i,1,N+1) FOR(j,1,N+1)
		ckmin(adj[i][j],adj[i][k]+adj[k][j]);
}

int32_t main() {
    boost; IO();


    cin>>N>>M>>K;
    FOR(i,1,N+1) FOR(j,1,K+1){
    	cin>>B[i][j]>>S[i][j];
    }

    FOR(i,1,N+1) FOR(j,1,N+1){
    	g[i][j]=INF;
    	p[i][j]=0;
    	FOR(k,1,K+1) if(B[i][k]!=-1 && S[j][k]!=-1)
    		ckmax(p[i][j],S[j][k]-B[i][k]);
	}
    FOR(i,0,M){
    	int u,v,w; cin>>u>>v>>w;
    	g[u][v]=w;
    }

    floyd_warshall(g);

    int l=1,r=INF;
    int ans=0;
    while(l<=r){
    	int R=(l+r)/2;
    	FOR(i,1,N+1) FOR(j,1,N+1) g2[i][j]=R*min(g[i][j],INF/R) - p[i][j];

    	floyd_warshall(g2);

    	bool found=0;
    	FOR(i,1,N+1) if(g2[i][i]<=0) found=true;
    	if(found) l=R+1,ans=R;
    	else r=R-1;
    }
    cout << ans << endl;

    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 103 ms 2404 KB Output is correct
2 Correct 69 ms 1388 KB Output is correct
3 Correct 73 ms 1388 KB Output is correct
4 Correct 11 ms 876 KB Output is correct
5 Correct 11 ms 876 KB Output is correct
6 Correct 11 ms 876 KB Output is correct
7 Correct 14 ms 1004 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 11 ms 876 KB Output is correct
10 Correct 12 ms 876 KB Output is correct
11 Correct 12 ms 876 KB Output is correct
12 Correct 1 ms 492 KB Output is correct
13 Correct 11 ms 1004 KB Output is correct

Subtask #2
21.0 / 21.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 178 ms 1644 KB Output is correct
2 Correct 208 ms 2464 KB Output is correct
3 Correct 131 ms 1516 KB Output is correct
4 Correct 149 ms 1772 KB Output is correct
5 Correct 189 ms 1772 KB Output is correct
6 Correct 94 ms 1596 KB Output is correct
7 Correct 28 ms 1004 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 28 ms 1004 KB Output is correct
10 Correct 17 ms 876 KB Output is correct
11 Correct 16 ms 1024 KB Output is correct
12 Correct 14 ms 964 KB Output is correct
13 Correct 14 ms 876 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 876 KB Output is correct
2 Correct 11 ms 876 KB Output is correct
3 Correct 12 ms 876 KB Output is correct
4 Correct 12 ms 876 KB Output is correct
5 Correct 22 ms 1004 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 11 ms 876 KB Output is correct
8 Correct 14 ms 1004 KB Output is correct
9 Correct 12 ms 876 KB Output is correct
10 Correct 14 ms 1004 KB Output is correct
11 Correct 15 ms 1032 KB Output is correct
12 Correct 15 ms 1004 KB Output is correct
13 Correct 12 ms 876 KB Output is correct
14 Correct 14 ms 876 KB Output is correct
15 Correct 14 ms 1004 KB Output is correct
16 Correct 11 ms 876 KB Output is correct
17 Correct 178 ms 1644 KB Output is correct
18 Correct 208 ms 2464 KB Output is correct
19 Correct 131 ms 1516 KB Output is correct
20 Correct 149 ms 1772 KB Output is correct
21 Correct 189 ms 1772 KB Output is correct
22 Correct 94 ms 1596 KB Output is correct
23 Correct 28 ms 1004 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 28 ms 1004 KB Output is correct
26 Correct 17 ms 876 KB Output is correct
27 Correct 16 ms 1024 KB Output is correct
28 Correct 14 ms 964 KB Output is correct
29 Correct 14 ms 876 KB Output is correct
30 Correct 80 ms 1508 KB Output is correct
31 Correct 80 ms 1672 KB Output is correct
32 Correct 92 ms 2532 KB Output is correct
33 Correct 74 ms 1644 KB Output is correct
34 Correct 74 ms 1792 KB Output is correct
35 Correct 79 ms 1644 KB Output is correct
36 Correct 142 ms 2532 KB Output is correct
37 Correct 1 ms 492 KB Output is correct
38 Correct 1 ms 492 KB Output is correct
39 Correct 74 ms 1508 KB Output is correct
40 Correct 91 ms 1644 KB Output is correct
41 Correct 74 ms 1516 KB Output is correct
42 Correct 72 ms 1508 KB Output is correct
43 Correct 76 ms 1388 KB Output is correct
44 Correct 1 ms 364 KB Output is correct
45 Correct 15 ms 1004 KB Output is correct
46 Correct 15 ms 1004 KB Output is correct
47 Correct 14 ms 1004 KB Output is correct
48 Correct 120 ms 2532 KB Output is correct
49 Correct 123 ms 2540 KB Output is correct
50 Correct 1 ms 396 KB Output is correct
51 Correct 103 ms 2404 KB Output is correct
52 Correct 69 ms 1388 KB Output is correct
53 Correct 73 ms 1388 KB Output is correct
54 Correct 11 ms 876 KB Output is correct
55 Correct 11 ms 876 KB Output is correct
56 Correct 11 ms 876 KB Output is correct
57 Correct 14 ms 1004 KB Output is correct
58 Correct 1 ms 364 KB Output is correct
59 Correct 11 ms 876 KB Output is correct
60 Correct 12 ms 876 KB Output is correct
61 Correct 12 ms 876 KB Output is correct
62 Correct 1 ms 492 KB Output is correct
63 Correct 11 ms 1004 KB Output is correct