oj.uz

Submission #1041319

# Submission time Handle Problem Language Result Execution time Memory
1041319 2024-08-01T21:32:36 Z aymanrs Island Hopping (JOI24_island) C++17
0 / 100
 2 ms 600 KB 
#include "island.h"
#include <vector>
using namespace std;

void solve(int N, int L) {
  vector<int> g[N+1];
  bool gg[N+1][N+1] = {{false}};
  for(int i = N;i>1;i--){
    int u = query(i, 1);
    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]){
      int u = query(j, ++cnt[j]);
      if(load[u] || gg[u][j]) continue;
      gg[u][j] = gg[j][u] = true;
      g[u].push_back(i);
      g[i].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 Incorrect 0 ms 344 KB Wrong Answer [2]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Wrong Answer [2]
2 Halted 0 ms 0 KB -

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 344 KB Wrong Answer [1]
2 Halted 0 ms 0 KB -

Subtask #4
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 1 ms 344 KB Wrong Answer [1]
3 Halted 0 ms 0 KB -

Subtask #5
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 600 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Wrong Answer [2]
2 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Wrong Answer [2]
2 Halted 0 ms 0 KB -

Subtask #8
0 / 28.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 344 KB Wrong Answer [1]
2 Halted 0 ms 0 KB -