oj.uz

답안 #998903

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
998903 2024-06-14T22:30:31 Z whatthemomooofun1729 Pipes (BOI13_pipes) C++17
35 / 100
 36 ms 18064 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);
        }
    }
    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] == 0) {
                    vst[u] = 1;
                    q.push(u);
                }
            }
        }
    }
    if (N == 0) {
        for (int i = 0; i < M; ++i) {
            cout << 2 * x[i] << '\n';
        }
    } else {
        int start = -1;
        vc<pii> f;
        for (int i = 1; i <= N; ++i) {
            if (!vst[i]) {
                start = i;
                break;
            }
        }
        q.push(start);
        while (!q.empty()) {
            int v = q.front();
            q.pop();
            vst[v] = 1;
            fch(u, adj[v]) if (!vst[u.ff]) {
                f[v] = u;
                q.push(u.ff);
            }
        }
        int t = f[start].ff, sum = 0, factor = 1;
        while (t != start) {
            sum += factor * c[t];
            t = f[t].ff;
            factor *= -1;
        }
        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);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 604 KB Execution killed with signal 11
2 Runtime error 1 ms 604 KB Execution killed with signal 11
3 Runtime error 1 ms 604 KB Execution killed with signal 11
4 Runtime error 33 ms 17940 KB Execution killed with signal 11
5 Runtime error 1 ms 600 KB Execution killed with signal 11
6 Runtime error 1 ms 604 KB Execution killed with signal 11
7 Runtime error 1 ms 604 KB Execution killed with signal 11
8 Runtime error 1 ms 604 KB Execution killed with signal 11
9 Runtime error 1 ms 536 KB Execution killed with signal 11
10 Runtime error 1 ms 604 KB Execution killed with signal 11
11 Runtime error 1 ms 604 KB Execution killed with signal 11
12 Runtime error 1 ms 528 KB Execution killed with signal 11
13 Runtime error 29 ms 14416 KB Execution killed with signal 11
14 Runtime error 35 ms 16976 KB Execution killed with signal 11
15 Runtime error 33 ms 18000 KB Execution killed with signal 11
16 Runtime error 29 ms 15448 KB Execution killed with signal 11
17 Runtime error 32 ms 18064 KB Execution killed with signal 11
18 Runtime error 32 ms 18000 KB Execution killed with signal 11
19 Runtime error 27 ms 16468 KB Execution killed with signal 11
20 Runtime error 1 ms 600 KB Execution killed with signal 11
21 Runtime error 1 ms 604 KB Execution killed with signal 11
22 Runtime error 33 ms 18052 KB Execution killed with signal 11
23 Runtime error 33 ms 14420 KB Execution killed with signal 11
24 Runtime error 33 ms 18004 KB Execution killed with signal 11
25 Runtime error 29 ms 15136 KB Execution killed with signal 11

Subtask #2
35.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 604 KB Execution killed with signal 11
2 Runtime error 1 ms 604 KB Execution killed with signal 11
3 Runtime error 28 ms 16524 KB Execution killed with signal 11
4 Correct 2 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 Runtime error 0 ms 604 KB Execution killed with signal 11
8 Runtime error 1 ms 604 KB Execution killed with signal 11
9 Runtime error 1 ms 604 KB Execution killed with signal 11
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 348 KB Output is correct
14 Runtime error 1 ms 604 KB Execution killed with signal 11
15 Runtime error 1 ms 604 KB Execution killed with signal 11
16 Runtime error 1 ms 604 KB Execution killed with signal 11
17 Runtime error 1 ms 604 KB Execution killed with signal 11
18 Correct 0 ms 348 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 476 KB Output is correct
22 Runtime error 1 ms 604 KB Execution killed with signal 11
23 Runtime error 25 ms 13868 KB Execution killed with signal 11
24 Runtime error 30 ms 17236 KB Execution killed with signal 11
25 Runtime error 32 ms 16424 KB Execution killed with signal 11
26 Correct 2 ms 4188 KB Output is correct
27 Correct 2 ms 4320 KB Output is correct
28 Correct 3 ms 4188 KB Output is correct
29 Correct 2 ms 5392 KB Output is correct
30 Runtime error 29 ms 16196 KB Execution killed with signal 11
31 Runtime error 31 ms 16468 KB Execution killed with signal 11
32 Runtime error 30 ms 17748 KB Execution killed with signal 11
33 Runtime error 36 ms 17168 KB Execution killed with signal 11
34 Correct 2 ms 4184 KB Output is correct
35 Correct 1 ms 4188 KB Output is correct
36 Correct 2 ms 4188 KB Output is correct
37 Correct 3 ms 5724 KB Output is correct
38 Runtime error 31 ms 16724 KB Execution killed with signal 11
39 Runtime error 35 ms 17748 KB Execution killed with signal 11
40 Runtime error 33 ms 17232 KB Execution killed with signal 11
41 Runtime error 27 ms 16464 KB Execution killed with signal 11
42 Correct 2 ms 4188 KB Output is correct
43 Correct 2 ms 4188 KB Output is correct
44 Correct 2 ms 4164 KB Output is correct
45 Correct 2 ms 3932 KB Output is correct
46 Runtime error 33 ms 16316 KB Execution killed with signal 11
47 Runtime error 34 ms 17236 KB Execution killed with signal 11
48 Runtime error 30 ms 16720 KB Execution killed with signal 11
49 Runtime error 32 ms 16976 KB Execution killed with signal 11
50 Correct 2 ms 4188 KB Output is correct
51 Correct 2 ms 4316 KB Output is correct
52 Correct 2 ms 4188 KB Output is correct
53 Correct 2 ms 4444 KB Output is correct
54 Runtime error 32 ms 16716 KB Execution killed with signal 11