oj.uz

Submission #559802

# Submission time Handle Problem Language Result Execution time Memory
559802 2022-05-10T15:39:46 Z fcmalkcin Meetings (JOI19_meetings) C++17
100 / 100
 713 ms 3300 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll  int
#define pll pair<ll,ll>
#define ff first
#define ss second
#define pb push_back
//#define endl "\n"
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());

const ll maxn=1e5+50;
const ll mod=1e9+7  ;
const ll base=1e18;

#include "meetings.h"

/// i believe myself
/// goal 1/7
/*ll Query(ll l,ll r,ll t)
{
    cout <<l<<" "<<r<<" "<<t<<endl;
    ll x;
    cin>> x;
    return x;
}
void Bridge(ll x,ll y)
{
    cout <<"! "<<x<<" "<<y<<endl;
}*/
long long rd(long long l,long long r)
{
    return abs((long long)rnd())%(r-l+1)+l;
}
vector<ll> gr[maxn];
ll st;
vector<ll> dosth1(vector<ll> vt)
{
    if (vt.size()<=1)
        return vt;
    vector<ll> vt1;
    vector<ll> vt2;
    ll len=vt.size()/2;
    for (int i=0; i<len; i++)
        vt1.pb(vt[i]);
    for (int i=len; i<vt.size(); i++)
        vt2.pb(vt[i]);
    vt1=dosth1(vt1);
    vt2=dosth1(vt2);
    ll id1=0;
    ll id2=0;
    vector<ll> res;
    while (id1<vt1.size()&&id2<vt2.size())
    {
        if (Query(st,vt1[id1],vt2[id2])==vt1[id1])
            res.pb(vt1[id1]),id1++;
        else
            res.pb(vt2[id2]),id2++;
    }
    while (id1<vt1.size())
    {
        res.pb(vt1[id1]),id1++;
    }
    while (id2<vt2.size())
    {
        res.pb(vt2[id2]),id2++;
    }
    return res;
}
void bridge(ll x,ll y)
{
    if (x>y)
        swap(x,y);
    Bridge(x,y);
}
void dosth(vector<ll> vt)
{
    if (vt.size()<=1)
        return ;
    if (vt.size()==2)
    {
        bridge(vt[0],vt[1]);
        return ;
    }
    //  cout <<vt.size()<<" wtf"<<endl;
    ll n=vt.size();
    ll l=rd(0,n-1);
    ll r=rd(0,n-1);
    while (r==l)
        r=rd(0,n-1);
    l=vt[l];
    r=vt[r];
    vector<ll> vt1;
    st=l ;
    for (auto to:vt)
    {
        if (to==l||to==r)
            continue;
        ll h=Query(l,r,to);
        if (h==to)
        {
            vt1.pb(to);
        }
        else
        {
            gr[h].pb(to);
        }
    }
    vt1=dosth1(vt1);
    for (int i=0; i<vt1.size(); i++)
    {
        if (i==0)
            bridge(vt1[i],st);
        else
            bridge(vt1[i],vt1[i-1]);
    }
    if (vt1.size())
        bridge(vt1.back(),r);
    else
        bridge(l,r);
    vt1.pb(l);
    vt1.pb(r);
    for (auto to:vt1)
    {
        if (gr[to].size())
        {
            vector<ll> vt2=gr[to];
            vt2.pb(to);
            gr[to].clear();
            dosth(vt2);
        }
    }
}
void Solve(ll n)
{
    vector<ll> vt;
    for (int i=0; i<=n-1; i++)
        vt.pb(i);
    dosth(vt);
}
/*int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    if (fopen("t.inp", "r"))
    {
        freopen("test.inp", "r", stdin);
        freopen("test.out", "w", stdout);
    }
    Solve(5);
}*/

/*5
0 1 1
0 2 4
0 3 3
2 4 2
*/

Compilation message

meetings.cpp:14:15: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
   14 | const ll base=1e18;
      |               ^~~~
meetings.cpp: In function 'std::vector<int> dosth1(std::vector<int>)':
meetings.cpp:46:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |     for (int i=len; i<vt.size(); i++)
      |                     ~^~~~~~~~~~
meetings.cpp:53:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |     while (id1<vt1.size()&&id2<vt2.size())
      |            ~~~^~~~~~~~~~~
meetings.cpp:53:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |     while (id1<vt1.size()&&id2<vt2.size())
      |                            ~~~^~~~~~~~~~~
meetings.cpp:60:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   60 |     while (id1<vt1.size())
      |            ~~~^~~~~~~~~~~
meetings.cpp:64:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   64 |     while (id2<vt2.size())
      |            ~~~^~~~~~~~~~~
meetings.cpp: In function 'void dosth(std::vector<int>)':
meetings.cpp:110:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  110 |     for (int i=0; i<vt1.size(); i++)
      |                   ~^~~~~~~~~~~

Subtask #1
7.0 / 7.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 364 ms 3028 KB Output is correct
2 Correct 339 ms 3012 KB Output is correct
3 Correct 424 ms 3068 KB Output is correct
4 Correct 400 ms 3032 KB Output is correct
5 Correct 334 ms 2988 KB Output is correct
6 Correct 236 ms 2932 KB Output is correct
7 Correct 449 ms 3016 KB Output is correct
8 Correct 402 ms 3040 KB Output is correct
9 Correct 380 ms 3152 KB Output is correct
10 Correct 323 ms 3020 KB Output is correct
11 Correct 406 ms 3044 KB Output is correct
12 Correct 384 ms 3056 KB Output is correct
13 Correct 233 ms 3156 KB Output is correct
14 Correct 311 ms 2964 KB Output is correct
15 Correct 287 ms 3300 KB Output is correct
16 Correct 234 ms 3084 KB Output is correct
17 Correct 367 ms 3040 KB Output is correct
18 Correct 230 ms 3120 KB Output is correct
19 Correct 254 ms 2980 KB Output is correct
20 Correct 353 ms 3176 KB Output is correct
21 Correct 398 ms 3092 KB Output is correct
22 Correct 342 ms 2980 KB Output is correct
23 Correct 364 ms 3036 KB Output is correct
24 Correct 376 ms 3000 KB Output is correct
25 Correct 341 ms 2948 KB Output is correct
26 Correct 301 ms 2988 KB Output is correct
27 Correct 293 ms 3016 KB Output is correct
28 Correct 379 ms 3008 KB Output is correct
29 Correct 354 ms 3096 KB Output is correct
30 Correct 373 ms 3156 KB Output is correct
31 Correct 403 ms 3096 KB Output is correct
32 Correct 713 ms 3044 KB Output is correct
33 Correct 409 ms 3124 KB Output is correct
34 Correct 8 ms 2768 KB Output is correct
35 Correct 5 ms 2640 KB Output is correct
36 Correct 6 ms 2640 KB Output is correct
37 Correct 5 ms 2728 KB Output is correct
38 Correct 8 ms 2640 KB Output is correct
39 Correct 6 ms 2768 KB Output is correct
40 Correct 10 ms 2748 KB Output is correct
41 Correct 10 ms 2752 KB Output is correct
42 Correct 11 ms 2768 KB Output is correct
43 Correct 4 ms 2640 KB Output is correct
44 Correct 9 ms 2768 KB Output is correct
45 Correct 9 ms 2752 KB Output is correct
46 Correct 6 ms 2768 KB Output is correct
47 Correct 2 ms 2708 KB Output is correct
48 Correct 1 ms 2640 KB Output is correct
49 Correct 2 ms 2640 KB Output is correct
50 Correct 2 ms 2640 KB Output is correct
51 Correct 2 ms 2640 KB Output is correct
52 Correct 1 ms 2640 KB Output is correct
53 Correct 2 ms 2640 KB Output is correct
54 Correct 3 ms 2640 KB Output is correct
55 Correct 2 ms 2640 KB Output is correct
56 Correct 2 ms 2640 KB Output is correct
57 Correct 2 ms 2640 KB Output is correct
58 Correct 2 ms 2640 KB Output is correct
59 Correct 2 ms 2640 KB Output is correct
60 Correct 1 ms 2640 KB Output is correct
61 Correct 1 ms 2640 KB Output is correct
62 Correct 2 ms 2640 KB Output is correct
63 Correct 2 ms 2640 KB Output is correct
64 Correct 2 ms 2640 KB Output is correct
65 Correct 2 ms 2640 KB Output is correct
66 Correct 1 ms 2640 KB Output is correct
67 Correct 1 ms 2640 KB Output is correct
68 Correct 2 ms 2640 KB Output is correct
69 Correct 2 ms 2640 KB Output is correct
70 Correct 1 ms 2640 KB Output is correct
71 Correct 2 ms 2640 KB Output is correct
72 Correct 2 ms 2640 KB Output is correct