제출 #964453

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
964453		TAhmed33	늑대인간 (IOI18_werewolf)	C++17	7 / 100	4056 ms	524288 KiB

werewolf

#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 / 7
• Subtask 2: 0 / 8
• Subtask 3: 0 / 34
• Subtask 4: 0 / 51