oj.uz

Submission #227144

# Submission time Handle Problem Language Result Execution time Memory
227144 2020-04-26T09:12:08 Z MKopchev Meetings (JOI19_meetings) C++14
100 / 100
 1179 ms 3320 KB 
#include <bits/stdc++.h>
#include "meetings.h"
using namespace std;
/*
void Bridge(int a,int b)
{
    cout<<a<<" "<<b<<endl;
}
int Query(int a,int b,int c)
{
    cout<<a<<" "<<b<<" "<<c<<endl;
    int ret;
    cin>>ret;
    return ret;
}
*/
map< pair< pair<int,int>,int>,int> seen;

int ask(int a,int b,int c)
{
    if(a==b)return a;
    if(a==c)return a;
    if(b==c)return b;

    if(a>b)swap(a,b);
    if(a>c)swap(a,c);
    if(b>c)swap(b,c);

    pair< pair<int,int>,int> state={{a,b},c};

    if(seen.count(state))return seen[state];

    int d=Query(a,b,c);

    seen[state]=d;

    return d;
}
const int nmax=2e3+42;

vector< pair<int,int> > output;

void add_path(int a,int b)
{
    output.push_back({a,b});
}
int n;

mt19937 rng(42);

int a_now,b_now;

bool cmp(int u,int v)
{
    return ask(a_now,u,v)==u;
}
void solve(vector<int> active)
{
    if(active.size()<=1)return;

    shuffle(active.begin(),active.end(),rng);

    int a=active[rng()%active.size()],b=active[rng()%active.size()];

    while(a==b)a=active[rng()%active.size()],b=active[rng()%active.size()];

    //cout<<"a= "<<a<<" b= "<<b<<endl;

    vector<int> on_path={},remain={};

    for(auto k:active)
        if(k!=a&&k!=b)
        {
            if(ask(a,k,b)==k)on_path.push_back(k);
            else remain.push_back(k);
        }

    a_now=a;
    b_now=b;

    sort(on_path.begin(),on_path.end(),cmp);

    //cout<<a<<" ";for(auto k:on_path)cout<<k<<" ";cout<<b<<endl;

    on_path.insert(on_path.begin(),a);

    on_path.push_back(b);

    for(int i=1;i<on_path.size();i++)
        add_path(on_path[i-1],on_path[i]);

    map<int, vector<int> > would_be={};

    for(auto k:remain)
        would_be[ask(a,k,b)].push_back(k);

    for(auto k:would_be)
    {
        int node=k.first;

        vector<int> on_subtree=k.second;

        if(on_subtree.size()==0)continue;

        vector< vector<int> > subtrees={};

        for(auto w:on_subtree)
        {
            bool taken=0;

            for(int i=0;i<subtrees.size();i++)
                if(ask(node,subtrees[i].back(),w)!=node)
                {
                    subtrees[i].push_back(w);
                    taken=1;
                    break;
                }
            if(taken==0)
            {
                subtrees.push_back({w});
            }
        }

        for(auto subtree:subtrees)
        {
            solve(subtree);

            int sub_root=subtree[0];

            for(int j=1;j<subtree.size();j++)
                if(sub_root!=node)sub_root=ask(sub_root,node,subtree[j]);

            add_path(sub_root,node);
        }
    }
}
void Solve(int n)
{
    vector<int> active={};

    for(int i=0;i<n;i++)
        active.push_back(i);

    solve(active);

    for(auto k:output)
    {
        if(k.first>k.second)swap(k.first,k.second);

        Bridge(k.first,k.second);
    }
}
/*
int main()
{
    Solve(5);
}
*/

Compilation message

meetings.cpp: In function 'void solve(std::vector<int>)':
meetings.cpp:89:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=1;i<on_path.size();i++)
                 ~^~~~~~~~~~~~~~~
meetings.cpp:111:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int i=0;i<subtrees.size();i++)
                         ~^~~~~~~~~~~~~~~~
meetings.cpp:130:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int j=1;j<subtree.size();j++)
                         ~^~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 622 ms 2040 KB Output is correct
2 Correct 770 ms 2296 KB Output is correct
3 Correct 675 ms 2040 KB Output is correct
4 Correct 615 ms 2168 KB Output is correct
5 Correct 600 ms 1912 KB Output is correct
6 Correct 523 ms 2040 KB Output is correct
7 Correct 530 ms 2464 KB Output is correct
8 Correct 632 ms 2936 KB Output is correct
9 Correct 631 ms 3232 KB Output is correct
10 Correct 555 ms 3064 KB Output is correct
11 Correct 647 ms 3064 KB Output is correct
12 Correct 590 ms 1912 KB Output is correct
13 Correct 629 ms 2116 KB Output is correct
14 Correct 488 ms 2168 KB Output is correct
15 Correct 508 ms 2296 KB Output is correct
16 Correct 781 ms 3216 KB Output is correct
17 Correct 783 ms 3320 KB Output is correct
18 Correct 462 ms 2040 KB Output is correct
19 Correct 552 ms 2168 KB Output is correct
20 Correct 577 ms 2296 KB Output is correct
21 Correct 745 ms 2424 KB Output is correct
22 Correct 754 ms 2680 KB Output is correct
23 Correct 440 ms 1888 KB Output is correct
24 Correct 613 ms 2040 KB Output is correct
25 Correct 776 ms 2364 KB Output is correct
26 Correct 702 ms 2268 KB Output is correct
27 Correct 673 ms 1936 KB Output is correct
28 Correct 701 ms 3080 KB Output is correct
29 Correct 546 ms 3028 KB Output is correct
30 Correct 640 ms 3040 KB Output is correct
31 Correct 609 ms 3144 KB Output is correct
32 Correct 1179 ms 2736 KB Output is correct
33 Correct 829 ms 2424 KB Output is correct
34 Correct 11 ms 620 KB Output is correct
35 Correct 12 ms 624 KB Output is correct
36 Correct 14 ms 640 KB Output is correct
37 Correct 12 ms 640 KB Output is correct
38 Correct 14 ms 640 KB Output is correct
39 Correct 12 ms 640 KB Output is correct
40 Correct 18 ms 768 KB Output is correct
41 Correct 17 ms 768 KB Output is correct
42 Correct 18 ms 768 KB Output is correct
43 Correct 18 ms 640 KB Output is correct
44 Correct 19 ms 640 KB Output is correct
45 Correct 19 ms 656 KB Output is correct
46 Correct 17 ms 640 KB Output is correct
47 Correct 5 ms 432 KB Output is correct
48 Correct 5 ms 384 KB Output is correct
49 Correct 5 ms 384 KB Output is correct
50 Correct 5 ms 384 KB Output is correct
51 Correct 5 ms 384 KB Output is correct
52 Correct 5 ms 384 KB Output is correct
53 Correct 6 ms 384 KB Output is correct
54 Correct 5 ms 384 KB Output is correct
55 Correct 5 ms 384 KB Output is correct
56 Correct 5 ms 384 KB Output is correct
57 Correct 5 ms 384 KB Output is correct
58 Correct 5 ms 384 KB Output is correct
59 Correct 6 ms 384 KB Output is correct
60 Correct 4 ms 384 KB Output is correct
61 Correct 5 ms 416 KB Output is correct
62 Correct 5 ms 384 KB Output is correct
63 Correct 5 ms 384 KB Output is correct
64 Correct 4 ms 384 KB Output is correct
65 Correct 5 ms 384 KB Output is correct
66 Correct 5 ms 384 KB Output is correct
67 Correct 5 ms 384 KB Output is correct
68 Correct 5 ms 384 KB Output is correct
69 Correct 5 ms 384 KB Output is correct
70 Correct 5 ms 384 KB Output is correct
71 Correct 5 ms 384 KB Output is correct
72 Correct 5 ms 384 KB Output is correct