Submission #496378

#TimeUsernameProblemLanguageResultExecution timeMemory
496378mansurNautilus (BOI19_nautilus)C++17
66 / 100
23 ms8444 KiB
#include<bits/stdc++.h> #pragma optimize ("g",on) #pragma GCC optimize ("inline") #pragma GCC optimize ("Ofast") #pragma GCC optimize ("unroll-loops") #pragma GCC optimize ("03") #pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,avx2,mmx,fma,avx,tune=native") #pragma comment(linker, "/stack:200000000") //01001101 01100001 01101011 01101000 01100001 01100111 01100001 01111001 using namespace std; #define all(a) a.begin(), a.end() #define rall(a) a.rbegin(), a.rend() #define ll long long #define pb push_back #define sz(a) a.size() #define nl '\n' #define popb pop_back() #define ld double #define ull unsigned long long #define ff first #define ss second #define fix fixed << setprecision #define pii pair<int, int> #define E exit (0) #define int long long const int inf = 1e9, N = 1e6 + 1, mod = 998244353; vector<pii> dir = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}}; char c[101][101]; int n, m, r; int cn[101][101][102]; string s; bool ok(int x, int y) { return x >= 1 && x <= n && y >= 1 && y <= m && c[x][y] == '.'; } bool can(int x, int y, int pos) { if (cn[x][y][pos] == 1) return 0; if (cn[x][y][pos] == 2) return 1; cn[x][y][pos] = 1; if (pos == sz(s)) { cn[x][y][pos] = 2; return 1; } if (s[pos] == 'N') { x--; if (ok(x, y) && can(x, y, pos + 1)) { cn[x + 1][y][pos] = 2; return 1; } } if (s[pos] == 'S') { x++; if (ok(x, y) && can(x, y, pos + 1)) { cn[x - 1][y][pos] = 2; return 1; } } if (s[pos] == 'E') { y++; if (ok(x, y) && can(x, y, pos + 1)) { cn[x][y - 1][pos] = 2; return 1; } } if (s[pos] == 'W') { y--; if (ok(x, y) && can(x, y, pos + 1)) { cn[x][y + 1][pos] = 2; return 1; } } if (s[pos] == '?') { for (auto e: dir) { x += e.ff, y += e.ss; if (ok(x, y) && can(x, y, pos + 1)) { cn[x - e.ff][y - e.ss][pos] = 2; return 1; } x -= e.ff, y -= e.ss; } } return 0; } main() { //freopen("cowrect.in", "r", stdin); //freopen("cowrect.out", "w", stdout); ios_base::sync_with_stdio(NULL); cin.tie(NULL); cin >> n >> m >> r; for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) cin >> c[i][j]; } cin >> s; reverse(all(s)); for (auto &e: s) { if (e == 'N') e = 'S'; else if (e == 'S') e = 'N'; if (e == 'W') e = 'E'; else if (e == 'E') e = 'W'; } int ans = 0; for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { if (c[i][j] == '#') continue; if (can(i, j, 0)) ans++; } } cout << ans; }

Compilation message (stderr)

nautilus.cpp:3: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    3 | #pragma optimize ("g",on)
      | 
nautilus.cpp:9: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
    9 | #pragma comment(linker, "/stack:200000000")
      | 
nautilus.cpp: In function 'bool can(long long int, long long int, long long int)':
nautilus.cpp:51:10: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   51 |  if (pos == sz(s)) {
      |          ^
nautilus.cpp: At global scope:
nautilus.cpp:96:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   96 | main() {
      | ^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...