oj.uz

Submission #729563

# Submission time Handle Problem Language Result Execution time Memory
729563 2023-04-24T09:09:41 Z t6twotwo Werewolf (IOI18_werewolf) C++17
15 / 100
 370 ms 524288 KB 
#include "werewolf.h"
#include <bits/stdc++.h>
using namespace std;
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();
    vector<vector<int>> adj(N);
    for (int i = 0; i < M; i++) {
        adj[X[i]].push_back(Y[i]);
        adj[Y[i]].push_back(X[i]);
    }
    vector<int> p(N);
    function<int(int)> find = [&](int x) {
        return x == p[x] ? x : p[x] = find(p[x]);
    };
    vector<vector<int>> s(N);
    auto unite = [&](int x, int y) {
        x = find(x);
        y = find(y);
        if (x == y) {
            return;
        }
        if (s[x].size() > s[y].size()) {
            swap(x, y);
        }
        for (int z : s[x]) {
            p[z] = y;
            s[y].push_back(z);
        }
    };
    for (int i = 0; i < N; i++) {
        p[i] = i;
        s[i] = {i};
    }
    vector hi(N, vector<int>(N, -1));
    for (int x = N - 1; x >= 0; x--) {
        hi[x][x] = x;
        for (int y : adj[x]) {
            if (y < x || find(x) == find(y)) {
                continue;
            }
            for (int u : s[find(x)]) {
                for (int v : s[find(y)]) {
                    hi[u][v] = x;
                    hi[v][u] = x;
                }
            }
            unite(x, y);
        }
    }
    for (int i = 0; i < N; i++) {
        p[i] = i;
        s[i] = {i};
    }
    vector lo(N, vector<int>(N, -1));
    for (int x = 0; x < N; x++) {
        lo[x][x] = x;
        for (int y : adj[x]) {
            if (y > x || find(x) == find(y)) {
                continue;
            }
            for (int u : s[find(x)]) {
                for (int v : s[find(y)]) {
                    lo[u][v] = x;
                    lo[v][u] = x;
                }
            }
            unite(x, y);
        }
    }
    vector<int> ans(Q);
    for (int i = 0; i < Q; i++) {
        for (int j = L[i]; j <= R[i]; j++) {
            if (hi[S[i]][j] >= L[i] && lo[j][E[i]] <= R[i]) {
                ans[i] = 1;
            }
        }
    }
    return ans;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 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 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 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 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 189 ms 71616 KB Output is correct
11 Correct 187 ms 71592 KB Output is correct
12 Correct 153 ms 71624 KB Output is correct
13 Correct 149 ms 71564 KB Output is correct
14 Correct 135 ms 71712 KB Output is correct
15 Correct 196 ms 71752 KB Output is correct

Subtask #3
0 / 34.0

# Verdict Execution time Memory Grader output
1 Runtime error 370 ms 524288 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #4
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 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 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 189 ms 71616 KB Output is correct
11 Correct 187 ms 71592 KB Output is correct
12 Correct 153 ms 71624 KB Output is correct
13 Correct 149 ms 71564 KB Output is correct
14 Correct 135 ms 71712 KB Output is correct
15 Correct 196 ms 71752 KB Output is correct
16 Runtime error 370 ms 524288 KB Execution killed with signal 9
17 Halted 0 ms 0 KB -