oj.uz

Submission #260101

# Submission time Handle Problem Language Result Execution time Memory
260101 2020-08-09T10:10:34 Z user202729 Travelling Merchant (APIO17_merchant) C++17
100 / 100
 112 ms 3576 KB 
// 6
#ifndef LOCAL
#define NDEBUG 1
#endif
#include<bits/stdc++.h>

/*
struct Edge{int node, length;};
std::vector<std::vector<Edge>> add;
*/

int main(){
	std::ios::sync_with_stdio(0);std::cin.tie(0);
	int number, numEdge, numItem; std::cin>>number>>numEdge>>numItem;
	struct T{int buy, sell;};
	std::vector<std::vector<T>> cost(number, std::vector<T>(numItem));
	for(auto& it: cost)for(auto& [buy, sell]: it) std::cin>>buy>>sell;

	std::vector<std::vector<int>> time(number, std::vector<int>(number, INT_MAX/2));
	for(int _=0; _<numEdge; ++_){
		int first, sec, length; std::cin>>first>>sec>>length;
		--first;--sec;
		time[first][sec]=std::min(time[first][sec], length);
	}

	for(int k=0; k<number; ++k)
		for(int i=0; i<number; ++i)
			for(int j=0; j<number; ++j)
				time[i][j]=std::min(time[i][j], time[i][k]+time[k][j]);

	for(auto& it: time)for(auto& it: it){
		assert(it>=0);
		assert(it<=INT_MAX/2);
	}

	std::vector<std::vector<int>> maxProfit(number, std::vector<int>(number));
	for(int i=0; i<number; ++i)
		for(int j=0; j<number; ++j){
			int cur=0; // 0 is always achievable by doing nothing
			for(int item=0; item<numItem; ++item)
				if(cost[j][item].sell>=0 and cost[i][item].buy>=0)
					cur=std::max(cur, cost[j][item].sell-cost[i][item].buy);
			maxProfit[i][j]=cur;
		}

	struct V{ // A-B*epsilon (B>=0)
		int64_t value; // least bit=1 -> B=0

		bool operator<(V other) const{return value<other.value;}
		bool operator==(V other) const{return value==other.value;}
		V operator+(V other) const{return {value+other.value-((value|other.value)&1)};}
	};
	assert(V{1}+V{1}==V{1});
	assert(V{1}+V{0}==V{0});
	assert(V{0}+V{1}==V{0});
	assert(V{0}+V{0}==V{0});

	std::vector<std::vector<V>> tmp(number, std::vector<V>(number));
	auto const check=[&](int64_t efficient){
		for(int i=0; i<number; ++i)
			for(int j=0; j<number; ++j){
				int profit=maxProfit[i][j];
				if(i==j) assert(profit==0);
				int time_=time[i][j];
				tmp[i][j]=V{
					time_==INT_MAX/2 ? INT64_MAX/2:
					((time_*efficient-profit)*2+(profit==0))
				};
			}

		for(int k=0; k<number; ++k)
			for(int i=0; i<number; ++i)
				for(int j=0; j<number; ++j)
					tmp[i][j]=std::min(tmp[i][j], tmp[i][k]+tmp[k][j]);

		for(int i=0; i<number; ++i)
			if(tmp[i][i]<V{1})
				return true;
		return false;
	};

	int i=0;
	for(int step=1<<30; step; step>>=1){
		if(check(i+step)) i+=step;
	}
	std::cout<<i<<'\n';
}

Compilation message

merchant.cpp: In function 'int main()':
merchant.cpp:31:31: warning: unused variable 'it' [-Wunused-variable]
  for(auto& it: time)for(auto& it: it){
                               ^~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 102 ms 1272 KB Output is correct
2 Correct 70 ms 572 KB Output is correct
3 Correct 67 ms 760 KB Output is correct
4 Correct 9 ms 384 KB Output is correct
5 Correct 9 ms 384 KB Output is correct
6 Correct 9 ms 384 KB Output is correct
7 Correct 9 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 9 ms 384 KB Output is correct
10 Correct 9 ms 384 KB Output is correct
11 Correct 11 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 9 ms 384 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 384 KB Output is correct
2 Correct 9 ms 440 KB Output is correct
3 Correct 11 ms 384 KB Output is correct
4 Correct 15 ms 456 KB Output is correct
5 Correct 10 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 10 ms 384 KB Output is correct
8 Correct 13 ms 384 KB Output is correct
9 Correct 9 ms 384 KB Output is correct
10 Correct 9 ms 384 KB Output is correct
11 Correct 10 ms 512 KB Output is correct
12 Correct 10 ms 512 KB Output is correct
13 Correct 9 ms 384 KB Output is correct
14 Correct 9 ms 384 KB Output is correct
15 Correct 10 ms 512 KB Output is correct
16 Correct 9 ms 384 KB Output is correct
17 Correct 9 ms 384 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 10 ms 384 KB Output is correct
20 Correct 10 ms 384 KB Output is correct
21 Correct 10 ms 384 KB Output is correct
22 Correct 9 ms 384 KB Output is correct
23 Correct 10 ms 640 KB Output is correct
24 Correct 9 ms 384 KB Output is correct
25 Correct 9 ms 384 KB Output is correct
26 Correct 0 ms 384 KB Output is correct
27 Correct 9 ms 384 KB Output is correct
28 Correct 9 ms 384 KB Output is correct
29 Correct 11 ms 384 KB Output is correct
30 Correct 0 ms 384 KB Output is correct
31 Correct 9 ms 384 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 760 KB Output is correct
2 Correct 109 ms 1272 KB Output is correct
3 Correct 65 ms 632 KB Output is correct
4 Correct 70 ms 640 KB Output is correct
5 Correct 68 ms 640 KB Output is correct
6 Correct 65 ms 588 KB Output is correct
7 Correct 9 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 10 ms 384 KB Output is correct
10 Correct 10 ms 384 KB Output is correct
11 Correct 10 ms 384 KB Output is correct
12 Correct 9 ms 384 KB Output is correct
13 Correct 10 ms 640 KB Output is correct

Subtask #4
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 384 KB Output is correct
2 Correct 9 ms 440 KB Output is correct
3 Correct 11 ms 384 KB Output is correct
4 Correct 15 ms 456 KB Output is correct
5 Correct 10 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 10 ms 384 KB Output is correct
8 Correct 13 ms 384 KB Output is correct
9 Correct 9 ms 384 KB Output is correct
10 Correct 9 ms 384 KB Output is correct
11 Correct 10 ms 512 KB Output is correct
12 Correct 10 ms 512 KB Output is correct
13 Correct 9 ms 384 KB Output is correct
14 Correct 9 ms 384 KB Output is correct
15 Correct 10 ms 512 KB Output is correct
16 Correct 9 ms 384 KB Output is correct
17 Correct 69 ms 760 KB Output is correct
18 Correct 109 ms 1272 KB Output is correct
19 Correct 65 ms 632 KB Output is correct
20 Correct 70 ms 640 KB Output is correct
21 Correct 68 ms 640 KB Output is correct
22 Correct 65 ms 588 KB Output is correct
23 Correct 9 ms 384 KB Output is correct
24 Correct 0 ms 384 KB Output is correct
25 Correct 10 ms 384 KB Output is correct
26 Correct 10 ms 384 KB Output is correct
27 Correct 10 ms 384 KB Output is correct
28 Correct 9 ms 384 KB Output is correct
29 Correct 10 ms 640 KB Output is correct
30 Correct 64 ms 584 KB Output is correct
31 Correct 67 ms 640 KB Output is correct
32 Correct 90 ms 1700 KB Output is correct
33 Correct 68 ms 704 KB Output is correct
34 Correct 67 ms 640 KB Output is correct
35 Correct 67 ms 640 KB Output is correct
36 Correct 111 ms 3192 KB Output is correct
37 Correct 1 ms 384 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 64 ms 512 KB Output is correct
40 Correct 69 ms 760 KB Output is correct
41 Correct 68 ms 620 KB Output is correct
42 Correct 66 ms 512 KB Output is correct
43 Correct 66 ms 512 KB Output is correct
44 Correct 0 ms 384 KB Output is correct
45 Correct 11 ms 512 KB Output is correct
46 Correct 11 ms 512 KB Output is correct
47 Correct 11 ms 512 KB Output is correct
48 Correct 109 ms 3576 KB Output is correct
49 Correct 112 ms 3448 KB Output is correct
50 Correct 1 ms 384 KB Output is correct
51 Correct 102 ms 1272 KB Output is correct
52 Correct 70 ms 572 KB Output is correct
53 Correct 67 ms 760 KB Output is correct
54 Correct 9 ms 384 KB Output is correct
55 Correct 9 ms 384 KB Output is correct
56 Correct 9 ms 384 KB Output is correct
57 Correct 9 ms 384 KB Output is correct
58 Correct 0 ms 384 KB Output is correct
59 Correct 9 ms 384 KB Output is correct
60 Correct 9 ms 384 KB Output is correct
61 Correct 11 ms 384 KB Output is correct
62 Correct 0 ms 384 KB Output is correct
63 Correct 9 ms 384 KB Output is correct