oj.uz

Submission #200053

# Submission time Handle Problem Language Result Execution time Memory
200053 2020-02-05T06:42:52 Z EntityIT Meetings (JOI19_meetings) C++14
29 / 100
 2000 ms 1272 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) 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 248 KB Output is correct
3 Correct 5 ms 248 KB Output is correct
4 Correct 6 ms 380 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 248 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 376 KB Output is correct
11 Correct 5 ms 248 KB Output is correct
12 Correct 5 ms 424 KB Output is correct
13 Correct 6 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 248 KB Output is correct
3 Correct 5 ms 248 KB Output is correct
4 Correct 6 ms 380 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 248 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 376 KB Output is correct
11 Correct 5 ms 248 KB Output is correct
12 Correct 5 ms 424 KB Output is correct
13 Correct 6 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 6 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 6 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 248 KB Output is correct
3 Correct 5 ms 248 KB Output is correct
4 Correct 6 ms 380 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 248 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 376 KB Output is correct
11 Correct 5 ms 248 KB Output is correct
12 Correct 5 ms 424 KB Output is correct
13 Correct 6 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 6 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 6 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 380 KB Output is correct
28 Correct 10 ms 376 KB Output is correct
29 Correct 11 ms 376 KB Output is correct
30 Correct 10 ms 376 KB Output is correct
31 Correct 10 ms 376 KB Output is correct
32 Correct 13 ms 376 KB Output is correct
33 Correct 18 ms 376 KB Output is correct
34 Correct 21 ms 508 KB Output is correct
35 Correct 20 ms 504 KB Output is correct
36 Correct 9 ms 376 KB Output is correct
37 Correct 13 ms 376 KB Output is correct
38 Correct 15 ms 376 KB Output is correct
39 Correct 164 ms 832 KB Output is correct

Subtask #4
0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 476 ms 880 KB Output is correct
2 Correct 548 ms 1016 KB Output is correct
3 Correct 624 ms 888 KB Output is correct
4 Correct 591 ms 632 KB Output is correct
5 Correct 386 ms 632 KB Output is correct
6 Correct 401 ms 632 KB Output is correct
7 Correct 702 ms 888 KB Output is correct
8 Correct 783 ms 760 KB Output is correct
9 Correct 786 ms 800 KB Output is correct
10 Correct 699 ms 760 KB Output is correct
11 Correct 821 ms 888 KB Output is correct
12 Correct 437 ms 760 KB Output is correct
13 Correct 289 ms 888 KB Output is correct
14 Correct 512 ms 632 KB Output is correct
15 Correct 450 ms 632 KB Output is correct
16 Correct 529 ms 888 KB Output is correct
17 Correct 863 ms 768 KB Output is correct
18 Execution timed out 2432 ms 1272 KB Time limit exceeded
19 Halted 0 ms 0 KB -