제출 #553554

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
553554		Awerar	Nautilus (BOI19_nautilus)	C++14	66 / 100	149 ms	262144 KiB

nautilus

#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <limits.h>
#include <math.h>
#include <chrono>
#include <queue>
#include <stack>
#include <algorithm>

using namespace std;

#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")

#define ll long long
#define vi vector<ll>
#define vvi vector<vi>
#define p2 pair<ll, ll>
#define p3 tuple<ll,ll,ll>
#define p4 vi
#define ip3 tuple<int,int,int>
#define ip4 tuple<int,int,int,int>
#define vp2 vector<p2>
#define vp3 vector<p3>
#define inf 2e9
#define linf 1e17

#define read(a) cin >> a
#define write(a) cout << (a) << "\n"
#define dread(type, a) type a; cin >> a
#define dread2(type, a, b) dread(type, a); dread(type, b)
#define dread3(type, a, b, c) dread2(type, a, b); dread(type, c)
#define dread4(type, a, b, c, d) dread3(type, a, b, c); dread(type, d)
#define dread5(type, a, b, c, d, e) dread4(type, a, b, c, d); dread(type, e)
#ifdef _DEBUG
#define deb __debugbreak();
#else
#define deb ;
#endif

#define rep(i, high) for (ll i = 0; i < high; i++)
#define repp(i, low, high) for (ll i = low; i < high; i++)
#define repe(i, container) for (auto& i : container)
#define per(i, high) for (ll i = high; i >= 0; i--)

#define readpush(type,vect) type temp; read(temp); vect.push_back(temp);
#define readvector(type, name, size) vector<type> name(size); rep(i,size) {dread(type,temp); name[i]=temp;}
#define readinsert(type,a) {type temp; read(temp); a.insert(temp);}
#define all(a) begin(a),end(a)
#define setcontains(set, x) (set.find(x) != set.end())
#define stringcontains(str, x) (str.find(x) != string::npos)
#define within(a, b, c, d) (a >= 0 && a < b && c >= 0 && c < d)

#define ceildiv(x,y) ((x + y - 1) / y)
#define fract(a) (a-floor(a))
#define sign(a) ((a>0) ? 1 : -1)

auto Start = chrono::high_resolution_clock::now();

inline void fast()
{
    ios::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);
}

ll w, h, m;
vector<vector<bool>> grid;
vector<vector<vector<bool*>>> dp_table;
string instructions;

bool dp(int x, int y, int i) {
    if(x < 0 || x >= w || y < 0 || y >= h || grid[x][y]) return false;
    if(i < 0) return true;

    if(dp_table[x][y][i] != NULL) return *dp_table[x][y][i];

    string dirs = "";
    dirs += instructions[i];
    if(dirs[0] == '?') dirs = "EWNS";

    bool res = false;
    for(int j = 0; j < dirs.size(); j++) {
        switch (dirs[j])
        {
        case 'E': if(dp(x - 1, y, i - 1)) res = true; break;
        case 'W': if(dp(x + 1, y, i - 1)) res = true; break;
        case 'N': if(dp(x, y + 1, i - 1)) res = true; break;
        case 'S': if(dp(x, y - 1, i - 1)) res = true; break;
        }
    }

    dp_table[x][y][i] = new bool(res);
    return res;
}

int main() {
    //fast();

    cin >> h >> w >> m;
    grid.resize(w, vector<bool>(h));

    for(int y = 0; y < h; y++) {
        for(int x = 0; x < w; x++) {
            char c;
            cin >> c;

            grid[x][y] = c == '#';
        }
    }

    cin >> instructions;
    dp_table.resize(w, vector<vector<bool*>>(h, vector<bool*>(instructions.size(), NULL)));

    int answer = 0;
    rep(x, w) {
        rep(y, h) {
            if(dp(x, y, instructions.size() - 1)) answer++;
        }
    }

    cout << answer;
}

/*
5 9 7
...##....
..#.##..#
..#....##
.##...#..
....#....
WS?EE??

*/

컴파일 시 표준 에러 (stderr) 메시지

nautilus.cpp:18: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
   18 | #pragma GCC optimization ("O3")
      | 
nautilus.cpp:19: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
   19 | #pragma GCC optimization ("unroll-loops")
      | 
nautilus.cpp: In function 'bool dp(int, int, int)':
nautilus.cpp:88:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   88 |     for(int j = 0; j < dirs.size(); j++) {
      |                    ~~^~~~~~~~~~~~~

• Subtask 1: 29 / 29
• Subtask 2: 37 / 37
• Subtask 3: 0 / 34