oj.uz

답안 #421448

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
421448 2021-06-09T07:32:43 Z schse 고대 책들 (IOI17_books) C++17
12 / 100
 1 ms 300 KB 
#include "books.h"
#ifndef EVAL
#include "grader.cpp"
#endif

#include <bits/stdc++.h>
using namespace std;

struct unionfind
{
	vector<int> root = vector<int>(1005);
	int find(int i)
	{
		if (root[i] == i)
			return i;
		return root[i] = find(root[i]);
	}
	bool unite(int a, int b)
	{
		a = find(a);
		b = find(b);
		if (a == b)
			return false;
		root[a] = b;
		return true;
	}
} un;

struct qnode
{
	int dis, a, b;
};

long long minimum_walk(std::vector<int> p, int s)
{
	iota(un.root.begin(), un.root.end(), 0);
	vector<int> cycle(p.size(), -1);
	vector<vector<int>> cycles;
	vector<pair<int, int>> cmmc;
	long long triplenght = 0;

	for (int i = 0; i < p.size(); i++)
	{
		if (cycle[i] == -1 && p[i] != i)
		{
			int t = i;
			cycles.push_back({});
			cmmc.push_back({INT32_MAX, INT32_MIN});
			do
			{
				cmmc[cmmc.size() - 1].first = min(cmmc[cmmc.size() - 1].first, t);
				cmmc[cmmc.size() - 1].second = max(cmmc[cmmc.size() - 1].second, t);
				cycles[cycles.size() - 1].push_back(t);
				cycle[t] = cycles.size();
				triplenght += abs(t - p[t]);
				t = p[t];
			} while (t != i);
		}
	}

	if (cmmc.size() == 0)
		return 0;

	triplenght += 2 * cmmc[0].first; //initial walk

	int mx = cmmc[0].second;
	for (int i = 1; i < cmmc.size(); i++)
	{
		if (mx < cmmc[i].first)
			triplenght += abs(cmmc[i].first - cmmc[i - 1].second) * 2;
		mx = max(mx, cmmc[i].second);
	}

	return triplenght;

	vector<qnode> edges;
	for (int i = 0; i < cycles.size(); i++)
	{
		for (int e = 0; e < i; e++)
		{
			int mn = INT32_MAX;
			for (int a : cycles[i])
				for (int b : cycles[e])
					mn = min(mn, abs(a - b));
			edges.push_back({mn, i, e});
		}
	}

	sort(edges.begin(), edges.end(), [](qnode a, qnode b)
		 { return a.dis < b.dis; });

	for (qnode n : edges) // mst
	{
		if (un.unite(n.a, n.b))
			triplenght += 2 * n.dis;
	}

	int t = 0;
	while (cycles.size() && cycle[t++] == -1)
		triplenght += 2;

	return triplenght;
}

Compilation message

books.cpp: In function 'long long int minimum_walk(std::vector<int>, int)':
books.cpp:42:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |  for (int i = 0; i < p.size(); i++)
      |                  ~~^~~~~~~~~~
books.cpp:67:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   67 |  for (int i = 1; i < cmmc.size(); i++)
      |                  ~~^~~~~~~~~~~~~
books.cpp:77:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   77 |  for (int i = 0; i < cycles.size(); i++)
      |                  ~~^~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 292 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 296 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 296 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 292 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 296 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 296 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Incorrect 1 ms 204 KB 3rd lines differ - on the 1st token, expected: '2082', found: '2104'
23 Halted 0 ms 0 KB -

Subtask #3
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 292 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 296 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 296 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Incorrect 1 ms 204 KB 3rd lines differ - on the 1st token, expected: '2082', found: '2104'
23 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 204 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 0 ms 204 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 292 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 296 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 296 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Incorrect 1 ms 204 KB 3rd lines differ - on the 1st token, expected: '2082', found: '2104'
23 Halted 0 ms 0 KB -