oj.uz

답안 #233523

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
233523 2020-05-20T19:49:55 Z crossing0ver 악어의 지하 도시 (IOI11_crocodile) C++17
89 / 100
 2000 ms 47792 KB 
#include<bits/stdc++.h>
#define ll long long 
#define fi first
#define se second
#include "crocodile.h"
using namespace std;
vector <pair<int,int > > adj[100000];
ll IN[100000][2];
bool vis[100000];
int Ein[100000],v,x;
ll dis[100000],d;
ll val;
struct cmp{
	bool operator() (const int &a,  const  int &b) const {
		if (Ein[a] == Ein[b] && dis[a] == dis[b]) return a < b;
		if (Ein[a] >= 2 && Ein[b] >= 2)
			return dis[a] <= dis[b];
		return Ein[a] >= 2;
	}
};
 
int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]) {
	for (int i = 0; i < M; i++) {
		adj[ R[i][0] ].push_back( { L [i], R[i][1] } );
		adj[ R[i][1] ].push_back( { L[i] , R[i][0] });
	}
	for (int i = 0; i <  100000; i++)
		dis[i] = 100000000000000; 
	set<int,cmp>  s;
	for (int i = 0; i < K; i++) 
		Ein[P[i]] = 2,dis[P[i]] = 0,s.insert (P[i]);
	while (!s.empty()) {
		 v = *s.begin();
		if (Ein[v] < 2) break;       
		s.erase(s.begin());
		if (vis[v]) continue;
		vis[v] = 1;
		for (auto i : adj[v]) {
			 x = i.se;
			if (vis[x]) continue;
			s.erase(x);
		   d = i.fi + dis[v];
		   if (IN[x][0] == 0) IN[x][0] = d;
		   else if (IN[x][1] == 0) {
		   	IN[x][1] = d;
		   	if (IN[x][0] > IN[x][1]) swap(IN[x][0],IN[x][1]);
		   }
		   else if (IN[x][1] > d) {
		   	IN[x][1] = d;
		   	if (IN[x][0] > IN[x][1]) swap(IN[x][0],IN[x][1]);
		   }
			Ein[x] ++;
			if (IN[x][1] && dis[x] > IN[x][1]) {
					dis[x] = IN[x][1];
			}
			s.insert (x);
		}
	}
	return dis[0];	
}        /*
main()  {
	
}             */

Subtask #1
46.0 / 46.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 3456 KB Output is correct
2 Correct 6 ms 3456 KB Output is correct
3 Correct 6 ms 3456 KB Output is correct
4 Correct 7 ms 3584 KB Output is correct
5 Correct 7 ms 3584 KB Output is correct
6 Correct 7 ms 3584 KB Output is correct
7 Correct 7 ms 3584 KB Output is correct
8 Correct 7 ms 3584 KB Output is correct

Subtask #2
43.0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 3456 KB Output is correct
2 Correct 6 ms 3456 KB Output is correct
3 Correct 6 ms 3456 KB Output is correct
4 Correct 7 ms 3584 KB Output is correct
5 Correct 7 ms 3584 KB Output is correct
6 Correct 7 ms 3584 KB Output is correct
7 Correct 7 ms 3584 KB Output is correct
8 Correct 7 ms 3584 KB Output is correct
9 Correct 10 ms 3712 KB Output is correct
10 Correct 6 ms 3456 KB Output is correct
11 Correct 8 ms 3584 KB Output is correct
12 Correct 12 ms 3840 KB Output is correct
13 Correct 11 ms 3840 KB Output is correct
14 Correct 6 ms 3456 KB Output is correct
15 Correct 7 ms 3584 KB Output is correct

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 3456 KB Output is correct
2 Correct 6 ms 3456 KB Output is correct
3 Correct 6 ms 3456 KB Output is correct
4 Correct 7 ms 3584 KB Output is correct
5 Correct 7 ms 3584 KB Output is correct
6 Correct 7 ms 3584 KB Output is correct
7 Correct 7 ms 3584 KB Output is correct
8 Correct 7 ms 3584 KB Output is correct
9 Correct 10 ms 3712 KB Output is correct
10 Correct 6 ms 3456 KB Output is correct
11 Correct 8 ms 3584 KB Output is correct
12 Correct 12 ms 3840 KB Output is correct
13 Correct 11 ms 3840 KB Output is correct
14 Correct 6 ms 3456 KB Output is correct
15 Correct 7 ms 3584 KB Output is correct
16 Correct 1634 ms 41848 KB Output is correct
17 Correct 107 ms 12536 KB Output is correct
18 Correct 146 ms 13816 KB Output is correct
19 Execution timed out 2007 ms 47792 KB Time limit exceeded
20 Halted 0 ms 0 KB -