oj.uz

Submission #482030

# Submission time Handle Problem Language Result Execution time Memory
482030 2021-10-22T16:54:24 Z Lam_lai_cuoc_doi Meetings (JOI19_meetings) C++17
100 / 100
 971 ms 16668 KB 
#include <bits/stdc++.h>
#include "meetings.h"

using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;

template <class T>
void read(T &x)
{
    x = 0;
    register int c;
    while ((c = getchar()) && (c > '9' || c < '0'))
        ;
    for (; c >= '0' && c <= '9'; c = getchar())
        x = x * 10 + c - '0';
}

constexpr bool typetest = 0;
constexpr int N = 2e3 + 5;

//Ảo thật đấy
int lcam[N][N];

int LCA(int u, int v)
{
    if (u == v)
        return u;

    if (u == 0 || v == 0)
        return 0;

    if (lcam[u][v] != -1)
        return lcam[u][v];

    return (lcam[u][v] = lcam[v][u] = Query(0, u, v));
}

void Recursive(int root, vector<int> &s)
{
    if (s.size() == 1)
        return;
    if (s.size() == 2)
    {
        Bridge(min(s[0], s[1]), max(s[0], s[1]));
        return;
    }

    map<int, vector<int>> subtree;

    int u;
    do
    {
        u = s[rand() % s.size()];
    } while (u == root);

    vector<int> chain;

    for (auto i : s)
    {
        int lca = LCA(i, u);

        if (lca == i)
            chain.emplace_back(i);

        subtree[lca].emplace_back(i);
    }

    sort(chain.begin(), chain.end(), [&](const int &x, const int &y)
         { return LCA(x, y) == x; });

    for (int i = 0; i < (int)chain.size() - 1; ++i)
        Bridge(min(chain[i], chain[i + 1]), max(chain[i], chain[i + 1]));

    for (auto i : subtree)
        Recursive(i.first, i.second);
}

void Solve(int n)
{
    memset(lcam, -1, sizeof lcam);
    vector<int> s;
    for (int i = 0; i < n; ++i)
        s.emplace_back(i);
    random_shuffle(s.begin(), s.end());
    Recursive(0, s);
}

/*
void Read()
{
}

void Solve()
{
}

int32_t main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    if (fopen("xor.INP", "r"))
    {
        freopen("xor.inp", "r", stdin);
        freopen("xor.out", "w", stdout);
    }
    int t(1);
    if (typetest)
        cin >> t;
    for (int _ = 1; _ <= t; ++_)
    {
        // cout << "Case #" << _ << ": ";
        Read();
        Solve();
    }
    // cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
}

*/

Compilation message

meetings.cpp: In function 'void read(T&)':
meetings.cpp:13:18: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister]
   13 |     register int c;
      |                  ^

Subtask #1
7.0 / 7.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 16072 KB Output is correct
2 Correct 6 ms 16072 KB Output is correct
3 Correct 7 ms 16072 KB Output is correct
4 Correct 6 ms 16072 KB Output is correct
5 Correct 6 ms 16060 KB Output is correct
6 Correct 6 ms 16008 KB Output is correct
7 Correct 6 ms 16072 KB Output is correct
8 Correct 6 ms 16072 KB Output is correct
9 Correct 6 ms 16072 KB Output is correct
10 Correct 6 ms 16072 KB Output is correct
11 Correct 6 ms 16072 KB Output is correct
12 Correct 6 ms 16072 KB Output is correct
13 Correct 7 ms 16072 KB Output is correct
14 Correct 7 ms 16072 KB Output is correct
15 Correct 6 ms 16072 KB Output is correct
16 Correct 6 ms 16072 KB Output is correct
17 Correct 7 ms 16048 KB Output is correct
18 Correct 6 ms 16072 KB Output is correct
19 Correct 7 ms 16072 KB Output is correct
20 Correct 6 ms 16072 KB Output is correct
21 Correct 7 ms 16072 KB Output is correct
22 Correct 6 ms 16072 KB Output is correct
23 Correct 6 ms 16072 KB Output is correct
24 Correct 7 ms 16072 KB Output is correct
25 Correct 7 ms 16076 KB Output is correct
26 Correct 7 ms 16040 KB Output is correct
27 Correct 10 ms 16072 KB Output is correct
28 Correct 10 ms 16072 KB Output is correct
29 Correct 10 ms 16072 KB Output is correct
30 Correct 12 ms 16232 KB Output is correct
31 Correct 11 ms 16072 KB Output is correct
32 Correct 13 ms 16072 KB Output is correct
33 Correct 19 ms 16140 KB Output is correct
34 Correct 18 ms 16104 KB Output is correct
35 Correct 18 ms 16072 KB Output is correct
36 Correct 10 ms 16072 KB Output is correct
37 Correct 16 ms 16148 KB Output is correct
38 Correct 15 ms 16152 KB Output is correct
39 Correct 16 ms 16140 KB Output is correct

Subtask #4
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 461 ms 16296 KB Output is correct
2 Correct 473 ms 16516 KB Output is correct
3 Correct 461 ms 16320 KB Output is correct
4 Correct 433 ms 16380 KB Output is correct
5 Correct 351 ms 16324 KB Output is correct
6 Correct 328 ms 16280 KB Output is correct
7 Correct 522 ms 16380 KB Output is correct
8 Correct 686 ms 16668 KB Output is correct
9 Correct 615 ms 16648 KB Output is correct
10 Correct 617 ms 16320 KB Output is correct
11 Correct 622 ms 16368 KB Output is correct
12 Correct 409 ms 16448 KB Output is correct
13 Correct 259 ms 16452 KB Output is correct
14 Correct 410 ms 16392 KB Output is correct
15 Correct 443 ms 16260 KB Output is correct
16 Correct 437 ms 16432 KB Output is correct
17 Correct 639 ms 16524 KB Output is correct
18 Correct 346 ms 16320 KB Output is correct
19 Correct 344 ms 16272 KB Output is correct
20 Correct 456 ms 16364 KB Output is correct
21 Correct 477 ms 16448 KB Output is correct
22 Correct 480 ms 16324 KB Output is correct
23 Correct 507 ms 16320 KB Output is correct
24 Correct 460 ms 16268 KB Output is correct
25 Correct 431 ms 16388 KB Output is correct
26 Correct 445 ms 16276 KB Output is correct
27 Correct 427 ms 16364 KB Output is correct
28 Correct 710 ms 16448 KB Output is correct
29 Correct 598 ms 16320 KB Output is correct
30 Correct 615 ms 16380 KB Output is correct
31 Correct 634 ms 16468 KB Output is correct
32 Correct 971 ms 16520 KB Output is correct
33 Correct 855 ms 16572 KB Output is correct
34 Correct 11 ms 16120 KB Output is correct
35 Correct 10 ms 16116 KB Output is correct
36 Correct 9 ms 16072 KB Output is correct
37 Correct 11 ms 16072 KB Output is correct
38 Correct 10 ms 16072 KB Output is correct
39 Correct 13 ms 16072 KB Output is correct
40 Correct 17 ms 16124 KB Output is correct
41 Correct 20 ms 16072 KB Output is correct
42 Correct 20 ms 16124 KB Output is correct
43 Correct 10 ms 16072 KB Output is correct
44 Correct 15 ms 16200 KB Output is correct
45 Correct 15 ms 16116 KB Output is correct
46 Correct 15 ms 16136 KB Output is correct
47 Correct 6 ms 16072 KB Output is correct
48 Correct 6 ms 16072 KB Output is correct
49 Correct 7 ms 16072 KB Output is correct
50 Correct 6 ms 16072 KB Output is correct
51 Correct 6 ms 16072 KB Output is correct
52 Correct 6 ms 16072 KB Output is correct
53 Correct 6 ms 16072 KB Output is correct
54 Correct 6 ms 16072 KB Output is correct
55 Correct 7 ms 16072 KB Output is correct
56 Correct 7 ms 16072 KB Output is correct
57 Correct 6 ms 16072 KB Output is correct
58 Correct 6 ms 16072 KB Output is correct
59 Correct 6 ms 16072 KB Output is correct
60 Correct 7 ms 15976 KB Output is correct
61 Correct 6 ms 16056 KB Output is correct
62 Correct 6 ms 16072 KB Output is correct
63 Correct 6 ms 16072 KB Output is correct
64 Correct 7 ms 16064 KB Output is correct
65 Correct 6 ms 16072 KB Output is correct
66 Correct 6 ms 16072 KB Output is correct
67 Correct 6 ms 15968 KB Output is correct
68 Correct 6 ms 16036 KB Output is correct
69 Correct 6 ms 16072 KB Output is correct
70 Correct 6 ms 16072 KB Output is correct
71 Correct 6 ms 16072 KB Output is correct
72 Correct 6 ms 16072 KB Output is correct