Submission #980219

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
980219	2024-05-12 01:19:52	nextgenxing	Thousands Islands (IOI22_islands)	C++17	Compilation error	0 ms	0 KiB

islands

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
#include <variant>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define F0R(i, n) for(int i = 0; i < (n); i++)
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define F0Rd(i, n) for(int i = (n)-1; i >= 0; i--)
#define FORd(i, a, b) for(int i = (b)-1; i >= (a); i--)
#define ff first 
#define ss second 
const int MAX_N = 2e5+5;
const ll MOD = 1e9+7;
vector<pii> adj[MAX_N];
bool dfs(int curr, int par, vector<int> &path){
    if(!adj[curr].size()) return false;
    if(curr){
        if(adj[curr].size() == 1) return false;
        if(adj[curr].size() > 2){
            if(adj[curr][0].ff == par){
                path.push_back(adj[curr][1].ss), path.push_back(adj[curr][1].ss^1);
                path.push_back(adj[curr][2].ss), path.push_back(adj[curr][2].ss^1);
                path.push_back(adj[curr][1].ss^1), path.push_back(adj[curr][1].ss);
                path.push_back(adj[curr][2].ss^1), path.push_back(adj[curr][2].ss);
            } else if(adj[curr][1].ff == par){
                path.push_back(adj[curr][0].ss), path.push_back(adj[curr][0].ss^1);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

Compilation message (stderr)

islands.cpp: In function 'bool dfs(int, int, std::vector<int>&)':
islands.cpp:68:1: warning: control reaches end of non-void function [-Wreturn-type]
   68 | }
      | ^
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:103:1: warning: control reaches end of non-void function [-Wreturn-type]
  103 | }
      | ^
/usr/bin/ld: /tmp/ccbRwQhl.o: in function `main':
grader.cpp:(.text.startup+0x0): multiple definition of `main'; /tmp/ccwnbhen.o:islands.cpp:(.text.startup+0x0): first defined here
collect2: error: ld returned 1 exit status