oj.uz

답안 #998916

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
998916 2024-06-14T23:15:08 Z whatthemomooofun1729 Pipes (BOI13_pipes) C++17
74.0741 / 100
 66 ms 9340 KB 
#include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <stack>
#include <map>
#include <queue>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <cstring>
#include <cmath>
#include <functional>
#include <cassert>
#include <iomanip>
#include <numeric>
#include <bitset>
#include <sstream>
#include <chrono>
#include <random>

#define ff first
#define ss second
#define PB push_back
#define sz(x) int(x.size())
#define rsz resize
#define fch(xxx, yyy) for (auto xxx : yyy) // abusive notation
#define all(x) (x).begin(),(x).end()
#define eps 1e-9

// more abusive notation (use at your own risk):
//#define int ll

using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vll = vector<ll>;

// debugging
void __print(int x) {std::cerr << x;}
void __print(ll x) {std::cerr << x;} /* remember to uncomment this when not using THE MACRO */
void __print(unsigned x) {std::cerr << x;}
void __print(ull x) {std::cerr << x;}
void __print(float x) {std::cerr << x;}
void __print(double x) {std::cerr << x;}
void __print(ld x) {std::cerr << x;}
void __print(char x) {std::cerr << '\'' << x << '\'';}
void __print(const char *x) {std::cerr << '\"' << x << '\"';}
void __print(const string& x) {std::cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V> void __print(const pair<T, V> &x) {std::cerr << '{'; __print(x.ff); std::cerr << ", "; __print(x.ss); std::cerr << '}';}
template<typename T> void __print(const T& x) {int f = 0; std::cerr << '{'; for (auto &i: x) std::cerr << (f++ ? ", " : ""), __print(i); std::cerr << "}";}
void _print() {std::cerr << "]\n";}
template <typename T, typename... V> void _print(T t, V... v) {__print(t); if (sizeof...(v)) std::cerr << ", "; _print(v...);}
void println() {std::cerr << ">--------------------<" << endl;}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif

// templates
template <class T> bool ckmin(T &a, const T &b) {return b<a ? a = b, 1 : 0;}
template <class T> bool ckmax(T &a, const T &b) {return b>a ? a = b, 1 : 0;}
template <class T> using gr = greater<T>;
template <class T> using vc = vector<T>;
template <class T> using p_q = priority_queue<T>;
template <class T> using pqg = priority_queue<T, vc<T>, gr<T>>;
template <class T1, class T2> using pr = pair<T1, T2>;
mt19937_64 rng_ll(chrono::steady_clock::now().time_since_epoch().count());
int rng(int M) {return (int)(rng_ll()%M);} /*returns any random number in [0, M) */

// const variables
constexpr int INF = (int)2e9;
constexpr int MOD = 998244353;
constexpr ll LL_INF = (ll)3e18;
constexpr int mod = (int)1e9 + 7;
constexpr ll inverse = 500000004LL; // inverse of 2 modulo 1e9 + 7

void setIO(const string& str) {// fast input/output
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    if (str.empty()) return;
    freopen((str + ".in").c_str(), "r", stdin);
    freopen((str + ".out").c_str(), "w", stdout);
}

int N, M;
vc<vc<pii>> adj;
vi deg, vst, c, x;

signed main() { // TIME YOURSELF !!!
    setIO("");
    cin >> N >> M;
    adj.rsz(N+1), deg.rsz(N+1, 0), vst.rsz(N+1, 0), c.rsz(N+1), x.rsz(M);
    if (M > N) {
        cout << 0;
        return 0;
    }
    for (int i = 1; i <= N; ++i) {
        cin >> c[i];
    }
    for (int i = 0; i < M; ++i) {
        int a, b;
        cin >> a >> b;
        adj[a].PB({b, i});
        adj[b].PB({a, i});
        deg[a]++, deg[b]++;
    }
    queue<int> q;
    for (int i = 1; i <= N; ++i) {
        if (deg[i] == 1) {
            vst[i] = 1;
            q.push(i);
        }
    }
    int n = N;
    while (!q.empty()) {
        int v = q.front(); // 'tis a leaf
        q.pop();
        n--;
        fch(to, adj[v]) {
            int u = to.ff;
            if (!vst[u]) {
                x[to.ss] = c[v];
                c[v] -= x[to.ss], c[u] -= x[to.ss];
                deg[u]--;
                if (deg[u] == 1) {
                    vst[u] = 1;
                    q.push(u);
                }
            }
        }
    }
    for (int i = 1; i <= N; ++i) {
        if (c[i] == 0) continue;
        fch(u, adj[i]) {
            if (c[u.ff] != 0) {
                x[u.ss] = c[u.ff];
                break;
            }
        }
    }
    if (n == 0) {
        for (int i = 0; i < M; ++i) {
            cout << 2 * x[i] << '\n';
        }
    } else {
        int start = -1;
        vc<pii> f(N+1);
        for (int i = 1; i <= N; ++i) {
            if (!vst[i]) {
                start = i;
                break;
            }
        }
        vst[start] = 1;
        q.push(start);
        int vert, L = 1;
        while (!q.empty()) {
            int v = q.front();
            vert = v;
            q.pop();
            fch(u, adj[v]) if (!vst[u.ff]) {
                f[v] = u;
                vst[u.ff] = 1;
                q.push(u.ff);
                break; // there must be exactly one neighboring vertex
            }
        }
        fch(u, adj[vert]) {
            if (u.ff == start) f[vert] = u;
        }
        int t = f[start].ff, sum = 0, factor = 1;
        while (t != start) {
            L++;
            sum += factor * c[t];
            t = f[t].ff;
            factor *= -1;
        }
        sum += factor * c[start];
        assert(sum%2 == 0);
        if (L%2 == 0) {
            cout << 0;
            return 0;
        }
        sum >>= 1;
        x[f[start].ss] = sum;
        int w = sum;
        t = f[start].ff;
        while (t != start) {
            x[f[t].ss] = c[t] - w;
            t = f[t].ff;
            w = x[f[t].ss];
        }
        for (int i = 0; i < M; ++i) {
            cout << 2 * x[i] << '\n';
        }
    }
    return 0;
}

// TLE -> TRY NOT USING DEFINE INT LONG LONG
// CE -> CHECK LINE 45
// 5000 * 5000 size matrices are kinda big (potential mle)
// Do something, start simpler

Compilation message

pipes.cpp: In function 'void setIO(const string&)':
pipes.cpp:88:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   88 |     freopen((str + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
pipes.cpp:89:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   89 |     freopen((str + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
pipes.cpp: In function 'int main()':
pipes.cpp:175:24: warning: 'vert' may be used uninitialized in this function [-Wmaybe-uninitialized]
  175 |         fch(u, adj[vert]) {
      |                        ^

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 34 ms 8532 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 32 ms 7028 KB Output is correct
14 Correct 40 ms 8248 KB Output is correct
15 Correct 39 ms 8528 KB Output is correct
16 Correct 33 ms 7248 KB Output is correct
17 Correct 34 ms 8540 KB Output is correct
18 Correct 34 ms 8760 KB Output is correct
19 Correct 32 ms 8020 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 37 ms 8556 KB Output is correct
23 Correct 26 ms 6996 KB Output is correct
24 Correct 34 ms 8536 KB Output is correct
25 Correct 29 ms 7296 KB Output is correct

Subtask #2
44.0740740741 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Correct 29 ms 8104 KB Output is correct
4 Correct 3 ms 4188 KB Output is correct
5 Correct 2 ms 4188 KB Output is correct
6 Correct 3 ms 5724 KB Output is correct
7 Incorrect 0 ms 348 KB Output isn't correct
8 Incorrect 0 ms 348 KB Output isn't correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Incorrect 0 ms 348 KB Output isn't correct
15 Incorrect 1 ms 348 KB Output isn't correct
16 Incorrect 0 ms 348 KB Output isn't correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Incorrect 1 ms 348 KB Output isn't correct
23 Incorrect 36 ms 7324 KB Output isn't correct
24 Incorrect 37 ms 9052 KB Output isn't correct
25 Correct 33 ms 8292 KB Output is correct
26 Correct 2 ms 4188 KB Output is correct
27 Correct 2 ms 4188 KB Output is correct
28 Correct 2 ms 4188 KB Output is correct
29 Correct 2 ms 5524 KB Output is correct
30 Incorrect 36 ms 8540 KB Output isn't correct
31 Incorrect 39 ms 8536 KB Output isn't correct
32 Incorrect 42 ms 9188 KB Output isn't correct
33 Correct 32 ms 8532 KB Output is correct
34 Correct 2 ms 4184 KB Output is correct
35 Correct 3 ms 4188 KB Output is correct
36 Correct 2 ms 4188 KB Output is correct
37 Correct 3 ms 5720 KB Output is correct
38 Incorrect 39 ms 8788 KB Output isn't correct
39 Incorrect 66 ms 9340 KB Output isn't correct
40 Incorrect 36 ms 9040 KB Output isn't correct
41 Correct 38 ms 8272 KB Output is correct
42 Correct 2 ms 4188 KB Output is correct
43 Correct 2 ms 4220 KB Output is correct
44 Correct 2 ms 4188 KB Output is correct
45 Correct 1 ms 3932 KB Output is correct
46 Incorrect 38 ms 8540 KB Output isn't correct
47 Incorrect 41 ms 9092 KB Output isn't correct
48 Incorrect 38 ms 8796 KB Output isn't correct
49 Correct 30 ms 8528 KB Output is correct
50 Correct 2 ms 4184 KB Output is correct
51 Correct 2 ms 4188 KB Output is correct
52 Correct 2 ms 4208 KB Output is correct
53 Correct 2 ms 4444 KB Output is correct
54 Incorrect 36 ms 8624 KB Output isn't correct