oj.uz

Submission #561932

# Submission time Handle Problem Language Result Execution time Memory
561932 2022-05-13T18:58:37 Z timreizin Meetings (JOI19_meetings) C++17
100 / 100
 722 ms 848 KB 
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")

#include "meetings.h"
#include <random>
#include <vector>
#include <set>
#include <numeric>
#include <algorithm>
#include <map>

using namespace std;

vector<vector<int>> adj;
mt19937 gen(989324);

void find(vector<int> &vertices)
{
    if (vertices.size() == 1) return;
    if (vertices.size() == 2)
    {
        adj[vertices.front()].push_back(vertices.back());
        adj[vertices.back()].push_back(vertices.front());
        return;
    }
    vector<int> path;
    map<int, vector<int>> comps;
    int x = uniform_int_distribution<>(0, (int)vertices.size() - 1)(gen);
    int y = x;
    while (y == x) y = uniform_int_distribution<>(0, (int)vertices.size() - 1)(gen);
    x = vertices[x];
    y = vertices[y];
    path.push_back(x);
    for (int i = 0; i < vertices.size(); ++i)
    {
        if (x == vertices[i] || y == vertices[i]) continue;
        int r = Query(x, y, vertices[i]);
        if (r != vertices[i]) comps[r].push_back(vertices[i]);
        else path.push_back(r);
    }
    for (auto &[pivot, vertices] : comps)
    {
        vertices.push_back(pivot);
        find(vertices);
    }
    sort(path.begin() + 1, path.end(), [&x](int a, int b) { return Query(x, a, b) == a; });
    path.push_back(y);
    for (int i = 0; i + 1 < path.size(); ++i)
    {
        adj[path[i]].push_back(path[i + 1]);
        adj[path[i + 1]].push_back(path[i]);
    }
}

void Solve(int n)
{
    adj.resize(n);
    set<int> path;
    vector<int> vertices(n);
    iota(vertices.begin(), vertices.end(), 0);
    find(vertices);
    for (int i = 0; i < n; ++i) for (int u : adj[i]) if (i < u) Bridge(i, u);
}

Compilation message

meetings.cpp: In function 'void find(std::vector<int>&)':
meetings.cpp:34:23: 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 = 0; i < vertices.size(); ++i)
      |                     ~~^~~~~~~~~~~~~~~~~
meetings.cpp:48:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |     for (int i = 0; i + 1 < path.size(); ++i)
      |                     ~~~~~~^~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 208 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 0 ms 336 KB Output is correct
7 Correct 0 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 0 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 0 ms 336 KB Output is correct
12 Correct 0 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 1 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 208 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 0 ms 336 KB Output is correct
7 Correct 0 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 0 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 0 ms 336 KB Output is correct
12 Correct 0 ms 336 KB Output is correct
13 Correct 0 ms 336 KB Output is correct
14 Correct 0 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 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 0 ms 336 KB Output is correct
20 Correct 0 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 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 1 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 208 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 0 ms 336 KB Output is correct
7 Correct 0 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 0 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 0 ms 336 KB Output is correct
12 Correct 0 ms 336 KB Output is correct
13 Correct 0 ms 336 KB Output is correct
14 Correct 0 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 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 0 ms 336 KB Output is correct
20 Correct 0 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 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 7 ms 336 KB Output is correct
28 Correct 3 ms 336 KB Output is correct
29 Correct 5 ms 336 KB Output is correct
30 Correct 8 ms 336 KB Output is correct
31 Correct 6 ms 336 KB Output is correct
32 Correct 5 ms 336 KB Output is correct
33 Correct 6 ms 336 KB Output is correct
34 Correct 7 ms 376 KB Output is correct
35 Correct 8 ms 392 KB Output is correct
36 Correct 4 ms 336 KB Output is correct
37 Correct 8 ms 388 KB Output is correct
38 Correct 7 ms 336 KB Output is correct
39 Correct 6 ms 392 KB Output is correct

Subtask #4
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 416 ms 580 KB Output is correct
2 Correct 435 ms 608 KB Output is correct
3 Correct 394 ms 672 KB Output is correct
4 Correct 483 ms 700 KB Output is correct
5 Correct 256 ms 600 KB Output is correct
6 Correct 282 ms 720 KB Output is correct
7 Correct 363 ms 688 KB Output is correct
8 Correct 357 ms 676 KB Output is correct
9 Correct 327 ms 680 KB Output is correct
10 Correct 310 ms 704 KB Output is correct
11 Correct 381 ms 644 KB Output is correct
12 Correct 288 ms 756 KB Output is correct
13 Correct 227 ms 712 KB Output is correct
14 Correct 325 ms 692 KB Output is correct
15 Correct 275 ms 640 KB Output is correct
16 Correct 242 ms 732 KB Output is correct
17 Correct 394 ms 652 KB Output is correct
18 Correct 272 ms 692 KB Output is correct
19 Correct 279 ms 624 KB Output is correct
20 Correct 259 ms 700 KB Output is correct
21 Correct 425 ms 704 KB Output is correct
22 Correct 280 ms 688 KB Output is correct
23 Correct 287 ms 712 KB Output is correct
24 Correct 327 ms 648 KB Output is correct
25 Correct 345 ms 708 KB Output is correct
26 Correct 320 ms 700 KB Output is correct
27 Correct 319 ms 652 KB Output is correct
28 Correct 482 ms 704 KB Output is correct
29 Correct 301 ms 640 KB Output is correct
30 Correct 366 ms 828 KB Output is correct
31 Correct 366 ms 692 KB Output is correct
32 Correct 722 ms 808 KB Output is correct
33 Correct 423 ms 848 KB Output is correct
34 Correct 4 ms 336 KB Output is correct
35 Correct 3 ms 336 KB Output is correct
36 Correct 6 ms 336 KB Output is correct
37 Correct 4 ms 336 KB Output is correct
38 Correct 3 ms 336 KB Output is correct
39 Correct 5 ms 336 KB Output is correct
40 Correct 6 ms 372 KB Output is correct
41 Correct 8 ms 384 KB Output is correct
42 Correct 7 ms 380 KB Output is correct
43 Correct 4 ms 372 KB Output is correct
44 Correct 7 ms 336 KB Output is correct
45 Correct 6 ms 336 KB Output is correct
46 Correct 6 ms 336 KB Output is correct
47 Correct 0 ms 336 KB Output is correct
48 Correct 0 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 1 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 1 ms 336 KB Output is correct
57 Correct 0 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 0 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 0 ms 336 KB Output is correct
65 Correct 0 ms 336 KB Output is correct
66 Correct 0 ms 336 KB Output is correct
67 Correct 0 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