Submission #158956

# Submission time Handle Problem Language Result Execution time Memory
158956 2019-10-19T16:14:18 Z georgerapeanu Meetings (JOI19_meetings) C++14
29 / 100
2000 ms 940 KB
#include "meetings.h"
#pragma once
#include <vector>
#include <algorithm>
#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 == w){
        return v + 1;
    }

    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 ;
    }
    
    vector<pair<pair<int,int>,vector<int> > > sons;sons.clear();


    for(auto it:nodes){
        random_shuffle(sons.begin(),sons.end());
        bool ins = false;
        for(int i = 0;i < (int)sons.size();i++){
            int tmp = my_query(root,sons[i].first.second,it);
            if(tmp != root){
                sons[i].first.second = tmp;
                sons[i].first.first++;
                sons[i].second.push_back(it);
                ins = true;
                break;
            }
        }
        if(ins == false){
            sons.push_back({{1,it},{it}});
        }
    }


    for(int i = 0;i < (int)sons.size();i++){
        my_bridge(root,sons[i].first.second);
        lvl[sons[i].first.second] = 1 + lvl[root];
    }

    for(int i = 0;i < (int)sons.size();i++){
        solve(sons[i].first.second,sons[i].second);
    }
}

void Solve(int N) {
    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
         ^~~~
# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 252 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 248 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 376 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 376 KB Output is correct
12 Correct 2 ms 248 KB Output is correct
13 Correct 1 ms 380 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 252 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 248 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 376 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 376 KB Output is correct
12 Correct 2 ms 248 KB Output is correct
13 Correct 1 ms 380 KB Output is correct
14 Correct 2 ms 248 KB Output is correct
15 Correct 2 ms 248 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 248 KB Output is correct
18 Correct 2 ms 380 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 248 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 244 KB Output is correct
23 Correct 2 ms 248 KB Output is correct
24 Correct 2 ms 248 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 252 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 248 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 376 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 376 KB Output is correct
12 Correct 2 ms 248 KB Output is correct
13 Correct 1 ms 380 KB Output is correct
14 Correct 2 ms 248 KB Output is correct
15 Correct 2 ms 248 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 248 KB Output is correct
18 Correct 2 ms 380 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 248 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 244 KB Output is correct
23 Correct 2 ms 248 KB Output is correct
24 Correct 2 ms 248 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 17 ms 376 KB Output is correct
28 Correct 14 ms 376 KB Output is correct
29 Correct 16 ms 376 KB Output is correct
30 Correct 18 ms 376 KB Output is correct
31 Correct 11 ms 376 KB Output is correct
32 Correct 14 ms 376 KB Output is correct
33 Correct 19 ms 376 KB Output is correct
34 Correct 24 ms 376 KB Output is correct
35 Correct 21 ms 376 KB Output is correct
36 Correct 16 ms 376 KB Output is correct
37 Correct 98 ms 504 KB Output is correct
38 Correct 131 ms 632 KB Output is correct
39 Correct 153 ms 632 KB Output is correct
# Verdict Execution time Memory Grader output
1 Execution timed out 2444 ms 940 KB Time limit exceeded
2 Halted 0 ms 0 KB -