oj.uz

Submission #1088615

# Submission time Handle Problem Language Result Execution time Memory
1088615 2024-09-14T16:48:47 Z raczek Fire (BOI24_fire) C++17
40 / 100
 2000 ms 91224 KB 
#include<bits/stdc++.h>
using namespace std;
#ifdef DEBUG
auto&operator <<(auto& o, pair<auto, auto> p) {return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator <<(auto& o, auto x)->decltype(x.end(), o) {o<<"{"; for(auto v : x) o<<v<<", "; return o<<"}";}
#define debug(X) cout<<"["#X"]"<<X<<endl;
#else
#define debug(X) {}
#endif
#define int long long
const int base = 1<<19;
struct segtree
{
	vector<pair<int, int> > tree;
	segtree(int n){tree.resize(base*2+10, {0, -n});}
	void add(int w, pair<int, int> val)
	{
		w += base;
		if(tree[w] < val) tree[w] = val;
		w /= 2;
		while(w != 0)
		{
			tree[w] = max(tree[w*2], tree[w*2+1]);
			w /= 2;
		}
	}
	pair<int, int> query(int w, int p, int k, int x, int y)
	{
		if(p > y || k < x) return {0, -1};
		if(x <= p && k <= y) return tree[w];
		return max(query(w*2, p, (p+k)/2, x, y),
				query(w*2+1, (p+k)/2+1, k, x, y));
	}
};
int32_t main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int n, m;
	cin>>n>>m;
	map<int, int> scl;
	vector<pair<int, int> > vals(n);
	for(auto& v : vals) cin>>v.first>>v.second;
	for(auto& v : vals) scl[v.first] = 1, scl[v.second] = 1;
	int cnt = 0;
	for(auto& v : scl) v.second = cnt++;
	for(auto& v : vals) v.first = scl[v.first], v.second = scl[v.second];
	debug(vals);
	segtree A(n);
	for(auto& v : vals)
		if(v.second < v.first)
		{A.add(v.first, make_pair(v.second + cnt, -(int)(&v - &vals[0])));}
		else
		{A.add(v.first, make_pair(v.second, -(int)(&v - &vals[0])));}
	vector par(n+1, vector(20, n));
	for(auto& v : vals)
	{
		debug((int)(&v - &vals[0]));
		if(v.second < v.first)
		{
			auto a1 = A.query(1, 0, base-1, v.first, base-1);
			auto a2 = A.query(1, 0, base-1, 0, v.second);
			if(a2.second != -1){par[(int)(&v - &vals[0])][0] = -a2.second;}
			else par[(int)(&v - &vals[0])][0] = -a1.second;
		}
		else
			par[(int)(&v - &vals[0])][0] =
				-A.query(1, 0, base-1, v.first, v.second).second;
	}
	int result = 1e9+7;
	auto check = [&](int p, int k, int x)
	{
		if(x < 0) return false;
		if(k < p)
			return x >= p || x <= k;
		else
			return p <= x && x <= k;
	};
	vals.push_back({-1, -1});
	for(int i=0;i<n;i++) 
		if(par[i][0] != i &&
				par[i][0] != n &&
				check(vals[i].first, vals[i].second, vals[par[i][0]].second))
		{cout<<2; return 0;}
	for(int i=1;i<20;i++)
		for(int j=0;j<n;j++)
		{
			par[j][i] = par[par[j][i-1]][i-1];
			if(check(vals[j].first, vals[j].second, vals[par[j][i]].second))
			{
				if(par[j][i] != j)
					result = min(result, (1LL<<(i+1))); 
				par[j][i] = n;
			}
		}
	debug(par);
	for(int i=0;i<n;i++)
	{
		int b = par[i][0];
		int res = 2;
		bool e = 0;
		if(b == n) continue;
		while(!check(vals[i].first, vals[i].second, vals[b].second) && res <= n)
		{
			debug(b);
			e = 0;
			int d = 0;
			if(par[b][d] != n)
			{
				debug(d);
				//if(d == 0) break;
				e = true;
				res += (1<<(d+1))-1;
				b = par[b][d];	
			}
			else
				break;
		}
		debug(res);
		debug(e);
		if(e)
			result = min(result, res);
	}
	if(result > n)
		cout<<-1;
	else
		cout<<result;	
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 16728 KB Output is correct
2 Correct 9 ms 16732 KB Output is correct
3 Correct 6 ms 16732 KB Output is correct
4 Correct 6 ms 16732 KB Output is correct
5 Correct 6 ms 16732 KB Output is correct
6 Correct 6 ms 16732 KB Output is correct
7 Correct 6 ms 16728 KB Output is correct
8 Correct 7 ms 16852 KB Output is correct
9 Correct 6 ms 16732 KB Output is correct
10 Correct 6 ms 16728 KB Output is correct
11 Correct 6 ms 16832 KB Output is correct
12 Correct 6 ms 16872 KB Output is correct
13 Correct 6 ms 16732 KB Output is correct
14 Correct 6 ms 16880 KB Output is correct
15 Correct 9 ms 16856 KB Output is correct
16 Correct 6 ms 16732 KB Output is correct
17 Correct 6 ms 16732 KB Output is correct
18 Correct 6 ms 16732 KB Output is correct
19 Correct 7 ms 16864 KB Output is correct
20 Correct 7 ms 16732 KB Output is correct
21 Correct 7 ms 16864 KB Output is correct
22 Correct 9 ms 16732 KB Output is correct
23 Correct 7 ms 16732 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 16728 KB Output is correct
2 Correct 9 ms 16732 KB Output is correct
3 Correct 6 ms 16732 KB Output is correct
4 Correct 6 ms 16732 KB Output is correct
5 Correct 6 ms 16732 KB Output is correct
6 Correct 6 ms 16732 KB Output is correct
7 Correct 6 ms 16728 KB Output is correct
8 Correct 7 ms 16852 KB Output is correct
9 Correct 6 ms 16732 KB Output is correct
10 Correct 6 ms 16728 KB Output is correct
11 Correct 6 ms 16832 KB Output is correct
12 Correct 6 ms 16872 KB Output is correct
13 Correct 6 ms 16732 KB Output is correct
14 Correct 6 ms 16880 KB Output is correct
15 Correct 9 ms 16856 KB Output is correct
16 Correct 6 ms 16732 KB Output is correct
17 Correct 6 ms 16732 KB Output is correct
18 Correct 6 ms 16732 KB Output is correct
19 Correct 7 ms 16864 KB Output is correct
20 Correct 7 ms 16732 KB Output is correct
21 Correct 7 ms 16864 KB Output is correct
22 Correct 9 ms 16732 KB Output is correct
23 Correct 7 ms 16732 KB Output is correct
24 Correct 7 ms 16732 KB Output is correct
25 Correct 7 ms 16856 KB Output is correct
26 Correct 7 ms 16988 KB Output is correct
27 Correct 6 ms 16732 KB Output is correct
28 Correct 7 ms 16988 KB Output is correct
29 Correct 6 ms 16948 KB Output is correct
30 Correct 7 ms 16988 KB Output is correct
31 Correct 6 ms 16732 KB Output is correct
32 Correct 7 ms 16776 KB Output is correct
33 Correct 7 ms 16988 KB Output is correct
34 Correct 7 ms 16988 KB Output is correct
35 Correct 7 ms 16988 KB Output is correct
36 Correct 7 ms 16988 KB Output is correct
37 Correct 8 ms 16988 KB Output is correct
38 Correct 8 ms 16732 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 16728 KB Output is correct
2 Correct 9 ms 16732 KB Output is correct
3 Correct 6 ms 16732 KB Output is correct
4 Correct 6 ms 16732 KB Output is correct
5 Correct 6 ms 16732 KB Output is correct
6 Correct 6 ms 16732 KB Output is correct
7 Correct 6 ms 16728 KB Output is correct
8 Correct 7 ms 16852 KB Output is correct
9 Correct 6 ms 16732 KB Output is correct
10 Correct 6 ms 16728 KB Output is correct
11 Correct 6 ms 16832 KB Output is correct
12 Correct 6 ms 16872 KB Output is correct
13 Correct 6 ms 16732 KB Output is correct
14 Correct 6 ms 16880 KB Output is correct
15 Correct 9 ms 16856 KB Output is correct
16 Correct 6 ms 16732 KB Output is correct
17 Correct 6 ms 16732 KB Output is correct
18 Correct 6 ms 16732 KB Output is correct
19 Correct 7 ms 16864 KB Output is correct
20 Correct 7 ms 16732 KB Output is correct
21 Correct 7 ms 16864 KB Output is correct
22 Correct 9 ms 16732 KB Output is correct
23 Correct 7 ms 16732 KB Output is correct
24 Correct 7 ms 16732 KB Output is correct
25 Correct 7 ms 16856 KB Output is correct
26 Correct 7 ms 16988 KB Output is correct
27 Correct 6 ms 16732 KB Output is correct
28 Correct 7 ms 16988 KB Output is correct
29 Correct 6 ms 16948 KB Output is correct
30 Correct 7 ms 16988 KB Output is correct
31 Correct 6 ms 16732 KB Output is correct
32 Correct 7 ms 16776 KB Output is correct
33 Correct 7 ms 16988 KB Output is correct
34 Correct 7 ms 16988 KB Output is correct
35 Correct 7 ms 16988 KB Output is correct
36 Correct 7 ms 16988 KB Output is correct
37 Correct 8 ms 16988 KB Output is correct
38 Correct 8 ms 16732 KB Output is correct
39 Correct 90 ms 18524 KB Output is correct
40 Correct 320 ms 18520 KB Output is correct
41 Correct 17 ms 18524 KB Output is correct
42 Correct 563 ms 18264 KB Output is correct
43 Correct 10 ms 18264 KB Output is correct
44 Correct 542 ms 18416 KB Output is correct
45 Correct 595 ms 18264 KB Output is correct
46 Correct 542 ms 18420 KB Output is correct
47 Correct 36 ms 18520 KB Output is correct
48 Correct 35 ms 18524 KB Output is correct
49 Correct 48 ms 18524 KB Output is correct
50 Correct 74 ms 18264 KB Output is correct

Subtask #4
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 16728 KB Output is correct
2 Correct 6 ms 16732 KB Output is correct
3 Correct 6 ms 16732 KB Output is correct
4 Correct 6 ms 16736 KB Output is correct
5 Correct 7 ms 16728 KB Output is correct
6 Correct 9 ms 16788 KB Output is correct
7 Correct 7 ms 16824 KB Output is correct
8 Correct 7 ms 16732 KB Output is correct
9 Correct 7 ms 16948 KB Output is correct
10 Correct 7 ms 16984 KB Output is correct
11 Correct 7 ms 16808 KB Output is correct
12 Correct 7 ms 16728 KB Output is correct
13 Correct 7 ms 16732 KB Output is correct
14 Correct 8 ms 16984 KB Output is correct
15 Correct 17 ms 18524 KB Output is correct
16 Correct 601 ms 18380 KB Output is correct
17 Correct 12 ms 18520 KB Output is correct
18 Correct 545 ms 18268 KB Output is correct
19 Correct 35 ms 18524 KB Output is correct
20 Correct 85 ms 62968 KB Output is correct
21 Execution timed out 2023 ms 91224 KB Time limit exceeded
22 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 16728 KB Output is correct
2 Correct 6 ms 16732 KB Output is correct
3 Correct 6 ms 16840 KB Output is correct
4 Correct 6 ms 16732 KB Output is correct
5 Correct 7 ms 16732 KB Output is correct
6 Correct 7 ms 16732 KB Output is correct
7 Correct 7 ms 16732 KB Output is correct
8 Correct 11 ms 16988 KB Output is correct
9 Correct 8 ms 16732 KB Output is correct
10 Correct 8 ms 16904 KB Output is correct
11 Correct 6 ms 16820 KB Output is correct
12 Correct 17 ms 18524 KB Output is correct
13 Correct 569 ms 18368 KB Output is correct
14 Correct 75 ms 18256 KB Output is correct
15 Correct 85 ms 62988 KB Output is correct
16 Execution timed out 2053 ms 77648 KB Time limit exceeded
17 Halted 0 ms 0 KB -

Subtask #6
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 16728 KB Output is correct
2 Correct 9 ms 16732 KB Output is correct
3 Correct 6 ms 16732 KB Output is correct
4 Correct 6 ms 16732 KB Output is correct
5 Correct 6 ms 16732 KB Output is correct
6 Correct 6 ms 16732 KB Output is correct
7 Correct 6 ms 16728 KB Output is correct
8 Correct 7 ms 16852 KB Output is correct
9 Correct 6 ms 16732 KB Output is correct
10 Correct 6 ms 16728 KB Output is correct
11 Correct 6 ms 16832 KB Output is correct
12 Correct 6 ms 16872 KB Output is correct
13 Correct 6 ms 16732 KB Output is correct
14 Correct 6 ms 16880 KB Output is correct
15 Correct 9 ms 16856 KB Output is correct
16 Correct 6 ms 16732 KB Output is correct
17 Correct 6 ms 16732 KB Output is correct
18 Correct 6 ms 16732 KB Output is correct
19 Correct 7 ms 16864 KB Output is correct
20 Correct 7 ms 16732 KB Output is correct
21 Correct 7 ms 16864 KB Output is correct
22 Correct 9 ms 16732 KB Output is correct
23 Correct 7 ms 16732 KB Output is correct
24 Correct 7 ms 16732 KB Output is correct
25 Correct 7 ms 16856 KB Output is correct
26 Correct 7 ms 16988 KB Output is correct
27 Correct 6 ms 16732 KB Output is correct
28 Correct 7 ms 16988 KB Output is correct
29 Correct 6 ms 16948 KB Output is correct
30 Correct 7 ms 16988 KB Output is correct
31 Correct 6 ms 16732 KB Output is correct
32 Correct 7 ms 16776 KB Output is correct
33 Correct 7 ms 16988 KB Output is correct
34 Correct 7 ms 16988 KB Output is correct
35 Correct 7 ms 16988 KB Output is correct
36 Correct 7 ms 16988 KB Output is correct
37 Correct 8 ms 16988 KB Output is correct
38 Correct 8 ms 16732 KB Output is correct
39 Correct 90 ms 18524 KB Output is correct
40 Correct 320 ms 18520 KB Output is correct
41 Correct 17 ms 18524 KB Output is correct
42 Correct 563 ms 18264 KB Output is correct
43 Correct 10 ms 18264 KB Output is correct
44 Correct 542 ms 18416 KB Output is correct
45 Correct 595 ms 18264 KB Output is correct
46 Correct 542 ms 18420 KB Output is correct
47 Correct 36 ms 18520 KB Output is correct
48 Correct 35 ms 18524 KB Output is correct
49 Correct 48 ms 18524 KB Output is correct
50 Correct 74 ms 18264 KB Output is correct
51 Correct 6 ms 16728 KB Output is correct
52 Correct 6 ms 16732 KB Output is correct
53 Correct 6 ms 16732 KB Output is correct
54 Correct 6 ms 16736 KB Output is correct
55 Correct 7 ms 16728 KB Output is correct
56 Correct 9 ms 16788 KB Output is correct
57 Correct 7 ms 16824 KB Output is correct
58 Correct 7 ms 16732 KB Output is correct
59 Correct 7 ms 16948 KB Output is correct
60 Correct 7 ms 16984 KB Output is correct
61 Correct 7 ms 16808 KB Output is correct
62 Correct 7 ms 16728 KB Output is correct
63 Correct 7 ms 16732 KB Output is correct
64 Correct 8 ms 16984 KB Output is correct
65 Correct 17 ms 18524 KB Output is correct
66 Correct 601 ms 18380 KB Output is correct
67 Correct 12 ms 18520 KB Output is correct
68 Correct 545 ms 18268 KB Output is correct
69 Correct 35 ms 18524 KB Output is correct
70 Correct 85 ms 62968 KB Output is correct
71 Execution timed out 2023 ms 91224 KB Time limit exceeded
72 Halted 0 ms 0 KB -