oj.uz

Submission #546360

# Submission time Handle Problem Language Result Execution time Memory
546360 2022-04-07T11:17:58 Z hoanghq2004 Werewolf (IOI18_werewolf) C++14
15 / 100
 4000 ms 110160 KB 
#include <bits/stdc++.h>
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include "werewolf.h"

using namespace __gnu_pbds;
using namespace std;

template <typename T>
using ordered_set = tree <T, null_type, less <T>, rb_tree_tag, tree_order_statistics_node_update>;

const int N = 4e5 + 10;

vector <int> g[N];
int a[N];

struct DSU {
    int n, ord[N];
    int in[N], out[N];
    int root[N];
    vector <int> e[N];
    DSU(int _n) {
        n = _n;
        for (int i = 0; i < n; ++i) root[i] = i;
    }
    int Find(int u) {
        return (u == root[u] ? u : root[u] = Find(root[u]));
    }
    void Union(int u, int v) {
        if ((u = Find(u)) == (v = Find(v))) return;
        e[n].push_back(u);
        e[n].push_back(v);
        root[u] = n, root[v] = n;
        root[n] = n;
        ++n;
    }
    int ti = 0;
    void dfs(int u) {
        if (e[u].size()) {
            in[u] = 1e9, out[u] = - 1e9;
            for (auto v: e[u]) dfs(v), in[u] = min(in[u], in[v]), out[u] = max(out[u], out[v]);
        } else {
            ord[ti] = u;
            in[u] = out[u] = ti;
            ++ti;
        }
    }
    void run() {
        dfs(n - 1);
    }
};

int node[N][2];
vector <pair <int, int> > QL[N], QR[N];

vector<int> check_validity(int n, vector<int> X, vector<int> Y, vector<int> S, vector<int> E, vector<int> L, vector<int> R) {
    int m = X.size();
    int q = S.size();
    for (int i = 0; i < m; ++i) {
        int u = X[i], v = Y[i];
        g[u].push_back(v);
        g[v].push_back(u);
    }
    vector<int> A(q);
    for (int i = 0; i < q; ++i) {
        int u = S[i], v = E[i], l = L[i], r = R[i];
        QR[l].push_back({u, i});
        QL[r].push_back({v, i});
    }
    DSU D1(n), D2(n);
    for (int u = 0; u < n; ++u) {
        for (auto v: g[u]) {
            if (u > v) D1.Union(u, v);
        }
        for (auto [x, i]: QL[u]) node[i][0] = D1.Find(x);
    }
    for (int u = n - 1; u >= 0; --u) {
        for (auto v: g[u]) {
            if (u < v) D2.Union(u, v);
        }
        for (auto [x, i]: QR[u]) node[i][1] = D2.Find(x);
    }
    D1.run();
    D2.run();
    for (int i = 0; i < n; ++i) a[i] = D2.in[D1.ord[i]];
    for (int i = 0; i < q; ++i) {
        for (int j = D1.in[node[i][0]]; j <= D1.out[node[i][0]]; ++j)
            if (a[j] >= D2.in[node[i][1]] && a[j] <= D2.out[node[i][1]])
                A[i] = 1;
    }
    return A;
}
//namespace {
//
//int read_int() {
//  int x;
//  if (scanf("%d", &x) != 1) {
//    fprintf(stderr, "Error while reading input\n");
//    exit(1);
//  }
//  return x;
//}
//
//}  // namespace
//
//int main() {
//  int N = read_int();
//  int M = read_int();
//  int Q = read_int();
//  std::vector<int> X(M), Y(M), S(Q), E(Q), L(Q), R(Q);
//  for (int j = 0; j < M; ++j) {
//    X[j] = read_int();
//    Y[j] = read_int();
//  }
//  for (int i = 0; i < Q; ++i) {
//    S[i] = read_int();
//    E[i] = read_int();
//    L[i] = read_int();
//    R[i] = read_int();
//  }
//
//  std::vector<int> A = check_validity(N, X, Y, S, E, L, R);
//  for (size_t i = 0; i < A.size(); ++i) {
//    printf("%d\n", A[i]);
//  }
//  return 0;
//}

Compilation message

werewolf.cpp:2: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    2 | #pragma GCC optimization ("O3")
      | 
werewolf.cpp:3: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    3 | #pragma GCC optimization ("unroll-loops")
      | 
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:77:19: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   77 |         for (auto [x, i]: QL[u]) node[i][0] = D1.Find(x);
      |                   ^
werewolf.cpp:83:19: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   83 |         for (auto [x, i]: QR[u]) node[i][1] = D2.Find(x);
      |                   ^

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 59756 KB Output is correct
2 Correct 31 ms 59812 KB Output is correct
3 Correct 32 ms 59736 KB Output is correct
4 Correct 30 ms 59712 KB Output is correct
5 Correct 29 ms 59736 KB Output is correct
6 Correct 28 ms 59728 KB Output is correct
7 Correct 29 ms 59724 KB Output is correct
8 Correct 32 ms 59724 KB Output is correct
9 Correct 33 ms 59888 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 59756 KB Output is correct
2 Correct 31 ms 59812 KB Output is correct
3 Correct 32 ms 59736 KB Output is correct
4 Correct 30 ms 59712 KB Output is correct
5 Correct 29 ms 59736 KB Output is correct
6 Correct 28 ms 59728 KB Output is correct
7 Correct 29 ms 59724 KB Output is correct
8 Correct 32 ms 59724 KB Output is correct
9 Correct 33 ms 59888 KB Output is correct
10 Correct 56 ms 60492 KB Output is correct
11 Correct 48 ms 60500 KB Output is correct
12 Correct 35 ms 60380 KB Output is correct
13 Correct 64 ms 60544 KB Output is correct
14 Correct 62 ms 60492 KB Output is correct
15 Correct 43 ms 60712 KB Output is correct

Subtask #3
0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 532 ms 106760 KB Output is correct
2 Execution timed out 4062 ms 110160 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 59756 KB Output is correct
2 Correct 31 ms 59812 KB Output is correct
3 Correct 32 ms 59736 KB Output is correct
4 Correct 30 ms 59712 KB Output is correct
5 Correct 29 ms 59736 KB Output is correct
6 Correct 28 ms 59728 KB Output is correct
7 Correct 29 ms 59724 KB Output is correct
8 Correct 32 ms 59724 KB Output is correct
9 Correct 33 ms 59888 KB Output is correct
10 Correct 56 ms 60492 KB Output is correct
11 Correct 48 ms 60500 KB Output is correct
12 Correct 35 ms 60380 KB Output is correct
13 Correct 64 ms 60544 KB Output is correct
14 Correct 62 ms 60492 KB Output is correct
15 Correct 43 ms 60712 KB Output is correct
16 Correct 532 ms 106760 KB Output is correct
17 Execution timed out 4062 ms 110160 KB Time limit exceeded
18 Halted 0 ms 0 KB -