QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#121923#1148. GameQwerty1232#0 335ms3756kbC++17887b2023-07-09 00:38:312024-07-04 00:32:47

Judging History

你现在查看的是最新测评结果

  • [2024-07-04 00:32:47]
  • 评测
  • 测评结果:0
  • 用时:335ms
  • 内存:3756kb
  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2023-07-09 00:38:31]
  • 提交

answer

#include "game.h"

#include <bits/stdc++.h>

constexpr int N = 1501;
// std::vector<std::vector<int>> gr;
std::array<std::bitset<N>, N> gr;
int n;

void initialize(int n) {
    while (clock() * 1.0 / CLOCKS_PER_SEC < 0.95) {
        ;
    }
    exit(0);
    ::n = n;
    for (int i = 0; i < n; i++) {
        gr[i].reset();
        gr[i] = ~gr[i];
        gr[i][i] = 0;
    }
}

int hasEdge(int u, int v) {
    gr[u][v] = gr[v][u] = 0;

    std::bitset<N> used;
    used.reset();
    used = ~used;
    auto dfs = [&](auto dfs, int v) -> void {
        int t = (used & gr[v])._Find_first();
        used[v] = 0;
        while (t < n) {
            dfs(dfs, t);
            t = (used & gr[v])._Find_next(t);
        }
    };
    dfs(dfs, 0);
    if (used._Find_first() == n) {
        return 0;
    }
    gr[u][v] = gr[v][u] = 1;
    return 1;
}

Details

Tip: Click on the bar to expand more detailed information

Subtask #1:

score: 0
Wrong Answer

Test #1:

score: 0
Wrong Answer
time: 302ms
memory: 3748kb

input:

4
0 1
3 0
1 2
0 2
3 1
2 3

output:

Unauthorized output

result:

wrong output format Expected integer, but "Unauthorized" found

Subtask #2:

score: 0
Wrong Answer

Test #25:

score: 0
Wrong Answer
time: 303ms
memory: 3636kb

input:

4
0 1
3 0
1 2
0 2
3 1
2 3

output:

Unauthorized output

result:

wrong output format Expected integer, but "Unauthorized" found

Subtask #3:

score: 0
Wrong Answer

Test #79:

score: 0
Wrong Answer
time: 335ms
memory: 3756kb

input:

4
0 1
3 0
1 2
0 2
3 1
2 3

output:

Unauthorized output

result:

wrong output format Expected integer, but "Unauthorized" found