Submission #814796

# Submission time Handle Problem Language Result Execution time Memory
814796 2023-08-08T10:02:02 Z LucaIlie Meetings (JOI19_meetings) C++17
100 / 100
905 ms 768 KB
#include "meetings.h"
#include <bits/stdc++.h>

using namespace std;

void bridge( int u, int v ) {
    if ( u > v )
        swap( u, v );
    Bridge( u, v );
}

void solve( int root, vector<int> &subtree ) {
    if ( subtree.size() == 0 )
        return;

    random_shuffle( subtree.begin(), subtree.end() );
    unordered_map<int, vector<int>> newSubtrees;
    vector<int> path;

    int pivot = subtree[0];
    for ( int i = 1; i < subtree.size(); i++ ) {
        int ans = Query( root, pivot, subtree[i] );
        if ( ans == subtree[i] )
            path.push_back( subtree[i] );
        else
            newSubtrees[ans].push_back( subtree[i] );
    }

    for ( int i = 1; i < path.size(); i++ ) {
        int l = -1, r = i;
        while ( r - l > 1 ) {
            int mid = (l + r) / 2;
            if ( Query( root, path[mid], path[i] ) == path[mid] )
                l = mid;
            else
                r = mid;
        }
        for ( int j = i; j > r; j-- )
            swap( path[j], path[j - 1] );
    }


    if ( path.size() == 0 )
        bridge( root, pivot );
    else {
        bridge( root, path[0] );
        for ( int i = 0; i < path.size() - 1; i++ )
            bridge( path[i], path[i + 1] );
        bridge( path[path.size() - 1], pivot );
    }

    for ( auto &st: newSubtrees )
        solve( st.first, st.second );
}

void Solve( int n ) {
    int root = 0;
    vector<int> subtree;
    for ( int u = 1; u < n; u++ )
        subtree.push_back( u );
    solve( root, subtree );
}

Compilation message

meetings.cpp: In function 'void solve(int, std::vector<int>&)':
meetings.cpp:21:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   21 |     for ( int i = 1; i < subtree.size(); i++ ) {
      |                      ~~^~~~~~~~~~~~~~~~
meetings.cpp:29:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |     for ( int i = 1; i < path.size(); i++ ) {
      |                      ~~^~~~~~~~~~~~~
meetings.cpp:47:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   47 |         for ( int i = 0; i < path.size() - 1; i++ )
      |                          ~~^~~~~~~~~~~~~~~~~
# 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 0 ms 276 KB Output is correct
5 Correct 0 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 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
# 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 0 ms 276 KB Output is correct
5 Correct 0 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 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 0 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 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 0 ms 336 KB Output is correct
23 Correct 0 ms 336 KB Output is correct
24 Correct 0 ms 336 KB Output is correct
25 Correct 0 ms 336 KB Output is correct
26 Correct 0 ms 336 KB Output is correct
# 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 0 ms 276 KB Output is correct
5 Correct 0 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 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 0 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 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 0 ms 336 KB Output is correct
23 Correct 0 ms 336 KB Output is correct
24 Correct 0 ms 336 KB Output is correct
25 Correct 0 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 3 ms 336 KB Output is correct
29 Correct 3 ms 336 KB Output is correct
30 Correct 6 ms 336 KB Output is correct
31 Correct 3 ms 336 KB Output is correct
32 Correct 4 ms 336 KB Output is correct
33 Correct 7 ms 336 KB Output is correct
34 Correct 17 ms 380 KB Output is correct
35 Correct 9 ms 408 KB Output is correct
36 Correct 3 ms 336 KB Output is correct
37 Correct 7 ms 364 KB Output is correct
38 Correct 7 ms 388 KB Output is correct
39 Correct 5 ms 336 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 251 ms 612 KB Output is correct
2 Correct 255 ms 668 KB Output is correct
3 Correct 239 ms 584 KB Output is correct
4 Correct 230 ms 584 KB Output is correct
5 Correct 171 ms 656 KB Output is correct
6 Correct 187 ms 540 KB Output is correct
7 Correct 407 ms 768 KB Output is correct
8 Correct 905 ms 640 KB Output is correct
9 Correct 463 ms 668 KB Output is correct
10 Correct 452 ms 672 KB Output is correct
11 Correct 485 ms 548 KB Output is correct
12 Correct 188 ms 628 KB Output is correct
13 Correct 182 ms 676 KB Output is correct
14 Correct 269 ms 608 KB Output is correct
15 Correct 224 ms 604 KB Output is correct
16 Correct 307 ms 644 KB Output is correct
17 Correct 465 ms 664 KB Output is correct
18 Correct 228 ms 628 KB Output is correct
19 Correct 245 ms 632 KB Output is correct
20 Correct 316 ms 612 KB Output is correct
21 Correct 253 ms 628 KB Output is correct
22 Correct 240 ms 624 KB Output is correct
23 Correct 281 ms 608 KB Output is correct
24 Correct 261 ms 620 KB Output is correct
25 Correct 250 ms 628 KB Output is correct
26 Correct 245 ms 604 KB Output is correct
27 Correct 232 ms 540 KB Output is correct
28 Correct 581 ms 676 KB Output is correct
29 Correct 444 ms 548 KB Output is correct
30 Correct 458 ms 668 KB Output is correct
31 Correct 456 ms 548 KB Output is correct
32 Correct 709 ms 744 KB Output is correct
33 Correct 392 ms 644 KB Output is correct
34 Correct 4 ms 336 KB Output is correct
35 Correct 3 ms 336 KB Output is correct
36 Correct 3 ms 336 KB Output is correct
37 Correct 3 ms 336 KB Output is correct
38 Correct 6 ms 388 KB Output is correct
39 Correct 4 ms 380 KB Output is correct
40 Correct 7 ms 336 KB Output is correct
41 Correct 9 ms 336 KB Output is correct
42 Correct 8 ms 336 KB Output is correct
43 Correct 3 ms 368 KB Output is correct
44 Correct 7 ms 336 KB Output is correct
45 Correct 11 ms 384 KB Output is correct
46 Correct 5 ms 336 KB Output is correct
47 Correct 1 ms 336 KB Output is correct
48 Correct 1 ms 336 KB Output is correct
49 Correct 1 ms 336 KB Output is correct
50 Correct 1 ms 336 KB Output is correct
51 Correct 0 ms 336 KB Output is correct
52 Correct 0 ms 336 KB Output is correct
53 Correct 1 ms 336 KB Output is correct
54 Correct 0 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 0 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 1 ms 336 KB Output is correct
62 Correct 1 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 1 ms 336 KB Output is correct
68 Correct 1 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