제출 #1247447

#제출 시각아이디문제언어결과실행 시간메모리
1247447DeathIsAwe수천개의 섬 (IOI22_islands)C++20
5 / 100
20 ms6000 KiB
#include "islands.h"
#include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define ff first
#define ss second
#define pb push_back
#define ll long long
#define ld long double
int n, m;
vector<int> u, v;

variant<bool, vector<int>> find_journey(int N, int M, vector<int> U, vector<int> V) {
    n = N; m = M; u = U; v = V;
    if (n == 2) {
        vector<int> zerovec, onevec, ansvec;
        for (int i=0;i<m;i++) {
            if (u[i] == 0 && v[i] == 1) zerovec.pb(i);
            else if (u[i] == 1 && v[i] == 0) onevec.pb(i);
        }
        if (zerovec.size() > 1 && onevec.size() > 0) {
            ansvec.pb(zerovec[0]);
            ansvec.pb(onevec[0]);
            ansvec.pb(zerovec[1]);
            ansvec.pb(zerovec[0]);
            ansvec.pb(onevec[0]);
            ansvec.pb(zerovec[1]);
            return ansvec;
        } else {
            return false;
        }
    }
}

컴파일 시 표준 에러 (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:33:1: warning: control reaches end of non-void function [-Wreturn-type]
   33 | }
      | ^
#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...