Submission #392364

#	Time	Username	Problem	Language	Result	Execution time	Memory
392364		osaaateiasavtnl	Jakarta Skyscrapers (APIO15_skyscraper)	C++14	100 / 100	74 ms	9804 KiB

skyscraper

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <bitset>
#include <fstream>
using namespace std;
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcountll
#define ll long long
#define mp make_pair
#define x first
#define y second
#define Time (double)clock()/CLOCKS_PER_SEC
#define debug(x) std::cerr << #x << ": " << x << '\n';
#define FOR(i, n) for (int i = 0; i < n; ++i)
#define FORN(i, n) for (int i = 1; i <= n; ++i)
#define pb push_back
#define trav(a, x) for (auto& a : x)
using vi = vector<int>;
template <typename T>
std::istream& operator >>(std::istream& input, std::vector<T>& data)
{
    for (T& x : data)
        input >> x;
    return input;
}
template <typename T>
std::ostream& operator <<(std::ostream& output, const pair <T, T> & data)
{
    output << "(" << data.x << "," << data.y << ")";
    return output;
}
template <typename T>
std::ostream& operator <<(std::ostream& output, const std::vector<T>& data)
{
    for (const T& x : data)
        output << x << " ";
    return output;
}
ll div_up(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded up
ll div_down(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded down 
ll math_mod(ll a, ll b) { return a - b * div_down(a, b); }
#define tcT template<class T
#define tcTU tcT, class U
tcT> using V = vector<T>; 
tcT> void re(V<T>& x) { 
    trav(a, x)
        cin >> a;
}
tcT> bool ckmin(T& a, const T& b) {
    return b < a ? a = b, 1 : 0; 
} // set a = min(a,b)
tcT> bool ckmax(T& a, const T& b) {
    return a < b ? a = b, 1 : 0; 
}
ll gcd(ll a, ll b) {
    while (b) {
        tie(a, b) = mp(b, a % b);
    }
    return a;
}
const int N = 30007, INF = 1e9+7;
int n, m;
int dist[N];
vi have[N];
int pos[N], step[N];
bool used[N];

const int K = 200;
bool vis[K][N];

signed main() {
    #ifdef LOCAL
    #else
    #define endl '\n'
    ios_base::sync_with_stdio(0); cin.tie(0);
    #endif
    FOR (i, N) {
    	dist[i] = INF;
    }
    cin >> n >> m;
    FOR (i, m) {
    	cin >> pos[i] >> step[i];
    	have[pos[i]].app(step[i]);
    }
    dist[pos[0]] = 0;
    priority_queue <ii> q;
    q.push(mp(0, pos[0]));
    while (q.size()) {
    	int u = q.top().y; q.pop();
    	if (used[u]) {
    		continue;
    	}
    	used[u] = 1;
    	auto relax = [&] (int v, int c) {
    		if (ckmin(dist[v], c)) {
    			q.push(mp(-dist[v], v));
    		}
    	};
    	trav (d, have[u]) {
    		for (int i = 1; i * d <= u; ++i) {
    			if (d < K) {
	    			if (vis[d][u - i * d]) {
	    				break;
	    			}
	    			vis[d][u - i * d] = 1;    				
    			}
    			relax(u - i * d, dist[u] + i);
    		}
    		for (int i = 1; u + i * d < n; ++i) {
    			if (d < K) {
	    			if (vis[d][u + i * d]) {
	    				break;
	    			}
	    			vis[d][u + i * d] = 1;    				
    			}
    			relax(u + i * d, dist[u] + i);
    		}
    	}
    }
    if (dist[pos[1]] == INF) {
    	cout << -1 << endl;
    }
    else {
    	cout << dist[pos[1]] << endl;
    }
}

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