oj.uz

Submission #964453

# Submission time Handle Problem Language Result Execution time Memory
964453 2024-04-16T22:52:09 Z TAhmed33 Werewolf (IOI18_werewolf) C++17
7 / 100
 4000 ms 524288 KB 
#include "werewolf.h"
#include <bits/stdc++.h>
using namespace std;
int n, m, q;
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; m = (int)X.size(); q = S.size();
    int dp[n][n], dq[n][n]; //min edge, max edge
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            dp[i][j] = -1e9; dq[i][j] = 1e9;
        }
        dp[i][i] = dq[i][i] = i;
    }
    for (int i = 0; i < m; i++) {
        dp[X[i]][Y[i]] = dp[Y[i]][X[i]] = min(Y[i], X[i]);
        dq[X[i]][Y[i]] = dq[Y[i]][X[i]] = max(Y[i], X[i]);
    }
    for (int k = 0; k < n; k++) {
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                dp[i][j] = max(dp[i][j], min(dp[i][k], dp[k][j]));
                dq[i][j] = min(dq[i][j], max(dq[i][k], dq[k][j]));
            }
        }
    }
    vector <int> ret;
    for (int i = 0; i < q; i++) {
        int flag = 0;
        int a = S[i], b = E[i];
        for (int j = 0; j < n; j++) {
            flag |= dp[a][j] >= L[i] && dq[j][b] <= R[i];
        }
        ret.push_back(flag);
    }
    return ret;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 344 KB Output is correct
2 Correct 3 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 3 ms 512 KB Output is correct
7 Correct 3 ms 348 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 2 ms 348 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 344 KB Output is correct
2 Correct 3 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 3 ms 512 KB Output is correct
7 Correct 3 ms 348 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Execution timed out 4056 ms 71080 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #3
0 / 34.0

# Verdict Execution time Memory Grader output
1 Runtime error 363 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 2 ms 344 KB Output is correct
2 Correct 3 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 3 ms 512 KB Output is correct
7 Correct 3 ms 348 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Execution timed out 4056 ms 71080 KB Time limit exceeded
11 Halted 0 ms 0 KB -