oj.uz

답안 #123211

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
123211 2019-06-30T11:43:14 Z miguel Nautilus (BOI19_nautilus) C++14
66 / 100
 1000 ms 145244 KB 
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define dbg(x) cout << #x << '=' << x << '\n';
#define ll long long
#define sz size()
#define x first
#define y second
#define pi pair <int, int>
#define pii pair <pi, int>
#define vi vector <int>
const ll mod = 1000000007;
//#define int ll
int n, m, ss, ans;
set <pi> mp;
bool t[501][501];
bool dp[5002][501][501];
string s;

bool valid(int x, int y){
    if(x>0 && x<=n && y>0 && y<=m && t[x][y]) return 1;
    else return 0;
}

int32_t main(){
    ios_base :: sync_with_stdio(0); cin.tie(); cout.tie();
    cin>>n>>m>>ss;
    for(int i=1; i<=n; i++){
        for(int j=1; j<=m; j++){
            char c;
            cin>>c;
            if(c=='#') t[i][j]=0;
            else t[i][j]=1;
        }
    }
    cin>>s;
    for(int cur=0; cur<ss; cur++){
        for(int i=1; i<=n; i++){
            for(int j=1; j<=m; j++){
                if(valid(i, j) && (cur==0 || dp[cur][i][j])){
                    int x=i, y=j;
                    char c=s[cur];
                    if(c=='?'){
                        if(valid(x+1, y)) dp[cur+1][x+1][y]=1, x++;
                        x=i; y=j;
                        if(valid(x, y+1)) dp[cur+1][x][y+1]=1, y++;
                        x=i; y=j;
                        if(valid(x-1, y)) dp[cur+1][x-1][y]=1, x--;
                        x=i; y=j;
                        if(valid(x, y-1)) dp[cur+1][x][y-1]=1, y--;
                    }
                    else if(c=='S'){
                        if(valid(x+1, y)) dp[cur+1][x+1][y]=1, x++;
                    }
                    else if(c=='E'){
                        if(valid(x, y+1)) dp[cur+1][x][y+1]=1, y++;
                    }
                    else if(c=='N'){
                        if(valid(x-1, y)) dp[cur+1][x-1][y]=1, x--;
                    }
                    else if(c=='W'){
                        if(valid(x, y-1)) dp[cur+1][x][y-1]=1, y--;
                    }
                }
            }
        }
    }
    for(int i=1; i<=n; i++){
        for(int j=1; j<=m; j++){
            if(dp[ss][i][j]) ans++;
        }
    }
    cout<<ans;
}

Subtask #1
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 5368 KB Output is correct
2 Correct 10 ms 4860 KB Output is correct
3 Correct 11 ms 2472 KB Output is correct
4 Correct 10 ms 1400 KB Output is correct
5 Correct 8 ms 1244 KB Output is correct
6 Correct 4 ms 888 KB Output is correct

Subtask #2
37.0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 5368 KB Output is correct
2 Correct 10 ms 4860 KB Output is correct
3 Correct 11 ms 2472 KB Output is correct
4 Correct 10 ms 1400 KB Output is correct
5 Correct 8 ms 1244 KB Output is correct
6 Correct 4 ms 888 KB Output is correct
7 Correct 12 ms 5624 KB Output is correct
8 Correct 15 ms 5624 KB Output is correct
9 Correct 12 ms 4472 KB Output is correct
10 Correct 9 ms 2168 KB Output is correct
11 Correct 4 ms 1144 KB Output is correct
12 Correct 16 ms 5752 KB Output is correct
13 Correct 19 ms 5752 KB Output is correct
14 Correct 19 ms 5752 KB Output is correct
15 Correct 10 ms 4884 KB Output is correct
16 Correct 4 ms 1272 KB Output is correct
17 Correct 19 ms 5752 KB Output is correct
18 Correct 21 ms 5624 KB Output is correct
19 Correct 18 ms 5752 KB Output is correct
20 Correct 11 ms 5752 KB Output is correct
21 Correct 4 ms 1144 KB Output is correct

Subtask #3
0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 5368 KB Output is correct
2 Correct 10 ms 4860 KB Output is correct
3 Correct 11 ms 2472 KB Output is correct
4 Correct 10 ms 1400 KB Output is correct
5 Correct 8 ms 1244 KB Output is correct
6 Correct 4 ms 888 KB Output is correct
7 Correct 12 ms 5624 KB Output is correct
8 Correct 15 ms 5624 KB Output is correct
9 Correct 12 ms 4472 KB Output is correct
10 Correct 9 ms 2168 KB Output is correct
11 Correct 4 ms 1144 KB Output is correct
12 Correct 16 ms 5752 KB Output is correct
13 Correct 19 ms 5752 KB Output is correct
14 Correct 19 ms 5752 KB Output is correct
15 Correct 10 ms 4884 KB Output is correct
16 Correct 4 ms 1272 KB Output is correct
17 Correct 19 ms 5752 KB Output is correct
18 Correct 21 ms 5624 KB Output is correct
19 Correct 18 ms 5752 KB Output is correct
20 Correct 11 ms 5752 KB Output is correct
21 Correct 4 ms 1144 KB Output is correct
22 Execution timed out 1077 ms 145244 KB Time limit exceeded
23 Halted 0 ms 0 KB -