oj.uz

Submission #1081001

# Submission time Handle Problem Language Result Execution time Memory
1081001 2024-08-29T16:50:40 Z oscar1f Text editor (CEOI24_editor) C++17
56 / 100
 1951 ms 1048576 KB 
#include<bits/stdc++.h>
using namespace std;

#define int long long

const int TAILLE_MAX=1000*1000+5;
int nbLig,ligDeb,colDeb,ligFin,colFin,nbCol;
set<int> interres;
vector<int> listeCol;
unordered_map<int,int> corres;
int tailleLig[TAILLE_MAX],posCol[TAILLE_MAX];
vector<vector<int>> dist;
priority_queue<tuple<int,int,int>> possi;

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    cin>>nbLig>>ligDeb>>colDeb>>ligFin>>colFin;
    interres.insert(colDeb);
    interres.insert(colFin);
    interres.insert(1);
    for (int i=1;i<=nbLig;i++) {
        cin>>tailleLig[i];
        interres.insert(tailleLig[i]+1);
    }
    for (int i:interres) {
        corres[i]=listeCol.size();
        posCol[listeCol.size()]=i;
        listeCol.push_back(i);
    }
    nbCol=listeCol.size();
    vector<int> construc;
    for (int j=0;j<nbCol;j++) {
        construc.push_back(-1);
    }
    for (int i=1;i<=nbLig+1;i++) {
        dist.push_back(construc);
    }
    int lig,col,distCour;
    possi.push(make_tuple(0,ligDeb,corres[colDeb]));
    while (!possi.empty()) {
        distCour=-get<0>(possi.top());
        lig=get<1>(possi.top());
        col=get<2>(possi.top());
        possi.pop();
        if (dist[lig][col]==-1) {
            dist[lig][col]=distCour;
            //gauche
            if (col!=0) {
                possi.push(make_tuple(-(distCour+posCol[col]-posCol[col-1]),lig,col-1));
            }
            else if (lig>1) {
                possi.push(make_tuple(-(distCour+1),lig-1,corres[tailleLig[lig-1]+1]));
            }
            
            //droite
            if (posCol[col]!=tailleLig[lig]+1) {
                possi.push(make_tuple(-(distCour+posCol[col+1]-posCol[col]),lig,col+1));
            }
            else if (lig<nbLig) {
                possi.push(make_tuple(-(distCour+1),lig+1,0));
            }
            
            //haut
            if (lig>1) {
                if (tailleLig[lig-1]+1>=posCol[col]) {
                    possi.push(make_tuple(-(distCour+1),lig-1,col));
                }
                else {
                    possi.push(make_tuple(-(distCour+1),lig-1,corres[tailleLig[lig-1]+1]));
                }
            }

            //bas
            if (lig<nbLig) {
                if (tailleLig[lig+1]+1>=posCol[col]) {
                    possi.push(make_tuple(-(distCour+1),lig+1,col));
                }
                else {
                    possi.push(make_tuple(-(distCour+1),lig+1,corres[tailleLig[lig+1]+1]));
                }
            }
        }
    }
    /*for (int i=1;i<=nbLig;i++) {
        for (int j=0;j<nbCol;j++) {
            cout<<dist[i][j]<<"   ";
        }
        cout<<endl;
    }*/
    cout<<dist[ligFin][corres[colFin]]<<endl;
    return 0;
}

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 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 1 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 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 2 ms 600 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 2 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 118 ms 4432 KB Output is correct
10 Correct 121 ms 4508 KB Output is correct
11 Correct 120 ms 4420 KB Output is correct
12 Correct 217 ms 7260 KB Output is correct
13 Correct 228 ms 7644 KB Output is correct
14 Correct 226 ms 7524 KB Output is correct
15 Correct 236 ms 8016 KB Output is correct
16 Correct 244 ms 8144 KB Output is correct
17 Correct 249 ms 8076 KB Output is correct
18 Correct 239 ms 8572 KB Output is correct
19 Correct 218 ms 8768 KB Output is correct
20 Correct 35 ms 2908 KB Output is correct

Subtask #3
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 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 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 2 ms 600 KB Output is correct
12 Correct 2 ms 604 KB Output is correct
13 Correct 2 ms 348 KB Output is correct
14 Correct 2 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 118 ms 4432 KB Output is correct
17 Correct 121 ms 4508 KB Output is correct
18 Correct 120 ms 4420 KB Output is correct
19 Correct 217 ms 7260 KB Output is correct
20 Correct 228 ms 7644 KB Output is correct
21 Correct 226 ms 7524 KB Output is correct
22 Correct 236 ms 8016 KB Output is correct
23 Correct 244 ms 8144 KB Output is correct
24 Correct 249 ms 8076 KB Output is correct
25 Correct 239 ms 8572 KB Output is correct
26 Correct 218 ms 8768 KB Output is correct
27 Correct 35 ms 2908 KB Output is correct
28 Correct 2 ms 600 KB Output is correct
29 Correct 2 ms 860 KB Output is correct
30 Correct 2 ms 604 KB Output is correct
31 Correct 2 ms 860 KB Output is correct
32 Correct 1 ms 604 KB Output is correct
33 Correct 139 ms 6244 KB Output is correct
34 Correct 150 ms 7012 KB Output is correct
35 Correct 161 ms 7008 KB Output is correct
36 Correct 224 ms 9316 KB Output is correct
37 Correct 222 ms 9316 KB Output is correct
38 Correct 233 ms 9320 KB Output is correct
39 Correct 207 ms 9316 KB Output is correct
40 Correct 221 ms 9428 KB Output is correct
41 Correct 214 ms 9316 KB Output is correct
42 Correct 298 ms 33208 KB Output is correct
43 Correct 308 ms 33184 KB Output is correct
44 Correct 34 ms 3868 KB Output is correct

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 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 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 2 ms 600 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 2 ms 604 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 2 ms 600 KB Output is correct
15 Correct 2 ms 860 KB Output is correct
16 Correct 2 ms 604 KB Output is correct
17 Correct 2 ms 860 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1703 ms 274764 KB Output is correct
20 Correct 1951 ms 177584 KB Output is correct
21 Correct 1833 ms 278396 KB Output is correct
22 Correct 1718 ms 272772 KB Output is correct
23 Correct 1202 ms 123240 KB Output is correct

Subtask #5
0.0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 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 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 2 ms 600 KB Output is correct
12 Correct 2 ms 604 KB Output is correct
13 Correct 2 ms 348 KB Output is correct
14 Correct 2 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 118 ms 4432 KB Output is correct
17 Correct 121 ms 4508 KB Output is correct
18 Correct 120 ms 4420 KB Output is correct
19 Correct 217 ms 7260 KB Output is correct
20 Correct 228 ms 7644 KB Output is correct
21 Correct 226 ms 7524 KB Output is correct
22 Correct 236 ms 8016 KB Output is correct
23 Correct 244 ms 8144 KB Output is correct
24 Correct 249 ms 8076 KB Output is correct
25 Correct 239 ms 8572 KB Output is correct
26 Correct 218 ms 8768 KB Output is correct
27 Correct 35 ms 2908 KB Output is correct
28 Correct 2 ms 600 KB Output is correct
29 Correct 2 ms 860 KB Output is correct
30 Correct 2 ms 604 KB Output is correct
31 Correct 2 ms 860 KB Output is correct
32 Correct 1 ms 604 KB Output is correct
33 Correct 139 ms 6244 KB Output is correct
34 Correct 150 ms 7012 KB Output is correct
35 Correct 161 ms 7008 KB Output is correct
36 Correct 224 ms 9316 KB Output is correct
37 Correct 222 ms 9316 KB Output is correct
38 Correct 233 ms 9320 KB Output is correct
39 Correct 207 ms 9316 KB Output is correct
40 Correct 221 ms 9428 KB Output is correct
41 Correct 214 ms 9316 KB Output is correct
42 Correct 298 ms 33208 KB Output is correct
43 Correct 308 ms 33184 KB Output is correct
44 Correct 34 ms 3868 KB Output is correct
45 Correct 1703 ms 274764 KB Output is correct
46 Correct 1951 ms 177584 KB Output is correct
47 Correct 1833 ms 278396 KB Output is correct
48 Correct 1718 ms 272772 KB Output is correct
49 Correct 1202 ms 123240 KB Output is correct
50 Runtime error 1107 ms 1048576 KB Execution killed with signal 9
51 Halted 0 ms 0 KB -