oj.uz

답안 #363648

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
363648 2021-02-06T18:07:26 Z David_M 악어의 지하 도시 (IOI11_crocodile) C++14
100 / 100
 646 ms 73052 KB 
#include "crocodile.h"
#include<bits/stdc++.h>
#define F first
#define S second
#define ll long long
#define pll pair<ll, ll>
using namespace std;
const ll INF=1e18, N=100005;
ll d,x,o,i;
pll D[N];
vector<pll>v[N];
priority_queue<pll>q;
int travel_plan(int n,int m,int R[][2],int L[],int k,int p[]){
	for(i=0;i<m;i++)
		v[R[i][0]].push_back({R[i][1],L[i]}),
		v[R[i][1]].push_back({R[i][0],L[i]});
	
	for(i=0;i<n;i++)D[i]={INF,INF};
	for(i=0;i<k;i++)D[p[i]]={0,0},q.push({0,p[i]});
	
	while(!q.empty()){
		d=-q.top().F;
		x=q.top().S;
		q.pop();
		if(d>D[x].F)continue;
		for (auto[y,l]:v[x]){
			o=D[y].F;
			if(D[y].F>d+l)D[y].F=d+l;
			if(D[y].F<D[y].S)swap(D[y].F,D[y].S);
			if(D[y].F!=o)q.push({-D[y].F,y});
		}
	}
	return D[0].F;
}

Compilation message

crocodile.cpp: In function 'int travel_plan(int, int, int (*)[2], int*, int, int*)':
crocodile.cpp:26:12: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   26 |   for (auto[y,l]:v[x]){
      |            ^

Subtask #1
46.0 / 46.0

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

Subtask #2
43.0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2668 KB Output is correct
2 Correct 2 ms 2668 KB Output is correct
3 Correct 2 ms 2668 KB Output is correct
4 Correct 3 ms 2796 KB Output is correct
5 Correct 3 ms 2796 KB Output is correct
6 Correct 2 ms 2796 KB Output is correct
7 Correct 3 ms 2796 KB Output is correct
8 Correct 3 ms 2796 KB Output is correct
9 Correct 4 ms 3052 KB Output is correct
10 Correct 2 ms 2668 KB Output is correct
11 Correct 3 ms 2796 KB Output is correct
12 Correct 5 ms 3308 KB Output is correct
13 Correct 6 ms 3436 KB Output is correct
14 Correct 2 ms 2796 KB Output is correct
15 Correct 3 ms 2796 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2668 KB Output is correct
2 Correct 2 ms 2668 KB Output is correct
3 Correct 2 ms 2668 KB Output is correct
4 Correct 3 ms 2796 KB Output is correct
5 Correct 3 ms 2796 KB Output is correct
6 Correct 2 ms 2796 KB Output is correct
7 Correct 3 ms 2796 KB Output is correct
8 Correct 3 ms 2796 KB Output is correct
9 Correct 4 ms 3052 KB Output is correct
10 Correct 2 ms 2668 KB Output is correct
11 Correct 3 ms 2796 KB Output is correct
12 Correct 5 ms 3308 KB Output is correct
13 Correct 6 ms 3436 KB Output is correct
14 Correct 2 ms 2796 KB Output is correct
15 Correct 3 ms 2796 KB Output is correct
16 Correct 504 ms 66912 KB Output is correct
17 Correct 79 ms 14444 KB Output is correct
18 Correct 112 ms 16748 KB Output is correct
19 Correct 646 ms 73052 KB Output is correct
20 Correct 361 ms 55048 KB Output is correct
21 Correct 39 ms 8428 KB Output is correct
22 Correct 340 ms 50160 KB Output is correct