Submission #658906

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
658906	2022-11-15 12:13:56	coding_snorlax	Thousands Islands (IOI22_islands)	C++17	10 / 100	31 ms	3776 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 "islands.h"
using namespace std;
variant<bool, std::vector<int>> find_journey(int N,int M,vector<int> U,vector<int> V){
    if(N==2){
    int Back=-1;
    int Front_1=-1;
    int Front_2=-1;
    vector<int> S;
    for(int i=0;i<M;i++){
        if(!(Back+1) && U[i]==1) Back=i;
        else if(!(Front_1+1) && V[i]==1) Front_1=i;
        else if(!(Front_2+1) && V[i]==1) Front_2=i;
    }
    if(!(Back+1) || !(Front_1+1) || !(Front_2+1)) return false;
    S.push_back(Front_1);
    S.push_back(Back);
    S.push_back(Front_2);
    S.push_back(Front_1);
    S.push_back(Back);
    S.push_back(Front_2);
    return  S;
    }
    int Node1=-1,Node2=-1,Node3=-1;
    int a=-1,b=-1,c=-1,d=-1;
    //vector<int> S;
    for(int i=0;i<M;i++){
        if(U[i]==0 && Node1==-1){
            a=i;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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