Submission #282626

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
282626	2020-08-24 16:14:29	rama_pang	Park (JOI17_park)	C++14	100 / 100	848 ms	1252 KiB

park

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 "park.h"
#include <bits/stdc++.h>
using namespace std;
void Detect(int T, int N) {
  vector<int> graph;
  vector<int> candidate;
  vector<pair<int, int>> edges;
  graph.emplace_back(0);
  for (int i = 1; i < N; i++) {
    candidate.emplace_back(i);
  }
  const auto CreateVector = [&](int l, int r, vector<int> a) {
    vector<int> res;
    for (int i = l; i <= r; i++) {
      res.emplace_back(a[i]);
    }
    return res;
  };
  const auto IsConnected = [&](int node, vector<int> g) -> bool {
    vector<int> query(N, 0);
    for (auto i : g) {
      query[i] = 1;
    }
    query[node] = 1;
    return Ask(min(g[0], node), max(g[0], node), query.data());
  };
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 27 / 27
• Subtask 4: 30 / 30
• Subtask 5: 23 / 23