제출 #1044455

#제출 시각아이디문제언어결과실행 시간메모리
1044455alex_2008Text editor (CEOI24_editor)C++14
0 / 100
1 ms348 KiB
#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) { cout << min(abs(sc - ec), l[sl] - abs(sc - ec)) << "\n"; } else { if (sl == 2) { swap(sl, el); swap(sc, ec); } cout << min(abs(sc - ec) + 1, l[1] - sl + ec) << "\n"; } } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...