oj.uz

Submission #604703

# Submission time Handle Problem Language Result Execution time Memory
604703 2022-07-25T08:54:03 Z BERNARB01 ICC (CEOI16_icc) C++17
0 / 100
 428 ms 480 KB 
#include <bits/stdc++.h>
#include "icc.h"

using namespace std;

#ifdef B01
#include "debb.h"
#else
#define deb(...)
#endif

const int N = 101;

int n;
int a[N], b[2];
bitset<N> g[N];

void run(int n_) {
  n = n_;
  for (int iter = 0; iter < n - 1; iter++) {
    for (int u = 0; u < n; u++) {
      b[0] = u + 1;
      int sz = 0;
      for (int v = u + 1; v < n; v++) {
        if (!g[u][v]) {
          a[sz++] = v + 1;
        }
      }
      for (int i = 0; i < sz; i++) {
        if (query(1, 1, a + i, b)) {
          setRoad(a[i], b[0]);
          g[a[i] - 1][u] = g[u][a[i] - 1] = 1;
          break;
        }
      }
    }
  }
}

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 13 ms 468 KB Wrong road!
2 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 238 ms 476 KB Wrong road!
2 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Incorrect 428 ms 480 KB Number of queries more than 4500 out of 2250
2 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 315 ms 472 KB Number of queries more than 4000 out of 2000
2 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 291 ms 472 KB Number of queries more than 3550 out of 1775
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 308 ms 472 KB Number of queries more than 3250 out of 1625
2 Halted 0 ms 0 KB -