Submission #12894322


Source Code Expand

Copy
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
//#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
//---------------------------------------------------------------------------------------------------
/*---------------------------------------------------------------------------------------------------
            ∧_∧
      ∧_∧  (´<_` )  Welcome to My Coding Space!
     ( ´_ゝ`) /  ⌒i     @hamayanhamayan0
    /   \     | |
    /   / ̄ ̄ ̄ ̄/  |
  __(__ニつ/     _/ .| .|____
     \/____/ (u ⊃
---------------------------------------------------------------------------------------------------*/














int N;
string S[50];
//---------------------------------------------------------------------------------------------------
void _main() {
	cin >> N;
	rep(i, 0, N) cin >> S[i];

	rrep(y, N - 2, 0) {
		rep(x, 1, 2 * N - 2) if(S[y][x] == '#') {
			bool ok = false;

			if (S[y + 1][x - 1] == 'X') ok = true;
			if (S[y + 1][x] == 'X') ok = true;
			if (S[y + 1][x + 1] == 'X') ok = true;

			if (ok) S[y][x] = 'X';
		}
	}

	rep(y, 0, N) cout << S[y] << endl;
}





Submission Info

Submission Time
Task C - Landslide
User hamayanhamayan
Language C++ (GCC 9.2.1)
Score 8
Code Size 1766 Byte
Status AC
Exec Time 5 ms
Memory 3612 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 8 / 8
Status
AC × 3
AC × 26
Set Name Test Cases
Sample s1.txt, s2.txt, s3.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, s1.txt, s2.txt, s3.txt
Case Name Status Exec Time Memory
01.txt AC 5 ms 3560 KB
02.txt AC 2 ms 3532 KB
03.txt AC 2 ms 3536 KB
04.txt AC 2 ms 3528 KB
05.txt AC 2 ms 3604 KB
06.txt AC 2 ms 3536 KB
07.txt AC 2 ms 3484 KB
08.txt AC 2 ms 3576 KB
09.txt AC 2 ms 3428 KB
10.txt AC 2 ms 3484 KB
11.txt AC 2 ms 3496 KB
12.txt AC 2 ms 3552 KB
13.txt AC 2 ms 3532 KB
14.txt AC 2 ms 3484 KB
15.txt AC 2 ms 3488 KB
16.txt AC 2 ms 3540 KB
17.txt AC 2 ms 3544 KB
18.txt AC 2 ms 3488 KB
19.txt AC 2 ms 3484 KB
20.txt AC 2 ms 3560 KB
21.txt AC 2 ms 3464 KB
22.txt AC 2 ms 3536 KB
23.txt AC 2 ms 3512 KB
s1.txt AC 2 ms 3476 KB
s2.txt AC 2 ms 3512 KB
s3.txt AC 2 ms 3612 KB