oj.uz

Submission #791620

# Submission time Handle Problem Language Result Execution time Memory
791620 2023-07-24T08:07:41 Z Cookie Cheap flights (LMIO18_pigus_skrydziai) C++14
28 / 100
 3000 ms 49524 KB 
#include<bits/stdc++.h>
 
#include<fstream>
 
using namespace std;
ifstream fin("talent.in");
ofstream fout("talent.out");
#define ll long long
#define vt vector
#define pb push_back
#define fi first
#define se second
#define forr(i, a, b) for(int i = a; i < b; i++)
#define dorr(i, a, b) for(int i = a; i >= b; i--)
#define pii pair<int, int>
#define pll pair<ll, ll>
#define int long long
typedef unsigned long long ull;
const int mxn = 3e5 + 3;
int n, m;
ll c[mxn + 1];
struct e{
    ll u, v, w;
};
vt<e>edge;
vt<pii>adj[mxn + 1];
signed main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n >> m;
    forr(i, 0, m){
        int u, v; cin >> u >> v; ll w; cin >> w;
        adj[u].pb({v, w}); adj[v].pb({u, w});
        edge.pb({u, v, w});
        c[u] += w; c[v] += w;
    }
    forr(i, 1, n + 1){
        sort(adj[i].begin(), adj[i].end());
    }
    ll ans  =0;
    forr(i, 1, n + 1)ans = max(ans, c[i]);
    // triangle
    for(auto [u, v, w]: edge){
        bool swapp = adj[u].size() > adj[v].size();
        if(swapp)swap(adj[u], adj[v]);
        for(auto [t, e]: adj[u]){
          if(t == v)continue;
            int id = lower_bound(adj[v].begin(), adj[v].end(), make_pair(t, (ll)-1)) - adj[v].begin();
            if(id != adj[v].size() && adj[v][id].fi == t){
                //cout << u << " " << v  << " " << t << "\n";
                ans = max(ans, e + w + adj[v][id].se);
            }
        }
        if(swapp)swap(adj[u], adj[v]);
    }
    cout << ans;
    return 0;
}

Compilation message

pigus_skrydziai.cpp: In function 'int main()':
pigus_skrydziai.cpp:44:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   44 |     for(auto [u, v, w]: edge){
      |              ^
pigus_skrydziai.cpp:47:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   47 |         for(auto [t, e]: adj[u]){
      |                  ^
pigus_skrydziai.cpp:50:19: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   50 |             if(id != adj[v].size() && adj[v][id].fi == t){
      |                ~~~^~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7380 KB Output is correct
2 Correct 3 ms 7380 KB Output is correct
3 Correct 3 ms 7380 KB Output is correct
4 Correct 5 ms 7252 KB Output is correct
5 Correct 4 ms 7384 KB Output is correct
6 Correct 64 ms 8944 KB Output is correct
7 Correct 3 ms 7308 KB Output is correct
8 Correct 3 ms 7380 KB Output is correct
9 Correct 3 ms 7380 KB Output is correct
10 Correct 4 ms 7380 KB Output is correct
11 Correct 3 ms 7380 KB Output is correct
12 Correct 4 ms 7380 KB Output is correct
13 Correct 3 ms 7380 KB Output is correct
14 Correct 3 ms 7380 KB Output is correct
15 Correct 3 ms 7380 KB Output is correct
16 Correct 3 ms 7380 KB Output is correct
17 Correct 4 ms 7380 KB Output is correct
18 Correct 5 ms 7388 KB Output is correct
19 Correct 5 ms 7508 KB Output is correct
20 Correct 3 ms 7380 KB Output is correct
21 Correct 3 ms 7380 KB Output is correct

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7380 KB Output is correct
2 Correct 3 ms 7380 KB Output is correct
3 Correct 3 ms 7380 KB Output is correct
4 Correct 5 ms 7252 KB Output is correct
5 Correct 4 ms 7384 KB Output is correct
6 Correct 64 ms 8944 KB Output is correct
7 Correct 3 ms 7308 KB Output is correct
8 Correct 3 ms 7380 KB Output is correct
9 Correct 3 ms 7380 KB Output is correct
10 Correct 4 ms 7380 KB Output is correct
11 Correct 3 ms 7380 KB Output is correct
12 Correct 4 ms 7380 KB Output is correct
13 Correct 3 ms 7380 KB Output is correct
14 Correct 3 ms 7380 KB Output is correct
15 Correct 3 ms 7380 KB Output is correct
16 Correct 3 ms 7380 KB Output is correct
17 Correct 4 ms 7380 KB Output is correct
18 Correct 5 ms 7388 KB Output is correct
19 Correct 5 ms 7508 KB Output is correct
20 Correct 3 ms 7380 KB Output is correct
21 Correct 3 ms 7380 KB Output is correct
22 Execution timed out 3073 ms 49524 KB Time limit exceeded
23 Halted 0 ms 0 KB -

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 24144 KB Output is correct
2 Correct 190 ms 36200 KB Output is correct
3 Correct 46 ms 15772 KB Output is correct
4 Correct 100 ms 23784 KB Output is correct
5 Correct 195 ms 35080 KB Output is correct
6 Correct 1183 ms 14584 KB Output is correct
7 Correct 75 ms 27504 KB Output is correct
8 Correct 87 ms 34104 KB Output is correct
9 Correct 5 ms 9704 KB Output is correct
10 Correct 1195 ms 14560 KB Output is correct
11 Correct 90 ms 32508 KB Output is correct
12 Correct 1162 ms 21548 KB Output is correct
13 Correct 4 ms 7380 KB Output is correct
14 Correct 271 ms 14340 KB Output is correct

Subtask #4
0 / 47.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 24144 KB Output is correct
2 Correct 190 ms 36200 KB Output is correct
3 Correct 46 ms 15772 KB Output is correct
4 Correct 100 ms 23784 KB Output is correct
5 Correct 195 ms 35080 KB Output is correct
6 Correct 1183 ms 14584 KB Output is correct
7 Correct 75 ms 27504 KB Output is correct
8 Correct 87 ms 34104 KB Output is correct
9 Correct 5 ms 9704 KB Output is correct
10 Correct 1195 ms 14560 KB Output is correct
11 Correct 90 ms 32508 KB Output is correct
12 Correct 1162 ms 21548 KB Output is correct
13 Correct 4 ms 7380 KB Output is correct
14 Correct 271 ms 14340 KB Output is correct
15 Correct 3 ms 7380 KB Output is correct
16 Correct 3 ms 7380 KB Output is correct
17 Correct 3 ms 7380 KB Output is correct
18 Correct 5 ms 7252 KB Output is correct
19 Correct 4 ms 7384 KB Output is correct
20 Correct 64 ms 8944 KB Output is correct
21 Correct 3 ms 7308 KB Output is correct
22 Correct 3 ms 7380 KB Output is correct
23 Correct 3 ms 7380 KB Output is correct
24 Correct 4 ms 7380 KB Output is correct
25 Correct 3 ms 7380 KB Output is correct
26 Correct 4 ms 7380 KB Output is correct
27 Correct 3 ms 7380 KB Output is correct
28 Correct 3 ms 7380 KB Output is correct
29 Correct 3 ms 7380 KB Output is correct
30 Correct 3 ms 7380 KB Output is correct
31 Correct 4 ms 7380 KB Output is correct
32 Correct 5 ms 7388 KB Output is correct
33 Correct 5 ms 7508 KB Output is correct
34 Correct 3 ms 7380 KB Output is correct
35 Correct 3 ms 7380 KB Output is correct
36 Execution timed out 3073 ms 49524 KB Time limit exceeded
37 Halted 0 ms 0 KB -