codeforces round #234B(DIV2) B Inna and New Matrix of Candies
#include <iostream> #include <vector> #include <string> #include <algorithm> #include <set> using namespace std; int main(){ int n,m; cin >> n >> m; set<int> distance; bool flag = true; for(int i = 0 ; i < n; ++ i){ string rectangle; cin >> rectangle; int dwarf_pos = rectangle.find('G'); int candy_pos = rectangle.find('S'); int dist = candy_pos - dwarf_pos; if(dist > 0) distance.insert(dist); else flag = false; } if(!flag) cout<<-1<<endl; else cout<<distance.size()<<endl; return 0; }
【推荐】国内首个AI IDE,深度理解中文开发场景,立即下载体验Trae
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步