oj.uz

Submission #233168

# Submission time Handle Problem Language Result Execution time Memory
233168 2020-05-19T18:54:02 Z Andrei_Cotor Meetings (JOI19_meetings) C++14
100 / 100
 1325 ms 3064 KB 
#include"meetings.h"
#include<random>
#include<algorithm>
#include<chrono>
#include<map>

using namespace std;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
vector<int> Subarb[36005];
vector<int> Path[36005];
int nrs;
map<int,int> IndSub[2005];
int rt;

bool cmp(int a, int b)
{
    if(a==rt)
        return 1;
    if(b==rt)
        return 0;
    int lca=Query(rt,a,b);
    return lca==a;
}

void getArb(int root, int subarb)
{
    shuffle(Subarb[subarb].begin(),Subarb[subarb].end(),rng);
    int nodeOnPath=Subarb[subarb][0];
    if(nodeOnPath==root)
        nodeOnPath=Subarb[subarb][1];

    Path[subarb].clear();
    for(auto node:Subarb[subarb])
    {
        if(node==nodeOnPath || node==root)
            continue;

        int lca=Query(root,node,nodeOnPath);
        if(lca==node)
        {
            Path[subarb].push_back(node);
        }
        else
        {
            if(IndSub[subarb][lca]==0)
            {
                IndSub[subarb][lca]=++nrs;
            }

            Subarb[IndSub[subarb][lca]].push_back(node);
        }
    }

    rt=root;
    Path[subarb].push_back(root);
    Path[subarb].push_back(nodeOnPath);
    sort(Path[subarb].begin(),Path[subarb].end(),cmp);

    for(int i=0; i<Path[subarb].size(); i++)
    {
        if(i<=Path[subarb].size()-2)
        {
            int x=Path[subarb][i];
            int y=Path[subarb][i+1];
            if(x>y)
                swap(x,y);

            Bridge(x,y);
        }

        if(IndSub[subarb][Path[subarb][i]]!=0)
        {
            Subarb[IndSub[subarb][Path[subarb][i]]].push_back(Path[subarb][i]);
            getArb(Path[subarb][i],IndSub[subarb][Path[subarb][i]]);
        }
    }
}

void Solve(int n) 
{
    for(int i=0; i<n; i++)
        Subarb[0].push_back(i);

    getArb(0,0);
}

Compilation message

meetings.cpp: In function 'void getArb(int, int)':
meetings.cpp:60:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0; i<Path[subarb].size(); i++)
                  ~^~~~~~~~~~~~~~~~~~~~
meetings.cpp:62:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if(i<=Path[subarb].size()-2)
            ~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 561 ms 2692 KB Output is correct
2 Correct 525 ms 2680 KB Output is correct
3 Correct 666 ms 2700 KB Output is correct
4 Correct 558 ms 2680 KB Output is correct
5 Correct 373 ms 3064 KB Output is correct
6 Correct 419 ms 2680 KB Output is correct
7 Correct 649 ms 2808 KB Output is correct
8 Correct 735 ms 2936 KB Output is correct
9 Correct 749 ms 3064 KB Output is correct
10 Correct 657 ms 2936 KB Output is correct
11 Correct 779 ms 2808 KB Output is correct
12 Correct 517 ms 2744 KB Output is correct
13 Correct 314 ms 2680 KB Output is correct
14 Correct 481 ms 2808 KB Output is correct
15 Correct 409 ms 2772 KB Output is correct
16 Correct 475 ms 2812 KB Output is correct
17 Correct 761 ms 2964 KB Output is correct
18 Correct 473 ms 2936 KB Output is correct
19 Correct 430 ms 2936 KB Output is correct
20 Correct 554 ms 2888 KB Output is correct
21 Correct 599 ms 2936 KB Output is correct
22 Correct 608 ms 2808 KB Output is correct
23 Correct 553 ms 2764 KB Output is correct
24 Correct 523 ms 2936 KB Output is correct
25 Correct 561 ms 2808 KB Output is correct
26 Correct 491 ms 2808 KB Output is correct
27 Correct 538 ms 2864 KB Output is correct
28 Correct 820 ms 3064 KB Output is correct
29 Correct 651 ms 2832 KB Output is correct
30 Correct 720 ms 2956 KB Output is correct
31 Correct 744 ms 3064 KB Output is correct
32 Correct 1325 ms 2680 KB Output is correct
33 Correct 1086 ms 2736 KB Output is correct
34 Correct 11 ms 2176 KB Output is correct
35 Correct 11 ms 2176 KB Output is correct
36 Correct 11 ms 2176 KB Output is correct
37 Correct 11 ms 2176 KB Output is correct
38 Correct 10 ms 2176 KB Output is correct
39 Correct 13 ms 2304 KB Output is correct
40 Correct 20 ms 2304 KB Output is correct
41 Correct 21 ms 2304 KB Output is correct
42 Correct 20 ms 2176 KB Output is correct
43 Correct 9 ms 2176 KB Output is correct
44 Correct 17 ms 2304 KB Output is correct
45 Correct 15 ms 2176 KB Output is correct
46 Correct 17 ms 2176 KB Output is correct
47 Correct 5 ms 2176 KB Output is correct
48 Correct 6 ms 2176 KB Output is correct
49 Correct 5 ms 2176 KB Output is correct
50 Correct 6 ms 2176 KB Output is correct
51 Correct 5 ms 2176 KB Output is correct
52 Correct 6 ms 2176 KB Output is correct
53 Correct 6 ms 2176 KB Output is correct
54 Correct 5 ms 2176 KB Output is correct
55 Correct 6 ms 2176 KB Output is correct
56 Correct 5 ms 2176 KB Output is correct
57 Correct 5 ms 2176 KB Output is correct
58 Correct 5 ms 2176 KB Output is correct
59 Correct 5 ms 2176 KB Output is correct
60 Correct 5 ms 2176 KB Output is correct
61 Correct 5 ms 2176 KB Output is correct
62 Correct 5 ms 2176 KB Output is correct
63 Correct 5 ms 2176 KB Output is correct
64 Correct 5 ms 2176 KB Output is correct
65 Correct 6 ms 2176 KB Output is correct
66 Correct 6 ms 2176 KB Output is correct
67 Correct 5 ms 2176 KB Output is correct
68 Correct 5 ms 2176 KB Output is correct
69 Correct 5 ms 2176 KB Output is correct
70 Correct 6 ms 2176 KB Output is correct
71 Correct 5 ms 2176 KB Output is correct
72 Correct 5 ms 2176 KB Output is correct