oj.uz

Submission #1041330

# Submission time Handle Problem Language Result Execution time Memory
1041330 2024-08-01T21:54:07 Z aymanrs Island Hopping (JOI24_island) C++17
35 / 100
 13 ms 4952 KB 
#include "island.h"
#include <vector>
#include <set>
using namespace std;

void solve(int N, int L) {
  vector<int> g[N+1];
  bool gg[N+1][N+1] = {{false}};
  set<int> s[N+1];for(int i = 1;i <= N;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;
  }
  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(load[u] || gg[u][j]) continue;
      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.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 516 KB Output is correct
3 Correct 0 ms 344 KB Output is correct

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 516 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 11 ms 4716 KB Output is correct
6 Correct 9 ms 4696 KB Output is correct
7 Correct 9 ms 4744 KB Output is correct
8 Correct 10 ms 4696 KB Output is correct
9 Correct 9 ms 4516 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 4672 KB Output is correct
2 Correct 9 ms 4952 KB Output is correct
3 Correct 10 ms 4696 KB Output is correct
4 Correct 9 ms 4512 KB Output is correct
5 Correct 9 ms 4696 KB Output is correct
6 Correct 9 ms 4700 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 9 ms 4696 KB Output is correct
3 Correct 9 ms 4680 KB Output is correct
4 Correct 10 ms 4696 KB Output is correct
5 Correct 9 ms 4732 KB Output is correct
6 Correct 10 ms 4696 KB Output is correct
7 Correct 9 ms 4612 KB Output is correct
8 Correct 9 ms 4696 KB Output is correct
9 Correct 13 ms 4696 KB Output is correct

Subtask #5
13.0 / 13.0

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

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 516 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 11 ms 4716 KB Output is correct
6 Correct 9 ms 4696 KB Output is correct
7 Correct 9 ms 4744 KB Output is correct
8 Correct 10 ms 4696 KB Output is correct
9 Correct 9 ms 4516 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 9 ms 4696 KB Output is correct
12 Correct 9 ms 4680 KB Output is correct
13 Correct 10 ms 4696 KB Output is correct
14 Correct 9 ms 4732 KB Output is correct
15 Correct 10 ms 4696 KB Output is correct
16 Correct 9 ms 4612 KB Output is correct
17 Correct 9 ms 4696 KB Output is correct
18 Correct 13 ms 4696 KB Output is correct
19 Incorrect 9 ms 4696 KB Wrong Answer [7]
20 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 516 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 9 ms 4696 KB Output is correct
5 Correct 10 ms 4704 KB Output is correct
6 Correct 8 ms 4696 KB Output is correct
7 Correct 8 ms 4696 KB Output is correct
8 Correct 10 ms 4736 KB Output is correct
9 Correct 8 ms 4696 KB Output is correct
10 Correct 8 ms 4696 KB Output is correct
11 Correct 9 ms 4660 KB Output is correct
12 Correct 8 ms 4696 KB Output is correct
13 Incorrect 8 ms 4696 KB Wrong Answer [7]
14 Halted 0 ms 0 KB -

Subtask #8
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 4672 KB Output is correct
2 Correct 9 ms 4952 KB Output is correct
3 Correct 10 ms 4696 KB Output is correct
4 Correct 9 ms 4512 KB Output is correct
5 Correct 9 ms 4696 KB Output is correct
6 Correct 9 ms 4700 KB Output is correct
7 Incorrect 8 ms 4696 KB Wrong Answer [7]
8 Halted 0 ms 0 KB -