oj.uz

Submission #835019

# Submission time Handle Problem Language Result Execution time Memory
835019 2023-08-23T05:57:11 Z sunwukong123 Event Hopping 2 (JOI21_event2) C++14
8 / 100
 338 ms 258988 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long 
void debug_out() {cerr<<endl;}
template <typename Head, typename... Tail>
void debug_out(Head _H, Tail... _T) {cerr<<" "<<to_string(_H);debug_out(_T...);}
#define debug(...) cerr<<"["<<#__VA_ARGS__<<"]:",debug_out(__VA_ARGS__)
const int MAXN = 400005;
const int inf=1000000500ll;
const int oo =1000000000000000000ll;
const int MOD = (int)1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef pair<int,int> pi;
int n,k;
array<int,3> A[MAXN];
int rtwok[MAXN][20];
int ltwok[MAXN][20];
struct node1 {
	int s,e,m,val;
	node1 *l, *r;
	node1 (int _s, int _e){
		s=_s;e=_e;m=(s+e)/2;
		val=inf;
		if(s!=e){
			l=new node1(s,m);
			r=new node1(m+1,e);
		}
	}
	void update(int x, int nval){
		if(s==e){
			val=min(val,nval);
			return;
		}
		if(x>m)r->update(x,nval);
		else l->update(x,nval);
		val=min(l->val,r->val);
	}
	int query(int x, int y){
		if(s==x&&e==y){
			return val;
		}
		if(x>m)return r->query(x,y);
		else if(y<=m)return l->query(x,y);
		else return min(l->query(x,m), r->query(m+1,y));
	}
}*mnseg;
struct node2{
	int s,e,m,val;
	node2 *l, *r;
	node2 (int _s, int _e){
		s=_s;e=_e;m=(s+e)/2;
		val=-1;
		if(s!=e){
			l=new node2(s,m);
			r=new node2(m+1,e);
		}
	}
	void update(int x, int nval){
		if(s==e){
			val=max(val,nval);
			return;
		}
		if(x>m)r->update(x,nval);
		else l->update(x,nval);
		val=max(l->val,r->val);
	}
	int query(int x, int y){
		if(s==x&&e==y){
			return val;
		}
		if(x>m)return r->query(x,y);
		else if(y<=m)return l->query(x,y);
		else return max(l->query(x,m), r->query(m+1,y));
	}
}*mxseg;
map<int,int> to_n;
map<int,int> to_1;
struct fenw {
	int fw[MAXN], fw2[MAXN];
	void update(int x, int y, int v) { //inclusive
	    for (int tx=x; tx < MAXN; tx += tx&(-tx)) fw[tx] += v, fw2[tx] -= v*(x-1);
	    for (int ty=y+1; ty < MAXN; ty += ty&(-ty)) fw[ty] -= v, fw2[ty] += v*y; 
	}
	int sum (int x) {
	    int res = 0;
	    for (int tx=x; tx; tx -= tx&(-tx)) res += fw[tx]*x + fw2[tx];
	    return res;    
	}
	int range_sum(int x, int y) { //inclusive
	    return sum(y)-sum(x-1);
	}
}fw;
map<int,int> mapper;
int32_t main() 
{
	ios_base::sync_with_stdio(0); cin.tie(0);
	cin >> n >> k;
	int m=2*n+2;
	memset(rtwok,-1,sizeof rtwok);
	memset(ltwok,-1,sizeof ltwok);
	mnseg=new node1(0,m);
	mxseg=new node2(0,m);

	vector<pair<int,int>> in;
	vector<int> disc;
	for(int i=1;i<=n;i++){
		int a,b; cin >> a >> b;
		in.push_back({a,b});
		disc.push_back(a);
		disc.push_back(b);
	}
	sort(disc.begin(),disc.end());
	disc.resize(unique(disc.begin(),disc.end())-disc.begin());
	for(int i=0;i<(int)disc.size();i++){
		mapper[disc[i]]=i+1;
	}

	for(int i=1;i<=n;i++){

		A[i][0] = mapper[in[i-1].first];
		A[i][1] = mapper[in[i-1].second];

		A[i][2] = i;
	}
	for(int i=1;i<=n;i++){
		mnseg->update(A[i][0],A[i][1]);
		mxseg->update(A[i][1],A[i][0]);
	}
	for(int i=1;i<=m;i++){
		rtwok[i][0]=mnseg->query(i,m);
		if(rtwok[i][0]==inf)rtwok[i][0]=-1;
		ltwok[i][0]=mxseg->query(1,i);

	}
	for(int i=m;i>=1;i--){
		for(int j=1;j<=19;j++){
			if(rtwok[i][j-1] == -1)continue;
			rtwok[i][j]=rtwok[rtwok[i][j-1]][j-1];
		}
	}
	for(int i=1;i<=m;i++){
		for(int j=1;j<=19;++j){
			if(ltwok[i][j-1]==-1)continue;
			ltwok[i][j]=ltwok[ltwok[i][j-1]][j-1];
		}
	}
	vector<int>out;
	for(int i=1;i<=n;i++){
		int L=A[i][0], R=A[i][1];

		if(fw.range_sum(L,R-1)>0){
			continue;
		}
		
		auto it=to_n.lower_bound(R);
		pair<int,int> gn={m+1,0};
		if(it!=to_n.end())gn=*it;
		int sum = 1;
		int sumL = 0, sumR=0;
		for(int k=19;k>=0;k--){
			if(rtwok[R][k] != -1 && rtwok[R][k] <= gn.first){
				R=rtwok[R][k];
				sum+=(1<<k);
				sumR+=(1<<k);
			}
		}

		sumR+=gn.second;
		sum+=gn.second;

		it=to_1.upper_bound(L);
		pair<int,int> g1={0,0};
		if(it!=to_1.begin())g1=*prev(it);

		for(int k=19;k>=0;k--){

			if(ltwok[L][k] != -1 && ltwok[L][k] >= g1.first){
				L=ltwok[L][k];
				sum+=(1<<k);
				sumL+=(1<<k);
			}
		}

		sumL+=g1.second;
		sum+=g1.second;

		if(sum>=k && (int)out.size()<k){
			out.push_back(i);

			fw.update(A[i][0],A[i][1]-1,1);

			to_n[A[i][0]]=1+sumR;

			to_1[A[i][1]]=1+sumL;

		} 
	}
	if(out.empty())cout<<-1<<'\n';
	else{

		assert((int)out.size()==k);
		for(auto x:out)cout<<x<<"\n";
	}
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 125640 KB Output is correct
2 Correct 44 ms 125652 KB Output is correct
3 Correct 43 ms 125644 KB Output is correct
4 Correct 331 ms 210068 KB Output is correct
5 Correct 328 ms 210724 KB Output is correct
6 Correct 328 ms 209844 KB Output is correct
7 Correct 332 ms 208292 KB Output is correct
8 Correct 329 ms 211580 KB Output is correct
9 Correct 325 ms 210724 KB Output is correct
10 Correct 338 ms 209952 KB Output is correct
11 Correct 326 ms 208300 KB Output is correct
12 Correct 308 ms 206716 KB Output is correct
13 Correct 292 ms 206248 KB Output is correct
14 Correct 295 ms 205484 KB Output is correct
15 Correct 292 ms 204328 KB Output is correct
16 Correct 237 ms 200388 KB Output is correct
17 Correct 236 ms 200116 KB Output is correct
18 Correct 239 ms 199684 KB Output is correct
19 Correct 229 ms 198812 KB Output is correct
20 Correct 230 ms 198940 KB Output is correct
21 Correct 228 ms 198812 KB Output is correct
22 Correct 233 ms 198260 KB Output is correct
23 Correct 230 ms 198072 KB Output is correct
24 Correct 231 ms 197900 KB Output is correct
25 Correct 256 ms 195988 KB Output is correct
26 Correct 243 ms 196060 KB Output is correct
27 Correct 240 ms 195880 KB Output is correct
28 Correct 279 ms 195364 KB Output is correct
29 Correct 281 ms 195484 KB Output is correct
30 Correct 252 ms 195368 KB Output is correct
31 Correct 248 ms 195412 KB Output is correct
32 Correct 250 ms 195372 KB Output is correct
33 Correct 265 ms 195480 KB Output is correct
34 Correct 299 ms 202240 KB Output is correct
35 Correct 287 ms 199968 KB Output is correct
36 Correct 287 ms 197676 KB Output is correct
37 Correct 283 ms 205612 KB Output is correct
38 Correct 285 ms 205092 KB Output is correct
39 Correct 291 ms 204716 KB Output is correct
40 Correct 282 ms 204332 KB Output is correct
41 Correct 290 ms 203996 KB Output is correct
42 Correct 276 ms 195396 KB Output is correct
43 Correct 297 ms 205260 KB Output is correct
44 Correct 286 ms 204844 KB Output is correct
45 Correct 298 ms 204548 KB Output is correct
46 Correct 292 ms 203980 KB Output is correct

Subtask #2
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 125644 KB Output is correct
2 Correct 50 ms 125644 KB Output is correct
3 Correct 44 ms 125652 KB Output is correct
4 Correct 44 ms 125644 KB Output is correct
5 Correct 44 ms 125644 KB Output is correct
6 Correct 45 ms 125588 KB Output is correct
7 Correct 43 ms 125644 KB Output is correct
8 Correct 44 ms 125644 KB Output is correct
9 Correct 47 ms 125644 KB Output is correct
10 Correct 45 ms 125652 KB Output is correct
11 Correct 44 ms 125516 KB Output is correct
12 Correct 46 ms 125644 KB Output is correct
13 Correct 44 ms 125644 KB Output is correct
14 Correct 47 ms 125572 KB Output is correct
15 Correct 46 ms 125504 KB Output is correct
16 Correct 44 ms 125644 KB Output is correct
17 Correct 51 ms 125668 KB Output is correct
18 Correct 44 ms 125644 KB Output is correct
19 Correct 44 ms 125524 KB Output is correct
20 Correct 44 ms 125516 KB Output is correct
21 Correct 44 ms 125644 KB Output is correct
22 Correct 51 ms 125644 KB Output is correct
23 Correct 44 ms 125644 KB Output is correct
24 Correct 45 ms 125516 KB Output is correct
25 Correct 44 ms 125516 KB Output is correct
26 Correct 45 ms 125580 KB Output is correct
27 Correct 46 ms 125584 KB Output is correct

Subtask #3
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 125644 KB Output is correct
2 Correct 50 ms 125644 KB Output is correct
3 Correct 44 ms 125652 KB Output is correct
4 Correct 44 ms 125644 KB Output is correct
5 Correct 44 ms 125644 KB Output is correct
6 Correct 45 ms 125588 KB Output is correct
7 Correct 43 ms 125644 KB Output is correct
8 Correct 44 ms 125644 KB Output is correct
9 Correct 47 ms 125644 KB Output is correct
10 Correct 45 ms 125652 KB Output is correct
11 Correct 44 ms 125516 KB Output is correct
12 Correct 46 ms 125644 KB Output is correct
13 Correct 44 ms 125644 KB Output is correct
14 Correct 47 ms 125572 KB Output is correct
15 Correct 46 ms 125504 KB Output is correct
16 Correct 44 ms 125644 KB Output is correct
17 Correct 51 ms 125668 KB Output is correct
18 Correct 44 ms 125644 KB Output is correct
19 Correct 44 ms 125524 KB Output is correct
20 Correct 44 ms 125516 KB Output is correct
21 Correct 44 ms 125644 KB Output is correct
22 Correct 51 ms 125644 KB Output is correct
23 Correct 44 ms 125644 KB Output is correct
24 Correct 45 ms 125516 KB Output is correct
25 Correct 44 ms 125516 KB Output is correct
26 Correct 45 ms 125580 KB Output is correct
27 Correct 46 ms 125584 KB Output is correct
28 Correct 49 ms 127820 KB Output is correct
29 Correct 47 ms 127820 KB Output is correct
30 Runtime error 155 ms 258988 KB Execution killed with signal 6
31 Halted 0 ms 0 KB -

Subtask #4
0 / 61.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 125640 KB Output is correct
2 Correct 44 ms 125652 KB Output is correct
3 Correct 43 ms 125644 KB Output is correct
4 Correct 331 ms 210068 KB Output is correct
5 Correct 328 ms 210724 KB Output is correct
6 Correct 328 ms 209844 KB Output is correct
7 Correct 332 ms 208292 KB Output is correct
8 Correct 329 ms 211580 KB Output is correct
9 Correct 325 ms 210724 KB Output is correct
10 Correct 338 ms 209952 KB Output is correct
11 Correct 326 ms 208300 KB Output is correct
12 Correct 308 ms 206716 KB Output is correct
13 Correct 292 ms 206248 KB Output is correct
14 Correct 295 ms 205484 KB Output is correct
15 Correct 292 ms 204328 KB Output is correct
16 Correct 237 ms 200388 KB Output is correct
17 Correct 236 ms 200116 KB Output is correct
18 Correct 239 ms 199684 KB Output is correct
19 Correct 229 ms 198812 KB Output is correct
20 Correct 230 ms 198940 KB Output is correct
21 Correct 228 ms 198812 KB Output is correct
22 Correct 233 ms 198260 KB Output is correct
23 Correct 230 ms 198072 KB Output is correct
24 Correct 231 ms 197900 KB Output is correct
25 Correct 256 ms 195988 KB Output is correct
26 Correct 243 ms 196060 KB Output is correct
27 Correct 240 ms 195880 KB Output is correct
28 Correct 279 ms 195364 KB Output is correct
29 Correct 281 ms 195484 KB Output is correct
30 Correct 252 ms 195368 KB Output is correct
31 Correct 248 ms 195412 KB Output is correct
32 Correct 250 ms 195372 KB Output is correct
33 Correct 265 ms 195480 KB Output is correct
34 Correct 299 ms 202240 KB Output is correct
35 Correct 287 ms 199968 KB Output is correct
36 Correct 287 ms 197676 KB Output is correct
37 Correct 283 ms 205612 KB Output is correct
38 Correct 285 ms 205092 KB Output is correct
39 Correct 291 ms 204716 KB Output is correct
40 Correct 282 ms 204332 KB Output is correct
41 Correct 290 ms 203996 KB Output is correct
42 Correct 276 ms 195396 KB Output is correct
43 Correct 297 ms 205260 KB Output is correct
44 Correct 286 ms 204844 KB Output is correct
45 Correct 298 ms 204548 KB Output is correct
46 Correct 292 ms 203980 KB Output is correct
47 Correct 44 ms 125644 KB Output is correct
48 Correct 50 ms 125644 KB Output is correct
49 Correct 44 ms 125652 KB Output is correct
50 Correct 44 ms 125644 KB Output is correct
51 Correct 44 ms 125644 KB Output is correct
52 Correct 45 ms 125588 KB Output is correct
53 Correct 43 ms 125644 KB Output is correct
54 Correct 44 ms 125644 KB Output is correct
55 Correct 47 ms 125644 KB Output is correct
56 Correct 45 ms 125652 KB Output is correct
57 Correct 44 ms 125516 KB Output is correct
58 Correct 46 ms 125644 KB Output is correct
59 Correct 44 ms 125644 KB Output is correct
60 Correct 47 ms 125572 KB Output is correct
61 Correct 46 ms 125504 KB Output is correct
62 Correct 44 ms 125644 KB Output is correct
63 Correct 51 ms 125668 KB Output is correct
64 Correct 44 ms 125644 KB Output is correct
65 Correct 44 ms 125524 KB Output is correct
66 Correct 44 ms 125516 KB Output is correct
67 Correct 44 ms 125644 KB Output is correct
68 Correct 51 ms 125644 KB Output is correct
69 Correct 44 ms 125644 KB Output is correct
70 Correct 45 ms 125516 KB Output is correct
71 Correct 44 ms 125516 KB Output is correct
72 Correct 45 ms 125580 KB Output is correct
73 Correct 46 ms 125584 KB Output is correct
74 Correct 49 ms 127820 KB Output is correct
75 Correct 47 ms 127820 KB Output is correct
76 Runtime error 155 ms 258988 KB Execution killed with signal 6
77 Halted 0 ms 0 KB -