Submission #1162679

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1162679	2025-03-06 13:47:41	spongb	Tropical Garden (IOI11_garden)	C++20	0 / 100	5094 ms	320 KiB

garden

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 "garden.h"
#include "gardenlib.h"
using namespace std;
vector<int> succ, dist1, dist2;
int cycle_len1, cycle_len2;
vector<vector<int>> revGraph;
void find_cycle_length(int start, int& cycle_length) {
    // Initialize cycle length to a large value
    cycle_length = 1e9 + 1;
    
    // Initialize tortoise and hare pointers
    int tortoise = start;
    int hare = succ[start];
    
    // Phase 1: Find meeting point inside the cycle
    while (tortoise != hare && hare != -1) {
        tortoise = succ[tortoise];
        hare = succ[hare];
        if (hare != -1) {
            hare = succ[hare];
        }
    }
    
    // If hare reached end (no cycle) or is -1, return
    if (hare == -1) {
        return;
    }
    
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 49
• Subtask 2: 0 / 20
• Subtask 3: 0 / 31