제출 #411869

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
411869		alishahali1382	Railway Trip (JOI17_railway_trip)	C++14	0 / 100	985 ms	2916 KiB

railway_trip

#include <bits/stdc++.h>
#pragma GCC optimize ("O2,unroll-loops")
//#pragma GCC optimize("no-stack-protector,fast-math")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define debugp(x) cerr<<#x<<"= {"<<(x.first)<<", "<<(x.second)<<"}"<<endl;
#define debug2(x, y) cerr<<"{"<<#x<<", "<<#y<<"} = {"<<(x)<<", "<<(y)<<"}"<<endl;
#define debugv(v) {cerr<<#v<<" : ";for (auto x:v) cerr<<x<<' ';cerr<<endl;}
#define all(x) x.begin(), x.end()
#define pb push_back
#define kill(x) return cout<<x<<'\n', 0;

const int inf=1000000010;
const ll INF=1000000000000001000LL;
const int mod=1000000007;
const int MAXN=100010, LOG=20;

int n, m, k, u, v, x, y, t, a, b, ans;
int A[MAXN], L[MAXN], R[MAXN];
int G[105][105];

int main(){
	ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	//freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);
	cin>>n>>k>>m;
	for (int i=1; i<=n; i++) cin>>A[i];
	for (int i=1; i<=n; i++) for (L[i]=i-1; L[i] && A[L[i]]<A[i]; L[i]=L[L[i]]);
	for (int i=n; i; i--) for (R[i]=i+1; R[i]<=n && A[R[i]]<A[i]; R[i]=R[R[i]]);
	memset(G, 63, sizeof(G));
	for (int i=1; i<=n; i++){
		if (L[i]) G[i][L[i]]=1;
		if (R[i]<=n) G[i][R[i]]=1;
		
	}
	for (int i=1; i<=n; i++) G[i][i]=0;
	for (int k=1; k<=n; k++) for (int i=1; i<=n; i++) for (int j=1; j<=n; j++)
		G[i][j]=min(G[i][j], G[i][k] + G[k][j]);
	
	while (m--){
		cin>>x>>y;
		if (x>y) swap(x, y);
		ans=min(G[x][L[x]]+G[y][L[x]], G[x][R[y]]+G[y][R[y]]);
		for (int i=x; i<=y; i++) ans=min(ans, G[x][i]+G[y][i]);
		cout<<ans-1<<"\n";
	}
	
	return 0;
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 15
• Subtask 3: 0 / 25
• Subtask 4: 0 / 55