Submission #1041331

#	Time	Username	Problem	Language	Result	Execution time	Memory
1041331		aymanrs	Island Hopping (JOI24_island)	C++17	100 / 100	11 ms	4952 KiB

island

#include "island.h"
#include <vector>
#include <set>
using namespace std;
int f(int i, int r[]){
  if(r[i]==i) return i;
  return r[i]=f(r[i],r);
}
void merge(int a, int b, int r[]){
  a = f(a,r);b=f(b,r);
  if(a==b)return;
  r[b]=a;
}
void solve(int N, int L) {
  vector<int> g[N+1];
  bool gg[N+1][N+1] = {{false}};
  int r[N+1];
  set<int> s[N+1];for(int i = 1;i <= N;i++) {
    r[i]=i;
    for(int j = 1;j <= N;j++) if(j!=i) s[i].insert(j);
  }
  for(int i = N;i>1;i--){
    int u = query(i, 1);
    s[i].erase(u);
    if(gg[u][i]) continue;
    g[u].push_back(i);
    g[i].push_back(u);
    gg[u][i]=gg[i][u]=true;
    merge(i,u,r);
  }
  bool load[N+1] = {false};
  int cnt[N+1];
  fill(cnt, cnt+N+1, 1);
  for(int i = 1;i < N;i++){
    load[i]=true;
    for(int j : g[i]) load[j] = true;
    for(int j : g[i]){
      if(j < i) continue;
      int u;
      if(cnt[j] < N-1) {
        u = query(j, ++cnt[j]);
        s[j].erase(u);
      } else u = *s[j].begin();
      if(f(j,r)==f(u,r)) continue;
      merge(u,j,r);
      gg[u][j] = gg[j][u] = true;
      g[u].push_back(j);
      g[j].push_back(u);
    }
  }
  for(int i = 1;i <= N;i++){
    for(int j : g[i]) if(j > i) answer(i,j);
  }
}

• Subtask 1: 2 / 2
• Subtask 2: 4 / 4
• Subtask 3: 7 / 7
• Subtask 4: 9 / 9
• Subtask 5: 13 / 13
• Subtask 6: 15 / 15
• Subtask 7: 22 / 22
• Subtask 8: 28 / 28