oj.uz

Submission #563102

# Submission time Handle Problem Language Result Execution time Memory
563102 2022-05-16T08:44:55 Z amunduzbaev Arranging Tickets (JOI17_arranging_tickets) C++17
10 / 100
 212 ms 12876 KB 
#include "bits/stdc++.h"
using namespace std;
 
#define ar array
#define int long long

const int N = 2e5 + 5;

struct ST{
	int tree[N << 2], P[N << 2];
	
	void flush(){
		memset(tree, 0, sizeof tree);
		memset(P, 0, sizeof P);
	}
	
	void push(int x, int lx, int rx){
		if(lx == rx) return;
		tree[x<<1] += P[x], P[x<<1] += P[x];
		tree[x<<1|1] += P[x], P[x<<1|1] += P[x];
		P[x] = 0;
	}
	
	void add(int l, int r, int v, int lx = 0, int rx = N, int x = 1){
		if(lx > r || rx < l) return;
		if(lx >= l && rx <= r){
			tree[x] += v, P[x] += v;
			return;
		} int m = (lx + rx) >> 1;
		push(x, lx, rx);
		add(l, r, v, lx, m, x<<1), 
		add(l, r, v, m+1, rx, x<<1|1);
		tree[x] = max(tree[x<<1], tree[x<<1|1]);
	}
	
	int get(int l, int r, int lx = 0, int rx = N, int x = 1){
		if(lx > r || rx < l) return 0;
		if(lx >= l && rx <= r) return tree[x];
		int m = (lx + rx) >> 1;
		push(x, lx, rx);
		return max(get(l, r, lx, m, x<<1), get(l, r, m+1, rx, x<<1|1));
	}
}tree;
 
signed main(){
	ios::sync_with_stdio(0); cin.tie(0);
	
	int n, m; cin>>n>>m;
	vector<int> l(m), r(m), c(m);
	for(int i=0;i<m;i++){
		cin>>l[i]>>r[i]>>c[i];
		if(l[i] > r[i]) swap(l[i], r[i]);
		r[i]--;
	}
	
	auto check = [&](int mx){
		vector<ar<int, 2>> tt;
		tree.flush();
		for(int i=0;i<m;i++){
			tt.push_back({l[i], i + 1});
			tt.push_back({r[i] + 1, -i - 1});
			tree.add(l[i], r[i], 1);
		}
		sort(tt.begin(), tt.end());
		bool ans = false;
		vector<int> used(m), is(m);
		for(int i=0, j=0;i<(int)tt.size();){
			while(j < (int)tt.size() && tt[j][0] == tt[i][0]){
				int in = abs(tt[j][1]) - 1;
				if(tt[j][1] > 0) used[in] = 1;
				else used[in] = 0;
				tree.add(l[in], r[in], (used[in] ? -1 : 1));
				j++;
			}
			
			vector<int> p;
			for(int k=0;k<m;k++){
				if(used[k]) p.push_back(k);
			}
			sort(p.begin(), p.end(), [&](int i, int j){
				if(l[i] != l[j]) return l[i] < l[j];
				return r[i] > r[j];
			});
			
			for(auto j : p){
				if(tree.get(0, l[j] - 1) < mx && tree.get(r[j] + 1, n) < mx){
					is[j] = 1;
					tree.add(0, l[j] - 1, 1);
					tree.add(r[j] + 1, n, 1);
				} else tree.add(l[j], r[j], 1);
			}
			//~ for(int i=0;i<=n;i++) cout<<tree.get(i, i)<<" ";
			//~ cout<<"\n";
			if(tree.get(0, N) <= mx) { ans = true; break; }
			//~ for(int i=1;i<=n;i++) cout<<tree.get(i, i)<<" ";
			//~ cout<<"\n";

			for(auto j : p){
				if(is[j]){
					is[j] = 0;
					tree.add(0, l[j] - 1, -1);
					tree.add(r[j] + 1, n, -1);
				} else tree.add(l[j], r[j], -1);
			}
			
			i = j;
		}
		
		return ans;
	};
	//~ check(3);
	int lx = 1, rx = m;
	while(lx < rx){
		int m = (lx + rx) >> 1;
		if(check(m)) rx = m;
		else lx = m + 1;
	}
	
	cout<<lx<<"\n";
}

/*

7 5
4 6 1
4 7 1
3 7 1
4 6 1
2 7 1

answer is 3

*/

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 12756 KB Output is correct
2 Correct 11 ms 12756 KB Output is correct
3 Correct 11 ms 12744 KB Output is correct
4 Correct 10 ms 12756 KB Output is correct
5 Correct 12 ms 12748 KB Output is correct
6 Correct 10 ms 12756 KB Output is correct
7 Correct 12 ms 12852 KB Output is correct
8 Correct 10 ms 12848 KB Output is correct
9 Correct 10 ms 12756 KB Output is correct
10 Correct 10 ms 12756 KB Output is correct
11 Correct 9 ms 12756 KB Output is correct
12 Correct 10 ms 12756 KB Output is correct
13 Correct 9 ms 12756 KB Output is correct
14 Correct 10 ms 12756 KB Output is correct
15 Correct 10 ms 12756 KB Output is correct

Subtask #2
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 12756 KB Output is correct
2 Correct 11 ms 12756 KB Output is correct
3 Correct 11 ms 12744 KB Output is correct
4 Correct 10 ms 12756 KB Output is correct
5 Correct 12 ms 12748 KB Output is correct
6 Correct 10 ms 12756 KB Output is correct
7 Correct 12 ms 12852 KB Output is correct
8 Correct 10 ms 12848 KB Output is correct
9 Correct 10 ms 12756 KB Output is correct
10 Correct 10 ms 12756 KB Output is correct
11 Correct 9 ms 12756 KB Output is correct
12 Correct 10 ms 12756 KB Output is correct
13 Correct 9 ms 12756 KB Output is correct
14 Correct 10 ms 12756 KB Output is correct
15 Correct 10 ms 12756 KB Output is correct
16 Incorrect 212 ms 12876 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 12756 KB Output is correct
2 Correct 11 ms 12756 KB Output is correct
3 Correct 11 ms 12744 KB Output is correct
4 Correct 10 ms 12756 KB Output is correct
5 Correct 12 ms 12748 KB Output is correct
6 Correct 10 ms 12756 KB Output is correct
7 Correct 12 ms 12852 KB Output is correct
8 Correct 10 ms 12848 KB Output is correct
9 Correct 10 ms 12756 KB Output is correct
10 Correct 10 ms 12756 KB Output is correct
11 Correct 9 ms 12756 KB Output is correct
12 Correct 10 ms 12756 KB Output is correct
13 Correct 9 ms 12756 KB Output is correct
14 Correct 10 ms 12756 KB Output is correct
15 Correct 10 ms 12756 KB Output is correct
16 Incorrect 212 ms 12876 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 12756 KB Output is correct
2 Correct 11 ms 12756 KB Output is correct
3 Correct 11 ms 12744 KB Output is correct
4 Correct 10 ms 12756 KB Output is correct
5 Correct 12 ms 12748 KB Output is correct
6 Correct 10 ms 12756 KB Output is correct
7 Correct 12 ms 12852 KB Output is correct
8 Correct 10 ms 12848 KB Output is correct
9 Correct 10 ms 12756 KB Output is correct
10 Correct 10 ms 12756 KB Output is correct
11 Correct 9 ms 12756 KB Output is correct
12 Correct 10 ms 12756 KB Output is correct
13 Correct 9 ms 12756 KB Output is correct
14 Correct 10 ms 12756 KB Output is correct
15 Correct 10 ms 12756 KB Output is correct
16 Incorrect 212 ms 12876 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 12756 KB Output is correct
2 Correct 11 ms 12756 KB Output is correct
3 Correct 11 ms 12744 KB Output is correct
4 Correct 10 ms 12756 KB Output is correct
5 Correct 12 ms 12748 KB Output is correct
6 Correct 10 ms 12756 KB Output is correct
7 Correct 12 ms 12852 KB Output is correct
8 Correct 10 ms 12848 KB Output is correct
9 Correct 10 ms 12756 KB Output is correct
10 Correct 10 ms 12756 KB Output is correct
11 Correct 9 ms 12756 KB Output is correct
12 Correct 10 ms 12756 KB Output is correct
13 Correct 9 ms 12756 KB Output is correct
14 Correct 10 ms 12756 KB Output is correct
15 Correct 10 ms 12756 KB Output is correct
16 Incorrect 212 ms 12876 KB Output isn't correct
17 Halted 0 ms 0 KB -