제출 #110033

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
110033		aminra	Jakarta Skyscrapers (APIO15_skyscraper)	C++14	100 / 100	572 ms	95888 KiB

skyscraper

//I forgot you...
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const int MOD = (int)1e9 + 7;
const int MAXN = 3e4 + 3;
const int SQRT = (int)10;
const int infint = (int)1e9 + 3;
const ll inf = (ll)1e18;
int dist[MAXN * SQRT], ldir[MAXN][SQRT], rdir[MAXN][SQRT], n, m;
vector<pair<int, int> > G[SQRT * MAXN];
inline void add(int u, int v, int w)
{
	G[u].push_back({v, w});
}
int dijkstra(int src, int sink)
{
	for (int i = 0; i < MAXN * SQRT; i++)
		dist[i] = infint;
	
	dist[src] = 0;
	set<pair<int, int> > S;
	for (int i = 0; i < MAXN * SQRT; i++)
		S.insert({dist[i], i});
	while(!S.empty())
	{
		pair<int, int> st = *S.begin();
		S.erase(st);
		if(st.first == infint)
			continue;
		for (auto v : G[st.second])
			if(st.first + v.second < dist[v.first])
			{
				S.erase({dist[v.first], v.first});
				dist[v.first] = st.first + v.second;
				S.insert({dist[v.first], v.first});
			}
	}
	if(dist[sink] == infint)
		return -1;
	else
		return dist[sink];
}
int main()
{
	ios::sync_with_stdio(false); 
	cin.tie(0); cout.tie(0);
	cin >> n >> m;
	int src = -1, sink = -1;
	for (int i = 0; i < m; i++)
	{
		int b, p;
		cin >> b >> p;
		if(i == 0)
			src = b;
		if(i == 1)
			sink = b;

		if(p < SQRT)
		{
			ldir[b][p] = 1;
			rdir[b][p] = 1;
			add(b, b + n * p, 0);
		}
		else
		{
			for (int j = 1; b - j * p >= 0; j++)
                add(b, b - j * p, j);
            for (int j = 1; b + j * p < n; j++)
            	add(b, b + j * p, j);
		}
	}
	for (int i = 1; i < SQRT; i++)
	{
        for (int j = i; j < n; j++)
            rdir[j][i] |= rdir[j - i][i];
        for (int j = n - i - 1; j >= 0; j--)
            ldir[j][i] |= ldir[j + i][i];
    }
    for (int i = 1; i < SQRT; i++)
    	for (int j = 0; j < n - i; j++)
    		if(rdir[j][i])
    			add(j + n * i, j + (n + 1) * i, 1);
 
	 for (int i = 1; i < SQRT; i++)
	 	for (int j = i; j < n; j++)
		 	if(ldir[j][i])
		 		add(j + n * i, j + (n - 1) * i, 1);
	
	for (int i = 1; i < SQRT; i++)
		for (int j = 0; j < n; j++)
			add(j + n * i, j, 0);
	
    cout << dijkstra(src, sink);
}

• Subtask 1: 10 / 10
• Subtask 2: 12 / 12
• Subtask 3: 14 / 14
• Subtask 4: 21 / 21
• Subtask 5: 43 / 43