oj.uz

답안 #233524

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
233524 2020-05-20T19:51:53 Z crossing0ver 악어의 지하 도시 (IOI11_crocodile) C++17
89 / 100
 1810 ms 68408 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() (int a,   int b)  {
		if (Ein[a] >= 2 && Ein[b] >= 2)
			return dis[a] <= dis[b];
			if (Ein[a] < 2) return 0;
			else return 1;
	}
};
 
long long 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];	
}

Compilation message

crocodile.cpp: In member function 'bool cmp::operator()(int, int)':
crocodile.cpp:15:3: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   if (Ein[a] >= 2 && Ein[b] >= 2)
   ^~
crocodile.cpp:17:4: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
    if (Ein[a] < 2) return 0;
    ^~

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 7 ms 3584 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 7 ms 3584 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 3840 KB Output is correct
10 Correct 6 ms 3456 KB Output is correct
11 Correct 8 ms 3584 KB Output is correct
12 Correct 13 ms 4096 KB Output is correct
13 Correct 12 ms 4352 KB Output is correct
14 Correct 7 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 7 ms 3584 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 3840 KB Output is correct
10 Correct 6 ms 3456 KB Output is correct
11 Correct 8 ms 3584 KB Output is correct
12 Correct 13 ms 4096 KB Output is correct
13 Correct 12 ms 4352 KB Output is correct
14 Correct 7 ms 3456 KB Output is correct
15 Correct 7 ms 3584 KB Output is correct
16 Incorrect 1810 ms 68408 KB Output isn't correct
17 Halted 0 ms 0 KB -