Submission #66839

#	Time	Username	Problem	Language	Result	Execution time	Memory
66839		Kubalionzzale	Game (IOI14_game)	C++14	0 / 100	683 ms	263168 KiB

game

#include "game.h"

#include <iostream>
#include <algorithm>
#include <set>
#include <vector>

std::vector< std::vector<int> > g(1510);

int cnt[1510] = { 0 }, cnting = 0;
int curi, curj;
int n;
bool visited[1510] = { 0 };

void dfs(int index)
{
    ++cnting;
    for (int i = 0; i < g[index].size(); ++i)
    {
        int next = g[index][i];

        if ((curi == index && curj == next) || (curi == next && curj == index))
        {
            continue;
        }

        if (!visited[next])
            dfs(next);
    }


}

void dfss(int index)
{
    for (int i = 0; i < n; ++i)
    {
        visited[i] = 0;
    }
    dfs(0);
}

void initialize(int N) {
    n = N;
    for (int i = 0; i < n; ++i)
    {
        for (int j = 0; j < n; ++j)
        {
            g[i].push_back(j);
            g[j].push_back(i);
        }
    }
}

int hasEdge(int u, int v) {
    curi = u;
    curj = v;
    dfss(0);

    if (cnting == n)
        return 0;
    else
        return 1;
}

Compilation message (stderr)

game.cpp: In function 'void dfs(int)':
game.cpp:18:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < g[index].size(); ++i)
                     ~~^~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 15
• Subtask 2: 0 / 27
• Subtask 3: 0 / 58