oj.uz

Submission #158950

# Submission time Handle Problem Language Result Execution time Memory
158950 2019-10-19T16:04:10 Z georgerapeanu Meetings (JOI19_meetings) C++14
29 / 100
 2000 ms 1268 KB 
#include "meetings.h"
#pragma once
#include <vector>
#include <algorithm>

using namespace std;

int my_query(int u,int v,int w){
    u--;
    v--;
    w--;
    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 ;
    }
    
    vector<pair<pair<int,int>,vector<int> > > sons;sons.clear();

    for(auto it:nodes){
        sort(sons.begin(),sons.end());
        reverse(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);
    }

    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
7.0 / 7.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 248 KB Output is correct
4 Correct 2 ms 248 KB Output is correct
5 Correct 2 ms 380 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 248 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 248 KB Output is correct
13 Correct 2 ms 248 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 248 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 248 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 376 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 244 KB Output is correct
26 Correct 2 ms 248 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 248 KB Output is correct
4 Correct 2 ms 248 KB Output is correct
5 Correct 2 ms 380 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 248 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 248 KB Output is correct
13 Correct 2 ms 248 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 248 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 248 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 376 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 244 KB Output is correct
26 Correct 2 ms 248 KB Output is correct
27 Correct 11 ms 376 KB Output is correct
28 Correct 9 ms 376 KB Output is correct
29 Correct 11 ms 376 KB Output is correct
30 Correct 12 ms 376 KB Output is correct
31 Correct 10 ms 476 KB Output is correct
32 Correct 11 ms 376 KB Output is correct
33 Correct 16 ms 376 KB Output is correct
34 Correct 21 ms 376 KB Output is correct
35 Correct 19 ms 376 KB Output is correct
36 Correct 14 ms 340 KB Output is correct
37 Correct 98 ms 532 KB Output is correct
38 Correct 131 ms 632 KB Output is correct
39 Correct 154 ms 692 KB Output is correct

Subtask #4
0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 1318 ms 948 KB Output is correct
2 Correct 1477 ms 904 KB Output is correct
3 Correct 1369 ms 792 KB Output is correct
4 Correct 1544 ms 720 KB Output is correct
5 Correct 1101 ms 936 KB Output is correct
6 Correct 813 ms 888 KB Output is correct
7 Correct 879 ms 760 KB Output is correct
8 Correct 973 ms 828 KB Output is correct
9 Correct 1016 ms 844 KB Output is correct
10 Correct 1033 ms 768 KB Output is correct
11 Correct 1062 ms 892 KB Output is correct
12 Execution timed out 3038 ms 1268 KB Time limit exceeded
13 Halted 0 ms 0 KB -