oj.uz

Submission #286475

# Submission time Handle Problem Language Result Execution time Memory
286475 2020-08-30T13:05:08 Z wildturtle Awesome Arrowland Adventure (eJOI19_adventure) C++14
0 / 100
 8 ms 12160 KB 
#include<bits/stdc++.h>
using namespace std;
long long a,b,c,d,i,e,f,g,n,m,k,l,A[500005];
string s[502];
vector < pair < long long , long long > > v[500005];
priority_queue< pair < long long , long long > > pq;
int main() {
    cin>>n>>m;
    for(long long i=1;i<=n;i++) {
        cin>>s[i];
        
        s[i]='#'+s[i];
      //  cout<<s[i]<<endl;
    }
    //cout<<s[2][1]<<endl;
    for(long long i=1;i<=n;i++) {
        for(long long j=1;j<=m;j++) {
            if(s[i][j]=='X') continue;
            a=0;
            if(i-1>0) {
                if(s[i][j]=='N') a=0;
                else if(s[i][j]=='E') a=3;
                else if(s[i][j]=='W') a=1;
                else a=2;
                v[(i-1)*m+j].push_back({(i-2)*m+j,a});
            }
            a=0;
            if(i+1<=n) {
                if(s[i][j]=='S') a=0;
                else if(s[i][j]=='W') a=3;
                else if(s[i][j]=='E') a=1;
                else a=2;
                v[(i-1)*m+j].push_back({i*m+j,a});                
            }
            a=0;
            if(j-1>0) {
                if(s[i][j]=='W') a=0;
                else if(s[i][j]=='N') a=3;
                else if(s[i][j]=='S') a=1;
                else if(s[i][j]=='E') a=2;
                v[(i-1)*m+j].push_back({(i-1)*m+j-1,a});
            }
            a=0;
            if(j+1<=m) {
                if(s[i][j]=='E') a=0;
                else if(s[i][j]=='S') a=3;
                else if(s[i][j]=='N') a=1;
                else if(s[i][j]=='W') a=2;
                //if((i-1)*m+j==4) cout<<a<<" "<<s[i][j]<<" "<<i<<" "<<j<<" "<<s[i]<<endl;
                v[(i-1)*m+j].push_back({(i-1)*m+j+1,a});                
            }
        }
    }
    for(long long i=1;i<=n*m;i++)
        A[i]=100000000001ll;
    /*for(long long i=0;i<v[4].size();i++)
        cout<<v[4][i].first<<" "<<v[4][i].second<<endl;
        cout<<endl;*/
    A[1]=0;
    pq.push({0,1});
    while (pq.size()>0) {
        a=-(pq.top().first);
        b=pq.top().second;
        pq.pop();
        for(long long i=0;i<v[b].size();i++) {
            c=v[b][i].first; d=v[b][i].second;
            if(A[c]>A[b]+d) { A[c]=A[b]+d; pq.push({-(A[c]), c}); }
        }
    }
    /*for(long long i=1;i<=n*m;i++) {
        cout<<A[i]<<" ";
        if(i%m==0) cout<<endl;
    }*/
    cout<<A[n*m];
}

Compilation message

adventure.cpp: In function 'int main()':
adventure.cpp:65:28: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   65 |         for(long long i=0;i<v[b].size();i++) {
      |                           ~^~~~~~~~~~~~

Subtask #1
0 / 10.0

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

Subtask #2
0 / 12.0

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

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 12032 KB Output is correct
2 Correct 7 ms 12032 KB Output is correct
3 Incorrect 8 ms 12032 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

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

Subtask #5
0 / 50.0

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