oj.uz

답안 #246856

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
246856 2020-07-10T12:21:19 Z kshitij_sodani 여행하는 상인 (APIO17_merchant) C++14
100 / 100
 90 ms 4344 KB 
#include <bits/stdc++.h>
using namespace std;
typedef int64_t llo;
#define mp make_pair
#define pb push_back
#define a first 
#define b second
//#define endl '\n'
llo n,m,k;
llo dist[101][101];
llo dist2[101][101];

llo min2(llo aa,llo bb){
	if(aa==-1){
		return bb;
	}
	else if(bb==-1){
		return aa;
	}
	return min(aa,bb);
}
llo cost[101][1000][2];
llo cost2[101][101];
vector<pair<pair<llo,llo>,llo>> ed;
//vector<pair<pair<llo,llo>,llo>> ed2;
//llo vis[101][101];
bool check(llo mid){
	if(mid==0){
		return true;
	}
	for(llo i=0;i<n;i++){
		for(llo j=0;j<n;j++){
			dist2[i][j]=min((llo)(LLONG_MAX/2/mid),dist[i][j])*mid-cost2[i][j];
		}
	}
	/*for(auto j:ed){
		dist2[j.a.a][j.a.b]=min((llo)(LLONG_MAX/mid/2),dist[j.a.a][j.a.b])*mid-j.b;
	}*/
	for(llo kk=0;kk<n;kk++){
		for(llo i=0;i<n;i++){
			for(llo j=0;j<n;j++){
				dist2[i][j]=min(dist2[i][j],dist2[i][kk]+dist2[kk][j]);
			}
		}
	}

	for(llo i=0;i<n;i++){
		if(dist2[i][i]<=0){
			return true;
		}
		continue;
	}

	return false;


}
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cin>>n>>m>>k;
	for(llo i=0;i<n;i++){
		for(llo j=0;j<n;j++){
			dist[i][j]=1e18;
		}
	}

	for(llo i=0;i<n;i++){
		for(llo j=0;j<k;j++){
			cin>>cost[i][j][0]>>cost[i][j][1];
		}
	}
	for(llo i=0;i<m;i++){
		llo aa,bb,cc;
		cin>>aa>>bb>>cc;
		dist[aa-1][bb-1]=cc;
	}
	for(llo kk=0;kk<n;kk++){
		for(llo i=0;i<n;i++){
			for(llo j=0;j<n;j++){
				dist[i][j]=min(dist[i][j],dist[i][kk]+dist[kk][j]);
			}
		}
	}
	
	for(llo i=0;i<n;i++){
		for(llo j=0;j<n;j++){
			if(i==j){
				continue;
			}
			llo xx=0;
			for(llo kk=0;kk<k;kk++){
				if(cost[i][kk][0]==-1 or cost[j][kk][1]==-1){
					continue;
				}
				xx=max(xx,-cost[i][kk][0]+cost[j][kk][1]);
			}
			cost2[i][j]=xx;
		//	ed.pb({{i,j},xx});
		}
	}
	llo low=0;
	llo high=1e9;
	while(low<high-1){
		llo mid=(low+high)/2;
		if(check(mid)){
			low=mid;
		}
		else{
			high=mid;
		}
	}
	for(llo i=high;i>=low;i--){
		if(check(i)){
			cout<<i<<endl;
			return 0;
		}
	}

	return 0;
}

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 74 ms 2168 KB Output is correct
2 Correct 40 ms 1024 KB Output is correct
3 Correct 42 ms 1020 KB Output is correct
4 Correct 10 ms 640 KB Output is correct
5 Correct 10 ms 640 KB Output is correct
6 Correct 10 ms 640 KB Output is correct
7 Correct 11 ms 640 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 10 ms 640 KB Output is correct
10 Correct 10 ms 640 KB Output is correct
11 Correct 10 ms 640 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 10 ms 640 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 640 KB Output is correct
2 Correct 11 ms 640 KB Output is correct
3 Correct 11 ms 640 KB Output is correct
4 Correct 10 ms 640 KB Output is correct
5 Correct 11 ms 640 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 10 ms 640 KB Output is correct
8 Correct 10 ms 768 KB Output is correct
9 Correct 10 ms 640 KB Output is correct
10 Correct 11 ms 768 KB Output is correct
11 Correct 11 ms 640 KB Output is correct
12 Correct 11 ms 768 KB Output is correct
13 Correct 10 ms 640 KB Output is correct
14 Correct 13 ms 768 KB Output is correct
15 Correct 12 ms 768 KB Output is correct
16 Correct 15 ms 640 KB Output is correct
17 Correct 17 ms 640 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 11 ms 640 KB Output is correct
20 Correct 11 ms 640 KB Output is correct
21 Correct 11 ms 640 KB Output is correct
22 Correct 16 ms 768 KB Output is correct
23 Correct 10 ms 640 KB Output is correct
24 Correct 10 ms 640 KB Output is correct
25 Correct 11 ms 640 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 10 ms 640 KB Output is correct
28 Correct 10 ms 640 KB Output is correct
29 Correct 10 ms 640 KB Output is correct
30 Correct 5 ms 384 KB Output is correct
31 Correct 10 ms 640 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 45 ms 1152 KB Output is correct
2 Correct 81 ms 2296 KB Output is correct
3 Correct 44 ms 1024 KB Output is correct
4 Correct 48 ms 1152 KB Output is correct
5 Correct 46 ms 1152 KB Output is correct
6 Correct 44 ms 1024 KB Output is correct
7 Correct 17 ms 640 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 11 ms 640 KB Output is correct
10 Correct 11 ms 640 KB Output is correct
11 Correct 11 ms 640 KB Output is correct
12 Correct 16 ms 768 KB Output is correct
13 Correct 10 ms 640 KB Output is correct

Subtask #4
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 640 KB Output is correct
2 Correct 11 ms 640 KB Output is correct
3 Correct 11 ms 640 KB Output is correct
4 Correct 10 ms 640 KB Output is correct
5 Correct 11 ms 640 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 10 ms 640 KB Output is correct
8 Correct 10 ms 768 KB Output is correct
9 Correct 10 ms 640 KB Output is correct
10 Correct 11 ms 768 KB Output is correct
11 Correct 11 ms 640 KB Output is correct
12 Correct 11 ms 768 KB Output is correct
13 Correct 10 ms 640 KB Output is correct
14 Correct 13 ms 768 KB Output is correct
15 Correct 12 ms 768 KB Output is correct
16 Correct 15 ms 640 KB Output is correct
17 Correct 45 ms 1152 KB Output is correct
18 Correct 81 ms 2296 KB Output is correct
19 Correct 44 ms 1024 KB Output is correct
20 Correct 48 ms 1152 KB Output is correct
21 Correct 46 ms 1152 KB Output is correct
22 Correct 44 ms 1024 KB Output is correct
23 Correct 17 ms 640 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 11 ms 640 KB Output is correct
26 Correct 11 ms 640 KB Output is correct
27 Correct 11 ms 640 KB Output is correct
28 Correct 16 ms 768 KB Output is correct
29 Correct 10 ms 640 KB Output is correct
30 Correct 43 ms 1024 KB Output is correct
31 Correct 46 ms 1152 KB Output is correct
32 Correct 67 ms 2680 KB Output is correct
33 Correct 46 ms 1152 KB Output is correct
34 Correct 45 ms 1280 KB Output is correct
35 Correct 45 ms 1280 KB Output is correct
36 Correct 83 ms 4088 KB Output is correct
37 Correct 5 ms 384 KB Output is correct
38 Correct 5 ms 384 KB Output is correct
39 Correct 44 ms 1024 KB Output is correct
40 Correct 54 ms 1152 KB Output is correct
41 Correct 44 ms 1024 KB Output is correct
42 Correct 44 ms 1024 KB Output is correct
43 Correct 44 ms 1024 KB Output is correct
44 Correct 5 ms 384 KB Output is correct
45 Correct 11 ms 768 KB Output is correct
46 Correct 12 ms 896 KB Output is correct
47 Correct 12 ms 896 KB Output is correct
48 Correct 90 ms 4344 KB Output is correct
49 Correct 89 ms 4220 KB Output is correct
50 Correct 5 ms 384 KB Output is correct
51 Correct 74 ms 2168 KB Output is correct
52 Correct 40 ms 1024 KB Output is correct
53 Correct 42 ms 1020 KB Output is correct
54 Correct 10 ms 640 KB Output is correct
55 Correct 10 ms 640 KB Output is correct
56 Correct 10 ms 640 KB Output is correct
57 Correct 11 ms 640 KB Output is correct
58 Correct 5 ms 384 KB Output is correct
59 Correct 10 ms 640 KB Output is correct
60 Correct 10 ms 640 KB Output is correct
61 Correct 10 ms 640 KB Output is correct
62 Correct 5 ms 384 KB Output is correct
63 Correct 10 ms 640 KB Output is correct