oj.uz

Submission #577293

# Submission time Handle Problem Language Result Execution time Memory
577293 2022-06-14T12:47:06 Z zaneyu Meetings (JOI19_meetings) C++14
100 / 100
 475 ms 1004 KB 
#include "meetings.h"
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
//order_of_key #of elements less than x
// find_by_order kth element
typedef long long int ll;
#define ld long double
#define pii pair<ll,int>
typedef tree<pii, null_type, less<pii>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
const ll maxn=2e5+5;
const ll maxlg=__lg(maxn)+2;
const ll INF64=4e18;
const int INF=0x3f3f3f3f;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld eps=1e-9;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
mt19937 rng(69);
namespace {
    bool in[maxn];
    
    int tmp[maxn];
    int a,b;
    vector<int> pv;
    void srt(int l,int r){
        if(l>=r) return;
        int mid=(l+r)/2;
        srt(l,mid),srt(mid+1,r);
        int p1=l,p2=mid+1;
        int p=0;
        while(p1<=mid and p2<=r){
            if(Query(a,pv[p1],pv[p2])==pv[p1]) tmp[p++]=pv[p1++];
            else tmp[p++]=pv[p2++];
        }
        while(p1<=mid) tmp[p++]=pv[p1++];
        while(p2<=r) tmp[p++]=pv[p2++];
        REP(i,r-l+1) pv[l+i]=tmp[i];
    }
    void rec(vector<int> v){
        if(sz(v)<=1) return;
        shuffle(ALL(v),rng);
        int p=(rng()%sz(v));
        map<int,vector<int>> cmpp;
        a=v[p],b=v[(p+1)%sz(v)];
        /*cout<<a<<'\n';
        for(int x:v) cout<<x<<' ';
        cout<<'\n';*/
        vector<int> vv;
        for(int x:v){
            if(x==a or x==b) continue;
            int asd=Query(a,b,x);
            if(asd==x){
                cmpp[x].pb(x);
                vv.pb(x);
            }
            else{
                cmpp[asd].pb(x);
            }
        }
        cmpp[a].pb(a),cmpp[b].pb(b);
        pv=vv;
        srt(0,sz(vv)-1);
        vv=pv;
        vv.emplace(vv.begin(),a);
        vv.pb(b);
        REP1(i,sz(vv)-1) Bridge(min(vv[i-1],vv[i]),max(vv[i-1],vv[i]));
        for(int x:vv){
            rec(cmpp[x]);
        }
    }
}

void Solve(int n) {
    vector<int> v;
    REP(i,n) v.pb(i);
    rec(v);
}

Compilation message

meetings.cpp:35:10: warning: '{anonymous}::in' defined but not used [-Wunused-variable]
   35 |     bool in[maxn];
      |          ^~

Subtask #1
7.0 / 7.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 286 ms 636 KB Output is correct
2 Correct 447 ms 672 KB Output is correct
3 Correct 352 ms 656 KB Output is correct
4 Correct 287 ms 756 KB Output is correct
5 Correct 191 ms 528 KB Output is correct
6 Correct 218 ms 624 KB Output is correct
7 Correct 334 ms 828 KB Output is correct
8 Correct 395 ms 676 KB Output is correct
9 Correct 340 ms 736 KB Output is correct
10 Correct 337 ms 564 KB Output is correct
11 Correct 348 ms 872 KB Output is correct
12 Correct 328 ms 756 KB Output is correct
13 Correct 147 ms 612 KB Output is correct
14 Correct 328 ms 700 KB Output is correct
15 Correct 286 ms 656 KB Output is correct
16 Correct 297 ms 604 KB Output is correct
17 Correct 331 ms 560 KB Output is correct
18 Correct 259 ms 560 KB Output is correct
19 Correct 289 ms 700 KB Output is correct
20 Correct 288 ms 648 KB Output is correct
21 Correct 323 ms 776 KB Output is correct
22 Correct 400 ms 668 KB Output is correct
23 Correct 292 ms 756 KB Output is correct
24 Correct 299 ms 864 KB Output is correct
25 Correct 364 ms 552 KB Output is correct
26 Correct 343 ms 700 KB Output is correct
27 Correct 296 ms 548 KB Output is correct
28 Correct 423 ms 584 KB Output is correct
29 Correct 351 ms 688 KB Output is correct
30 Correct 306 ms 664 KB Output is correct
31 Correct 416 ms 700 KB Output is correct
32 Correct 475 ms 1004 KB Output is correct
33 Correct 381 ms 888 KB Output is correct
34 Correct 4 ms 336 KB Output is correct
35 Correct 4 ms 336 KB Output is correct
36 Correct 6 ms 336 KB Output is correct
37 Correct 4 ms 336 KB Output is correct
38 Correct 3 ms 336 KB Output is correct
39 Correct 4 ms 336 KB Output is correct
40 Correct 9 ms 336 KB Output is correct
41 Correct 7 ms 420 KB Output is correct
42 Correct 8 ms 336 KB Output is correct
43 Correct 5 ms 336 KB Output is correct
44 Correct 8 ms 336 KB Output is correct
45 Correct 6 ms 336 KB Output is correct
46 Correct 7 ms 336 KB Output is correct
47 Correct 1 ms 336 KB Output is correct
48 Correct 1 ms 336 KB Output is correct
49 Correct 1 ms 336 KB Output is correct
50 Correct 1 ms 336 KB Output is correct
51 Correct 1 ms 336 KB Output is correct
52 Correct 1 ms 336 KB Output is correct
53 Correct 1 ms 336 KB Output is correct
54 Correct 0 ms 336 KB Output is correct
55 Correct 1 ms 336 KB Output is correct
56 Correct 1 ms 336 KB Output is correct
57 Correct 1 ms 336 KB Output is correct
58 Correct 1 ms 336 KB Output is correct
59 Correct 1 ms 336 KB Output is correct
60 Correct 0 ms 336 KB Output is correct
61 Correct 1 ms 336 KB Output is correct
62 Correct 1 ms 336 KB Output is correct
63 Correct 0 ms 336 KB Output is correct
64 Correct 0 ms 336 KB Output is correct
65 Correct 0 ms 336 KB Output is correct
66 Correct 0 ms 336 KB Output is correct
67 Correct 0 ms 336 KB Output is correct
68 Correct 0 ms 336 KB Output is correct
69 Correct 1 ms 336 KB Output is correct
70 Correct 0 ms 336 KB Output is correct
71 Correct 0 ms 336 KB Output is correct
72 Correct 1 ms 336 KB Output is correct