oj.uz

Submission #589803

# Submission time Handle Problem Language Result Execution time Memory
589803 2022-07-05T09:43:17 Z marcipan5000 Event Hopping 2 (JOI21_event2) C++14
100 / 100
 859 ms 51212 KB 
#include <bits/stdc++.h>

using namespace std;

struct event{
    int s;
    int a,b;
    int inda,indb;
};

struct break_point{
    int a;
    int ind;
};

int n,k;
vector<event> t;
event null_event;
vector<int> h[200005];
vector<break_point> g;
vector<break_point> gs;
break_point u;
int m;
map<int,int,less<int>> ass;
int p=0;
int lmin=1e9,rmax=-1;

bool kis(break_point x,break_point y) {
    return((x.a<y.a)||((x.a==y.a)&&(x.ind<y.ind)));
}

struct classcomp{
    bool operator() (const event x,const event y) const {
        return((x.a<y.a)||((x.a==y.a)&&(x.s<y.s)));
    }
};

int max_place(int l,int r) {
    int cur_ind=ass[l];
    if ((h[cur_ind].size()==0)||(g[h[cur_ind][0]].a>r)) {
        return(0);
    }
    int db=1,depth=1;
    while ((h[cur_ind].size()>depth)&&(g[h[cur_ind][depth]].a<=r)) {
        db=db*2; depth++;
    }
    return(max_place(g[h[cur_ind][depth-1]].a,r)+db);
}

bool intersect(event x,event y) {
    return(!((x.b<=y.a)||(x.a>=y.b)));
}

int ans;
int ans2;
set<event,classcomp> an;
set<event,classcomp>::iterator it;
int d,e;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> n >> k;
    null_event.s=0; null_event.a=0; null_event.b=0; null_event.inda=-1; null_event.indb=-1;
    t.assign(n+1,null_event);
    for (int i=1;i<=n;i++) {
        cin >> t[i].a >> t[i].b;
        lmin=min(lmin,t[i].a);
        rmax=max(rmax,t[i].b);
        t[i].s=i;
        if (ass.find(t[i].a)==ass.end()) {
            u.a=t[i].a; u.ind=p; g.push_back(u);
            ass[t[i].a]=p; p++;
        }
        t[i].inda=ass[t[i].a];
        if (ass.find(t[i].b)==ass.end()) {
            u.a=t[i].b; u.ind=p; g.push_back(u);
            ass[t[i].b]=p; p++;
        }
        t[i].indb=ass[t[i].b];
        if (h[t[i].inda].size()==0) {
            h[t[i].inda].push_back(t[i].indb);
        } else if (g[h[t[i].inda][0]].a>t[i].b) {
            h[t[i].inda][0]=t[i].indb;
        }
    }
    gs=g;
    m=g.size();
    sort(gs.begin(),gs.end(),kis);
    for (int i=m-2;i>=0;i--) {
        if (h[gs[i+1].ind].size()>0) {
            if (h[gs[i].ind].size()==0) {
                h[gs[i].ind].push_back(h[gs[i+1].ind][0]);
            } else if (g[h[gs[i+1].ind][0]].a<g[h[gs[i].ind][0]].a) {
                h[gs[i].ind][0]=h[gs[i+1].ind][0];
            }
        }
    }
    for (int j=1;j<=100;j++) {
        for (int i=0;i<m;i++) {
            if (h[gs[i].ind].size()<j) {
                break;
            }
            if (h[h[gs[i].ind][j-1]].size()<j) {
                break;
            }
            h[gs[i].ind].push_back(h[h[gs[i].ind][j-1]][j-1]);
        }
    }

    /*
    for (int i=0;i<m;i++) {
        cout << i << ": " << gs[i].a << " " << gs[i].ind << " jumps: ";
        for (int j:h[gs[i].ind]) {
            cout << g[j].a << " ";
        }
        cout << endl;
    }

    int d,e;
    while (true) {
        cin >> d >> e;
        cout << max_place(d,e) << endl;
    }
    */

    ans=max_place(lmin,rmax);
    if (ans<k) {
        cout << -1 << endl;
        return(0);
    }

    event z;
    z.a=-1e9;
    z.b=lmin;
    z.s=-1;
    an.insert(z);
    z.a=rmax;
    z.b=1e9+1;
    z.s=-2;
    an.insert(z);

    //cout << lmin << " " << rmax << endl;

    for (int i=1;i<=n;i++) {
        ans2=ans;
        it=an.lower_bound(t[i]);
        //cout << i << " " << (*it).s << endl;
        //cout << (it==an.end()) << endl;
        if (intersect(*it,t[i])) {
            continue;
        }
        e=(*it).a;
        it--;
        //cout << i << " " << (*it).s << endl;
        if (intersect(*it,t[i])) {
            continue;
        }
        d=(*it).b;
        ans2-=max_place(d,e);
        ans2+=1;
        ans2+=max_place(d,t[i].a);
        ans2+=max_place(t[i].b,e);
        if (ans2>=k) {
            an.insert(t[i]);
            ans=ans2;
        }
        if (an.size()==2+k) {
            break;
        }

        //cout << ans << " " << ans2 << endl;
    }
    vector<int> kiir;
    for (event i:an) {
        if (i.s>0) {
            kiir.push_back(i.s);
        }
    }
    sort(kiir.begin(),kiir.end());
    for (int i:kiir) {
        cout << i << endl;
    }
    return 0;
}

/*
5 4
1 3
2 5
8 9
6 8
10 15
*/

Compilation message

event2.cpp: In function 'int max_place(int, int)':
event2.cpp:44:30: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   44 |     while ((h[cur_ind].size()>depth)&&(g[h[cur_ind][depth]].a<=r)) {
      |             ~~~~~~~~~~~~~~~~~^~~~~~
event2.cpp: In function 'int main()':
event2.cpp:102:36: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  102 |             if (h[gs[i].ind].size()<j) {
      |                 ~~~~~~~~~~~~~~~~~~~^~
event2.cpp:105:44: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  105 |             if (h[h[gs[i].ind][j-1]].size()<j) {
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
event2.cpp:169:22: warning: comparison of integer expressions of different signedness: 'std::set<event, classcomp>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  169 |         if (an.size()==2+k) {
      |             ~~~~~~~~~^~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 577 ms 49228 KB Output is correct
5 Correct 588 ms 48880 KB Output is correct
6 Correct 609 ms 48540 KB Output is correct
7 Correct 508 ms 47824 KB Output is correct
8 Correct 537 ms 49172 KB Output is correct
9 Correct 580 ms 48808 KB Output is correct
10 Correct 562 ms 48552 KB Output is correct
11 Correct 535 ms 47804 KB Output is correct
12 Correct 415 ms 42580 KB Output is correct
13 Correct 424 ms 42388 KB Output is correct
14 Correct 411 ms 42172 KB Output is correct
15 Correct 363 ms 41772 KB Output is correct
16 Correct 245 ms 39128 KB Output is correct
17 Correct 262 ms 39020 KB Output is correct
18 Correct 227 ms 38952 KB Output is correct
19 Correct 210 ms 37364 KB Output is correct
20 Correct 203 ms 37388 KB Output is correct
21 Correct 171 ms 37316 KB Output is correct
22 Correct 169 ms 31468 KB Output is correct
23 Correct 162 ms 31380 KB Output is correct
24 Correct 168 ms 31468 KB Output is correct
25 Correct 151 ms 26340 KB Output is correct
26 Correct 152 ms 26276 KB Output is correct
27 Correct 151 ms 26240 KB Output is correct
28 Correct 203 ms 41952 KB Output is correct
29 Correct 179 ms 38300 KB Output is correct
30 Correct 174 ms 38144 KB Output is correct
31 Correct 204 ms 37284 KB Output is correct
32 Correct 170 ms 31460 KB Output is correct
33 Correct 155 ms 26232 KB Output is correct
34 Correct 299 ms 40980 KB Output is correct
35 Correct 273 ms 40044 KB Output is correct
36 Correct 212 ms 39072 KB Output is correct
37 Correct 452 ms 42176 KB Output is correct
38 Correct 436 ms 41900 KB Output is correct
39 Correct 436 ms 41752 KB Output is correct
40 Correct 472 ms 41632 KB Output is correct
41 Correct 433 ms 41532 KB Output is correct
42 Correct 176 ms 38280 KB Output is correct
43 Correct 373 ms 41980 KB Output is correct
44 Correct 387 ms 41752 KB Output is correct
45 Correct 360 ms 41580 KB Output is correct
46 Correct 363 ms 41448 KB Output is correct

Subtask #2
1.0 / 1.0

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

Subtask #3
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 4 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 4 ms 5020 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 5020 KB Output is correct
10 Correct 4 ms 4948 KB Output is correct
11 Correct 2 ms 5020 KB Output is correct
12 Correct 3 ms 5020 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 3 ms 5024 KB Output is correct
16 Correct 3 ms 4948 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 2 ms 4948 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 3 ms 4948 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct
23 Correct 3 ms 4948 KB Output is correct
24 Correct 3 ms 4948 KB Output is correct
25 Correct 3 ms 4948 KB Output is correct
26 Correct 3 ms 4948 KB Output is correct
27 Correct 3 ms 4948 KB Output is correct
28 Correct 9 ms 5820 KB Output is correct
29 Correct 7 ms 5844 KB Output is correct
30 Correct 8 ms 5800 KB Output is correct
31 Correct 10 ms 5844 KB Output is correct
32 Correct 8 ms 5844 KB Output is correct
33 Correct 9 ms 5844 KB Output is correct
34 Correct 8 ms 5804 KB Output is correct
35 Correct 15 ms 6220 KB Output is correct
36 Correct 15 ms 6228 KB Output is correct
37 Correct 15 ms 6100 KB Output is correct
38 Correct 9 ms 6100 KB Output is correct
39 Correct 13 ms 6140 KB Output is correct
40 Correct 15 ms 6136 KB Output is correct
41 Correct 12 ms 6188 KB Output is correct
42 Correct 9 ms 6056 KB Output is correct
43 Correct 11 ms 6108 KB Output is correct
44 Correct 12 ms 6092 KB Output is correct
45 Correct 13 ms 6052 KB Output is correct
46 Correct 8 ms 5972 KB Output is correct
47 Correct 10 ms 5804 KB Output is correct
48 Correct 8 ms 5844 KB Output is correct
49 Correct 7 ms 5856 KB Output is correct
50 Correct 7 ms 5844 KB Output is correct
51 Correct 8 ms 5716 KB Output is correct
52 Correct 8 ms 5672 KB Output is correct
53 Correct 7 ms 5716 KB Output is correct
54 Correct 9 ms 5716 KB Output is correct
55 Correct 12 ms 5844 KB Output is correct
56 Correct 12 ms 5800 KB Output is correct
57 Correct 12 ms 5888 KB Output is correct
58 Correct 12 ms 5844 KB Output is correct
59 Correct 11 ms 5844 KB Output is correct
60 Correct 14 ms 5928 KB Output is correct
61 Correct 11 ms 5804 KB Output is correct
62 Correct 11 ms 5852 KB Output is correct
63 Correct 10 ms 5788 KB Output is correct
64 Correct 6 ms 5688 KB Output is correct

Subtask #4
61.0 / 61.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 577 ms 49228 KB Output is correct
5 Correct 588 ms 48880 KB Output is correct
6 Correct 609 ms 48540 KB Output is correct
7 Correct 508 ms 47824 KB Output is correct
8 Correct 537 ms 49172 KB Output is correct
9 Correct 580 ms 48808 KB Output is correct
10 Correct 562 ms 48552 KB Output is correct
11 Correct 535 ms 47804 KB Output is correct
12 Correct 415 ms 42580 KB Output is correct
13 Correct 424 ms 42388 KB Output is correct
14 Correct 411 ms 42172 KB Output is correct
15 Correct 363 ms 41772 KB Output is correct
16 Correct 245 ms 39128 KB Output is correct
17 Correct 262 ms 39020 KB Output is correct
18 Correct 227 ms 38952 KB Output is correct
19 Correct 210 ms 37364 KB Output is correct
20 Correct 203 ms 37388 KB Output is correct
21 Correct 171 ms 37316 KB Output is correct
22 Correct 169 ms 31468 KB Output is correct
23 Correct 162 ms 31380 KB Output is correct
24 Correct 168 ms 31468 KB Output is correct
25 Correct 151 ms 26340 KB Output is correct
26 Correct 152 ms 26276 KB Output is correct
27 Correct 151 ms 26240 KB Output is correct
28 Correct 203 ms 41952 KB Output is correct
29 Correct 179 ms 38300 KB Output is correct
30 Correct 174 ms 38144 KB Output is correct
31 Correct 204 ms 37284 KB Output is correct
32 Correct 170 ms 31460 KB Output is correct
33 Correct 155 ms 26232 KB Output is correct
34 Correct 299 ms 40980 KB Output is correct
35 Correct 273 ms 40044 KB Output is correct
36 Correct 212 ms 39072 KB Output is correct
37 Correct 452 ms 42176 KB Output is correct
38 Correct 436 ms 41900 KB Output is correct
39 Correct 436 ms 41752 KB Output is correct
40 Correct 472 ms 41632 KB Output is correct
41 Correct 433 ms 41532 KB Output is correct
42 Correct 176 ms 38280 KB Output is correct
43 Correct 373 ms 41980 KB Output is correct
44 Correct 387 ms 41752 KB Output is correct
45 Correct 360 ms 41580 KB Output is correct
46 Correct 363 ms 41448 KB Output is correct
47 Correct 3 ms 4948 KB Output is correct
48 Correct 3 ms 4948 KB Output is correct
49 Correct 3 ms 4948 KB Output is correct
50 Correct 3 ms 4948 KB Output is correct
51 Correct 4 ms 4948 KB Output is correct
52 Correct 3 ms 4948 KB Output is correct
53 Correct 4 ms 5020 KB Output is correct
54 Correct 3 ms 4948 KB Output is correct
55 Correct 3 ms 5020 KB Output is correct
56 Correct 4 ms 4948 KB Output is correct
57 Correct 2 ms 5020 KB Output is correct
58 Correct 3 ms 5020 KB Output is correct
59 Correct 3 ms 4948 KB Output is correct
60 Correct 3 ms 4948 KB Output is correct
61 Correct 3 ms 5024 KB Output is correct
62 Correct 3 ms 4948 KB Output is correct
63 Correct 3 ms 4948 KB Output is correct
64 Correct 2 ms 4948 KB Output is correct
65 Correct 3 ms 4948 KB Output is correct
66 Correct 3 ms 4948 KB Output is correct
67 Correct 3 ms 4948 KB Output is correct
68 Correct 3 ms 4948 KB Output is correct
69 Correct 3 ms 4948 KB Output is correct
70 Correct 3 ms 4948 KB Output is correct
71 Correct 3 ms 4948 KB Output is correct
72 Correct 3 ms 4948 KB Output is correct
73 Correct 3 ms 4948 KB Output is correct
74 Correct 9 ms 5820 KB Output is correct
75 Correct 7 ms 5844 KB Output is correct
76 Correct 8 ms 5800 KB Output is correct
77 Correct 10 ms 5844 KB Output is correct
78 Correct 8 ms 5844 KB Output is correct
79 Correct 9 ms 5844 KB Output is correct
80 Correct 8 ms 5804 KB Output is correct
81 Correct 15 ms 6220 KB Output is correct
82 Correct 15 ms 6228 KB Output is correct
83 Correct 15 ms 6100 KB Output is correct
84 Correct 9 ms 6100 KB Output is correct
85 Correct 13 ms 6140 KB Output is correct
86 Correct 15 ms 6136 KB Output is correct
87 Correct 12 ms 6188 KB Output is correct
88 Correct 9 ms 6056 KB Output is correct
89 Correct 11 ms 6108 KB Output is correct
90 Correct 12 ms 6092 KB Output is correct
91 Correct 13 ms 6052 KB Output is correct
92 Correct 8 ms 5972 KB Output is correct
93 Correct 10 ms 5804 KB Output is correct
94 Correct 8 ms 5844 KB Output is correct
95 Correct 7 ms 5856 KB Output is correct
96 Correct 7 ms 5844 KB Output is correct
97 Correct 8 ms 5716 KB Output is correct
98 Correct 8 ms 5672 KB Output is correct
99 Correct 7 ms 5716 KB Output is correct
100 Correct 9 ms 5716 KB Output is correct
101 Correct 12 ms 5844 KB Output is correct
102 Correct 12 ms 5800 KB Output is correct
103 Correct 12 ms 5888 KB Output is correct
104 Correct 12 ms 5844 KB Output is correct
105 Correct 11 ms 5844 KB Output is correct
106 Correct 14 ms 5928 KB Output is correct
107 Correct 11 ms 5804 KB Output is correct
108 Correct 11 ms 5852 KB Output is correct
109 Correct 10 ms 5788 KB Output is correct
110 Correct 6 ms 5688 KB Output is correct
111 Correct 375 ms 35760 KB Output is correct
112 Correct 345 ms 35808 KB Output is correct
113 Correct 384 ms 35772 KB Output is correct
114 Correct 353 ms 35628 KB Output is correct
115 Correct 334 ms 35616 KB Output is correct
116 Correct 348 ms 35716 KB Output is correct
117 Correct 361 ms 35744 KB Output is correct
118 Correct 859 ms 51212 KB Output is correct
119 Correct 773 ms 50508 KB Output is correct
120 Correct 560 ms 43740 KB Output is correct
121 Correct 342 ms 40132 KB Output is correct
122 Correct 635 ms 44536 KB Output is correct
123 Correct 567 ms 44280 KB Output is correct
124 Correct 623 ms 43776 KB Output is correct
125 Correct 351 ms 40220 KB Output is correct
126 Correct 516 ms 41076 KB Output is correct
127 Correct 425 ms 40916 KB Output is correct
128 Correct 440 ms 40788 KB Output is correct
129 Correct 351 ms 40116 KB Output is correct
130 Correct 388 ms 39312 KB Output is correct
131 Correct 389 ms 39388 KB Output is correct
132 Correct 401 ms 39208 KB Output is correct
133 Correct 367 ms 39176 KB Output is correct
134 Correct 341 ms 33468 KB Output is correct
135 Correct 339 ms 33572 KB Output is correct
136 Correct 341 ms 33452 KB Output is correct
137 Correct 321 ms 33468 KB Output is correct
138 Correct 293 ms 28600 KB Output is correct
139 Correct 335 ms 28660 KB Output is correct
140 Correct 298 ms 28608 KB Output is correct
141 Correct 307 ms 28604 KB Output is correct
142 Correct 558 ms 36004 KB Output is correct
143 Correct 573 ms 36036 KB Output is correct
144 Correct 563 ms 35952 KB Output is correct
145 Correct 425 ms 36036 KB Output is correct
146 Correct 424 ms 35808 KB Output is correct
147 Correct 428 ms 35744 KB Output is correct
148 Correct 416 ms 35548 KB Output is correct
149 Correct 413 ms 35364 KB Output is correct
150 Correct 413 ms 35312 KB Output is correct
151 Correct 376 ms 34576 KB Output is correct
152 Correct 112 ms 28420 KB Output is correct
153 Correct 431 ms 35964 KB Output is correct
154 Correct 407 ms 35796 KB Output is correct
155 Correct 433 ms 35704 KB Output is correct
156 Correct 408 ms 35480 KB Output is correct
157 Correct 468 ms 35364 KB Output is correct
158 Correct 416 ms 35408 KB Output is correct
159 Correct 369 ms 34500 KB Output is correct
160 Correct 126 ms 28380 KB Output is correct
161 Correct 574 ms 37004 KB Output is correct
162 Correct 460 ms 36892 KB Output is correct
163 Correct 493 ms 36644 KB Output is correct
164 Correct 484 ms 36604 KB Output is correct
165 Correct 434 ms 36448 KB Output is correct
166 Correct 176 ms 40140 KB Output is correct
167 Correct 365 ms 43916 KB Output is correct
168 Correct 357 ms 43752 KB Output is correct
169 Correct 364 ms 43632 KB Output is correct
170 Correct 332 ms 43484 KB Output is correct
171 Correct 451 ms 43380 KB Output is correct
172 Correct 356 ms 44064 KB Output is correct
173 Correct 468 ms 28680 KB Output is correct
174 Correct 425 ms 28692 KB Output is correct
175 Correct 473 ms 28652 KB Output is correct
176 Correct 362 ms 28044 KB Output is correct