답안 #251609

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
251609 2020-07-22T03:23:57 Z abacaba Pipes (BOI13_pipes) C++14
0 / 100
20 ms 20544 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];
 
set <int> cycles;
vector <int> inc;
 
int pref[2][N];
 
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, int p = -1) {
    used[v] = true;
    pp[v] = p;
    for(int ind : g[v]) {
        int to = gt(ind, v);
        if(to == p)
            continue;
        if(used[to]) {
            if(d[to] > d[v])
                continue;
            if((d[v] - d[to]) & 1) {
                cout << 0 << endl;
                exit(0);
            }
            int u = v;
            while(u != to) {
                unio(u, pp[u]);
                u = pp[u];
            }
        }
        else {
            d[to] = d[v] + 1;
            precheck(to, v);
        }
    }
}

vector <int> now;
 
void dfs(int v) {
    used[v] = true;
    now.pb(v);
    for(int ind : g[v]) {
        int to = gt(ind, v);
        if(used[to] || find(v) != find(to))
            continue;
        dfs(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];
        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];
    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});
        }
    }
    set <int> is = {};
    for(int i = 1; i <= n; ++i)
        if(sz[find(i)] > 1)
            is.insert(find(i));
    if(is.size() > 1)
        return cout << 0 << endl, 0;
    memset(used, 0, sizeof(used));
    for(int i = 1; i <= n; ++i) {
        if(sz[find(i)] > 1 && !used[i]) {
            now.clear();
            dfs(i);
            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:158:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i < now.size(); ++i) {
                    ~~^~~~~~~~~~~~
pipes.cpp:163:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i + 1 < now.size(); ++i) {
                    ~~~~~~^~~~~~~~~~~~
pipes.cpp:166:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int j = 0; j < g[v].size(); ++j)
                        ~~^~~~~~~~~~~~~
pipes.cpp:175: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:183:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main() {
      ^
pipes.cpp: In function 'void setin(std::__cxx11::string)':
pipes.cpp:47:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     freopen(s.c_str(), "r", stdin);
     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Incorrect 13 ms 20480 KB Output isn't correct
2 Incorrect 13 ms 20444 KB Output isn't correct
3 Incorrect 12 ms 20480 KB Output isn't correct
4 Incorrect 12 ms 20480 KB Output isn't correct
5 Incorrect 12 ms 20480 KB Output isn't correct
6 Incorrect 12 ms 20480 KB Output isn't correct
7 Incorrect 13 ms 20480 KB Output isn't correct
8 Incorrect 13 ms 20480 KB Output isn't correct
9 Incorrect 14 ms 20480 KB Output isn't correct
10 Incorrect 13 ms 20480 KB Output isn't correct
11 Incorrect 13 ms 20480 KB Output isn't correct
12 Incorrect 13 ms 20544 KB Output isn't correct
13 Incorrect 12 ms 20480 KB Output isn't correct
14 Incorrect 14 ms 20480 KB Output isn't correct
15 Incorrect 13 ms 20480 KB Output isn't correct
16 Incorrect 15 ms 20480 KB Output isn't correct
17 Incorrect 13 ms 20480 KB Output isn't correct
18 Incorrect 14 ms 20480 KB Output isn't correct
19 Incorrect 19 ms 20480 KB Output isn't correct
20 Incorrect 12 ms 20480 KB Output isn't correct
21 Incorrect 17 ms 20480 KB Output isn't correct
22 Incorrect 13 ms 20388 KB Output isn't correct
23 Incorrect 12 ms 20480 KB Output isn't correct
24 Incorrect 14 ms 20480 KB Output isn't correct
25 Incorrect 14 ms 20480 KB Output isn't correct
# 결과 실행 시간 메모리 Grader output
1 Incorrect 14 ms 20480 KB Output isn't correct
2 Incorrect 15 ms 20480 KB Output isn't correct
3 Incorrect 13 ms 20480 KB Output isn't correct
4 Incorrect 13 ms 20480 KB Output isn't correct
5 Incorrect 14 ms 20480 KB Output isn't correct
6 Incorrect 14 ms 20480 KB Output isn't correct
7 Incorrect 17 ms 20540 KB Output isn't correct
8 Incorrect 20 ms 20480 KB Output isn't correct
9 Incorrect 13 ms 20480 KB Output isn't correct
10 Incorrect 13 ms 20480 KB Output isn't correct
11 Incorrect 12 ms 20480 KB Output isn't correct
12 Incorrect 20 ms 20480 KB Output isn't correct
13 Incorrect 14 ms 20480 KB Output isn't correct
14 Incorrect 13 ms 20480 KB Output isn't correct
15 Incorrect 13 ms 20480 KB Output isn't correct
16 Incorrect 20 ms 20480 KB Output isn't correct
17 Incorrect 13 ms 20480 KB Output isn't correct
18 Incorrect 13 ms 20480 KB Output isn't correct
19 Incorrect 17 ms 20472 KB Output isn't correct
20 Incorrect 13 ms 20480 KB Output isn't correct
21 Incorrect 15 ms 20480 KB Output isn't correct
22 Incorrect 14 ms 20480 KB Output isn't correct
23 Incorrect 13 ms 20480 KB Output isn't correct
24 Incorrect 12 ms 20480 KB Output isn't correct
25 Incorrect 13 ms 20480 KB Output isn't correct
26 Incorrect 15 ms 20480 KB Output isn't correct
27 Incorrect 15 ms 20480 KB Output isn't correct
28 Incorrect 15 ms 20480 KB Output isn't correct
29 Incorrect 14 ms 20492 KB Output isn't correct
30 Incorrect 16 ms 20480 KB Output isn't correct
31 Incorrect 13 ms 20480 KB Output isn't correct
32 Incorrect 13 ms 20480 KB Output isn't correct
33 Incorrect 13 ms 20480 KB Output isn't correct
34 Incorrect 13 ms 20480 KB Output isn't correct
35 Incorrect 13 ms 20480 KB Output isn't correct
36 Incorrect 12 ms 20480 KB Output isn't correct
37 Incorrect 13 ms 20480 KB Output isn't correct
38 Incorrect 12 ms 20480 KB Output isn't correct
39 Incorrect 13 ms 20480 KB Output isn't correct
40 Incorrect 13 ms 20480 KB Output isn't correct
41 Incorrect 12 ms 20480 KB Output isn't correct
42 Incorrect 12 ms 20480 KB Output isn't correct
43 Incorrect 13 ms 20480 KB Output isn't correct
44 Incorrect 12 ms 20480 KB Output isn't correct
45 Incorrect 13 ms 20480 KB Output isn't correct
46 Incorrect 13 ms 20480 KB Output isn't correct
47 Incorrect 14 ms 20480 KB Output isn't correct
48 Incorrect 13 ms 20480 KB Output isn't correct
49 Incorrect 14 ms 20480 KB Output isn't correct
50 Incorrect 12 ms 20480 KB Output isn't correct
51 Incorrect 13 ms 20480 KB Output isn't correct
52 Incorrect 14 ms 20444 KB Output isn't correct
53 Incorrect 14 ms 20480 KB Output isn't correct
54 Incorrect 15 ms 20480 KB Output isn't correct