oj.uz

Submission #57075

# Submission time Handle Problem Language Result Execution time Memory
57075 2018-07-13T19:18:20 Z Xellos Travelling Merchant (APIO17_merchant) C++14
100 / 100
 894 ms 14504 KB 
#include <bits/stdc++.h>
// iostream is too mainstream
#include <cstdio>
// bitch please
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <cmath>
#include <iomanip>
#include <time.h>
#define dibs reserve
#define OVER9000 1234567890
#define ALL_THE(CAKE,LIE) for(auto LIE =CAKE.begin(); LIE != CAKE.end(); LIE++)
#define tisic 47
#define soclose 1e-8
#define chocolate win
// so much chocolate
#define patkan 9
#define ff first
#define ss second
#define abs(x) ((x < 0)?-(x):x)
#define uint unsigned int
#define dbl long double
#define pi 3.14159265358979323846
using namespace std;
// mylittledoge

typedef long long cat;

#ifdef DONLINE_JUDGE
	// palindromic tree is better than splay tree!
	#define lld I64d
#endif

int main() {
	cin.sync_with_stdio(0);
	cin.tie(0);
	cout << fixed << setprecision(10);
	int N,M,K;
	cin >> N >> M >> K;
	vector< vector<cat> > B(N,vector<cat>(K)), S(N,vector<cat>(K));
	for(int i =0; i < N; i++) for(int j =0; j < K; j++) cin >> B[i][j] >> S[i][j];
	vector< vector<cat> > D(N,vector<cat>(N,1e18));
	for(int i =0; i < N; i++) D[i][i] =0;
	for(int i =0; i < M; i++) {
		int a,b,c;
		cin >> a >> b >> c;
		D[a-1][b-1] =min(D[a-1][b-1],1LL*c);}
	for(int k =0; k < N; k++)
		for(int i =0; i < N; i++) for(int j =0; j < N; j++)
			D[i][j] =min(D[i][j],D[i][k]+D[k][j]);
	vector< vector<cat> > gain(N,vector<cat>(N,0));
	for(int i =0; i < N; i++) for(int k =0; k < K; k++) if(B[i][k] != -1)
		for(int j =0; j < N; j++) if(S[j][k] > B[i][k]) gain[i][j] =max(gain[i][j],S[j][k]-B[i][k]);

	cat ansA =0, ansB =OVER9000;
	while(ansB-ansA > 1) {
		int r =(ansA+ansB)/2;
		vector< vector<cat> > cost(N,vector<cat>(N,-1e18));
		for(int i =0; i < N; i++) for(int j =0; j < N; j++) 
			if(D[i][j] < 1e10) cost[i][j] =gain[i][j]-r*D[i][j];
		for(int a =0; a < 10; a++) {
			bool br =false;
			for(int i =0; i < N; i++) for(int j =0; j < N; j++) if(i != j)
				if(cost[i][j]+cost[j][i] >= 0) br =true;
			if(br) break;
			vector< vector<cat> > cost_nw =cost;
			for(int i =0; i < N; i++) for(int j =0; j < N; j++) if(D[i][j] < 1e10)
				for(int k =0; k < N; k++) if(D[j][k] < 1e10) 
					cost_nw[i][k] =max(cost_nw[i][k],cost[i][j]+cost[j][k]);
			cost =cost_nw;}
		bool ok =false;
		for(int i =0; i < N; i++) for(int j =0; j < N; j++) if(i != j)
			if(cost[i][j]+cost[j][i] >= 0) ok =true;
		if(ok) ansA =r;
		else ansB =r;}
	cout << ansA << "\n";
	return 0;}

// look at my code
// my code is amazing

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 801 ms 3660 KB Output is correct
2 Correct 830 ms 3660 KB Output is correct
3 Correct 465 ms 3660 KB Output is correct
4 Correct 88 ms 3660 KB Output is correct
5 Correct 90 ms 3660 KB Output is correct
6 Correct 111 ms 3660 KB Output is correct
7 Correct 61 ms 3660 KB Output is correct
8 Correct 3 ms 3660 KB Output is correct
9 Correct 82 ms 3660 KB Output is correct
10 Correct 66 ms 3660 KB Output is correct
11 Correct 48 ms 3660 KB Output is correct
12 Correct 3 ms 3660 KB Output is correct
13 Correct 54 ms 3660 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 104 ms 3660 KB Output is correct
2 Correct 78 ms 3660 KB Output is correct
3 Correct 99 ms 3660 KB Output is correct
4 Correct 90 ms 3660 KB Output is correct
5 Correct 121 ms 3660 KB Output is correct
6 Correct 3 ms 3660 KB Output is correct
7 Correct 41 ms 3660 KB Output is correct
8 Correct 58 ms 3660 KB Output is correct
9 Correct 20 ms 3660 KB Output is correct
10 Correct 31 ms 3660 KB Output is correct
11 Correct 71 ms 3660 KB Output is correct
12 Correct 61 ms 3660 KB Output is correct
13 Correct 49 ms 3660 KB Output is correct
14 Correct 81 ms 3660 KB Output is correct
15 Correct 78 ms 3660 KB Output is correct
16 Correct 72 ms 3660 KB Output is correct
17 Correct 100 ms 3660 KB Output is correct
18 Correct 3 ms 3660 KB Output is correct
19 Correct 82 ms 3660 KB Output is correct
20 Correct 76 ms 3660 KB Output is correct
21 Correct 68 ms 3660 KB Output is correct
22 Correct 79 ms 3660 KB Output is correct
23 Correct 32 ms 3660 KB Output is correct
24 Correct 111 ms 3660 KB Output is correct
25 Correct 61 ms 3660 KB Output is correct
26 Correct 3 ms 3660 KB Output is correct
27 Correct 82 ms 3660 KB Output is correct
28 Correct 66 ms 3660 KB Output is correct
29 Correct 48 ms 3660 KB Output is correct
30 Correct 3 ms 3660 KB Output is correct
31 Correct 54 ms 3660 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 787 ms 3660 KB Output is correct
2 Correct 748 ms 6456 KB Output is correct
3 Correct 733 ms 6456 KB Output is correct
4 Correct 793 ms 6456 KB Output is correct
5 Correct 657 ms 6456 KB Output is correct
6 Correct 627 ms 6456 KB Output is correct
7 Correct 100 ms 3660 KB Output is correct
8 Correct 3 ms 3660 KB Output is correct
9 Correct 82 ms 3660 KB Output is correct
10 Correct 76 ms 3660 KB Output is correct
11 Correct 68 ms 3660 KB Output is correct
12 Correct 79 ms 3660 KB Output is correct
13 Correct 32 ms 3660 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 104 ms 3660 KB Output is correct
2 Correct 78 ms 3660 KB Output is correct
3 Correct 99 ms 3660 KB Output is correct
4 Correct 90 ms 3660 KB Output is correct
5 Correct 121 ms 3660 KB Output is correct
6 Correct 3 ms 3660 KB Output is correct
7 Correct 41 ms 3660 KB Output is correct
8 Correct 58 ms 3660 KB Output is correct
9 Correct 20 ms 3660 KB Output is correct
10 Correct 31 ms 3660 KB Output is correct
11 Correct 71 ms 3660 KB Output is correct
12 Correct 61 ms 3660 KB Output is correct
13 Correct 49 ms 3660 KB Output is correct
14 Correct 81 ms 3660 KB Output is correct
15 Correct 78 ms 3660 KB Output is correct
16 Correct 72 ms 3660 KB Output is correct
17 Correct 787 ms 3660 KB Output is correct
18 Correct 748 ms 6456 KB Output is correct
19 Correct 733 ms 6456 KB Output is correct
20 Correct 793 ms 6456 KB Output is correct
21 Correct 657 ms 6456 KB Output is correct
22 Correct 627 ms 6456 KB Output is correct
23 Correct 100 ms 3660 KB Output is correct
24 Correct 3 ms 3660 KB Output is correct
25 Correct 82 ms 3660 KB Output is correct
26 Correct 76 ms 3660 KB Output is correct
27 Correct 68 ms 3660 KB Output is correct
28 Correct 79 ms 3660 KB Output is correct
29 Correct 32 ms 3660 KB Output is correct
30 Correct 756 ms 6456 KB Output is correct
31 Correct 615 ms 6456 KB Output is correct
32 Correct 608 ms 7400 KB Output is correct
33 Correct 738 ms 7400 KB Output is correct
34 Correct 771 ms 7400 KB Output is correct
35 Correct 758 ms 7400 KB Output is correct
36 Correct 894 ms 9820 KB Output is correct
37 Correct 3 ms 9820 KB Output is correct
38 Correct 3 ms 9820 KB Output is correct
39 Correct 669 ms 9820 KB Output is correct
40 Correct 680 ms 9820 KB Output is correct
41 Correct 461 ms 9820 KB Output is correct
42 Correct 576 ms 9820 KB Output is correct
43 Correct 571 ms 9820 KB Output is correct
44 Correct 2 ms 9820 KB Output is correct
45 Correct 45 ms 9820 KB Output is correct
46 Correct 67 ms 9820 KB Output is correct
47 Correct 38 ms 9820 KB Output is correct
48 Correct 778 ms 12440 KB Output is correct
49 Correct 774 ms 14504 KB Output is correct
50 Correct 5 ms 14504 KB Output is correct
51 Correct 801 ms 3660 KB Output is correct
52 Correct 830 ms 3660 KB Output is correct
53 Correct 465 ms 3660 KB Output is correct
54 Correct 88 ms 3660 KB Output is correct
55 Correct 90 ms 3660 KB Output is correct
56 Correct 111 ms 3660 KB Output is correct
57 Correct 61 ms 3660 KB Output is correct
58 Correct 3 ms 3660 KB Output is correct
59 Correct 82 ms 3660 KB Output is correct
60 Correct 66 ms 3660 KB Output is correct
61 Correct 48 ms 3660 KB Output is correct
62 Correct 3 ms 3660 KB Output is correct
63 Correct 54 ms 3660 KB Output is correct