Submission #1175022

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1175022	2025-03-27 21:18:46	Johan	Rainforest Jumps (APIO21_jumps)	C++20	0 / 100	2595 ms	1114112 KiB

jumps

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 "jumps.h"
#include "bits/stdc++.h"
using namespace std;
const int MAX = 3e5 + 6;
const int LOG = 25;
const int inf = 1e9;
const int mod = 1e9 + 7;
const int block = 333;
// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int st[MAX * 4];
vector < int > nodes;
vector < bool > vis(MAX, 0);
vector < vector < int > > adj(MAX);
unordered_map < int , unordered_map < int , int > > d;
void bfs(int s){
  if(d.find(s) != d.end())  return;
  queue < int > q;
  q.push(s);
  d[s][s] = 0;
  while(q.size()){
    int v = q.front();
    q.pop();
    for(auto u : adj[v]){
      if(!d[s].count(u)){
        q.push(u);
        d[s][u] = d[s][v] + 1;
      }
    }
  }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 4
• Subtask 2: 0 / 8
• Subtask 3: 0 / 13
• Subtask 4: 0 / 12
• Subtask 5: 0 / 23
• Subtask 6: 0 / 21
• Subtask 7: 0 / 19