oj.uz

Submission #201423

# Submission time Handle Problem Language Result Execution time Memory
201423 2020-02-10T14:31:31 Z BThero Meetings (JOI19_meetings) C++17
100 / 100
 904 ms 2712 KB 
// Why am I so dumb? :c
// chrono::system_clock::now().time_since_epoch().count()
                                                  
#include<bits/stdc++.h>
#include "meetings.h"
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>

#define pb push_back
#define mp make_pair

#define all(x) (x).begin(), (x).end()

#define fi first
#define se second

using namespace std;
//using namespace __gnu_pbds;

typedef long long ll;   
typedef pair<int, int> pii;
//template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

mt19937 rnd(chrono::system_clock::now().time_since_epoch().count());

struct cmp {
    int x;

    cmp(int y) {
        x = y;        
    }

    bool operator()(int a, int b) {
        return Query(x, a, b) == a;
    }
};

int n;

void dfs(vector<int> S) {
    if (S.size() <= 1) {
        return;
    }

    int a = S[0];
    int b = S[1 + rnd() % (S.size() - 1)];
    vector<int> path;
    vector<vector<int> > later(n + 1);
    path.pb(a);
    path.pb(b);

    for (int c : S) {
        if (c == a || c == b) {
            continue;
        }

        int x = Query(a, b, c);

        if (x == c) {
            path.pb(c);            
        }
        else {
            later[x].pb(c);        
        }                                                                                                                                                                 
    }    

    sort(path.begin() + 1, path.end(), cmp(a));

    for (int i = 1; i < path.size(); ++i) {
        int a = path[i - 1], b = path[i];

        if (a > b) {
            swap(a, b);
        }

        Bridge(a, b);
    }

    for (int c : S) {
        later[c].insert(later[c].begin(), c);
        dfs(later[c]);
    }                                                                                        
}

void Solve(int N) {
    n = N;
    vector<int> v;

    for (int i = 0; i < n; ++i) {
        v.pb(i);
    }

    dfs(v);
}

Compilation message

meetings.cpp: In function 'void dfs(std::vector<int>)':
meetings.cpp:69:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 1; i < path.size(); ++i) {
                     ~~^~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 248 KB Output is correct
5 Correct 4 ms 248 KB Output is correct
6 Correct 4 ms 376 KB Output is correct
7 Correct 5 ms 248 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 248 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 248 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 300 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 5 ms 376 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
22 Correct 5 ms 376 KB Output is correct
23 Correct 5 ms 376 KB Output is correct
24 Correct 5 ms 376 KB Output is correct
25 Correct 5 ms 376 KB Output is correct
26 Correct 5 ms 376 KB Output is correct
27 Correct 11 ms 504 KB Output is correct
28 Correct 10 ms 376 KB Output is correct
29 Correct 11 ms 504 KB Output is correct
30 Correct 13 ms 504 KB Output is correct
31 Correct 9 ms 508 KB Output is correct
32 Correct 13 ms 504 KB Output is correct
33 Correct 18 ms 504 KB Output is correct
34 Correct 21 ms 632 KB Output is correct
35 Correct 20 ms 632 KB Output is correct
36 Correct 9 ms 376 KB Output is correct
37 Correct 18 ms 380 KB Output is correct
38 Correct 17 ms 376 KB Output is correct
39 Correct 12 ms 504 KB Output is correct

Subtask #4
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 571 ms 1648 KB Output is correct
2 Correct 623 ms 1776 KB Output is correct
3 Correct 607 ms 1444 KB Output is correct
4 Correct 594 ms 1456 KB Output is correct
5 Correct 400 ms 1240 KB Output is correct
6 Correct 432 ms 1440 KB Output is correct
7 Correct 725 ms 2044 KB Output is correct
8 Correct 761 ms 2328 KB Output is correct
9 Correct 742 ms 2660 KB Output is correct
10 Correct 673 ms 2636 KB Output is correct
11 Correct 818 ms 2712 KB Output is correct
12 Correct 567 ms 1004 KB Output is correct
13 Correct 349 ms 1496 KB Output is correct
14 Correct 557 ms 1808 KB Output is correct
15 Correct 466 ms 1772 KB Output is correct
16 Correct 526 ms 2020 KB Output is correct
17 Correct 762 ms 2440 KB Output is correct
18 Correct 463 ms 1940 KB Output is correct
19 Correct 512 ms 1772 KB Output is correct
20 Correct 614 ms 1900 KB Output is correct
21 Correct 687 ms 2196 KB Output is correct
22 Correct 639 ms 1680 KB Output is correct
23 Correct 611 ms 2056 KB Output is correct
24 Correct 609 ms 1772 KB Output is correct
25 Correct 561 ms 1776 KB Output is correct
26 Correct 534 ms 1540 KB Output is correct
27 Correct 557 ms 1612 KB Output is correct
28 Correct 864 ms 2452 KB Output is correct
29 Correct 703 ms 2620 KB Output is correct
30 Correct 733 ms 2444 KB Output is correct
31 Correct 878 ms 2620 KB Output is correct
32 Correct 904 ms 1400 KB Output is correct
33 Correct 742 ms 1144 KB Output is correct
34 Correct 11 ms 376 KB Output is correct
35 Correct 11 ms 376 KB Output is correct
36 Correct 10 ms 376 KB Output is correct
37 Correct 10 ms 504 KB Output is correct
38 Correct 12 ms 504 KB Output is correct
39 Correct 14 ms 508 KB Output is correct
40 Correct 18 ms 504 KB Output is correct
41 Correct 21 ms 632 KB Output is correct
42 Correct 22 ms 632 KB Output is correct
43 Correct 10 ms 376 KB Output is correct
44 Correct 21 ms 504 KB Output is correct
45 Correct 18 ms 376 KB Output is correct
46 Correct 11 ms 504 KB Output is correct
47 Correct 5 ms 376 KB Output is correct
48 Correct 5 ms 376 KB Output is correct
49 Correct 5 ms 376 KB Output is correct
50 Correct 5 ms 376 KB Output is correct
51 Correct 5 ms 300 KB Output is correct
52 Correct 5 ms 376 KB Output is correct
53 Correct 6 ms 376 KB Output is correct
54 Correct 6 ms 504 KB Output is correct
55 Correct 5 ms 376 KB Output is correct
56 Correct 5 ms 376 KB Output is correct
57 Correct 5 ms 376 KB Output is correct
58 Correct 5 ms 376 KB Output is correct
59 Correct 5 ms 376 KB Output is correct
60 Correct 5 ms 376 KB Output is correct
61 Correct 4 ms 248 KB Output is correct
62 Correct 5 ms 248 KB Output is correct
63 Correct 5 ms 248 KB Output is correct
64 Correct 5 ms 248 KB Output is correct
65 Correct 5 ms 376 KB Output is correct
66 Correct 5 ms 424 KB Output is correct
67 Correct 5 ms 376 KB Output is correct
68 Correct 5 ms 428 KB Output is correct
69 Correct 5 ms 248 KB Output is correct
70 Correct 5 ms 376 KB Output is correct
71 Correct 5 ms 248 KB Output is correct
72 Correct 5 ms 248 KB Output is correct