제출 #968407

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
968407		dubabuba	사이버랜드 (APIO23_cyberland)	C++17	49 / 100	123 ms	34656 KiB

cyberland

#include <bits/stdc++.h>
#include "cyberland.h"
 
#pragma GCC optimize("O3")
#pragma GCC target("lzcnt", "popcnt")
 
using namespace std;
 
typedef double dbl;
typedef vector<int> vi;
typedef long long i64;
typedef pair<int, int> pii;
#define ff first
#define ss second
#define MP make_pair
 
const int mxk = 32;
const int mxn = 1e5 + 10;
vector<pii> adj[mxn];
dbl dis[mxk][mxn];
bool vis[mxn];
 
template<typename T> void ono_min(T &MIN, T CMP) { if(MIN > CMP) MIN = CMP; }
 
double solve(int N, int M, int K, int H, vi x, vi y, vi c, vi arr) {
	for(int i = 0; i < N; i++)
		adj[i].clear();
	for(int i = 0; i < M; i++) {
		adj[x[i]].push_back(MP(y[i], c[i]));
		adj[y[i]].push_back(MP(x[i], c[i]));
	}
 
	priority_queue<pair<pair<dbl, int>, int>> pq;
	for(int i = 0; i < N; i++)
	for(int j = 0; j <= K && j < mxk; j++)
		dis[j][i] = -1.0;
	for(int i = 0; i < N; i++)
		vis[i] = 0;
 
	queue<int> q;
	vis[0] = 1;
	q.push(0);
 
	pq.push(MP(MP(0.0, 0), 0));
	while(q.size()) {
		int u = q.front();
		q.pop();
 
		if(arr[u] == 0)
			pq.push(MP(MP(0.0, 0), u));
		if(u == H) continue;
 
		for(pii p : adj[u]) {
			int v = p.ff;
			if(!vis[v]) {
				vis[v] = 1;
				q.push(v);
			}
		}
	}
 
	// for(int i = 0; i < M; i++)
	// 	cout << x[i] << " <--> " << y[i] << " (" << c[i] << ")\n";
 
	// for(int i = 0; i < N; i++) {
	// 	cout << i << ": ";
	// 	for(pii p : adj[i])
	// 		cout << p.ff << ' ';
	// 	cout << endl;
	// }
 
	while(pq.size()) {
		dbl d = -pq.top().ff.ff;
		int k = pq.top().ff.ss;
		int u = pq.top().ss;
		pq.pop();
 
		if(dis[k][u] > -1.0) continue;
		// cout << u << ' ' << k << " = " << d << endl;
		if(u == H) return d;
		dis[k][u] = d;
		if(u == H) continue;
	
		for(pii p : adj[u]) {
			int v = p.ff;
			dbl c = p.ss;
			
			// cout << " " << v;
			if(dis[k][v] == -1.0)
				pq.push(MP(MP(-(d + c), k), v));
			if(arr[v] == 2 && k < K && k < mxk)
			if(dis[k + 1][v] == -1.0)
				pq.push(MP(MP(-(d + c) / 2.0, k + 1), v));
		}
		// cout << endl;
	}
	return -1;
}

• Subtask 1: 5 / 5
• Subtask 2: 8 / 8
• Subtask 3: 13 / 13
• Subtask 4: 0 / 19
• Subtask 5: 7 / 7
• Subtask 6: 16 / 16
• Subtask 7: 0 / 29
• Subtask 8: 0 / 3