oj.uz

Submission #833716

# Submission time Handle Problem Language Result Execution time Memory
833716 2023-08-22T08:13:16 Z caganyanmaz Ancient Books (IOI17_books) C++17
50 / 100
 120 ms 35084 KB 
#include <bits/stdc++.h>
#define pb push_back
#include "books.h"
#define ll long long 
using namespace std;

//#define DEBUGGING
#ifdef DEBUGGING
#include "../debug.h"
#else
#define debug(x...) void(42)
#endif

struct Node
{
	int head, tail, size, nxt;
	Node(int i) : head(i), tail(i), size(1), nxt(-1) {}
	Node() : Node(-1) {}

};

constexpr static int MXN = 1e6;
Node node[MXN];
bitset<MXN> visited;
bitset<MXN> visited_component;

void merge(int a, int b);

ll minimum_walk(vector<int> p, int s) 
{
	int n = p.size();

	vector<int> rp(n);
	for (int i = 0; i < n; i++)
		rp[p[i]] = i;
	vector<int> v;
	ll sum = 0;
	int current = 0;
	vector<int> possibilities;
	int spos = MXN;
	int epos = -1;

	for (int i = 0; i < n-1; i++)
	{

		if (p[i] > i)
			current++;
		if (rp[i] < i)
			current--;
		if (current > 0)
		{
			spos = min(spos, i);
			epos = max(epos, i+1);
		}
		debug(current, i);
		sum += current * 2;
		v.pb(current);
	}
	if (sum == 0)
		return sum;
	possibilities.pb(spos);

	for (int i = spos; i < epos; i++)
	{
		if (v[i] == 0)
		{
			if (i > 0 && v[i-1] > 0)
				possibilities.pb(i);
			if (i < n-2 && v[i+1] > 0)
				possibilities.pb(i+1);
			sum += 2;
		}
	}
	possibilities.pb(epos);
	debug(spos, epos, sum);

	ll first_cost = MXN;
	for (int i : possibilities)
		first_cost = min<ll>(first_cost, abs(s - i));

	return sum + first_cost * 2;


}

void merge(int a, int b)
{
	if (node[a].size < node[b].size) swap(a, b);
	node[a].size += node[b].size;
	node[node[a].tail].nxt = b;
	node[a].tail = node[b].tail;
	for (;b!=-1;b=node[b].nxt)
		node[b].head = a;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 15956 KB Output is correct
2 Correct 7 ms 15848 KB Output is correct
3 Correct 7 ms 15956 KB Output is correct
4 Correct 7 ms 15956 KB Output is correct
5 Correct 7 ms 15956 KB Output is correct
6 Correct 8 ms 15956 KB Output is correct
7 Correct 8 ms 15956 KB Output is correct
8 Correct 8 ms 15856 KB Output is correct
9 Correct 8 ms 15876 KB Output is correct
10 Correct 7 ms 15956 KB Output is correct
11 Correct 8 ms 15852 KB Output is correct
12 Correct 7 ms 15956 KB Output is correct
13 Correct 7 ms 15956 KB Output is correct
14 Correct 8 ms 15956 KB Output is correct
15 Correct 7 ms 15956 KB Output is correct
16 Correct 7 ms 15956 KB Output is correct
17 Correct 7 ms 15956 KB Output is correct
18 Correct 7 ms 15956 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 15956 KB Output is correct
2 Correct 7 ms 15848 KB Output is correct
3 Correct 7 ms 15956 KB Output is correct
4 Correct 7 ms 15956 KB Output is correct
5 Correct 7 ms 15956 KB Output is correct
6 Correct 8 ms 15956 KB Output is correct
7 Correct 8 ms 15956 KB Output is correct
8 Correct 8 ms 15856 KB Output is correct
9 Correct 8 ms 15876 KB Output is correct
10 Correct 7 ms 15956 KB Output is correct
11 Correct 8 ms 15852 KB Output is correct
12 Correct 7 ms 15956 KB Output is correct
13 Correct 7 ms 15956 KB Output is correct
14 Correct 8 ms 15956 KB Output is correct
15 Correct 7 ms 15956 KB Output is correct
16 Correct 7 ms 15956 KB Output is correct
17 Correct 7 ms 15956 KB Output is correct
18 Correct 7 ms 15956 KB Output is correct
19 Correct 8 ms 15956 KB Output is correct
20 Correct 7 ms 15956 KB Output is correct
21 Correct 7 ms 15956 KB Output is correct
22 Correct 7 ms 15956 KB Output is correct
23 Correct 7 ms 15956 KB Output is correct
24 Correct 7 ms 15956 KB Output is correct
25 Correct 7 ms 15956 KB Output is correct
26 Correct 8 ms 15956 KB Output is correct
27 Correct 7 ms 15956 KB Output is correct
28 Correct 7 ms 15956 KB Output is correct
29 Correct 7 ms 15956 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 15956 KB Output is correct
2 Correct 7 ms 15848 KB Output is correct
3 Correct 7 ms 15956 KB Output is correct
4 Correct 7 ms 15956 KB Output is correct
5 Correct 7 ms 15956 KB Output is correct
6 Correct 8 ms 15956 KB Output is correct
7 Correct 8 ms 15956 KB Output is correct
8 Correct 8 ms 15856 KB Output is correct
9 Correct 8 ms 15876 KB Output is correct
10 Correct 7 ms 15956 KB Output is correct
11 Correct 8 ms 15852 KB Output is correct
12 Correct 7 ms 15956 KB Output is correct
13 Correct 7 ms 15956 KB Output is correct
14 Correct 8 ms 15956 KB Output is correct
15 Correct 7 ms 15956 KB Output is correct
16 Correct 7 ms 15956 KB Output is correct
17 Correct 7 ms 15956 KB Output is correct
18 Correct 7 ms 15956 KB Output is correct
19 Correct 8 ms 15956 KB Output is correct
20 Correct 7 ms 15956 KB Output is correct
21 Correct 7 ms 15956 KB Output is correct
22 Correct 7 ms 15956 KB Output is correct
23 Correct 7 ms 15956 KB Output is correct
24 Correct 7 ms 15956 KB Output is correct
25 Correct 7 ms 15956 KB Output is correct
26 Correct 8 ms 15956 KB Output is correct
27 Correct 7 ms 15956 KB Output is correct
28 Correct 7 ms 15956 KB Output is correct
29 Correct 7 ms 15956 KB Output is correct
30 Correct 90 ms 31932 KB Output is correct
31 Correct 109 ms 31896 KB Output is correct
32 Correct 82 ms 31932 KB Output is correct
33 Correct 120 ms 34984 KB Output is correct
34 Correct 95 ms 35000 KB Output is correct
35 Correct 102 ms 35084 KB Output is correct
36 Correct 96 ms 33408 KB Output is correct
37 Correct 95 ms 31888 KB Output is correct
38 Correct 91 ms 31892 KB Output is correct
39 Correct 92 ms 31880 KB Output is correct
40 Correct 92 ms 31884 KB Output is correct
41 Correct 91 ms 31936 KB Output is correct
42 Correct 92 ms 31932 KB Output is correct
43 Correct 93 ms 31936 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 15956 KB 3rd lines differ - on the 1st token, expected: '3304', found: '3594'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 15956 KB Output is correct
2 Correct 7 ms 15848 KB Output is correct
3 Correct 7 ms 15956 KB Output is correct
4 Correct 7 ms 15956 KB Output is correct
5 Correct 7 ms 15956 KB Output is correct
6 Correct 8 ms 15956 KB Output is correct
7 Correct 8 ms 15956 KB Output is correct
8 Correct 8 ms 15856 KB Output is correct
9 Correct 8 ms 15876 KB Output is correct
10 Correct 7 ms 15956 KB Output is correct
11 Correct 8 ms 15852 KB Output is correct
12 Correct 7 ms 15956 KB Output is correct
13 Correct 7 ms 15956 KB Output is correct
14 Correct 8 ms 15956 KB Output is correct
15 Correct 7 ms 15956 KB Output is correct
16 Correct 7 ms 15956 KB Output is correct
17 Correct 7 ms 15956 KB Output is correct
18 Correct 7 ms 15956 KB Output is correct
19 Correct 8 ms 15956 KB Output is correct
20 Correct 7 ms 15956 KB Output is correct
21 Correct 7 ms 15956 KB Output is correct
22 Correct 7 ms 15956 KB Output is correct
23 Correct 7 ms 15956 KB Output is correct
24 Correct 7 ms 15956 KB Output is correct
25 Correct 7 ms 15956 KB Output is correct
26 Correct 8 ms 15956 KB Output is correct
27 Correct 7 ms 15956 KB Output is correct
28 Correct 7 ms 15956 KB Output is correct
29 Correct 7 ms 15956 KB Output is correct
30 Correct 90 ms 31932 KB Output is correct
31 Correct 109 ms 31896 KB Output is correct
32 Correct 82 ms 31932 KB Output is correct
33 Correct 120 ms 34984 KB Output is correct
34 Correct 95 ms 35000 KB Output is correct
35 Correct 102 ms 35084 KB Output is correct
36 Correct 96 ms 33408 KB Output is correct
37 Correct 95 ms 31888 KB Output is correct
38 Correct 91 ms 31892 KB Output is correct
39 Correct 92 ms 31880 KB Output is correct
40 Correct 92 ms 31884 KB Output is correct
41 Correct 91 ms 31936 KB Output is correct
42 Correct 92 ms 31932 KB Output is correct
43 Correct 93 ms 31936 KB Output is correct
44 Incorrect 7 ms 15956 KB 3rd lines differ - on the 1st token, expected: '3304', found: '3594'
45 Halted 0 ms 0 KB -