oj.uz

Submission #703730

# Submission time Handle Problem Language Result Execution time Memory
703730 2023-02-28T08:40:05 Z 600Mihnea Palembang Bridges (APIO15_bridge) C++17
31 / 100
 2000 ms 5704 KB 
#include <cmath>
#include <functional>
#include <fstream>
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <set>
#include <map>
#include <list>
#include <time.h>
#include <math.h>
#include <random>
#include <deque>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <cassert>
#include <bitset>
#include <sstream>
#include <chrono>
#include <cstring>
#include <numeric>

using namespace std;

#define int long long 

const int INF = (int)1e18 + 7;

pair<int, int> _rd_()
{
	string s;
	int i;
	cin >> s >> i;
	assert(s == "A" || s == "B");
	return { s == "B", i };
}

const int N = (int)1e5 + 7;
int k;
int n;
int extra;
pair<int, int> c1[N], c2[N];

signed main()
{
#ifdef ONPC	
	FILE* stream;
	freopen_s(&stream, "input.txt", "r", stdin);
#else
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#endif

	cin >> k >> n;
	{
		int y = 0;
		for (int i = 1; i <= n; i++)
		{
			c1[i] = _rd_();
			c2[i] = _rd_();
			if (c1[i].first == c2[i].first)
			{
				extra += abs(c1[i].second - c2[i].second);
				continue;
			}
			y++;
			c1[y] = c1[i];
			c2[y] = c2[i];
		}
		n = y;
	}
	if (n == 0)
	{
		cout << extra << "\n";
		return 0;
	}
	if (k == 1)
	{
		vector<int> coords;
		for (int i = 1; i <= n; i++)
		{
			coords.push_back(c1[i].second);
			coords.push_back(c2[i].second);
		}
		nth_element(coords.begin(), coords.begin() + n - 1, coords.end());
		int su = 0;
		for (int i = 0; i < 2 * n; i++)
		{
			su += abs(coords[i] - coords[n - 1]);
		}
		cout << su + extra + n << "\n";
		return 0;
	}
	assert(k == 2);
	set<int> s;
	for (int i = 1; i <= n; i++)
	{
		s.insert(c1[i].second);
		s.insert(c2[i].second);
		if (c1[i].second > c2[i].second)
		{
			swap(c1[i], c2[i]);
		}
	}
	vector<pair<int, int>> segs;
	for (int i = 1; i <= n; i++)
	{
		segs.push_back({ c1[i].second, c2[i].second });
	}
	int sol = INF;
	for (auto& x : s)
	{
		for (auto& y : s)
		{
			int cur = 0;
			for (auto& s : segs)
			{
				if (s.first <= x && x <= s.second)
				{
					continue;
				}
				if (s.first <= y && y <= s.second)
				{
					continue;
				}
				cur += min({ abs(s.first - x), abs(s.first - y), abs(s.second - x), abs(s.second - y) });
			}
			sol = min(sol, cur);
		}
	}
	for (int i = 1; i <= n; i++)
	{
		extra += abs(c1[i].second - c2[i].second);
	}
	cout << 2 * sol + extra + n << "\n";
	return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 31 ms 5536 KB Output is correct
13 Correct 48 ms 5620 KB Output is correct
14 Correct 34 ms 5280 KB Output is correct
15 Correct 24 ms 3248 KB Output is correct
16 Correct 39 ms 5704 KB Output is correct
17 Correct 38 ms 5532 KB Output is correct
18 Correct 38 ms 5648 KB Output is correct
19 Correct 38 ms 5592 KB Output is correct
20 Correct 37 ms 5524 KB Output is correct
21 Correct 38 ms 5576 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 11 ms 340 KB Output is correct
5 Correct 4 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 21 ms 340 KB Output is correct
9 Correct 11 ms 344 KB Output is correct
10 Correct 15 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 17 ms 344 KB Output is correct

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 9 ms 340 KB Output is correct
5 Correct 3 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 17 ms 348 KB Output is correct
9 Correct 10 ms 340 KB Output is correct
10 Correct 20 ms 352 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 17 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 51 ms 340 KB Output is correct
15 Execution timed out 2070 ms 468 KB Time limit exceeded
16 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 12 ms 340 KB Output is correct
5 Correct 3 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 17 ms 460 KB Output is correct
9 Correct 10 ms 344 KB Output is correct
10 Correct 20 ms 340 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 18 ms 348 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 50 ms 380 KB Output is correct
15 Execution timed out 2085 ms 468 KB Time limit exceeded
16 Halted 0 ms 0 KB -