oj.uz

Submission #963459

# Submission time Handle Problem Language Result Execution time Memory
963459 2024-04-15T04:08:29 Z kilkuwu Game (APIO22_game) C++17
2 / 100
 4 ms 14936 KB 
#include "game.h"

#include <bits/stdc++.h>

int n, k;

constexpr int N = 3e5 + 5;

int can_reach[N]; // can_reach from k -> 0
int be_reached[N]; // be reached from 0 -> k

std::vector<int> adj[N];
std::vector<int> radj[N];

void add_edge(int u, int v) {
  adj[u].push_back(v);
  radj[v].push_back(u);
}

void init(int _n, int _k) {
  n = _n, k = _k;
  for (int i = 0; i < k; i++) {
    can_reach[i] = i; // it can reach i -> k - 1
    be_reached[i] = i + 1; // can be reach from 0 -> i
  }
  for (int i = k; i < n; i++) {
    can_reach[i] = k; // can't reach any
    be_reached[i] = 0; // can't be reached by any
  }

  for (int i = 0; i + 1 < k; i++) {
    add_edge(i, i + 1);
  }
}

void update_can_reach(int u, int val) {
  if (can_reach[u] <= val) { // reach from can_reach[u] -> k - 1 
    return; // we don't care
  }
  can_reach[u] = val;
  for (int v : radj[u]) {
    update_can_reach(v, val);
  }
}

void update_be_reached(int u, int val) {
  if (be_reached[u] >= val) { // can be reached from 0 -> be_reached - 1
    return;
  }

  be_reached[u] = val;
  for (int v : adj[u]) {
    update_be_reached(v, val);
  }
}

int add_teleporter(int u, int v) {
  if (can_reach[v] < be_reached[u]) {
    return 1; 
  }
  update_can_reach(u, can_reach[v]);
  update_be_reached(v, be_reached[u]);
  return 0;
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 14936 KB Output is correct
2 Correct 3 ms 14936 KB Output is correct
3 Correct 3 ms 14932 KB Output is correct
4 Correct 4 ms 14936 KB Output is correct
5 Correct 3 ms 14936 KB Output is correct
6 Correct 3 ms 14936 KB Output is correct
7 Correct 3 ms 14936 KB Output is correct

Subtask #2
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 14936 KB Output is correct
2 Correct 3 ms 14936 KB Output is correct
3 Correct 3 ms 14932 KB Output is correct
4 Correct 4 ms 14936 KB Output is correct
5 Correct 3 ms 14936 KB Output is correct
6 Correct 3 ms 14936 KB Output is correct
7 Correct 3 ms 14936 KB Output is correct
8 Correct 3 ms 14936 KB Output is correct
9 Correct 3 ms 14936 KB Output is correct
10 Correct 4 ms 14936 KB Output is correct
11 Incorrect 4 ms 14936 KB Wrong Answer[1]
12 Halted 0 ms 0 KB -

Subtask #3
0.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 14936 KB Output is correct
2 Correct 3 ms 14936 KB Output is correct
3 Correct 3 ms 14932 KB Output is correct
4 Correct 4 ms 14936 KB Output is correct
5 Correct 3 ms 14936 KB Output is correct
6 Correct 3 ms 14936 KB Output is correct
7 Correct 3 ms 14936 KB Output is correct
8 Correct 3 ms 14936 KB Output is correct
9 Correct 3 ms 14936 KB Output is correct
10 Correct 4 ms 14936 KB Output is correct
11 Incorrect 4 ms 14936 KB Wrong Answer[1]
12 Halted 0 ms 0 KB -

Subtask #4
0.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 14936 KB Output is correct
2 Correct 3 ms 14936 KB Output is correct
3 Correct 3 ms 14932 KB Output is correct
4 Correct 4 ms 14936 KB Output is correct
5 Correct 3 ms 14936 KB Output is correct
6 Correct 3 ms 14936 KB Output is correct
7 Correct 3 ms 14936 KB Output is correct
8 Correct 3 ms 14936 KB Output is correct
9 Correct 3 ms 14936 KB Output is correct
10 Correct 4 ms 14936 KB Output is correct
11 Incorrect 4 ms 14936 KB Wrong Answer[1]
12 Halted 0 ms 0 KB -

Subtask #5
0.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 14936 KB Output is correct
2 Correct 3 ms 14936 KB Output is correct
3 Correct 3 ms 14932 KB Output is correct
4 Correct 4 ms 14936 KB Output is correct
5 Correct 3 ms 14936 KB Output is correct
6 Correct 3 ms 14936 KB Output is correct
7 Correct 3 ms 14936 KB Output is correct
8 Correct 3 ms 14936 KB Output is correct
9 Correct 3 ms 14936 KB Output is correct
10 Correct 4 ms 14936 KB Output is correct
11 Incorrect 4 ms 14936 KB Wrong Answer[1]
12 Halted 0 ms 0 KB -