oj.uz

Submission #471696

# Submission time Handle Problem Language Result Execution time Memory
471696 2021-09-10T10:08:49 Z Rainbowbunny Meetings (JOI19_meetings) C++17
100 / 100
 853 ms 1084 KB 
#include "meetings.h"
#include <bits/stdc++.h>
using namespace std;

static int tmp;

const int MAXN = 2005;

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

int random(int l, int r)
{
    return rng() % (r - l + 1) + l;
}

vector <int> Com[MAXN];

void DFS(vector <int> V)
{
    if((int)V.size() < 2)
    {
        return;
    }
    if((int)V.size() == 2)
    {
        Bridge(min(V[0], V[1]), max(V[0], V[1]));
        return;
    }
    int root = V[0], ran = V[random(1, (int)V.size() - 1)];
    for(auto x : V)
    {
        Com[x].clear();
    }
    for(auto x : V)
    {
        if(x != root and x != ran)
        {
            Com[Query(root, ran, x)].push_back(x);
        }
    }
    vector <int> Path;
    for(auto x : V)
    {
        if(!Com[x].empty() and x != root and x != ran)
        {
            Path.push_back(x);
        }
    }
    tmp = root;
    sort(Path.begin(), Path.end(), [](int x, int y)
    {
        return Query(tmp, x, y) == x;
    });
    if(!Path.empty())
    {
        Bridge(min(root, Path[0]), max(root, Path[0]));
        Bridge(min(Path.back(), ran), max(Path.back(), ran));
    }
    else
    {
        Bridge(min(root, ran), max(root, ran));
    }
    for(int i = 0; i < (int)Path.size(); i++)
    {
        if(i + 1 < (int)Path.size())
        {
            Bridge(min(Path[i], Path[i + 1]), max(Path[i], Path[i + 1]));
        }
        DFS(Com[Path[i]]);
    }
    Com[root].push_back(root);
    Com[ran].push_back(ran);
    DFS(Com[root]);
    DFS(Com[ran]);
}

void Solve(int N)
{
    vector <int> V;
    for(int i = 0; i < N; i++)
    {
        V.push_back(i);
    }
    DFS(V);
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 0 ms 328 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 0 ms 328 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 1 ms 328 KB Output is correct
9 Correct 1 ms 328 KB Output is correct
10 Correct 1 ms 276 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 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 328 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 0 ms 328 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 0 ms 328 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 1 ms 328 KB Output is correct
9 Correct 1 ms 328 KB Output is correct
10 Correct 1 ms 276 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 0 ms 336 KB Output is correct
14 Correct 1 ms 328 KB Output is correct
15 Correct 1 ms 328 KB Output is correct
16 Correct 1 ms 328 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 328 KB Output is correct
20 Correct 1 ms 328 KB Output is correct
21 Correct 1 ms 328 KB Output is correct
22 Correct 1 ms 328 KB Output is correct
23 Correct 1 ms 328 KB Output is correct
24 Correct 1 ms 328 KB Output is correct
25 Correct 1 ms 328 KB Output is correct
26 Correct 1 ms 328 KB Output is correct

Subtask #3
12.0 / 12.0

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

Subtask #4
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 413 ms 624 KB Output is correct
2 Correct 420 ms 708 KB Output is correct
3 Correct 482 ms 620 KB Output is correct
4 Correct 408 ms 740 KB Output is correct
5 Correct 326 ms 716 KB Output is correct
6 Correct 329 ms 708 KB Output is correct
7 Correct 492 ms 676 KB Output is correct
8 Correct 528 ms 828 KB Output is correct
9 Correct 590 ms 772 KB Output is correct
10 Correct 640 ms 808 KB Output is correct
11 Correct 677 ms 888 KB Output is correct
12 Correct 479 ms 768 KB Output is correct
13 Correct 303 ms 724 KB Output is correct
14 Correct 329 ms 696 KB Output is correct
15 Correct 361 ms 704 KB Output is correct
16 Correct 459 ms 712 KB Output is correct
17 Correct 516 ms 724 KB Output is correct
18 Correct 328 ms 692 KB Output is correct
19 Correct 368 ms 824 KB Output is correct
20 Correct 466 ms 1084 KB Output is correct
21 Correct 463 ms 960 KB Output is correct
22 Correct 515 ms 704 KB Output is correct
23 Correct 450 ms 824 KB Output is correct
24 Correct 445 ms 832 KB Output is correct
25 Correct 364 ms 704 KB Output is correct
26 Correct 344 ms 716 KB Output is correct
27 Correct 352 ms 712 KB Output is correct
28 Correct 668 ms 832 KB Output is correct
29 Correct 452 ms 876 KB Output is correct
30 Correct 468 ms 776 KB Output is correct
31 Correct 534 ms 704 KB Output is correct
32 Correct 853 ms 848 KB Output is correct
33 Correct 732 ms 836 KB Output is correct
34 Correct 6 ms 440 KB Output is correct
35 Correct 6 ms 328 KB Output is correct
36 Correct 7 ms 328 KB Output is correct
37 Correct 5 ms 328 KB Output is correct
38 Correct 4 ms 328 KB Output is correct
39 Correct 5 ms 328 KB Output is correct
40 Correct 8 ms 456 KB Output is correct
41 Correct 11 ms 456 KB Output is correct
42 Correct 10 ms 328 KB Output is correct
43 Correct 6 ms 328 KB Output is correct
44 Correct 8 ms 456 KB Output is correct
45 Correct 8 ms 456 KB Output is correct
46 Correct 10 ms 456 KB Output is correct
47 Correct 1 ms 328 KB Output is correct
48 Correct 1 ms 328 KB Output is correct
49 Correct 1 ms 328 KB Output is correct
50 Correct 1 ms 328 KB Output is correct
51 Correct 1 ms 328 KB Output is correct
52 Correct 1 ms 328 KB Output is correct
53 Correct 1 ms 328 KB Output is correct
54 Correct 1 ms 328 KB Output is correct
55 Correct 1 ms 328 KB Output is correct
56 Correct 1 ms 328 KB Output is correct
57 Correct 1 ms 328 KB Output is correct
58 Correct 1 ms 328 KB Output is correct
59 Correct 1 ms 328 KB Output is correct
60 Correct 0 ms 328 KB Output is correct
61 Correct 0 ms 328 KB Output is correct
62 Correct 0 ms 328 KB Output is correct
63 Correct 0 ms 328 KB Output is correct
64 Correct 0 ms 332 KB Output is correct
65 Correct 1 ms 332 KB Output is correct
66 Correct 1 ms 336 KB Output is correct
67 Correct 0 ms 328 KB Output is correct
68 Correct 1 ms 340 KB Output is correct
69 Correct 1 ms 328 KB Output is correct
70 Correct 0 ms 336 KB Output is correct
71 Correct 0 ms 332 KB Output is correct
72 Correct 0 ms 332 KB Output is correct