제출 #394461

#제출 시각아이디문제언어결과실행 시간메모리
394461Carmel_Ab1Nautilus (BOI19_nautilus)C++17
29 / 100
47 ms1040 KiB
#include<bits/stdc++.h> //#include <ext/pb_ds/assoc_container.hpp> //#include <ext/pb_ds/tree_policy.hpp> //using namespace __gnu_pbds; using namespace std; typedef long double ld; typedef long long ll; typedef unsigned long long ull; typedef vector<int>vi; typedef vector<vector<int>>vvi; typedef vector<ll>vl; typedef vector<vl> vvl; typedef pair<int,int>pi; typedef pair<ll,ll> pl; typedef vector<pl> vpl; typedef vector<ld> vld; typedef pair<ld,ld> pld; //typedef tree<ll, null_type, less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set; template<typename T> ostream& operator<<(ostream& os, vector<T>& a){os<<"[";for(int i=0; i<ll(a.size()); i++){os << a[i] << ((i!=ll(a.size()-1)?" ":""));}os << "]\n"; return os;} #define all(x) x.begin(),x.end() #define YES out("YES") #define NO out("NO") #define out(x){cout << x << "\n"; return;} #define GLHF ios_base::sync_with_stdio(false); cin.tie(NULL) #define print(x){for(auto ait:x) cout << ait << " "; cout << "\n";} #define gcd __gcd #define popcount __builtin_popcountll #define mp make_pair template<typename T1, typename T2> istream& operator>>(istream& is, pair<T1, T2>& p){is >> p.first >> p.second;return is;} template<typename T1, typename T2> ostream& operator<<(ostream& os, pair<T1, T2>& p){os <<"" << p.first << " " << p.second << ""; return os;} void usaco(string taskname){ string fin = taskname + ".in"; string fout = taskname + ".out"; const char* FIN = fin.c_str(); const char* FOUT = fout.c_str(); freopen(FIN, "r", stdin); freopen(FOUT, "w", stdout); } template<typename T> void read(vector<T>& v){ int n=v.size(); for(int i=0; i<n; i++) cin >> v[i]; } template<typename T> vector<T>UNQ(vector<T>a){ vector<T>ans; for(T t:a) if(ans.empty() || t!=ans.back()) ans.push_back(t); return ans; } ll ceil(ll a,ll b){ ll ans=a/b; if(a%b)ans++; return ans; } ld log (ld a,ld b){return log(b)/log(a);} ll power(ll base, ll exp,ll M=1e9+7){//(base^exp)%M ll ans=1; while(exp){ if(exp%2==1)ans=((ans%M)*(base%M))%M; base=((base%M)*(base%M))%M; exp/=2; } return ans; } string to_base(int n,int new_base){ string s; int nn=n; while(nn){ s+=to_string(nn%new_base); nn/=new_base; } reverse(all(s)); return s; } ll lcm(ll a,ll b){ ll x= (a/gcd(a,b)); return b*x; } vl generate_array(ll n,ll mn=1,ll mx=1e18+1){ if(mx==1e18+1) mx=n; vl ans(n); for(int i=0; i<n;i++) ans[i]=(mn+rand()%(mx-mn+1)); return ans; } string substr(string s,int l,int r){ string ans; for(int i=l; i<=r; i++) ans+=s[i]; return ans; } void solve(); int main(){ GLHF; int t=1; //cin >> t; while(t--) solve(); } void solve() { ll n,m,k; cin >> n >> m >> k; vector<string>a(n); read(a); string s; cin >> s; vector<vector<vector<bool>>>can(n,vector<vector<bool>>(m,vector<bool>(k))); for(int i=0; i<n; i++) for(int j=0; j<m; j++){ for(int dx:{-1,0,1}) for(int dy:{-1,0,1}) if((dx==0)^(dy==0) && 0<=i+dx && 0<=j+dy && i+dx<n && j+dy<m && a[i][j]=='.' && a[i+dx][j+dy]=='.'){ if(s.back()=='?')can[i][j][k-1]=1; else if(s.back()=='E' && !dx && dy==1)can[i][j][k-1]=1; else if(s.back()=='W' && !dx && dy==-1)can[i][j][k-1]=1; else if(s.back()=='S' && dx==1 && !dy)can[i][j][k-1]=1; else if(s.back()=='N' && dx==-1 && !dy)can[i][j][k-1]=1; } } for(int kk=k-2; 0<=kk; kk--) for(int i=0; i<n; i++) for(int j=0; j<m; j++){ for(int dx:{-1,0,1}) for(int dy:{-1,0,1}) if((dx==0)^(dy==0) && 0<=i+dx && 0<=j+dy && i+dx<n && j+dy<m && a[i][j]=='.' && a[i+dx][j+dy]=='.'){ if(s[kk]=='?')can[i][j][kk]=can[i][j][kk]|can[i+dx][j+dy][kk+1]; else if(s[kk]=='E' && !dx && dy==1)can[i][j][kk]=can[i][j][kk]|can[i+dx][j+dy][kk+1]; else if(s[kk]=='W' && !dx && dy==-1)can[i][j][kk]=can[i][j][kk]|can[i+dx][j+dy][kk+1]; else if(s[kk]=='S' && dx==1 && !dy)can[i][j][kk]=can[i][j][kk]|can[i+dx][j+dy][kk+1]; else if(s[kk]=='N' && dx==-1 && !dy)can[i][j][kk]=can[i][j][kk]|can[i+dx][j+dy][kk+1]; } } int ans=0; for(int i=0; i<n; i++) for(int j=0; j<m; j++) if(can[i][j][0])ans++; out(ans) } /* 5 9 7 ...##.... ..#.##..# ..#....## .##...#.. ....#.... WS?EE?? */

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

nautilus.cpp: In function 'void usaco(std::string)':
nautilus.cpp:40:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   40 |     freopen(FIN, "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~
nautilus.cpp:41:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   41 |     freopen(FOUT, "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...