【AIM Tech Round 5 (rated, Div. 1 + Div. 2) A】 Find Square
2018-08-28 08:13
495 查看
【链接】 我是链接,点我呀:)
【题意】
在这里输入题意
【题解】
找到左上角。往下一直走,往右一直走走到B边界就好。
中点的话。直接输出中位数
【代码】
#include <bits/stdc++.h> #define LL long long #define rep1(i,a,b) for (int i = a;i <= b;i++) #define rep2(i,a,b) for (int i = a;i >= b;i--) #define all(x) x.begin(),x.end() #define pb push_back #define lson l,mid,rt<<1 #define ri(x) scanf("%d",&x) #define rl(x) scanf("%lld",&x) #define rs(x) scanf("%s",x) #define rson mid+1,r,rt<<1|1 using namespace std; const double pi = acos(-1); const int dx[4] = {0,0,1,-1}; const int dy[4] = {1,-1,0,0}; const int N = 200; char s[N+10][N+10]; int n,m; int main(){ #ifdef LOCAL_DEFINE freopen("rush_in.txt", "r", stdin); #endif ri(n);ri(m); rep1(i,1,n) rs(s[i]+1); rep1(i,1,n){ rep1(j,1,m) if (s[i][j]=='B'){ int ti = i,tj = j; while (ti+1<=n && s[ti+1][j]=='B') ti++; while (tj+1<=m && s[i][tj+1]=='B') tj++; cout<<(i+ti)/2<<' '<<(j+tj)/2<<endl; return 0; } } return 0; }
相关文章推荐
- 【AIM Tech Round 5 (rated, Div. 1 + Div. 2) B】Unnatural Conditions
- 【AIM Tech Round 5 (rated, Div. 1 + Div. 2) 总结】【题解往前或往后翻,不在这】
- Codeforces AIM Tech Round 3 (Div. 2)(A-D 未完)
- AIM Tech Round 4 (Div. 2) D. Interactive LowerBound
- 【AIM Tech Round 4 (Div. 2) D Prob】
- AIM Tech Round (Div. 2) B. Making a String 贪心
- Codeforces AIM Tech Round (Div. 1) ABD
- Codeforces AIM Tech Round (Div. 2) 624B Making a String
- codeforces AIM Tech Round 3 (Div. 2) B. Checkpoints
- AIM Tech Round 3 (Div. 2) B. Checkpoints
- AIM Tech Round (Div. 2) C. Graph and String
- AIM Tech Round 4 (Div. 2)(A,暴力,B,组合数,C,STL+排序)
- AIM Tech Round 4 (Div. 2) B
- AIM Tech Round 3 (Div. 2) E. Centroids (树形dp) ★ ★ ★
- AIM Tech Round (Div. 2)C - Graph and String(二分图染色)
- Codeforces AIM Tech Round (Div. 2) 624A A. Save Luke
- CF AIM Tech Round 3 (Div. 2) D - Recover the String
- AIM Tech Round 3 (Div. 2)
- AIM Tech Round 4 (Div. 2) C
- AIM Tech Round (Div. 2)