oj.uz

답안 #1081056

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1081056 2024-08-29T17:39:43 Z oscar1f Text editor (CEOI24_editor) C++17
56 / 100
 2041 ms 1048576 KB 
#include<bits/stdc++.h>
using namespace std;

#define int long long

const int TAILLE_MAX=1000*1000+5,DECA=(1<<20),INFINI=(int)1000*1000*1000*1000*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;
int arbreMin[2*DECA];

int calcMin(int deb,int fin) {
    if (deb==fin) {
        return arbreMin[deb];
    }
    if (deb%2==1) {
        return min(arbreMin[deb],calcMin(deb+1,fin));
    }
    if (fin%2==0) {
        return min(arbreMin[fin],calcMin(deb,fin-1));
    }
    return calcMin(deb/2,fin/2);
}

int calcDistNorm(int lig1,int col1,int lig2,int col2) {
    if (lig1>=lig2) {
        swap(lig1,lig2);
        swap(col1,col2);
    }
    int mini=calcMin(DECA+lig1,DECA+lig2);
    return lig2-lig1+abs(col1-col2)+2*max((int)0,min(col1,col2)-mini);
}

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=0;i<2*DECA;i++) {
        arbreMin[i]=INFINI;
    }
    for (int i=1;i<=nbLig;i++) {
        cin>>tailleLig[i];
        interres.insert(tailleLig[i]+1);
        /*for (int j=1;j<=tailleLig[i];j++) {
            interres.insert(j);
        }*/
        arbreMin[DECA+i]=tailleLig[i]+1;
    }
    for (int i=DECA-1;i>0;i--) {
        arbreMin[i]=min(arbreMin[2*i],arbreMin[2*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]));
                }
            }
        }
    }
    int rep=calcDistNorm(ligDeb,colDeb,ligFin,colFin);
    for (int i=1;i<=nbLig;i++) {
        rep=min(rep,dist[i][0]+calcDistNorm(i,1,ligFin,colFin));
        rep=min(rep,dist[i][corres[tailleLig[i]+1]]+calcDistNorm(i,tailleLig[i]+1,ligFin,colFin));
    }
    cout<<rep<<endl;
    /*for (int i=1;i<=nbLig;i++) {
        for (int j=0;j<nbCol;j++) {
            cout<<dist[i][j]<<"\t";
        }
        cout<<endl;
    }
    cout<<dist[ligFin][corres[colFin]]<<endl;*/
    return 0;
}

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 17240 KB Output is correct
2 Correct 4 ms 16988 KB Output is correct

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 16988 KB Output is correct
2 Correct 4 ms 16988 KB Output is correct
3 Correct 5 ms 16896 KB Output is correct
4 Correct 4 ms 16988 KB Output is correct
5 Correct 4 ms 17020 KB Output is correct
6 Correct 4 ms 16984 KB Output is correct
7 Correct 4 ms 16984 KB Output is correct
8 Correct 4 ms 16988 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 17240 KB Output is correct
2 Correct 4 ms 16988 KB Output is correct
3 Correct 7 ms 16988 KB Output is correct
4 Correct 7 ms 17244 KB Output is correct
5 Correct 7 ms 17036 KB Output is correct
6 Correct 8 ms 16988 KB Output is correct
7 Correct 6 ms 17072 KB Output is correct
8 Correct 6 ms 16988 KB Output is correct
9 Correct 123 ms 20960 KB Output is correct
10 Correct 123 ms 21080 KB Output is correct
11 Correct 123 ms 21072 KB Output is correct
12 Correct 239 ms 23836 KB Output is correct
13 Correct 227 ms 24092 KB Output is correct
14 Correct 224 ms 24096 KB Output is correct
15 Correct 262 ms 24464 KB Output is correct
16 Correct 247 ms 24668 KB Output is correct
17 Correct 249 ms 24608 KB Output is correct
18 Correct 243 ms 25372 KB Output is correct
19 Correct 217 ms 25176 KB Output is correct
20 Correct 41 ms 19292 KB Output is correct

Subtask #3
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 17240 KB Output is correct
2 Correct 4 ms 16988 KB Output is correct
3 Correct 7 ms 16988 KB Output is correct
4 Correct 4 ms 16988 KB Output is correct
5 Correct 5 ms 16896 KB Output is correct
6 Correct 4 ms 16988 KB Output is correct
7 Correct 4 ms 17020 KB Output is correct
8 Correct 4 ms 16984 KB Output is correct
9 Correct 4 ms 16984 KB Output is correct
10 Correct 4 ms 16988 KB Output is correct
11 Correct 7 ms 17244 KB Output is correct
12 Correct 7 ms 17036 KB Output is correct
13 Correct 8 ms 16988 KB Output is correct
14 Correct 6 ms 17072 KB Output is correct
15 Correct 6 ms 16988 KB Output is correct
16 Correct 123 ms 20960 KB Output is correct
17 Correct 123 ms 21080 KB Output is correct
18 Correct 123 ms 21072 KB Output is correct
19 Correct 239 ms 23836 KB Output is correct
20 Correct 227 ms 24092 KB Output is correct
21 Correct 224 ms 24096 KB Output is correct
22 Correct 262 ms 24464 KB Output is correct
23 Correct 247 ms 24668 KB Output is correct
24 Correct 249 ms 24608 KB Output is correct
25 Correct 243 ms 25372 KB Output is correct
26 Correct 217 ms 25176 KB Output is correct
27 Correct 41 ms 19292 KB Output is correct
28 Correct 6 ms 17240 KB Output is correct
29 Correct 5 ms 17308 KB Output is correct
30 Correct 6 ms 17244 KB Output is correct
31 Correct 8 ms 17380 KB Output is correct
32 Correct 6 ms 17164 KB Output is correct
33 Correct 135 ms 22884 KB Output is correct
34 Correct 159 ms 23392 KB Output is correct
35 Correct 172 ms 23648 KB Output is correct
36 Correct 231 ms 25904 KB Output is correct
37 Correct 225 ms 25972 KB Output is correct
38 Correct 234 ms 25956 KB Output is correct
39 Correct 225 ms 25956 KB Output is correct
40 Correct 217 ms 25952 KB Output is correct
41 Correct 216 ms 25952 KB Output is correct
42 Correct 310 ms 49804 KB Output is correct
43 Correct 327 ms 49832 KB Output is correct
44 Correct 40 ms 20316 KB Output is correct

Subtask #4
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 16988 KB Output is correct
2 Correct 4 ms 16988 KB Output is correct
3 Correct 5 ms 16896 KB Output is correct
4 Correct 4 ms 16988 KB Output is correct
5 Correct 4 ms 17020 KB Output is correct
6 Correct 4 ms 16984 KB Output is correct
7 Correct 4 ms 16984 KB Output is correct
8 Correct 4 ms 16988 KB Output is correct
9 Correct 7 ms 17244 KB Output is correct
10 Correct 7 ms 17036 KB Output is correct
11 Correct 8 ms 16988 KB Output is correct
12 Correct 6 ms 17072 KB Output is correct
13 Correct 6 ms 16988 KB Output is correct
14 Correct 6 ms 17240 KB Output is correct
15 Correct 5 ms 17308 KB Output is correct
16 Correct 6 ms 17244 KB Output is correct
17 Correct 8 ms 17380 KB Output is correct
18 Correct 6 ms 17164 KB Output is correct
19 Correct 1894 ms 291452 KB Output is correct
20 Correct 2029 ms 194284 KB Output is correct
21 Correct 2041 ms 295040 KB Output is correct
22 Correct 1987 ms 289232 KB Output is correct
23 Correct 1405 ms 139672 KB Output is correct

Subtask #5
0.0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 17240 KB Output is correct
2 Correct 4 ms 16988 KB Output is correct
3 Correct 7 ms 16988 KB Output is correct
4 Correct 4 ms 16988 KB Output is correct
5 Correct 5 ms 16896 KB Output is correct
6 Correct 4 ms 16988 KB Output is correct
7 Correct 4 ms 17020 KB Output is correct
8 Correct 4 ms 16984 KB Output is correct
9 Correct 4 ms 16984 KB Output is correct
10 Correct 4 ms 16988 KB Output is correct
11 Correct 7 ms 17244 KB Output is correct
12 Correct 7 ms 17036 KB Output is correct
13 Correct 8 ms 16988 KB Output is correct
14 Correct 6 ms 17072 KB Output is correct
15 Correct 6 ms 16988 KB Output is correct
16 Correct 123 ms 20960 KB Output is correct
17 Correct 123 ms 21080 KB Output is correct
18 Correct 123 ms 21072 KB Output is correct
19 Correct 239 ms 23836 KB Output is correct
20 Correct 227 ms 24092 KB Output is correct
21 Correct 224 ms 24096 KB Output is correct
22 Correct 262 ms 24464 KB Output is correct
23 Correct 247 ms 24668 KB Output is correct
24 Correct 249 ms 24608 KB Output is correct
25 Correct 243 ms 25372 KB Output is correct
26 Correct 217 ms 25176 KB Output is correct
27 Correct 41 ms 19292 KB Output is correct
28 Correct 6 ms 17240 KB Output is correct
29 Correct 5 ms 17308 KB Output is correct
30 Correct 6 ms 17244 KB Output is correct
31 Correct 8 ms 17380 KB Output is correct
32 Correct 6 ms 17164 KB Output is correct
33 Correct 135 ms 22884 KB Output is correct
34 Correct 159 ms 23392 KB Output is correct
35 Correct 172 ms 23648 KB Output is correct
36 Correct 231 ms 25904 KB Output is correct
37 Correct 225 ms 25972 KB Output is correct
38 Correct 234 ms 25956 KB Output is correct
39 Correct 225 ms 25956 KB Output is correct
40 Correct 217 ms 25952 KB Output is correct
41 Correct 216 ms 25952 KB Output is correct
42 Correct 310 ms 49804 KB Output is correct
43 Correct 327 ms 49832 KB Output is correct
44 Correct 40 ms 20316 KB Output is correct
45 Correct 1894 ms 291452 KB Output is correct
46 Correct 2029 ms 194284 KB Output is correct
47 Correct 2041 ms 295040 KB Output is correct
48 Correct 1987 ms 289232 KB Output is correct
49 Correct 1405 ms 139672 KB Output is correct
50 Runtime error 1163 ms 1048576 KB Execution killed with signal 9
51 Halted 0 ms 0 KB -