oj.uz

Submission #260269

# Submission time Handle Problem Language Result Execution time Memory
260269 2020-08-09T23:27:52 Z infinitepro Meetings (JOI19_meetings) C++17
100 / 100
 1223 ms 3192 KB 
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#pragma GCC optimization ("Ofast")
#include<bits/stdc++.h>
#include"meetings.h"
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<vi> vvi;
typedef vector<vii> vvii;

#define INF INT_MAX
#define MOD 1000000007
#define all(x) x.begin(), x.end()

map<ii, int> qr;
int ask(int u, int v){
    if(u>v)swap(u,v);
    if(u==v)return u;
    if(qr.find({u,v}) == qr.end())
        qr[{u,v}] = Query(0, u, v);
    return qr[{u,v}];
}

vi sol;
void doit(int root, vi S){
    unordered_map<int, vi> tmp;
    vi path;

    int u = S[rand()%S.size()];
    for(auto v : S){
        int p = ask(u, v);
        if(p == v) path.push_back(v);
        else tmp[p].push_back(v);
    }

    sort(all(path), [&](int a, int b){
        return (ask(a, b) == a);
    });
    for(int x = 1; x < path.size(); x++){
        sol[path[x]] = path[x-1];
    }
    sol[path[0]] = root;

    for(auto [rt, s] : tmp){
        doit(rt, s);
    }
    return;
}

void Solve(int N){
    vi S; sol.resize(N);
    for(int x = 1; x < N; x++)
        S.push_back(x);
    doit(0, S);

    for(int x = 1; x < N; x++)
        Bridge(min(sol[x], x), max(sol[x], x));
    
}

Compilation message

meetings.cpp:2:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization ("O3")
 
meetings.cpp:3:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization ("unroll-loops")
 
meetings.cpp:4:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization ("Ofast")
 
meetings.cpp: In function 'void doit(int, vi)':
meetings.cpp:47:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int x = 1; x < path.size(); x++){
                    ~~^~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 538 ms 1500 KB Output is correct
2 Correct 673 ms 1784 KB Output is correct
3 Correct 600 ms 1784 KB Output is correct
4 Correct 546 ms 1528 KB Output is correct
5 Correct 370 ms 1272 KB Output is correct
6 Correct 459 ms 1400 KB Output is correct
7 Correct 755 ms 2292 KB Output is correct
8 Correct 904 ms 2736 KB Output is correct
9 Correct 884 ms 2808 KB Output is correct
10 Correct 902 ms 2936 KB Output is correct
11 Correct 960 ms 3064 KB Output is correct
12 Correct 435 ms 1528 KB Output is correct
13 Correct 345 ms 1272 KB Output is correct
14 Correct 581 ms 1912 KB Output is correct
15 Correct 532 ms 1872 KB Output is correct
16 Correct 561 ms 1984 KB Output is correct
17 Correct 862 ms 3040 KB Output is correct
18 Correct 426 ms 1656 KB Output is correct
19 Correct 427 ms 1572 KB Output is correct
20 Correct 587 ms 1784 KB Output is correct
21 Correct 589 ms 1784 KB Output is correct
22 Correct 688 ms 2180 KB Output is correct
23 Correct 663 ms 2040 KB Output is correct
24 Correct 623 ms 1784 KB Output is correct
25 Correct 527 ms 1784 KB Output is correct
26 Correct 522 ms 1784 KB Output is correct
27 Correct 581 ms 1840 KB Output is correct
28 Correct 947 ms 3064 KB Output is correct
29 Correct 870 ms 3192 KB Output is correct
30 Correct 880 ms 2936 KB Output is correct
31 Correct 941 ms 2932 KB Output is correct
32 Correct 1223 ms 2296 KB Output is correct
33 Correct 956 ms 2168 KB Output is correct
34 Correct 8 ms 512 KB Output is correct
35 Correct 8 ms 512 KB Output is correct
36 Correct 7 ms 512 KB Output is correct
37 Correct 8 ms 512 KB Output is correct
38 Correct 7 ms 512 KB Output is correct
39 Correct 10 ms 512 KB Output is correct
40 Correct 15 ms 640 KB Output is correct
41 Correct 21 ms 768 KB Output is correct
42 Correct 18 ms 640 KB Output is correct
43 Correct 6 ms 512 KB Output is correct
44 Correct 15 ms 640 KB Output is correct
45 Correct 18 ms 512 KB Output is correct
46 Correct 11 ms 512 KB Output is correct
47 Correct 1 ms 384 KB Output is correct
48 Correct 1 ms 384 KB Output is correct
49 Correct 1 ms 384 KB Output is correct
50 Correct 1 ms 384 KB Output is correct
51 Correct 1 ms 384 KB Output is correct
52 Correct 1 ms 384 KB Output is correct
53 Correct 1 ms 384 KB Output is correct
54 Correct 1 ms 384 KB Output is correct
55 Correct 1 ms 384 KB Output is correct
56 Correct 1 ms 384 KB Output is correct
57 Correct 1 ms 384 KB Output is correct
58 Correct 1 ms 384 KB Output is correct
59 Correct 1 ms 384 KB Output is correct
60 Correct 0 ms 384 KB Output is correct
61 Correct 0 ms 384 KB Output is correct
62 Correct 0 ms 384 KB Output is correct
63 Correct 0 ms 384 KB Output is correct
64 Correct 0 ms 384 KB Output is correct
65 Correct 0 ms 384 KB Output is correct
66 Correct 0 ms 384 KB Output is correct
67 Correct 0 ms 384 KB Output is correct
68 Correct 0 ms 384 KB Output is correct
69 Correct 0 ms 384 KB Output is correct
70 Correct 0 ms 384 KB Output is correct
71 Correct 0 ms 384 KB Output is correct
72 Correct 0 ms 384 KB Output is correct