oj.uz

답안 #292092

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
292092 2020-09-06T10:07:16 Z AlexLuchianov 늑대인간 (IOI18_werewolf) C++14
100 / 100
 1867 ms 153080 KB 
#include "werewolf.h"
#include <vector>
#include <cassert>
#include <cmath>
#include <algorithm>
#include <iostream>

using ll = long long;
#define MIN(a, b) (((a) < (b)) ? (a) : (b))
#define MAX(a, b) (((a) < (b)) ? (b) : (a))

int const lgmax = 20;

class Dsu{
public:
  std::vector<int> mult;
  Dsu(int n) {
    mult.resize(n);
    for(int i = 0; i < n; i++)
      mult[i] = i;
  }
  int jump(int gala) {
    if(mult[gala] != gala)
      mult[gala] = jump(mult[gala]);
    return mult[gala];
  }
  void unite(int gala, int galb) {
    gala = jump(gala);
    galb = jump(galb);
    mult[galb] = gala;
  }
};

class SegmentTree{
private:
  std::vector<std::vector<int>> aint;
public:
  SegmentTree(int n) {
    aint.resize(1 + 4 * n);
  }
  void build(int node, int from, int to, std::vector<int> &aux) {
    if(from < to) {
      int mid = (from + to) / 2;
      build(node * 2, from, mid, aux);
      build(node * 2 + 1, mid + 1, to, aux);
      aint[node].resize(to - from + 1);
      std::merge(aint[node * 2].begin(), aint[node * 2].end(),
                 aint[node * 2 + 1].begin(), aint[node * 2 + 1].end(),
                 aint[node].begin());
    } else
      aint[node].push_back(aux[from]);
  }

  bool check_node(int node, int l, int r) {
    std::vector<int>::iterator it = std::lower_bound(aint[node].begin(), aint[node].end(), l);
    if(it == aint[node].end() || r < *it)
      return false;
    return true;
  }
  
  bool check(int node, int from, int to, int x, int y, int l, int r) {
    if(from == x && to == y)
      return check_node(node, l, r);
    else {
      int mid = (from + to) / 2;
      if(x <= mid && y <= mid)
        return check(node * 2, from, mid, x, y, l, r);
      else if(mid + 1 <= x && mid + 1 <= y)
        return check(node * 2 + 1, mid + 1, to, x, y, l, r);
      else 
        return (check(node * 2, from, mid, x, mid, l, r) |
               check(node * 2 + 1, mid + 1, to, mid + 1, y, l, r));
    }
  }
};
std::vector<std::vector<int>> g1, g2;

void dfs(int node, std::vector<std::vector<int>> &g, std::vector<std::vector<int>> &far,
         std::vector<int> &start, std::vector<int> &stop, std::vector<int> &level, int &ptr) {
  start[node] = ptr++;
  for(int h = 0; h < g[node].size();h++) {
    int to = g[node][h];
    far[0][to] = node;
    level[to] = level[node] + 1;
    dfs(to, g, far, start, stop, level, ptr);
  }
  stop[node] = ptr - 1;
}

void computefar(std::vector<std::vector<int>> &far, int n) {
  for(int i = 1;i < far.size(); i++) {
    far[i].resize(n);
    for(int j = 0; j < n; j++)
      far[i][j] = far[i - 1][far[i - 1][j]];
  }
}

std::vector<std::vector<int>> far, far2;

int expand(int node, std::vector<int> &level, std::vector<std::vector<int>> &far, int l, int r) {
  for(int h = far.size() - 1; 0 <= h; h--)
    if((1 << h) <= level[node]) {
      if(l <= far[h][node] && far[h][node] <= r)
        node = far[h][node];
    }
  return node;
}

std::vector<int> check_validity(int N, std::vector<int> X, std::vector<int> Y,
                                std::vector<int> S, std::vector<int> E,
                                std::vector<int> L, std::vector<int> R) {
  std::vector<std::vector<int>> g(N);
  for(int i = 0; i < X.size(); i++) {
    g[X[i]].push_back(Y[i]);
    g[Y[i]].push_back(X[i]);
  }
  Dsu dsu(N);
  g1.resize(N);
  g2.resize(N);

  for(int i = 0; i < N; i++) {
    for(int h = 0; h < g[i].size(); h++) {
      int to = dsu.jump(g[i][h]);
      if(to < i) {
        g1[i].push_back(to);
        dsu.unite(i, to);
      }
    }
  }
  dsu = Dsu(N);
  for(int i = N - 1; 0 <= i; i--) {
    for(int h = 0; h < g[i].size(); h++) {
      int to = dsu.jump(g[i][h]);
      if(i < to) {
        g2[i].push_back(to);
        dsu.unite(i, to);
      }
    }
  }
  int n = N;
  far.resize(1 + lgmax);
  far2.resize(1 + lgmax);
  far[0].resize(n);
  far2[0].resize(n);

  std::vector<int> start(n), stop(n), start2(n), stop2(n), level(n), level2(n);
  int ptr = 0;
  dfs(0, g2, far2, start2, stop2, level2,  ptr);
  ptr = 0;
  dfs(N - 1, g1, far, start, stop, level, ptr);
  
  computefar(far, n);
  computefar(far2, n);
  
  std::vector<int> aux(N);
  for(int i = 0; i < N; i++)
    aux[start[i]] = start2[i];
  SegmentTree aint(N);
  aint.build(1, 0, N - 1, aux);

  std::vector<int> sol(S.size());
  
  for(int h = 0; h < S.size(); h++) {
    int f2 = expand(S[h], level2, far2, L[h], N - 1);
    int f1 = expand(E[h], level, far, 0, R[h]);
    sol[h] = aint.check(1, 0, N - 1, start[f1], stop[f1], start2[f2], stop2[f2]);
  }
  return sol;
}

Compilation message

werewolf.cpp: In function 'void dfs(int, std::vector<std::vector<int> >&, std::vector<std::vector<int> >&, std::vector<int>&, std::vector<int>&, std::vector<int>&, int&)':
werewolf.cpp:81:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   81 |   for(int h = 0; h < g[node].size();h++) {
      |                  ~~^~~~~~~~~~~~~~~~
werewolf.cpp: In function 'void computefar(std::vector<std::vector<int> >&, int)':
werewolf.cpp:91:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   91 |   for(int i = 1;i < far.size(); i++) {
      |                 ~~^~~~~~~~~~~~
werewolf.cpp: In function 'std::vector<int> check_validity(int, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
werewolf.cpp:113:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  113 |   for(int i = 0; i < X.size(); i++) {
      |                  ~~^~~~~~~~~~
werewolf.cpp:122:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  122 |     for(int h = 0; h < g[i].size(); h++) {
      |                    ~~^~~~~~~~~~~~~
werewolf.cpp:132:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  132 |     for(int h = 0; h < g[i].size(); h++) {
      |                    ~~^~~~~~~~~~~~~
werewolf.cpp:163:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  163 |   for(int h = 0; h < S.size(); h++) {
      |                  ~~^~~~~~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 9 ms 2176 KB Output is correct
11 Correct 9 ms 2176 KB Output is correct
12 Correct 7 ms 2048 KB Output is correct
13 Correct 9 ms 2432 KB Output is correct
14 Correct 9 ms 2432 KB Output is correct
15 Correct 10 ms 2176 KB Output is correct

Subtask #3
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 883 ms 121160 KB Output is correct
2 Correct 1572 ms 137480 KB Output is correct
3 Correct 1502 ms 132200 KB Output is correct
4 Correct 1272 ms 130012 KB Output is correct
5 Correct 1292 ms 129768 KB Output is correct
6 Correct 1110 ms 129644 KB Output is correct
7 Correct 828 ms 129504 KB Output is correct
8 Correct 1556 ms 137320 KB Output is correct
9 Correct 1094 ms 132008 KB Output is correct
10 Correct 618 ms 129896 KB Output is correct
11 Correct 626 ms 129768 KB Output is correct
12 Correct 841 ms 129512 KB Output is correct
13 Correct 1443 ms 144492 KB Output is correct
14 Correct 1457 ms 144616 KB Output is correct
15 Correct 1430 ms 144488 KB Output is correct
16 Correct 1423 ms 144644 KB Output is correct
17 Correct 853 ms 129384 KB Output is correct

Subtask #4
51.0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 9 ms 2176 KB Output is correct
11 Correct 9 ms 2176 KB Output is correct
12 Correct 7 ms 2048 KB Output is correct
13 Correct 9 ms 2432 KB Output is correct
14 Correct 9 ms 2432 KB Output is correct
15 Correct 10 ms 2176 KB Output is correct
16 Correct 883 ms 121160 KB Output is correct
17 Correct 1572 ms 137480 KB Output is correct
18 Correct 1502 ms 132200 KB Output is correct
19 Correct 1272 ms 130012 KB Output is correct
20 Correct 1292 ms 129768 KB Output is correct
21 Correct 1110 ms 129644 KB Output is correct
22 Correct 828 ms 129504 KB Output is correct
23 Correct 1556 ms 137320 KB Output is correct
24 Correct 1094 ms 132008 KB Output is correct
25 Correct 618 ms 129896 KB Output is correct
26 Correct 626 ms 129768 KB Output is correct
27 Correct 841 ms 129512 KB Output is correct
28 Correct 1443 ms 144492 KB Output is correct
29 Correct 1457 ms 144616 KB Output is correct
30 Correct 1430 ms 144488 KB Output is correct
31 Correct 1423 ms 144644 KB Output is correct
32 Correct 853 ms 129384 KB Output is correct
33 Correct 1398 ms 131132 KB Output is correct
34 Correct 411 ms 32160 KB Output is correct
35 Correct 1705 ms 136296 KB Output is correct
36 Correct 1263 ms 130920 KB Output is correct
37 Correct 1650 ms 134788 KB Output is correct
38 Correct 1440 ms 132072 KB Output is correct
39 Correct 1564 ms 152680 KB Output is correct
40 Correct 1268 ms 142972 KB Output is correct
41 Correct 1183 ms 133660 KB Output is correct
42 Correct 679 ms 130792 KB Output is correct
43 Correct 1867 ms 143616 KB Output is correct
44 Correct 1575 ms 134804 KB Output is correct
45 Correct 1103 ms 153080 KB Output is correct
46 Correct 1158 ms 152908 KB Output is correct
47 Correct 1451 ms 144616 KB Output is correct
48 Correct 1479 ms 144616 KB Output is correct
49 Correct 1414 ms 144616 KB Output is correct
50 Correct 1416 ms 144548 KB Output is correct
51 Correct 1010 ms 142952 KB Output is correct
52 Correct 1029 ms 143080 KB Output is correct