oj.uz

답안 #656969

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
656969 2022-11-08T14:49:59 Z pls33 Cheap flights (LMIO18_pigus_skrydziai) C++17
100 / 100
 354 ms 42584 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

#pragma region dalykai
using p32 = pair<int, int>;
using p32u = pair<uint32_t, uint32_t>;
using p64 = pair<int64_t, int64_t>;
using p64u = pair<uint64_t, uint64_t>;
using vi16 = vector<int16_t>;
using vi16u = vector<uint16_t>;
using vi32 = vector<int>;
using vi32u = vector<uint32_t>;
using vi64 = vector<int64_t>;
using vi64u = vector<uint64_t>;
using vp32 = vector<p32>;
using vp32u = vector<p32u>;
using vp64 = vector<p64>;
using vp64u = vector<p64u>;
using vvi32 = vector<vi32>;
using vvi32u = vector<vi32u>;
using vvi64 = vector<vi64>;
using vvi64u = vector<vi64u>;
using vvp32 = vector<vp32>;
using vvp32u = vector<vp32u>;
using vvp64 = vector<vp64>;
using vvp64u = vector<vp64u>;

using pf32 = pair<float, float>;
using pf64 = pair<double, double>;
using pf80 = pair<long double, long double>;
using vf32 = vector<float>;
using vf64 = vector<double>;
using vf80 = vector<long double>;
using vpf32 = vector<pf32>;
using vpf64 = vector<pf64>;
using vpf80 = vector<pf80>;
using vvf32 = vector<vf32>;
using vvf64 = vector<vf64>;
using vvf80 = vector<vf80>;
using vvpf32 = vector<vpf32>;
using vvpf64 = vector<vpf64>;
using vvpf80 = vector<vpf80>;

template <typename key, typename val>
using ord_map = tree<key, val, less<key>, rb_tree_tag,
                     tree_order_statistics_node_update>;

template <typename key>
using ord_set = tree<key, null_type, less<key>, rb_tree_tag,
                     tree_order_statistics_node_update>;

const int BUF_SZ = 1 << 15;
inline namespace fast_in
{
    char buf[BUF_SZ];
    int pos;
    int len;

    char next_char(FILE *f)
    {
        if (pos == len)
        {
            pos = 0;
            len = (int)fread(buf, 1, BUF_SZ, f);

            if (!len)
            {
                return EOF;
            }
        }

        return buf[pos++];
    }

    int read_int(FILE *f)
    {
        int x;
        char ch;
        int sgn = 1;

        while (!isdigit(ch = next_char(f)))
        {
            if (ch == '-')
            {
                sgn *= -1;
            }
        }

        x = ch - '0';
        while (isdigit(ch = next_char(f)))
        {
            x = x * 10 + (ch - '0');
        }

        return x * sgn;
    }
}

/**
 * @brief gale programos flush_out kviest!!
 */
inline namespace fast_out
{
    char buf[BUF_SZ];
    int pos;

    void flush_out(FILE *f)
    {
        fwrite(buf, 1, pos, f);
        pos = 0;
    }

    void write_char(char c, FILE *f)
    {
        if (pos == BUF_SZ)
        {
            flush_out(f);
        }

        buf[pos++] = c;
    }

    void write_int(int x, FILE *f)
    {
        static char num_buf[100];

        if (x < 0)
        {
            write_char('-', f);
            x *= -1;
        }

        int len = 0;
        for (; x >= 10; x /= 10)
        {
            num_buf[len++] = (char)('0' + (x % 10));
        }

        write_char((char)('0' + x), f);
        while (len)
        {
            write_char(num_buf[--len], f);
        }
        write_char('\n', f);
    }
}
#pragma endregion

int main()
{
#ifndef _AAAAAAAAA
    ios_base::sync_with_stdio(false);
    cin.tie(0);
#else
    freopen("flight.in", "r", stdin);
#ifndef __linux__
    atexit([]()
           {
        freopen("con", "r", stdin);
        system("pause"); });
#endif
#endif

    int v, e;
    cin >> v >> e;

    vi64 sum(v);
    vvp32 adj(v), weight(v);
    for (int i = 0; i < e; i++)
    {
        int a, b, w;
        cin >> a >> b >> w;

        a--;
        b--;

        sum[a] += w;
        sum[b] += w;

        adj[a].emplace_back(b, w);
        adj[b].emplace_back(a, w);

        weight[a].emplace_back(w, b);
        weight[b].emplace_back(w, a);
    }

    for (int i = 0; i < v; i++)
    {
        sort(adj[i].begin(), adj[i].end());
        sort(weight[i].rbegin(), weight[i].rend());
    }

    int64_t result = *max_element(sum.begin(), sum.end());

    for (int i = 0; i < v; i++)
    {
        if (adj[i].size() < 2)
        {
            continue;
        }

        int a = weight[i][0].second, b = weight[i][1].second;
        p32 __b = {b, 0};
        auto it = lower_bound(adj[a].begin(), adj[a].end(), __b);

        if (it == adj[a].end() || it->first != b)
        {
            continue;
        }

        int64_t cur = (int64_t)it->second + weight[i][0].first + weight[i][1].first;
        result = max(result, cur);
    }

    cout << result << '\n';

    return 0;
}

Compilation message

pigus_skrydziai.cpp:8: warning: ignoring '#pragma region dalykai' [-Wunknown-pragmas]
    8 | #pragma region dalykai
      | 
pigus_skrydziai.cpp:151: warning: ignoring '#pragma endregion ' [-Wunknown-pragmas]
  151 | #pragma endregion
      |

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 7 ms 1352 KB Output is correct
7 Correct 1 ms 324 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 320 KB Output is correct
13 Correct 1 ms 328 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 324 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 2 ms 468 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 0 ms 212 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 7 ms 1352 KB Output is correct
7 Correct 1 ms 324 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 320 KB Output is correct
13 Correct 1 ms 328 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 324 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 2 ms 468 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 271 ms 24016 KB Output is correct
23 Correct 191 ms 25180 KB Output is correct
24 Correct 9 ms 1720 KB Output is correct
25 Correct 3 ms 724 KB Output is correct
26 Correct 3 ms 724 KB Output is correct
27 Correct 3 ms 468 KB Output is correct
28 Correct 110 ms 12620 KB Output is correct
29 Correct 33 ms 5056 KB Output is correct
30 Correct 56 ms 6924 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 193 ms 28860 KB Output is correct
34 Correct 120 ms 25224 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 124 ms 35544 KB Output is correct
2 Correct 306 ms 35548 KB Output is correct
3 Correct 84 ms 13388 KB Output is correct
4 Correct 178 ms 25744 KB Output is correct
5 Correct 342 ms 32164 KB Output is correct
6 Correct 33 ms 5540 KB Output is correct
7 Correct 113 ms 31828 KB Output is correct
8 Correct 129 ms 36940 KB Output is correct
9 Correct 11 ms 16852 KB Output is correct
10 Correct 29 ms 5676 KB Output is correct
11 Correct 96 ms 26308 KB Output is correct
12 Correct 79 ms 10860 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 42 ms 6092 KB Output is correct

Subtask #4
47.0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 124 ms 35544 KB Output is correct
2 Correct 306 ms 35548 KB Output is correct
3 Correct 84 ms 13388 KB Output is correct
4 Correct 178 ms 25744 KB Output is correct
5 Correct 342 ms 32164 KB Output is correct
6 Correct 33 ms 5540 KB Output is correct
7 Correct 113 ms 31828 KB Output is correct
8 Correct 129 ms 36940 KB Output is correct
9 Correct 11 ms 16852 KB Output is correct
10 Correct 29 ms 5676 KB Output is correct
11 Correct 96 ms 26308 KB Output is correct
12 Correct 79 ms 10860 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 42 ms 6092 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 328 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 7 ms 1352 KB Output is correct
21 Correct 1 ms 324 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 320 KB Output is correct
27 Correct 1 ms 328 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 324 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 2 ms 468 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 271 ms 24016 KB Output is correct
37 Correct 191 ms 25180 KB Output is correct
38 Correct 9 ms 1720 KB Output is correct
39 Correct 3 ms 724 KB Output is correct
40 Correct 3 ms 724 KB Output is correct
41 Correct 3 ms 468 KB Output is correct
42 Correct 110 ms 12620 KB Output is correct
43 Correct 33 ms 5056 KB Output is correct
44 Correct 56 ms 6924 KB Output is correct
45 Correct 1 ms 332 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 193 ms 28860 KB Output is correct
48 Correct 120 ms 25224 KB Output is correct
49 Correct 152 ms 17084 KB Output is correct
50 Correct 105 ms 13204 KB Output is correct
51 Correct 183 ms 21676 KB Output is correct
52 Correct 165 ms 18268 KB Output is correct
53 Correct 78 ms 18228 KB Output is correct
54 Correct 151 ms 23816 KB Output is correct
55 Correct 354 ms 42584 KB Output is correct
56 Correct 200 ms 28280 KB Output is correct
57 Correct 254 ms 37072 KB Output is correct
58 Correct 98 ms 12196 KB Output is correct
59 Correct 196 ms 23140 KB Output is correct
60 Correct 187 ms 18736 KB Output is correct
61 Correct 142 ms 16204 KB Output is correct