oj.uz

Submission #200055

# Submission time Handle Problem Language Result Execution time Memory
200055 2020-02-05T06:50:50 Z EntityIT Meetings (JOI19_meetings) C++14
29 / 100
 2000 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) ); }

void solve(const vector<int> &vSet) {
  if (sz(vSet) == 1) return ;

  int l = vSet[0], r = vSet[1];

  vector<int> path;
  map<int, vector<int> > nVSet;
  for (int i = 2; i < sz(vSet); ++i) {
    int u = vSet[i];

    int pr = Query(l, r, u);
    if (pr == u) {
      if (u != l && u != r) path.emplace_back(u);
    }
    else nVSet[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);

  for (auto &aVSet : nVSet) {
    aVSet.second.insert(aVSet.second.begin(), aVSet.first);
    solve(aVSet.second);
  }
}

void Solve(int N) {
  vector<int> vSet(N); iota(all(vSet), 0);
  solve(vSet);
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 248 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 248 KB Output is correct
7 Correct 5 ms 248 KB Output is correct
8 Correct 5 ms 248 KB Output is correct
9 Correct 5 ms 248 KB Output is correct
10 Correct 5 ms 248 KB Output is correct
11 Correct 5 ms 248 KB Output is correct
12 Correct 5 ms 332 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 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 248 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 248 KB Output is correct
7 Correct 5 ms 248 KB Output is correct
8 Correct 5 ms 248 KB Output is correct
9 Correct 5 ms 248 KB Output is correct
10 Correct 5 ms 248 KB Output is correct
11 Correct 5 ms 248 KB Output is correct
12 Correct 5 ms 332 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 256 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 6 ms 376 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 248 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 248 KB Output is correct
7 Correct 5 ms 248 KB Output is correct
8 Correct 5 ms 248 KB Output is correct
9 Correct 5 ms 248 KB Output is correct
10 Correct 5 ms 248 KB Output is correct
11 Correct 5 ms 248 KB Output is correct
12 Correct 5 ms 332 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 256 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 6 ms 376 KB Output is correct
27 Correct 10 ms 376 KB Output is correct
28 Correct 11 ms 376 KB Output is correct
29 Correct 11 ms 376 KB Output is correct
30 Correct 9 ms 376 KB Output is correct
31 Correct 9 ms 428 KB Output is correct
32 Correct 13 ms 376 KB Output is correct
33 Correct 18 ms 376 KB Output is correct
34 Correct 22 ms 492 KB Output is correct
35 Correct 20 ms 536 KB Output is correct
36 Correct 10 ms 376 KB Output is correct
37 Correct 13 ms 504 KB Output is correct
38 Correct 15 ms 504 KB Output is correct
39 Correct 159 ms 684 KB Output is correct

Subtask #4
0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 461 ms 700 KB Output is correct
2 Correct 538 ms 816 KB Output is correct
3 Correct 634 ms 944 KB Output is correct
4 Correct 568 ms 632 KB Output is correct
5 Correct 374 ms 720 KB Output is correct
6 Correct 386 ms 632 KB Output is correct
7 Correct 688 ms 640 KB Output is correct
8 Correct 781 ms 632 KB Output is correct
9 Correct 750 ms 764 KB Output is correct
10 Correct 689 ms 812 KB Output is correct
11 Correct 784 ms 760 KB Output is correct
12 Correct 424 ms 712 KB Output is correct
13 Correct 277 ms 760 KB Output is correct
14 Correct 532 ms 760 KB Output is correct
15 Correct 432 ms 632 KB Output is correct
16 Correct 537 ms 764 KB Output is correct
17 Correct 815 ms 888 KB Output is correct
18 Execution timed out 2323 ms 1144 KB Time limit exceeded
19 Halted 0 ms 0 KB -