oj.uz

답안 #233406

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
233406 2020-05-20T12:32:21 Z crossing0ver 악어의 지하 도시 (IOI11_crocodile) C++17
89 / 100
 2000 ms 110344 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];
multiset <ll> IN[100000];
bool vis[100000];
int Ein[100000],v,x;
ll dis[100000],d;
ll val;
struct cmp{
//pair<int,pair<int,int> > a,  b	;
	bool operator() (const  int &a,  const int &b) const {
		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] });
	}
	fill(dis,dis + 100000,2000000000000000);
	set<int,cmp>  s;
	for (int i = 0; i < K; i++) 
		Ein[P[i]] = 2,dis[P[i]] = 0,s.insert (P[i]);
	//	cout << s.size() ;
	while (!s.empty()) {
		 v = *s.begin();
		 val = dis[v];
		if (Ein[v] < 2) break;   //cout << v <<' ';         
		s.erase(s.begin());
		if (vis[v]) continue;
		dis[v] = val;
		vis[v] = 1;
		for (auto i : adj[v]) {
			
			 x = i.se;
			if (vis[x]) continue;
			ll d = i.fi;
			IN[x].insert(dis[v] + d);
			s.erase ( x );
			Ein[x] ++;
			if (IN[x].size() >= 2) {
				auto it = IN[x].begin();
				it++;
				if (dis[x] > *it) {
					dis[x] = *it;
				}
			}
			s.insert (x);
		}
	}
	return dis[0];	
} /*    
main() {               int n,m,k;
	cin >> n >> m >> k;
	int R[m][2],L[m]; for(int i = 0; i < m ; i++ )cin >> R[i][0] >> R[i][1] >> L[i];
	  int P[k]; for (int i = 0 ; i < k ; i++) cin >> P[i];
	cout << travel_plan(n,m,R,L,k,P);
			 /*
}  
/* 5 4 3
 0 1 2
 0 2 3
 3 2 1
 2 4 4
 1 3 4
 */

Compilation message

crocodile.cpp:65:5: warning: "/*" within comment [-Wcomment]
     /*
      
crocodile.cpp:67:1: warning: "/*" within comment [-Wcomment]
 /* 5 4 3

Subtask #1
46.0 / 46.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 8192 KB Output is correct
2 Correct 9 ms 8192 KB Output is correct
3 Correct 9 ms 8192 KB Output is correct
4 Correct 11 ms 8320 KB Output is correct
5 Correct 10 ms 8320 KB Output is correct
6 Correct 10 ms 8320 KB Output is correct
7 Correct 10 ms 8320 KB Output is correct
8 Correct 10 ms 8320 KB Output is correct

Subtask #2
43.0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 8192 KB Output is correct
2 Correct 9 ms 8192 KB Output is correct
3 Correct 9 ms 8192 KB Output is correct
4 Correct 11 ms 8320 KB Output is correct
5 Correct 10 ms 8320 KB Output is correct
6 Correct 10 ms 8320 KB Output is correct
7 Correct 10 ms 8320 KB Output is correct
8 Correct 10 ms 8320 KB Output is correct
9 Correct 14 ms 8832 KB Output is correct
10 Correct 10 ms 8192 KB Output is correct
11 Correct 11 ms 8448 KB Output is correct
12 Correct 19 ms 9344 KB Output is correct
13 Correct 16 ms 9472 KB Output is correct
14 Correct 10 ms 8192 KB Output is correct
15 Correct 10 ms 8320 KB Output is correct

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 8192 KB Output is correct
2 Correct 9 ms 8192 KB Output is correct
3 Correct 9 ms 8192 KB Output is correct
4 Correct 11 ms 8320 KB Output is correct
5 Correct 10 ms 8320 KB Output is correct
6 Correct 10 ms 8320 KB Output is correct
7 Correct 10 ms 8320 KB Output is correct
8 Correct 10 ms 8320 KB Output is correct
9 Correct 14 ms 8832 KB Output is correct
10 Correct 10 ms 8192 KB Output is correct
11 Correct 11 ms 8448 KB Output is correct
12 Correct 19 ms 9344 KB Output is correct
13 Correct 16 ms 9472 KB Output is correct
14 Correct 10 ms 8192 KB Output is correct
15 Correct 10 ms 8320 KB Output is correct
16 Execution timed out 2096 ms 110344 KB Time limit exceeded
17 Halted 0 ms 0 KB -