oj.uz

Submission #94877

# Submission time Handle Problem Language Result Execution time Memory
94877 2019-01-24T17:10:06 Z WLZ Conspiracy (POI11_kon) C++17
0 / 100
 1811 ms 132096 KB 
#include <bits/stdc++.h>
using namespace std;

int n;
vector< vector<int> > g, tg, mat;
vector<int> was, topoSort, scc;
int cur = 1;
vector<int> as;

void add_edge(int u, int v) {
  g[u].push_back(v);
  tg[v].push_back(u);
}

void dfs1(int u) {
  was[u] = 1;
  for (auto& v : g[u]) {
    if (!was[v]) {
      dfs1(v);
    }
  }
  topoSort.push_back(u);
}

void dfs2(int u) {
  scc[u] = cur;
  was[u] = 1;
  for (auto& v : tg[u]) {
    if (!was[v]) {
      dfs2(v);
    }
  }
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> n;
  mat.assign(n + 1, vector<int>(n + 1, 0));
  g.resize(2 * n + 1);
  tg.resize(2 * n + 1);
  for (int i = 1; i <= n; i++) {
    int k;
    cin >> k;
    while (k--) {
      int a;
      cin >> a;
      mat[a][i] = mat[i][a] = 1;
    }
  }
  for (int i = 1; i <= n - 1; i++) {
    for (int j = i + 1; j <= n; j++) {
      if (mat[i][j]) {
        add_edge(i, j + n);
        add_edge(j, i + n);
      } else {
        add_edge(i + n, j);
        add_edge(j + n, i);
      }
    }
  }
  was.assign(2 * n + 1, 0);
  for (int i = 1; i <= 2 * n; i++) {
    if (!was[i]) {
      dfs1(i);
    }
  }
  reverse(topoSort.begin(), topoSort.end());
  scc.assign(2 * n + 1, -1);
  was.assign(2 * n + 1, 0);
  for (auto& u : topoSort) {
    if (!was[u]) {
      dfs2(u);
      cur++;
    }
  }
  as.resize(n + 1);
  for (int i = 1; i <= n; i++) {
    if (scc[i] == scc[i + n]) {
      cout << 0 << '\n';
      return 0;
    }
    as[i] = scc[i] > scc[i + n];
  }
  int ans = 1;
  int sup = 0, con = 0;
  for (int i = 1; i <= n; i++) {
    if (as[i]) {
      int pos = 1;
      if (con == 1) {
        continue;
      }
      for (int j = 1; j <= n; j++) {
        if (!as[j] && !mat[i][j]) {
          pos = 0;
          break;
        }
      }
      ans += pos;
    } else {
      int pos = 1;
      if (sup == 1) {
        continue;
      }
      for (int j = 1; j <= n; j++) {
        if (as[j] && mat[i][j]) {
          pos = 0;
          break;
        }
      }
      ans += pos;
    }
    sup += 1 - as[i];
    con += as[i];
  }
  vector< set<int> > st(n + 1);
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      if (j == i) {
        continue;
      }
      if (as[i] && mat[i][j]) {
        st[i].insert(j);
      } 
      if (!as[i] && !mat[i][j]) {
        st[i].insert(j);
      }
    }
  }
  for (int i = 1; i <= n - 1; i++) {
    for (int j = i + 1; j <= n; j++) {
      if (as[i] != as[j]) {
        int x = i, y = j;
        if (as[x]) {
          swap(x, y);
        }
        if (((int) st[x].size() == con || ((int) st[x].size() == con - 1 && !st[x].count(y))) && ((int) st[y].size() == sup || ((int) st[y].size() == sup - 1 && !st[y].count(x)))) {
          ans++;
        }
      }
    }
  }
  cout << ans << '\n';
  return 0;
}

Subtask #1
0 / 10.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 10 ms 504 KB Output is correct
3 Incorrect 2 ms 504 KB Output isn't correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 632 KB Output is correct
2 Correct 6 ms 1528 KB Output is correct
3 Incorrect 4 ms 760 KB Output isn't correct

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1016 KB Output is correct
2 Correct 9 ms 2100 KB Output is correct
3 Incorrect 5 ms 1144 KB Output isn't correct

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 82 ms 30328 KB Output is correct
2 Incorrect 240 ms 62188 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 98 ms 36472 KB Output is correct
2 Incorrect 394 ms 92032 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 394 ms 104992 KB Output is correct
2 Runtime error 647 ms 132096 KB Execution killed with signal 9 (could be triggered by violating memory limits)
3 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 564 ms 132096 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 1811 ms 132096 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -