oj.uz

답안 #59275

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
59275 2018-07-21T11:27:31 Z TadijaSebez 악어의 지하 도시 (IOI11_crocodile) C++11
100 / 100
 1044 ms 99840 KB 
#include "crocodile.h"
#include <stdio.h>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;
#define pb push_back
#define mp make_pair
#define ll long long
const int N=100050;
const int M=1000050;
const ll inf=1e18;
ll fir[N],sec[N];
vector<pair<int,int> > E[N];
int disc[N],tid;
bool mark[N];
void DFS(int u)
{
	disc[u]=++tid;
	if(mark[u]){ fir[u]=sec[u]=0;return;}
	for(int i=0;i<E[u].size();i++)
	{
		int v=E[u][i].first;
		int w=E[u][i].second;
		if(!disc[v]) DFS(v);
		if(disc[v]>disc[u] || mark[v])
		{
			if(fir[u]>sec[v]+w) sec[u]=fir[u],fir[u]=sec[v]+w;
			else if(sec[u]>sec[v]+w) sec[u]=sec[v]+w;
		}
	}
}
void AddEdge(int u, int v, int w){ E[u].pb(mp(v,w));E[v].pb(mp(u,w));}
bool was[N];
int travel_plan(int n, int m, int r[][2], int l[], int k, int p[])
{
	int i;
	for(i=0;i<m;i++) AddEdge(r[i][0]+1,r[i][1]+1,l[i]);
	for(i=0;i<k;i++) mark[p[i]+1]=1;
	for(i=1;i<=n;i++) fir[i]=sec[i]=inf;
	//DFS(1);
	priority_queue<pair<ll,int> > pq;
	for(i=1;i<=n;i++) if(mark[i])
	{
		pq.push(mp(0,i));
		fir[i]=sec[i]=0;
	}
	while(pq.size())
	{
		int u=pq.top().second;
		pq.pop();
		if(was[u]) continue;
		was[u]=1;
		for(int i=0;i<E[u].size();i++)
		{
			int v=E[u][i].first;
			int w=E[u][i].second;
			if(sec[u]+w<fir[v])
			{
				sec[v]=fir[v];
				fir[v]=sec[u]+w;
				pq.push(mp(-sec[v],v));
			}
			else if(sec[u]+w<sec[v])
			{
				sec[v]=sec[u]+w;
				pq.push(mp(-sec[v],v));
			}
		}
	}
	return sec[1];
}
/*int r[M][2],l[M],p[N];
int main()
{
	int n,m,k,i;
	scanf("%i %i %i",&n,&m,&k);
	for(i=0;i<m;i++) scanf("%i %i %i",&r[i][0],&r[i][1],&l[i]);
	for(i=0;i<k;i++) scanf("%i",&p[i]);
	printf("%i\n",travel_plan(n,m,r,l,k,p));
	return 0;
}*/

Compilation message

crocodile.cpp: In function 'void DFS(int)':
crocodile.cpp:21:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<E[u].size();i++)
              ~^~~~~~~~~~~~
crocodile.cpp: In function 'int travel_plan(int, int, int (*)[2], int*, int, int*)':
crocodile.cpp:54:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i=0;i<E[u].size();i++)
               ~^~~~~~~~~~~~

Subtask #1
46.0 / 46.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 2680 KB Output is correct
2 Correct 5 ms 2788 KB Output is correct
3 Correct 4 ms 2984 KB Output is correct
4 Correct 6 ms 3156 KB Output is correct
5 Correct 5 ms 3156 KB Output is correct
6 Correct 7 ms 3156 KB Output is correct
7 Correct 7 ms 3156 KB Output is correct
8 Correct 7 ms 3204 KB Output is correct

Subtask #2
43.0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 2680 KB Output is correct
2 Correct 5 ms 2788 KB Output is correct
3 Correct 4 ms 2984 KB Output is correct
4 Correct 6 ms 3156 KB Output is correct
5 Correct 5 ms 3156 KB Output is correct
6 Correct 7 ms 3156 KB Output is correct
7 Correct 7 ms 3156 KB Output is correct
8 Correct 7 ms 3204 KB Output is correct
9 Correct 8 ms 3356 KB Output is correct
10 Correct 6 ms 3356 KB Output is correct
11 Correct 6 ms 3356 KB Output is correct
12 Correct 9 ms 3608 KB Output is correct
13 Correct 9 ms 3800 KB Output is correct
14 Correct 6 ms 3800 KB Output is correct
15 Correct 8 ms 3800 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 2680 KB Output is correct
2 Correct 5 ms 2788 KB Output is correct
3 Correct 4 ms 2984 KB Output is correct
4 Correct 6 ms 3156 KB Output is correct
5 Correct 5 ms 3156 KB Output is correct
6 Correct 7 ms 3156 KB Output is correct
7 Correct 7 ms 3156 KB Output is correct
8 Correct 7 ms 3204 KB Output is correct
9 Correct 8 ms 3356 KB Output is correct
10 Correct 6 ms 3356 KB Output is correct
11 Correct 6 ms 3356 KB Output is correct
12 Correct 9 ms 3608 KB Output is correct
13 Correct 9 ms 3800 KB Output is correct
14 Correct 6 ms 3800 KB Output is correct
15 Correct 8 ms 3800 KB Output is correct
16 Correct 785 ms 61388 KB Output is correct
17 Correct 133 ms 61388 KB Output is correct
18 Correct 178 ms 61388 KB Output is correct
19 Correct 1044 ms 90964 KB Output is correct
20 Correct 564 ms 90964 KB Output is correct
21 Correct 93 ms 90964 KB Output is correct
22 Correct 500 ms 99840 KB Output is correct