oj.uz

답안 #126555

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
126555 2019-07-08T05:21:31 Z briansu Railway Trip (JOI17_railway_trip) C++14
20 / 100
 2000 ms 10956 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> ii;
#define REP(i, n) for(int i = 0;i < n;i ++)
#define REP1(i, n) for(int i = 1;i <= n;i ++)
#define FILL(i, n) memset(i, n, sizeof(i))
#define X first
#define Y second
#define pb push_back
#define SZ(_a) ((int)(_a).size())
#define ALL(_a) (_a).begin(), (_a).end()
#ifdef brian
#define IOS() 
template<typename T>void _do(T &&x){cerr<<x<<endl;}
template<typename T, typename ...t>void _do(T &&x, t &&...X){cerr<<x<<", ";_do(X...);}
#define debug(...) {\
	fprintf(stderr, "%s - %d (%s) = ", __PRETTY_FUNCTION__, __LINE__, #__VA_ARGS__);\
	_do(__VA_ARGS__);\
}
#else
#define debug(...)
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#define endl '\n'
#endif

const ll MAXn = 1e5 + 5;
const ll INF = ll(1e18);
const ll MOD = 1000000007;

ll d[MAXn], dis[MAXn], tdis[MAXn];

vector<ii> v[MAXn];
ll n, k, q;

void dijk(int s)
{
	REP1(i, n)dis[i] = INF;
	dis[s] = 0;
	priority_queue<ii, vector<ii>, greater<ii>> pq;
	pq.push(ii(0, s));
	while(SZ(pq))
	{
		while(SZ(pq) && dis[pq.top().Y] != pq.top().X)pq.pop();
		if(!SZ(pq))break;
		ll t = pq.top().Y;pq.pop();
		debug(t);
		for(auto &p:v[t])debug(t, p.X, p.Y, dis[p.X]);
		for(auto &p:v[t])if(dis[p.X] > dis[t] + p.Y)
		{
			debug(t, p.X);
			dis[p.X] = dis[t] + p.Y;
			pq.push(ii(dis[p.X], p.X));
		}
	}
	debug(s);
	REP1(i, n)debug(i, dis[i]);
}

int main(){
	IOS();
	cin>>n>>k>>q;
	REP1(i, n)cin>>d[i];

	{
		vector<ll> stk;
		REP1(i, n)
		{
			while(SZ(stk) && d[stk.back()] < d[i])stk.pop_back();
			if(SZ(stk))v[i].pb(ii(stk.back(), 1));
			stk.pb(i);
		}
	}
	{
		vector<ll> stk;
		for(int i = n;i > 0;i --)
		{
			while(SZ(stk) && d[stk.back()] < d[i])stk.pop_back();
			if(SZ(stk))v[i].pb(ii(stk.back(), 1));
			stk.pb(i);
		}
	}
	REP1(i, n)for(auto &p:v[i])debug(i, p.X, p.Y);
	while(q--)
	{
		ll a, b;
		cin>>a>>b;
		dijk(a);

		REP1(i, n)tdis[i] = dis[i];
		dijk(b);
		ll ans = INF;
		REP1(i, n)ans = min(ans, tdis[i] + dis[i] - 1);
		cout<<ans<<endl;
	}
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 4 ms 2680 KB Output is correct
3 Correct 4 ms 2680 KB Output is correct
4 Correct 4 ms 2680 KB Output is correct
5 Correct 4 ms 2680 KB Output is correct
6 Correct 4 ms 2684 KB Output is correct
7 Correct 4 ms 2680 KB Output is correct
8 Correct 4 ms 2680 KB Output is correct
9 Correct 4 ms 2684 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 2808 KB Output is correct
2 Correct 101 ms 10136 KB Output is correct
3 Correct 84 ms 10052 KB Output is correct
4 Correct 62 ms 10104 KB Output is correct
5 Correct 55 ms 9980 KB Output is correct
6 Correct 48 ms 10104 KB Output is correct
7 Correct 50 ms 10360 KB Output is correct
8 Correct 304 ms 10956 KB Output is correct
9 Correct 212 ms 10712 KB Output is correct
10 Correct 230 ms 10936 KB Output is correct
11 Correct 194 ms 10720 KB Output is correct
12 Correct 203 ms 10808 KB Output is correct
13 Correct 241 ms 10808 KB Output is correct
14 Correct 213 ms 10740 KB Output is correct
15 Correct 217 ms 10812 KB Output is correct
16 Correct 196 ms 10688 KB Output is correct
17 Correct 49 ms 10400 KB Output is correct
18 Correct 49 ms 10360 KB Output is correct
19 Correct 49 ms 10344 KB Output is correct

Subtask #3
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2061 ms 10452 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2060 ms 10944 KB Time limit exceeded
2 Halted 0 ms 0 KB -