Submission #1028945

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1028945	2024-07-20T10:40:24 Z	parsadox2	Ancient Books (IOI17_books)	C++17	42 / 100	84 ms	25168 KB

books

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

using namespace std;

const int N = 1e3 + 10;

#define F first
#define S second

int a[N] , n , dp[N][N] , match[N];
bool marked[N] , ch[N];
vector <int> adj[N];

bool try_kuhn(int v)
{
	marked[v] = true;
	for(auto u : adj[v])
	{
		if(match[u] == -1)
		{
			match[u] = v;
			match[v] = u;
			return true;
		}
		if(!marked[match[u]] && try_kuhn(match[u]))
		{
			match[v] = u;
			match[u] = v;
			return true;
		}
	}
	return false;
}

int Matching(int s)
{
	for(int i = 0 ; i < n ; i++)
		match[i] = -1;
	bool flg = true;
	int res = 0;
	while(flg)
	{
		flg = false;
		for(int i = 0 ; i < n ; i++)
			marked[i] = false;
		for(int i = 0 ; i <= s ; i++)  if(match[i] == -1 && try_kuhn(i))
		{
			res++;
			flg = true;
		}
	}
	return res;
}

long long minimum_walk(vector<int> p, int s) {
	n = p.size();
	long long ans = 0;
	int cnt = (p[0] == 0 ? 0 : 1);
	marked[p[0]] = true;
	for(int i = 1 ; i < n ; i++)
	{
		a[i] = cnt;
		ans += 2 * cnt;
		//cout << i << " : " << cnt << endl;
		if(p[i] > i)
		{
			cnt++;
			marked[p[i]] = true;
		}
		if(marked[i])
			cnt--;
	}
	int L = 0 , R = n - 1;
	for(int i = n - 1 ; i > s ; i--)
	{
		if(p[i] != i)
			break;
		R--;	
	}
	for(int i = 0 ; i < s ; i++)
	{
		if(p[i] != i)
			break;
		L++;
	}
	vector <pair<int , int>> all;
	for(int l = L ; l <= s ; l++)   for(int r = s ; r <= R ; r++)
	{
		bool flg = true;
		for(int i = l ; i <= r ; i++)  if(p[i] < l || p[i] > r)
		{
			flg = false;
			break;
		}
		if(!flg)
			continue;
		if(l == L && r == R)
			continue;
		if(l == L)
			ch[r + 1] = true;
		else if(r == R)
			ch[l] = true;
		else
			all.push_back({l , r + 1});
	}
	vector <pair<int , int>> vec;
	for(auto u : all)  if(!ch[u.F] && !ch[u.S])
	{
		adj[u.F].push_back(u.S);
		adj[u.S].push_back(u.F);
	}
	for(int i = 0 ; i < n ; i++)  if(ch[i])
		ans += 2;
	ans += 2 * Matching(s);
	return ans;
}

Subtask #1
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	600 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 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	348 KB	Output is correct
16	Correct	0 ms	468 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct

Subtask #2
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	600 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 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	348 KB	Output is correct
16	Correct	0 ms	468 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	1 ms	604 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	1 ms	348 KB	Output is correct
26	Correct	1 ms	472 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	1 ms	348 KB	Output is correct
29	Correct	1 ms	348 KB	Output is correct

Subtask #3
0 / 28.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	600 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 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	348 KB	Output is correct
16	Correct	0 ms	468 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	1 ms	604 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	1 ms	348 KB	Output is correct
26	Correct	1 ms	472 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	1 ms	348 KB	Output is correct
29	Correct	1 ms	348 KB	Output is correct
30	Runtime error	73 ms	25168 KB	Execution killed with signal 11
31	Halted	0 ms	0 KB	-

Subtask #4
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	84 ms	2608 KB	Output is correct
2	Correct	2 ms	344 KB	Output is correct
3	Correct	32 ms	1172 KB	Output is correct
4	Correct	49 ms	1492 KB	Output is correct
5	Correct	59 ms	1492 KB	Output is correct
6	Correct	3 ms	348 KB	Output is correct
7	Correct	3 ms	480 KB	Output is correct
8	Correct	4 ms	348 KB	Output is correct
9	Correct	3 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	21 ms	492 KB	Output is correct
12	Correct	34 ms	672 KB	Output is correct
13	Correct	8 ms	348 KB	Output is correct
14	Correct	6 ms	348 KB	Output is correct
15	Correct	3 ms	344 KB	Output is correct
16	Correct	2 ms	348 KB	Output is correct
17	Correct	39 ms	496 KB	Output is correct
18	Correct	23 ms	348 KB	Output is correct
19	Correct	13 ms	348 KB	Output is correct
20	Correct	2 ms	348 KB	Output is correct

Subtask #5
0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	600 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 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	348 KB	Output is correct
16	Correct	0 ms	468 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	1 ms	604 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	1 ms	348 KB	Output is correct
26	Correct	1 ms	472 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	1 ms	348 KB	Output is correct
29	Correct	1 ms	348 KB	Output is correct
30	Runtime error	73 ms	25168 KB	Execution killed with signal 11
31	Halted	0 ms	0 KB	-

Submission #1028945

Compilation message

Subtask #1 12.0 / 12.0

Subtask #2 10.0 / 10.0

Subtask #3 0 / 28.0

Subtask #4 20.0 / 20.0

Subtask #5 0 / 30.0

Subtask #1
12.0 / 12.0

Subtask #2
10.0 / 10.0

Subtask #3
0 / 28.0

Subtask #4
20.0 / 20.0

Subtask #5
0 / 30.0