답안 #833669

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
833669	2023-08-22T07:38:16 Z	caganyanmaz	고대 책들 (IOI17_books)	C++17	50 / 100	132 ms	38684 KB

books

#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();
	ll sum = 0;
	int current = 0;
	vector<int> rp(n);
	for (int i = 0; i < n; i++)
		rp[p[i]] = i;
	vector<int> pp;
	int spos = s;
	int epos = s;
	vector<int> v;
	debug(p, rp);
	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);
	}
	debug(spos, epos, sum);
	for (int i = spos; i < epos; i++)
		if (v[i] <= 0)
			sum += 2;
	return sum;
}

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

#	결과	실행 시간	메모리	Grader output
1	Correct	9 ms	15956 KB	Output is correct
2	Correct	9 ms	15956 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	7 ms	15956 KB	Output is correct
7	Correct	7 ms	15956 KB	Output is correct
8	Correct	9 ms	15956 KB	Output is correct
9	Correct	9 ms	15956 KB	Output is correct
10	Correct	7 ms	15952 KB	Output is correct
11	Correct	8 ms	15956 KB	Output is correct
12	Correct	7 ms	15896 KB	Output is correct
13	Correct	7 ms	15956 KB	Output is correct
14	Correct	7 ms	15956 KB	Output is correct
15	Correct	9 ms	16000 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

#	결과	실행 시간	메모리	Grader output
1	Correct	9 ms	15956 KB	Output is correct
2	Correct	9 ms	15956 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	7 ms	15956 KB	Output is correct
7	Correct	7 ms	15956 KB	Output is correct
8	Correct	9 ms	15956 KB	Output is correct
9	Correct	9 ms	15956 KB	Output is correct
10	Correct	7 ms	15952 KB	Output is correct
11	Correct	8 ms	15956 KB	Output is correct
12	Correct	7 ms	15896 KB	Output is correct
13	Correct	7 ms	15956 KB	Output is correct
14	Correct	7 ms	15956 KB	Output is correct
15	Correct	9 ms	16000 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	9 ms	15952 KB	Output is correct
20	Correct	10 ms	15956 KB	Output is correct
21	Correct	8 ms	15956 KB	Output is correct
22	Correct	7 ms	15956 KB	Output is correct
23	Correct	8 ms	15956 KB	Output is correct
24	Correct	7 ms	15956 KB	Output is correct
25	Correct	10 ms	15956 KB	Output is correct
26	Correct	7 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	8 ms	15956 KB	Output is correct

Subtask #3
28.0 / 28.0

#	결과	실행 시간	메모리	Grader output
1	Correct	9 ms	15956 KB	Output is correct
2	Correct	9 ms	15956 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	7 ms	15956 KB	Output is correct
7	Correct	7 ms	15956 KB	Output is correct
8	Correct	9 ms	15956 KB	Output is correct
9	Correct	9 ms	15956 KB	Output is correct
10	Correct	7 ms	15952 KB	Output is correct
11	Correct	8 ms	15956 KB	Output is correct
12	Correct	7 ms	15896 KB	Output is correct
13	Correct	7 ms	15956 KB	Output is correct
14	Correct	7 ms	15956 KB	Output is correct
15	Correct	9 ms	16000 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	9 ms	15952 KB	Output is correct
20	Correct	10 ms	15956 KB	Output is correct
21	Correct	8 ms	15956 KB	Output is correct
22	Correct	7 ms	15956 KB	Output is correct
23	Correct	8 ms	15956 KB	Output is correct
24	Correct	7 ms	15956 KB	Output is correct
25	Correct	10 ms	15956 KB	Output is correct
26	Correct	7 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	8 ms	15956 KB	Output is correct
30	Correct	96 ms	38656 KB	Output is correct
31	Correct	111 ms	38648 KB	Output is correct
32	Correct	98 ms	38652 KB	Output is correct
33	Correct	131 ms	38648 KB	Output is correct
34	Correct	108 ms	38660 KB	Output is correct
35	Correct	94 ms	38664 KB	Output is correct
36	Correct	98 ms	38652 KB	Output is correct
37	Correct	128 ms	38652 KB	Output is correct
38	Correct	101 ms	38580 KB	Output is correct
39	Correct	92 ms	38684 KB	Output is correct
40	Correct	132 ms	38652 KB	Output is correct
41	Correct	108 ms	38652 KB	Output is correct
42	Correct	97 ms	38652 KB	Output is correct
43	Correct	92 ms	38612 KB	Output is correct

Subtask #4
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	9 ms	15956 KB	3rd lines differ - on the 1st token, expected: '3304', found: '2744'
2	Halted	0 ms	0 KB	-

Subtask #5
0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	9 ms	15956 KB	Output is correct
2	Correct	9 ms	15956 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	7 ms	15956 KB	Output is correct
7	Correct	7 ms	15956 KB	Output is correct
8	Correct	9 ms	15956 KB	Output is correct
9	Correct	9 ms	15956 KB	Output is correct
10	Correct	7 ms	15952 KB	Output is correct
11	Correct	8 ms	15956 KB	Output is correct
12	Correct	7 ms	15896 KB	Output is correct
13	Correct	7 ms	15956 KB	Output is correct
14	Correct	7 ms	15956 KB	Output is correct
15	Correct	9 ms	16000 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	9 ms	15952 KB	Output is correct
20	Correct	10 ms	15956 KB	Output is correct
21	Correct	8 ms	15956 KB	Output is correct
22	Correct	7 ms	15956 KB	Output is correct
23	Correct	8 ms	15956 KB	Output is correct
24	Correct	7 ms	15956 KB	Output is correct
25	Correct	10 ms	15956 KB	Output is correct
26	Correct	7 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	8 ms	15956 KB	Output is correct
30	Correct	96 ms	38656 KB	Output is correct
31	Correct	111 ms	38648 KB	Output is correct
32	Correct	98 ms	38652 KB	Output is correct
33	Correct	131 ms	38648 KB	Output is correct
34	Correct	108 ms	38660 KB	Output is correct
35	Correct	94 ms	38664 KB	Output is correct
36	Correct	98 ms	38652 KB	Output is correct
37	Correct	128 ms	38652 KB	Output is correct
38	Correct	101 ms	38580 KB	Output is correct
39	Correct	92 ms	38684 KB	Output is correct
40	Correct	132 ms	38652 KB	Output is correct
41	Correct	108 ms	38652 KB	Output is correct
42	Correct	97 ms	38652 KB	Output is correct
43	Correct	92 ms	38612 KB	Output is correct
44	Incorrect	9 ms	15956 KB	3rd lines differ - on the 1st token, expected: '3304', found: '2744'
45	Halted	0 ms	0 KB	-

답안 #833669

Compilation message

Subtask #1 12.0 / 12.0

Subtask #2 10.0 / 10.0

Subtask #3 28.0 / 28.0

Subtask #4 0 / 20.0

Subtask #5 0 / 30.0

Subtask #1
12.0 / 12.0

Subtask #2
10.0 / 10.0

Subtask #3
28.0 / 28.0

Subtask #4
0 / 20.0

Subtask #5
0 / 30.0