oj.uz

Submission #710798

# Submission time Handle Problem Language Result Execution time Memory
710798 2023-03-15T20:24:08 Z pls33 Pipes (BOI13_pipes) C++17
30 / 100
 206 ms 22572 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

using state_t = bitset<(int)1e5>;
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);
        }
    }

    state_t checked;
    vi64 fill(e);
    while (!q.empty())
    {
        int cur = q.front();
        checked[cur] = true;
        q.pop();

        for (auto &[next, edge] : adj[cur])
        {
            if (checked[next])
            {
                continue;
            }
            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
      |

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 68 ms 8928 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 44 ms 7208 KB Output is correct
14 Correct 56 ms 8464 KB Output is correct
15 Correct 88 ms 8932 KB Output is correct
16 Correct 57 ms 7692 KB Output is correct
17 Correct 55 ms 8896 KB Output is correct
18 Correct 59 ms 8908 KB Output is correct
19 Correct 58 ms 8232 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 2 ms 340 KB Output is correct
22 Correct 80 ms 8984 KB Output is correct
23 Correct 56 ms 7184 KB Output is correct
24 Correct 52 ms 8996 KB Output is correct
25 Correct 48 ms 7508 KB Output is correct

Subtask #2
0 / 70.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Incorrect 1 ms 340 KB Output isn't correct
3 Incorrect 50 ms 8080 KB Output isn't correct
4 Incorrect 52 ms 8212 KB Output isn't correct
5 Incorrect 49 ms 8524 KB Output isn't correct
6 Incorrect 206 ms 22572 KB Output isn't correct
7 Incorrect 0 ms 212 KB Output isn't correct
8 Incorrect 0 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 1 ms 212 KB Output isn't correct
12 Incorrect 0 ms 212 KB Output isn't correct
13 Incorrect 1 ms 212 KB Output isn't correct
14 Incorrect 0 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 1 ms 468 KB Output isn't correct
22 Incorrect 1 ms 340 KB Output isn't correct
23 Incorrect 36 ms 6804 KB Output isn't correct
24 Incorrect 69 ms 8372 KB Output isn't correct
25 Incorrect 50 ms 8120 KB Output isn't correct
26 Incorrect 47 ms 8236 KB Output isn't correct
27 Incorrect 41 ms 7980 KB Output isn't correct
28 Incorrect 49 ms 8672 KB Output isn't correct
29 Incorrect 145 ms 18972 KB Output isn't correct
30 Incorrect 46 ms 7900 KB Output isn't correct
31 Incorrect 43 ms 8056 KB Output isn't correct
32 Incorrect 52 ms 8804 KB Output isn't correct
33 Incorrect 45 ms 8420 KB Output isn't correct
34 Incorrect 53 ms 8108 KB Output isn't correct
35 Incorrect 60 ms 8144 KB Output isn't correct
36 Incorrect 55 ms 8572 KB Output isn't correct
37 Incorrect 173 ms 22540 KB Output isn't correct
38 Incorrect 47 ms 8188 KB Output isn't correct
39 Incorrect 49 ms 8780 KB Output isn't correct
40 Incorrect 76 ms 8464 KB Output isn't correct
41 Incorrect 47 ms 8064 KB Output isn't correct
42 Incorrect 40 ms 7940 KB Output isn't correct
43 Incorrect 40 ms 7932 KB Output isn't correct
44 Incorrect 52 ms 8512 KB Output isn't correct
45 Incorrect 162 ms 18848 KB Output isn't correct
46 Incorrect 64 ms 8012 KB Output isn't correct
47 Incorrect 49 ms 8420 KB Output isn't correct
48 Incorrect 46 ms 8012 KB Output isn't correct
49 Incorrect 49 ms 8304 KB Output isn't correct
50 Incorrect 49 ms 8340 KB Output isn't correct
51 Incorrect 53 ms 8444 KB Output isn't correct
52 Incorrect 45 ms 7996 KB Output isn't correct
53 Incorrect 182 ms 19148 KB Output isn't correct
54 Incorrect 49 ms 8124 KB Output isn't correct