제출 #1239549

#제출 시각아이디문제언어결과실행 시간메모리
1239549matsakyannn수천개의 섬 (IOI22_islands)C++20
0 / 100
2 ms4420 KiB
#include <bits/stdc++.h> #include <variant> using namespace std; #ifndef ONLINE_JUDGE #define dbg(x) cerr << #x << ' '; print(x); cerr << endl; #else #define dbg(x) #endif void print(int x) {cerr << x;} void print(long long x) {cerr << x;} void print(char x) {cerr << x;} void print(string x) {cerr << x;} void print(double x) {cerr << x;} template <class T> void print(vector <T> x); template <class T> void print(set <T> x); template <class T> void print(multiset <T> x); template <class T, class V> void print(pair <T, V> x); template <class T, class V> void print(map <T, V> x); template <class T> void print(vector <T> x) {cerr << "[ "; for(auto i : x) {print(i); cerr << ' ';} cerr << "]";} template <class T> void print(set <T> x) {cerr << "[ "; for(auto i : x) {print(i); cerr << ' ';} cerr << "]";} template <class T> void print(multiset <T> x) {cerr << "[ "; for(auto i : x) {print(i); cerr << ' ';} cerr << "]";} template <class T, class V> void print(pair <T, V> x) {cerr << "{"; print(x.first); cerr << ' '; print(x.second); cerr << "}";} template <class T, class V> void print(map <T, V> x) {cerr << "[ "; for(auto i : x) {print(i); cerr << ' ';} cerr << "]";} #define ll long long #define pb push_back #define ppb pop_back #define PII pair <int, int> #define PLL pair <ll, ll> #define all(v) (v).begin(), (v).end() #define OK cerr << "OK\n"; #define MP make_pair const int N0 = 1005, M0 = 2e5 + 5; int n, m, kayak[N0][N0]; vector <int> u, v; vector <int> G[N0]; int par[N0]; vector <int> road; void dfs(int node, int parent){ par[node] = parent; int children = 0; for(int u : G[node]){ if(u == parent) continue; children++; } if(children >= 2){ if(road.empty()){ int curr = node; while(curr != -1){ road.pb(curr); curr = par[curr]; } } return; } for(int u : G[node]){ if(u == parent) continue; dfs(u, node); } } variant <bool, vector <int>> find_journey(int N, int M, vector<int> U, vector<int> V){ n = N, m = M, u = U, v = V; for(int i = 0; i < M; i++){ G[u[i]].pb(v[i]); G[v[i]].pb(u[i]); kayak[u[i]][v[i]] = i; } dfs(0, -1); if(road.empty()) 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:75:1: warning: control reaches end of non-void function [-Wreturn-type]
   75 | }
      | ^
#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...