oj.uz

Submission #48291

# Submission time Handle Problem Language Result Execution time Memory
48291 2018-05-11T12:33:17 Z choikiwon 전압 (JOI14_voltage) C++17
0 / 100
 134 ms 16944 KB 
#include<bits/stdc++.h>
using namespace std;

typedef pair<int, int> pii;

const int MN = 100010;

int N, M;
vector<int> adj[MN], U, V;
int tin[MN], tout[MN], timer, cnt;

struct Fenwick {
    vector<int> tree;
    void init() {
        tree = vector<int>(N + 1, 0);
    }
    void upd(int idx, int val) {
        for(int i = idx + 1; i <= N; i += (i & -i)) tree[i] += val;
    }
    int quer(int a) {
        int ret = 0;
        for(int i = a + 1; i >= 1; i -= (i & -i)) ret += tree[i];
        return ret;
    }
    int quer(int a, int b) {
        return quer(b) - quer(a - 1);
    }
} bit1, bit2;
priority_queue<pii> pq1, pq2;
int ans;

void dfs0(int u, int fe) {
    tin[u] = timer++;
    for(int i = 0; i < adj[u].size(); i++) {
        int e = adj[u][i];
        int v = U[e] + V[e] - u;
        if(e == fe) continue;
        if(tin[v] == -1) {
            dfs0(v, e);
        }
        else if(tin[v] < tin[u]) {
            if(tin[v] % 2 == tin[u] % 2) cnt++;
        }
    }
}

void dfs1(int u, int fe) {
    tin[u] = timer++;
    for(int i = 0; i < adj[u].size(); i++) {
        int e = adj[u][i];
        int v = U[e] + V[e] - u;
        if(e == fe) continue;
        if(tin[v] == -1) {
            dfs1(v, e);
        }
        else if(tin[v] < tin[u]) {
            if(tin[v] % 2 == tin[u] % 2) pq1.push({ tin[v], tin[u] }), bit1.upd(tin[u], 1);
            else pq2.push({ tin[v], tin[u] }), bit2.upd(tin[u], 1);
        }
    }
    tout[u] = timer;

    while(!pq1.empty() && pq1.top().first == tin[u]) bit1.upd(pq1.top().second, -1), pq1.pop();
    while(!pq2.empty() && pq2.top().first == tin[u]) bit2.upd(pq2.top().second, -1), pq2.pop();
    if(u && bit1.quer(tin[u], tout[u] - 1) == cnt && !bit2.quer(tin[u], tout[u] - 1)) ans++;
}

int main() {
    scanf("%d %d", &N, &M);

    int loop = 0;
    for(int i = 0; i < M; i++) {
        int u, v; scanf("%d %d", &u, &v);
        u--; v--;

        if(u == v) {
            loop++;
            continue;
        }

        adj[u].push_back(U.size());
        adj[v].push_back(U.size());
        U.push_back(u);
        V.push_back(v);
    }

    if(loop >= 2) {
        printf("0");
        return 0;
    }

    memset(tin, -1, sizeof(tin));
    for(int i = 0; i < N; i++) if(tin[i] == -1) {
        dfs0(i, -1);
    }

    if(loop) {
        if(!cnt) printf("1");
        else printf("0");
        return 0;
    }

    memset(tin, -1, sizeof(tin));
    timer = 0;
    bit1.init();
    bit2.init();
    for(int i = 0; i < N; i++) if(tin[i] == -1) {
        dfs1(i, -1);
    }

    if(cnt == 1) ans++;
    printf("%d", ans);
}

Compilation message

voltage.cpp: In function 'void dfs0(int, int)':
voltage.cpp:34:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i < adj[u].size(); i++) {
                    ~~^~~~~~~~~~~~~~~
voltage.cpp: In function 'void dfs1(int, int)':
voltage.cpp:49:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i < adj[u].size(); i++) {
                    ~~^~~~~~~~~~~~~~~
voltage.cpp: In function 'int main()':
voltage.cpp:69:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &N, &M);
     ~~~~~^~~~~~~~~~~~~~~~~
voltage.cpp:73:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         int u, v; scanf("%d %d", &u, &v);
                   ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 3192 KB Output is correct
2 Incorrect 5 ms 3192 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 8600 KB Output is correct
2 Correct 134 ms 12880 KB Output is correct
3 Correct 74 ms 12880 KB Output is correct
4 Correct 117 ms 14460 KB Output is correct
5 Correct 12 ms 14460 KB Output is correct
6 Incorrect 100 ms 14460 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 14460 KB Output is correct
2 Correct 54 ms 16284 KB Output is correct
3 Correct 55 ms 16284 KB Output is correct
4 Correct 4 ms 16284 KB Output is correct
5 Incorrect 87 ms 16284 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 84 ms 16284 KB Output is correct
2 Correct 92 ms 16944 KB Output is correct
3 Incorrect 9 ms 16944 KB Output isn't correct
4 Halted 0 ms 0 KB -