結果

問題 No.455 冬の大三角
ユーザー aaa
提出日時 2018-09-18 10:51:19
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 4,053 bytes
コンパイル時間 1,112 ms
コンパイル使用メモリ 108,012 KB
実行使用メモリ 5,376 KB
最終ジャッジ日時 2024-07-18 07:54:44
合計ジャッジ時間 3,487 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 50 WA * 4
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function 'int main()':
main.cpp:60:9: warning: 'x1' may be used uninitialized [-Wmaybe-uninitialized]
   60 |         if (x1 == x2) {
      |         ^~
main.cpp:31:13: note: 'x1' was declared here
   31 |         int x1, y1, x2, y2;
      |             ^~
main.cpp:60:9: warning: 'x2' may be used uninitialized [-Wmaybe-uninitialized]
   60 |         if (x1 == x2) {
      |         ^~
main.cpp:31:21: note: 'x2' was declared here
   31 |         int x1, y1, x2, y2;
      |                     ^~
main.cpp:70:14: warning: 'y1' may be used uninitialized [-Wmaybe-uninitialized]
   70 |         else if (y1 == y2) {
      |              ^~
main.cpp:31:17: note: 'y1' was declared here
   31 |         int x1, y1, x2, y2;
      |                 ^~
main.cpp:70:14: warning: 'y2' may be used uninitialized [-Wmaybe-uninitialized]
   70 |         else if (y1 == y2) {
      |              ^~
main.cpp:31:25: note: 'y2' was declared here
   31 |         int x1, y1, x2, y2;
      |                         ^~
main.cpp:239:31: warning: 'y3' may be used uninitialized [-Wmaybe-uninitialized]
  239 |                         if (i == y3 && j == x3) {
      |                             ~~^~~~~
main.cpp:219:17: note: 'y3' was declared here
  219 |         int x3, y3;
      |                 ^~
main.cpp:239:42: warning: 'x3' may be used uninitialized [-Wmaybe-uninitialized]
  239 |                         if (i == y3 && j == x3) {
      |                                        ~~^~~~~
main.cpp:219:13: note: 'x3' was declared here
  219 |         int x3, y3;
      |             ^~

ソースコード

diff # 

#include <stdio.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#include <functional>
#include <map>
#include <iomanip>
#include <math.h> 
#include <stack>
#include <queue>
#include <bitset>
#include <cstdlib>
#include <tuple>
#include <cctype>
#include <ctype.h>
#include <set>
#include <sstream>

using namespace std;

int main() {
	int i, j;
	int h, w;
	vector<string>s;
	double dx, dy;
	vector<vector<bool>>mat(105, vector<bool>(105, false));

	cin >> h >> w;

	int x1, y1, x2, y2;

	for (i = 0; i < h; i++) {
		string str;
		cin >> str;
		s.push_back(str);
	}


	bool flag = false;

	for (i = 0; i < h; i++) {
		for (j = 0; j < w; j++) {
			if (s[i][j] == '*') {
				if (flag == false) {
					x1 = j;
					y1 = i;
					flag = true;
				}
				else {
					x2 = j;
					y2 = i;
					break;
				}
			}
		}
	}


	if (x1 == x2) {
		for (i = 0; i < h; i++) {
			for (j = 0; j < w; j++) {
				if (j == x1) {
					mat[i][j] = true;
				}
			}
		}

	}
	else if (y1 == y2) {
		for (i = 0; i < h; i++) {
			for (j = 0; j < w; j++) {
				if (i == y1) {
					mat[i][j] = true;
				}
			}
		}

	}
	else if (x2 > x1) {
		dx = (double)(x2 - x1) / (double)abs(y2 - y1);

		if (y2 > y1) {

			double xx = x2;
			for (i = y2 - 1; i >= 0; i--) {
				xx += dx;
				int dox = floor(xx);
				int upx = ceil(xx);

				if (upx >= w) break;
				mat[i][dox] = true;
				mat[i][upx] = true;
			}

			for (i = y2 + 1; i < y1; i++) {
				xx -= dx;
				int dox = floor(xx);
				int upx = ceil(xx);

				if (dox < 0) break;
				mat[i][dox] = true;
				mat[i][upx] = true;
			}

			for (i = y1 + 1; i < h; i++) {
				xx -= dx;
				int dox = floor(xx);
				int upx = ceil(xx);

				if (dox < 0) break;
				mat[i][dox] = true;
				mat[i][upx] = true;
			}
		}
		else if (y2 < y1) { //右下がり直線
			double xx = x2;
			for (i = y1 - 1; i >= 0; i--) {
				xx -= dx;
				int dox = floor(xx);
				int upx = ceil(xx);

				if (dox < 0) break;
				mat[i][dox] = true;
				mat[i][upx] = true;
			}

			for (i = y1 + 1; i < y2; i++) {
				xx += dx;
				int dox = floor(xx);
				int upx = ceil(xx);

				if (upx >= w) break;
				mat[i][dox] = true;
				mat[i][upx] = true;
			}

			for (i = y2 + 1; i < h; i++) {
				xx += dx;
				int dox = floor(xx);
				int upx = ceil(xx);

				if (upx >= w) break;
				mat[i][dox] = true;
				mat[i][upx] = true;
			}
		}
	}
	else if (x2 < x1) {
		dx = (double)(x1 - x2) / (double)abs(y1 - y2);

		if (y2 > y1) {

			double xx = x2;
			for (i = y2 - 1; i >= 0; i--) {
				xx -= dx;
				int dox = floor(xx);
				int upx = ceil(xx);

				if (dox < 0) break;
				mat[i][dox] = true;
				mat[i][upx] = true;
			}

			for (i = y2 + 1; i < y1; i++) {
				xx += dx;
				int dox = floor(xx);
				int upx = ceil(xx);

				if (upx >= w) break;
				mat[i][dox] = true;
				mat[i][upx] = true;
			}

			for (i = y1 + 1; i < h; i++) {
				xx += dx;
				int dox = floor(xx);
				int upx = ceil(xx);

				if (upx >= w) break;
				mat[i][dox] = true;
				mat[i][upx] = true;
			}
		}
		else if (y2 < y1) { //右上がり直線
			double xx = x2;
			for (i = y1 - 1; i >= 0; i--) {
				xx += dx;
				int dox = floor(xx);
				int upx = ceil(xx);

				if (upx >= w) break;
				mat[i][dox] = true;
				mat[i][upx] = true;
			}

			for (i = y1 + 1; i < y2; i++) {
				xx -= dx;
				int dox = floor(xx);
				int upx = ceil(xx);

				if (dox < 0) break;
				mat[i][dox] = true;
				mat[i][upx] = true;
			}

			for (i = y2 + 1; i < h; i++) {
				xx -= dx;
				int dox = floor(xx);
				int upx = ceil(xx);

				if (dox < 0) break;
				mat[i][dox] = true;
				mat[i][upx] = true;
			}
		}
	}

	int x3, y3;

	bool flag2 = false;

	for (i = 0; i < h; i++) {
		for (j = 0; j < w; j++) {
			if (mat[i][j] == false) {
				x3 = j;
				y3 = i;
				flag2 = true;
				break;
			}
		}
		if (flag2 == true) break;
	}

	cout << endl;

	for (i = 0; i < h; i++) {
		for (j = 0; j < w; j++) {
			if (i == y3 && j == x3) {
				cout << "*";
				continue;
			}
			else {
				cout << s[i][j];
			}
		}
		cout << endl;
	}




	getchar();
	getchar();
	return 0;
}
0