Submission #1305719

#TimeUsernameProblemLanguageResultExecution timeMemory
1305719SkillIssueWAGuyIsland Hopping (JOI24_island)C++20
100 / 100
5 ms400 KiB
#include "island.h"
#include<bits/stdc++.h>
using namespace std;
vector<int> dsu, ht;
int trace (int a) {
  if (dsu[a] == a) return a;
  dsu[a] = trace(dsu[a]);
  return dsu[a];
}
bool merge(int a, int b){
  a = trace(a);
  b = trace(b);
  if (a == b) return false;
  if (ht[a] < ht[b]) std::swap(a, b);
  ht[a] = max(ht[a], ht[b] + 1);
  dsu[b] = a;
  return true;
}
void solve(int N, int L) {
  dsu = ht = vector<int> (N, 0);
  for (int i = 0; i < N; i++) dsu[i] = i;
  for (int i = 0; i < N; i++) {
    int k = 1;
    while (k <= N-1) {
      int p = query(i+1, k) - 1;
      if (p >= i) break;
      if (trace(i) == trace(p)) break;
      merge(i, p);
      answer(i+1, p+1);
      k++;
    }
  }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...