제출 #1044459

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1044459		alex_2008	Text editor (CEOI24_editor)	C++14	0 / 100	1 ms	348 KiB

Main

#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <map>
#include <queue>
#include <stack>
typedef long long ll;
using namespace std;
const int N = 1e6 + 10;
int l[N];
int main() {
	ios_base::sync_with_stdio(false); cin.tie(0);
	int n;
	cin >> n;
	int sl, sc, el, ec;
	cin >> sl >> sc >> el >> ec;
	for (int i = 1; i <= n; i++) {
		cin >> l[i];
	}
	if (n == 1) {
		cout << abs(sc - ec) << "\n";
		return 0;
	}
	if (n == 2) {
		if (sl == el) {
			if (sc > ec) swap(sc, ec);
			if (sl == 1) {
				cout << min(abs(sc - ec), l[1] - ec + 1 + sc) << "\n";
			}
			else {
				cout << min(abs(sc - ec), l[2] - ec + 1 + sc) << "\n";
			}
		}
		else {
			if (sl == 2) {
				swap(sl, el);
				swap(sc, ec);
			}
			cout << min(abs(sc - ec) + 1, l[1] - sl + ec) << "\n";
		}
	}
}

• Subtask 0: 0 / 0
• Subtask 1: 0 / 5
• Subtask 2: 0 / 14
• Subtask 3: 0 / 26
• Subtask 4: 0 / 11
• Subtask 5: 0 / 44