oj.uz

Submission #1088924

# Submission time Handle Problem Language Result Execution time Memory
1088924 2024-09-15T14:37:37 Z raczek Tiles (BOI24_tiles) C++17
49 / 100
 57 ms 9324 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) {o<<"{"; for(auto v : x) o<<v<<", "; return o<<"}";}
#define debug(X) cerr<<"["#X"]: "<<X<<endl;
#else
#define debug(X) {}
#endif
int32_t main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	set<pair<int, int> > segs[2]; //.first = koniec, .second = poczatek
	vector<int> np(2);
	int result = 0;
	auto add = [&](int x, int y1, int y2)
	{
		x = x%2;
		auto it = segs[x].insert({y2, y1}).first;
		if(abs(y2 - y1)%2 == 1) np[x]++;
		if(it != segs[x].begin())
		{
			it--;
			if(it->first == y1)
			{
				if(abs(it->first - it->second)%2 == 1) np[x]--;
				if(abs(y2 - y1)%2 == 1) np[x]--;
				segs[x].erase(make_pair(it->first, it->second));
				segs[x].erase(make_pair(y2, y1));
				y1 = it->second;
				it = segs[x].insert(make_pair(y2, y1)).first;
				if(abs(y2 - y1)%2 == 1) np[x]++;
			}
			else
			it++;
		}
		it++;
		if(it != segs[x].end())
		{
			if(it->second == y2)
			{
				if(abs(it->first - it->second)%2 == 1) np[x]--;
				if(abs(y1 - y2)%2 == 1) np[x]--;
				segs[x].erase(make_pair(it->first, it->second));
				segs[x].erase(make_pair(y2, y1));
				y2 = it->first;
				segs[x].insert(make_pair(y2, y1));
				if(abs(y2 - y1)%2 == 1) np[x]++;
			}
		}
	};
	auto sub = [&](int x, int y1, int y2)
	{
		x = x%2; x^=1;
		auto it1 = segs[x].upper_bound(make_pair(y1, -1));
		if(it1 != segs[x].end() && it1->second <= y1) {cout<<result; exit(0);}
		auto it2 = segs[x].upper_bound(make_pair(y2, -1));
		if(it2 != segs[x].end() && it2->second <= y2) {cout<<result; exit(0);}
		if(it1 != it2) {cout<<result; exit(0);}
		x^=1;
		vector<pair<int, int> > toAdd;
		vector<pair<int, int> > toSub;
		for(auto it = segs[x].upper_bound(make_pair(y1, -1)); it != segs[x].end() 
		&& it->second <= y2; ++it)
		{
			toSub.push_back(*it);
			if(abs(it->first - it->second)%2 == 1) np[x]--;
			if(it->second < y1)
			{
				if(abs(it->second - y1)%2 == 1) np[x]++;
				toAdd.push_back(make_pair(y1, it->second));
			}
			if(it->first > y2)
			{
				if(abs(it->first - y2)%2 == 1) np[x]++;
				toAdd.push_back(make_pair(it->first, y2));
			}
		}
		for(auto v : toSub) segs[x].erase(v);
		for(auto v : toAdd) segs[x].insert(v);
	};
	int n, m;
	cin>>n>>m;
	vector<pair<int, int> > pts(n);
	for(auto& v : pts) {cin>>v.first>>v.second;}
	auto cmp = [&](pair<int, int> a, pair<int, int> b) {
		long long ax = a.first, ay = a.second, bx = b.first, by = b.second;
		return ax*by - ay*bx;
	};
	long long area = 0;
	for(int i=0;i<n;i++) area += cmp(pts[i], pts[(i+1)%n]);
	if(area < 0) reverse(pts.begin(), pts.end());
	debug(pts);
	vector<pair<pair<int, bool>, pair<int, int> > > events;
	for(int i=0;i<n;i++)
	{
		if(pts[i].first != pts[(i+1)%n].first) continue;
		pair<pair<int, bool>, pair<int, int> > toAdd;
		if(pts[i].second < pts[(i+1)%n].second)
		{toAdd.second = make_pair(pts[i].second, pts[(i+1)%n].second);}
		else toAdd.second = make_pair(pts[(i+1)%n].second, pts[i].second);
		if(pts[i].second < pts[(i+1)%n].second) toAdd.first.second = 1;
		if(pts[i].second > pts[(i+1)%n].second) toAdd.first.second = 0;
		toAdd.first.first = pts[i].first;
		events.push_back(toAdd);
	}
	sort(events.begin(), events.end());
	result = events[0].first.first;
	int prev = -1;
	for(auto& v : events)
	{
		debug(v);
		debug(segs[0]);
		debug(segs[1]);
		if(prev != v.first.first)
		{
			if(np[0] != 0 || np[1] != 0) break;
			if(np[0] == 0 && np[1] == 0 && segs[(v.first.first%2)^1].size() == 0) 
				{result = v.first.first;}
			else if(np[0] == 0 && np[1] == 0 && segs[(v.first.first%2)].size() == 0) 
				result = v.first.first-1;	
		}
		if(v.first.second == 0) add(v.first.first, v.second.first, v.second.second);
		if(v.first.second == 1) sub(v.first.first, v.second.first, v.second.second);
	//	if(&v == &events[events.size()-1]) continue;
	//	if((*(&v + 1)).first.first != v.first.first)
	//		if(np[0] == 0 && np[1] == 0 && segs[(v.first.first+1)%2].size() == 0)
				prev = v.first.first;
	}
//	if(np[0] == 0 && np[1] == 0 && segs[0].size() == 0 && segs[1].size() == 0) result = m+1;
	cout<<result;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 452 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 460 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 452 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 460 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 456 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 460 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 6 ms 2016 KB Output is correct
3 Correct 35 ms 7852 KB Output is correct
4 Correct 19 ms 4312 KB Output is correct
5 Correct 20 ms 4172 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 33 ms 8044 KB Output is correct
9 Correct 21 ms 4544 KB Output is correct
10 Correct 32 ms 7884 KB Output is correct
11 Correct 17 ms 4060 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 38 ms 8040 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 0 ms 348 KB Output is correct

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 452 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 26 ms 5596 KB Output is correct
6 Correct 39 ms 5592 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 2 ms 848 KB Output is correct
11 Correct 0 ms 456 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Incorrect 0 ms 348 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #5
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 19 ms 4344 KB Output is correct
3 Correct 18 ms 4316 KB Output is correct
4 Correct 30 ms 5592 KB Output is correct
5 Correct 39 ms 5580 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 40 ms 7628 KB Output is correct
9 Correct 41 ms 8028 KB Output is correct
10 Correct 56 ms 7884 KB Output is correct
11 Correct 56 ms 7888 KB Output is correct
12 Correct 50 ms 7880 KB Output is correct
13 Correct 54 ms 8416 KB Output is correct
14 Correct 42 ms 7888 KB Output is correct
15 Correct 41 ms 7880 KB Output is correct
16 Correct 40 ms 7880 KB Output is correct
17 Correct 48 ms 7896 KB Output is correct
18 Correct 55 ms 8392 KB Output is correct
19 Correct 40 ms 7888 KB Output is correct
20 Correct 41 ms 7892 KB Output is correct
21 Correct 42 ms 7632 KB Output is correct
22 Incorrect 49 ms 8028 KB Output isn't correct
23 Halted 0 ms 0 KB -

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 7888 KB Output is correct
2 Correct 22 ms 4312 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 31 ms 8064 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 45 ms 8084 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 52 ms 8004 KB Output is correct
9 Correct 56 ms 7904 KB Output is correct
10 Correct 37 ms 7896 KB Output is correct
11 Correct 39 ms 8036 KB Output is correct
12 Correct 35 ms 7904 KB Output is correct
13 Correct 52 ms 7884 KB Output is correct
14 Correct 52 ms 7884 KB Output is correct
15 Correct 56 ms 8012 KB Output is correct
16 Correct 55 ms 9160 KB Output is correct
17 Correct 57 ms 9324 KB Output is correct
18 Correct 56 ms 9172 KB Output is correct
19 Correct 23 ms 4176 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 35 ms 7912 KB Output is correct
22 Correct 25 ms 4568 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 456 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 22 ms 4316 KB Output is correct
37 Correct 35 ms 5584 KB Output is correct
38 Correct 35 ms 5584 KB Output is correct
39 Correct 40 ms 5584 KB Output is correct
40 Correct 47 ms 5588 KB Output is correct
41 Correct 0 ms 456 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 0 ms 344 KB Output is correct
46 Correct 1 ms 348 KB Output is correct

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 452 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 460 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 456 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 460 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 6 ms 2016 KB Output is correct
34 Correct 35 ms 7852 KB Output is correct
35 Correct 19 ms 4312 KB Output is correct
36 Correct 20 ms 4172 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 33 ms 8044 KB Output is correct
40 Correct 21 ms 4544 KB Output is correct
41 Correct 32 ms 7884 KB Output is correct
42 Correct 17 ms 4060 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 38 ms 8040 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 344 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 344 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 0 ms 452 KB Output is correct
52 Correct 1 ms 348 KB Output is correct
53 Correct 26 ms 5596 KB Output is correct
54 Correct 39 ms 5592 KB Output is correct
55 Correct 1 ms 348 KB Output is correct
56 Correct 1 ms 348 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 2 ms 848 KB Output is correct
59 Correct 0 ms 456 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Incorrect 0 ms 348 KB Output isn't correct
62 Halted 0 ms 0 KB -