Submission #1059457

#TimeUsernameProblemLanguageResultExecution timeMemory
1059457mindiyakNautilus (BOI19_nautilus)C++14
29 / 100
1097 ms1488 KiB
#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(505,vi(505,1)); int dfs(pi pos,int cnt){ if(maps[pos.F][pos.S] == 1)return 0; // cerr << pos.F << "," << pos.S << " " << cnt << endl; if(cnt == m){ return 1; } if(arr[cnt] == -1){ int val = 0; FOR(i,0,4){ val = max(val,dfs({pos.F+moves[i].F,pos.S+moves[i].S},cnt+1)); if(val == 1)break; } return val; }else{ return dfs({pos.F+moves[arr[cnt]].F,pos.S+moves[arr[cnt]].S},cnt+1); } } 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(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 += dfs({i,j},0); } } } cout << ans << endl; } int main() { fastIO(); // init("test"); int t = 1; // cin >> t; while (t--) solve(); return 0; }

Compilation message (stderr)

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);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...