제출 #838628

#제출 시각아이디문제언어결과실행 시간메모리
838628finn__게임 (APIO22_game)C++17
60 / 100
523 ms7128 KiB
#include <bits/stdc++.h>
#include "game.h"
using namespace std;

constexpr size_t N = 30000, K = 1000;

size_t n, k;
bitset<N> reachable[K];
vector<size_t> edges[N];

void init(int n_, int k_)
{
    n = n_, k = k_;
    for (size_t i = 0; i < k; ++i)
        for (size_t j = i + 1; j < k; ++j)
            reachable[i][j] = 1;
}

bool add_new_reachable(size_t i, size_t u)
{
    if (u <= i)
        return 1;
    reachable[i][u] = 1;
    for (size_t v : edges[u])
        if (!reachable[i][v] && add_new_reachable(i, v))
            return 1;
    return 0;
}

int add_teleporter(int u, int v)
{
    for (size_t i = 0; i < k; ++i)
        if ((reachable[i][u] || u == i) && add_new_reachable(i, v))
            return 1;
    edges[u].push_back(v);
    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

game.cpp: In function 'int add_teleporter(int, int)':
game.cpp:33:35: warning: comparison of integer expressions of different signedness: 'int' and 'size_t' {aka 'long unsigned int'} [-Wsign-compare]
   33 |         if ((reachable[i][u] || u == i) && add_new_reachable(i, v))
      |                                 ~~^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...