Submission #1043508

#	Time	Username	Problem	Language	Result	Execution time	Memory
1043508		jer033	Thousands Islands (IOI22_islands)	C++17	0 / 100	1100 ms	4416 KiB

islands

#include "islands.h"
#include <bits/stdc++.h>
#include <variant>
#include <vector>
using namespace std;

std::variant<bool, std::vector<int>> find_journey(int N, int M, std::vector<int> U, std::vector<int> V) {
    vector<vector<int>> edges(N);
    vector<int> deg(N, 0);
    for (int i=0; i<M; i+=2)
    {
        int u = U[i];
        int v = V[i];
        edges[u].push_back(v);
        edges[v].push_back(u);
        deg[u]++;
        deg[v]++;
    }
    if (deg[0]>=2)
        return true;
    vector<bool> visited(N, 0);
    vector<int> visitlist;
    visited[0] = 1;
    visitlist.push_back(0);
    int curr = 0;
    while (curr < visitlist.size())
    {
        for (int x: edges[visitlist[curr]])
        {
            if (deg[x]>=3)
                return true;
            if (visited[x]==0)
            {
                visited[x] = 1;
                visitlist.push_back(x);
            }
        }
    }
    return false;
}

Compilation message (stderr)

islands.cpp: In function 'std::variant<bool, std::vector<int, std::allocator<int> > > find_journey(int, int, std::vector<int>, std::vector<int>)':
islands.cpp:26:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |     while (curr < visitlist.size())
      |            ~~~~~^~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 5
• Subtask 2: 0 / 5
• Subtask 3: 0 / 21
• Subtask 4: 0 / 24
• Subtask 5: 0 / 45