oj.uz

답안 #218309

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
218309 2020-04-02T00:18:20 Z rama_pang Meetings (JOI19_meetings) C++14
100 / 100
 878 ms 992 KB 
#include "meetings.h"
#include <bits/stdc++.h>
using namespace std;

mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());

void SolvePath(int root, int endpoint, vector<int> &path) { // sorting algorithm to solve path subproblem
  stable_sort(begin(path), end(path), [&](int l, int r) {
    if (l == root) return true;
    if (l == endpoint) return false;
    if (r == root) return false;
    if (r == endpoint) return true;
    return Query(root, l, r) == l; // l is the nearer one to root
  });

  for (int i = 1; i < (int) path.size(); i++) {
    Bridge(min(path[i - 1], path[i]), max(path[i - 1], path[i]));
  }
}

void SolveTree(int root, vector<int> &nodes) {
  if (nodes.empty()) return;

  shuffle(begin(nodes), end(nodes), rnd);
  int endpoint = nodes.back();
  nodes.pop_back();

  map<int, vector<int>> S;
  vector<int> path = {root, endpoint};

  for (auto &v : nodes) {
    int q = Query(root, endpoint, v);
    if (v == q) {
      path.emplace_back(v);
    } else {
      S[q].emplace_back(v);
    }
  }

  nodes.clear();
  nodes.shrink_to_fit();

  SolvePath(root, endpoint, path);

  for (auto &v : path) {
    SolveTree(v, S[v]);
  }
}

void Solve(int N) {
  int root = rnd() % N;
  vector<int> nodes;

  for (int i = 0; i < N; i++) {
    if (i == root) continue;
    nodes.emplace_back(i);
  }

  return SolveTree(root, nodes);
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 5 ms 432 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 5 ms 432 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 5 ms 512 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 5 ms 384 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 5 ms 384 KB Output is correct
26 Correct 5 ms 384 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 5 ms 432 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 5 ms 512 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 5 ms 384 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 5 ms 384 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 11 ms 384 KB Output is correct
28 Correct 10 ms 384 KB Output is correct
29 Correct 9 ms 384 KB Output is correct
30 Correct 9 ms 384 KB Output is correct
31 Correct 9 ms 384 KB Output is correct
32 Correct 13 ms 456 KB Output is correct
33 Correct 17 ms 384 KB Output is correct
34 Correct 21 ms 384 KB Output is correct
35 Correct 19 ms 384 KB Output is correct
36 Correct 9 ms 384 KB Output is correct
37 Correct 15 ms 512 KB Output is correct
38 Correct 17 ms 384 KB Output is correct
39 Correct 11 ms 512 KB Output is correct

Subtask #4
71.0 / 71.0

# 결과 실행 시간 메모리 Grader output
1 Correct 474 ms 608 KB Output is correct
2 Correct 587 ms 632 KB Output is correct
3 Correct 498 ms 760 KB Output is correct
4 Correct 588 ms 764 KB Output is correct
5 Correct 420 ms 764 KB Output is correct
6 Correct 375 ms 632 KB Output is correct
7 Correct 719 ms 640 KB Output is correct
8 Correct 754 ms 760 KB Output is correct
9 Correct 719 ms 760 KB Output is correct
10 Correct 677 ms 760 KB Output is correct
11 Correct 804 ms 632 KB Output is correct
12 Correct 509 ms 760 KB Output is correct
13 Correct 259 ms 632 KB Output is correct
14 Correct 435 ms 632 KB Output is correct
15 Correct 470 ms 820 KB Output is correct
16 Correct 517 ms 636 KB Output is correct
17 Correct 706 ms 636 KB Output is correct
18 Correct 494 ms 784 KB Output is correct
19 Correct 503 ms 632 KB Output is correct
20 Correct 538 ms 632 KB Output is correct
21 Correct 529 ms 760 KB Output is correct
22 Correct 635 ms 644 KB Output is correct
23 Correct 568 ms 896 KB Output is correct
24 Correct 581 ms 760 KB Output is correct
25 Correct 597 ms 632 KB Output is correct
26 Correct 570 ms 740 KB Output is correct
27 Correct 569 ms 900 KB Output is correct
28 Correct 837 ms 864 KB Output is correct
29 Correct 751 ms 892 KB Output is correct
30 Correct 853 ms 992 KB Output is correct
31 Correct 763 ms 760 KB Output is correct
32 Correct 878 ms 992 KB Output is correct
33 Correct 696 ms 888 KB Output is correct
34 Correct 15 ms 384 KB Output is correct
35 Correct 9 ms 384 KB Output is correct
36 Correct 11 ms 384 KB Output is correct
37 Correct 10 ms 384 KB Output is correct
38 Correct 11 ms 384 KB Output is correct
39 Correct 13 ms 384 KB Output is correct
40 Correct 18 ms 384 KB Output is correct
41 Correct 24 ms 384 KB Output is correct
42 Correct 18 ms 384 KB Output is correct
43 Correct 9 ms 384 KB Output is correct
44 Correct 15 ms 460 KB Output is correct
45 Correct 17 ms 384 KB Output is correct
46 Correct 19 ms 384 KB Output is correct
47 Correct 5 ms 384 KB Output is correct
48 Correct 5 ms 384 KB Output is correct
49 Correct 5 ms 384 KB Output is correct
50 Correct 5 ms 384 KB Output is correct
51 Correct 5 ms 384 KB Output is correct
52 Correct 5 ms 384 KB Output is correct
53 Correct 5 ms 384 KB Output is correct
54 Correct 5 ms 384 KB Output is correct
55 Correct 5 ms 384 KB Output is correct
56 Correct 5 ms 384 KB Output is correct
57 Correct 5 ms 384 KB Output is correct
58 Correct 5 ms 384 KB Output is correct
59 Correct 5 ms 384 KB Output is correct
60 Correct 4 ms 384 KB Output is correct
61 Correct 4 ms 384 KB Output is correct
62 Correct 4 ms 384 KB Output is correct
63 Correct 4 ms 384 KB Output is correct
64 Correct 5 ms 384 KB Output is correct
65 Correct 4 ms 384 KB Output is correct
66 Correct 4 ms 384 KB Output is correct
67 Correct 4 ms 384 KB Output is correct
68 Correct 4 ms 384 KB Output is correct
69 Correct 4 ms 384 KB Output is correct
70 Correct 5 ms 384 KB Output is correct
71 Correct 5 ms 384 KB Output is correct
72 Correct 4 ms 384 KB Output is correct