답안 #263439

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
263439 2020-08-13T17:02:24 Z shayan_p 여행하는 상인 (APIO17_merchant) C++14
100 / 100
115 ms 1448 KB
// And you curse yourself for things you never done

#include<bits/stdc++.h>

#define F first
#define S second
#define PB push_back
#define sz(s) int((s).size())
#define bit(n,k) (((n)>>(k))&1)

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;

const int maxn = 110, maxk = 1010, mod = 1e9 + 7, big = 1e9 + 10;
const ll inf = 4e18;

pii p[maxn][maxk];
ll d[maxn][maxn], dd[maxn][maxn], g[maxn][maxn];
int n;

bool floyd(ll a[][maxn]){    
    for(int i = 0; i < n; i++)
	for(int j = 0; j < n; j++)
	    for(int k = 0; k < n; k++)
		a[j][k] = min(a[j][k], a[j][i] + a[i][k]);
    for(int i = 0; i < n; i++)
	if(a[i][i] <= 0)
	    return 1;
    return 0;
}

int main(){
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie();

    int m, k;
    cin >> n >> m >> k;
    for(int i = 0; i < n; i++){
	for(int j = 0; j < k; j++){
	    cin >> p[i][j].F >> p[i][j].S;
	}
    }
    for(int i = 0; i < n; i++){
	for(int j = 0; j < n; j++)
	    d[i][j] = inf;
	d[i][i] = 0;
    }
    for(int i = 0; i < m; i++){
	int a, b, c;
	cin >> a >> b >> c;
	--a, --b;
	d[a][b] = min(d[a][b], ll(c));
    }
    floyd(d);
    for(int i = 0; i < n; i++){
	for(int j = 0; j < n; j++){
	    if(d[i][j] != inf){
		for(int w = 0; w < k; w++){
		    if(p[i][w].F < p[j][w].S && p[i][w].F != -1 && p[j][w].S != -1)
			dd[i][j] = max(dd[i][j], ll(p[j][w].S - p[i][w].F));
		}
	    }
	}
    }
    
    for(int i = 0; i < n; i++)
	for(int j = 0; j < n; j++)
	    assert(d[i][j] == inf || d[i][j] <= big), assert(dd[i][j] <= big);
    
    int l = 0, r = big;
    while(r-l > 1){
	int mid = (l+r) >> 1;
	for(int i = 0; i < n; i++)
	    for(int j = 0; j < n; j++)
		g[i][j] = (d[i][j] == inf || i == j) ? (inf) : (1ll * mid * d[i][j] - dd[i][j]);
	if(floyd(g))
	    l = mid;
	else
	    r = mid;
    }
    assert(r != big);
    return cout << l << endl, 0;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 66 ms 1272 KB Output is correct
2 Correct 37 ms 968 KB Output is correct
3 Correct 36 ms 896 KB Output is correct
4 Correct 7 ms 640 KB Output is correct
5 Correct 6 ms 640 KB Output is correct
6 Correct 5 ms 640 KB Output is correct
7 Correct 6 ms 640 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 6 ms 640 KB Output is correct
10 Correct 6 ms 640 KB Output is correct
11 Correct 7 ms 640 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 6 ms 640 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 640 KB Output is correct
2 Correct 6 ms 640 KB Output is correct
3 Correct 7 ms 640 KB Output is correct
4 Correct 6 ms 640 KB Output is correct
5 Correct 6 ms 640 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 6 ms 640 KB Output is correct
8 Correct 6 ms 640 KB Output is correct
9 Correct 7 ms 640 KB Output is correct
10 Correct 6 ms 640 KB Output is correct
11 Correct 6 ms 640 KB Output is correct
12 Correct 7 ms 640 KB Output is correct
13 Correct 6 ms 640 KB Output is correct
14 Correct 6 ms 640 KB Output is correct
15 Correct 7 ms 640 KB Output is correct
16 Correct 6 ms 640 KB Output is correct
17 Correct 7 ms 640 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 9 ms 640 KB Output is correct
20 Correct 7 ms 640 KB Output is correct
21 Correct 8 ms 640 KB Output is correct
22 Correct 8 ms 640 KB Output is correct
23 Correct 6 ms 640 KB Output is correct
24 Correct 5 ms 640 KB Output is correct
25 Correct 6 ms 640 KB Output is correct
26 Correct 0 ms 384 KB Output is correct
27 Correct 6 ms 640 KB Output is correct
28 Correct 6 ms 640 KB Output is correct
29 Correct 7 ms 640 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 6 ms 640 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 1024 KB Output is correct
2 Correct 115 ms 1448 KB Output is correct
3 Correct 41 ms 1144 KB Output is correct
4 Correct 41 ms 1024 KB Output is correct
5 Correct 48 ms 1112 KB Output is correct
6 Correct 40 ms 1024 KB Output is correct
7 Correct 7 ms 640 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 9 ms 640 KB Output is correct
10 Correct 7 ms 640 KB Output is correct
11 Correct 8 ms 640 KB Output is correct
12 Correct 8 ms 640 KB Output is correct
13 Correct 6 ms 640 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 640 KB Output is correct
2 Correct 6 ms 640 KB Output is correct
3 Correct 7 ms 640 KB Output is correct
4 Correct 6 ms 640 KB Output is correct
5 Correct 6 ms 640 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 6 ms 640 KB Output is correct
8 Correct 6 ms 640 KB Output is correct
9 Correct 7 ms 640 KB Output is correct
10 Correct 6 ms 640 KB Output is correct
11 Correct 6 ms 640 KB Output is correct
12 Correct 7 ms 640 KB Output is correct
13 Correct 6 ms 640 KB Output is correct
14 Correct 6 ms 640 KB Output is correct
15 Correct 7 ms 640 KB Output is correct
16 Correct 6 ms 640 KB Output is correct
17 Correct 41 ms 1024 KB Output is correct
18 Correct 115 ms 1448 KB Output is correct
19 Correct 41 ms 1144 KB Output is correct
20 Correct 41 ms 1024 KB Output is correct
21 Correct 48 ms 1112 KB Output is correct
22 Correct 40 ms 1024 KB Output is correct
23 Correct 7 ms 640 KB Output is correct
24 Correct 0 ms 384 KB Output is correct
25 Correct 9 ms 640 KB Output is correct
26 Correct 7 ms 640 KB Output is correct
27 Correct 8 ms 640 KB Output is correct
28 Correct 8 ms 640 KB Output is correct
29 Correct 6 ms 640 KB Output is correct
30 Correct 36 ms 1024 KB Output is correct
31 Correct 39 ms 1024 KB Output is correct
32 Correct 55 ms 1408 KB Output is correct
33 Correct 39 ms 1152 KB Output is correct
34 Correct 39 ms 1144 KB Output is correct
35 Correct 53 ms 1024 KB Output is correct
36 Correct 73 ms 1400 KB Output is correct
37 Correct 1 ms 384 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 41 ms 896 KB Output is correct
40 Correct 39 ms 896 KB Output is correct
41 Correct 37 ms 1024 KB Output is correct
42 Correct 48 ms 1024 KB Output is correct
43 Correct 37 ms 896 KB Output is correct
44 Correct 1 ms 384 KB Output is correct
45 Correct 9 ms 640 KB Output is correct
46 Correct 8 ms 640 KB Output is correct
47 Correct 7 ms 640 KB Output is correct
48 Correct 82 ms 1400 KB Output is correct
49 Correct 80 ms 1424 KB Output is correct
50 Correct 1 ms 384 KB Output is correct
51 Correct 66 ms 1272 KB Output is correct
52 Correct 37 ms 968 KB Output is correct
53 Correct 36 ms 896 KB Output is correct
54 Correct 7 ms 640 KB Output is correct
55 Correct 6 ms 640 KB Output is correct
56 Correct 5 ms 640 KB Output is correct
57 Correct 6 ms 640 KB Output is correct
58 Correct 0 ms 384 KB Output is correct
59 Correct 6 ms 640 KB Output is correct
60 Correct 6 ms 640 KB Output is correct
61 Correct 7 ms 640 KB Output is correct
62 Correct 1 ms 384 KB Output is correct
63 Correct 6 ms 640 KB Output is correct