oj.uz

답안 #232165

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
232165 2020-05-16T10:19:30 Z Dremix10 Awesome Arrowland Adventure (eJOI19_adventure) C++17
0 / 100
 5 ms 384 KB 
#include <bits/stdc++.h>
using namespace std;

struct ano{

int c;
int d;

bool operator<(const ano &o)const{
return d>o.d;
}

};

int main (){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);

int n,m;
cin>>n>>m;

vector<vector<ano> > a(n*m,vector<ano>());
int i,j;

for(i=0;i<n;i++)
for(j=0;j<m;j++){
    char c;
    cin>>c;

    if(c=='X')
        continue;

    if(c=='N'){
        if(i-1>=0)
            a[i*m+j].push_back({(i-1)*m+j,0});
        if(j+1<m)
            a[i*m+j].push_back({i*m+j+1,1});
        if(i+1<n)
            a[i*m+j].push_back({(i+1)*m+j,2});
        if(j-1>=0)
            a[i*m+j].push_back({i*m+j-1,3});
    }
    else if(c=='E'){
        if(i-1>=0)
            a[i*m+j].push_back({(i-1)*m+j,3});
        if(j+1<m)
            a[i*m+j].push_back({i*m+j+1,0});
        if(i+1<n)
            a[i*m+j].push_back({(i+1)*m+j,1});
        if(j-1>=0)
            a[i*m+j].push_back({i*m+j-1,2});
    }
    else if(c=='S'){
        if(i-1>=0)
            a[i*m+j].push_back({(i-1)*m+j,2});
        if(j+1<m)
            a[i*m+j].push_back({i*m+j+1,3});
        if(i+1<n)
            a[i*m+j].push_back({(i+1)*m+j,0});
        if(j-1>=0)
            a[i*m+j].push_back({i*m+j-1,1});
    }
    else{
        if(i-1>=0)
            a[i*m+j].push_back({(i-1)*m+j,1});
        if(j+1<m)
            a[i*m+j].push_back({i*m+j+1,2});
        if(i+1<n)
            a[i*m+j].push_back({(i+1)*m+j,3});
        if(j-1>=0)
            a[i*m+j].push_back({i*m+j-1,0});
    }

}

priority_queue<ano> q;
vector <int> d(n*m,1000000);
q.push({0,0});
d[0]=0;

while(!q.empty()){
    int start=q.top().c;
    int w=q.top().d;
    q.pop();

    if(d[start]<w)
        continue;

    for(auto x : a[start])
    if(d[x.c]>d[start]+x.d){
        d[x.c]=d[start]+x.d;
        q.push(x);
    }

}

if(d[n*m-1]==10000000)
    cout<<-1<<endl;
else
    cout<<d[n*m-1]<<endl;


}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Incorrect 4 ms 384 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -