oj.uz

Submission #400178

# Submission time Handle Problem Language Result Execution time Memory
400178 2021-05-07T13:47:54 Z Victor Meetings (JOI19_meetings) C++17
100 / 100
 983 ms 916 KB 
#include "meetings.h"

#include <bits/stdc++.h>

using namespace std;

#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define per(i, a, b) for (int i = b - 1; i >= (a); --i)
#define trav(a, x) for (auto &a : x)

#define all(x) x.begin(), x.end()
#define sz(x) x.size()
#define pb push_back

#define umap unordered_map
#define uset unordered_set

typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<vi> vvi;
typedef long long ll;

const int INF = 1000000007;

struct edge {
    int u, v;
};

vii EL;
vi children[4001];

void solve(int u) {
    vi nodes = children[u];

    int v = nodes[random() % sz(nodes)];
    vi path;
    path.pb(u);

    rep(i, 0, sz(nodes)) {
        int cur = nodes[i];
        if (cur == v) continue;

        int meet = Query(u, v, cur);

        if (meet == cur) {
            int lo = 1, hi = sz(path);

            while (lo < hi) {
                int mid = (hi + lo) >> 1;
                meet = Query(u, cur, path[mid]);
                if (meet == cur)
                    hi = mid;
                else
                    lo = mid + 1;
            }

            path.insert(path.begin() + lo, cur);

        } else
            children[meet == u ? meet + 2000 : meet].pb(cur);
    }

    path.pb(v);

    if (!children[u + 2000].empty()) {
        children[u].swap(children[u + 2000]);
        children[u + 2000].clear();
        solve(u);
    }

    rep(i, 0, sz(path) - 1) EL.emplace_back(min(path[i], path[i + 1]), max(path[i], path[i + 1]));

    rep(i, 1, sz(path)) if (sz(children[path[i]])) solve(path[i]);
}

void Solve(int N) {
    fill(children, children + 2001, vi());
    rep(i, 1, N) children[0].pb(i);
    solve(0);

    sort(all(EL));
    trav(edg, EL) Bridge(edg.first,edg.second);
}

Compilation message

meetings.cpp: In function 'void solve(int)':
meetings.cpp:7:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    7 | #define rep(i, a, b) for (int i = a; i < (b); ++i)
      |                                        ^
meetings.cpp:41:5: note: in expansion of macro 'rep'
   41 |     rep(i, 0, sz(nodes)) {
      |     ^~~
meetings.cpp:7:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    7 | #define rep(i, a, b) for (int i = a; i < (b); ++i)
      |                                        ^
meetings.cpp:73:5: note: in expansion of macro 'rep'
   73 |     rep(i, 0, sz(path) - 1) EL.emplace_back(min(path[i], path[i + 1]), max(path[i], path[i + 1]));
      |     ^~~
meetings.cpp:7:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    7 | #define rep(i, a, b) for (int i = a; i < (b); ++i)
      |                                        ^
meetings.cpp:75:5: note: in expansion of macro 'rep'
   75 |     rep(i, 1, sz(path)) if (sz(children[path[i]])) solve(path[i]);
      |     ^~~

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 1 ms 328 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 1 ms 328 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 328 KB Output is correct
11 Correct 1 ms 328 KB Output is correct
12 Correct 1 ms 328 KB Output is correct
13 Correct 1 ms 328 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 1 ms 328 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 1 ms 328 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 328 KB Output is correct
11 Correct 1 ms 328 KB Output is correct
12 Correct 1 ms 328 KB Output is correct
13 Correct 1 ms 328 KB Output is correct
14 Correct 1 ms 412 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 376 KB Output is correct
18 Correct 1 ms 348 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 332 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 1 ms 328 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 1 ms 328 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 328 KB Output is correct
11 Correct 1 ms 328 KB Output is correct
12 Correct 1 ms 328 KB Output is correct
13 Correct 1 ms 328 KB Output is correct
14 Correct 1 ms 412 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 376 KB Output is correct
18 Correct 1 ms 348 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 332 KB Output is correct
26 Correct 1 ms 328 KB Output is correct
27 Correct 7 ms 456 KB Output is correct
28 Correct 7 ms 456 KB Output is correct
29 Correct 8 ms 456 KB Output is correct
30 Correct 6 ms 456 KB Output is correct
31 Correct 6 ms 456 KB Output is correct
32 Correct 8 ms 456 KB Output is correct
33 Correct 14 ms 476 KB Output is correct
34 Correct 24 ms 456 KB Output is correct
35 Correct 18 ms 464 KB Output is correct
36 Correct 6 ms 456 KB Output is correct
37 Correct 14 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 446 ms 740 KB Output is correct
2 Correct 518 ms 736 KB Output is correct
3 Correct 585 ms 784 KB Output is correct
4 Correct 511 ms 740 KB Output is correct
5 Correct 398 ms 764 KB Output is correct
6 Correct 429 ms 916 KB Output is correct
7 Correct 734 ms 704 KB Output is correct
8 Correct 898 ms 752 KB Output is correct
9 Correct 838 ms 832 KB Output is correct
10 Correct 817 ms 832 KB Output is correct
11 Correct 931 ms 828 KB Output is correct
12 Correct 341 ms 792 KB Output is correct
13 Correct 260 ms 704 KB Output is correct
14 Correct 569 ms 764 KB Output is correct
15 Correct 508 ms 796 KB Output is correct
16 Correct 606 ms 748 KB Output is correct
17 Correct 805 ms 704 KB Output is correct
18 Correct 425 ms 768 KB Output is correct
19 Correct 436 ms 628 KB Output is correct
20 Correct 575 ms 704 KB Output is correct
21 Correct 580 ms 760 KB Output is correct
22 Correct 582 ms 704 KB Output is correct
23 Correct 639 ms 676 KB Output is correct
24 Correct 544 ms 664 KB Output is correct
25 Correct 495 ms 760 KB Output is correct
26 Correct 477 ms 708 KB Output is correct
27 Correct 510 ms 704 KB Output is correct
28 Correct 983 ms 836 KB Output is correct
29 Correct 807 ms 836 KB Output is correct
30 Correct 797 ms 808 KB Output is correct
31 Correct 872 ms 832 KB Output is correct
32 Correct 745 ms 768 KB Output is correct
33 Correct 816 ms 728 KB Output is correct
34 Correct 7 ms 456 KB Output is correct
35 Correct 7 ms 456 KB Output is correct
36 Correct 7 ms 456 KB Output is correct
37 Correct 6 ms 476 KB Output is correct
38 Correct 6 ms 456 KB Output is correct
39 Correct 8 ms 484 KB Output is correct
40 Correct 14 ms 456 KB Output is correct
41 Correct 20 ms 456 KB Output is correct
42 Correct 17 ms 456 KB Output is correct
43 Correct 6 ms 456 KB Output is correct
44 Correct 14 ms 476 KB Output is correct
45 Correct 12 ms 456 KB Output is correct
46 Correct 11 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 1 ms 328 KB Output is correct
61 Correct 1 ms 328 KB Output is correct
62 Correct 1 ms 328 KB Output is correct
63 Correct 1 ms 328 KB Output is correct
64 Correct 1 ms 328 KB Output is correct
65 Correct 1 ms 328 KB Output is correct
66 Correct 1 ms 328 KB Output is correct
67 Correct 1 ms 328 KB Output is correct
68 Correct 1 ms 328 KB Output is correct
69 Correct 1 ms 328 KB Output is correct
70 Correct 1 ms 328 KB Output is correct
71 Correct 1 ms 328 KB Output is correct
72 Correct 1 ms 328 KB Output is correct