oj.uz

Submission #750364

# Submission time Handle Problem Language Result Execution time Memory
750364 2023-05-29T12:35:49 Z MrM7md Awesome Arrowland Adventure (eJOI19_adventure) C++17
50 / 100
 422 ms 102400 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define F first
#define S second
#define pb push_back
#define all(a) a.begin(),a.end()
const int N=1e6+500;
const int off=(1<<18);
const int MOD = 1e9+7;

vector<vector<int>>gr(N);
int val[N],vis[N];
map<pair<int,int>,int>mp;
void dij(int a){
   // vis[a]=1;
   val[a]=0;
   priority_queue<pair<int,int>>pq;
   pq.push({0,a});
   while(!pq.empty()){
      int vl=pq.top().F,x=pq.top().S;
      pq.pop();
      if(vis[x])continue;
      vis[x]=1;
      // cout<<vl<<' '<<x<<endl;
      for(auto it:gr[x]){
         if(val[it]>val[x]+mp[{x,it}])
            val[it]=val[x]+mp[{x,it}];

         pq.push({val[it]*-1,it});
      }
   }
}
signed main(){
   ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
   int n,m;
   cin >> m >> n;
   char ch[m][n];
   for(int i=0;i<m;i++){
      for(int j=0;j<n;j++){
         cin >> ch[i][j];
      }
   }
   for(int i=0;i<m;i++){
      for(int j=0;j<n;j++){
         val[n*i+j]=INT_MAX;
         if(ch[i][j]=='X'){
            vis[n*i+j]=1;
            continue;
         }
         if(i){
            gr[n*i+j].pb(n*(i-1)+j);
            if(ch[i][j]=='E')mp[{n*i+j,n*(i-1)+j}]=3;
            if(ch[i][j]=='W')mp[{n*i+j,n*(i-1)+j}]=1;
            if(ch[i][j]=='N')mp[{n*i+j,n*(i-1)+j}]=0;
            if(ch[i][j]=='S')mp[{n*i+j,n*(i-1)+j}]=2;
         }
         if(i<m-1){
            gr[n*i+j].pb(n*(i+1)+j);
            if(ch[i][j]=='E')mp[{n*i+j,n*(i+1)+j}]=1;
            if(ch[i][j]=='W')mp[{n*i+j,n*(i+1)+j}]=3;
            if(ch[i][j]=='N')mp[{n*i+j,n*(i+1)+j}]=2;
            if(ch[i][j]=='S')mp[{n*i+j,n*(i+1)+j}]=0;
         }
         if(j){
            gr[n*i+j].pb(n*i+j-1);
            if(ch[i][j]=='E')mp[{n*i+j,n*i+j-1}]=2;
            if(ch[i][j]=='W')mp[{n*i+j,n*i+j-1}]=0;
            if(ch[i][j]=='N')mp[{n*i+j,n*i+j-1}]=3;
            if(ch[i][j]=='S')mp[{n*i+j,n*i+j-1}]=1;
         }
         if(j<n-1){
            gr[n*i+j].pb(n*i+j+1);
            if(ch[i][j]=='E')mp[{n*i+j,n*i+j+1}]=0;
            if(ch[i][j]=='W')mp[{n*i+j,n*i+j+1}]=2;
            if(ch[i][j]=='N')mp[{n*i+j,n*i+j+1}]=1;
            if(ch[i][j]=='S')mp[{n*i+j,n*i+j+1}]=3;
         }
      }
   }
   dij(0);
   int lst=(n)*(m)-1;
   if(val[lst]==INT_MAX)val[lst]=-1;
   cout<<val[lst];

}

Compilation message

adventure.cpp: In function 'void dij(long long int)':
adventure.cpp:22:11: warning: unused variable 'vl' [-Wunused-variable]
   22 |       int vl=pq.top().F,x=pq.top().S;
      |           ^~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23892 KB Output is correct
2 Correct 13 ms 23764 KB Output is correct
3 Correct 12 ms 23892 KB Output is correct
4 Correct 16 ms 23892 KB Output is correct
5 Correct 15 ms 23828 KB Output is correct
6 Correct 14 ms 23784 KB Output is correct
7 Correct 13 ms 23716 KB Output is correct
8 Correct 12 ms 23892 KB Output is correct
9 Correct 12 ms 23892 KB Output is correct
10 Correct 15 ms 23752 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23892 KB Output is correct
2 Correct 13 ms 23764 KB Output is correct
3 Correct 12 ms 23892 KB Output is correct
4 Correct 16 ms 23892 KB Output is correct
5 Correct 15 ms 23828 KB Output is correct
6 Correct 14 ms 23784 KB Output is correct
7 Correct 13 ms 23716 KB Output is correct
8 Correct 12 ms 23892 KB Output is correct
9 Correct 12 ms 23892 KB Output is correct
10 Correct 15 ms 23752 KB Output is correct
11 Correct 15 ms 23764 KB Output is correct
12 Correct 13 ms 23892 KB Output is correct
13 Correct 12 ms 23892 KB Output is correct
14 Correct 13 ms 23764 KB Output is correct
15 Correct 13 ms 23764 KB Output is correct
16 Correct 16 ms 23852 KB Output is correct
17 Correct 13 ms 23892 KB Output is correct
18 Correct 12 ms 23840 KB Output is correct
19 Correct 12 ms 23864 KB Output is correct
20 Correct 12 ms 23892 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23824 KB Output is correct
2 Correct 14 ms 23764 KB Output is correct
3 Correct 15 ms 23720 KB Output is correct
4 Correct 12 ms 23764 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 23988 KB Output is correct
2 Correct 13 ms 23764 KB Output is correct
3 Correct 14 ms 23844 KB Output is correct
4 Correct 17 ms 23892 KB Output is correct
5 Correct 13 ms 23980 KB Output is correct
6 Correct 13 ms 24012 KB Output is correct
7 Correct 13 ms 23868 KB Output is correct
8 Correct 12 ms 23764 KB Output is correct
9 Correct 15 ms 23764 KB Output is correct
10 Correct 14 ms 23764 KB Output is correct

Subtask #5
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23892 KB Output is correct
2 Correct 13 ms 23764 KB Output is correct
3 Correct 12 ms 23892 KB Output is correct
4 Correct 16 ms 23892 KB Output is correct
5 Correct 15 ms 23828 KB Output is correct
6 Correct 14 ms 23784 KB Output is correct
7 Correct 13 ms 23716 KB Output is correct
8 Correct 12 ms 23892 KB Output is correct
9 Correct 12 ms 23892 KB Output is correct
10 Correct 15 ms 23752 KB Output is correct
11 Correct 15 ms 23764 KB Output is correct
12 Correct 13 ms 23892 KB Output is correct
13 Correct 12 ms 23892 KB Output is correct
14 Correct 13 ms 23764 KB Output is correct
15 Correct 13 ms 23764 KB Output is correct
16 Correct 16 ms 23852 KB Output is correct
17 Correct 13 ms 23892 KB Output is correct
18 Correct 12 ms 23840 KB Output is correct
19 Correct 12 ms 23864 KB Output is correct
20 Correct 12 ms 23892 KB Output is correct
21 Correct 13 ms 23824 KB Output is correct
22 Correct 14 ms 23764 KB Output is correct
23 Correct 15 ms 23720 KB Output is correct
24 Correct 12 ms 23764 KB Output is correct
25 Correct 16 ms 23988 KB Output is correct
26 Correct 13 ms 23764 KB Output is correct
27 Correct 14 ms 23844 KB Output is correct
28 Correct 17 ms 23892 KB Output is correct
29 Correct 13 ms 23980 KB Output is correct
30 Correct 13 ms 24012 KB Output is correct
31 Correct 13 ms 23868 KB Output is correct
32 Correct 12 ms 23764 KB Output is correct
33 Correct 15 ms 23764 KB Output is correct
34 Correct 14 ms 23764 KB Output is correct
35 Correct 50 ms 29528 KB Output is correct
36 Correct 14 ms 24276 KB Output is correct
37 Correct 48 ms 30540 KB Output is correct
38 Correct 35 ms 34248 KB Output is correct
39 Correct 422 ms 87568 KB Output is correct
40 Correct 416 ms 87396 KB Output is correct
41 Correct 166 ms 87248 KB Output is correct
42 Correct 372 ms 87640 KB Output is correct
43 Runtime error 191 ms 102400 KB Execution killed with signal 9
44 Halted 0 ms 0 KB -