QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#741311#9621. 连方oqmsacAC ✓20ms3876kbC++232.2kb2024-11-13 14:04:162024-11-13 14:04:18

Judging History

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

  • [2024-11-13 14:04:18]
  • 评测
  • 测评结果:AC
  • 用时:20ms
  • 内存:3876kb
  • [2024-11-13 14:04:16]
  • 提交

answer

#include<bits/stdc++.h>

#define ll  long long
#define ull unsigned long long
#define ld long double
#define pii pair<ll,ll>
using namespace std;
#pragma GCC optimize(3)
#define N 600005

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int T;
    cin>>T;
    while(T--)
    {
        ll n;
        cin>>n;
        string a,b;
        cin>>a>>b;
        ll ca=0,cb=0;
        string c,d;
        for(int i=0;i<n;i++)
        {
            if(a[i]=='#') {
                ca++;
                c+='.';
            }
            else c+='#';
            if(b[i]=='#')
            {
                cb++;
                d+='.';
            }
            else d+='#';
        }
        if(ca==n&&cb==n)
        {
            cout<<"Yes"<<endl;
            for(int i=0;i<7;i++)
            {
                cout<<a<<endl;
            }
            continue;
        }
        else if(ca==n||cb==n)
        {
            cout<<"No"<<endl;
            continue;
        }
        ll pa,pb;
        for(int i=0;i<n;i++)
        {
            if(a[i]=='#'&&(i-1>=0&&a[i-1]=='.'||a[i+1]=='.'))
            {
                pa=i;
                break;
            }
        }
        for(int i=0;i<n;i++)
        {
            if(b[i]=='#'&&(i-1>=0&&b[i-1]=='.'||b[i+1]=='.'))
            {
                pb=i;
                break;
            }
        }
        cout<<"Yes"<<endl;
        cout<<a<<endl<<c<<endl;
        for(int i=0;i<n;i++)
        {
            if(i!=pa) cout<<'.';
            else cout<<'#';
        }
        cout<<endl;
        for(int i=0;i<n;i++)
        {
            if(abs(pa-pb)<=1)
            {
                if(i!=pa) cout<<'.';
                else cout<<'#';
            }
            else
            {
                if(i>min(pa,pb)&&i<max(pa,pb))
                {
                    cout<<'#';
                }
                else cout<<'.';
            }
        }
        cout<<endl;
        for(int i=0;i<n;i++)
        {
            if(i!=pb) cout<<'.';
            else cout<<'#';
        }
        cout<<endl<<d<<endl<<b<<endl;
    }
    return 0;
}

详细

Test #1:

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

input:

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

output:

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

result:

ok Correct.

Test #2:

score: 0
Accepted
time: 19ms
memory: 3612kb

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: 20ms
memory: 3860kb

input:

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

output:

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

result:

ok Correct.

Test #4:

score: 0
Accepted
time: 19ms
memory: 3620kb

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: 15ms
memory: 3872kb

input:

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

output:

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

result:

ok Correct.

Test #6:

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

input:

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

output:

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

result:

ok Correct.

Test #7:

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

input:

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

output:

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

result:

ok Correct.