답안 #710796

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
710796 2023-03-15T20:20:56 Z pls33 Pipes (BOI13_pipes) C++17
0 / 100
198 ms 22748 KB
// boi2013 d1p3
#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 f80 = long double;
#pragma endregion

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

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

    vi64 initial(v);
    for (auto &i : initial)
    {
        cin >> i;
    }

    vvp32 adj(v);
    vi32 degree(v);
    for (int i = 0; i < e; i++)
    {
        int a, b;
        cin >> a >> b;
        a--;
        b--;

        adj[a].emplace_back(b, i);
        adj[b].emplace_back(a, i);
        degree[a]++;
        degree[b]++;
    }

    // kadangi jungus grafas, pirma atmetam visas medzio dalis ir po to jei lieka
    // nelyginis ciklas (is 2k+1 virsuniu), tai sutvarkom ji
    // jei lieka kazkoks keistas darinys, tai isvedam 0

    queue<int> q;
    for (int i = 0; i < v; i++)
    {
        if (degree[i] == 1)
        {
            q.push(i);
        }
    }

    vi64 fill(e);
    while (!q.empty())
    {
        int cur = q.front();
        q.pop();

        for (auto &[next, edge] : adj[cur])
        {
            fill[edge] += initial[cur];
            initial[next] -= initial[cur];
            degree[next]--;

            if (degree[next] == 1)
            {
                q.push(next);
            }
        }

        degree[cur] = max(0, degree[cur] - 1);
    }

    for (auto &f : fill)
    {
        cout << f * 2 << '\n';
    }

    return 0;
}

Compilation message

pipes.cpp:9: warning: ignoring '#pragma region dalykai' [-Wunknown-pragmas]
    9 | #pragma region dalykai
      | 
pipes.cpp:33: warning: ignoring '#pragma endregion ' [-Wunknown-pragmas]
   33 | #pragma endregion
      |
# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 336 KB Output isn't correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Incorrect 1 ms 340 KB Output isn't correct
4 Incorrect 54 ms 9048 KB Output isn't correct
5 Incorrect 0 ms 212 KB Output isn't correct
6 Incorrect 1 ms 212 KB Output isn't correct
7 Incorrect 0 ms 212 KB Output isn't correct
8 Incorrect 1 ms 212 KB Output isn't correct
9 Incorrect 1 ms 340 KB Output isn't correct
10 Incorrect 1 ms 340 KB Output isn't correct
11 Incorrect 1 ms 340 KB Output isn't correct
12 Incorrect 1 ms 340 KB Output isn't correct
13 Incorrect 41 ms 7292 KB Output isn't correct
14 Incorrect 50 ms 8600 KB Output isn't correct
15 Incorrect 57 ms 9092 KB Output isn't correct
16 Incorrect 51 ms 7756 KB Output isn't correct
17 Incorrect 56 ms 9028 KB Output isn't correct
18 Incorrect 53 ms 9096 KB Output isn't correct
19 Incorrect 63 ms 8384 KB Output isn't correct
20 Incorrect 1 ms 212 KB Output isn't correct
21 Incorrect 1 ms 340 KB Output isn't correct
22 Incorrect 62 ms 9184 KB Output isn't correct
23 Incorrect 40 ms 7264 KB Output isn't correct
24 Incorrect 65 ms 9148 KB Output isn't correct
25 Incorrect 51 ms 7616 KB Output isn't correct
# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Incorrect 1 ms 340 KB Output isn't correct
3 Incorrect 44 ms 8168 KB Output isn't correct
4 Incorrect 54 ms 8396 KB Output isn't correct
5 Incorrect 48 ms 8640 KB Output isn't correct
6 Incorrect 198 ms 22748 KB Output isn't correct
7 Incorrect 0 ms 212 KB Output isn't correct
8 Incorrect 1 ms 212 KB Output isn't correct
9 Incorrect 1 ms 212 KB Output isn't correct
10 Incorrect 1 ms 212 KB Output isn't correct
11 Incorrect 0 ms 212 KB Output isn't correct
12 Incorrect 1 ms 320 KB Output isn't correct
13 Incorrect 1 ms 212 KB Output isn't correct
14 Incorrect 1 ms 212 KB Output isn't correct
15 Incorrect 1 ms 340 KB Output isn't correct
16 Incorrect 1 ms 340 KB Output isn't correct
17 Incorrect 1 ms 340 KB Output isn't correct
18 Incorrect 1 ms 340 KB Output isn't correct
19 Incorrect 1 ms 340 KB Output isn't correct
20 Incorrect 1 ms 340 KB Output isn't correct
21 Incorrect 2 ms 468 KB Output isn't correct
22 Incorrect 1 ms 332 KB Output isn't correct
23 Incorrect 56 ms 6920 KB Output isn't correct
24 Incorrect 55 ms 8556 KB Output isn't correct
25 Incorrect 44 ms 8184 KB Output isn't correct
26 Incorrect 53 ms 8344 KB Output isn't correct
27 Incorrect 48 ms 8000 KB Output isn't correct
28 Incorrect 53 ms 8908 KB Output isn't correct
29 Incorrect 179 ms 19172 KB Output isn't correct
30 Incorrect 57 ms 8096 KB Output isn't correct
31 Incorrect 43 ms 8228 KB Output isn't correct
32 Incorrect 53 ms 8932 KB Output isn't correct
33 Incorrect 57 ms 8564 KB Output isn't correct
34 Incorrect 48 ms 8256 KB Output isn't correct
35 Incorrect 45 ms 8280 KB Output isn't correct
36 Incorrect 51 ms 8664 KB Output isn't correct
37 Incorrect 187 ms 22700 KB Output isn't correct
38 Incorrect 49 ms 8376 KB Output isn't correct
39 Incorrect 51 ms 8972 KB Output isn't correct
40 Incorrect 49 ms 8568 KB Output isn't correct
41 Incorrect 44 ms 8148 KB Output isn't correct
42 Incorrect 51 ms 8000 KB Output isn't correct
43 Incorrect 47 ms 8056 KB Output isn't correct
44 Incorrect 54 ms 8668 KB Output isn't correct
45 Incorrect 144 ms 18936 KB Output isn't correct
46 Incorrect 52 ms 8152 KB Output isn't correct
47 Incorrect 56 ms 8556 KB Output isn't correct
48 Incorrect 45 ms 8140 KB Output isn't correct
49 Incorrect 47 ms 8468 KB Output isn't correct
50 Incorrect 46 ms 8416 KB Output isn't correct
51 Incorrect 49 ms 8524 KB Output isn't correct
52 Incorrect 51 ms 8120 KB Output isn't correct
53 Incorrect 154 ms 19272 KB Output isn't correct
54 Incorrect 48 ms 8268 KB Output isn't correct