oj.uz

답안 #974011

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
974011 2024-05-02T15:09:48 Z a_l_i_r_e_z_a 여행하는 상인 (APIO17_merchant) C++17
100 / 100
 58 ms 2272 KB 
// In the name of God
// Hope is last to die

#include <bits/stdc++.h>
using namespace std;
 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC optimize("avx2")

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define pb push_back
// #define int long long
#define S second
#define F first
#define mp make_pair
#define smax(xyxy, yxy) (xyxy) = max((xyxy), (yxy))
#define smin(xyxy, yxy) (xyxy) = min((xyxy), (yxy))
#define all(xyxy) (xyxy).begin(), (xyxy).end()
#define len(xyxy) ((int)(xyxy).size())

const int maxn = 100 + 5, maxk = 1000 + 5;
const ll inf = 1e18 + 7;
ll n, m, K, d[maxn][maxn], df[maxn][maxn], p[maxn][maxn];
ll b[maxn][maxk], s[maxn][maxk];

void floyd(ll adj[maxn][maxn]){
    for(int k = 0; k < n; k++){
        for(int i = 0; i < n; i++){
            for(int j = 0; j < n; j++) smin(adj[i][j], adj[i][k] + adj[k][j]);
        }
    }
}

bool check(int mid){
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            df[i][j] = mid * min(d[i][j], inf / mid) - p[i][j];
        }
    }
    floyd(df);
    for(int i = 0; i < n; i++) if(df[i][i] <= 0) return 1;
    return 0;
}

int32_t main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    
    cin >> n >> m >> K;
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++) d[i][j] = inf;
        for(int k = 0; k < K; k++) cin >> b[i][k] >> s[i][k];
    }
    for(int i = 0; i < m; i++){
        int u, v, w; cin >> u >> v >> w;
        u--, v--;
        d[u][v] = w;
    }
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            for(int k = 0; k < K; k++) if(b[i][k] > -1 && s[j][k] > -1){
                smax(p[i][j], s[j][k] - b[i][k]);
            }
        }
    }
    floyd(d);
    ll l = 0, r = 1e9 + 1;
    while(r - l > 1){
        ll mid = (l + r) / 2;
        if(check(mid)) l = mid;
        else r = mid;
    }
    cout << l << '\n';

    return 0;
}

Compilation message

merchant.cpp:8:28: warning: bad option '-favx2' to pragma 'optimize' [-Wpragmas]
    8 | #pragma GCC optimize("avx2")
      |                            ^
merchant.cpp:30:30: warning: bad option '-favx2' to attribute 'optimize' [-Wattributes]
   30 | void floyd(ll adj[maxn][maxn]){
      |                              ^
merchant.cpp:38:19: warning: bad option '-favx2' to attribute 'optimize' [-Wattributes]
   38 | bool check(int mid){
      |                   ^
merchant.cpp:49:14: warning: bad option '-favx2' to attribute 'optimize' [-Wattributes]
   49 | int32_t main()
      |              ^

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 2136 KB Output is correct
2 Correct 20 ms 1624 KB Output is correct
3 Correct 21 ms 1372 KB Output is correct
4 Correct 3 ms 860 KB Output is correct
5 Correct 3 ms 860 KB Output is correct
6 Correct 4 ms 860 KB Output is correct
7 Correct 4 ms 1112 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 3 ms 944 KB Output is correct
10 Correct 3 ms 856 KB Output is correct
11 Correct 3 ms 860 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 3 ms 860 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 860 KB Output is correct
2 Correct 4 ms 1112 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 3 ms 944 KB Output is correct
5 Correct 3 ms 856 KB Output is correct
6 Correct 3 ms 860 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 3 ms 860 KB Output is correct
9 Correct 3 ms 860 KB Output is correct
10 Correct 3 ms 860 KB Output is correct
11 Correct 3 ms 1044 KB Output is correct
12 Correct 3 ms 860 KB Output is correct
13 Correct 4 ms 860 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 3 ms 860 KB Output is correct
16 Correct 5 ms 860 KB Output is correct
17 Correct 3 ms 860 KB Output is correct
18 Correct 3 ms 900 KB Output is correct
19 Correct 4 ms 856 KB Output is correct
20 Correct 4 ms 860 KB Output is correct
21 Correct 3 ms 992 KB Output is correct
22 Correct 3 ms 860 KB Output is correct
23 Correct 4 ms 860 KB Output is correct
24 Correct 3 ms 860 KB Output is correct
25 Correct 4 ms 860 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 4 ms 860 KB Output is correct
28 Correct 4 ms 860 KB Output is correct
29 Correct 4 ms 860 KB Output is correct
30 Correct 3 ms 860 KB Output is correct
31 Correct 3 ms 860 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 860 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 4 ms 860 KB Output is correct
4 Correct 4 ms 860 KB Output is correct
5 Correct 4 ms 860 KB Output is correct
6 Correct 3 ms 860 KB Output is correct
7 Correct 3 ms 860 KB Output is correct
8 Correct 23 ms 1628 KB Output is correct
9 Correct 43 ms 2268 KB Output is correct
10 Correct 22 ms 1372 KB Output is correct
11 Correct 23 ms 1624 KB Output is correct
12 Correct 25 ms 1824 KB Output is correct
13 Correct 22 ms 1372 KB Output is correct

Subtask #4
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 860 KB Output is correct
2 Correct 3 ms 860 KB Output is correct
3 Correct 3 ms 1044 KB Output is correct
4 Correct 3 ms 860 KB Output is correct
5 Correct 4 ms 860 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 3 ms 860 KB Output is correct
8 Correct 5 ms 860 KB Output is correct
9 Correct 3 ms 860 KB Output is correct
10 Correct 3 ms 900 KB Output is correct
11 Correct 4 ms 856 KB Output is correct
12 Correct 4 ms 860 KB Output is correct
13 Correct 3 ms 992 KB Output is correct
14 Correct 3 ms 860 KB Output is correct
15 Correct 4 ms 860 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 23 ms 1628 KB Output is correct
18 Correct 43 ms 2268 KB Output is correct
19 Correct 22 ms 1372 KB Output is correct
20 Correct 23 ms 1624 KB Output is correct
21 Correct 25 ms 1824 KB Output is correct
22 Correct 22 ms 1372 KB Output is correct
23 Correct 4 ms 860 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 4 ms 860 KB Output is correct
26 Correct 4 ms 860 KB Output is correct
27 Correct 4 ms 860 KB Output is correct
28 Correct 3 ms 860 KB Output is correct
29 Correct 3 ms 860 KB Output is correct
30 Correct 36 ms 2136 KB Output is correct
31 Correct 20 ms 1624 KB Output is correct
32 Correct 21 ms 1372 KB Output is correct
33 Correct 3 ms 860 KB Output is correct
34 Correct 3 ms 860 KB Output is correct
35 Correct 4 ms 860 KB Output is correct
36 Correct 4 ms 1112 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 3 ms 944 KB Output is correct
39 Correct 3 ms 856 KB Output is correct
40 Correct 3 ms 860 KB Output is correct
41 Correct 0 ms 344 KB Output is correct
42 Correct 3 ms 860 KB Output is correct
43 Correct 23 ms 1368 KB Output is correct
44 Correct 22 ms 1680 KB Output is correct
45 Correct 37 ms 2272 KB Output is correct
46 Correct 22 ms 1628 KB Output is correct
47 Correct 22 ms 1628 KB Output is correct
48 Correct 22 ms 1680 KB Output is correct
49 Correct 46 ms 2136 KB Output is correct
50 Correct 1 ms 344 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Correct 21 ms 1372 KB Output is correct
53 Correct 23 ms 1516 KB Output is correct
54 Correct 22 ms 1372 KB Output is correct
55 Correct 21 ms 1372 KB Output is correct
56 Correct 28 ms 1372 KB Output is correct
57 Correct 0 ms 344 KB Output is correct
58 Correct 4 ms 860 KB Output is correct
59 Correct 4 ms 860 KB Output is correct
60 Correct 6 ms 860 KB Output is correct
61 Correct 56 ms 2152 KB Output is correct
62 Correct 58 ms 2132 KB Output is correct
63 Correct 0 ms 344 KB Output is correct