제출 #443583

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
443583		arwaeystoamneg	Jakarta Skyscrapers (APIO15_skyscraper)	C++17	0 / 100	1 ms	1108 KiB

skyscraper

// EXPLOSION!
#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
#include<chrono>

using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpi;
typedef vector<pair<ll, ll>> vpll;

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

#define pb push_back
#define mp make_pair
#define rsz resize
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define f first
#define s second
#define cont continue
#define endl '\n'
//#define ednl '\n'
#define test int testc;cin>>testc;while(testc--)
#define pr(a, b) trav(x,a)cerr << x << b; cerr << endl;
#define message cout << "Hello World" << endl;
const int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 }; // for every grid problem!!
const ll linf = 4000000000000000000LL;
const ll inf = 998244353;//    1000000007

void pv(vi a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vll a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vector<vi>a) {
	F0R(i, sz(a)) { cout << i << endl; pv(a[i]); cout << endl; }
}void pv(vector<vll>a) { F0R(i, sz(a)) { cout << i << endl; pv(a[i]); }cout << endl; }void pv(vector<string>a) { trav(x, a)cout << x << endl; cout << endl; }
void setIO(string s) {
	ios_base::sync_with_stdio(0); cin.tie(0);
#ifdef arwaeystoamneg
	if (sz(s))
	{
		freopen((s + ".in").c_str(), "r", stdin);
		if (s != "test1")
			freopen((s + ".out").c_str(), "w", stdout);
	}
#endif
}
const int MAX = 33333, k = 200;
int n, m;
pii a[MAX];
int dist[MAX][k];
vi b[MAX];
int main()
{
	setIO("test1");
	cin >> m >> n;
	F0R(i, n)cin >> a[i].f >> a[i].s;
	F0R(i, n)b[a[i].f].pb(a[i].s);
	F0R(i, m)fill(dist[i], dist[i] + k, inf);
	dist[0][0] = 0;
	// dist, position, len. len = 0 means too big
	priority_queue<pair<int, pii>, vector<pair<int, pii>>, greater<pair<int, pii>>>todo;
	todo.push({ 0,{0,0} });
	while (sz(todo))
	{
		pair<int, pii> t = todo.top();
		todo.pop();
		int i = t.s.f, j = t.s.s;
		if (dist[i][j] != t.f)continue;
		if (j == 0)
		{
			trav(x, b[i])
			{
				if (x >= k)
				{
					int c = 0;
					for (int j = i; j >= 0; j -= x, c++)
					{
						if (dist[j][0] > dist[i][0] + c)
						{
							dist[j][0] = dist[i][0] + c;
							todo.push({ dist[j][0], {j,0} });
						}
					}
					c = 1;
					for (int j = i + x; j < m; j += x, c++)
					{
						if (dist[j][0] > dist[i][0] + c)
						{
							dist[j][0] = dist[i][0] + c;
							todo.push({ dist[j][0], {j,0} });
						}
					}
				}
				else
				{
					dist[i][x] = dist[i][0];
					todo.push({ dist[i][x],{i,x} });
				}
			}
		}
		else
		{
			if (i - j >= 0 && dist[i - j][j] > dist[i][j] + 1)
			{
				dist[i - j][j] = dist[i][j] + 1;
				todo.push({ dist[i - j][j], {i - j, j} });
				if (dist[i - j][0] > dist[i - j][j])
				{
					dist[i - j][0] = dist[i - j][j];
					todo.push({ dist[i - j][0],{i - j, 0} });
				}
			}
			if (i + j < m && dist[i + j][j] > dist[i][j] + 1)
			{
				dist[i + j][j] = dist[i][j] + 1;
				todo.push({ dist[i + j][j], {i + j, j} });
				if (dist[i + j][0] > dist[i + j][j])
				{
					dist[i + j][0] = dist[i + j][j];
					todo.push({ dist[i + j][0],{i + j, 0} });
				}
			}
		}
	}
	cout << dist[1][0] << endl;
}

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