Submission #208663

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
208663	2020-03-12T01:37:06 Z	Lawliet	Seats (IOI18_seats)	C++17	100 / 100	3941 ms	105152 KB

seats

#include <bits/stdc++.h>
#include "seats.h"

using namespace std;
typedef pair<int,int> pii;

const int MAXN = 1000010;

class SegmentTree
{
	public:

		int getLeft(int node) { return 2*node; }
		int getRight(int node) { return 2*node + 1; }

		void refresh(int node, int l, int r)
		{
			if( lazy[node] == 0 ) return;

			int lz = lazy[node];
			lazy[node] = 0;

			mn[node] += lz;

			if( l == r ) return;

			lazy[ getLeft(node) ] += lz;
			lazy[ getRight(node) ] += lz;
		}

		void merge(int node, int idLeft, int idRight)
		{
			qtd[node] = 0;

			if( mn[idLeft] <= mn[idRight] )
			{
				mn[node] = mn[idLeft];
				qtd[node] += qtd[idLeft];
			}

			if( mn[idLeft] >= mn[idRight] )
			{
				mn[node] = mn[idRight];
				qtd[node] += qtd[idRight];
			}
		}

		void build(int node, int l, int r)
		{
			mn[node] = lazy[node] = 0;

			if( l == r ) return void( qtd[node] = 1 );

			int m = ( l + r )/2;

			build( getLeft(node) , l , m );
			build( getRight(node) , m + 1 , r );

			merge( node , getLeft(node) , getRight(node) );
		}

		void update(int node, int l, int r, int i, int j, int v)
		{
			if( i > j ) return;

			refresh( node , l , r );

			if( j < l || r < i ) return;
			if( i <= l && r <= j )
			{
				lazy[node] += v;
				refresh( node , l , r );

				return;
			}

			int m = ( l + r )/2;

			update( getLeft(node) , l , m , i , j , v );
			update( getRight(node) , m + 1 , r , i , j , v );

			merge( node , getLeft(node) , getRight(node) );
		}

		int qtdMin()
		{
			refresh( 1 , 1 , last );

			if( mn[1] != 4 ) return 0;
			return qtd[1];
		}

		void init(int R)
		{
			last = R;
			build( 1 , 1 , last );
		}

	private:

		int last;

		int mn[4*MAXN];
		int qtd[4*MAXN];
		int lazy[4*MAXN];
};

int n, m;

pii loc[MAXN];

vector< vector<int> > v;

SegmentTree SEG;

void updateSquare(int x, int y, int val)
{
	vector< int > aux;

	aux.push_back( v[x][y] );
	aux.push_back( v[x + 1][y] );
	aux.push_back( v[x][y + 1] );
	aux.push_back( v[x + 1][y + 1] );

	sort( aux.begin() , aux.end() );

	SEG.update( 1 , 1 , n*m , aux[0] , aux[1] - 1 , val );
	SEG.update( 1 , 1 , n*m , aux[2] , aux[3] - 1 , val );	
}

void changeSquare(int x, int y, int val)
{
	updateSquare( x - 1 , y - 1 , val );
	updateSquare( x , y - 1 , val );
	updateSquare( x - 1 , y , val );
	updateSquare( x , y , val );
}

void give_initial_chart(int H, int W, vector<int> R, vector<int> C) 
{
	n = H; m = W;

	SEG.init( H*W );

	v.resize( n + 2 );

	for(int i = 0 ; i <= n + 1 ; i++)
		v[i].resize( m + 2 , n*m + 1 );

	for(int i = 0 ; i < n*m ; i++)
	{
		R[i]++; C[i]++;

		v[ R[i] ][ C[i] ] = i + 1;
		loc[i + 1] = { R[i] , C[i] };
	}

	for(int i = 0 ; i <= n ; i++)
		for(int j = 0 ; j <= m ; j++)
			updateSquare( i , j , 1 );
}

int swap_seats(int a, int b) 
{
	a++; b++;
	int xA = loc[a].first;
	int yA = loc[a].second;
	int xB = loc[b].first;
	int yB = loc[b].second;

	changeSquare( xA , yA , -1 );
	changeSquare( xB , yB , -1 );

	swap( loc[a] , loc[b] );
	swap( v[xA][yA] , v[xB][yB] );

	changeSquare( xA , yA , 1 );
	changeSquare( xB , yB , 1 );

	return SEG.qtdMin();
}

Subtask #1
5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	28 ms	504 KB	Output is correct
2	Correct	35 ms	504 KB	Output is correct
3	Correct	48 ms	504 KB	Output is correct
4	Correct	34 ms	504 KB	Output is correct
5	Correct	30 ms	504 KB	Output is correct
6	Correct	44 ms	504 KB	Output is correct
7	Correct	47 ms	504 KB	Output is correct
8	Correct	41 ms	504 KB	Output is correct
9	Correct	47 ms	504 KB	Output is correct
10	Correct	47 ms	504 KB	Output is correct
11	Correct	48 ms	504 KB	Output is correct
12	Correct	32 ms	504 KB	Output is correct

Subtask #2
6.0 / 6.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	28 ms	504 KB	Output is correct
2	Correct	35 ms	504 KB	Output is correct
3	Correct	48 ms	504 KB	Output is correct
4	Correct	34 ms	504 KB	Output is correct
5	Correct	30 ms	504 KB	Output is correct
6	Correct	44 ms	504 KB	Output is correct
7	Correct	47 ms	504 KB	Output is correct
8	Correct	41 ms	504 KB	Output is correct
9	Correct	47 ms	504 KB	Output is correct
10	Correct	47 ms	504 KB	Output is correct
11	Correct	48 ms	504 KB	Output is correct
12	Correct	32 ms	504 KB	Output is correct
13	Correct	89 ms	1272 KB	Output is correct
14	Correct	108 ms	1272 KB	Output is correct
15	Correct	67 ms	1272 KB	Output is correct
16	Correct	52 ms	1756 KB	Output is correct
17	Correct	85 ms	1272 KB	Output is correct
18	Correct	73 ms	1272 KB	Output is correct
19	Correct	68 ms	1312 KB	Output is correct
20	Correct	61 ms	1528 KB	Output is correct
21	Correct	53 ms	1272 KB	Output is correct
22	Correct	57 ms	1792 KB	Output is correct

Subtask #3
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2518 ms	54392 KB	Output is correct
2	Correct	1387 ms	55932 KB	Output is correct
3	Correct	1260 ms	55928 KB	Output is correct
4	Correct	1112 ms	55836 KB	Output is correct
5	Correct	1172 ms	55840 KB	Output is correct
6	Correct	1107 ms	55800 KB	Output is correct
7	Correct	1222 ms	55712 KB	Output is correct
8	Correct	1328 ms	55624 KB	Output is correct
9	Correct	1295 ms	55584 KB	Output is correct
10	Correct	1273 ms	54904 KB	Output is correct

Subtask #4
6.0 / 6.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	94 ms	1144 KB	Output is correct
2	Correct	208 ms	5880 KB	Output is correct
3	Correct	1223 ms	54296 KB	Output is correct
4	Correct	2739 ms	54300 KB	Output is correct
5	Correct	1256 ms	62048 KB	Output is correct
6	Correct	2989 ms	105152 KB	Output is correct
7	Correct	1322 ms	57768 KB	Output is correct
8	Correct	1546 ms	55236 KB	Output is correct
9	Correct	1415 ms	55552 KB	Output is correct
10	Correct	1253 ms	59856 KB	Output is correct
11	Correct	1255 ms	78636 KB	Output is correct

Subtask #5
33.0 / 33.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	174 ms	1780 KB	Output is correct
2	Correct	221 ms	1908 KB	Output is correct
3	Correct	280 ms	1880 KB	Output is correct
4	Correct	328 ms	1892 KB	Output is correct
5	Correct	508 ms	2464 KB	Output is correct
6	Correct	1796 ms	63608 KB	Output is correct
7	Correct	2245 ms	60872 KB	Output is correct
8	Correct	1770 ms	60792 KB	Output is correct
9	Correct	3269 ms	60792 KB	Output is correct
10	Correct	1751 ms	77176 KB	Output is correct
11	Correct	1686 ms	77304 KB	Output is correct
12	Correct	1632 ms	77304 KB	Output is correct

Subtask #6
30.0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	28 ms	504 KB	Output is correct
2	Correct	35 ms	504 KB	Output is correct
3	Correct	48 ms	504 KB	Output is correct
4	Correct	34 ms	504 KB	Output is correct
5	Correct	30 ms	504 KB	Output is correct
6	Correct	44 ms	504 KB	Output is correct
7	Correct	47 ms	504 KB	Output is correct
8	Correct	41 ms	504 KB	Output is correct
9	Correct	47 ms	504 KB	Output is correct
10	Correct	47 ms	504 KB	Output is correct
11	Correct	48 ms	504 KB	Output is correct
12	Correct	32 ms	504 KB	Output is correct
13	Correct	89 ms	1272 KB	Output is correct
14	Correct	108 ms	1272 KB	Output is correct
15	Correct	67 ms	1272 KB	Output is correct
16	Correct	52 ms	1756 KB	Output is correct
17	Correct	85 ms	1272 KB	Output is correct
18	Correct	73 ms	1272 KB	Output is correct
19	Correct	68 ms	1312 KB	Output is correct
20	Correct	61 ms	1528 KB	Output is correct
21	Correct	53 ms	1272 KB	Output is correct
22	Correct	57 ms	1792 KB	Output is correct
23	Correct	2518 ms	54392 KB	Output is correct
24	Correct	1387 ms	55932 KB	Output is correct
25	Correct	1260 ms	55928 KB	Output is correct
26	Correct	1112 ms	55836 KB	Output is correct
27	Correct	1172 ms	55840 KB	Output is correct
28	Correct	1107 ms	55800 KB	Output is correct
29	Correct	1222 ms	55712 KB	Output is correct
30	Correct	1328 ms	55624 KB	Output is correct
31	Correct	1295 ms	55584 KB	Output is correct
32	Correct	1273 ms	54904 KB	Output is correct
33	Correct	94 ms	1144 KB	Output is correct
34	Correct	208 ms	5880 KB	Output is correct
35	Correct	1223 ms	54296 KB	Output is correct
36	Correct	2739 ms	54300 KB	Output is correct
37	Correct	1256 ms	62048 KB	Output is correct
38	Correct	2989 ms	105152 KB	Output is correct
39	Correct	1322 ms	57768 KB	Output is correct
40	Correct	1546 ms	55236 KB	Output is correct
41	Correct	1415 ms	55552 KB	Output is correct
42	Correct	1253 ms	59856 KB	Output is correct
43	Correct	1255 ms	78636 KB	Output is correct
44	Correct	174 ms	1780 KB	Output is correct
45	Correct	221 ms	1908 KB	Output is correct
46	Correct	280 ms	1880 KB	Output is correct
47	Correct	328 ms	1892 KB	Output is correct
48	Correct	508 ms	2464 KB	Output is correct
49	Correct	1796 ms	63608 KB	Output is correct
50	Correct	2245 ms	60872 KB	Output is correct
51	Correct	1770 ms	60792 KB	Output is correct
52	Correct	3269 ms	60792 KB	Output is correct
53	Correct	1751 ms	77176 KB	Output is correct
54	Correct	1686 ms	77304 KB	Output is correct
55	Correct	1632 ms	77304 KB	Output is correct
56	Correct	238 ms	2036 KB	Output is correct
57	Correct	449 ms	2208 KB	Output is correct
58	Correct	619 ms	2916 KB	Output is correct
59	Correct	2116 ms	69500 KB	Output is correct
60	Correct	3941 ms	69532 KB	Output is correct
61	Correct	1997 ms	69496 KB	Output is correct
62	Correct	1787 ms	73336 KB	Output is correct
63	Correct	3792 ms	72076 KB	Output is correct
64	Correct	2292 ms	70312 KB	Output is correct
65	Correct	2061 ms	69496 KB	Output is correct
66	Correct	2216 ms	69752 KB	Output is correct
67	Correct	2316 ms	74108 KB	Output is correct
68	Correct	1827 ms	83832 KB	Output is correct
69	Correct	3559 ms	92792 KB	Output is correct

Submission #208663

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 6.0 / 6.0

Subtask #3 20.0 / 20.0

Subtask #4 6.0 / 6.0

Subtask #5 33.0 / 33.0

Subtask #6 30.0 / 30.0

Subtask #1
5.0 / 5.0

Subtask #2
6.0 / 6.0

Subtask #3
20.0 / 20.0

Subtask #4
6.0 / 6.0

Subtask #5
33.0 / 33.0

Subtask #6
30.0 / 30.0