oj.uz

Submission #1079480

# Submission time Handle Problem Language Result Execution time Memory
1079480 2024-08-28T15:37:35 Z huutuan Text editor (CEOI24_editor) C++14
5 / 100
 66 ms 460 KB 
#include <bits/stdc++.h>

using namespace std;

const int N=1e6+10, LG=20;
int n, sl, sc, el, ec, a[N], st[LG][N];

int get(int l, int r){
   if (l>r) swap(l, r);
   int lg=__lg(r-l+1);
   return min(st[lg][l], st[lg][r-(1<<lg)+1]);
}

int move(int &x, int &y, int z, int t){
   if (x+1==z && y==a[x]+1 && t==1){
      x=z, y=t;
      return 1;
   }
   if (z+1==x && t==a[z]+1 && y==1){
      x=z, y=t;
      return 1;
   }
   int ans=abs(x-z);
   y=min(get(x, z), y);
   x=z;
   // if (t==-1) return ans;
   ans+=abs(y-t); y=t;
   return ans;
}

int calc(int x, int y, vector<pair<int, int>> path){
   int ans=0;
   for (auto &i:path){
      ans+=move(x, y, i.first, i.second);
   }
   if (ans==7){
      ans=7;
   }
   return ans;
}

int32_t main(){
   ios_base::sync_with_stdio(false);
   cin.tie(nullptr);
   cin >> n >> sl >> sc >> el >> ec;
   for (int i=1; i<=n; ++i) cin >> a[i], st[0][i]=a[i]+1;
   ++n;
   for (int i=1; i<LG; ++i) for (int j=1; j+(1<<i)-1<=n; ++j) st[i][j]=min(st[i-1][j], st[i-1][j+(1<<(i-1))]);
   int tl=sl, tc=sc;
   int ans=move(tl, tc, el, ec);
   for (int i=1; i<=n; ++i){
      for (int j=2; j<=n; ++j){
         ans=min(ans, calc(sl, sc, {{i, 1}, {j, 1}, {j-1, a[j-1]+1}, {el, ec}}));
         if (i<n) ans=min(ans, calc(sl, sc, {{i, a[i]+1}, {i+1, 1}, {j, 1}, {j-1, a[j-1]+1}, {el, ec}}));
      }
   }
   cout << ans << '\n';
   return 0;
}

Subtask #0
0.0 / 0.0

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

Subtask #1
5.0 / 5.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 416 KB Output is correct
4 Correct 0 ms 460 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct

Subtask #2
0.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 66 ms 348 KB Output is correct
5 Correct 49 ms 348 KB Output is correct
6 Incorrect 58 ms 348 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 416 KB Output is correct
6 Correct 0 ms 460 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 66 ms 348 KB Output is correct
12 Correct 49 ms 348 KB Output is correct
13 Incorrect 58 ms 348 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #4
0.0 / 11.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 416 KB Output is correct
4 Correct 0 ms 460 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 66 ms 348 KB Output is correct
10 Correct 49 ms 348 KB Output is correct
11 Incorrect 58 ms 348 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #5
0.0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 416 KB Output is correct
6 Correct 0 ms 460 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 66 ms 348 KB Output is correct
12 Correct 49 ms 348 KB Output is correct
13 Incorrect 58 ms 348 KB Output isn't correct
14 Halted 0 ms 0 KB -