oj.uz

Submission #1068731

# Submission time Handle Problem Language Result Execution time Memory
1068731 2024-08-21T11:43:21 Z vjudge1 Text editor (CEOI24_editor) C++17
16 / 100
 273 ms 14944 KB 
#include<bits/stdc++.h>
using namespace std;
int calc(int x1, int y1, int x2, int y2){
    return abs(x2 - x1) + abs (y2 - y1);
}
int main(){
      int n;
    cin >> n;
    int x1,y1,x2,y2;
    cin >> x1 >> y1 >> x2 >> y2;
    int arr[n];
    for(int i = 0; i < n; i++){
        cin >> arr[i];
    }
    if(n == 1){
        cout << 0 <<endl;
    }else{
    int res1 = calc(x1,y1,x2,y2);
    int res2 = 1e9;
    if(x1 != n){
        res2 = (arr[0] + 2) - y1 + calc(x1 + 1, 1, x2, y2);
    }
    int res3 = 1e9;
    if(x1 != 1){
        res3 = y1 + calc(x1 - 1, arr[0] + 1, x2, y2);
    }else{
        res3 = 1 + y1 + calc(1, arr[0] + 1, x2, y2);
    }
    int res4 = n - x1;
    res4 = res4 + 1 + min(calc(n - 1, 1, x2, y2), calc(n - 1, arr[0] + 1, x2, y2));
    res1 = min(res1, res2);
    res1 = min(res1, res3);
    res1 = min(res1, res4);
    cout << res1;
    }
}

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

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 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 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 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 26.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
11.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 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 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 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 216 ms 12420 KB Output is correct
20 Correct 239 ms 12584 KB Output is correct
21 Correct 266 ms 12840 KB Output is correct
22 Correct 248 ms 11936 KB Output is correct
23 Correct 273 ms 14944 KB Output is correct

Subtask #5
0.0 / 44.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -