QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#740789#9621. 连方DiaoTianhao#AC ✓8ms4484kbC++141.5kb2024-11-13 11:31:142024-11-13 11:31:16

Judging History

你现在查看的是最新测评结果

  • [2024-11-13 11:31:16]
  • 评测
  • 测评结果:AC
  • 用时:8ms
  • 内存:4484kb
  • [2024-11-13 11:31:14]
  • 提交

answer

#include <bits/stdc++.h>
#define FL(i, a, b) for (int i = (a); i <= (b); ++i)
#define FR(i, a, b) for (int i = (a); i >= (b); --i)
#define eb emplace_back
using namespace std;
typedef vector<int> vi;
constexpr int N = 1e5 + 10;
int n, f[2];
char str[10][N];
char R(char x) {
	return '#' + '.' - x;
}
bool Check() {
	f[0] = 1, f[1] = 0;
	FL(j, 0, 1) {
		FL(i, 1, n) {
			f[j] = (str[!j? 1 : 7][i] == '#');
			if (!f[j]) {
				break;
			}
		}
	}
	if (f[0] ^ f[1]) {
		puts("No");
		return 0;
	}
	puts("Yes");
	if (f[0] & f[1]) {
		FL(i, 1, 7) {
			printf("%s\n", str[1] + 1);
		}
		return 0;
	}
	return 1;
}
int Get(int x) {
	int y = (x == 1? 2 : 6);
	int z = (x == 1? 3 : 5);
	FL(i, 1, n) {
		str[y][i] = R(str[x][i]);
	}
	FL(i, 1, n - 1){
		if (str[y][i] == '#' && str[y][i + 1] == '.') {
			str[z][i + 1] = '#';
			return i + 1;
		}
		if (str[y][i] == '.' && str[y][i + 1] == '#') {
			str[z][i] = '#';
			return i;
		}
	}
	return 0;
}
void Solve() {
	scanf("%d%s%s", &n, str[1] + 1, str[7] + 1);
	if (!Check()) {
		return;
	}
	FL(i, 2, 6) {
		fill(str[i] + 1, str[i] + n + 1, '.');
		str[i][n + 1] = '\0';
	}
	int x = Get(1), y = Get(7);
	if (x > y) {
		swap(x, y);
	}
	if (y - x < 2) {
		str[4][x] = '#';
	} else {
		FL(i, x + 1, y - 1) {
			str[4][i] = '#';
		}
	}
	FL(i, 1, 7) {
		FL(j, 1, n) {
			putchar(str[i][j]);
		}
		putchar('\n');
	}
}
int main() {
	int T;
	scanf("%d", &T);
	while (T--) {
		Solve();
	}
	return 0; 
}

详细

Test #1:

score: 100
Accepted
time: 1ms
memory: 3812kb

input:

5
4
#..#
.##.
5
##.#.
.#.##
6
######
.####.
27
.######.######.####.#.#####
.####...####..#.......#####
10
##########
##########

output:

Yes
#..#
.##.
#...
#...
.#..
#..#
.##.
Yes
##.#.
..#.#
.#...
.#...
.#...
#.#..
.#.##
No
Yes
.######.######.####.#.#####
#......#......#....#.#.....
.#.........................
.#.........................
.#.........................
#....###....##.#######.....
.####...####..#.......#####
Yes
########...

result:

ok Correct.

Test #2:

score: 0
Accepted
time: 8ms
memory: 3852kb

input:

10000
6
.#..##
..#...
5
#..#.
##...
6
.###.#
...###
17
.####..#######..#
###########.#####
6
..##.#
#.##.#
25
#.##.##############.####.
####################.##.#
9
##.#..##.
##..#####
6
.###.#
##.###
6
###..#
#.####
25
#####################.#.#
######.##################
6
.#.###
.##..#
6
..####
#......

output:

Yes
.#..##
#.##..
.#....
.#....
..#...
##.###
..#...
Yes
#..#.
.##.#
#....
#....
.#...
..###
##...
Yes
.###.#
#...#.
.#....
..#...
...#..
###...
...###
Yes
.####..#######..#
#....##.......##.
.#...............
..########.......
..........#......
...........#.....
###########.#####
Yes
..##.#
##..#.
...

result:

ok Correct.

Test #3:

score: 0
Accepted
time: 2ms
memory: 3856kb

input:

10000
41
#######.#######.#########################
################.###.#######.############
6
..#..#
#..##.
6
#.#...
#...#.
6
.#.##.
....##
6
...#.#
##..#.
33
#####.###########################
###########.#####################
6
.##.##
.##.#.
5
..##.
####.
17
#.###.##########.
####.##.#####.##.
5
....

output:

Yes
#######.#######.#########################
.......#.......#.........................
......#..................................
.......########..........................
...............#.........................
................#...#.......#............
################.###.#######.############
Ye...

result:

ok Correct.

Test #4:

score: 0
Accepted
time: 8ms
memory: 3916kb

input:

10000
6
..####
.#....
6
...#.#
#..##.
9
..####.##
######..#
33
#######################.#####..##
######.######.###########.#######
6
####.#
#..##.
6
...###
##.###
25
######.#.#.##############
.#########.##########.###
17
############.####
###############.#
6
#..#.#
#####.
6
.#.###
..#...
49
########...

output:

Yes
..####
##....
..#...
.#....
.#....
#.####
.#....
Yes
...#.#
###.#.
...#..
.##...
#.....
.##..#
#..##.
Yes
..####.##
##....#..
..#......
...##....
.....#...
......##.
######..#
Yes
#######################.#####..##
.......................#.....##..
......................#..........
......########...

result:

ok Correct.

Test #5:

score: 0
Accepted
time: 8ms
memory: 3820kb

input:

10000
5
...#.
#####
6
###...
##..#.
9
.#.######
#.#..####
49
######.##########################################
########.#############.##########################
41
###########.#######.#####################
##############.##########################
6
###..#
###.##
49
#################################...

output:

No
Yes
###...
...###
..#...
.#....
.#....
..##.#
##..#.
Yes
.#.######
#.#......
.#.......
#........
#........
.#.##....
#.#..####
Yes
######.##########################################
......#..........................................
.....#...........................................
......#............

result:

ok Correct.

Test #6:

score: 0
Accepted
time: 3ms
memory: 4336kb

input:

2
100000
###.#...#..####...#####..####.#.######.##.##..#..#..####...###.#..##.#.##.####.#.#.###...#.##...####.#.#.####...####.#..##.##.#.#.....####..####..#...#..#.##..#.##.#.....#..#.#.###.#....####...####..##.#.#####..####.##.#.###.#.#....#.##.##...#.######.#..##..##...#.....#....#.####...#...##.#...

output:

Yes
###.#...#..####...#####..####.#.######.##.##..#..#..####...###.#..##.#.##.####.#.#.###...#.##...####.#.#.####...####.#..##.##.#.#.....####..####..#...#..#.##..#.##.#.....#..#.#.###.#....####...####..##.#.#####..####.##.#.###.#.#....#.##.##...#.######.#..##..##...#.....#....#.####...#...##.##.#.....

result:

ok Correct.

Test #7:

score: 0
Accepted
time: 3ms
memory: 4484kb

input:

2
100000
##.####.#..#..#.##..#.#..###..##..#####.....#..##.##.#...#.###..##..#...##...####..#...##...##.......#.#..##.##..###.#.###.##.#########..#...###.####.##...#..#.....#####.....#.####.#####..#.#....#..###.#.##..#..#.##.......#.###.##...####.....######..#.##....#.#.###.#.###.#..#.....####....##...

output:

Yes
##.####.#..#..#.##..#.#..###..##..#####.....#..##.##.#...#.###..##..#...##...####..#...##...##.......#.#..##.##..###.#.###.##.#########..#...###.####.##...#..#.....#####.....#.####.#####..#.#....#..###.#.##..#..#.##.......#.###.##...####.....######..#.##....#.#.###.#.###.#..#.....####....##........

result:

ok Correct.