oj.uz

답안 #924217

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
924217 2024-02-08T16:32:54 Z dwuy Cheap flights (LMIO18_pigus_skrydziai) C++14
12 / 100
 3000 ms 51024 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);
    for(int i=1; i<=m; 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 12636 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 28 ms 13400 KB Output is correct
7 Correct 2 ms 12636 KB Output is correct
8 Correct 2 ms 12636 KB Output is correct
9 Correct 2 ms 12636 KB Output is correct
10 Correct 2 ms 12636 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 2 ms 12636 KB Output is correct
16 Correct 2 ms 12632 KB Output is correct
17 Correct 2 ms 12636 KB Output is correct
18 Correct 2 ms 12636 KB Output is correct
19 Correct 3 ms 12888 KB Output is correct
20 Correct 2 ms 12632 KB Output is correct
21 Correct 2 ms 12636 KB Output is correct

Subtask #2
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 12636 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 28 ms 13400 KB Output is correct
7 Correct 2 ms 12636 KB Output is correct
8 Correct 2 ms 12636 KB Output is correct
9 Correct 2 ms 12636 KB Output is correct
10 Correct 2 ms 12636 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 2 ms 12636 KB Output is correct
16 Correct 2 ms 12632 KB Output is correct
17 Correct 2 ms 12636 KB Output is correct
18 Correct 2 ms 12636 KB Output is correct
19 Correct 3 ms 12888 KB Output is correct
20 Correct 2 ms 12632 KB Output is correct
21 Correct 2 ms 12636 KB Output is correct
22 Correct 676 ms 45084 KB Output is correct
23 Correct 2678 ms 39508 KB Output is correct
24 Correct 11 ms 13888 KB Output is correct
25 Correct 4 ms 12892 KB Output is correct
26 Correct 4 ms 13148 KB Output is correct
27 Correct 7 ms 12892 KB Output is correct
28 Correct 318 ms 29232 KB Output is correct
29 Correct 123 ms 17572 KB Output is correct
30 Correct 234 ms 21416 KB Output is correct
31 Correct 3 ms 12636 KB Output is correct
32 Correct 3 ms 12780 KB Output is correct
33 Execution timed out 3098 ms 51024 KB Time limit exceeded
34 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 64 ms 27344 KB Output is correct
2 Correct 169 ms 37848 KB Output is correct
3 Correct 41 ms 22108 KB Output is correct
4 Correct 95 ms 32340 KB Output is correct
5 Correct 184 ms 41388 KB Output is correct
6 Correct 333 ms 20104 KB Output is correct
7 Correct 73 ms 37716 KB Output is correct
8 Correct 93 ms 40532 KB Output is correct
9 Correct 3 ms 15964 KB Output is correct
10 Correct 319 ms 20160 KB Output is correct
11 Execution timed out 3050 ms 40732 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #4
0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 64 ms 27344 KB Output is correct
2 Correct 169 ms 37848 KB Output is correct
3 Correct 41 ms 22108 KB Output is correct
4 Correct 95 ms 32340 KB Output is correct
5 Correct 184 ms 41388 KB Output is correct
6 Correct 333 ms 20104 KB Output is correct
7 Correct 73 ms 37716 KB Output is correct
8 Correct 93 ms 40532 KB Output is correct
9 Correct 3 ms 15964 KB Output is correct
10 Correct 319 ms 20160 KB Output is correct
11 Execution timed out 3050 ms 40732 KB Time limit exceeded
12 Halted 0 ms 0 KB -