oj.uz

답안 #924223

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
924223 2024-02-08T16:36:51 Z dwuy Cheap flights (LMIO18_pigus_skrydziai) C++14
53 / 100
 2820 ms 44880 KB 
#include <bits/stdc++.h>

#define fastIO ios_base::sync_with_stdio(false); cin.tie(NULL)
#define file(a) freopen(a".inp","r",stdin); freopen(a".out", "w",stdout)
#define fi first
#define se second
#define endl "\n"
#define len(s) int32_t(s.length())
#define MASK(k)(1LL<<(k))
#define TASK "test"
#define int long long

using namespace std;

typedef tuple<int, int, int> tpiii;
typedef pair<double, double> pdd;
typedef pair<int, int> pii;
typedef long long ll;

const long long OO = 1e18;
const int MOD = 1e9 + 7;
const int INF = 1e9;
const int MX = 300005;

int n, m;
int sum[MX];
vector<pii> G[MX];
tpiii edges[MX<<1];
bitset<MX> ok = 0;
int cost[MX];

void nhap(){
    cin >> n >> m;
    for(int i=1; i<=m; i++){
        int u, v, c;
        cin >> u >> v >> c;
        G[u].push_back({v, c});
        G[v].push_back({u, c});
        edges[i] = {c, u, v};
        sum[u] += c;
        sum[v] += c;
    }
}

void solve(){
    int ans = 0;
    for(int i=1; i<=n; i++) ans = max(ans, sum[i]);
    sort(edges+1, edges+1+m, greater<tpiii>());
    for(int i=1; i<=min(m, max(5000LL, min(5000LL, m>>1))); i++){
        int c, u, v;
        tie(c, u, v) = edges[i];
        for(pii &tmp: G[u]){
            int f, k;
            tie(f, k) = tmp;
            ok[f] = 1;
            cost[f] = k;
        }
        for(pii &tmp: G[v]){
            int f, k;
            tie(f, k) = tmp;
            if(ok[f]) ans = max(ans, c + k + cost[f]);
        }
        for(pii &tmp: G[u]){
            int f, k;
            tie(f, k) = tmp;
            ok[f] = cost[f] = 0;
        }
    }
    cout << ans;
}

int32_t main(){
    fastIO;
    //file(TASK);

    nhap();
    solve();

    return 0;
}

Compilation message

pigus_skrydziai.cpp: In function 'void solve()':
pigus_skrydziai.cpp:66:29: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   66 |             ok[f] = cost[f] = 0;
      |                     ~~~~~~~~^~~

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 12888 KB Output is correct
2 Correct 2 ms 12636 KB Output is correct
3 Correct 2 ms 12636 KB Output is correct
4 Correct 2 ms 12636 KB Output is correct
5 Correct 2 ms 12636 KB Output is correct
6 Correct 13 ms 13404 KB Output is correct
7 Correct 3 ms 12636 KB Output is correct
8 Correct 2 ms 12632 KB Output is correct
9 Correct 2 ms 12636 KB Output is correct
10 Correct 2 ms 12632 KB Output is correct
11 Correct 2 ms 12636 KB Output is correct
12 Correct 2 ms 12636 KB Output is correct
13 Correct 2 ms 12636 KB Output is correct
14 Correct 2 ms 12636 KB Output is correct
15 Correct 3 ms 12636 KB Output is correct
16 Correct 2 ms 12636 KB Output is correct
17 Correct 2 ms 12700 KB Output is correct
18 Correct 3 ms 12632 KB Output is correct
19 Correct 3 ms 12888 KB Output is correct
20 Correct 2 ms 12636 KB Output is correct
21 Correct 3 ms 12636 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 12888 KB Output is correct
2 Correct 2 ms 12636 KB Output is correct
3 Correct 2 ms 12636 KB Output is correct
4 Correct 2 ms 12636 KB Output is correct
5 Correct 2 ms 12636 KB Output is correct
6 Correct 13 ms 13404 KB Output is correct
7 Correct 3 ms 12636 KB Output is correct
8 Correct 2 ms 12632 KB Output is correct
9 Correct 2 ms 12636 KB Output is correct
10 Correct 2 ms 12632 KB Output is correct
11 Correct 2 ms 12636 KB Output is correct
12 Correct 2 ms 12636 KB Output is correct
13 Correct 2 ms 12636 KB Output is correct
14 Correct 2 ms 12636 KB Output is correct
15 Correct 3 ms 12636 KB Output is correct
16 Correct 2 ms 12636 KB Output is correct
17 Correct 2 ms 12700 KB Output is correct
18 Correct 3 ms 12632 KB Output is correct
19 Correct 3 ms 12888 KB Output is correct
20 Correct 2 ms 12636 KB Output is correct
21 Correct 3 ms 12636 KB Output is correct
22 Correct 158 ms 44880 KB Output is correct
23 Correct 162 ms 39288 KB Output is correct
24 Correct 10 ms 13656 KB Output is correct
25 Correct 4 ms 12892 KB Output is correct
26 Correct 4 ms 12892 KB Output is correct
27 Correct 6 ms 12892 KB Output is correct
28 Correct 65 ms 25684 KB Output is correct
29 Correct 29 ms 16464 KB Output is correct
30 Correct 43 ms 19036 KB Output is correct
31 Correct 3 ms 12632 KB Output is correct
32 Correct 2 ms 12888 KB Output is correct
33 Correct 161 ms 43268 KB Output is correct
34 Correct 120 ms 42324 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 63 ms 25196 KB Output is correct
2 Correct 144 ms 35624 KB Output is correct
3 Correct 38 ms 21868 KB Output is correct
4 Correct 83 ms 29508 KB Output is correct
5 Correct 145 ms 37044 KB Output is correct
6 Correct 45 ms 18928 KB Output is correct
7 Correct 65 ms 33760 KB Output is correct
8 Correct 76 ms 33840 KB Output is correct
9 Correct 3 ms 15964 KB Output is correct
10 Correct 39 ms 18796 KB Output is correct
11 Correct 2820 ms 37780 KB Output is correct
12 Correct 67 ms 24908 KB Output is correct
13 Correct 2 ms 12636 KB Output is correct
14 Correct 37 ms 19212 KB Output is correct

Subtask #4
0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 63 ms 25196 KB Output is correct
2 Correct 144 ms 35624 KB Output is correct
3 Correct 38 ms 21868 KB Output is correct
4 Correct 83 ms 29508 KB Output is correct
5 Correct 145 ms 37044 KB Output is correct
6 Correct 45 ms 18928 KB Output is correct
7 Correct 65 ms 33760 KB Output is correct
8 Correct 76 ms 33840 KB Output is correct
9 Correct 3 ms 15964 KB Output is correct
10 Correct 39 ms 18796 KB Output is correct
11 Correct 2820 ms 37780 KB Output is correct
12 Correct 67 ms 24908 KB Output is correct
13 Correct 2 ms 12636 KB Output is correct
14 Correct 37 ms 19212 KB Output is correct
15 Correct 2 ms 12888 KB Output is correct
16 Correct 2 ms 12636 KB Output is correct
17 Correct 2 ms 12636 KB Output is correct
18 Correct 2 ms 12636 KB Output is correct
19 Correct 2 ms 12636 KB Output is correct
20 Correct 13 ms 13404 KB Output is correct
21 Correct 3 ms 12636 KB Output is correct
22 Correct 2 ms 12632 KB Output is correct
23 Correct 2 ms 12636 KB Output is correct
24 Correct 2 ms 12632 KB Output is correct
25 Correct 2 ms 12636 KB Output is correct
26 Correct 2 ms 12636 KB Output is correct
27 Correct 2 ms 12636 KB Output is correct
28 Correct 2 ms 12636 KB Output is correct
29 Correct 3 ms 12636 KB Output is correct
30 Correct 2 ms 12636 KB Output is correct
31 Correct 2 ms 12700 KB Output is correct
32 Correct 3 ms 12632 KB Output is correct
33 Correct 3 ms 12888 KB Output is correct
34 Correct 2 ms 12636 KB Output is correct
35 Correct 3 ms 12636 KB Output is correct
36 Correct 158 ms 44880 KB Output is correct
37 Correct 162 ms 39288 KB Output is correct
38 Correct 10 ms 13656 KB Output is correct
39 Correct 4 ms 12892 KB Output is correct
40 Correct 4 ms 12892 KB Output is correct
41 Correct 6 ms 12892 KB Output is correct
42 Correct 65 ms 25684 KB Output is correct
43 Correct 29 ms 16464 KB Output is correct
44 Correct 43 ms 19036 KB Output is correct
45 Correct 3 ms 12632 KB Output is correct
46 Correct 2 ms 12888 KB Output is correct
47 Correct 161 ms 43268 KB Output is correct
48 Correct 120 ms 42324 KB Output is correct
49 Correct 706 ms 28080 KB Output is correct
50 Correct 116 ms 25044 KB Output is correct
51 Correct 1163 ms 27680 KB Output is correct
52 Correct 472 ms 31048 KB Output is correct
53 Correct 1076 ms 21700 KB Output is correct
54 Correct 107 ms 35412 KB Output is correct
55 Correct 181 ms 35668 KB Output is correct
56 Correct 119 ms 30032 KB Output is correct
57 Incorrect 125 ms 31160 KB Output isn't correct
58 Halted 0 ms 0 KB -