oj.uz

답안 #251619

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
251619 2020-07-22T03:45:00 Z abacaba Pipes (BOI13_pipes) C++14
70 / 100
 316 ms 77688 KB 
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <cstring>
#include <chrono>
#include <vector>
#include <map>
#include <random>
#include <set>
#include <algorithm>
#include <math.h>
#include <cstdio>
#include <stdio.h>
#include <queue>
#include <bitset>
#include <cstdlib>
#include <deque>
#include <cassert>
#include <stack>
using namespace std;
 
#define mp make_pair
#define f first
#define se second
#define pb push_back
#define ppb pop_back
#define emb emplace_back
#define ll long long
#define ull unsigned long long
#define cntbit(x) __builtin_popcount(x)
#define endl '\n'
#define uset unordered_set
#define umap unordered_map
#define pii pair<int, int>
#define ld long double
#define pll pair<long long, long long>
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
 
template <typename T> inline T range(T l, T r) {
    return uniform_int_distribution<T>(l, r)(rng);
}
 
inline void setin(string s) {
    freopen(s.c_str(), "r", stdin);
}
 
inline void setout(string s) {
    freopen(s.c_str(), "w", stdout);
}
 
template <typename T> void Min(T &a, T b) {
    a = min(a, b);
}
 
template <typename T> void Max(T &a, T b) {
    a = max(a, b);
}
 
#define int long long
 
const int mod = 1e9 + 7;
const int inf = 2e9;
const int N = 5e5 + 15;
int n, m, a[N];
vector <int> g[N];
bool used[N];
 
set <pii> cur;
int deg[N], d[N];
 
int p[N], sz[N];
pii e[N];

int pp[N];
int ans[N];
 
int pref[2][N];

int cnt;

vector <int> now;

int find(int v) {
    if(v == p[v])
        return v;
    return p[v] = find(p[v]);
}
 
void unio(int a, int b) {
    a = find(a);
    b = find(b);
    if(a != b) {
        if(sz[a] < sz[b])
            swap(a, b);
        p[b] = a;
        sz[a] += sz[b];
    }
}
 
inline int gt(int i, int v) {
    return e[i].f == v ? e[i].se : e[i].f;
}
 
void precheck(int v) {
    used[v] = true;
    for(int ind : g[v]) {
        int to = gt(ind, v);
        if(to == pp[v])
            continue;
        if(used[to]) {
            if(d[to] > d[v])
                continue;
            if((d[v] - d[to]) & 1) {
                cout << 0 << endl;
                exit(0);
            }
            ++cnt;
            if(cnt > 1) {
                cout << 0 << endl;
                exit(0);
            }
            int u = v;
            while(u != to) {
                unio(u, pp[u]);
                u = pp[u];
            }
            u = v;
            while(u != pp[to]) {
                now.pb(u);
                u = pp[u];
            }
        }
        else {
            d[to] = d[v] + 1;
            pp[to] = v;
            precheck(to);
        }
    }
}

inline int get(int k, int l, int r) {
    k = (k + 10) & 1;
    Max(l, 0LL);
    if(l > r)
        return 0;
    return pref[k][r] - (l == 0 ? 0 : pref[k][l-1]);
}
 
void solve_for_cycle() {
    int sum = 0;
    for(int v : now)
        sum += a[v];
    for(int i = 0; i < now.size(); ++i) {
        for(int j = 0; j < 2; ++j)
            pref[j][i] = (i == 0 ? 0 : pref[j][i-1]);
        pref[i & 1][i] += a[now[i]];
    }
    for(int i = 0; i + 1 < now.size(); ++i) {
        int v = now[i];
        int ind = -1;
        for(int j = 0; j < g[v].size(); ++j)
            if(gt(g[v][j], v) == now[i + 1])
                ind = g[v][j];
        // if(ind == -1) {
        //     cout << "ASdasd" << endl;
        //     exit(0);
        // }
        assert(ind != -1);
        int val = get(i + 2, i + 2, now.size() - 1) + get(i - 1, 0, i - 1);
        ans[ind] = sum - 2 * val;
    }
    int v = now.back();
    int ind = -1;
    for(int j = 0; j < g[v].size(); ++j)
        if(gt(g[v][j], v) == now[0])
            ind = g[v][j];
    // if(ind == -1) {
    //     cout << "ASdasd" << endl;
    //     exit(0);
    // }
    assert(ind != -1);
    int val = get(1, 1, now.size() - 2);
    ans[ind] = sum - 2 * val;
}
 
main() {
    for(int i = 0; i < N; ++i)
        p[i] = i, sz[i] = 1;
    ios_base::sync_with_stdio(0); cout.tie(0); cin.tie(0);
    // setin("input.txt");
    cin >> n >> m;
    for(int i = 1; i <= n; ++i)
        cin >> a[i];
    for(int i = 1; i <= m; ++i) {
        cin >> e[i].f >> e[i].se;
        g[e[i].f].pb(i);
        g[e[i].se].pb(i);
    }
    precheck(1);
    for(int i = 1; i <= n; ++i)
        deg[i] = g[i].size(), cur.insert({g[i].size(), i});
    memset(used, 0, sizeof(used));
    while(!cur.empty()) {
        int v = cur.begin()->se;
        cur.erase(cur.begin());
        used[v] = true;
        for(int ind : g[v]) {
            int to = gt(ind, v);
            if(used[to] && deg[to] == 1)
                a[v] -= ans[ind] / 2;
        }
        if(deg[v] != 1)
            continue;
        for(int ind : g[v]) {
            int to = gt(ind, v);
            if(used[to])
                continue;
            ans[ind] = 2 * a[v];
            cur.erase({deg[to], to});
            --deg[to];
            cur.insert({deg[to], to});
        }
    }
    memset(used, 0, sizeof(used));
    solve_for_cycle();
    for(int i = 1; i <= m; ++i)
        cout << ans[i] << endl;
    return 0;
}

Compilation message

pipes.cpp: In function 'void solve_for_cycle()':
pipes.cpp:155:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i < now.size(); ++i) {
                    ~~^~~~~~~~~~~~
pipes.cpp:160:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i + 1 < now.size(); ++i) {
                    ~~~~~~^~~~~~~~~~~~
pipes.cpp:163:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int j = 0; j < g[v].size(); ++j)
                        ~~^~~~~~~~~~~~~
pipes.cpp:176:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int j = 0; j < g[v].size(); ++j)
                    ~~^~~~~~~~~~~~~
pipes.cpp: At global scope:
pipes.cpp:188:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main() {
      ^

Subtask #1
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 48 ms 41208 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Runtime error 35 ms 41216 KB Execution killed with signal 11 (could be triggered by violating memory limits)
3 Runtime error 37 ms 41464 KB Execution killed with signal 11 (could be triggered by violating memory limits)
4 Runtime error 232 ms 72568 KB Execution killed with signal 11 (could be triggered by violating memory limits)
5 Runtime error 35 ms 41208 KB Execution killed with signal 11 (could be triggered by violating memory limits)
6 Runtime error 34 ms 41216 KB Execution killed with signal 11 (could be triggered by violating memory limits)
7 Runtime error 35 ms 41208 KB Execution killed with signal 11 (could be triggered by violating memory limits)
8 Runtime error 34 ms 41216 KB Execution killed with signal 11 (could be triggered by violating memory limits)
9 Runtime error 34 ms 41592 KB Execution killed with signal 11 (could be triggered by violating memory limits)
10 Runtime error 34 ms 41464 KB Execution killed with signal 11 (could be triggered by violating memory limits)
11 Runtime error 37 ms 41472 KB Execution killed with signal 11 (could be triggered by violating memory limits)
12 Runtime error 37 ms 41592 KB Execution killed with signal 11 (could be triggered by violating memory limits)
13 Runtime error 171 ms 66040 KB Execution killed with signal 11 (could be triggered by violating memory limits)
14 Runtime error 215 ms 70776 KB Execution killed with signal 11 (could be triggered by violating memory limits)
15 Runtime error 228 ms 72568 KB Execution killed with signal 11 (could be triggered by violating memory limits)
16 Runtime error 249 ms 67832 KB Execution killed with signal 11 (could be triggered by violating memory limits)
17 Runtime error 251 ms 72628 KB Execution killed with signal 11 (could be triggered by violating memory limits)
18 Runtime error 246 ms 72568 KB Execution killed with signal 11 (could be triggered by violating memory limits)
19 Runtime error 217 ms 77688 KB Execution killed with signal 11 (could be triggered by violating memory limits)
20 Runtime error 43 ms 41208 KB Execution killed with signal 11 (could be triggered by violating memory limits)
21 Runtime error 40 ms 41464 KB Execution killed with signal 11 (could be triggered by violating memory limits)
22 Runtime error 245 ms 72568 KB Execution killed with signal 11 (could be triggered by violating memory limits)
23 Runtime error 213 ms 66040 KB Execution killed with signal 11 (could be triggered by violating memory limits)
24 Runtime error 303 ms 72568 KB Execution killed with signal 11 (could be triggered by violating memory limits)
25 Runtime error 192 ms 67288 KB Execution killed with signal 11 (could be triggered by violating memory limits)

Subtask #2
70.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 20480 KB Output is correct
2 Correct 12 ms 20736 KB Output is correct
3 Correct 90 ms 29816 KB Output is correct
4 Correct 114 ms 32632 KB Output is correct
5 Correct 75 ms 27384 KB Output is correct
6 Correct 316 ms 43000 KB Output is correct
7 Correct 14 ms 20480 KB Output is correct
8 Correct 14 ms 20480 KB Output is correct
9 Correct 12 ms 19968 KB Output is correct
10 Correct 12 ms 19968 KB Output is correct
11 Correct 11 ms 19968 KB Output is correct
12 Correct 18 ms 19968 KB Output is correct
13 Correct 18 ms 19968 KB Output is correct
14 Correct 12 ms 20480 KB Output is correct
15 Correct 12 ms 20736 KB Output is correct
16 Correct 12 ms 20608 KB Output is correct
17 Correct 12 ms 20096 KB Output is correct
18 Correct 12 ms 20096 KB Output is correct
19 Correct 11 ms 20096 KB Output is correct
20 Correct 12 ms 19968 KB Output is correct
21 Correct 12 ms 20096 KB Output is correct
22 Correct 12 ms 20608 KB Output is correct
23 Correct 128 ms 37616 KB Output is correct
24 Correct 173 ms 40692 KB Output is correct
25 Correct 69 ms 29816 KB Output is correct
26 Correct 99 ms 31864 KB Output is correct
27 Correct 108 ms 31992 KB Output is correct
28 Correct 68 ms 26488 KB Output is correct
29 Correct 201 ms 38648 KB Output is correct
30 Correct 231 ms 42096 KB Output is correct
31 Correct 204 ms 43372 KB Output is correct
32 Correct 194 ms 37876 KB Output is correct
33 Correct 71 ms 30840 KB Output is correct
34 Correct 91 ms 31100 KB Output is correct
35 Correct 108 ms 32632 KB Output is correct
36 Correct 65 ms 27640 KB Output is correct
37 Correct 227 ms 43000 KB Output is correct
38 Correct 170 ms 41584 KB Output is correct
39 Correct 192 ms 37112 KB Output is correct
40 Correct 216 ms 40308 KB Output is correct
41 Correct 81 ms 32632 KB Output is correct
42 Correct 84 ms 31476 KB Output is correct
43 Correct 116 ms 33016 KB Output is correct
44 Correct 59 ms 27372 KB Output is correct
45 Correct 196 ms 39672 KB Output is correct
46 Correct 199 ms 42736 KB Output is correct
47 Correct 194 ms 40304 KB Output is correct
48 Correct 152 ms 43112 KB Output is correct
49 Correct 63 ms 28024 KB Output is correct
50 Correct 82 ms 31204 KB Output is correct
51 Correct 74 ms 29688 KB Output is correct
52 Correct 68 ms 28280 KB Output is correct
53 Correct 237 ms 39800 KB Output is correct
54 Correct 177 ms 40936 KB Output is correct