oj.uz

답안 #241380

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
241380 2020-06-24T07:12:46 Z Berted Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 1000 ms 118432 KB 
#include <iostream>
#include <vector>
#include <bitset>
#include <map>
#include <set>
#include <queue>
#define pii pair<int, int>
#define fst first
#define snd second
#define vi vector<int>
#define vpi vector<pii>
#define pub push_back
using namespace std;

const int MX = 1e9;

int n, m, s, e, dst[30001] = {};
vector<map<int, int>> adj;
vector<set<int>> edgeQuery;
priority_queue<pii, vector<pii>, greater<pii>> pq;

int dijkstra()
{
	pq.push({0, s});
	dst[s] = 0;
	while (pq.size())
	{
		pii dt = pq.top(); pq.pop();
		if (dst[dt.snd] == dt.fst)
		{
			//cout << "DIK : " << dt.snd << ", " << dt.fst << "\n";
			if (dt.snd == e) {return dt.fst;}
			for (auto v : adj[dt.snd])
			{
				if (dt.fst + v.snd < dst[v.fst])
				{
					dst[v.fst] = dt.fst + v.snd;
					pq.push({dt.fst + v.snd, v.fst});
				}
			}
		}
	}
	return -1;
}

int main()
{
	// ios :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
	cin >> n >> m;
	for (int i = 0; i < n; i++) 
	{
		adj.pub(map<int, int>()); 
		edgeQuery.pub(set<int>());
		dst[i] = MX;
	}
	for (int i = 0; i < m; i++)
	{
		int u, t; cin >> u >> t;
		edgeQuery[u].insert(t);
		if (i == 0) s = u;
		else if (i == 1) e = u;
	}
	vi temp;
	for (int i = 0; i < n; i++)
	{
		// cout << i << "\n";
		while (edgeQuery[i].size())
		{
			int x = *edgeQuery[i].begin(), s = i % x, lst = -1, cnt = 0;
			//cout << " - " << i << " " << x << "\n";
			for (; s < n; s += x)
			{
				if (edgeQuery[s].count(x))
				{
					edgeQuery[s].erase(x);
					if (lst >= 0)
					{
						//cout << "CON " << lst << " " << s << "\n";
						if (adj[lst].count(s)) adj[lst][s] = min(adj[lst][s], cnt);
						else adj[lst][s] = cnt;
						//cout << "CON " << s << " " << lst << "\n";
						if (adj[s].count(lst)) adj[s][lst] = min(adj[s][lst], cnt);
						else adj[s][lst] = cnt;
					}
					lst = s; cnt = 1;
					for (int i = (int)temp.size() - 1; i >= 0; i--)
					{
						//cout << "CON " << s << " " << temp[i] << "\n";
						if (adj[s].count(temp[i])) adj[s][temp[i]] = min(adj[s][temp[i]], cnt);
						else {adj[s][temp[i]] = cnt;}
						cnt++;
					}
					temp.clear();
					cnt = 0;
				}
				else
				{
					if (lst >= 0) 
					{
						//cout << "CON " << lst << " " << s << "\n";
						if (adj[lst].count(s)) adj[lst][s] = min(adj[lst][s], cnt);
						else adj[lst][s] = cnt;
					}
					temp.push_back(s);
				}
				cnt++;
			}
			temp.clear();
		}
	}
	/*
	for (int i = 0; i < n; i++)
	{
		cout << i << "-th node adjacency list :\n";
		for (auto x : adj[i])
		{
			cout << x.fst << ", " << x.snd << '\n';
		}
	}
	cout << "Here\n";
	*/
	
	cout << dijkstra() << '\n';
	return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 256 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 308 KB Output is correct
5 Correct 5 ms 256 KB Output is correct
6 Correct 4 ms 256 KB Output is correct
7 Correct 5 ms 256 KB Output is correct
8 Correct 4 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 7 ms 512 KB Output is correct
12 Correct 6 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 7 ms 512 KB Output is correct
15 Correct 7 ms 512 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 6 ms 256 KB Output is correct
5 Correct 5 ms 256 KB Output is correct
6 Correct 5 ms 256 KB Output is correct
7 Correct 4 ms 256 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 8 ms 512 KB Output is correct
12 Correct 6 ms 384 KB Output is correct
13 Correct 6 ms 384 KB Output is correct
14 Correct 7 ms 512 KB Output is correct
15 Correct 7 ms 512 KB Output is correct
16 Correct 6 ms 512 KB Output is correct
17 Correct 8 ms 1152 KB Output is correct
18 Correct 6 ms 768 KB Output is correct
19 Correct 6 ms 768 KB Output is correct
20 Correct 6 ms 768 KB Output is correct
21 Correct 6 ms 384 KB Output is correct
22 Correct 7 ms 768 KB Output is correct
23 Correct 7 ms 768 KB Output is correct
24 Correct 10 ms 1024 KB Output is correct
25 Correct 8 ms 896 KB Output is correct
26 Correct 8 ms 1024 KB Output is correct
27 Correct 7 ms 896 KB Output is correct
28 Correct 9 ms 1536 KB Output is correct
29 Correct 19 ms 2176 KB Output is correct
30 Correct 9 ms 1280 KB Output is correct
31 Correct 13 ms 1792 KB Output is correct
32 Correct 10 ms 1664 KB Output is correct
33 Correct 32 ms 2944 KB Output is correct
34 Correct 32 ms 2936 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Correct 5 ms 256 KB Output is correct
6 Correct 5 ms 256 KB Output is correct
7 Correct 5 ms 256 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 7 ms 512 KB Output is correct
12 Correct 6 ms 384 KB Output is correct
13 Correct 6 ms 384 KB Output is correct
14 Correct 7 ms 512 KB Output is correct
15 Correct 7 ms 512 KB Output is correct
16 Correct 6 ms 512 KB Output is correct
17 Correct 9 ms 1152 KB Output is correct
18 Correct 7 ms 768 KB Output is correct
19 Correct 7 ms 768 KB Output is correct
20 Correct 7 ms 768 KB Output is correct
21 Correct 6 ms 512 KB Output is correct
22 Correct 6 ms 768 KB Output is correct
23 Correct 7 ms 768 KB Output is correct
24 Correct 10 ms 1020 KB Output is correct
25 Correct 8 ms 896 KB Output is correct
26 Correct 8 ms 1024 KB Output is correct
27 Correct 8 ms 896 KB Output is correct
28 Correct 10 ms 1536 KB Output is correct
29 Correct 19 ms 2176 KB Output is correct
30 Correct 9 ms 1280 KB Output is correct
31 Correct 13 ms 1792 KB Output is correct
32 Correct 10 ms 1664 KB Output is correct
33 Correct 33 ms 3072 KB Output is correct
34 Correct 33 ms 3072 KB Output is correct
35 Correct 48 ms 4600 KB Output is correct
36 Correct 11 ms 1152 KB Output is correct
37 Correct 60 ms 8568 KB Output is correct
38 Correct 64 ms 7416 KB Output is correct
39 Correct 64 ms 7544 KB Output is correct
40 Correct 65 ms 7544 KB Output is correct
41 Correct 65 ms 7544 KB Output is correct
42 Correct 24 ms 1152 KB Output is correct
43 Correct 25 ms 1024 KB Output is correct
44 Correct 23 ms 896 KB Output is correct
45 Correct 147 ms 10872 KB Output is correct
46 Correct 147 ms 10872 KB Output is correct

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 4 ms 256 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Correct 5 ms 256 KB Output is correct
6 Correct 5 ms 256 KB Output is correct
7 Correct 5 ms 256 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 9 ms 512 KB Output is correct
12 Correct 6 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 7 ms 512 KB Output is correct
15 Correct 7 ms 512 KB Output is correct
16 Correct 6 ms 512 KB Output is correct
17 Correct 9 ms 1152 KB Output is correct
18 Correct 7 ms 768 KB Output is correct
19 Correct 6 ms 768 KB Output is correct
20 Correct 6 ms 768 KB Output is correct
21 Correct 6 ms 512 KB Output is correct
22 Correct 6 ms 768 KB Output is correct
23 Correct 7 ms 768 KB Output is correct
24 Correct 9 ms 1024 KB Output is correct
25 Correct 8 ms 896 KB Output is correct
26 Correct 8 ms 1024 KB Output is correct
27 Correct 7 ms 896 KB Output is correct
28 Correct 9 ms 1536 KB Output is correct
29 Correct 19 ms 2048 KB Output is correct
30 Correct 9 ms 1280 KB Output is correct
31 Correct 12 ms 1792 KB Output is correct
32 Correct 10 ms 1664 KB Output is correct
33 Correct 32 ms 2936 KB Output is correct
34 Correct 32 ms 3064 KB Output is correct
35 Correct 46 ms 4728 KB Output is correct
36 Correct 11 ms 1152 KB Output is correct
37 Correct 71 ms 8696 KB Output is correct
38 Correct 64 ms 7544 KB Output is correct
39 Correct 67 ms 7544 KB Output is correct
40 Correct 64 ms 7544 KB Output is correct
41 Correct 64 ms 7544 KB Output is correct
42 Correct 24 ms 1144 KB Output is correct
43 Correct 24 ms 1024 KB Output is correct
44 Correct 24 ms 896 KB Output is correct
45 Correct 147 ms 10872 KB Output is correct
46 Correct 148 ms 11000 KB Output is correct
47 Correct 189 ms 38316 KB Output is correct
48 Correct 66 ms 13088 KB Output is correct
49 Correct 48 ms 8876 KB Output is correct
50 Correct 43 ms 9376 KB Output is correct
51 Correct 102 ms 18848 KB Output is correct
52 Correct 114 ms 20896 KB Output is correct
53 Correct 59 ms 8608 KB Output is correct
54 Correct 15 ms 5036 KB Output is correct
55 Correct 31 ms 7596 KB Output is correct
56 Correct 35 ms 6316 KB Output is correct
57 Correct 126 ms 38176 KB Output is correct
58 Correct 45 ms 7712 KB Output is correct
59 Correct 55 ms 9380 KB Output is correct
60 Correct 66 ms 12192 KB Output is correct
61 Correct 52 ms 8744 KB Output is correct
62 Correct 125 ms 25376 KB Output is correct
63 Correct 768 ms 96804 KB Output is correct
64 Correct 901 ms 109600 KB Output is correct
65 Execution timed out 1100 ms 118432 KB Time limit exceeded
66 Halted 0 ms 0 KB -