Submission #1227263

#TimeUsernameProblemLanguageResultExecution timeMemory
1227263MalixText editor (CEOI24_editor)C++20
0 / 100
0 ms328 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef vector<int> vi; typedef vector<vi> vii; typedef pair<int,int> pi; typedef vector<pi> pii; typedef tuple<ll,int,int> ti; typedef vector<ll> li; typedef vector<li> lii; #define REP(i,a,b) for(int i=a;i<b;i++) #define F first #define S second #define PB push_back #define LSOne(s) ((s)&(-s)) #define all(x) (x).begin(),(x).end() ll INF=1000000000000000010; int inf=1e9+10; ll M=1e9+7; int main() { int n;cin>>n; pi P,Q; cin>>P.F>>P.S>>Q.F>>Q.S; P.F--;P.S--;Q.F--;Q.S--; vi b(n); REP(i,0,n)cin>>b[i]; ll ans=(ll)abs(P.F-Q.F)+min((ll)abs(Q.S-P.S),(ll)min(Q.S,P.S)+(ll)b[0]-(ll)max(Q.S,P.S)); cout<<ans; }
#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...