oj.uz

Submission #286061

# Submission time Handle Problem Language Result Execution time Memory
286061 2020-08-30T03:05:14 Z user202729 Rectangles (IOI19_rect) C++17
72 / 100
 5000 ms 734296 KB 
// moreflags=grader.cpp
// 13
// ...?
#include "rect.h"
#include<vector>
#include<set>
#include<algorithm>
#if not LOCAL
#define NDEBUG
#endif
#include<cassert>

long long count_rectangles(std::vector<std::vector<int> > a) {
	if(a.size()<3 or a[0].size()<3) return 0;


	struct T{ int right, depth; };
	using Segments=std::vector<std::vector<T>>;
	auto const getSegments=[&](std::vector<int> const& data)->Segments{
		Segments result(data.size()-1); // [l] -> list of valid r in reverse sorted order

		struct Item{int value, index;};
		std::vector<Item> items(data.size());
		for(int index=0; index<(int)items.size(); ++index)
			items[index]={data[index], index};
		std::sort(begin(items), end(items),[&](Item first, Item sec){return first.value>sec.value;});

		static std::set<int> done;
		static std::vector<std::set<int>::node_type> segments;
		if(segments.empty()){
			for(int i=0; i<(int)std::max(a.size(), a[0].size()); ++i){
				done.insert(i);
				segments.push_back(done.extract(done.begin()));
			}
		}
		assert(done.empty());

		for(auto [value, index]: items){
			auto const [iterator, inserted, _nodeHandle]=done.insert(std::move(segments[index]));
			assert(inserted);
			auto const next=std::next(iterator);
			if(iterator!=done.begin() and next!=done.end())
				if(auto const prevValue=*std::prev(iterator); value<data[prevValue] and value<data[*next]){
					result[prevValue+1].push_back(T{*next, 1});
				}
		}

		for(int index=0; index<(int)items.size(); ++index){
			assert(*done.begin()==index);
			segments[index]=done.extract(done.begin());
		}

		for(auto& it: result)
			assert(std::is_sorted(begin(it), end(it), [&](T first, T sec){return first.right>sec.right;}));

		return result;
	};

	std::vector<Segments> rows(a.size()-1), cols(a[0].size()-1);
	for(int row=1; row<(int)a.size()-1; ++row)
		rows[row]=getSegments(a[row]);
	{
		std::vector<int> tmp(a.size());
		for(int col=1; col<(int)a[0].size()-1; ++col){
			std::transform(begin(a), end(a), tmp.begin(),[&](std::vector<int> const& it){return it[col];});
			cols[col]=getSegments(tmp);
		}
	}

	auto const computeDepth=[&](std::vector<Segments>& data)->void{
		if(data.size()<=2) return;
		assert(data[0].empty()); // this is confusing.

		for(int row=(int)data.size()-1; --row;){
			for(int left=0; left<(int)data[row].size(); ++left){
				auto const& v=data[row+1][left];
				for(auto& [right, depth]: data[row][left]){
					assert(depth==1);
					auto const iterator=std::upper_bound(begin(v), end(v), right,
							[&](int right, T item){ return item.right<=right; });
					if(iterator!=v.end() and iterator->right==right)
						depth=iterator->depth+1;
					else{
						assert(iterator==v.end() or iterator->right<right);
						assert(iterator==v.begin() or iterator->right>right);
						assert(std::is_sorted(begin(v), end(v), [&](T first, T sec){return first.right>sec.right;}));
					}
				}
			}
		}
	};

	computeDepth(rows);
	computeDepth(cols);

	struct Bit{
		std::vector<int> data;
		Bit(int number): data(number){}
		void add(int index, int value){
			for(; index>=0; index=(index&(index+1))-1)
				data[index]+=value;
		}
		int sumSuffix(int index) const{
			int result{};
			for(; index<(int)data.size(); index|=index+1)
				result+=data[index];
			return result;
		}
	};
	Bit bit((int)a[0].size()-1);

	enum class EventType{ add, get };
	struct Event{ EventType type; int x, y;
		bool operator<(Event other) const{return std::tie(y, type)<std::tie(other.y, other.type);}
	};
	std::vector<Event> events;

	int64_t result{};
	for(int up=1; up<(int)a.size()-1; ++up)
	for(int left=1; left<(int)a[0].size()-1; ++left){
		auto const A=(int)rows[up][left].size(), B=(int)cols[left][up].size();

		if(A*B<=((31^__builtin_clz(A+B+4)))*(A+B)){
			for(auto [right, depthDown]: rows[up][left])
			for(auto [down, depthRight]: cols[left][up])
				if(depthDown>=down-up and depthRight>=right-left)
					++result;
		}else{
			events.clear();
			for(auto [right, depthDown]: rows[up][left])
				events.push_back({EventType::get, right-left, depthDown});
			for(auto [down, depthRight]: cols[left][up])
				events.push_back({EventType::add, depthRight, down-up});
			std::sort(begin(events), end(events));
			for(auto [type, x, y]: events)
				if(type==EventType::add){
					bit.add(x, 1);
				}else{
					result+=bit.sumSuffix(x);
				}
			for(auto [type, x, y]: events)
				if(type==EventType::add){
					bit.add(x, -1);
				}
		}
	}
	return result;
}

Compilation message

rect.cpp: In lambda function:
rect.cpp:53:13: warning: unused variable 'it' [-Wunused-variable]
   53 |   for(auto& it: result)
      |             ^~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 0 ms 256 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 0 ms 256 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 3 ms 1024 KB Output is correct
18 Correct 3 ms 1024 KB Output is correct
19 Correct 3 ms 1024 KB Output is correct
20 Correct 3 ms 768 KB Output is correct
21 Correct 4 ms 896 KB Output is correct
22 Correct 4 ms 896 KB Output is correct
23 Correct 5 ms 896 KB Output is correct
24 Correct 2 ms 640 KB Output is correct
25 Correct 0 ms 256 KB Output is correct
26 Correct 0 ms 256 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 0 ms 256 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 3 ms 1024 KB Output is correct
18 Correct 3 ms 1024 KB Output is correct
19 Correct 3 ms 1024 KB Output is correct
20 Correct 3 ms 768 KB Output is correct
21 Correct 4 ms 896 KB Output is correct
22 Correct 4 ms 896 KB Output is correct
23 Correct 5 ms 896 KB Output is correct
24 Correct 2 ms 640 KB Output is correct
25 Correct 20 ms 5120 KB Output is correct
26 Correct 20 ms 5248 KB Output is correct
27 Correct 21 ms 5248 KB Output is correct
28 Correct 24 ms 3328 KB Output is correct
29 Correct 26 ms 4096 KB Output is correct
30 Correct 27 ms 4216 KB Output is correct
31 Correct 26 ms 4224 KB Output is correct
32 Correct 26 ms 4088 KB Output is correct
33 Correct 0 ms 256 KB Output is correct
34 Correct 0 ms 256 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 1 ms 384 KB Output is correct
37 Correct 0 ms 256 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 3 ms 1024 KB Output is correct
18 Correct 3 ms 1024 KB Output is correct
19 Correct 3 ms 1024 KB Output is correct
20 Correct 3 ms 768 KB Output is correct
21 Correct 4 ms 896 KB Output is correct
22 Correct 4 ms 896 KB Output is correct
23 Correct 5 ms 896 KB Output is correct
24 Correct 2 ms 640 KB Output is correct
25 Correct 20 ms 5120 KB Output is correct
26 Correct 20 ms 5248 KB Output is correct
27 Correct 21 ms 5248 KB Output is correct
28 Correct 24 ms 3328 KB Output is correct
29 Correct 26 ms 4096 KB Output is correct
30 Correct 27 ms 4216 KB Output is correct
31 Correct 26 ms 4224 KB Output is correct
32 Correct 26 ms 4088 KB Output is correct
33 Correct 208 ms 42872 KB Output is correct
34 Correct 196 ms 38136 KB Output is correct
35 Correct 191 ms 38136 KB Output is correct
36 Correct 201 ms 33400 KB Output is correct
37 Correct 307 ms 58152 KB Output is correct
38 Correct 279 ms 58232 KB Output is correct
39 Correct 273 ms 58104 KB Output is correct
40 Correct 253 ms 54392 KB Output is correct
41 Correct 215 ms 35320 KB Output is correct
42 Correct 252 ms 37880 KB Output is correct
43 Correct 370 ms 45688 KB Output is correct
44 Correct 374 ms 45688 KB Output is correct
45 Correct 181 ms 23216 KB Output is correct
46 Correct 189 ms 23160 KB Output is correct
47 Correct 358 ms 44280 KB Output is correct
48 Correct 367 ms 44280 KB Output is correct
49 Correct 0 ms 256 KB Output is correct
50 Correct 0 ms 256 KB Output is correct
51 Correct 1 ms 384 KB Output is correct
52 Correct 1 ms 384 KB Output is correct
53 Correct 0 ms 256 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1024 KB Output is correct
2 Correct 2 ms 896 KB Output is correct
3 Correct 2 ms 768 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 3 ms 896 KB Output is correct
6 Correct 3 ms 896 KB Output is correct
7 Correct 3 ms 896 KB Output is correct
8 Correct 3 ms 896 KB Output is correct
9 Correct 3 ms 1024 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1371 ms 203364 KB Output is correct
3 Correct 2989 ms 439416 KB Output is correct
4 Correct 3107 ms 441720 KB Output is correct
5 Correct 2995 ms 441668 KB Output is correct
6 Correct 984 ms 170116 KB Output is correct
7 Correct 1991 ms 322936 KB Output is correct
8 Correct 2093 ms 344568 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 0 ms 256 KB Output is correct

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 3 ms 1024 KB Output is correct
18 Correct 3 ms 1024 KB Output is correct
19 Correct 3 ms 1024 KB Output is correct
20 Correct 3 ms 768 KB Output is correct
21 Correct 4 ms 896 KB Output is correct
22 Correct 4 ms 896 KB Output is correct
23 Correct 5 ms 896 KB Output is correct
24 Correct 2 ms 640 KB Output is correct
25 Correct 20 ms 5120 KB Output is correct
26 Correct 20 ms 5248 KB Output is correct
27 Correct 21 ms 5248 KB Output is correct
28 Correct 24 ms 3328 KB Output is correct
29 Correct 26 ms 4096 KB Output is correct
30 Correct 27 ms 4216 KB Output is correct
31 Correct 26 ms 4224 KB Output is correct
32 Correct 26 ms 4088 KB Output is correct
33 Correct 208 ms 42872 KB Output is correct
34 Correct 196 ms 38136 KB Output is correct
35 Correct 191 ms 38136 KB Output is correct
36 Correct 201 ms 33400 KB Output is correct
37 Correct 307 ms 58152 KB Output is correct
38 Correct 279 ms 58232 KB Output is correct
39 Correct 273 ms 58104 KB Output is correct
40 Correct 253 ms 54392 KB Output is correct
41 Correct 215 ms 35320 KB Output is correct
42 Correct 252 ms 37880 KB Output is correct
43 Correct 370 ms 45688 KB Output is correct
44 Correct 374 ms 45688 KB Output is correct
45 Correct 181 ms 23216 KB Output is correct
46 Correct 189 ms 23160 KB Output is correct
47 Correct 358 ms 44280 KB Output is correct
48 Correct 367 ms 44280 KB Output is correct
49 Correct 3 ms 1024 KB Output is correct
50 Correct 2 ms 896 KB Output is correct
51 Correct 2 ms 768 KB Output is correct
52 Correct 0 ms 256 KB Output is correct
53 Correct 3 ms 896 KB Output is correct
54 Correct 3 ms 896 KB Output is correct
55 Correct 3 ms 896 KB Output is correct
56 Correct 3 ms 896 KB Output is correct
57 Correct 3 ms 1024 KB Output is correct
58 Correct 1 ms 384 KB Output is correct
59 Correct 1 ms 384 KB Output is correct
60 Correct 0 ms 256 KB Output is correct
61 Correct 1371 ms 203364 KB Output is correct
62 Correct 2989 ms 439416 KB Output is correct
63 Correct 3107 ms 441720 KB Output is correct
64 Correct 2995 ms 441668 KB Output is correct
65 Correct 984 ms 170116 KB Output is correct
66 Correct 1991 ms 322936 KB Output is correct
67 Correct 2093 ms 344568 KB Output is correct
68 Correct 2884 ms 539640 KB Output is correct
69 Correct 2757 ms 471932 KB Output is correct
70 Correct 2851 ms 472036 KB Output is correct
71 Correct 2955 ms 405112 KB Output is correct
72 Correct 4043 ms 734296 KB Output is correct
73 Correct 3116 ms 344392 KB Output is correct
74 Correct 3351 ms 363640 KB Output is correct
75 Execution timed out 5096 ms 573576 KB Time limit exceeded
76 Halted 0 ms 0 KB -