답안 #28500

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
28500 2017-07-16T06:45:09 Z 三( ε:)(#1146, xdoju, veckal, unused) Alternative Mart (FXCUP2_mart) C++14
0 / 1
2426 ms 46032 KB
#include <cstdio>
#include <vector>
#include <queue>
#include <set>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef pair<ll, int> li;
typedef pair<ll, ii> lii;

int main() {
	//freopen("input.txt", "r", stdin);
	int n, m, k, q;
	scanf("%d%d%d%d", &n, &m, &k, &q);
	vector<set<li>> dist(n); // (distance, from)
	vector<vector<ii>> adj(n); // (destination, weight)
	priority_queue<lii> pq; // (-distance, (here, from))
	while (k--) {
		int s;
		scanf("%d", &s);
		--s;
		dist[s].emplace(0ll, s);
		pq.emplace(0ll, ii(s, s));
	}
	while (m--) {
		int p, q, v;
		scanf("%d%d%d", &p, &q, &v);
		--p; --q;
		adj[p].emplace_back(q, v);
		adj[q].emplace_back(p, v);
	}
	while (!pq.empty()) {
		ll weight = -pq.top().first;
		int here = pq.top().second.first;
		int from = pq.top().second.second;
		pq.pop();
		bool skip = false;
		bool hasFrom = false;
		for (li p : dist[here]) {
			if (p.second != from)
				continue;
			hasFrom = true;
			if (weight > p.first)
				skip = true;
			break;
		}
		if (skip || !hasFrom) continue;
		for (ii p : adj[here]) {
			int next = p.first;
			ll nweight = weight + p.second;
			bool skip = false;
			bool hasFrom = false;
			for (auto it = dist[next].begin(); it != dist[next].end(); ++it) {
				if (it->second != from) continue;
				hasFrom = true;
				if (it->first <= nweight)
					skip = true;
				else
					dist[next].erase(it);
				break;
			}
			if (!hasFrom && dist[next].size() >= 11) {
				if (dist[next].rbegin()->first <= nweight)
					skip = true;
				else
					dist[next].erase(--dist[next].end());
			}
			if (skip) continue;
			dist[next].emplace(nweight, from);
			pq.emplace(-nweight, ii(next, from));
		}
	}
	while (q--) {
		int target, x;
		scanf("%d%d", &target, &x);
		--target;
		set<int> closed;
		while (x--) {
			int c;
			scanf("%d", &c);
			closed.insert(--c);
		}
		for (li p : dist[target]) {
			if (closed.find(p.second) == closed.end()) {
				printf("%d %lld\n", p.second + 1, p.first);
				break;
			}
		}
	}
	return 0;
}

Compilation message

mart.cpp: In function 'int main()':
mart.cpp:14:35: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%d%d", &n, &m, &k, &q);
                                   ^
mart.cpp:20:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &s);
                  ^
mart.cpp:27:30: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d", &p, &q, &v);
                              ^
mart.cpp:75:29: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", &target, &x);
                             ^
mart.cpp:80:19: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d", &c);
                   ^
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 1940 KB Output is correct
2 Correct 0 ms 1940 KB Output is correct
3 Correct 0 ms 1940 KB Output is correct
4 Correct 0 ms 1940 KB Output is correct
5 Correct 0 ms 2072 KB Output is correct
6 Correct 0 ms 2072 KB Output is correct
7 Correct 3 ms 2336 KB Output is correct
8 Correct 6 ms 2336 KB Output is correct
9 Correct 69 ms 2992 KB Output is correct
10 Correct 23 ms 2908 KB Output is correct
11 Correct 66 ms 6084 KB Output is correct
12 Correct 56 ms 5932 KB Output is correct
13 Correct 833 ms 13800 KB Output is correct
14 Correct 883 ms 13848 KB Output is correct
15 Correct 79 ms 10636 KB Output is correct
16 Correct 66 ms 10208 KB Output is correct
17 Correct 1253 ms 39568 KB Output is correct
18 Correct 856 ms 38324 KB Output is correct
19 Correct 1909 ms 43736 KB Output is correct
20 Correct 1369 ms 41360 KB Output is correct
21 Correct 1826 ms 43712 KB Output is correct
22 Correct 1896 ms 41528 KB Output is correct
23 Correct 2209 ms 45760 KB Output is correct
24 Correct 2186 ms 43448 KB Output is correct
25 Correct 1953 ms 45760 KB Output is correct
26 Correct 2059 ms 43448 KB Output is correct
27 Correct 149 ms 10996 KB Output is correct
28 Correct 119 ms 10764 KB Output is correct
29 Correct 1966 ms 40904 KB Output is correct
30 Correct 1676 ms 39536 KB Output is correct
31 Incorrect 2426 ms 46032 KB Output isn't correct
32 Halted 0 ms 0 KB -