oj.uz

Submission #200056

# Submission time Handle Problem Language Result Execution time Memory
200056 2020-02-05T07:01:42 Z EntityIT Meetings (JOI19_meetings) C++14
100 / 100
 1360 ms 1144 KB 
#include<bits/stdc++.h>
#include "meetings.h"

using namespace std;

#define all(x) (x).begin(), (x).end()
#define sz(x) ( (int)(x).size() )
using LL = long long;

mt19937 rng( (uint32_t)chrono::steady_clock::now().time_since_epoch().count() );

void bridge(int u, int v) { Bridge(min(u, v), max(u, v) ); }

vector<vector<int> > rem;
void solve(int l) {
  if (!sz(rem[l]) ) return ;

  int r = rem[l].back(); rem[l].pop_back();

  vector<int> tmp = rem[l];
  rem[l].clear(); rem[r].clear();
  for (int u : tmp) rem[u].clear();

  vector<int> path;
  for (auto u : tmp) {
    int pr = Query(l, r, u);
    if (pr == u) {
      if (u != l && u != r) path.emplace_back(u);
    }
    else rem[pr].emplace_back(u);
  }

  if (sz(path) ) {
    sort(all(path), [&](int u, int v) { return Query(l, u, v) == u; });
    bridge(l, path[0]);
    bridge(r, path.back() );
    for (int i = 0; i + 1 < sz(path); ++i) bridge(path[i], path[i + 1]);
  }
  else bridge(l, r);

  solve(l); solve(r);
  for (auto &u : path) solve(u);
}

void Solve(int N) {
  rem.assign(N, {} );
  for (int u = 1; u < N; ++u) rem[0].emplace_back(u);
  solve(0);
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 252 KB Output is correct
2 Correct 4 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 248 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 248 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 248 KB Output is correct
13 Correct 5 ms 248 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 252 KB Output is correct
2 Correct 4 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 248 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 248 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 248 KB Output is correct
13 Correct 5 ms 248 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 5 ms 376 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
22 Correct 5 ms 376 KB Output is correct
23 Correct 5 ms 376 KB Output is correct
24 Correct 5 ms 376 KB Output is correct
25 Correct 5 ms 376 KB Output is correct
26 Correct 5 ms 376 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 252 KB Output is correct
2 Correct 4 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 248 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 248 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 248 KB Output is correct
13 Correct 5 ms 248 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 5 ms 376 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
22 Correct 5 ms 376 KB Output is correct
23 Correct 5 ms 376 KB Output is correct
24 Correct 5 ms 376 KB Output is correct
25 Correct 5 ms 376 KB Output is correct
26 Correct 5 ms 376 KB Output is correct
27 Correct 13 ms 632 KB Output is correct
28 Correct 11 ms 380 KB Output is correct
29 Correct 10 ms 376 KB Output is correct
30 Correct 10 ms 376 KB Output is correct
31 Correct 9 ms 504 KB Output is correct
32 Correct 13 ms 376 KB Output is correct
33 Correct 19 ms 380 KB Output is correct
34 Correct 20 ms 504 KB Output is correct
35 Correct 20 ms 376 KB Output is correct
36 Correct 10 ms 404 KB Output is correct
37 Correct 24 ms 508 KB Output is correct
38 Correct 13 ms 376 KB Output is correct
39 Correct 18 ms 420 KB Output is correct

Subtask #4
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 622 ms 888 KB Output is correct
2 Correct 547 ms 892 KB Output is correct
3 Correct 606 ms 808 KB Output is correct
4 Correct 684 ms 940 KB Output is correct
5 Correct 381 ms 760 KB Output is correct
6 Correct 414 ms 760 KB Output is correct
7 Correct 650 ms 760 KB Output is correct
8 Correct 790 ms 656 KB Output is correct
9 Correct 745 ms 760 KB Output is correct
10 Correct 737 ms 768 KB Output is correct
11 Correct 791 ms 900 KB Output is correct
12 Correct 708 ms 888 KB Output is correct
13 Correct 288 ms 632 KB Output is correct
14 Correct 587 ms 760 KB Output is correct
15 Correct 428 ms 1016 KB Output is correct
16 Correct 502 ms 888 KB Output is correct
17 Correct 738 ms 1016 KB Output is correct
18 Correct 408 ms 888 KB Output is correct
19 Correct 424 ms 632 KB Output is correct
20 Correct 614 ms 892 KB Output is correct
21 Correct 649 ms 888 KB Output is correct
22 Correct 657 ms 648 KB Output is correct
23 Correct 577 ms 632 KB Output is correct
24 Correct 537 ms 892 KB Output is correct
25 Correct 483 ms 760 KB Output is correct
26 Correct 462 ms 764 KB Output is correct
27 Correct 492 ms 1068 KB Output is correct
28 Correct 832 ms 760 KB Output is correct
29 Correct 668 ms 632 KB Output is correct
30 Correct 666 ms 756 KB Output is correct
31 Correct 791 ms 1016 KB Output is correct
32 Correct 1360 ms 1144 KB Output is correct
33 Correct 1035 ms 888 KB Output is correct
34 Correct 12 ms 504 KB Output is correct
35 Correct 10 ms 380 KB Output is correct
36 Correct 10 ms 376 KB Output is correct
37 Correct 10 ms 376 KB Output is correct
38 Correct 8 ms 376 KB Output is correct
39 Correct 13 ms 376 KB Output is correct
40 Correct 19 ms 376 KB Output is correct
41 Correct 21 ms 420 KB Output is correct
42 Correct 22 ms 540 KB Output is correct
43 Correct 9 ms 376 KB Output is correct
44 Correct 23 ms 504 KB Output is correct
45 Correct 14 ms 376 KB Output is correct
46 Correct 18 ms 504 KB Output is correct
47 Correct 5 ms 376 KB Output is correct
48 Correct 5 ms 376 KB Output is correct
49 Correct 5 ms 504 KB Output is correct
50 Correct 5 ms 376 KB Output is correct
51 Correct 5 ms 376 KB Output is correct
52 Correct 5 ms 376 KB Output is correct
53 Correct 5 ms 376 KB Output is correct
54 Correct 5 ms 380 KB Output is correct
55 Correct 5 ms 376 KB Output is correct
56 Correct 5 ms 376 KB Output is correct
57 Correct 5 ms 376 KB Output is correct
58 Correct 5 ms 372 KB Output is correct
59 Correct 5 ms 376 KB Output is correct
60 Correct 5 ms 376 KB Output is correct
61 Correct 5 ms 252 KB Output is correct
62 Correct 5 ms 376 KB Output is correct
63 Correct 5 ms 376 KB Output is correct
64 Correct 5 ms 376 KB Output is correct
65 Correct 5 ms 248 KB Output is correct
66 Correct 5 ms 376 KB Output is correct
67 Correct 5 ms 376 KB Output is correct
68 Correct 5 ms 252 KB Output is correct
69 Correct 5 ms 504 KB Output is correct
70 Correct 5 ms 252 KB Output is correct
71 Correct 5 ms 248 KB Output is correct
72 Correct 5 ms 248 KB Output is correct