oj.uz

Submission #1041344

# Submission time Handle Problem Language Result Execution time Memory
1041344 2024-08-01T22:10:19 Z aymanrs Island Hopping (JOI24_island) C++17
57 / 100
 764 ms 1048576 KB 
#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);
  }
  int cnt[N+1];
  fill(cnt, cnt+N+1, 1);
  for(int i = 1;i < N;i++){
    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 if(cnt[j] == N-1){
        u = *s[j].begin();
        cnt[j]++;
      }
      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
0 / 2.0

# Verdict Execution time Memory Grader output
1 Runtime error 764 ms 1048576 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #2
0 / 4.0

# Verdict Execution time Memory Grader output
1 Runtime error 764 ms 1048576 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 4540 KB Output is correct
2 Correct 9 ms 4696 KB Output is correct
3 Correct 8 ms 4952 KB Output is correct
4 Correct 8 ms 4696 KB Output is correct
5 Correct 8 ms 4696 KB Output is correct
6 Correct 10 ms 4952 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 8 ms 4696 KB Output is correct
3 Correct 12 ms 4948 KB Output is correct
4 Correct 9 ms 4696 KB Output is correct
5 Correct 9 ms 4748 KB Output is correct
6 Correct 9 ms 4696 KB Output is correct
7 Correct 9 ms 4696 KB Output is correct
8 Correct 9 ms 4696 KB Output is correct
9 Correct 8 ms 4696 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 4696 KB Output is correct
2 Correct 9 ms 4660 KB Output is correct
3 Correct 9 ms 4696 KB Output is correct
4 Correct 9 ms 4696 KB Output is correct
5 Correct 8 ms 4508 KB Output is correct
6 Correct 11 ms 4696 KB Output is correct
7 Correct 8 ms 4696 KB Output is correct
8 Correct 10 ms 4696 KB Output is correct
9 Correct 10 ms 4748 KB Output is correct

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Runtime error 764 ms 1048576 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Runtime error 764 ms 1048576 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #8
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 4540 KB Output is correct
2 Correct 9 ms 4696 KB Output is correct
3 Correct 8 ms 4952 KB Output is correct
4 Correct 8 ms 4696 KB Output is correct
5 Correct 8 ms 4696 KB Output is correct
6 Correct 10 ms 4952 KB Output is correct
7 Correct 9 ms 4696 KB Output is correct
8 Correct 9 ms 4512 KB Output is correct
9 Correct 8 ms 4696 KB Output is correct
10 Correct 9 ms 4752 KB Output is correct
11 Correct 9 ms 4696 KB Output is correct
12 Correct 9 ms 4548 KB Output is correct
13 Correct 9 ms 4696 KB Output is correct
14 Correct 9 ms 4696 KB Output is correct
15 Correct 9 ms 4620 KB Output is correct
16 Correct 8 ms 4696 KB Output is correct
17 Correct 11 ms 4696 KB Output is correct
18 Correct 8 ms 4696 KB Output is correct
19 Correct 8 ms 4696 KB Output is correct
20 Correct 8 ms 4748 KB Output is correct
21 Correct 8 ms 4696 KB Output is correct
22 Correct 11 ms 4696 KB Output is correct
23 Correct 10 ms 4696 KB Output is correct
24 Correct 8 ms 4696 KB Output is correct
25 Correct 9 ms 4508 KB Output is correct
26 Correct 9 ms 4588 KB Output is correct
27 Correct 9 ms 4700 KB Output is correct
28 Correct 9 ms 4708 KB Output is correct
29 Correct 8 ms 4696 KB Output is correct
30 Correct 8 ms 4696 KB Output is correct
31 Correct 9 ms 4696 KB Output is correct
32 Correct 8 ms 4508 KB Output is correct
33 Correct 8 ms 4696 KB Output is correct
34 Correct 11 ms 4696 KB Output is correct
35 Correct 8 ms 4696 KB Output is correct
36 Correct 9 ms 4948 KB Output is correct
37 Correct 8 ms 4712 KB Output is correct
38 Correct 11 ms 4696 KB Output is correct
39 Correct 9 ms 4696 KB Output is correct
40 Correct 9 ms 4516 KB Output is correct