oj.uz

Submission #709848

# Submission time Handle Problem Language Result Execution time Memory
709848 2023-03-14T16:52:51 Z Cyanmond Werewolf (IOI18_werewolf) C++17
15 / 100
 4000 ms 34936 KB 
#include "werewolf.h"
#include <bits/stdc++.h>

struct UnionFind {
    int n;
    std::vector<int> data;
    UnionFind(int n_) : n(n_) {
        data.assign(n, -1);
    }

    int find(int v) {
        if (data[v] < 0) return v;
        else return data[v] = find(data[v]);
    }

    void merge(int a, int b) {
        a = find(a);
        b = find(b);
        if (a == b) return;
        if (data[a] > data[b]) std::swap(a, b);
        data[a] += data[b];
        data[b] = a;
    }
};

constexpr int B = 3;

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) {
    const int M = (int)X.size();
    const int Q = (int)S.size();
    std::vector<int> answer(Q);

    std::vector<std::vector<int>> graph(2 * N);
    for (int i = 0; i < M; ++i) {
        graph[X[i]].push_back(Y[i]);
        graph[Y[i]].push_back(X[i]);
    }
    std::vector<char> isSeen(2 * N);
    for (int i = 0; i < Q; ++i) {
        std::fill(isSeen.begin(), isSeen.end(), false);
        std::queue<int> que;
        que.push(S[i]);
        while (not que.empty()) {
            const int f = que.front();
            que.pop();
            if (f < N) {
                if (L[i] <= f and f <= R[i]) {
                    if (not isSeen[f + N]) {
                        isSeen[f + N] = true;
                        que.push(f + N);
                    }
                }
            }
            const int u = f >= N ? f - N : f;
            for (const int t : graph[u]) {
                if (f >= N) {
                    if (t <= R[i]) {
                        if (not isSeen[t + N]) {
                            isSeen[t + N] = true;
                            que.push(t + N);
                        }
                    }
                } else {
                    if (t >= L[i]) {
                        if (not isSeen[t]) {
                            isSeen[t] = true;
                            que.push(t);
                        }
                    }
                }
            }
        }
        answer[i] = isSeen[E[i] + N];
    }
    return answer;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 300 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 300 KB Output is correct
9 Correct 1 ms 212 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 300 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 300 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 321 ms 724 KB Output is correct
11 Correct 203 ms 724 KB Output is correct
12 Correct 14 ms 724 KB Output is correct
13 Correct 267 ms 724 KB Output is correct
14 Correct 180 ms 724 KB Output is correct
15 Correct 199 ms 852 KB Output is correct

Subtask #3
0 / 34.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4030 ms 34936 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 300 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 300 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 321 ms 724 KB Output is correct
11 Correct 203 ms 724 KB Output is correct
12 Correct 14 ms 724 KB Output is correct
13 Correct 267 ms 724 KB Output is correct
14 Correct 180 ms 724 KB Output is correct
15 Correct 199 ms 852 KB Output is correct
16 Execution timed out 4030 ms 34936 KB Time limit exceeded
17 Halted 0 ms 0 KB -