oj.uz

답안 #251608

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
251608 2020-07-22T03:20:31 Z abacaba Pipes (BOI13_pipes) C++14
90.9259 / 100
 380 ms 73968 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];
    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});
        }
    }
    int cnt = 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();
            ++cnt;
        }
    }
    if(cnt > 1)
        return cout << 0 << endl, 0;
    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:182:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main() {
      ^

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 20480 KB Output is correct
2 Correct 11 ms 20480 KB Output is correct
3 Correct 11 ms 20608 KB Output is correct
4 Correct 236 ms 36348 KB Output is correct
5 Correct 11 ms 20480 KB Output is correct
6 Correct 11 ms 20488 KB Output is correct
7 Correct 11 ms 20480 KB Output is correct
8 Correct 12 ms 20480 KB Output is correct
9 Correct 12 ms 20608 KB Output is correct
10 Correct 12 ms 20608 KB Output is correct
11 Correct 13 ms 20608 KB Output is correct
12 Correct 12 ms 20608 KB Output is correct
13 Correct 151 ms 33144 KB Output is correct
14 Correct 182 ms 35576 KB Output is correct
15 Correct 201 ms 36344 KB Output is correct
16 Correct 155 ms 33912 KB Output is correct
17 Correct 228 ms 36472 KB Output is correct
18 Correct 212 ms 36344 KB Output is correct
19 Correct 243 ms 38908 KB Output is correct
20 Correct 12 ms 20480 KB Output is correct
21 Correct 12 ms 20608 KB Output is correct
22 Correct 199 ms 36344 KB Output is correct
23 Correct 148 ms 33016 KB Output is correct
24 Correct 215 ms 36472 KB Output is correct
25 Correct 172 ms 33656 KB Output is correct

Subtask #2
60.9259259259 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 20480 KB Output is correct
2 Correct 11 ms 20736 KB Output is correct
3 Correct 92 ms 29848 KB Output is correct
4 Runtime error 208 ms 72572 KB Execution killed with signal 11 (could be triggered by violating memory limits)
5 Correct 178 ms 35448 KB Output is correct
6 Correct 326 ms 43128 KB Output is correct
7 Correct 12 ms 20480 KB Output is correct
8 Correct 11 ms 20448 KB Output is correct
9 Correct 11 ms 19968 KB Output is correct
10 Correct 15 ms 20480 KB Output is correct
11 Runtime error 35 ms 41216 KB Execution killed with signal 11 (could be triggered by violating memory limits)
12 Correct 13 ms 20480 KB Output is correct
13 Correct 12 ms 19968 KB Output is correct
14 Correct 11 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 11 ms 20096 KB Output is correct
18 Correct 12 ms 20608 KB Output is correct
19 Runtime error 35 ms 41592 KB Execution killed with signal 11 (could be triggered by violating memory limits)
20 Correct 12 ms 20608 KB Output is correct
21 Correct 12 ms 20096 KB Output is correct
22 Correct 12 ms 20608 KB Output is correct
23 Correct 148 ms 35960 KB Output is correct
24 Correct 246 ms 38904 KB Output is correct
25 Correct 76 ms 29816 KB Output is correct
26 Correct 172 ms 39544 KB Output is correct
27 Runtime error 253 ms 72616 KB Execution killed with signal 11 (could be triggered by violating memory limits)
28 Correct 232 ms 35960 KB Output is correct
29 Correct 200 ms 38584 KB Output is correct
30 Correct 208 ms 40568 KB Output is correct
31 Correct 174 ms 40824 KB Output is correct
32 Correct 287 ms 36856 KB Output is correct
33 Correct 70 ms 30840 KB Output is correct
34 Correct 181 ms 39032 KB Output is correct
35 Runtime error 311 ms 72448 KB Execution killed with signal 11 (could be triggered by violating memory limits)
36 Correct 177 ms 35720 KB Output is correct
37 Correct 271 ms 43080 KB Output is correct
38 Correct 204 ms 40056 KB Output is correct
39 Correct 224 ms 36472 KB Output is correct
40 Correct 380 ms 38648 KB Output is correct
41 Correct 112 ms 32632 KB Output is correct
42 Correct 194 ms 39288 KB Output is correct
43 Runtime error 263 ms 73968 KB Execution killed with signal 11 (could be triggered by violating memory limits)
44 Correct 243 ms 35448 KB Output is correct
45 Correct 185 ms 39800 KB Output is correct
46 Correct 221 ms 41336 KB Output is correct
47 Correct 226 ms 38776 KB Output is correct
48 Correct 174 ms 40824 KB Output is correct
49 Correct 63 ms 28024 KB Output is correct
50 Correct 207 ms 39032 KB Output is correct
51 Runtime error 204 ms 65916 KB Execution killed with signal 11 (could be triggered by violating memory limits)
52 Correct 150 ms 36728 KB Output is correct
53 Correct 184 ms 39780 KB Output is correct
54 Correct 194 ms 39416 KB Output is correct