結果

問題 No.455 冬の大三角
ユーザー FF256grhyFF256grhy
提出日時 2016-12-06 00:11:04
言語 C++11
(gcc 13.3.0)
結果
AC  
実行時間 1 ms / 2,000 ms
コード長 1,738 bytes
コンパイル時間 184 ms
コンパイル使用メモリ 30,720 KB
実行使用メモリ 5,376 KB
最終ジャッジ日時 2024-06-29 21:01:51
合計ジャッジ時間 2,046 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 54
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function ‘int main()’:
main.cpp:34:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   34 |         scanf("%d%d", &h, &w);
      |         ~~~~~^~~~~~~~~~~~~~~~
main.cpp:35:26: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   35 |         inc(i, h) { scanf("%s", s[i]); }
      |                     ~~~~~^~~~~~~~~~~~
main.cpp:45:24: warning: ‘ii’ may be used uninitialized [-Wmaybe-uninitialized]
   45 |         bool fi = (ii[0] == ii[1]), fj = (jj[0] == jj[1]);
      |                    ~~~~^
main.cpp:37:20: note: ‘ii’ declared here
   37 |         int c = 0, ii[2], jj[2];
      |                    ^~
main.cpp:45:33: warning: ‘ii’ may be used uninitialized [-Wmaybe-uninitialized]
   45 |         bool fi = (ii[0] == ii[1]), fj = (jj[0] == jj[1]);
      |                             ~~~~^
main.cpp:37:20: note: ‘ii’ declared here
   37 |         int c = 0, ii[2], jj[2];
      |                    ^~
main.cpp:45:47: warning: ‘jj’ may be used uninitialized [-Wmaybe-uninitialized]
   45 |         bool fi = (ii[0] == ii[1]), fj = (jj[0] == jj[1]);
      |                                           ~~~~^
main.cpp:37:27: note: ‘jj’ declared here
   37 |         int c = 0, ii[2], jj[2];
      |                           ^~
main.cpp:45:56: warning: ‘jj’ may be used uninitialized [-Wmaybe-uninitialized]
   45 |         bool fi = (ii[0] == ii[1]), fj = (jj[0] == jj[1]);
      |                                                    ~~~~^
main.cpp:37:27: note: ‘jj’ declared here
   37 |         int c = 0, ii[2], jj[2];
      |                           ^~
main.cpp:50:21: warning: ‘jjj’ may be used uninitialized in this function [-Wmaybe-uninitialized]
   50 |         s[iii][jjj] = '*';
      |         ~~~~~~~~~~~~^~~~~
main.cpp:50:21: warning: ‘iii’ ma

ソースコード

diff # 

#include <cstdio>
#include <cmath>

typedef long long   signed int LL;
typedef long long unsigned int LU;

#define incID(i, l, r) for(int i = (l)    ; i <  (r); i++)
#define incII(i, l, r) for(int i = (l)    ; i <= (r); i++)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--)
#define decII(i, l, r) for(int i = (r)    ; i >= (l); i--)
#define inc( i, n) incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define dec( i, n) decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)

#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define inID(v, l, r) ((l) <= (v) && (v) <  (r))

template<typename T> void swap(T & x, T & y) { T t = x; x = y; y = t; return; }
template<typename T> T abs(T x) { return (0 <= x ? x : -x); }
template<typename T> T max(T a, T b) { return (b <= a ? a : b); }
template<typename T> T min(T a, T b) { return (a <= b ? a : b); }
template<typename T> bool setmin(T & a, T b) { if(a <= b) { return false; } else { a = b; return true; } }
template<typename T> bool setmax(T & a, T b) { if(b <= a) { return false; } else { a = b; return true; } }
template<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }

// ---- ----

int h, w;
char s[100][101];

int main() {
	scanf("%d%d", &h, &w);
	inc(i, h) { scanf("%s", s[i]); }
	
	int c = 0, ii[2], jj[2];
	inc(i, h) {
	inc(j, w) {
		if(s[i][j] == '*') { ii[c] = i; jj[c] = j; c++; }
	}
	}
	
	int iii, jjj;
	bool fi = (ii[0] == ii[1]), fj = (jj[0] == jj[1]);
	if(! fi && ! fj) { iii = ii[0]; jjj = jj[1]; }
	else if(fi) { iii = (ii[0] + 1) % h; jjj = jj[0]; }
	else if(fj) { jjj = (jj[0] + 1) % w; iii = ii[0]; }
	
	s[iii][jjj] = '*';
	
	inc(i, h) { printf("%s\n", s[i]); }
	
	return 0;
}
0