Submission #661268

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
661268	2022-11-25 06:27:19	Alex_tz307	Super Dango Maker (JOI22_dango3)	C++17	0 / 100	3253 ms	1056 KiB

dango3

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
#include "dango3.h"
using namespace std;
const int kLog = 4;
void Solve(int N, int M) {
  vector<vector<int>> groups(M);
  auto check = [&](const vector<int> &a) -> bool {
    vector<bool> mark(1 + N * M);
    for (const int &x : a) {
      mark[x] = true;
    }
    vector<int> q;
    for (int i = 1; i <= N * M; ++i) {
      if (!mark[i]) {
        q.emplace_back(i);
      }
    }
    int res = M - Query(q);
    return (res == 2);
  };
  for (int i = 1; i <= N * M; ++i) {
    int colour = 0;
    if (i != 1) {
      for (int k = kLog; k >= 0; --k) {
        int newColour = (colour | (1 << k));
        groups[newColour - 1].emplace_back(i);
        if (newColour < M && check(groups[newColour - 1])) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 2
• Subtask 2: 0 / 5
• Subtask 3: 0 / 15
• Subtask 4: 0 / 78