oj.uz

Submission #400179

# Submission time Handle Problem Language Result Execution time Memory
400179 2021-05-07T13:49:07 Z Victor Meetings (JOI19_meetings) C++17
100 / 100
 1002 ms 960 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[2001];

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

    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].pb(cur);
    }

    path.pb(v);

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

    rep(i, 0, 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:42:5: note: in expansion of macro 'rep'
   42 |     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:69:5: note: in expansion of macro 'rep'
   69 |     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:71:5: note: in expansion of macro 'rep'
   71 |     rep(i, 0, 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 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 328 KB Output is correct
18 Correct 1 ms 328 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 332 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 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 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 328 KB Output is correct
18 Correct 1 ms 328 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 332 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 7 ms 328 KB Output is correct
28 Correct 6 ms 332 KB Output is correct
29 Correct 7 ms 328 KB Output is correct
30 Correct 6 ms 436 KB Output is correct
31 Correct 6 ms 328 KB Output is correct
32 Correct 8 ms 380 KB Output is correct
33 Correct 14 ms 328 KB Output is correct
34 Correct 20 ms 444 KB Output is correct
35 Correct 17 ms 420 KB Output is correct
36 Correct 6 ms 424 KB Output is correct
37 Correct 14 ms 456 KB Output is correct
38 Correct 13 ms 328 KB Output is correct
39 Correct 11 ms 328 KB Output is correct

Subtask #4
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 448 ms 704 KB Output is correct
2 Correct 517 ms 740 KB Output is correct
3 Correct 579 ms 844 KB Output is correct
4 Correct 504 ms 960 KB Output is correct
5 Correct 396 ms 696 KB Output is correct
6 Correct 423 ms 712 KB Output is correct
7 Correct 732 ms 704 KB Output is correct
8 Correct 905 ms 856 KB Output is correct
9 Correct 840 ms 712 KB Output is correct
10 Correct 816 ms 716 KB Output is correct
11 Correct 946 ms 700 KB Output is correct
12 Correct 347 ms 748 KB Output is correct
13 Correct 262 ms 632 KB Output is correct
14 Correct 590 ms 732 KB Output is correct
15 Correct 510 ms 724 KB Output is correct
16 Correct 595 ms 632 KB Output is correct
17 Correct 809 ms 732 KB Output is correct
18 Correct 406 ms 700 KB Output is correct
19 Correct 423 ms 584 KB Output is correct
20 Correct 574 ms 736 KB Output is correct
21 Correct 573 ms 844 KB Output is correct
22 Correct 572 ms 584 KB Output is correct
23 Correct 628 ms 700 KB Output is correct
24 Correct 542 ms 616 KB Output is correct
25 Correct 495 ms 716 KB Output is correct
26 Correct 469 ms 712 KB Output is correct
27 Correct 503 ms 716 KB Output is correct
28 Correct 1002 ms 716 KB Output is correct
29 Correct 806 ms 704 KB Output is correct
30 Correct 786 ms 768 KB Output is correct
31 Correct 870 ms 776 KB Output is correct
32 Correct 735 ms 776 KB Output is correct
33 Correct 823 ms 684 KB Output is correct
34 Correct 7 ms 328 KB Output is correct
35 Correct 6 ms 328 KB Output is correct
36 Correct 7 ms 328 KB Output is correct
37 Correct 6 ms 328 KB Output is correct
38 Correct 6 ms 328 KB Output is correct
39 Correct 8 ms 324 KB Output is correct
40 Correct 14 ms 428 KB Output is correct
41 Correct 20 ms 328 KB Output is correct
42 Correct 17 ms 328 KB Output is correct
43 Correct 6 ms 328 KB Output is correct
44 Correct 14 ms 424 KB Output is correct
45 Correct 13 ms 456 KB Output is correct
46 Correct 11 ms 328 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 332 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 332 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