Submission #1137869

#	Time	Username	Problem	Language	Result	Execution time	Memory
1137869		thelegendary08	포탈들 (BOI14_portals)	C++17	0 / 100	0 ms	328 KiB

portals

#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define int long long
#define vi vector<int>
#define vvi vector<vector<int>>
#define pii pair<int, int>
#define vpii vector<pair<int, int>>
#define vc vector<char>
#define vb vector<bool>
#define mii map<int,int>
#define f0r(i,n) for(int i=0;i<n;i++)
#define FOR(i,k,n) for(int i=k;i<n;i++)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define in(a) int a; cin>>a
#define in2(a,b) int a,b; cin>>a>>b
#define in3(a,b,c) int a,b,c; cin>>a>>b>>c
#define in4(a,b,c,d) int a,b,c,d; cin>>a>>b>>c>>d
#define vin(v,n); vi v(n); f0r(i,n){cin>>v[i];}
#define out(a) cout<<a<<'\n'
#define out2(a,b) cout<<a<<' '<<b<<'\n'
#define out3(a,b,c) cout<<a<<' '<<b<<' '<<c<<'\n'
#define out4(a,b,c,d) cout<<a<<' '<<b<<' '<<c<<' '<<d<<'\n'
#define vout(v) for(auto u : v){cout<<u<<' ';} cout<<'\n'
#define dout(a) cout<<a<<' '<<#a<<'\n'
#define dout2(a,b) cout<<a<<' '<<#a<<' '<<b<<' '<<#b<<'\n'
#define yn(x); if(x){cout<<"YES"<<'\n';}else{cout<<"NO"<<'\n';}
const int leg = 1e9 + 7;
const int mod = 998244353;
using namespace std;
int n,m;
int conv(pii p){
	return p.first*m+p.second;
}
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	//ifstream cin(".in");
	//ofstream cout(".out");
	cin>>n>>m;
	char grid[n][m];
	f0r(i,n)f0r(j,m)cin>>grid[i][j];
	pii st;
	pii en;
	f0r(i,n){
		f0r(j,m){
			if(grid[i][j] == 'S')st = mp(i,j);
			if(grid[i][j] == 'C')en = mp(i,j);
		}
	}
	vvi adj(n*m);
	f0r(i,n){
		f0r(j,m){
			pii cur = mp(i,j);
			if(i != 0 && grid[i-1][j] != '#'){
				adj[conv(cur)].pb(conv(mp(i-1,j)));
			}
			if(i != n-1 && grid[i+1][j] != '#'){
				adj[conv(cur)].pb(conv(mp(i+1,j)));
			}
			if(j != 0 && grid[i][j-1] != '#'){
				adj[conv(cur)].pb(conv(mp(i,j-1)));
			}
			if(j != m-1 && grid[i][j+1] != '#'){
				adj[conv(cur)].pb(conv(mp(i,j+1)));
			}
		}
	}
	vvi adj2(n*m);
	f0r(i,n){
		int prevleft = -1;
		f0r(j,m){
			if(j == 0 || grid[i][j-1] == '#'){
				if(grid[i][j] != '#')prevleft = j;
			}
			else{
				if(grid[i][j] != '#')adj2[conv(mp(i,j))].pb(conv(mp(i,prevleft)));
			}
		}
	}
	
	f0r(i,n){
		int prevleft = -1;
		for(int j = m-1; j>=0; j--){
			if(j == m-1 || grid[i][j+1] == '#'){
				if(grid[i][j] != '#')prevleft = j;
			}
			else{
				if(grid[i][j] != '#')adj2[conv(mp(i,j))].pb(conv(mp(i,prevleft)));
			}
		}
	}
	f0r(i,m){
		int prevleft = -1;
		f0r(j,n){
			if(j == 0 || grid[j-1][i] == '#'){
				if(grid[i][j] != '#')prevleft = j;
			}
			else{
				if(grid[i][j] != '#'){
					adj2[conv(mp(j,i))].pb(conv(mp(prevleft,i)));
				}
			}
		}
	}
	f0r(i,m){
		int prevleft = -1;
		for(int j = n-1; j>=0; j--){
			if(j == n-1 || grid[j+1][i] == '#'){
				if(grid[i][j] != '#')prevleft = j;
			}
			else{
				if(grid[i][j] != '#'){
					adj2[conv(mp(j,i))].pb(conv(mp(prevleft,i)));
				}
			}
		}
	}
	/*
	f0r(i,n*m){
		dout(i);
		vout(adj[i]);
	}
	*/
	queue<int>q;
	q.push(conv(st));
	vi dist(n * m, 4e18);
	dist[conv(st)] = 0;
	while(!q.empty()){
		int node = q.front();
		q.pop();
		for(auto u : adj[node]){
			if(dist[u] == 4e18){
				dist[u] = dist[node] + 1;
				q.push(u);
			}
		}
		if(adj[node].size() != 4){
			for(auto u : adj2[node]){
				if(dist[u] == 4e18){
					dist[u] = dist[node] + 1;
					q.push(u);
				}
			}
		}
	}
	out(dist[conv(en)]);
	
}

• Subtask 1: 0 / 11
• Subtask 2: 0 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 19
• Subtask 5: 0 / 30