oj.uz

답안 #961667

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
961667 2024-04-12T09:55:16 Z vjudge1 City Mapping (NOI18_citymapping) C++17
32 / 100
 2 ms 604 KB 
#include "citymapping.h"
#include <bits/stdc++.h>

namespace operators
{
	template <typename T1, typename T2>
	std::istream &operator>>(std::istream &in, std::pair<T1, T2> &x)
	{
		in >> x.first >> x.second;
		return in;
	}

	template <typename T1, typename T2>
	std::ostream &operator<<(std::ostream &out, std::pair<T1, T2> x)
	{
		out << x.first << " " << x.second;
		return out;
	}

	template <typename T1>
	std::istream &operator>>(std::istream &in, std::vector<T1> &x)
	{
		for (auto &i : x)
			in >> i;
		return in;
	}

	template <typename T1>
	std::ostream &operator<<(std::ostream &out, std::vector<T1> &x)
	{
		for (auto &i : x)
			out << i << " ";
		return out;
	}

	template <typename T1>
	std::ostream &operator<<(std::ostream &out, std::set<T1> &x)
	{
		for (auto &i : x)
			out << i << " ";
		return out;
	}

	template <typename T1>
	std::ostream &operator<<(std::ostream &out, std::multiset<T1> &x)
	{
		for (auto &i : x)
			out << i << " ";
		return out;
	}
}

// name spaces
using namespace std;
using namespace operators;
// end of name spaces

// defines
#define ll long long
#define ull unsigned long long
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define f first
#define s second
#define uint unsigned int
#define all(vc) vc.begin(), vc.end()
// end of defines

vector<pair<pll, ll>> edges;
vector<ll> D;

void solve(vector<ll> &v, ll PREV)
{
	if (v.empty())
		return;
	if (v.size() == 0)
		return;
	ll frth = v[0];
	for (ll el : v)
		if (D[frth] < D[el])
			frth = el;
	vector<pll> bf;
	ll last = frth;
	for (ll el : v)
		if (el != frth)
			bf.pb({get_distance(frth + 1, el + 1), el});
	sort(all(bf));
	vector<ll> toV;
	int BF = PREV;
	for (auto [curd, el] : bf)
	{
		if (curd + D[el] == D[frth])
		{
			solve(toV, BF);
			BF = el;
			toV.clear();
			edges.pb({{last, el}, D[last] - D[el]});
			last = el;
		}
		else
			toV.pb(el);
	}
	solve(toV, BF);
	toV.clear();
	edges.pb({{PREV, last}, D[last] - D[PREV]});
}

void find_roads(int N, int Q, int A[], int B[], int W[])
{
	D.resize(N);
	pll mx = {0, 0};
	for (ll i = 1; i < N; ++i)
		mx = max(mx, mp((ll)get_distance(1, i + 1), i));
	for (ll i = 0; i < N; ++i)
		D[i] = (ll)get_distance(mx.s + 1, i + 1);
	vector<ll> vtc;
	for (ll i = 0; i < N; ++i)
		if (i != mx.s)
			vtc.pb(i);
	solve(vtc, mx.s);

	ll i = 0;
	for (auto [e, v] : edges)
	{
		A[i] = e.f + 1;
		B[i] = e.s + 1;
		W[i] = abs(v);
		++i;
	}
	return;
}

// ////////////////////////////////////////////////////////

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

// static int N, Q, S, twok[1005][11], depth[1005], curQ, target = 6500;
// static long long dist[1005];
// static vector<pair<int, int>> adjlist[1005];
// static vector<pair<pair<int, int>, int>> edgelist, user_edgelist;

// static void dfs(int x, int p, long long d, int dep)
// {
// 	dist[x] = d;
// 	depth[x] = dep;
// 	twok[x][0] = p;
// 	for (int i = 1; i <= 10; i++)
// 	{
// 		if (twok[x][i - 1] == -1)
// 			break;
// 		twok[x][i] = twok[twok[x][i - 1]][i - 1];
// 	}
// 	for (int i = 0; i < (int)adjlist[x].size(); i++)
// 	{
// 		if (adjlist[x][i].first == p)
// 			continue;
// 		dfs(adjlist[x][i].first, x, d + adjlist[x][i].second, dep + 1);
// 	}
// }

// static int lca(int x, int y)
// {
// 	if (depth[x] > depth[y])
// 		swap(x, y);
// 	int dd = depth[y] - depth[x];
// 	for (int i = 0; i <= 10; i++)
// 		if (dd & (1 << i))
// 			y = twok[y][i];
// 	if (x == y)
// 		return x;
// 	for (int i = 10; i >= 0; i--)
// 	{
// 		if (twok[x][i] != twok[y][i])
// 		{
// 			x = twok[x][i];
// 			y = twok[y][i];
// 		}
// 	}
// 	return twok[x][0];
// }

// long long get_distance(int X, int Y)
// {
// 	if (X <= 0 || X > N || Y <= 0 || Y > N)
// 	{
// 		printf("Wrong Answer: get_distance() arguments out of range.\n");
// 		exit(0);
// 	}
// 	curQ++;
// 	if (curQ > Q)
// 	{
// 		printf("Wrong Answer: Too many calls to get_distance().\n");
// 		exit(0);
// 	}
// 	return dist[X - 1] + dist[Y - 1] - dist[lca(X - 1, Y - 1)] * 2;
// }

// int main()
// {
// 	if (scanf("%d%d%d", &N, &Q, &S) != 3)
// 	{
// 		printf("Wrong Input Format\n");
// 		exit(0);
// 	}
// 	for (int i = 0; i < N - 1; i++)
// 	{
// 		int a, b, w;
// 		if (scanf("%d%d%d", &a, &b, &w) != 3)
// 		{
// 			printf("Wrong Input Format\n");
// 			return 0;
// 		}
// 		a--;
// 		b--;
// 		adjlist[a].push_back(make_pair(b, w));
// 		adjlist[b].push_back(make_pair(a, w));
// 		edgelist.push_back(make_pair(make_pair(min(a, b) + 1, max(a, b) + 1), w));
// 	}
// 	sort(edgelist.begin(), edgelist.end());
// 	memset(twok, -1, sizeof(twok));
// 	dfs(0, -1, 0, 0);
// 	int A[N - 1], B[N - 1], W[N - 1];
// 	memset(A, 0, sizeof(A));
// 	memset(B, 0, sizeof(B));
// 	memset(W, 0, sizeof(W));
// 	find_roads(N, Q, A, B, W);
// 	for (int i = 0; i < N - 1; i++)
// 	{
// 		user_edgelist.push_back(make_pair(make_pair(min(A[i], B[i]), max(A[i], B[i])), W[i]));
// 	}
// 	sort(user_edgelist.begin(), user_edgelist.end());
// 	if (edgelist != user_edgelist)
// 	{
// 		printf("Wrong Answer: Reported list of edges differ from actual.\n");
// 		exit(0);
// 	}
// 	cout << "Correct";
// 	exit(0);
// 	if (S <= 4)
// 	{
// 		printf("Score: 100.00%%\nCorrect: %d out of %d queries used.\n", curQ, Q);
// 		exit(0);
// 	}
// 	else
// 	{
// 		if (curQ <= target)
// 			printf("Score: 100.00%%\nCorrect: %d out of %d queries used.\n", curQ, Q);
// 		else if (curQ >= 12000)
// 			printf("Score: %.2lf%%\nCorrect: %d out of %d queries used.\n", (10.0 - 10.0 * ((double)(curQ - 12000) / 13000)) / 43 * 100, curQ, Q);
// 		else
// 			printf("Score: %.2lf%%\nCorrect: %d out of %d queries used.\n", (40.0 - 30.0 * ((double)(curQ - target) / (12000 - target))) / 43 * 100, curQ, Q);
// 	}
// }

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 604 KB Correct: 2994 out of 500000 queries used.
2 Incorrect 1 ms 604 KB Reported list of edges differ from actual.
3 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 604 KB Correct: 2994 out of 500000 queries used.
2 Incorrect 1 ms 604 KB Reported list of edges differ from actual.
3 Halted 0 ms 0 KB -

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 604 KB Correct: 2970 out of 12000 queries used.
2 Correct 1 ms 604 KB Correct: 2976 out of 12000 queries used.
3 Correct 1 ms 604 KB Correct: 2997 out of 12000 queries used.
4 Correct 1 ms 604 KB Correct: 2976 out of 12000 queries used.
5 Correct 1 ms 604 KB Correct: 2970 out of 12000 queries used.

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 604 KB Correct: 2970 out of 12000 queries used.
2 Correct 1 ms 604 KB Correct: 2976 out of 12000 queries used.
3 Correct 1 ms 604 KB Correct: 2997 out of 12000 queries used.
4 Correct 1 ms 604 KB Correct: 2976 out of 12000 queries used.
5 Correct 1 ms 604 KB Correct: 2970 out of 12000 queries used.
6 Correct 1 ms 604 KB Correct: 2991 out of 12000 queries used.
7 Correct 1 ms 604 KB Correct: 2985 out of 12000 queries used.
8 Correct 1 ms 604 KB Correct: 2997 out of 12000 queries used.
9 Correct 1 ms 604 KB Correct: 2988 out of 12000 queries used.
10 Correct 2 ms 604 KB Correct: 2979 out of 12000 queries used.

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 604 KB Correct: 2994 out of 500000 queries used.
2 Incorrect 1 ms 604 KB Reported list of edges differ from actual.
3 Halted 0 ms 0 KB -