Submission #66207090

---

Source Code Expand

#include<iostream>
#include<vector>
#include<queue>
using namespace std;

const int di[] = {1,0,-1,0};
const int dj[] = {0,-1,0,1};

int main(){
	int H,W;cin>>H>>W;
	vector<string>A(H);
	for(int i=0;i<H;++i)cin>>A[i];
	int si=0,sj=0;
	int gi=0,gj=0;
	using P = pair<int,int>;
	vector<P>o;
	for(int i=0;i<H;++i){
		for(int j=0;j<W;++j){
			if(A[i][j]=='S')si=i,sj=j;
			if(A[i][j]=='G')gi=i,gj=j;
			if(A[i][j]=='o')o.emplace_back(i,j);
		}
	}

	int M = o.size();
	int INF = 1<<25;
	vector<vector<P>> dist(M+2);
	for(int i=0;i<M;++i){
		for(int j=0;j<M;++j){
			if(i==j)continue;
			int ci = o[i].first;
			int cj = o[i].second;
			auto [ti,tj] = o[j];
			int d[1<<9][1<<9] = {INF};
			d[ci][cj] = 0;
			queue<P> q;
			q.emplace(ci,cj);
			while(q.size()){
				auto [pi,pj] = q.front();
				q.pop();
				for(int v=0;v<4;++v){
					int ni = pi+di[v];
					int nj = pj+dj[v];
					if(ni<0 || nj<0 || H<=ni || W<=nj)continue;
					if(A[ni][nj]=='#')continue;
					if(d[ni][nj] != INF)continue;
					d[ni][nj] = d[pi][pj] + 1;
					q.emplace(ni,nj);
					if(ni==ti&&nj==tj){
						dist[i].emplace_back(j,d[ni][nj]);
						dist[j].emplace_back(i,d[ni][nj]);
					}
					if(ni==si&&nj==sj){
						dist[i].emplace_back(M,0);
						dist[M].emplace_back(i,0);
					}
					if(ni==gi&&nj==gj){
						dist[i].emplace_back(M+1,0);
						dist[M+1].emplace_back(i,0);
					}
				}
			}
		}
	}

	auto dfs = [&] (long long now) {
		// あとからやる
	};
	
}

Submission Info

Compile Error

Main.cpp: In lambda function:
Main.cpp:66:35: warning: unused parameter ‘now’ [-Wunused-parameter]
   66 |         auto dfs = [&] (long long now) {
      |                         ~~~~~~~~~~^~~
Main.cpp: In function ‘int main()’:
Main.cpp:66:14: warning: variable ‘dfs’ set but not used [-Wunused-but-set-variable]
   66 |         auto dfs = [&] (long long now) {
      |              ^~~

Judge Result