oj.uz

답안 #1084122

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1084122 2024-09-05T09:00:17 Z _rain_ Nautilus (BOI19_nautilus) C++14
100 / 100
 242 ms 157616 KB 
#include<bits/stdc++.h>
using namespace std;
#define fixbug false
#define ll long long

const int maxn = 500;
const int maxm = 5000;
char c[maxn+2][maxn+2];
string s;
int numrow , numcol , m;

namespace subtask1{
    bool check(){
        return numrow <= 100 && numcol <= 100 && m <= 500;
    }
    bool inside(int x , int y){
        return x > 0 && y > 0 && x <= numrow && y <= numcol && c[x][y] == '.';
    }
    const int maxN = 100;
    bool dp[maxN+1][maxN+1][maxN+1] = {};
    void main_code(){
        s = '#' + s;
        for (int i = 1; i <= numrow; ++i){
            for (int j = 1; j <= numcol; ++j)
                dp[i][j][0] = (c[i][j] == '.');
        }
        for (int t = 1; t <= m; ++t){
            vector<pair<int,int>> direct;
            if (s[t]=='?'){
                direct.push_back({0,1}); // E
                direct.push_back({0,-1}); // W
                direct.push_back({-1,0}); // N
                direct.push_back({1,0}); // S
            }
            else{
                if (s[t]=='E') direct.push_back({0,1});
                if (s[t]=='W') direct.push_back({0,-1});
                if (s[t]=='N') direct.push_back({-1,0});
                if (s[t]=='S') direct.push_back({1,0});
            }
            for (int i = 1; i <= numrow; ++i){
                for (int j = 1; j <= numcol; ++j){
                    if (dp[i][j][t-1]){
                        for (auto& x : direct){
                            int u = i + x.first , v = j + x.second;
                            if (inside(u,v)) dp[u][v][t] = true;
                        }
                    }
                }
            }
        }
        int ans = 0;
        for (int i = 1; i <= numrow; ++i){
            for (int j = 1; j <= numcol; ++j) if (dp[i][j][m]) {
                ++ans;
                if (fixbug){
                    cout << i << ' ' << j << '\n';
                }
            }
        }
        cout << ans << '\n';
    }
}

namespace subtask2{
    bool check(){
        return true;
    }

    const int maxN = 500 , maxk = 5000;
    bitset<maxN+2> dp[maxN+2][maxk+2];
    bitset<maxN+2> oc[maxN+2];

    void main_code(){
        s = '#' + s;
        for (int i = 1; i <= numrow; ++i){
            for (int j = 1; j <= numcol ;++j){
                oc[i][j] = (c[i][j]=='.'?1:0);
            }
            dp[i][0] = oc[i];
        }
        int ans = 0;
        for (int t = 1; t <= m; ++t){
                for (int i = 1; i <= numrow; ++i){
                    if (s[t]=='?') dp[i][t] = (dp[i - 1][t - 1] | dp[i + 1][t - 1] | (dp[i][t - 1]<<1) | (dp[i][t-1]>>1))&oc[i];
                    if (s[t]=='E') dp[i][t] = (dp[i][t - 1] << 1) & oc[i];
                    if (s[t]=='W') dp[i][t] = (dp[i][t - 1] >> 1) & oc[i];
                    if (s[t]=='N') dp[i][t] = dp[i + 1][t - 1] & oc[i];
                    if (s[t]=='S') dp[i][t] = dp[i - 1][t - 1] & oc[i];
                }
        }
        if (fixbug){
            for (int t = 0; t <= 3; ++t){
                cout << "(DEBUG LAYER : " << t << ")\n";
                for (int i = 1; i <= numrow; ++i) {
                    for (int j = 1; j <= numcol; ++j) cout << dp[i][t][j] << ' ';
                    cout << '\n';
                }
            }
        }
        for (int i = 1; i <= numrow; ++i) ans += dp[i][m].count();
        cout << ans;
    }
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    #define name "main"
   // freopen(name".inp","r",stdin);

    cin >> numrow >> numcol >> m;
    for (int i = 1; i <= numrow; ++i){
        for (int j = 1; j <= numcol; ++j){
            cin >> c[i][j];
        }
    }
    cin >> s;
    if (subtask1::check()) {
        subtask1::main_code();
        exit(0);
    }
    subtask2::main_code();
    exit(0);
}

Subtask #1
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 1368 KB Output is correct
2 Correct 3 ms 1372 KB Output is correct
3 Correct 3 ms 1372 KB Output is correct
4 Correct 3 ms 1368 KB Output is correct
5 Correct 3 ms 1372 KB Output is correct
6 Correct 3 ms 1528 KB Output is correct

Subtask #2
37.0 / 37.0

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

Subtask #3
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 1368 KB Output is correct
2 Correct 3 ms 1372 KB Output is correct
3 Correct 3 ms 1372 KB Output is correct
4 Correct 3 ms 1368 KB Output is correct
5 Correct 3 ms 1372 KB Output is correct
6 Correct 3 ms 1528 KB Output is correct
7 Correct 7 ms 1372 KB Output is correct
8 Correct 5 ms 1372 KB Output is correct
9 Correct 3 ms 1372 KB Output is correct
10 Correct 3 ms 1372 KB Output is correct
11 Correct 5 ms 1372 KB Output is correct
12 Correct 11 ms 1368 KB Output is correct
13 Correct 11 ms 1372 KB Output is correct
14 Correct 10 ms 1536 KB Output is correct
15 Correct 3 ms 1372 KB Output is correct
16 Correct 3 ms 1532 KB Output is correct
17 Correct 12 ms 1372 KB Output is correct
18 Correct 13 ms 1372 KB Output is correct
19 Correct 7 ms 1532 KB Output is correct
20 Correct 3 ms 1372 KB Output is correct
21 Correct 3 ms 1372 KB Output is correct
22 Correct 137 ms 157484 KB Output is correct
23 Correct 133 ms 157520 KB Output is correct
24 Correct 130 ms 157536 KB Output is correct
25 Correct 138 ms 157572 KB Output is correct
26 Correct 131 ms 157508 KB Output is correct
27 Correct 185 ms 157616 KB Output is correct
28 Correct 196 ms 157520 KB Output is correct
29 Correct 199 ms 157440 KB Output is correct
30 Correct 204 ms 157520 KB Output is correct
31 Correct 194 ms 157428 KB Output is correct
32 Correct 236 ms 157596 KB Output is correct
33 Correct 238 ms 157532 KB Output is correct
34 Correct 242 ms 157520 KB Output is correct
35 Correct 233 ms 157604 KB Output is correct
36 Correct 230 ms 157524 KB Output is correct