QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#151570#4218. Hidden Graphnhuang685TL 15ms3564kbC++202.2kb2023-08-27 01:36:262023-08-27 01:36:29

Judging History

你现在查看的是最新测评结果

  • [2023-08-27 01:36:29]
  • 评测
  • 测评结果:TL
  • 用时:15ms
  • 内存:3564kb
  • [2023-08-27 01:36:26]
  • 提交

answer

/**
 * @file qoj4218-1.cpp
 * @author n685
 * @brief
 * @date 2023-08-26
 *
 *
 */
#include <bits/stdc++.h>

#ifdef LOCAL
using std::cerr;
using std::cin;
using std::cout;
#else
using std::cin;
using std::cout;
#define cerr                                                                   \
  if (false)                                                                   \
  std::cerr
#endif

#ifdef LOCAL
#include "dd/debug.h"
#define dbg(...) lineInfo(__LINE__, #__VA_ARGS__), dbg1(__VA_ARGS__)
#define dbgR(...) lineInfo(__LINE__, #__VA_ARGS__), dbg2(__VA_ARGS__)
#define dbgP(p, ...)                                                           \
  lineInfo(__LINE__, #__VA_ARGS__ " proj"), dbg3(p, __VA_ARGS__)
#define dbgRP(p, ...)                                                          \
  lineInfo(__LINE__, #__VA_ARGS__ " proj"), dbg4(p, __VA_ARGS__)
void nline() { cerr << '\n'; }
#else
#define dbg(...) 42
#define dbgR(...) 4242
#define dbgP(...) 420
#define dbgRP(...) 420420
void nline() {}
#endif

std::pair<int, int> query(int v, const std::set<int> &s) {
  cout << "? " << 1 + (int)s.size() << ' ';
  for (int i : s)
    cout << i + 1 << ' ';
  cout << v + 1 << std::endl;

  int a, b;
  cin >> a >> b;
  if (a != -1)
    a--, b--;
  return {a, b};
}

int main() {
#ifdef LOCAL

#else
  // cin.tie(nullptr)->sync_with_stdio(false);
  std::ios::sync_with_stdio(false);
#endif

  int n;
  cin >> n;

  std::vector<std::set<int>> v;
  v.push_back({0});
  std::vector<std::pair<int, int>> ans;
  for (int i = 1; i < n; ++i) {
    int ind = -1;
    for (int j = 0; j < (int)v.size(); ++j) {
      std::set<int> s = v[j];
      // auto [a, b] = query(i, s);
      int a, b;
      std::tie(a, b) = query(i, s);
      if (a == -1)
        ind = j;
      while (a != -1) {
        if (a > b)
          std::swap(a, b);
        ans.emplace_back(a, b);
        s.erase(a);
        std::tie(a, b) = query(i, s);
      }
    }
    if (ind == -1)
      v.push_back({i});
    else
      v[ind].insert(i);
  }
  cout << "! " << (int)ans.size() << std::endl;
  for (auto [a, b] : ans)
    cout << a + 1 << ' ' << b + 1 << std::endl;
}

详细

Test #1:

score: 100
Accepted
time: 1ms
memory: 3488kb

input:

3
1 2
-1 -1
1 3
-1 -1
2 3
-1 -1

output:

? 2 1 2
? 1 2
? 2 1 3
? 1 3
? 2 2 3
? 1 3
! 3
1 2
1 3
2 3

result:

ok correct

Test #2:

score: 0
Accepted
time: 1ms
memory: 3484kb

input:

10
1 2
-1 -1
1 3
-1 -1
-1 -1
1 4
-1 -1
-1 -1
-1 -1
2 5
4 5
-1 -1
-1 -1
2 6
-1 -1
-1 -1
3 7
-1 -1
-1 -1
4 8
3 8
-1 -1
-1 -1
3 9
-1 -1
-1 -1
4 10
3 10
-1 -1

output:

? 2 1 2
? 1 2
? 2 1 3
? 1 3
? 2 2 3
? 2 1 4
? 1 4
? 3 2 3 4
? 2 1 5
? 4 2 3 4 5
? 3 3 4 5
? 2 3 5
? 3 1 5 6
? 4 2 3 4 6
? 3 3 4 6
? 4 1 5 6 7
? 4 2 3 4 7
? 3 2 4 7
? 5 1 5 6 7 8
? 4 2 3 4 8
? 3 2 3 8
? 2 2 8
? 6 1 5 6 7 8 9
? 4 2 3 4 9
? 3 2 4 9
? 7 1 5 6 7 8 9 10
? 4 2 3 4 10
? 3 2 3 10
? 2 2 10
! ...

result:

ok correct

Test #3:

score: 0
Accepted
time: 2ms
memory: 3404kb

input:

5
2 1
-1 -1
3 1
-1 -1
3 2
-1 -1
4 1
-1 -1
4 2
-1 -1
-1 -1
5 1
-1 -1
5 2
-1 -1
-1 -1

output:

? 2 1 2
? 1 2
? 2 1 3
? 1 3
? 2 2 3
? 1 3
? 2 1 4
? 1 4
? 2 2 4
? 1 4
? 2 3 4
? 2 1 5
? 1 5
? 2 2 5
? 1 5
? 3 3 4 5
! 7
1 2
1 3
2 3
1 4
2 4
1 5
2 5

result:

ok correct

Test #4:

score: 0
Accepted
time: 1ms
memory: 3404kb

input:

3
2 1
-1 -1
1 3
-1 -1
-1 -1

output:

? 2 1 2
? 1 2
? 2 1 3
? 1 3
? 2 2 3
! 2
1 2
1 3

result:

ok correct

Test #5:

score: 0
Accepted
time: 2ms
memory: 3496kb

input:

6
1 2
-1 -1
3 1
-1 -1
3 2
-1 -1
-1 -1
4 2
-1 -1
3 4
-1 -1
4 5
-1 -1
2 5
-1 -1
3 5
-1 -1
-1 -1
-1 -1
3 6
-1 -1
-1 -1

output:

? 2 1 2
? 1 2
? 2 1 3
? 1 3
? 2 2 3
? 1 3
? 2 1 4
? 2 2 4
? 1 4
? 2 3 4
? 1 4
? 3 1 4 5
? 2 1 5
? 2 2 5
? 1 5
? 2 3 5
? 1 5
? 3 1 4 6
? 2 2 6
? 2 3 6
? 1 6
? 2 5 6
! 9
1 2
1 3
2 3
2 4
3 4
4 5
2 5
3 5
3 6

result:

ok correct

Test #6:

score: 0
Accepted
time: 1ms
memory: 3488kb

input:

27
-1 -1
3 1
3 2
-1 -1
-1 -1
-1 -1
2 5
1 5
-1 -1
3 5
-1 -1
6 1
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
1 8
-1 -1
-1 -1
6 8
-1 -1
1 9
-1 -1
-1 -1
-1 -1
-1 -1
10 8
-1 -1
-1 -1
1 11
-1 -1
4 11
-1 -1
6 11
5 11
-1 -1
-1 -1
-1 -1
5 12
-1 -1
12 11
-1 -1
-1 -1
8 13
-1 -1
6 13
10 13
5 13
-1 -1
-1 -1
14 1
-1 -1
1...

output:

? 2 1 2
? 3 1 2 3
? 2 2 3
? 1 3
? 3 1 2 4
? 2 3 4
? 3 1 2 5
? 2 1 5
? 1 5
? 3 3 4 5
? 2 4 5
? 3 1 2 6
? 2 2 6
? 3 3 4 6
? 2 5 6
? 3 1 2 7
? 3 3 4 7
? 3 5 6 7
? 3 1 2 8
? 2 2 8
? 3 3 4 8
? 4 5 6 7 8
? 3 5 7 8
? 3 1 2 9
? 2 2 9
? 4 3 4 8 9
? 4 5 6 7 9
? 3 1 2 10
? 4 3 4 8 10
? 3 3 4 10
? 5 5 6 7 9 10
...

result:

ok correct

Test #7:

score: 0
Accepted
time: 8ms
memory: 3544kb

input:

47
-1 -1
-1 -1
-1 -1
5 4
5 3
-1 -1
-1 -1
-1 -1
-1 -1
7 5
7 6
-1 -1
-1 -1
5 8
-1 -1
9 4
-1 -1
-1 -1
10 7
-1 -1
-1 -1
7 11
11 1
-1 -1
-1 -1
12 3
7 12
2 12
-1 -1
5 12
11 12
-1 -1
13 7
-1 -1
13 5
13 11
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
4 15
-1 -1
-1 -1
13 15
-1 -1
16 1
-1 -1
-1 -1
-1 -1
17 8
17 3
17 7
17 1
...

output:

? 2 1 2
? 3 1 2 3
? 4 1 2 3 4
? 5 1 2 3 4 5
? 4 1 2 3 5
? 3 1 2 5
? 5 1 2 3 4 6
? 2 5 6
? 5 1 2 3 4 7
? 3 5 6 7
? 2 6 7
? 1 7
? 6 1 2 3 4 7 8
? 3 5 6 8
? 2 6 8
? 7 1 2 3 4 7 8 9
? 6 1 2 3 7 8 9
? 3 5 6 9
? 7 1 2 3 4 7 8 10
? 6 1 2 3 4 8 10
? 4 5 6 9 10
? 7 1 2 3 4 7 8 11
? 6 1 2 3 4 8 11
? 5 2 3 4 8...

result:

ok correct

Test #8:

score: 0
Accepted
time: 13ms
memory: 3352kb

input:

38
-1 -1
-1 -1
4 1
-1 -1
1 5
3 5
-1 -1
4 5
-1 -1
-1 -1
4 6
-1 -1
-1 -1
2 7
-1 -1
4 7
-1 -1
6 7
7 5
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
4 10
-1 -1
-1 -1
-1 -1
11 1
-1 -1
11 4
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
12 8
12 7
11 12
-1 -1
13 1
-1 -1
4 13
-1 -1
13 12
-1 -1
11 13
13 8...

output:

? 2 1 2
? 3 1 2 3
? 4 1 2 3 4
? 3 2 3 4
? 4 1 2 3 5
? 3 2 3 5
? 2 2 5
? 2 4 5
? 1 5
? 4 1 2 3 6
? 2 4 6
? 1 6
? 2 5 6
? 4 1 2 3 7
? 3 1 3 7
? 2 4 7
? 1 7
? 3 5 6 7
? 2 5 7
? 1 7
? 4 1 2 3 8
? 2 4 8
? 3 5 6 8
? 2 7 8
? 4 1 2 3 9
? 2 4 9
? 3 5 6 9
? 3 7 8 9
? 4 1 2 3 10
? 2 4 10
? 1 10
? 3 5 6 10
? 4 ...

result:

ok correct

Test #9:

score: 0
Accepted
time: 1ms
memory: 3404kb

input:

25
-1 -1
-1 -1
-1 -1
5 4
5 2
-1 -1
6 4
-1 -1
-1 -1
7 3
-1 -1
5 7
-1 -1
4 8
2 8
-1 -1
5 8
-1 -1
-1 -1
9 4
2 9
-1 -1
-1 -1
9 8
-1 -1
10 3
-1 -1
-1 -1
-1 -1
2 11
-1 -1
9 11
-1 -1
10 11
-1 -1
12 4
-1 -1
6 12
-1 -1
-1 -1
-1 -1
-1 -1
6 13
5 13
-1 -1
13 8
7 13
-1 -1
-1 -1
14 4
14 3
-1 -1
5 14
-1 -1
7 14
-1...

output:

? 2 1 2
? 3 1 2 3
? 4 1 2 3 4
? 5 1 2 3 4 5
? 4 1 2 3 5
? 3 1 3 5
? 5 1 2 3 4 6
? 4 1 2 3 6
? 2 5 6
? 5 1 2 3 4 7
? 4 1 2 4 7
? 3 5 6 7
? 2 6 7
? 5 1 2 3 4 8
? 4 1 2 3 8
? 3 1 3 8
? 3 5 6 8
? 2 6 8
? 2 7 8
? 5 1 2 3 4 9
? 4 1 2 3 9
? 3 1 3 9
? 3 5 6 9
? 3 7 8 9
? 2 7 9
? 5 1 2 3 4 10
? 4 1 2 4 10
? ...

result:

ok correct

Test #10:

score: 0
Accepted
time: 1ms
memory: 3440kb

input:

6
-1 -1
2 3
-1 -1
-1 -1
-1 -1
2 5
-1 -1
-1 -1
-1 -1
5 6
-1 -1

output:

? 2 1 2
? 3 1 2 3
? 2 1 3
? 3 1 2 4
? 2 3 4
? 3 1 2 5
? 2 1 5
? 3 3 4 5
? 3 1 2 6
? 4 3 4 5 6
? 3 3 4 6
! 3
2 3
2 5
5 6

result:

ok correct

Test #11:

score: 0
Accepted
time: 2ms
memory: 3484kb

input:

3
2 1
-1 -1
3 1
-1 -1
2 3
-1 -1

output:

? 2 1 2
? 1 2
? 2 1 3
? 1 3
? 2 2 3
? 1 3
! 3
1 2
1 3
2 3

result:

ok correct

Test #12:

score: 0
Accepted
time: 0ms
memory: 3404kb

input:

3
2 1
-1 -1
3 1
-1 -1
-1 -1

output:

? 2 1 2
? 1 2
? 2 1 3
? 1 3
? 2 2 3
! 2
1 2
1 3

result:

ok correct

Test #13:

score: 0
Accepted
time: 1ms
memory: 3480kb

input:

5
2 1
-1 -1
3 1
-1 -1
2 3
-1 -1
-1 -1
-1 -1
-1 -1
5 1
-1 -1
2 5
-1 -1
-1 -1

output:

? 2 1 2
? 1 2
? 2 1 3
? 1 3
? 2 2 3
? 1 3
? 2 1 4
? 2 2 4
? 2 3 4
? 2 1 5
? 1 5
? 2 2 5
? 1 5
? 3 3 4 5
! 5
1 2
1 3
2 3
1 5
2 5

result:

ok correct

Test #14:

score: 0
Accepted
time: 1ms
memory: 3484kb

input:

3
2 1
-1 -1
-1 -1
-1 -1

output:

? 2 1 2
? 1 2
? 2 1 3
? 2 2 3
! 1
1 2

result:

ok correct

Test #15:

score: 0
Accepted
time: 1ms
memory: 3484kb

input:

5
-1 -1
-1 -1
4 3
-1 -1
2 5
3 5
-1 -1
-1 -1

output:

? 2 1 2
? 3 1 2 3
? 4 1 2 3 4
? 3 1 2 4
? 4 1 2 3 5
? 3 1 3 5
? 2 1 5
? 2 4 5
! 3
3 4
2 5
3 5

result:

ok correct

Test #16:

score: 0
Accepted
time: 8ms
memory: 3440kb

input:

93
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
10 9
-1 -1
7 11
-1 -1
-1 -1
2 12
-1 -1
-1 -1
5 13
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
15 12
-1 -1
6 16
8 16
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
19 18
11 19
-1 -1
-1 -1
20 16
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
1 23
8 23
-1 -1
-1 -1
-1 -1
-1 -1
1 25
-1 -1
...

output:

? 2 1 2
? 3 1 2 3
? 4 1 2 3 4
? 5 1 2 3 4 5
? 6 1 2 3 4 5 6
? 7 1 2 3 4 5 6 7
? 8 1 2 3 4 5 6 7 8
? 9 1 2 3 4 5 6 7 8 9
? 10 1 2 3 4 5 6 7 8 9 10
? 9 1 2 3 4 5 6 7 8 10
? 10 1 2 3 4 5 6 7 8 9 11
? 9 1 2 3 4 5 6 8 9 11
? 2 10 11
? 10 1 2 3 4 5 6 7 8 9 12
? 9 1 3 4 5 6 7 8 9 12
? 3 10 11 12
? 10 1 2 3...

result:

ok correct

Test #17:

score: 0
Accepted
time: 5ms
memory: 3564kb

input:

111
-1 -1
-1 -1
-1 -1
-1 -1
2 6
-1 -1
7 4
-1 -1
-1 -1
3 8
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
2 11
4 11
-1 -1
-1 -1
12 4
-1 -1
6 12
7 12
12 11
-1 -1
-1 -1
13 10
7 13
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
17 10
-1 -1
-1 -1
4 18
18 5
-1 -1
-1 -1
-1 -1
-1 -1
11 19
-1 -...

output:

? 2 1 2
? 3 1 2 3
? 4 1 2 3 4
? 5 1 2 3 4 5
? 6 1 2 3 4 5 6
? 5 1 3 4 5 6
? 6 1 2 3 4 5 7
? 5 1 2 3 5 7
? 2 6 7
? 6 1 2 3 4 5 8
? 5 1 2 4 5 8
? 3 6 7 8
? 6 1 2 3 4 5 9
? 4 6 7 8 9
? 6 1 2 3 4 5 10
? 5 6 7 8 9 10
? 6 1 2 3 4 5 11
? 5 1 3 4 5 11
? 4 1 3 5 11
? 6 6 7 8 9 10 11
? 6 1 2 3 4 5 12
? 5 1 2 ...

result:

ok correct

Test #18:

score: 0
Accepted
time: 9ms
memory: 3516kb

input:

132
-1 -1
3 1
-1 -1
-1 -1
-1 -1
5 1
-1 -1
-1 -1
-1 -1
6 3
-1 -1
7 2
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
10 8
5 10
-1 -1
-1 -1
-1 -1
-1 -1
12 8
-1 -1
-1 -1
9 13
-1 -1
2 14
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
17 15
-1 -1
-1 -1
-1 -1
17 19
19 10
19 6
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
21 20
-1 -...

output:

? 2 1 2
? 3 1 2 3
? 2 2 3
? 3 1 2 4
? 2 3 4
? 3 1 2 5
? 2 2 5
? 3 3 4 5
? 3 1 2 6
? 4 3 4 5 6
? 3 4 5 6
? 4 1 2 6 7
? 3 1 6 7
? 4 3 4 5 7
? 4 1 2 6 8
? 5 3 4 5 7 8
? 4 1 2 6 9
? 6 3 4 5 7 8 9
? 4 1 2 6 10
? 7 3 4 5 7 8 9 10
? 6 3 4 5 7 9 10
? 5 3 4 7 9 10
? 5 1 2 6 10 11
? 7 3 4 5 7 8 9 11
? 5 1 2 6...

result:

ok correct

Test #19:

score: 0
Accepted
time: 0ms
memory: 3516kb

input:

94
-1 -1
3 2
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
2 7
-1 -1
-1 -1
-1 -1
-1 -1
2 9
-1 -1
7 9
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
11 6
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
6 13
-1 -1
11 13
-1 -1
-1 -1
-1 -1
14 11
14 10
-1 -1
-1 -1
-1 -1
15 11
-1 -1
-1 -1
15 16
16 7
-1 -1
-1 -1
-1 -1
17 8
-1 -1
17 11
17 ...

output:

? 2 1 2
? 3 1 2 3
? 2 1 3
? 3 1 2 4
? 2 3 4
? 3 1 2 5
? 3 3 4 5
? 3 1 2 6
? 4 3 4 5 6
? 3 1 2 7
? 2 1 7
? 5 3 4 5 6 7
? 3 1 2 8
? 6 3 4 5 6 7 8
? 3 1 2 9
? 2 1 9
? 7 3 4 5 6 7 8 9
? 6 3 4 5 6 8 9
? 3 1 2 10
? 7 3 4 5 6 7 8 10
? 2 9 10
? 3 1 2 11
? 7 3 4 5 6 7 8 11
? 6 3 4 5 7 8 11
? 3 9 10 11
? 3 1 ...

result:

ok correct

Test #20:

score: 0
Accepted
time: 15ms
memory: 3460kb

input:

73
-1 -1
1 3
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
5 7
6 7
-1 -1
-1 -1
3 8
-1 -1
1 9
9 8
-1 -1
-1 -1
1 10
-1 -1
3 10
4 10
9 10
-1 -1
-1 -1
4 11
-1 -1
-1 -1
-1 -1
12 9
12 3
-1 -1
12 10
-1 -1
-1 -1
13 6
-1 -1
13 11
-1 -1
-1 -1
-1 -1
-1 -1
15 8
-1 -1
-1 -1
-1 -1
1 16
-1 -1
3 16
-1 -1
10 16
16...

output:

? 2 1 2
? 3 1 2 3
? 2 2 3
? 3 1 2 4
? 2 3 4
? 3 1 2 5
? 3 3 4 5
? 3 1 2 6
? 4 3 4 5 6
? 3 1 2 7
? 5 3 4 5 6 7
? 4 3 4 6 7
? 3 3 4 7
? 4 1 2 7 8
? 5 3 4 5 6 8
? 4 4 5 6 8
? 5 1 2 7 8 9
? 4 2 7 8 9
? 3 2 7 9
? 5 3 4 5 6 9
? 5 1 2 7 8 10
? 4 2 7 8 10
? 6 3 4 5 6 9 10
? 5 4 5 6 9 10
? 4 5 6 9 10
? 3 5 6...

result:

ok correct

Test #21:

score: 0
Accepted
time: 5ms
memory: 3452kb

input:

77
-1 -1
3 2
-1 -1
2 4
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
3 6
-1 -1
-1 -1
3 7
-1 -1
-1 -1
3 8
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
1 11
-1 -1
-1 -1
-1 -1
-1 -1
8 13
-1 -1
-1 -1
2 14
14 8
14 7
-1 -1
-1 -1
2 15
15 8
-1 -1
3 15
-1 -1
16 1
16 8
2 16
-1 -1
-1 -1
16 15
-1 -1
7 17
2 17
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
-1...

output:

? 2 1 2
? 3 1 2 3
? 2 1 3
? 3 1 2 4
? 2 1 4
? 2 3 4
? 3 1 2 5
? 3 3 4 5
? 3 1 2 6
? 4 3 4 5 6
? 3 4 5 6
? 4 1 2 6 7
? 4 3 4 5 7
? 3 4 5 7
? 5 1 2 6 7 8
? 4 3 4 5 8
? 3 4 5 8
? 6 1 2 6 7 8 9
? 4 3 4 5 9
? 6 1 2 6 7 8 10
? 5 3 4 5 9 10
? 6 1 2 6 7 8 11
? 5 2 6 7 8 11
? 6 3 4 5 9 10 11
? 6 1 2 6 7 8 12...

result:

ok correct

Test #22:

score: 0
Accepted
time: 12ms
memory: 3560kb

input:

81
-1 -1
2 3
-1 -1
2 4
-1 -1
-1 -1
1 5
-1 -1
4 5
-1 -1
-1 -1
4 6
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
1 8
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
2 10
-1 -1
10 3
10 4
-1 -1
10 6
-1 -1
-1 -1
11 3
4 11
-1 -1
-1 -1
-1 -1
2 12
-1 -1
-1 -1
6 12
8 12
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
10 13
-1 -1
1 14
-1 -1
-1 -1
-1 -1
1...

output:

? 2 1 2
? 3 1 2 3
? 2 1 3
? 3 1 2 4
? 2 1 4
? 2 3 4
? 3 1 2 5
? 2 2 5
? 3 3 4 5
? 2 3 5
? 3 1 2 6
? 3 3 4 6
? 2 3 6
? 2 5 6
? 3 1 2 7
? 3 3 4 7
? 3 5 6 7
? 3 1 2 8
? 2 2 8
? 3 3 4 8
? 4 5 6 7 8
? 3 1 2 9
? 3 3 4 9
? 5 5 6 7 8 9
? 3 1 2 10
? 2 1 10
? 3 3 4 10
? 2 4 10
? 1 10
? 6 5 6 7 8 9 10
? 5 5 7 ...

result:

ok correct

Test #23:

score: 0
Accepted
time: 7ms
memory: 3512kb

input:

93
-1 -1
-1 -1
4 1
2 4
-1 -1
-1 -1
-1 -1
-1 -1
4 6
-1 -1
2 7
-1 -1
-1 -1
1 8
3 8
-1 -1
-1 -1
9 1
-1 -1
9 8
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
13 7
-1 -1
-1 -1
1 14
-1 -1
4 14
-1 -1
9 14
-1 -1
-1 -1
-1 -1
-1 -1
14 15
-1 -1
-1 -1
-1 -1
13 16
-1 -1
-1 -1
2 17
17 3
17 1
-1...

output:

? 2 1 2
? 3 1 2 3
? 4 1 2 3 4
? 3 2 3 4
? 2 3 4
? 4 1 2 3 5
? 2 4 5
? 4 1 2 3 6
? 3 4 5 6
? 2 5 6
? 5 1 2 3 6 7
? 4 1 3 6 7
? 3 4 5 7
? 5 1 2 3 6 8
? 4 2 3 6 8
? 3 2 6 8
? 4 4 5 7 8
? 5 1 2 3 6 9
? 4 2 3 6 9
? 5 4 5 7 8 9
? 4 4 5 7 9
? 5 1 2 3 6 10
? 5 4 5 7 8 10
? 2 9 10
? 5 1 2 3 6 11
? 5 4 5 7 8 ...

result:

ok correct

Test #24:

score: 0
Accepted
time: 5ms
memory: 3496kb

input:

37
-1 -1
3 1
-1 -1
-1 -1
-1 -1
2 5
-1 -1
-1 -1
-1 -1
-1 -1
2 7
7 1
-1 -1
-1 -1
1 8
2 8
-1 -1
4 8
6 8
7 8
-1 -1
2 9
9 1
-1 -1
6 9
-1 -1
9 8
-1 -1
1 10
-1 -1
3 10
-1 -1
10 8
-1 -1
-1 -1
11 1
2 11
-1 -1
3 11
7 11
4 11
-1 -1
11 8
-1 -1
9 11
-1 -1
12 1
-1 -1
12 7
-1 -1
12 8
-1 -1
-1 -1
-1 -1
-1 -1
6 13
-...

output:

? 2 1 2
? 3 1 2 3
? 2 2 3
? 3 1 2 4
? 2 3 4
? 3 1 2 5
? 2 1 5
? 3 3 4 5
? 3 1 2 6
? 4 3 4 5 6
? 3 1 2 7
? 2 1 7
? 1 7
? 5 3 4 5 6 7
? 3 1 2 8
? 2 2 8
? 1 8
? 6 3 4 5 6 7 8
? 5 3 5 6 7 8
? 4 3 5 7 8
? 3 3 5 8
? 3 1 2 9
? 2 1 9
? 1 9
? 6 3 4 5 6 7 9
? 5 3 4 5 7 9
? 2 8 9
? 1 9
? 3 1 2 10
? 2 2 10
? 6 ...

result:

ok correct

Test #25:

score: -100
Time Limit Exceeded

input:

144
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
9 15
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
14 18
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
5 22
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
-1 -1
-1 -...

output:

? 2 1 2
? 3 1 2 3
? 4 1 2 3 4
? 5 1 2 3 4 5
? 6 1 2 3 4 5 6
? 7 1 2 3 4 5 6 7
? 8 1 2 3 4 5 6 7 8
? 9 1 2 3 4 5 6 7 8 9
? 10 1 2 3 4 5 6 7 8 9 10
? 11 1 2 3 4 5 6 7 8 9 10 11
? 12 1 2 3 4 5 6 7 8 9 10 11 12
? 13 1 2 3 4 5 6 7 8 9 10 11 12 13
? 14 1 2 3 4 5 6 7 8 9 10 11 12 13 14
? 15 1 2 3 4 5 6 7 8...

result: