Submission #307143

#TimeUsernameProblemLanguageResultExecution timeMemory
307143HemimorAwesome Arrowland Adventure (eJOI19_adventure)C++14
100 / 100
139 ms21740 KiB
#include <algorithm> #include <iostream> #include <iomanip> #include <numeric> #include <cassert> #include <vector> #include <random> #include <cmath> #include <queue> #include <set> #include <map> #define syosu(x) fixed<<setprecision(x) using namespace std; typedef long long ll; typedef unsigned int uint; typedef unsigned long long ull; typedef pair<int,int> P; typedef pair<double,double> pdd; typedef pair<ll,ll> pll; typedef vector<int> vi; typedef vector<vi> vvi; typedef vector<double> vd; typedef vector<vd> vvd; typedef vector<ll> vl; typedef vector<vl> vvl; typedef vector<string> vs; typedef vector<P> vp; typedef vector<vp> vvp; typedef vector<pll> vpll; typedef pair<int,P> pip; typedef vector<pip> vip; const int inf=1<<30; const ll INF=1ll<<60; const double pi=acos(-1); const double eps=1e-8; const ll mod=1e9+7; const int dx[4]={-1,0,1,0},dy[4]={0,1,0,-1}; vi vin(int n,int d=0){ vi a(n); for(auto &i:a){ cin>>i; i-=d; } return a; } vl vln(int n,int d=0){ vl a(n); for(auto &i:a){ cin>>i; i-=d; } return a; } vvi gin(int n,int m,int d=1){ vvi g(n); for(int i=0;i<m;i++){ int u,v; cin>>u>>v; u-=d,v-=d; g[u].push_back(v); g[v].push_back(u); } return g; } void vout(vi a){ int n=a.size(); cout<<n<<" :"; for(auto i:a) cout<<' '<<i; cout<<endl; } class Graph{ private: int n; vvp g; public: vi DIJ(int s){ priority_queue<P> q; vi d(n,inf); d[s]=0; q.push({0,s}); while(!q.empty()){ P p=q.top(); q.pop(); int v=p.second; if(d[v]<-p.first) continue; for(auto i:g[v]){ int u=i.first,D=d[v]+i.second; if(d[u]>D){ d[u]=D; q.push({-D,u}); } } } return d; } Graph(int v){ n=v; g=vvp(v); } void add_edge(int s,int t,int c){ g[s].push_back({t,c}); } }; int n,m; vs a; int main(){ cin>>n>>m; a=vs(n); for(auto &s:a) cin>>s; Graph g(n*m); for(int i=0;i<n;i++) for(int j=0;j<m;j++) if(a[i][j]!='X'){ int id; if(a[i][j]=='N') id=0; if(a[i][j]=='E') id=1; if(a[i][j]=='S') id=2; if(a[i][j]=='W') id=3; for(int k=0;k<4;k++){ int x=i+dx[(id+k)%4],y=j+dy[(id+k)%4]; if(x>=0&&x<n&&y>=0&&y<m) g.add_edge(i*m+j,x*m+y,k); } } vi d=g.DIJ(0); int res=d.back(); if(res==inf) res=-1; cout<<res<<endl; }

Compilation message (stderr)

adventure.cpp: In function 'int main()':
adventure.cpp:119:7: warning: 'id' may be used uninitialized in this function [-Wmaybe-uninitialized]
  119 |   int id;
      |       ^~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...