oj.uz

Submission #299485

# Submission time Handle Problem Language Result Execution time Memory
299485 2020-09-15T03:32:31 Z user202729 Seats (IOI18_seats) C++17
100 / 100
 2380 ms 118136 KB 
#include "seats.h"
#include<vector>
#include<climits>
#include<algorithm>
#if LOCAL
#include<iostream>
#else
#define NDEBUG
#endif
#include<cassert>

struct Tree{
	struct T{
		int minimum, count;
		T operator+(int lazy) const{return {minimum+lazy, count};}
		T operator+(T other) const{
			if(minimum<other.minimum) return *this;
			if(minimum>other.minimum) return other;
			return {minimum, count+other.count};
		}
	};
	struct Node{
		int lazy;
		T data_;
		T data() const{return data_+lazy;}
	};
	std::vector<Node> data;
	Tree(){}
	Tree(int number): data(number*2, {0, {0, 1}}){}
	// note: initial state is inconsistent (counts values of nonleafs are 1)

	void add(int left, int right, int value){
		if(left==right) return;
		assert(left<right);

		left+=int(data.size()/2); right+=int(data.size()/2);
		std::array<int, 2> const old{{left, right-1}};
		for(; left<right; left>>=1, right>>=1){
			if(left&1) data[left++].lazy+=value;
			if(right&1) data[--right].lazy+=value;
		}
		for(auto it: old){
			for(it>>=1; it; it>>=1){
				data[it].data_=data[it*2].data()+data[it*2+1].data();
			}
		}
	}

	/* // not necessary (...)
	void get(int left, int right){
		assert(left<right);
		left+=int(data.size()/2); right+=int(data.size()/2);
		for(auto it: {left, right-1}){
			for(int shift=31^__builtin_clz(it); shift; --shift){
				auto const node=it>>shift;
				if(auto const l=data[node].lazy){
					data[node].lazy=0;
					data[node].data_.minimum+=l;
					data[node*2].lazy+=l;
					data[node*2+1].lazy+=l;
				}
			}
		}

		T result{};
	}
	*/

	int get(){
		// operator+ is commutative
		auto const d=data[1].data();
		assert(d.minimum>=4);
		return d.minimum==4 ? d.count: 0;
	}
};

struct MyData{
	MyData(){}

	//int width;
	std::vector<std::vector<int>> value; // pos -> time (in 0..H*W), with padded (H*W) values
	struct Pos{ int row, col; };
	std::vector<Pos> pos; // time -> pos
	Tree tree;

	template<int factor> void addTree(Pos minimum){
		auto const [r, c]=minimum;
		std::array<int, 4> times{{
			value[r][c],
			value[r+1][c],
			value[r][c+1],
			value[r+1][c+1],
		}};
		std::sort(begin(times), end(times));

		tree.add(times[0], times[1], factor);
		tree.add(times[2], times[3], factor*5); // 5 is always greater than 4 => impossible
	}

	MyData(int const H, int const W, std::vector<int> const& R_, std::vector<int> const& C_):
		value(H+2, std::vector<int>(W+2, H*W)),
		pos(H*W), tree(H*W)
	{
		for(int time=0; time<H*W; ++time){
			pos[time]={R_[time], C_[time]};
			value[R_[time]+1][C_[time]+1]=time;
		}

		for(int i=0; i<(int)value.size()-1; ++i)
			for(int j=0; j<(int)value[0].size()-1; ++j)
				addTree<1>({i, j});
	}

	int swap(int first, int sec){
		std::swap(pos[first], pos[sec]);

		std::array<std::array<int, 2> /* can be Pos too if it has comparison operators */, 8> minimums{{
			{pos[first].row, pos[first].col},
			{pos[first].row, pos[first].col+1},
			{pos[first].row+1, pos[first].col},
			{pos[first].row+1, pos[first].col+1},
			{pos[sec].row, pos[sec].col},
			{pos[sec].row, pos[sec].col+1},
			{pos[sec].row+1, pos[sec].col},
			{pos[sec].row+1, pos[sec].col+1},
		}};
		std::sort(begin(minimums), end(minimums));
		auto const last=std::unique(begin(minimums), end(minimums));

		std::for_each(minimums.begin(), last, [&](auto it){ addTree<-1>({it[0], it[1]}); });

		value[pos[first].row+1][pos[first].col+1]=first;
		value[pos[sec].row+1][pos[sec].col+1]=sec;

		std::for_each(minimums.begin(), last, [&](auto it){ addTree<1>({it[0], it[1]}); });

		return tree.get();
	}
} myData;

void give_initial_chart(int H, int W, std::vector<int> R, std::vector<int> C) {
	myData=MyData{H, W, std::move(R), std::move(C)};
}

int swap_seats(int a, int b) {
	return myData.swap(a, b);
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 512 KB Output is correct
2 Correct 20 ms 512 KB Output is correct
3 Correct 28 ms 512 KB Output is correct
4 Correct 17 ms 512 KB Output is correct
5 Correct 18 ms 512 KB Output is correct
6 Correct 26 ms 512 KB Output is correct
7 Correct 26 ms 504 KB Output is correct
8 Correct 26 ms 512 KB Output is correct
9 Correct 25 ms 512 KB Output is correct
10 Correct 26 ms 512 KB Output is correct
11 Correct 24 ms 512 KB Output is correct
12 Correct 17 ms 512 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 512 KB Output is correct
2 Correct 20 ms 512 KB Output is correct
3 Correct 28 ms 512 KB Output is correct
4 Correct 17 ms 512 KB Output is correct
5 Correct 18 ms 512 KB Output is correct
6 Correct 26 ms 512 KB Output is correct
7 Correct 26 ms 504 KB Output is correct
8 Correct 26 ms 512 KB Output is correct
9 Correct 25 ms 512 KB Output is correct
10 Correct 26 ms 512 KB Output is correct
11 Correct 24 ms 512 KB Output is correct
12 Correct 17 ms 512 KB Output is correct
13 Correct 50 ms 1024 KB Output is correct
14 Correct 56 ms 1024 KB Output is correct
15 Correct 36 ms 1152 KB Output is correct
16 Correct 34 ms 1536 KB Output is correct
17 Correct 46 ms 1148 KB Output is correct
18 Correct 55 ms 1144 KB Output is correct
19 Correct 51 ms 1144 KB Output is correct
20 Correct 46 ms 1280 KB Output is correct
21 Correct 34 ms 1152 KB Output is correct
22 Correct 34 ms 1536 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1562 ms 51576 KB Output is correct
2 Correct 1117 ms 67320 KB Output is correct
3 Correct 1029 ms 67320 KB Output is correct
4 Correct 837 ms 67320 KB Output is correct
5 Correct 865 ms 67192 KB Output is correct
6 Correct 968 ms 67192 KB Output is correct
7 Correct 964 ms 67320 KB Output is correct
8 Correct 945 ms 67192 KB Output is correct
9 Correct 973 ms 67180 KB Output is correct
10 Correct 966 ms 67320 KB Output is correct

Subtask #4
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 1024 KB Output is correct
2 Correct 150 ms 6264 KB Output is correct
3 Correct 887 ms 67320 KB Output is correct
4 Correct 1587 ms 67312 KB Output is correct
5 Correct 921 ms 75056 KB Output is correct
6 Correct 1639 ms 118136 KB Output is correct
7 Correct 867 ms 69984 KB Output is correct
8 Correct 1089 ms 67472 KB Output is correct
9 Correct 999 ms 67576 KB Output is correct
10 Correct 1029 ms 72056 KB Output is correct
11 Correct 942 ms 90616 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 61 ms 2036 KB Output is correct
2 Correct 110 ms 1396 KB Output is correct
3 Correct 163 ms 1396 KB Output is correct
4 Correct 229 ms 1396 KB Output is correct
5 Correct 265 ms 2164 KB Output is correct
6 Correct 1243 ms 59700 KB Output is correct
7 Correct 1334 ms 59444 KB Output is correct
8 Correct 1268 ms 59824 KB Output is correct
9 Correct 2080 ms 59572 KB Output is correct
10 Correct 1253 ms 59568 KB Output is correct
11 Correct 1308 ms 59572 KB Output is correct
12 Correct 1276 ms 59568 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 512 KB Output is correct
2 Correct 20 ms 512 KB Output is correct
3 Correct 28 ms 512 KB Output is correct
4 Correct 17 ms 512 KB Output is correct
5 Correct 18 ms 512 KB Output is correct
6 Correct 26 ms 512 KB Output is correct
7 Correct 26 ms 504 KB Output is correct
8 Correct 26 ms 512 KB Output is correct
9 Correct 25 ms 512 KB Output is correct
10 Correct 26 ms 512 KB Output is correct
11 Correct 24 ms 512 KB Output is correct
12 Correct 17 ms 512 KB Output is correct
13 Correct 50 ms 1024 KB Output is correct
14 Correct 56 ms 1024 KB Output is correct
15 Correct 36 ms 1152 KB Output is correct
16 Correct 34 ms 1536 KB Output is correct
17 Correct 46 ms 1148 KB Output is correct
18 Correct 55 ms 1144 KB Output is correct
19 Correct 51 ms 1144 KB Output is correct
20 Correct 46 ms 1280 KB Output is correct
21 Correct 34 ms 1152 KB Output is correct
22 Correct 34 ms 1536 KB Output is correct
23 Correct 1562 ms 51576 KB Output is correct
24 Correct 1117 ms 67320 KB Output is correct
25 Correct 1029 ms 67320 KB Output is correct
26 Correct 837 ms 67320 KB Output is correct
27 Correct 865 ms 67192 KB Output is correct
28 Correct 968 ms 67192 KB Output is correct
29 Correct 964 ms 67320 KB Output is correct
30 Correct 945 ms 67192 KB Output is correct
31 Correct 973 ms 67180 KB Output is correct
32 Correct 966 ms 67320 KB Output is correct
33 Correct 52 ms 1024 KB Output is correct
34 Correct 150 ms 6264 KB Output is correct
35 Correct 887 ms 67320 KB Output is correct
36 Correct 1587 ms 67312 KB Output is correct
37 Correct 921 ms 75056 KB Output is correct
38 Correct 1639 ms 118136 KB Output is correct
39 Correct 867 ms 69984 KB Output is correct
40 Correct 1089 ms 67472 KB Output is correct
41 Correct 999 ms 67576 KB Output is correct
42 Correct 1029 ms 72056 KB Output is correct
43 Correct 942 ms 90616 KB Output is correct
44 Correct 61 ms 2036 KB Output is correct
45 Correct 110 ms 1396 KB Output is correct
46 Correct 163 ms 1396 KB Output is correct
47 Correct 229 ms 1396 KB Output is correct
48 Correct 265 ms 2164 KB Output is correct
49 Correct 1243 ms 59700 KB Output is correct
50 Correct 1334 ms 59444 KB Output is correct
51 Correct 1268 ms 59824 KB Output is correct
52 Correct 2080 ms 59572 KB Output is correct
53 Correct 1253 ms 59568 KB Output is correct
54 Correct 1308 ms 59572 KB Output is correct
55 Correct 1276 ms 59568 KB Output is correct
56 Correct 131 ms 2036 KB Output is correct
57 Correct 274 ms 2036 KB Output is correct
58 Correct 501 ms 2868 KB Output is correct
59 Correct 1622 ms 68344 KB Output is correct
60 Correct 2380 ms 68344 KB Output is correct
61 Correct 1507 ms 68344 KB Output is correct
62 Correct 1452 ms 72256 KB Output is correct
63 Correct 2357 ms 70872 KB Output is correct
64 Correct 1589 ms 69096 KB Output is correct
65 Correct 1490 ms 68376 KB Output is correct
66 Correct 1722 ms 68716 KB Output is correct
67 Correct 1585 ms 73080 KB Output is correct
68 Correct 1506 ms 82668 KB Output is correct
69 Correct 2230 ms 91768 KB Output is correct