#901349 (C++17) No.2411 Reverse Directions

提出ソース

結果

問題	No.2411 Reverse Directions
ユーザー	akiaa11
提出日時	2023-08-12 12:06:09
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	20 ms / 2,000 ms
コード長	5,214 bytes
コンパイル時間	4,788 ms
コンパイル使用メモリ	275,296 KB
実行使用メモリ	10,488 KB
最終ジャッジ日時	2024-11-19 13:09:37
合計ジャッジ時間	6,601 ms
ジャッジサーバーID （参考情報）	judge3 / judge5

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,816 KB
testcase_01	AC	2 ms 6,816 KB
testcase_02	AC	2 ms 6,820 KB
testcase_03	AC	2 ms 6,820 KB
testcase_04	AC	6 ms 6,820 KB
testcase_05	AC	2 ms 6,816 KB
testcase_06	AC	2 ms 6,816 KB
testcase_07	AC	7 ms 9,600 KB
testcase_08	AC	2 ms 6,816 KB
testcase_09	AC	2 ms 6,820 KB
testcase_10	AC	16 ms 10,488 KB
testcase_11	AC	2 ms 6,820 KB
testcase_12	AC	20 ms 8,192 KB
testcase_13	AC	2 ms 6,816 KB
testcase_14	AC	7 ms 6,816 KB
testcase_15	AC	3 ms 6,816 KB
testcase_16	AC	3 ms 6,820 KB
testcase_17	AC	8 ms 6,816 KB
testcase_18	AC	4 ms 6,816 KB
testcase_19	AC	2 ms 6,816 KB
testcase_20	AC	7 ms 6,820 KB
testcase_21	AC	2 ms 6,816 KB
testcase_22	AC	15 ms 6,912 KB
testcase_23	AC	2 ms 6,816 KB
testcase_24	AC	19 ms 8,064 KB
testcase_25	AC	2 ms 6,816 KB
testcase_26	AC	2 ms 6,820 KB
testcase_27	AC	2 ms 6,820 KB
testcase_28	AC	11 ms 6,816 KB
testcase_29	AC	20 ms 8,064 KB
testcase_30	AC	14 ms 6,816 KB
testcase_31	AC	2 ms 6,820 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <bits/stdc++.h>
#include <atcoder/all>
#define SELECTER(_1,_2,_3,SELECT,...) SELECT
#define rep1(i,n) for(int i=0;i<(int)n;++i)
#define rep2(i,a,n) for(int i=(int)a;i<(int)n;++i)
#define rep(...) SELECTER(__VA_ARGS__,rep2,rep1)(__VA_ARGS__)
#define RSELECTER(_1, _2, _3, RSELECT, ...) RSELECT
#define rrep1(i,n) for(int i=(int)n-1;i>=0;--i)
#define rrep2(i,a,n) for(int i=(int)n-1;i>=(int)a;--i)
#define rrep(...) RSELECTER(__VA_ARGS__, rrep2, rrep1)(__VA_ARGS__)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define fi first
#define se second
#define PrintR LogOutput
#ifdef _DEBUG
#define Log(...) LogOutput(__VA_ARGS__)
#else
#define Log(...)
#endif
using namespace std;
using namespace atcoder;
using ll=long long;
using pii=pair<int,int>;
using pll=pair<long long,long long>;
using pdd=pair<long double,long double>;
using veci=vector<int>;
using vecpii=vector<pair<int,int>>;
using vecll=vector<long long>;
using vecpll=vector<pair<long long,long long>>;
using vecpdd=vector<pair<long double,long double>>;
using vecs=vector<string>;
using vecb=vector<bool>;
using vecd=vector<double>;
using tp=tuple<int,int,int>;
using tpll=tuple<ll,ll,ll>;
using mint=modint998244353;
using mint10=modint1000000007;
template<typename T, typename S>
istream& operator>>(istream& in, pair<T, S>& a){return in >> a.first >> a.second;}
template<typename T, typename S>
ostream& operator<<(ostream& out, const pair<T, S>& a){return out << a.first << ' ' << a.second;}
ostream& operator<<(ostream& out, const mint& a){return out << a.val();}
ostream& operator<<(ostream& out, const mint10& a){return out << a.val();}
ostream& operator<<(ostream& out, const modint& a){return out << a.val();}
template<typename T>
ostream& operator<<(ostream& out, const vector<T>& d){for(int i = 0 ; i < d.size() ; ++i) out << d[i] << (i == d.size() - 1 ? "" : " "); return out;}
template<typename T, typename S>
pair<T, S> operator+(const pair<T, S>& a, const pair<T, S>& b){return {a.fi + b.fi, a.se + b.se};}
template<typename T, typename S>
pair<T, S> operator-(const pair<T, S>& a, const pair<T, S>& b){return {a.fi - b.fi, a.se - b.se};}
template<class T> inline bool chmax(T& a,T b){if(a<b) {a=b;return true;} return false;}
template<class T> inline bool chmin(T& a,T b){if(a>b) {a=b;return true;} return false;}
bool Judge(int i, int j, int h, int w){return i < 0 || j < 0 || i >= h || j >= w;}

constexpr ll INF=numeric_limits<ll>::max() / 4;
constexpr ll MOD=998244353;
const int vi[] = {0, 1, 0, -1}, vj[] = {1, 0, -1, 0};

template<typename... Args>
void LogOutput(Args&&... args){
	stringstream ss;
	((ss << args << ' '), ...);
	cout << ss.str().substr(0, ss.str().length() - 1) << endl;
}
template<typename T>
void LogOutput(vector<vector<T>>& data){for(auto d : data) LogOutput(d);}

int h, w, k, l, r;
vecs s;

void bfs(vector<veci>& dist, vector<vecpii>& prev, pii srt){
	queue<pii> q;
	q.push(srt);
	dist[srt.fi][srt.se] = 0;
	while(q.size()){
		auto [i, j] = q.front(); q.pop();
		rep(k, 4){
			int ni = i + vi[k];
			int nj = j + vj[k];
			if(Judge(ni, nj, h, w) || s[ni][nj] == '#' || dist[ni][nj] != -1) continue;
			dist[ni][nj] = dist[i][j] + 1;
			prev[ni][nj] = {i, j};
			q.emplace(ni, nj);
		}
	}
}

int main(){
	ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	cin>>h>>w>>k>>l>>r;
	s.resize(h);
	rep(i, h) cin>>s[i];
	if((h + w) % 2 != k % 2 || (r - l) % 2 == 0){
		cout<<"No"<<endl;
		return 0;
	}
	vector dist(h, veci(w, -1)), dist2(h, veci(w, -1));
	vector prev(h, vecpii(w)), prev2(h, vecpii(w));
	bfs(dist, prev, {0, 0});
	bfs(dist2, prev2, {h - 1, w - 1});
	if(dist[h - 1][w - 1] == -1){
		cout<<"No"<<endl;
		return 0;
	}
	int _min = 1e9;
	pii v;
	int dir;
	rep(i, h) rep(j, w) if(dist[i][j] != -1 && dist2[i][j] != -1 &&
		dist[i][j] % 2 != l % 2 && dist[i][j] < l && _min > dist2[i][j]){
		bool b = false;
		rep(p, 2){
			int ni = i + vi[p];
			int nj = j + vj[p];
			int ni2 = i + vi[p + 2];
			int nj2 = j + vj[p + 2];
			if(Judge(ni, nj, h, w) | Judge(ni2, nj2, h, w) || s[ni][nj] == '#' || s[ni2][nj2] == '#') continue;
			b = true;
			dir = p;
			break;
		}
		if(b){
			v = {i, j};
			_min = dist2[i][j];
		}
	}
	if(_min == 1e9){
		cout<<"No"<<endl;
		return 0;
	}
	string ans;
	for(pii now = v; now != pii{0, 0}; now = prev[now.fi][now.se]){
		auto [i, j] = prev[now.fi][now.se];
		if(now.fi > i) ans.push_back('D');
		if(now.fi < i) ans.push_back('U');
		if(now.se > j) ans.push_back('R');
		if(now.se < j) ans.push_back('L');
	}
	reverse(all(ans));
	int sz = ans.size();
	rep(i, k + 1){
		if(ans.size() == r) break;
		if(dir) ans.push_back("UD"[i % 2]);
		else ans.push_back("LR"[i % 2]);
	}
	for(pii now = v; now != pii{h - 1, w - 1}; now = prev2[now.fi][now.se]){
		auto [i, j] = prev2[now.fi][now.se];
		if(now.fi < i) ans.push_back('D');
		if(now.fi > i) ans.push_back('U');
		if(now.se < j) ans.push_back('R');
		if(now.se > j) ans.push_back('L');
	}
	if(ans.size() > k){
		Log(ans.size());
		cout<<"No"<<endl;
		return 0;
	}
	pii v2 = prev[h - 1][w - 1];
	if(v2.fi == h - 1) dir = 0;
	else dir = 1;
	rep(i, k){
		if(ans.size() == k) break;
		if(dir) ans.push_back("UD"[i % 2]);
		else ans.push_back("LR"[i % 2]);
	}
	cout<<"Yes"<<endl;
	cout<<ans<<endl;
}

yukicoder

結果

テストケース

ソースコード