Submission #757601

#TimeUsernameProblemLanguageResultExecution timeMemory
757601boris_mihovThousands Islands (IOI22_islands)C++17
0 / 100
1 ms340 KiB
#include "islands.h"
#include <algorithm>
#include <iostream>
#include <numeric>
#include <cassert>
#include <variant>
#include <vector>

typedef long long llong;
const int MAXN = 100000 + 10;
const int INF  = 1e9;

int n, m;
std::variant <bool, std::vector<int>> find_journey(int N, int M, std::vector <int> U, std::vector <int> V)
{
    n = N; m = M;
    for (int i = 0 ; i < m ; ++i)
    {
        U[i]++;
        V[i]++;
    }

    if (n == 2)
    {
        int cntOne = 0;
        int cntTwo = 0;
        for (int i = 0 ; i < m ; ++i)
        {
            if (U[i] == 1)
            {
                cntOne++;
            } else
            {
                cntTwo++;
            }
        }

        if (cntOne >= 2 && cntTwo >= 2)
        {
            exit(-1);
            return std::vector <int> ({0, 1, 0, 1, 0, 1, 0, 1, 0});
        }

        return false;
    }

    return false;
}
#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...