제출 #1113298

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

Main

using namespace std;
#include <bits/stdc++.h>
#define int long long
int32_t main()
{
   int n;
   int sx,sy,ex,ey;
   cin>>n;
   cin>>sy>>sx>>ey>>ex;
   vector<int> l(n);
   for(int i=0;i<n;i++)
   cin>>l[i];
   if(sy>ey)
   {
       swap(ey,sy);
       swap(sx,ex);
       
   }
   
   int ans=0;
   if(sy==ey){
   ans=abs(sx-ex)+abs(sy-ey);
        if(sy!=1)
        {
        ans=min(ans,sx+l[0]+1-ex+1)   ;   
        }
        if(sy!=n)
        {
        ans=min(ans,l[0]+1-sx+1+ex-1+1)   ;   
        }
        if(ey!=n)
        {
        ans=min(ans,l[0]+1-ex+1+sx-1+1)   ; 
        }
        if(ey!=1)
        {
        ans=min(ans,ex+l[0]+1-sx+1) ;     
        }
   }
   if(sy<ey){
   
   ans=abs(sx-ex)+abs(sy-ey);
   if(sy!=1)
        {
        ans=min(ans,sx+l[0]+1-ex-1+abs(sy-ey)+1)  ;    
        }
    if(sy!=n)
        {
        ans=min(ans,l[0]+1-sx+1+ex-1+abs(sy-ey)-1)  ;    
        }
    if(ey!=n)
        {
        ans=min(ans,l[0]+1-ex+1+sx-1+abs(sy-ey)+1)    ;
        }
    if(ey!=1)
        {
        ans=min(ans,ex+l[0]+1-sx+abs(sy-ey)-1)      ;
        }
   }
   
   cout<<ans;
    return 0;
}

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