oj.uz

답안 #1059463

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1059463 2024-08-15T01:45:02 Z mindiyak Nautilus (BOI19_nautilus) C++14
66 / 100
 14 ms 9820 KB 
#pragma GCC optimize("O1,O2,O3,Ofast,unroll-loops")
#include <bits/stdc++.h>
#include <string>
#include <iostream>
#include <cmath>
#include <numeric>
#include <stack>
#include <queue>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<vector<pi>> vvpi;
typedef vector<ld> vd;
typedef vector<long long> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
#define FOR(i, a, b) for (int i = a; i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i, a, b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i, a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto &a : x)
#define uid(a, b) uniform_int_distribution<int>(a, b)(rng)
#define len(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define F first
#define nl endl
#define S second
#define lb lower_bound
#define ub upper_bound
#define aint(x) x.begin(), x.end()
#define raint(x) x.rbegin(), x.rend()
#define ins insert
const int M = 1e9+7;
void init(string name)
{
    freopen((name + ".in").c_str(), "r", stdin);
    freopen((name + ".out").c_str(), "w", stdout);
}
void fastIO()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
}

int r,c,m;
vi arr;
// vpi moves = {{-1,0},{0,1},{1,0},{0,-1}};
vpi moves = {{1,0},{0,-1},{-1,0},{0,1}};
vvi maps(105,vi(105,1));
int history[105][105][105];

int dfs(pi pos,int cnt){
    if(maps[pos.F][pos.S] == 1){
        return -1;
    }

    // cerr << pos.F << "," << pos.S << " " << cnt << endl;
    
    if(cnt == m){
        history[pos.F][pos.S][cnt] = 1;
        return 1;
    }

    if(history[pos.F][pos.S][cnt] != 0)return history[pos.F][pos.S][cnt];

    int val = -1;
    if(arr[cnt] == -1){
        FOR(i,0,4){
            val = max(val,dfs({pos.F+moves[i].F,pos.S+moves[i].S},cnt+1));
            if(val == 1)break;
        }
    }else{
        val = dfs({pos.F+moves[arr[cnt]].F,pos.S+moves[arr[cnt]].S},cnt+1);
    }
    history[pos.F][pos.S][cnt] = val;
    return val;
}
 
void solve()
{
    cin >> r >> c >> m;

    FOR(i,1,r+1){
        FOR(j,1,c+1){
            char a;cin >> a;
            if(a == '.'){
                maps[i][j] = 0;
            }else{                
                maps[i][j] = 1;
            }
            FOR(k,0,m)history[i][j][k] = 0;
        }
    }

    FOR(i,0,m){
        char a;cin >> a;
        if(a == 'N')arr.pb(0);
        else if(a == 'E')arr.pb(1);
        else if(a == 'S')arr.pb(2);
        else if(a == 'W')arr.pb(3);
        else arr.pb(-1);
    }

    // FOR(i,1,r+1){
    //     FOR(j,1,c+1){
    //         cerr<<maps[i][j];
    //     }cerr << endl;
    // }

    reverse(arr.begin(),arr.end());

    // for(int i:arr)cerr << i << " ";
    // cerr << endl;

    int ans = 0;
    FOR(i,1,r+1){
        FOR(j,1,c+1){
            // if(i != 2 || j != 4)continue;
            if(maps[i][j] == 0){
                ans += max(dfs({i,j},0),0);
            }
        }
    }

    cout << ans << endl;

}   
 
 
int main()
{
    fastIO();
    // init("test");
    int t = 1;
    // cin >> t;
    while (t--)
        solve();
    return 0;
}

Compilation message

nautilus.cpp: In function 'void init(std::string)':
nautilus.cpp:44:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   44 |     freopen((name + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
nautilus.cpp:45:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   45 |     freopen((name + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
29.0 / 29.0

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

Subtask #2
37.0 / 37.0

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

Subtask #3
0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 4700 KB Output is correct
2 Correct 1 ms 4700 KB Output is correct
3 Correct 1 ms 4700 KB Output is correct
4 Correct 1 ms 4700 KB Output is correct
5 Correct 1 ms 4700 KB Output is correct
6 Correct 1 ms 4700 KB Output is correct
7 Correct 7 ms 4696 KB Output is correct
8 Correct 2 ms 4700 KB Output is correct
9 Correct 1 ms 4700 KB Output is correct
10 Correct 1 ms 4700 KB Output is correct
11 Correct 1 ms 4700 KB Output is correct
12 Correct 6 ms 4836 KB Output is correct
13 Correct 2 ms 4700 KB Output is correct
14 Correct 2 ms 4700 KB Output is correct
15 Correct 1 ms 4700 KB Output is correct
16 Correct 1 ms 4700 KB Output is correct
17 Correct 6 ms 4844 KB Output is correct
18 Correct 2 ms 4700 KB Output is correct
19 Correct 2 ms 4700 KB Output is correct
20 Correct 2 ms 4700 KB Output is correct
21 Correct 1 ms 4700 KB Output is correct
22 Runtime error 14 ms 9820 KB Execution killed with signal 11
23 Halted 0 ms 0 KB -