제출 #399679

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
399679		Jasiekstrz	철로 (IOI14_rail)	C++17	30 / 100	679 ms	262148 KiB

rail

#include<bits/stdc++.h>
#include "rail.h"
#define fi first
#define se second
using namespace std;
const int NN=5e3;
struct Edge
{
	int x,y,c;
	bool operator<(const Edge &oth) const
	{
		return c>oth.c;
	}
};
int d[NN+10][NN+10];
bool vis[NN+10];
priority_queue<Edge> pq;
void add_edges(int x,int n)
{
	for(int y=0;y<n;y++)
	{
		if(!vis[y])
			pq.push({x,y,d[x][y]});
	}
	return;
}
void findLocation(int N,int first,int location[],int stype[])
{
	for(int i=0;i<N;i++)
	{
		for(int j=i+1;j<N;j++)
			d[i][j]=d[j][i]=getDistance(i,j);
	}
	location[0]=first;
	stype[0]=1;
	vis[0]=true;
	add_edges(0,N);
	while(!pq.empty())
	{
		auto v=pq.top();
		pq.pop();
		if(vis[v.y])
			continue;
		if(stype[v.x]==1)
		{
			stype[v.y]=2;
			location[v.y]=location[v.x]+v.c;
		}
		else
		{
			stype[v.y]=1;
			location[v.y]=location[v.x]-v.c;
		}
		vis[v.y]=true;
		add_edges(v.y,N);
	}
	//for(int i=0;i<N;i++)
	//	cerr<<i<<": "<<stype[i]<<" "<<location[i]<<"\n";
	return;
}

• Subtask 1: 8 / 8
• Subtask 2: 22 / 22
• Subtask 3: 0 / 26
• Subtask 4: 0 / 44