제출 #1135081

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1135081		Lemser	수천개의 섬 (IOI22_islands)	C++20	컴파일 에러	0 ms	0 KiB

islands

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

using ll = long long;
using ull = unsigned long long;
using lld = long double;
using ii = pair<int,int>;
using pll = pair<ll, ll>;

using vi = vector<int>;
using vll = vector<ll>;
using vii = vector<ii>;
using vpll = vector<pll>;
using vlld = vector<lld>;

// #define endl '\n'
#define all(x) x.begin(),x.end()
#define lsb(x) x&(-x)
#define gcd(a,b) __gcd(a,b)
#define sz(x) (int)x.size()
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define fls cout.flush()

#define fore(i,l,r) for(auto i=l;i<r;i++)
#define fo(i,n) fore(i,0,n)
#define forex(i,r,l) for(auto i=r; i>=l;i--)
#define ffo(i,n) forex(i,n-1,0)

bool cmin(ll &a, ll b) { if(b<a){a=b;return 1;}return 0; }
bool cmax(ll &a, ll b) { if(b>a){a=b;return 1;}return 0; }
void valid(ll in) { cout<<((in)?"Yes\n":"No\n"); }
ll lcm(ll a, ll b) { return (a/gcd(a,b))*b; }
ll gauss(ll n) { return (n*(n+1))/2; }

variant<bool, vector<int>> find_journey(
    int n, int m, vector<int> u, vector<int> v) {
  if (n > 2) return false;
  ll c = 0;
  fo (i, m) c += (u[i] == 0);
  return (c > 1 ? 1 : 0);
}

컴파일 시 표준 에러 (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:44:17: error: could not convert '((c > 1) ? 1 : 0)' from 'int' to 'std::variant<bool, std::vector<int, std::allocator<int> > >'
   44 |   return (c > 1 ? 1 : 0);
      |          ~~~~~~~^~~~~~~~
      |                 |
      |                 int