| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1081065 | oscar1f | Text editor (CEOI24_editor) | C++17 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#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];
priority_queue<tuple<int,int,int>> possi;
int arbreMin[2*DECA];
int dist[TAILLE_MAX][2];
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();
int lig,col,distCour;
for (int i=1;i<=nbLig;i++) {
possi.push(make_tuple(calcDistNorm(ligDeb,colDeb,i,1)));
possi.push(make_tuple(calcDistNorm(ligDeb,colDeb,i,tailleLig[i]+1)));
}
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 and lig>1) {
possi.push(make_tuple(-(distCour+1),lig-1,1));
}
possi.push(make_tuple(-(distCour+tailleLig[lig]),lig,0));
//droite
if (col==1 and lig<nbLig) {
possi.push(make_tuple(-(distCour+1),lig+1,0));
}
possi.push(make_tuple(-(distCour+tailleLig[lig]),lig,1));
//haut
if (lig>1) {
if (col==0) {
possi.push(make_tuple(-(distCour+1),lig-1,0));
}
else {
if (tailleLig[lig]>=tailleLig[lig-1]) {
possi.push(make_tuple(-(distCour+1),lig-1,1));
}
else {
possi.push(make_tuple(-(distCour+tailleLig[lig]-tailleLig[lig-1]),lig-1,1));
}
}
}
//bas
if (lig<nbLig) {
if (col==0) {
possi.push(make_tuple(-(distCour+1),lig+1,0));
}
else {
if (tailleLig[lig]>=tailleLig[lig+1]) {
possi.push(make_tuple(-(distCour+1),lig+1,1));
}
else {
possi.push(make_tuple(-(distCour+tailleLig[lig]-tailleLig[lig+1]),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][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;
}