oj.uz

Submission #158958

# Submission time Handle Problem Language Result Execution time Memory
158958 2019-10-19T16:31:59 Z georgerapeanu Meetings (JOI19_meetings) C++17
100 / 100
 1908 ms 1120 KB 
#include "meetings.h"
#pragma once
#include <vector>
#include <algorithm>
#include <set>
#include <map>

using namespace std;

map<pair<int,int>,int> asked;
int lvl[2005];

int my_query(int u,int v,int w){
    u--;
    v--;
    w--;

    if(v == u || w == u){
        return u + 1;
    }

    if(v == w){
        return v + 1;
    }

   // printf("%d %d %d\n",u,v,w);

    return Query(u,v,w) + 1;
}

void my_bridge(int u,int v){
    u--;
    v--;
    if(u > v){
        swap(u,v);
    }
   // printf("%d %d\n",u,v);
    Bridge(u,v);
}

void solve(int root,vector<int> &nodes){
    for(int i = 0;i < (int)nodes.size();i++){
        if(nodes[i] == root){
            swap(nodes[i],nodes.back());
            nodes.pop_back();
            break;
        }
    }
    
    if(nodes.size() == 0){
        return;
    }
    if(nodes.size() == 1){
        my_bridge(root,nodes[0]);
        return ;
    }

    int node = nodes[rand() % (int)nodes.size()];

    vector<int> path = {root,node};

    vector<pair<int,int> > subseq;
    
    for(auto it:nodes){
        int tmp = my_query(root,it,node);
        if(tmp != node){
            path.push_back(tmp);
        }
        subseq.push_back({tmp,it});
    }

    sort(path.begin(),path.end());
    path.resize(unique(path.begin(),path.end()) - path.begin());
    sort(path.begin(),path.end(),[&](int a,int b){return my_query(root,a,b) == a;});

    sort(subseq.begin(),subseq.end());
    set<pair<int,int> > forb;

    for(int i = 1;i < (int)path.size();i++){
        my_bridge(path[i - 1],path[i]);
        forb.insert({path[i - 1],path[i]});
        forb.insert({path[i],path[i - 1]});
    }

    int lst = subseq[0].first;
    vector<int> tmp;

    for(int i = 0;i < (int)subseq.size();i++){
        if(subseq[i].first != lst){
            solve(lst,tmp);
            lst = subseq[i].first;
            tmp.clear();
        }
        tmp.push_back(subseq[i].second);
    }
    solve(lst,tmp);
}

void Solve(int N) {
    srand(time(NULL));
    vector<int> nodes;
    for(int i = 1;i <= N;i++){
        nodes.push_back(i);
    }
    solve(1,nodes);
}

Compilation message

meetings.cpp:2:9: warning: #pragma once in main file
 #pragma once
         ^~~~

Subtask #1
7.0 / 7.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 707 ms 644 KB Output is correct
2 Correct 721 ms 652 KB Output is correct
3 Correct 746 ms 808 KB Output is correct
4 Correct 803 ms 708 KB Output is correct
5 Correct 439 ms 680 KB Output is correct
6 Correct 380 ms 760 KB Output is correct
7 Correct 675 ms 684 KB Output is correct
8 Correct 827 ms 828 KB Output is correct
9 Correct 820 ms 780 KB Output is correct
10 Correct 807 ms 776 KB Output is correct
11 Correct 974 ms 936 KB Output is correct
12 Correct 524 ms 808 KB Output is correct
13 Correct 320 ms 632 KB Output is correct
14 Correct 548 ms 632 KB Output is correct
15 Correct 421 ms 672 KB Output is correct
16 Correct 547 ms 668 KB Output is correct
17 Correct 840 ms 792 KB Output is correct
18 Correct 430 ms 592 KB Output is correct
19 Correct 413 ms 712 KB Output is correct
20 Correct 650 ms 740 KB Output is correct
21 Correct 592 ms 672 KB Output is correct
22 Correct 557 ms 724 KB Output is correct
23 Correct 534 ms 632 KB Output is correct
24 Correct 527 ms 988 KB Output is correct
25 Correct 550 ms 888 KB Output is correct
26 Correct 619 ms 864 KB Output is correct
27 Correct 525 ms 680 KB Output is correct
28 Correct 941 ms 852 KB Output is correct
29 Correct 803 ms 964 KB Output is correct
30 Correct 793 ms 764 KB Output is correct
31 Correct 871 ms 1120 KB Output is correct
32 Correct 1908 ms 936 KB Output is correct
33 Correct 899 ms 936 KB Output is correct
34 Correct 8 ms 408 KB Output is correct
35 Correct 7 ms 504 KB Output is correct
36 Correct 7 ms 376 KB Output is correct
37 Correct 7 ms 376 KB Output is correct
38 Correct 6 ms 376 KB Output is correct
39 Correct 9 ms 420 KB Output is correct
40 Correct 13 ms 376 KB Output is correct
41 Correct 17 ms 376 KB Output is correct
42 Correct 16 ms 632 KB Output is correct
43 Correct 6 ms 376 KB Output is correct
44 Correct 12 ms 376 KB Output is correct
45 Correct 10 ms 376 KB Output is correct
46 Correct 10 ms 504 KB Output is correct
47 Correct 2 ms 376 KB Output is correct
48 Correct 2 ms 248 KB Output is correct
49 Correct 2 ms 248 KB Output is correct
50 Correct 2 ms 376 KB Output is correct
51 Correct 2 ms 248 KB Output is correct
52 Correct 2 ms 248 KB Output is correct
53 Correct 2 ms 376 KB Output is correct
54 Correct 2 ms 252 KB Output is correct
55 Correct 2 ms 376 KB Output is correct
56 Correct 2 ms 248 KB Output is correct
57 Correct 2 ms 376 KB Output is correct
58 Correct 2 ms 248 KB Output is correct
59 Correct 2 ms 248 KB Output is correct
60 Correct 2 ms 248 KB Output is correct
61 Correct 2 ms 376 KB Output is correct
62 Correct 2 ms 376 KB Output is correct
63 Correct 2 ms 296 KB Output is correct
64 Correct 2 ms 248 KB Output is correct
65 Correct 2 ms 252 KB Output is correct
66 Correct 2 ms 248 KB Output is correct
67 Correct 2 ms 248 KB Output is correct
68 Correct 2 ms 248 KB Output is correct
69 Correct 2 ms 248 KB Output is correct
70 Correct 2 ms 248 KB Output is correct
71 Correct 2 ms 376 KB Output is correct
72 Correct 2 ms 248 KB Output is correct