oj.uz

Submission #703699

# Submission time Handle Problem Language Result Execution time Memory
703699 2023-02-28T06:50:25 Z LittleCube Meetings (JOI19_meetings) C++14
100 / 100
 694 ms 900 KB 
#include "meetings.h"
#include <bits/stdc++.h>
#define pii pair<int, int>
#define F first
#define S second
using namespace std;

mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());

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

void solve(vector<int> v)
{
  if (v.size() == 1)
    return;
  if (v.size() == 2)
  {
    bridge(v[0], v[1]);
    return;
  }

  shuffle(v.begin(), v.end(), rd);

  // cerr << "solve " << v[0] << ' ' << v[1] << '\n';
  // for(auto i : v)
  //   cout << i << ' ';
  // cout << '\n';

  vector<pii> res = {pii(v[0], v[0]), pii(v[1], v[1])};
  vector<int> line;
  for (int i = 2; i < v.size(); i++)
  {
    res.emplace_back(pii(Query(v[0], v[1], v[i]), v[i]));
    if (res.back().F == res.back().S)
      line.emplace_back(v[i]);
  }
  sort(res.begin(), res.end());
  int last = res.front().F;
  vector<int> child;
  for (auto [i, j] : res)
  {
    if (i != last)
    {
      solve(child);
      child.clear();
      last = i;
    }
    child.emplace_back(j);
  }
  solve(child);
  sort(line.begin(), line.end(), [&](int i, int j)
       { if(i == j) return false;
        return Query(v[0], i, j) == i; });

  line.insert(line.begin(), v[0]);
  line.emplace_back(v[1]);
  for (int i = 1; i < line.size(); i++)
    bridge(line[i], line[i - 1]);
}

void Solve(int N)
{
  vector<int> node;
  for (int i = 0; i < N; i++)
    node.emplace_back(i);
  solve(node);
}

Compilation message

meetings.cpp: In function 'void solve(std::vector<int>)':
meetings.cpp:34:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   34 |   for (int i = 2; i < v.size(); i++)
      |                   ~~^~~~~~~~~~
meetings.cpp:43:13: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   43 |   for (auto [i, j] : res)
      |             ^
meetings.cpp:60:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   60 |   for (int i = 1; i < line.size(); i++)
      |                   ~~^~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 0 ms 336 KB Output is correct
5 Correct 0 ms 336 KB Output is correct
6 Correct 0 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 0 ms 336 KB Output is correct
9 Correct 0 ms 336 KB Output is correct
10 Correct 0 ms 336 KB Output is correct
11 Correct 0 ms 464 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 0 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 0 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 0 ms 336 KB Output is correct
23 Correct 0 ms 336 KB Output is correct
24 Correct 0 ms 336 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 336 KB Output is correct
27 Correct 4 ms 396 KB Output is correct
28 Correct 4 ms 400 KB Output is correct
29 Correct 4 ms 336 KB Output is correct
30 Correct 3 ms 336 KB Output is correct
31 Correct 3 ms 336 KB Output is correct
32 Correct 4 ms 392 KB Output is correct
33 Correct 7 ms 396 KB Output is correct
34 Correct 7 ms 404 KB Output is correct
35 Correct 7 ms 336 KB Output is correct
36 Correct 4 ms 336 KB Output is correct
37 Correct 7 ms 388 KB Output is correct
38 Correct 7 ms 336 KB Output is correct
39 Correct 11 ms 336 KB Output is correct

Subtask #4
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 286 ms 596 KB Output is correct
2 Correct 343 ms 652 KB Output is correct
3 Correct 425 ms 700 KB Output is correct
4 Correct 289 ms 540 KB Output is correct
5 Correct 213 ms 852 KB Output is correct
6 Correct 242 ms 528 KB Output is correct
7 Correct 347 ms 696 KB Output is correct
8 Correct 375 ms 824 KB Output is correct
9 Correct 343 ms 700 KB Output is correct
10 Correct 298 ms 684 KB Output is correct
11 Correct 327 ms 688 KB Output is correct
12 Correct 316 ms 736 KB Output is correct
13 Correct 213 ms 712 KB Output is correct
14 Correct 299 ms 720 KB Output is correct
15 Correct 249 ms 748 KB Output is correct
16 Correct 264 ms 668 KB Output is correct
17 Correct 358 ms 816 KB Output is correct
18 Correct 274 ms 688 KB Output is correct
19 Correct 242 ms 644 KB Output is correct
20 Correct 316 ms 668 KB Output is correct
21 Correct 293 ms 644 KB Output is correct
22 Correct 332 ms 868 KB Output is correct
23 Correct 264 ms 644 KB Output is correct
24 Correct 235 ms 632 KB Output is correct
25 Correct 393 ms 744 KB Output is correct
26 Correct 256 ms 560 KB Output is correct
27 Correct 404 ms 692 KB Output is correct
28 Correct 419 ms 816 KB Output is correct
29 Correct 292 ms 680 KB Output is correct
30 Correct 317 ms 712 KB Output is correct
31 Correct 372 ms 900 KB Output is correct
32 Correct 694 ms 776 KB Output is correct
33 Correct 542 ms 748 KB Output is correct
34 Correct 5 ms 336 KB Output is correct
35 Correct 5 ms 336 KB Output is correct
36 Correct 5 ms 336 KB Output is correct
37 Correct 5 ms 336 KB Output is correct
38 Correct 3 ms 336 KB Output is correct
39 Correct 5 ms 400 KB Output is correct
40 Correct 6 ms 336 KB Output is correct
41 Correct 7 ms 336 KB Output is correct
42 Correct 8 ms 336 KB Output is correct
43 Correct 4 ms 336 KB Output is correct
44 Correct 8 ms 336 KB Output is correct
45 Correct 11 ms 404 KB Output is correct
46 Correct 10 ms 416 KB Output is correct
47 Correct 1 ms 336 KB Output is correct
48 Correct 1 ms 336 KB Output is correct
49 Correct 0 ms 336 KB Output is correct
50 Correct 1 ms 336 KB Output is correct
51 Correct 0 ms 336 KB Output is correct
52 Correct 1 ms 336 KB Output is correct
53 Correct 1 ms 336 KB Output is correct
54 Correct 1 ms 336 KB Output is correct
55 Correct 1 ms 336 KB Output is correct
56 Correct 0 ms 336 KB Output is correct
57 Correct 1 ms 336 KB Output is correct
58 Correct 1 ms 336 KB Output is correct
59 Correct 1 ms 336 KB Output is correct
60 Correct 0 ms 336 KB Output is correct
61 Correct 1 ms 336 KB Output is correct
62 Correct 0 ms 336 KB Output is correct
63 Correct 0 ms 336 KB Output is correct
64 Correct 1 ms 336 KB Output is correct
65 Correct 1 ms 336 KB Output is correct
66 Correct 0 ms 336 KB Output is correct
67 Correct 1 ms 336 KB Output is correct
68 Correct 0 ms 336 KB Output is correct
69 Correct 0 ms 336 KB Output is correct
70 Correct 0 ms 336 KB Output is correct
71 Correct 0 ms 336 KB Output is correct
72 Correct 0 ms 336 KB Output is correct