Submission #409701

#	Time	Username	Problem	Language	Result	Execution time	Memory
409701		dreezy	Nowruz (IOI17_nowruz)	Text	0 / 100	0 ms	0 KiB

nowruz1.out

#include <bits/stdc++.h>
using namespace std;
#define x first
#define y second
#define pi pair<int,int>
#define pb push_back
const int maxn = 1e3 + 100;

char grid[maxn][maxn];
bool vis[maxn][maxn];
pi dirs[] ={{0,-1}, {0,1}, {-1,0},{1,0} };
int height, width;



void dfs(pi node, pi parent){
	vis[node.y][node.x] = true;
	
	vector<pi> goodadj;
	for(pi dir : dirs){
		pi adj = {node.x + dir.x, node.y + dir.y};
		
		if(adj == parent) continue;
		
		if (adj.x < 0 || adj.x >= width || adj.y <0 || adj.y >=height) continue;
		
		if(grid[adj.y][adj.x] !='.') continue;
		
		if(vis[adj.y][adj.x]){
			grid[node.y][node.x] = 'X';
			vis[node.y][node.x] = false;
			goodadj.clear(); 
			break;
		}
		else{
			goodadj.pb(adj);
		}
	}
	
	for( pi adj : goodadj){
		dfs(adj, node);
	}
}



int main(){
	cin >> height >> width;
	
	int kids; cin >> kids;
	
	for(int y = 0; y<height; y++){
		string line; cin >> line;
		
		for(int x =0; x<width; x++){
			grid[y][x] = line.at(x);
		}
	}
	
	
	for(int y = 0; y<height; y++){
		bool df = false;
		for(int x =0; x<width; x++){
			if(grid[y][x] =='.' ){
				dfs({x,y}, {-1,-1});
				df = true;
				break;
			}
		}
		if(df) break;
	}
	
	
	for(int y = 0; y<height; y++){
		for(int x =0; x<width; x++){
			if(grid[y][x] =='.' && !vis[y][x]){
				grid[y][x] = 'X';
			}
			cout << grid[y][x];
		}
		cout << endl;
	}
	/*
	cout << endl<<endl;
	
	for(int y = 0; y<height; y++){
		for(int x =0; x<width; x++){
			cout << vis[y][x];
		}
		cout << endl;
	}*/
}

nowruz2.out

nowruz3.out

nowruz4.out

nowruz5.out

nowruz6.out

nowruz7.out

nowruz8.out

nowruz9.out

nowruz10.out

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10