oj.uz

Submission #561920

# Submission time Handle Problem Language Result Execution time Memory
561920 2022-05-13T18:43:51 Z timreizin Meetings (JOI19_meetings) C++17
100 / 100
 644 ms 908 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>
#include <cassert>

using namespace std;

vector<vector<int>> adj;
mt19937 gen(555);
int q = 0;

int find(vector<int> vertices, int pivot, set<int> path)
{
    if (vertices.size() == 1) return vertices.front();
    if (vertices.size() == 2)
    {
        adj[vertices.front()].push_back(vertices.back());
        adj[vertices.back()].push_back(vertices.front());
    }
    else
    {
        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];
        for (int i = 0; i < vertices.size(); ++i)
        {
            if (x == vertices[i] || y == vertices[i]) continue;
            int r = Query(x, y, vertices[i]);
            ++q;
            if (r != vertices[i]) comps[r].push_back(vertices[i]);
            else path.push_back(r);
        }
        for (auto &[pivot, vertices]: comps)
        {
            /*vector<bool> used(vertices.size());
            int left = vertices.size();
            while (left)
            {
                int p = uniform_int_distribution<>(1, left)(gen);
                for (int i = 0; i < vertices.size(); ++i)
                {
                    p -= !used[i];
                    if (!p)
                    {
                        --left;
                        used[i] = true;
                        p = vertices[i];
                        break;
                    }
                }
                vector<int> next{p};
                set<int> path;
                for (int i = 0; i < vertices.size(); ++i)
                {
                    if (!used[i])
                    {
                        int r = Query(vertices[i], p, pivot);
                        ++q;
                        if (r != pivot)
                        {
                            used[i] = true;
                            --left;
                            next.push_back(vertices[i]);
                            if (r == vertices[i]) path.insert(r);
                        }
                    }
                }
                int e = find(next, p, path);
                adj[pivot].push_back(e);
                adj[e].push_back(pivot);
            }*/
            vertices.push_back(pivot);
            find(vertices, pivot, set<int>());
        }
        sort(path.begin(), path.end(), [&x](int a, int b) { return Query(x, a, b) == a; });
        if (!path.empty())
        {
            adj[x].push_back(path.front());
            adj[path.front()].push_back(x);
            adj[y].push_back(path.back());
            adj[path.back()].push_back(y);
        }
        else
        {
            adj[x].push_back(y);
            adj[y].push_back(x);
        }
        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]);
        }
    }
    int v = pivot;
    while (!path.empty())
    {
        for (int u : adj[v])
        {
            if (path.find(u) != path.end())
            {
                path.erase(u);
                v = u;
            }
        }
    }
    return v;
}

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

Compilation message

meetings.cpp: In function 'int find(std::vector<int>, int, std::set<int>)':
meetings.cpp:36:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   36 |         for (int i = 0; i < vertices.size(); ++i)
      |                         ~~^~~~~~~~~~~~~~~~~
meetings.cpp:99:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   99 |         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 208 KB Output is correct
2 Correct 1 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 1 ms 336 KB Output is correct
9 Correct 0 ms 276 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 0 ms 208 KB Output is correct
2 Correct 1 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 1 ms 336 KB Output is correct
9 Correct 0 ms 276 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 0 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 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 1 ms 336 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 0 ms 336 KB Output is correct
26 Correct 2 ms 336 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 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 1 ms 336 KB Output is correct
9 Correct 0 ms 276 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 0 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 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 1 ms 336 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 0 ms 336 KB Output is correct
26 Correct 2 ms 336 KB Output is correct
27 Correct 8 ms 384 KB Output is correct
28 Correct 3 ms 336 KB Output is correct
29 Correct 6 ms 380 KB Output is correct
30 Correct 8 ms 396 KB Output is correct
31 Correct 6 ms 336 KB Output is correct
32 Correct 6 ms 336 KB Output is correct
33 Correct 7 ms 336 KB Output is correct
34 Correct 9 ms 508 KB Output is correct
35 Correct 9 ms 380 KB Output is correct
36 Correct 5 ms 336 KB Output is correct
37 Correct 8 ms 400 KB Output is correct
38 Correct 13 ms 332 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 301 ms 688 KB Output is correct
2 Correct 424 ms 612 KB Output is correct
3 Correct 416 ms 600 KB Output is correct
4 Correct 378 ms 640 KB Output is correct
5 Correct 378 ms 688 KB Output is correct
6 Correct 233 ms 688 KB Output is correct
7 Correct 464 ms 676 KB Output is correct
8 Correct 389 ms 652 KB Output is correct
9 Correct 357 ms 700 KB Output is correct
10 Correct 354 ms 712 KB Output is correct
11 Correct 383 ms 732 KB Output is correct
12 Correct 429 ms 728 KB Output is correct
13 Correct 281 ms 780 KB Output is correct
14 Correct 285 ms 752 KB Output is correct
15 Correct 218 ms 700 KB Output is correct
16 Correct 294 ms 696 KB Output is correct
17 Correct 371 ms 720 KB Output is correct
18 Correct 233 ms 620 KB Output is correct
19 Correct 282 ms 704 KB Output is correct
20 Correct 351 ms 700 KB Output is correct
21 Correct 364 ms 660 KB Output is correct
22 Correct 430 ms 908 KB Output is correct
23 Correct 386 ms 692 KB Output is correct
24 Correct 309 ms 696 KB Output is correct
25 Correct 311 ms 704 KB Output is correct
26 Correct 307 ms 684 KB Output is correct
27 Correct 332 ms 728 KB Output is correct
28 Correct 422 ms 672 KB Output is correct
29 Correct 311 ms 844 KB Output is correct
30 Correct 316 ms 708 KB Output is correct
31 Correct 393 ms 740 KB Output is correct
32 Correct 644 ms 716 KB Output is correct
33 Correct 502 ms 772 KB Output is correct
34 Correct 5 ms 336 KB Output is correct
35 Correct 3 ms 336 KB Output is correct
36 Correct 4 ms 388 KB Output is correct
37 Correct 5 ms 464 KB Output is correct
38 Correct 5 ms 336 KB Output is correct
39 Correct 5 ms 336 KB Output is correct
40 Correct 10 ms 336 KB Output is correct
41 Correct 11 ms 388 KB Output is correct
42 Correct 8 ms 336 KB Output is correct
43 Correct 3 ms 336 KB Output is correct
44 Correct 10 ms 336 KB Output is correct
45 Correct 13 ms 396 KB Output is correct
46 Correct 5 ms 396 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 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 0 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