oj.uz

답안 #1108744

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1108744 2024-11-04T22:46:20 Z MrPavlito Nautilus (BOI19_nautilus) C++17
100 / 100
 162 ms 828 KB 
#include <bits/stdc++.h>
#define int long long
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define sc second
#define endl "\n"
#define pii pair<int,int>

using namespace std;

const int MAXN =505;
const int mod7 = 1e9+7;
const long long inf = 1e18;

vector<bitset<MAXN>> matrica(MAXN);
vector<pair<bitset<MAXN>, bitset<MAXN>>> dp(MAXN);


signed main()
{
    ios_base::sync_with_stdio(false),cin.tie(0), cout.tie(0);
    int tt=1;
    //cin >> tt;
    while(tt--)
    {
        int n,m, k;
        cin >> n >> m >> k;
        string str;
        for(int i=1; i<=n; i++)
        {
            string s;cin >> s;
            for(int j=1;j<=m; j++)
            {
                if(s[j-1] == '.')
                {
                    matrica[i][m-j+1] = 1;
                    dp[i].fi[m-j+1] = 1;
                }
            }
        }
        cin >> str;
        for(int p = 0;p<k; p++)
        {
            if(str[p] == '?')
            {
                for(int i=1; i<=n; i++)
                {
                    dp[i].sc=(dp[i-1].fi|dp[i+1].fi|(dp[i].fi << 1)|(dp[i].fi >> 1));
                }
            }
            else
            {
                if(str[p] == 'N') for(int i=1; i<=n; i++)dp[i].sc=dp[i+1].fi;
                else if(str[p] == 'S') for(int i=1; i<=n; i++)dp[i].sc=dp[i-1].fi;
                else if(str[p] == 'W')  for(int i=1; i<=n; i++)dp[i].sc = (dp[i].fi << 1);
                else for(int i=1; i<=n; i++)dp[i].sc = (dp[i].fi >> 1);
            }
            for(int i=1; i<=n; i++)dp[i].sc&= matrica[i];
            for(int i=1; i<=n; i++)dp[i].fi = dp[i].sc;
        }
        int rez = 0;
        for(int i=1; i<=n; i++)
        {
            for(int j=1; j<=m; j++)
            {
                rez+= dp[i].fi[j];
            }
        }
        cout << rez << endl;



    }
}

Subtask #1
29.0 / 29.0

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

Subtask #2
37.0 / 37.0

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

Subtask #3
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 592 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 568 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 2 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 2 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 2 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 72 ms 592 KB Output is correct
23 Correct 73 ms 592 KB Output is correct
24 Correct 71 ms 592 KB Output is correct
25 Correct 74 ms 592 KB Output is correct
26 Correct 69 ms 592 KB Output is correct
27 Correct 119 ms 668 KB Output is correct
28 Correct 121 ms 592 KB Output is correct
29 Correct 123 ms 592 KB Output is correct
30 Correct 126 ms 816 KB Output is correct
31 Correct 119 ms 592 KB Output is correct
32 Correct 160 ms 820 KB Output is correct
33 Correct 162 ms 672 KB Output is correct
34 Correct 159 ms 828 KB Output is correct
35 Correct 161 ms 592 KB Output is correct
36 Correct 159 ms 592 KB Output is correct