Submission #633905

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
633905	2022-08-23 12:28:37	Cauchico	Thousands Islands (IOI22_islands)	C++17	22.75 / 100	32 ms	5196 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 <variant>
#include <bits/stdc++.h>
using namespace std;
 
vector<vector<pair<int,int>>> adj;
vector<int> path,cycle; 
vector<bool> used;
 
void dfs(int v, int e) {
    used[v] = true;
    if (adj[v].size() > 2) {
        int p1,p2;
        if (adj[v][0].first == e) {
            p1 = adj[v][1].second;
            p2 = adj[v][2].second;
        }else if (adj[v][1].first == e) {
            p1 = adj[v][0].second;
            p2 = adj[v][2].second;
        }else {
            p1 = adj[v][0].second;
            p2 = adj[v][1].second;
        }
        int b1=p1^1,b2=p2^1;
        cycle = {p1,b1,p2,b2,b1,p1,b2,p2};
        return;
    }
    for (auto u: adj[v]) {
        if (!used[u.first]) {
            path.push_back(u.second);
            dfs(u.first,v);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 5
• Subtask 2: 1.75 / 5
• Subtask 3: 21 / 21
• Subtask 4: 0 / 24
• Subtask 5: 0 / 45