oj.uz

Submission #936829

# Submission time Handle Problem Language Result Execution time Memory
936829 2024-03-02T19:08:30 Z TAhmed33 Super Dango Maker (JOI22_dango3) C++17
0 / 100
 9292 ms 1032 KB 
#include "dango3.h"
#include <bits/stdc++.h>
using namespace std;
int n, m;
int get (vector <int> &x) {
  set <int> dd; for (auto i : x) dd.insert(i);
  vector <int> l;
  for (int i = 1; i <= n * m; i++) {
    if (!dd.count(i)) l.push_back(i);
  }
  return Query(l);
}
void Solve (int N, int M) {
  n = N; m = M;
  vector <int> cur[m + 1];
  for (int i = 1; i <= n * m; i++) {
    int l = 1, r = m, ans = -1;
    while (l <= r) {
      int mid = (l + r) / 2;
      if (get(cur[mid]) == 2) {
        l = mid + 1;
      } else {
        r = mid - 1; ans = mid;
      }
    }
    cur[ans].push_back(i);
  }
  for (int i = 1; i <= m; i++) {
    Answer(cur[i]);
  }
}

Subtask #1
0 / 2.0

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

Subtask #2
0 / 5.0

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

Subtask #3
0 / 15.0

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

Subtask #4
0 / 78.0

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