제출 #707092

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
707092		600Mihnea	Jakarta Skyscrapers (APIO15_skyscraper)	C++17	57 / 100	1093 ms	3404 KiB

skyscraper

#include <cmath>
#include <functional>
#include <fstream>
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <set>
#include <map>
#include <list>
#include <time.h>
#include <math.h>
#include <random>
#include <deque>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <cassert>
#include <bitset>
#include <sstream>
#include <chrono>
#include <cstring>
#include <numeric>

using namespace std;

const int INF = (int)1e9 + 7;

struct T
{
	int pos;
	int delta;
};

signed main()
{
#ifdef ONPC	
	FILE* stream;
	freopen_s(&stream, "input.txt", "r", stdin);
#else
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#endif

	int dim, cntofs;
	cin >> dim >> cntofs;

	vector<T> ofs(cntofs);
	vector<vector<int>> cine(dim);
	for (int i = 0; i < cntofs; i++)
	{
		cin >> ofs[i].pos >> ofs[i].delta;
		assert(0 <= ofs[i].pos && ofs[i].pos < dim);
		cine[ofs[i].pos].push_back(i);
	}


	vector<int> dp(dim, INF);

	priority_queue<pair<int, int>> pq;

	auto relax = [&](int i, int val)
	{
		if (val < dp[i])
		{
			dp[i] = val;
			pq.push({ -dp[i], i });
		}
	};

	relax(ofs[0].pos, 0);
	while (!pq.empty())
	{
		auto it = pq.top();
		pq.pop();
		int loc = it.second;
		if (-it.first != dp[loc])
		{
			continue;
		}
		for (auto& i : cine[loc])
		{
			for (int loc2 = loc % ofs[i].delta; loc2 < dim; loc2 += ofs[i].delta)
			{
				int posdif = abs(ofs[i].pos - loc2);
				relax(loc2, dp[loc] + posdif / ofs[i].delta);
			}
		}
	}
	for (int i = 0; i < dim; i++)
	{
		//cout << i << " ---> " << dp[i] << "\n";
	}
	int sol = (dp[ofs[1].pos] == INF) ? (-1) : (dp[ofs[1].pos]);
	cout << sol << "\n";
	return 0;
}

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