| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 228466 | caoash | Jakarta Skyscrapers (APIO15_skyscraper) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
typedef pair<int, pi> pii;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
#define fax(i, a) for (int i = 0; i < (a); i++)
#define f0x(i, a, b) for (int i = (a); i < (b); i++)
#define f0xd(i,a,b) for (int i = (b)-1; i >= (a); i--)
#define faxd(i,a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto& a : x)
#define memeset memset
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rsz resize
template<class T> void ckmin(T &a, T b) { a = min(a, b); }
template<class T> void ckmax(T &a, T b) { a = max(a, b); }
namespace input {
template<class T> void re(complex<T>& x);
template<class T1, class T2> void re(pair<T1,T2>& p);
template<class T> void re(vector<T>& a);
template<class T, size_t SZ> void re(array<T,SZ>& a);
template<class T> void re(T& x) { cin >> x; }
void re(double& x) { string t; re(t); x = stod(t); }
void re(ld& x) { string t; re(t); x = stold(t); }
template<class T, class... Ts> void re(T& t, Ts&... ts) {
re(t); re(ts...);
}
template<class T> void re(complex<T>& x) { T a,b; re(a,b); x = cd(a,b); }
template<class T1, class T2> void re(pair<T1,T2>& p) { re(p.f,p.s); }
template<class T> void re(vector<T>& a) { fax(i,sz(a)) re(a[i]); }
template<class T, size_t SZ> void re(array<T,SZ>& a) { fax(i,SZ) re(a[i]); }
}
using namespace input;
namespace output {
void pr(int x) { cout << x; }
void pr(long x) { cout << x; }
void pr(ll x) { cout << x; }
void pr(unsigned x) { cout << x; }
void pr(unsigned long x) { cout << x; }
void pr(unsigned long long x) { cout << x; }
void pr(float x) { cout << x; }
void pr(double x) { cout << x; }
void pr(ld x) { cout << x; }
void pr(char x) { cout << x; }
void pr(const char* x) { cout << x; }
void pr(const string& x) { cout << x; }
void pr(bool x) { pr(x ? "true" : "false"); }
template<class T1, class T2> void pr(const pair<T1,T2>& x);
template<class T> void pr(const T& x);
template<class T, class... Ts> void pr(const T& t, const Ts&... ts) {
pr(t); pr(ts...);
}
template<class T1, class T2> void pr(const pair<T1,T2>& x) {
pr("{",x.f,", ",x.s,"}");
}
template<class T> void pr(const T& x) {
pr("{"); // const iterator needed for vector<bool>
bool fst = 1; for (const auto& a: x) pr(!fst?", ":"",a), fst = 0;
pr("}");
}
void ps() { pr("\n"); } // print w/ spaces
template<class T, class... Ts> void ps(const T& t, const Ts&... ts) {
pr(t); if (sizeof...(ts)) pr(" "); ps(ts...);
}
void pc() { pr("]\n"); } // debug w/ commas
template<class T, class... Ts> void pc(const T& t, const Ts&... ts) {
pr(t); if (sizeof...(ts)) pr(", "); pc(ts...);
}
#define dbg(x...) pr("[",#x,"] = ["), pc(x);
}
using namespace output;
namespace io {
void setIn(string s) { freopen(s.c_str(),"r",stdin); }
void setOut(string s) { freopen(s.c_str(),"w",stdout); }
void setIO(string s = "") {
ios_base::sync_with_stdio(0); cin.tie(0); // fast I/O
if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
}
}
using namespace io;
mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
const int MOD = 1000000007; // 998244353
const ll INF = 1e18;
const int MX = 30005;
const ld PI = 4*atan((ld)1);
struct pair_hash
{
template <class T1, class T2>
std::size_t operator () (std::pair<T1, T2> const &pair) const
{
std::size_t h1 = std::hash<T1>()(pair.first);
std::size_t h2 = std::hash<T2>()(pair.second);
return h1 ^ h2;
}
};
map<pi, vector<pii>> adj; vector<pi> low, high; unordered_set<int> vals; unordered_set<pi, pair_hash> vis; unordered_set<pi,ll, pair_hash> dist;
int main() {
setIO();
int N,M; re(N,M);
const int LIM = ceil(sqrt((double)N));
pi fst = {-1,-1}; pi sec = {-1,-1};
fax(i,M){
int b,p; re(b,p);
if(fst.f == -1){
fst = mp(b,p);
}
else if(sec.f == -1){
sec = mp(b,p);
}
if(p <= LIM){
low.pb(mp(b,p));
vals.insert(p);
}
else{
high.pb(mp(b,p));
}
}
trav(curr, low){
adj[mp(curr.f, -1)].pb(mp(0,mp(curr.f, curr.s)));
//dbg(mp(curr.f, -1), mp(0,mp(curr.f,curr.s)));
}
trav(curr, high){
for(int j = 1; curr.f + (curr.s*j) < N; j++){
adj[mp(curr.f,-1)].pb(mp(j,mp(curr.f+(curr.s*j),-1)));
//dbg(mp(i,curr.s),mp(j,mp(i+(curr.s*j),-1)));
}
for(int j = 1; curr.f - (curr.s*j) >= 0; j++){
adj[mp(curr.f,-1)].pb(mp(j,mp(curr.f-(curr.s*j),-1)));
//dbg(mp(i,curr.s),mp(j,mp(i-(curr.s*j),-1)));
}
}
fax(i,N){
dist[mp(i,-1)] = INF;
trav(curr, vals){
adj[mp(i,curr)].pb(mp(0,mp(i,-1)));
dist[mp(i,curr)] = INF;
if(i-curr >= 0){
adj[mp(i, curr)].pb(mp(1,mp(i-curr,curr)));
}
if(i + curr < N){
adj[mp(i,curr)].pb(mp(1,mp(i+curr,curr)));
}
}
}
priority_queue<pair<ll,pi>> pq;
pq.push(mp(0,mp(fst.f, -1)));
dist[mp(fst.f, -1)] = 0;
while(!pq.empty()){
pair<ll,pi> fr = pq.top(); pq.pop();
if(vis.count(fr.s)){
continue;
}
for(pii to : adj[fr.s]){
if(vis.count(to.s)){
continue;
}
if(dist[to.s] > dist[fr.s] + to.f){
dist[to.s] = dist[fr.s] + to.f;
pq.push(mp(-dist[to.s], to.s));
}
}
vis.insert(fr.s);
}
ll d = dist[mp(sec.f, -1)];
if(d != INF){
pr(d, "\n");
return 0;
}
pr(-1, "\n");
}