oj.uz

Submission #55060

# Submission time Handle Problem Language Result Execution time Memory
55060 2018-07-06T00:06:04 Z ksun48 Railway Trip (JOI17_railway_trip) C++14
0 / 100
 2000 ms 26384 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;

int main(){
	cin.sync_with_stdio(0); cin.tie(0);
	int next[2][100000][20]; // next stop of level <= j, you are <= j+1 (taking trains of j+1)
	int idx[100000][21];
	int n, k, q;
	cin >> n >> k >> q;
	vector<int> level(n);
	for(int i = 0; i < n; i++){
		cin >> level[i];
		level[i] = k - level[i];
	}
	vector<pair<int,int> > queries;
	for(int i = 0; i < q; i++){
		int a, b;
		cin >> a >> b;
		a--; b--;
		queries.push_back({a,b});
	}
	for(int j = 0; j <= k; j++){
		int cur = 0;
		for(int i = 0; i < n; i++){
			if(level[i] <= j){
				idx[i][j] = cur;
				cur++;
			}
		}
	}
	for(int j = 0; j < k; j++){
		int prev = 0;
		for(int i = 0; i < n; i++){
			if(level[i] > j+1) continue;
			if(level[i] <= j){
				prev = i;
			}
			next[0][i][j] = prev;
		}
		prev = n-1;
		for(int i = n-1; i >= 0; i--){
			if(level[i] > j+1) continue;
			if(level[i] <= j){
				prev = i;
			}
			next[1][i][j] = prev;
		}
	}
	for(int zz = 0; zz < queries.size(); zz++){
		vector<pair<int,int> > stuff[2]; // loc, dist
		stuff[0].push_back({queries[zz].first, 0});
		stuff[1].push_back({queries[zz].second, 0});
		int ans = 1000000000;
		for(int j = k-1; j >= 0; j--){
			// go to level j
			for(int p = 0; p < 2; p++){
				vector<pair<int,int> > newstuff;
				for(pair<int,int> x : stuff[p]){
					// go left from x, go right from x;
					int loc = x.first;
					int dist = x.second;
					for(int dir = 0; dir < 2; dir++){
						int newloc = next[dir][loc][j];
						int newdist = dist + abs(idx[ loc ][j+1] - idx[ newloc ][j+1]);
						newstuff.push_back({newloc, newdist});
					}
				}
				int a = 0;
				while(a + 1 < newstuff.size()){
					if(newstuff[a].first == newstuff[a+1].first){
						newstuff[a].second = min(newstuff[a].second, newstuff[a+1].second);
						newstuff.erase(newstuff.begin() + a + 1);
					}
					a++;
				}
				stuff[p] = newstuff;
			}
			// find ans
			for(pair<int,int> x0 : stuff[0]){
				for(pair<int,int> x1 : stuff[1]){
					ans = min(ans, x0.second + x1.second + abs(idx[x0.first][j] - idx[x1.first][j]));
				}
			}
		}
		cout << ans - 1 << '\n';
	}
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 380 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 20 ms 616 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1157 ms 26280 KB Output is correct
2 Correct 810 ms 26280 KB Output is correct
3 Correct 1176 ms 26280 KB Output is correct
4 Correct 1350 ms 26364 KB Output is correct
5 Correct 1313 ms 26364 KB Output is correct
6 Correct 1711 ms 26364 KB Output is correct
7 Correct 1677 ms 26384 KB Output is correct
8 Correct 237 ms 26384 KB Output is correct
9 Correct 686 ms 26384 KB Output is correct
10 Execution timed out 2071 ms 26384 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2063 ms 26384 KB Time limit exceeded
2 Halted 0 ms 0 KB -