oj.uz

답안 #496399

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
496399 2021-12-21T07:24:51 Z xynex Nautilus (BOI19_nautilus) C++17
66 / 100
 23 ms 3276 KB 
/*
* Author: xynex
* Created: 21.12.2021 13:11
* Why am I so stupid? :c
* Slishkom slab
*/

#include <bits/stdc++.h>

// #pragma GCC optimize("inline")
// #pragma GCC optimize("-fgcse,-fgcse-lm")
// #pragma GCC optimize("-ftree-pre,-ftree-vrp")
// #pragma GCC optimize("-ffast-math")
// #pragma GCC optimize("-fipa-sra")
// #pragma GCC optimize("-fpeephole2")
// #pragma GCC optimize("-fsched-spec")
// #pragma GCC optimize("Ofast,no-stack-protector")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
// #pragma GCC optimize("unroll-loops")

using namespace std;

#define ll long long
#define dl double long
#define ull unsigned long long
#define pr pair
#define vt vector
#define ff first
#define ss second
#define mp make_pair
#define sz(a) (int)a.size()
#define pb push_back
#define pf push_front
#define popB pop_back
#define popF pop_front
#define bit_count __builtin_popcount
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sp(x) fixed << setprecision(x)

template<typename T> T get_rand(T l, T r) {
    random_device rd;
    mt19937 gen(rd());
    return uniform_int_distribution<T>(l, r)(gen);
}

template<typename T> T lcm(T a, T b) { return a * (b / __gcd(a, b)); }

template<class A> void read(vt<A>& v);
template<class A, size_t S> void read(array<A, S>& a);
template<class T> void read(T& x) { cin >> x; }
void read(double& d) { string t; read(t); d = stod(t); }
void read(long double& d) { string t; read(t); d = stold(t); }
template<class H, class... T> void read(H& h, T&... t) { read(h); read(t...); }
template<class A> void read(vt<A>& x) { for (auto& a : x) read(a); }
template<class A, size_t S> void read(array<A, S>& x) { for (auto& a : x) read(a); }

string to_string(char c) { return string(1, c); }
string to_string(bool b) { return b ? "true" : "false"; }
string to_string(const char* s) { return string(s); }
string to_string(string s) { return s; }
string to_string(vt<bool> v) { string res; for (int i = 0; i < sz(v); ++i) res += char('0' + v[i]); return res; }
template<size_t S> string to_string(bitset<S> b) { string res; for (int i = 0; i < S; ++i) res += char('0' + b[i]); return res; }
template<class T> string to_string(T v) { bool f = 1; string res; for (auto x : v) { if (!f) res += ' '; f = 0; res += to_string(x); } return res; }

template<class A> void write(A x) { cout << to_string(x); }
template<class H, class... T> void write(const H& h, const T&... t) { write(h); write(t...); }

void print() { write("\n"); }
template<class H, class... T> void print(const H& h, const T&... t) { write(h); if (sizeof...(t)) write(' '); print(t...); }

void freop(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}

const int MOD = 1e9 + 7;
const int N = 3e6 + 5;
const ll INF = 9e18;
const int M = 1e2 + 5;
const dl pi = acos(-1);
const dl eps = 1e-12;
const int sq = 700;

int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
/* ll vs int*/

void precalc() {

}

int n, m, k;
bool used[M][M][M];
bool ok[M][M];
char s[M][M];
string str;
bool in(int x, int y, int pos) {
    if(!x || !y || x == n + 1 || y == m + 1) return 0;
    if(used[x][y][pos]) return 0;
    if(s[x][y] == '#') return 0;
    return 1;
}
void dfs(int x, int y, int pos) {
    used[x][y][pos] = 1;
    if(pos == k) {
        ok[x][y] = 1;
        return;
    }
    if(str[pos] == '?') {
        if(in(x - 1, y, pos + 1)) dfs(x - 1, y, pos + 1);
        if(in(x + 1, y, pos + 1)) dfs(x + 1, y, pos + 1);
        if(in(x, y - 1, pos + 1)) dfs(x, y - 1, pos + 1);
        if(in(x, y + 1, pos + 1)) dfs(x, y + 1, pos + 1);
        return;
    }
    if(str[pos] == 'W') {
        if(in(x, y - 1, pos + 1)) dfs(x, y - 1, pos + 1);
    }
    if(str[pos] == 'E') {
        if(in(x, y + 1, pos + 1)) dfs(x, y + 1, pos + 1);
    }
    if(str[pos] == 'S') {
        if(in(x + 1, y, pos + 1)) dfs(x + 1, y, pos + 1);
    }
    if(str[pos] == 'N') {
        if(in(x - 1, y, pos + 1)) dfs(x - 1, y, pos + 1);
    }
}
void solve() {
    read(n, m, k);
    for(int i = 1; i <= n; ++i) {
        for(int j = 1; j <= m; ++j) read(s[i][j]);
    }
    read(str);
    for(int i = 1; i <= n; ++i) {
        for(int j = 1; j <= m; ++j) {
            if(in(i, j, 0)) dfs(i, j, 0);
        }
    }
    int ans = 0;
    for(int i = 1; i <= n; ++i) {
        for(int j = 1; j <= m; ++j) ans += ok[i][j];
    }
    print(ans);
}

int main() {
    //freop("");
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    //read(t);
    precalc();
    for (int i = 1; i <= t; ++i) {
        //write("Case #" + to_string(i) + ": ");
        solve();
    }
    return 0;
}

Compilation message

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

Subtask #1
29.0 / 29.0

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

Subtask #2
37.0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 1388 KB Output is correct
2 Correct 2 ms 1356 KB Output is correct
3 Correct 1 ms 1356 KB Output is correct
4 Correct 1 ms 1356 KB Output is correct
5 Correct 1 ms 1356 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 21 ms 1356 KB Output is correct
8 Correct 5 ms 1356 KB Output is correct
9 Correct 2 ms 1356 KB Output is correct
10 Correct 2 ms 1356 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 19 ms 1356 KB Output is correct
13 Correct 23 ms 1424 KB Output is correct
14 Correct 15 ms 1412 KB Output is correct
15 Correct 2 ms 1356 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 17 ms 1420 KB Output is correct
18 Correct 23 ms 1404 KB Output is correct
19 Correct 8 ms 1356 KB Output is correct
20 Correct 3 ms 1356 KB Output is correct
21 Correct 1 ms 332 KB Output is correct

Subtask #3
0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 1388 KB Output is correct
2 Correct 2 ms 1356 KB Output is correct
3 Correct 1 ms 1356 KB Output is correct
4 Correct 1 ms 1356 KB Output is correct
5 Correct 1 ms 1356 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 21 ms 1356 KB Output is correct
8 Correct 5 ms 1356 KB Output is correct
9 Correct 2 ms 1356 KB Output is correct
10 Correct 2 ms 1356 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 19 ms 1356 KB Output is correct
13 Correct 23 ms 1424 KB Output is correct
14 Correct 15 ms 1412 KB Output is correct
15 Correct 2 ms 1356 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 17 ms 1420 KB Output is correct
18 Correct 23 ms 1404 KB Output is correct
19 Correct 8 ms 1356 KB Output is correct
20 Correct 3 ms 1356 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Runtime error 12 ms 3276 KB Execution killed with signal 11
23 Halted 0 ms 0 KB -