提出 #70777184
ソースコード 拡げる
#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------
int T,H,W;
string S[202020];
vector<int> dp[4][202020];
void solve() {
int i,j,k,l,r,x,y; string s;
cin>>T;
while(T--) {
cin>>H>>W;
FOR(y,H) {
cin>>S[y];
FOR(i,4) {
dp[i][y].clear();
dp[i][y].resize(W,1<<30);
}
}
deque<int> Q;
dp[0][0][0]=0;
Q.push_back(0);
int ret=1<<30;
while(Q.size()) {
int dir=Q.front()/(H*W);
int cy=Q.front()%(H*W)/W;
int cx=Q.front()%W;
Q.pop_front();
int dy[]={0,0,1,-1};
int dx[]={1,-1,0,0};
int dir2;
FOR(dir2,4) if((dir^1)!=dir2) {
int ty=cy+dy[dir2];
int tx=cx+dx[dir2];
int co=dp[dir][cy][cx]+1;
if(S[cy][cx]=='A') {
if(dir==dir2) co--;
}
if(S[cy][cx]=='B') {
if(dir==0&&dir2==2) co--;
if(dir==1&&dir2==3) co--;
if(dir==2&&dir2==0) co--;
if(dir==3&&dir2==1) co--;
}
if(S[cy][cx]=='C') {
if(dir==0&&dir2==3) co--;
if(dir==1&&dir2==2) co--;
if(dir==2&&dir2==1) co--;
if(dir==3&&dir2==0) co--;
}
if(ty==H-1&&tx==W) ret=min(ret,co);
if(ty<0||ty>=H||tx<0||tx>=W) continue;
if(chmin(dp[dir2][ty][tx],co)) {
if(co==dp[dir][cy][cx]) Q.push_front(dir2*H*W+ty*W+tx);
else Q.push_back(dir2*H*W+ty*W+tx);
}
}
}
cout<<ret<<endl;
}
}
int main(int argc,char** argv){
string s;int i;
if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
cout.tie(0); solve(); return 0;
}
提出情報
| 提出日時 |
|
| 問題 |
E - Reflection on Grid |
| ユーザ |
kmjp |
| 言語 |
C++23 (GCC 15.2.0) |
| 得点 |
500 |
| コード長 |
2147 Byte |
| 結果 |
AC |
| 実行時間 |
56 ms |
| メモリ |
53804 KiB |
コンパイルエラー
./Main.cpp: In function 'void solve()':
./Main.cpp:22:15: warning: unused variable 'j' [-Wunused-variable]
22 | int i,j,k,l,r,x,y; string s;
| ^
./Main.cpp:22:17: warning: unused variable 'k' [-Wunused-variable]
22 | int i,j,k,l,r,x,y; string s;
| ^
./Main.cpp:22:19: warning: unused variable 'l' [-Wunused-variable]
22 | int i,j,k,l,r,x,y; string s;
| ^
./Main.cpp:22:21: warning: unused variable 'r' [-Wunused-variable]
22 | int i,j,k,l,r,x,y; string s;
| ^
./Main.cpp:22:23: warning: unused variable 'x' [-Wunused-variable]
22 | int i,j,k,l,r,x,y; string s;
| ^
./Main.cpp: In function 'int main(int, char**)':
./Main.cpp:6:19: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
6 | #define FOR(x,to) for(x=0;x<(to);x++)
| ^~~
./Main.cpp:88:9: note: in expansion of macro 'FOR'
88 | FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
| ^~~
./Main.cpp:6:19: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
6 | #define FOR(x,to) for(x=0;x<(to);x++)
| ^~~
./Main.cpp:88:45: note: in expansion of macro 'FOR'
88 | FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
| ^~~
./Main.cpp:6:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
6 | #define FOR(x,to) for(x=0;x<(to);x++)
| ^
./Main.cpp:88:45: note: in expansion of macro 'FOR'
88 | FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
| ^~~
ジャッジ結果
| セット名 |
Sample |
All |
| 得点 / 配点 |
0 / 0 |
500 / 500 |
| 結果 |
|
|
| セット名 |
テストケース |
| Sample |
00_sample_00.txt |
| All |
00_sample_00.txt, 01_test_00.txt, 01_test_01.txt, 01_test_02.txt, 01_test_03.txt, 01_test_04.txt, 01_test_05.txt, 01_test_06.txt, 01_test_07.txt, 01_test_08.txt, 01_test_09.txt, 01_test_10.txt, 01_test_11.txt, 01_test_12.txt, 01_test_13.txt, 01_test_14.txt, 01_test_15.txt, 01_test_16.txt, 01_test_17.txt, 01_test_18.txt, 01_test_19.txt, 01_test_20.txt, 01_test_21.txt, 01_test_22.txt, 01_test_23.txt, 01_test_24.txt, 01_test_25.txt, 01_test_26.txt, 01_test_27.txt, 01_test_28.txt, 01_test_29.txt, 01_test_30.txt, 01_test_31.txt, 01_test_32.txt, 01_test_33.txt, 01_test_34.txt |
| ケース名 |
結果 |
実行時間 |
メモリ |
| 00_sample_00.txt |
AC |
6 ms |
9880 KiB |
| 01_test_00.txt |
AC |
56 ms |
9996 KiB |
| 01_test_01.txt |
AC |
44 ms |
10032 KiB |
| 01_test_02.txt |
AC |
42 ms |
10032 KiB |
| 01_test_03.txt |
AC |
42 ms |
9964 KiB |
| 01_test_04.txt |
AC |
42 ms |
10032 KiB |
| 01_test_05.txt |
AC |
43 ms |
10032 KiB |
| 01_test_06.txt |
AC |
42 ms |
10160 KiB |
| 01_test_07.txt |
AC |
43 ms |
10256 KiB |
| 01_test_08.txt |
AC |
13 ms |
13012 KiB |
| 01_test_09.txt |
AC |
50 ms |
53644 KiB |
| 01_test_10.txt |
AC |
29 ms |
13048 KiB |
| 01_test_11.txt |
AC |
46 ms |
31768 KiB |
| 01_test_12.txt |
AC |
36 ms |
13120 KiB |
| 01_test_13.txt |
AC |
46 ms |
24588 KiB |
| 01_test_14.txt |
AC |
43 ms |
12884 KiB |
| 01_test_15.txt |
AC |
45 ms |
15664 KiB |
| 01_test_16.txt |
AC |
45 ms |
13456 KiB |
| 01_test_17.txt |
AC |
45 ms |
13880 KiB |
| 01_test_18.txt |
AC |
46 ms |
14644 KiB |
| 01_test_19.txt |
AC |
46 ms |
14380 KiB |
| 01_test_20.txt |
AC |
10 ms |
13204 KiB |
| 01_test_21.txt |
AC |
10 ms |
13120 KiB |
| 01_test_22.txt |
AC |
48 ms |
53736 KiB |
| 01_test_23.txt |
AC |
46 ms |
53804 KiB |
| 01_test_24.txt |
AC |
17 ms |
13012 KiB |
| 01_test_25.txt |
AC |
32 ms |
31736 KiB |
| 01_test_26.txt |
AC |
19 ms |
12880 KiB |
| 01_test_27.txt |
AC |
21 ms |
15512 KiB |
| 01_test_28.txt |
AC |
22 ms |
14992 KiB |
| 01_test_29.txt |
AC |
20 ms |
13464 KiB |
| 01_test_30.txt |
AC |
22 ms |
13484 KiB |
| 01_test_31.txt |
AC |
17 ms |
13836 KiB |
| 01_test_32.txt |
AC |
17 ms |
13884 KiB |
| 01_test_33.txt |
AC |
22 ms |
14988 KiB |
| 01_test_34.txt |
AC |
21 ms |
14992 KiB |