oj.uz

Submission #158955

# Submission time Handle Problem Language Result Execution time Memory
158955 2019-10-19T16:12:35 Z georgerapeanu Meetings (JOI19_meetings) C++14
0 / 100
 2000 ms 3880 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;
    }
    if(v > w){
        swap(v,w);
    }
//    printf("%d %d %d\n",u,v,w);

    if(asked.count({v,w}) == 0){
        asked[{v,w}] = Query(u,v,w);
    }

    if(lvl[asked[{v,w}] + 1] < lvl[u + 1]){
        return u + 1;
    }

    return asked[{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
         ^~~~

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 248 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Incorrect 2 ms 376 KB Wrong Answer [4]
5 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 248 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Incorrect 2 ms 376 KB Wrong Answer [4]
5 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 248 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Incorrect 2 ms 376 KB Wrong Answer [4]
5 Halted 0 ms 0 KB -

Subtask #4
0 / 71.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3018 ms 3880 KB Time limit exceeded
2 Halted 0 ms 0 KB -