oj.uz

답안 #218292

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
218292 2020-04-01T20:33:37 Z 2fat2code Awesome Arrowland Adventure (eJOI19_adventure) C++17
100 / 100
 164 ms 42072 KB 
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define all(a) (a).begin(), (a).end()
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define sz() size()
#define fr first
#define sc second
#define pi pair<int,int>
#define pii pair<pair<int,int>,int>
#define mp make_pair
#define int long long
#define rc(s) return cout<<s,0
#define rcc(s) cout<<s,exit(0)
using namespace std;

const int mod=1e9+7;
const int modp=1999999973;
const int modulo=998244353;

const int nmax=505;

char directii[]={'N','E','S','W','N','E','S','W'};

int n,m;
char c[nmax][nmax];
vector<pair<pair<int,int>,int>>nod[nmax][nmax];

void addedge(int i,int j){
    if(c[i][j]=='X') return;
    int indx=0;
    while(directii[indx]!=c[i][j]) ++indx;
    int cnt=-1;
    for(int t=1;t<=4;t++){
        ++cnt;
        if(directii[indx]=='E' || directii[indx]=='W'){
            if(directii[indx]=='E' && j<m){
                nod[i][j].push_back({{i,j+1},cnt});
            }
            else if(directii[indx]=='W' && j>1){
                nod[i][j].push_back({{i,j-1},cnt});
            }
        }
        else{
            if(directii[indx]=='N' && i>1){
                nod[i][j].push_back({{i-1,j},cnt});
            }
            else if(directii[indx]=='S' && i<n){
                nod[i][j].push_back({{i+1,j},cnt});
            }
        }
        indx++;
    }
}

int viz[nmax][nmax];

int SANDUAUReJOI(){
    int x=1,y=1;
    viz[1][1]=1;
    priority_queue<pair<int,pair<int,int>>,vector<pair<int,pair<int,int>>>,greater<pair<int,pair<int,int>>>>q;
    for(auto it:nod[1][1]){
        q.push({it.sc,{it.fr.fr,it.fr.sc}});
    }
    while(q.size() && (q.top().sc.fr!=n || q.top().sc.sc!=m)){
        auto it=q.top();
        int x=it.sc.fr;
        int y=it.sc.sc;
        if(viz[x][y]==1){
            q.pop();
            continue;
        }
        q.pop();
        int z=it.fr;
        for(auto it1 : nod[x][y]){
            if(viz[it1.fr.fr][it1.fr.sc]==0){
                q.push({z+it1.sc,{it1.fr.fr,it1.fr.sc}});
            }
        }
        viz[x][y]=1;
    }
    if(q.empty()==true) return -1LL;
    return q.top().fr;
}


int32_t main(){
  //  ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
    srand(chrono::steady_clock::now().time_since_epoch().count());
    //ifstream cin("input.in");
    cin >> n >> m;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            cin >> c[i][j];
            addedge(i,j);
        }
    }
    cout << SANDUAUReJOI();
}

Compilation message

adventure.cpp: In function 'long long int SANDUAUReJOI()':
adventure.cpp:61:9: warning: unused variable 'x' [-Wunused-variable]
     int x=1,y=1;
         ^
adventure.cpp:61:13: warning: unused variable 'y' [-Wunused-variable]
     int x=1,y=1;
             ^

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 6400 KB Output is correct
2 Correct 8 ms 6400 KB Output is correct
3 Correct 9 ms 6400 KB Output is correct
4 Correct 8 ms 6400 KB Output is correct
5 Correct 8 ms 6400 KB Output is correct
6 Correct 8 ms 6272 KB Output is correct
7 Correct 8 ms 6272 KB Output is correct
8 Correct 8 ms 6272 KB Output is correct
9 Correct 8 ms 6400 KB Output is correct
10 Correct 8 ms 6272 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 6400 KB Output is correct
2 Correct 8 ms 6400 KB Output is correct
3 Correct 9 ms 6400 KB Output is correct
4 Correct 8 ms 6400 KB Output is correct
5 Correct 8 ms 6400 KB Output is correct
6 Correct 8 ms 6272 KB Output is correct
7 Correct 8 ms 6272 KB Output is correct
8 Correct 8 ms 6272 KB Output is correct
9 Correct 8 ms 6400 KB Output is correct
10 Correct 8 ms 6272 KB Output is correct
11 Correct 8 ms 6400 KB Output is correct
12 Correct 8 ms 6400 KB Output is correct
13 Correct 8 ms 6400 KB Output is correct
14 Correct 8 ms 6272 KB Output is correct
15 Correct 8 ms 6400 KB Output is correct
16 Correct 8 ms 6400 KB Output is correct
17 Correct 8 ms 6400 KB Output is correct
18 Correct 8 ms 6272 KB Output is correct
19 Correct 8 ms 6272 KB Output is correct
20 Correct 8 ms 6400 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 6272 KB Output is correct
2 Correct 8 ms 6272 KB Output is correct
3 Correct 9 ms 6384 KB Output is correct
4 Correct 8 ms 6400 KB Output is correct

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 6400 KB Output is correct
2 Correct 8 ms 6272 KB Output is correct
3 Correct 8 ms 6400 KB Output is correct
4 Correct 8 ms 6400 KB Output is correct
5 Correct 8 ms 6400 KB Output is correct
6 Correct 8 ms 6400 KB Output is correct
7 Correct 9 ms 6400 KB Output is correct
8 Correct 8 ms 6400 KB Output is correct
9 Correct 8 ms 6400 KB Output is correct
10 Correct 9 ms 6400 KB Output is correct

Subtask #5
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 6400 KB Output is correct
2 Correct 8 ms 6400 KB Output is correct
3 Correct 9 ms 6400 KB Output is correct
4 Correct 8 ms 6400 KB Output is correct
5 Correct 8 ms 6400 KB Output is correct
6 Correct 8 ms 6272 KB Output is correct
7 Correct 8 ms 6272 KB Output is correct
8 Correct 8 ms 6272 KB Output is correct
9 Correct 8 ms 6400 KB Output is correct
10 Correct 8 ms 6272 KB Output is correct
11 Correct 8 ms 6400 KB Output is correct
12 Correct 8 ms 6400 KB Output is correct
13 Correct 8 ms 6400 KB Output is correct
14 Correct 8 ms 6272 KB Output is correct
15 Correct 8 ms 6400 KB Output is correct
16 Correct 8 ms 6400 KB Output is correct
17 Correct 8 ms 6400 KB Output is correct
18 Correct 8 ms 6272 KB Output is correct
19 Correct 8 ms 6272 KB Output is correct
20 Correct 8 ms 6400 KB Output is correct
21 Correct 8 ms 6272 KB Output is correct
22 Correct 8 ms 6272 KB Output is correct
23 Correct 9 ms 6384 KB Output is correct
24 Correct 8 ms 6400 KB Output is correct
25 Correct 10 ms 6400 KB Output is correct
26 Correct 8 ms 6272 KB Output is correct
27 Correct 8 ms 6400 KB Output is correct
28 Correct 8 ms 6400 KB Output is correct
29 Correct 8 ms 6400 KB Output is correct
30 Correct 8 ms 6400 KB Output is correct
31 Correct 9 ms 6400 KB Output is correct
32 Correct 8 ms 6400 KB Output is correct
33 Correct 8 ms 6400 KB Output is correct
34 Correct 9 ms 6400 KB Output is correct
35 Correct 20 ms 8576 KB Output is correct
36 Correct 9 ms 6528 KB Output is correct
37 Correct 23 ms 9216 KB Output is correct
38 Correct 19 ms 10112 KB Output is correct
39 Correct 164 ms 30840 KB Output is correct
40 Correct 156 ms 30840 KB Output is correct
41 Correct 76 ms 28816 KB Output is correct
42 Correct 157 ms 30840 KB Output is correct
43 Correct 134 ms 42072 KB Output is correct
44 Correct 78 ms 28664 KB Output is correct