oj.uz

답안 #798181

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
798181 2023-07-30T12:56:28 Z TheSahib 늑대인간 (IOI18_werewolf) C++14
100 / 100
 3624 ms 146416 KB 
#include "werewolf.h"
#include <bits/stdc++.h>
 
using namespace std;
 
const int MAX = 2e5 + 5;
const int BLOCK = 150;
const int LOGMAX = 18;
 
struct order{
    vector<int> v;
    bitset<MAX> st[MAX / BLOCK + 2];
    void preCalc(){
        int p = 0;
        for (int i = 0; i < v.size(); i++)
        {
            if(i % BLOCK == 0){
                p++;
                st[p] = st[p - 1];
            }
            st[p][v[i]] = 1;
        }
    }
    bitset<MAX> query(int p){
        bitset<MAX> ans = st[p / BLOCK];
        for (int i = p / BLOCK * BLOCK; i <= p; i++)
        {
            ans[v[i]] = 1;
        }
        return ans;
    }
};
 
int n;
struct graph{
    vector<int> tree[MAX];
    int par[LOGMAX][MAX];
    order v;
    int timeIn[MAX], timeOut[MAX];
 
    void dfs(int node, int p){
        par[0][node] = p;
        timeIn[node] = v.v.size();
        v.v.push_back(node);
        for(int to:tree[node]){
            if(to == p) continue;
            dfs(to, node);
        }
        timeOut[node] = v.v.size() - 1;
    }
    void preCalc(){
        for (int j = 1; j < LOGMAX; j++)
        {
            for (int i = 0; i < n; i++)
            {
                par[j][i] = par[j - 1][par[j - 1][i]];
            }
        }
        v.preCalc();
    }
    int lift1(int v, int a){
        for(int j = LOGMAX - 1; j >= 0; --j){
            int u = par[j][v];
            if(u >= a){
                v = u;
            }
        }
        return v;
    }
    int lift2(int v, int a){
        for(int j = LOGMAX - 1; j >= 0; --j){
            int u = par[j][v];
            if(u <= a){
                v = u;
            }
        }
        return v;
    }
    bitset<MAX> ask(int node){
        return v.query(timeOut[node]) ^ v.query(timeIn[node] - 1);
    }
};
 
vector<int> g[MAX];
graph tree1, tree2;
 
struct DSU{
    int par[MAX];
    bool b = 0;
    void init(int N, bool _b){
        b = _b;
        memset(par, -1, sizeof(par));
    }
    int get(int node){
        if(par[node] < 0) return node;
        return par[node] = get(par[node]);
    }
    bool unite(int v, int u){
        v = get(v);
        u = get(u);
        if(v == u) return false;
        if(v < u && b) swap(v, u);
        if(v > u && !b) swap(v, u);
        par[v] += par[u];
        par[u] = v;
        return true;
    }
};
 
vector<int> check_validity(int N, vector<int> X, vector<int> Y, vector<int> S, vector<int> E, vector<int> L, vector<int> R) {
    n = N;
    DSU dsu;
    for (int i = 0; i < X.size(); i++)
    {
        g[X[i]].push_back(Y[i]);
        g[Y[i]].push_back(X[i]);
    }
    dsu.init(N, 0);
    for (int node = N - 1; node >= 0; node--)
    {
        for(int to:g[node]){
            if(to < node) continue;
            int a = dsu.get(to);
            if(dsu.unite(node, to)){
                tree1.tree[node].push_back(a);
            }
        }
    }
    dsu.init(N, 1);
    for (int node = 0; node < N; node++)
    {
        for(int to:g[node]){
            if(to > node) continue;
            int a = dsu.get(to);
            if(dsu.unite(node, to)){
                tree2.tree[node].push_back(a);
            }
        }
    }
    tree1.dfs(0, 0);
    tree2.dfs(n - 1, n - 1);
    tree1.preCalc();
    tree2.preCalc();
 
    vector<int> ans(S.size());
    for (int i = 0; i < S.size(); i++)
    {
        int a = tree1.lift1(S[i], L[i]);
        int b = tree2.lift2(E[i], R[i]);
        ans[i] = (tree1.ask(a) & tree2.ask(b)).any();
    }
    return ans;
}

Compilation message

werewolf.cpp: In member function 'void order::preCalc()':
werewolf.cpp:15:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   15 |         for (int i = 0; i < v.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:23: 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:146:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  146 |     for (int i = 0; i < S.size(); i++)
      |                     ~~^~~~~~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 80852 KB Output is correct
2 Correct 29 ms 80800 KB Output is correct
3 Correct 29 ms 80836 KB Output is correct
4 Correct 29 ms 80772 KB Output is correct
5 Correct 30 ms 80828 KB Output is correct
6 Correct 29 ms 80728 KB Output is correct
7 Correct 28 ms 80852 KB Output is correct
8 Correct 28 ms 80832 KB Output is correct
9 Correct 34 ms 80772 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 80852 KB Output is correct
2 Correct 29 ms 80800 KB Output is correct
3 Correct 29 ms 80836 KB Output is correct
4 Correct 29 ms 80772 KB Output is correct
5 Correct 30 ms 80828 KB Output is correct
6 Correct 29 ms 80728 KB Output is correct
7 Correct 28 ms 80852 KB Output is correct
8 Correct 28 ms 80832 KB Output is correct
9 Correct 34 ms 80772 KB Output is correct
10 Correct 57 ms 81692 KB Output is correct
11 Correct 58 ms 81708 KB Output is correct
12 Correct 60 ms 81656 KB Output is correct
13 Correct 57 ms 81748 KB Output is correct
14 Correct 61 ms 81864 KB Output is correct
15 Correct 60 ms 81724 KB Output is correct

Subtask #3
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3624 ms 138468 KB Output is correct
2 Correct 3567 ms 140732 KB Output is correct
3 Correct 3431 ms 139188 KB Output is correct
4 Correct 3120 ms 138436 KB Output is correct
5 Correct 3192 ms 138504 KB Output is correct
6 Correct 3444 ms 138452 KB Output is correct
7 Correct 2911 ms 138448 KB Output is correct
8 Correct 3418 ms 140740 KB Output is correct
9 Correct 2566 ms 139176 KB Output is correct
10 Correct 2200 ms 138556 KB Output is correct
11 Correct 2223 ms 138516 KB Output is correct
12 Correct 2294 ms 138568 KB Output is correct
13 Correct 3344 ms 145732 KB Output is correct
14 Correct 3194 ms 145712 KB Output is correct
15 Correct 3141 ms 145716 KB Output is correct
16 Correct 3182 ms 145728 KB Output is correct
17 Correct 2876 ms 138328 KB Output is correct

Subtask #4
51.0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 80852 KB Output is correct
2 Correct 29 ms 80800 KB Output is correct
3 Correct 29 ms 80836 KB Output is correct
4 Correct 29 ms 80772 KB Output is correct
5 Correct 30 ms 80828 KB Output is correct
6 Correct 29 ms 80728 KB Output is correct
7 Correct 28 ms 80852 KB Output is correct
8 Correct 28 ms 80832 KB Output is correct
9 Correct 34 ms 80772 KB Output is correct
10 Correct 57 ms 81692 KB Output is correct
11 Correct 58 ms 81708 KB Output is correct
12 Correct 60 ms 81656 KB Output is correct
13 Correct 57 ms 81748 KB Output is correct
14 Correct 61 ms 81864 KB Output is correct
15 Correct 60 ms 81724 KB Output is correct
16 Correct 3624 ms 138468 KB Output is correct
17 Correct 3567 ms 140732 KB Output is correct
18 Correct 3431 ms 139188 KB Output is correct
19 Correct 3120 ms 138436 KB Output is correct
20 Correct 3192 ms 138504 KB Output is correct
21 Correct 3444 ms 138452 KB Output is correct
22 Correct 2911 ms 138448 KB Output is correct
23 Correct 3418 ms 140740 KB Output is correct
24 Correct 2566 ms 139176 KB Output is correct
25 Correct 2200 ms 138556 KB Output is correct
26 Correct 2223 ms 138516 KB Output is correct
27 Correct 2294 ms 138568 KB Output is correct
28 Correct 3344 ms 145732 KB Output is correct
29 Correct 3194 ms 145712 KB Output is correct
30 Correct 3141 ms 145716 KB Output is correct
31 Correct 3182 ms 145728 KB Output is correct
32 Correct 2876 ms 138328 KB Output is correct
33 Correct 3520 ms 138608 KB Output is correct
34 Correct 1957 ms 100748 KB Output is correct
35 Correct 3473 ms 140456 KB Output is correct
36 Correct 3442 ms 138872 KB Output is correct
37 Correct 3476 ms 139860 KB Output is correct
38 Correct 3439 ms 139332 KB Output is correct
39 Correct 3218 ms 146064 KB Output is correct
40 Correct 2699 ms 145612 KB Output is correct
41 Correct 2736 ms 139596 KB Output is correct
42 Correct 1992 ms 139012 KB Output is correct
43 Correct 3248 ms 144032 KB Output is correct
44 Correct 3470 ms 139976 KB Output is correct
45 Correct 2493 ms 146416 KB Output is correct
46 Correct 2675 ms 146244 KB Output is correct
47 Correct 3175 ms 145920 KB Output is correct
48 Correct 3151 ms 145836 KB Output is correct
49 Correct 3164 ms 145916 KB Output is correct
50 Correct 3184 ms 145848 KB Output is correct
51 Correct 2263 ms 145352 KB Output is correct
52 Correct 2257 ms 145464 KB Output is correct