oj.uz

Submission #561930

# Submission time Handle Problem Language Result Execution time Memory
561930 2022-05-13T18:57:43 Z timreizin Meetings (JOI19_meetings) C++17
100 / 100
 699 ms 840 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(123);

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 0 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 0 ms 336 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 0 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 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 0 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 0 ms 336 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 0 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 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 0 ms 336 KB Output is correct
17 Correct 0 ms 336 KB Output is correct
18 Correct 0 ms 336 KB Output is correct
19 Correct 0 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 0 ms 336 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 0 ms 336 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 0 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 1 ms 336 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 0 ms 336 KB Output is correct
6 Correct 0 ms 208 KB Output is correct
7 Correct 0 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 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 0 ms 336 KB Output is correct
17 Correct 0 ms 336 KB Output is correct
18 Correct 0 ms 336 KB Output is correct
19 Correct 0 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 0 ms 336 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 0 ms 336 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 0 ms 336 KB Output is correct
27 Correct 4 ms 336 KB Output is correct
28 Correct 6 ms 376 KB Output is correct
29 Correct 4 ms 336 KB Output is correct
30 Correct 5 ms 336 KB Output is correct
31 Correct 3 ms 336 KB Output is correct
32 Correct 4 ms 384 KB Output is correct
33 Correct 9 ms 384 KB Output is correct
34 Correct 13 ms 336 KB Output is correct
35 Correct 6 ms 380 KB Output is correct
36 Correct 4 ms 336 KB Output is correct
37 Correct 9 ms 336 KB Output is correct
38 Correct 6 ms 396 KB Output is correct
39 Correct 6 ms 336 KB Output is correct

Subtask #4
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 365 ms 616 KB Output is correct
2 Correct 450 ms 620 KB Output is correct
3 Correct 499 ms 692 KB Output is correct
4 Correct 344 ms 676 KB Output is correct
5 Correct 245 ms 584 KB Output is correct
6 Correct 298 ms 688 KB Output is correct
7 Correct 335 ms 840 KB Output is correct
8 Correct 368 ms 616 KB Output is correct
9 Correct 332 ms 696 KB Output is correct
10 Correct 331 ms 696 KB Output is correct
11 Correct 384 ms 636 KB Output is correct
12 Correct 382 ms 716 KB Output is correct
13 Correct 210 ms 712 KB Output is correct
14 Correct 267 ms 624 KB Output is correct
15 Correct 206 ms 732 KB Output is correct
16 Correct 216 ms 688 KB Output is correct
17 Correct 362 ms 696 KB Output is correct
18 Correct 286 ms 712 KB Output is correct
19 Correct 284 ms 600 KB Output is correct
20 Correct 306 ms 712 KB Output is correct
21 Correct 392 ms 640 KB Output is correct
22 Correct 345 ms 636 KB Output is correct
23 Correct 263 ms 700 KB Output is correct
24 Correct 308 ms 624 KB Output is correct
25 Correct 380 ms 736 KB Output is correct
26 Correct 368 ms 744 KB Output is correct
27 Correct 377 ms 828 KB Output is correct
28 Correct 424 ms 696 KB Output is correct
29 Correct 315 ms 652 KB Output is correct
30 Correct 305 ms 704 KB Output is correct
31 Correct 341 ms 716 KB Output is correct
32 Correct 699 ms 796 KB Output is correct
33 Correct 403 ms 812 KB Output is correct
34 Correct 4 ms 336 KB Output is correct
35 Correct 4 ms 372 KB Output is correct
36 Correct 4 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 4 ms 336 KB Output is correct
40 Correct 7 ms 464 KB Output is correct
41 Correct 6 ms 336 KB Output is correct
42 Correct 7 ms 384 KB Output is correct
43 Correct 4 ms 336 KB Output is correct
44 Correct 8 ms 336 KB Output is correct
45 Correct 5 ms 336 KB Output is correct
46 Correct 5 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 0 ms 336 KB Output is correct
51 Correct 1 ms 336 KB Output is correct
52 Correct 0 ms 336 KB Output is correct
53 Correct 0 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 0 ms 336 KB Output is correct
58 Correct 1 ms 336 KB Output is correct
59 Correct 0 ms 336 KB Output is correct
60 Correct 1 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 1 ms 336 KB Output is correct
71 Correct 0 ms 336 KB Output is correct
72 Correct 0 ms 336 KB Output is correct