oj.uz

Submission #1075134

# Submission time Handle Problem Language Result Execution time Memory
1075134 2024-08-25T18:56:21 Z pawned Text editor (CEOI24_editor) C++17
0 / 100
 4000 ms 328792 KB 
#pragma GCC optimize("O1,O2,O3,Ofast,unroll-loops")

#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define pb push_back
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;

const char nl = '\n';

void fastIO() {
	ios::sync_with_stdio(false);
	cin.tie(0);
}

int dirX[4] = {-1, 1, 0, 0};
int dirY[4] = {0, 0, -1, 1};

int main() {
	fastIO();
	int N;
	cin>>N;
	int x1, y1, x2, y2;
	cin>>x1>>y1>>x2>>y2;
	x1--; y1--; x2--; y2--;
	vi L(N, 0);
	for (int i = 0; i < N; i++) {
		cin>>L[i];
		L[i]++;
	}
	map<ii, int> dist;
	queue<ii> q;	// {x, y}
	q.push({x1, y1});
	dist[{x1, y1}] = 0;
	while (!q.empty()) {
		ii p = q.front();
//		cout<<"at "<<p.fi<<", "<<p.se<<endl;
		q.pop();
		for (int i = 0; i < 4; i++) {
			int nx = p.fi + dirX[i];
			int ny = p.se + dirY[i];
			if (nx < 0 || nx >= N)	// can't go up / down when at edge
				continue;
			if (nx == 0 && ny == -1)	// can't go left at start
				continue;
			if (nx == N - 1 && ny == L[N - 1] - 1)	// can't go right at end
				continue;
			if (ny == L[nx]) {
				nx++;
				ny = 0;
			}
			else if (ny == -1) {
				nx--;
				ny = L[nx] - 1;
			}
			ny = min(ny, L[nx] - 1);
			if (dist.find({nx, ny}) == dist.end()) {
//				cout<<"going to "<<nx<<" "<<ny<<endl;
				dist[{nx, ny}] = dist[p] + 1;
				q.push({nx, ny});
			}
		}
	}
//	cout<<"ANSWER: ";
	cout<<dist[{x2, y2}]<<endl;
}

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct

Subtask #1
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Execution timed out 4110 ms 328792 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #2
0.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 978 ms 78420 KB Output is correct
5 Correct 1016 ms 84048 KB Output is correct
6 Correct 52 ms 6992 KB Output is correct
7 Correct 976 ms 85076 KB Output is correct
8 Execution timed out 4064 ms 299428 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #3
0.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Execution timed out 4110 ms 328792 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #4
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Execution timed out 4110 ms 328792 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0.0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Execution timed out 4110 ms 328792 KB Time limit exceeded
5 Halted 0 ms 0 KB -