제출 #560128

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
560128		armashka	밀림 점프 (APIO21_jumps)	C++17	37 / 100	4026 ms	20816 KiB

jumps

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
 
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
 
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file(s) freopen(s".in", "r", stdin);freopen(s".out", "w", stdout);
#define nano chrono::steady_clock::now().time_since_epoch().count()
#define uid uniform_int_distribution<int>
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define pb push_back
#define sz size()
#define ft first
#define sd second
 
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef unsigned long long ull;
    
const int N = 2e5 + 10;
const int M = 2e3 + 5;
const ll inf = 1e15;
const ll mod = 998244353;
const double Pi = acos(-1); 
 
ll binpow(ll x, ll ti) { ll res = 1;while (ti){if(ti & 1)res *= x;x *= x;ti >>= 1; x %= mod; res %= mod;} return res;}
ll binmul(ll x, ll ti) { ll res = 0;while (ti){if(ti & 1)res += x;x += x;ti >>= 1; x %= mod; res %= mod;} return res;}
ll random(ll l, ll r) { mt19937 rnd(nano); uid dist(l, r); return dist(rnd); }
ll nok(ll a, ll b) { return (a*b)/__gcd(abs(a),abs(b)) * (a*b > 0 ? 1 : -1); }
bool odd(ll n) { return (n % 2 == 1); }                                   
bool even(ll n) { return (n % 2 == 0); }

int n, a[N], dis[2005][2005], d[N];
vector <int> g[N];
bool ok = 1;

void init(int N, vector <int> H) {
	n = N;
	for (int i = 1; i <= n; ++ i) {
		a[i] = H[i - 1];
		if (a[i] != i) {
			ok = 0;
		}
	}
	deque <int> d;
	d.push_back(0);
	a[0] = 1e9;
	for (int i = 1; i <= n; ++ i) {
		while (d.sz && a[d.back()] <= a[i]) d.pop_back();
		if (d.back() != 0) {
			g[i].pb(d.back());
		}
		d.push_back(i);
	}
	d.clear();
	a[n + 1] = 1e9;
	d.push_back(n + 1);
	for (int i = n; i >= 1; -- i) {
		while (d.sz && a[d.back()] <= a[i]) d.pop_back();
		if (d.back() != n + 1) {
			g[i].pb(d.back());
		}
		d.push_back(i);
	}
	
	if (n <= 2000) {
		for (int i = 1; i <= n; ++ i) {
			for (int j = 1; j <= n; ++ j) dis[i][j] = 1e9;
			queue <int> q;
			q.push(i);
			dis[i][i] = 0;
			while (q.sz) {
				int v = q.front();
				q.pop();
				for (auto to : g[v]) {
					if (dis[i][to] > dis[i][v] + 1) {
						dis[i][to] = dis[i][v] + 1;
						q.push(to);
					}
				}
			}
		}
	}
}

int minimum_jumps(int A, int B, int C, int D) {
	int ans = 1e9;
	++ A; ++ B; ++ C; ++ D;
	if (ok) return C - B;
	if (n <= 2000) {
		for (int i = A; i <= B; ++ i) {
			for (int j = C; j <= D; ++ j) {
				ans = min(ans, dis[i][j]);
			}
		}
	} else {
		queue <ll> q;
		for (int i = 1; i <= n; ++ i) d[i] = 1e9;
		for (int i = A; i <= B; ++ i) q.push(i), d[i] = 0;
		while (q.sz) {
			int v = q.front();
			q.pop();
			for (auto to : g[v]) {
				if (d[to] > d[v] + 1) {
					d[to] = d[v] + 1;
					q.push(to);
				}
			}
		}
		for (int i = C; i <= D; ++ i) ans = min(ans, d[i]);
	}
	return (ans == 1e9 ? -1 : ans);
}

//signed main() {
//	init(7, {3, 2, 1, 6, 4, 5, 7});
//	cout << minimum_jumps(0, 1, 2, 2);
//}

컴파일 시 표준 에러 (stderr) 메시지

jumps.cpp:5: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
    5 | #pragma comment(linker, "/stack:200000000")
      |

• Subtask 1: 4 / 4
• Subtask 2: 8 / 8
• Subtask 3: 13 / 13
• Subtask 4: 12 / 12
• Subtask 5: 0 / 23
• Subtask 6: 0 / 21
• Subtask 7: 0 / 19