QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#907223#9965. Game MPOyolo_lyc#AC ✓1ms3712kbC++203.4kb2025-02-20 14:25:232025-02-20 14:25:53

Judging History

This is the latest submission verdict.

  • [2025-02-20 14:25:53]
  • Judged
  • Verdict: AC
  • Time: 1ms
  • Memory: 3712kb
  • [2025-02-20 14:25:23]
  • Submitted

answer

#pragma GCC optimize(2)
#include <bits/stdc++.h>
#define int long long
#define fi first 
#define se second
#define all(v) v.begin(),v.end()
using namespace std;
const int inf = 0x3f3f3f3f3f3f3f;
const int N = 105;
int n;
char a[N][N];
char b[N][N];
int dx[] = {-1,-1,-1,0,0,1,1,1};
int dy[] = {-1,0,1,-1,1,-1,0,1};

void solve(){
    cin>>n;
    for(int i=1;i<=n;i++){
        string s;cin>>s;
        for(int j=1;j<=n;j++){
            a[i][j] = s[j-1];
            b[i][j] = '.';
        }
    }

    int ans = 0;
    int c1 = 0;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            if(a[i][j] == 'M' || a[i][j] == 'P' || a[i][j] == 'O')ans++;
            for(int k=0;k<8;k++){
                int nx = i + dx[k];
                int ny = j + dy[k];
                if(nx < 1 || nx > n || ny < 1 || ny > n)continue;
                if(a[nx][ny] == 'O' && a[i][j] == 'O')c1++;
                if(a[nx][ny] == 'M' && a[i][j] == 'P')c1++;
                if(a[nx][ny] == 'P' && a[i][j] == 'M')c1++;
            }
        }
    }

    c1 /= 2LL;
    ans += c1;
    cout<<ans<<" ";

    while(true){
        bool flag = true;
        for(int i=1;i<=n;i++){
            for(int j=1;j<=n;j++){
                if(a[i][j] != b[i][j]){
                    flag = false;
                }
            }
        }
        if(flag)break;

        for(int i=1;i<=n;i++){
            for(int j=1;j<=n;j++){
                b[i][j] = a[i][j];
            }
        }

        bool f = false;
        for(int i=1;i<=n;i++){
            for(int j=1;j<=n;j++){
                if(a[i][j] == 'o' || a[i][j] == 'm' || a[i][j] == 'p'){
                    for(int k=0;k<8;k++){
                        int nx = i + dx[k];
                        int ny = j + dy[k];
                        if(nx < 1 || nx > n || ny < 1 || ny > n)continue;
                        if(a[i][j] == 'o' && a[nx][ny] == 'O'){
                            a[i][j] = 'O';
                            f = true;
                        }
                        if(a[i][j] == 'm' && a[nx][ny] == 'P'){
                            a[i][j] = 'M';
                            f = true;
                        }
                        if(a[i][j] == 'p' && a[nx][ny] == 'M'){
                            a[i][j] = 'P';
                            f = true;
                        }
                        if(f)break;
                    }
                }
                if(f)break;
            }
            if(f)break;
        }

    }

    ans = 0;
    c1 = 0;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            if(a[i][j] == 'M' || a[i][j] == 'P' || a[i][j] == 'O')ans++;
            for(int k=0;k<8;k++){
                int nx = i + dx[k];
                int ny = j + dy[k];
                if(nx < 1 || nx > n || ny < 1 || ny > n)continue;
                if(a[nx][ny] == 'O' && a[i][j] == 'O')c1++;
                if(a[nx][ny] == 'M' && a[i][j] == 'P')c1++;
                if(a[nx][ny] == 'P' && a[i][j] == 'M')c1++;
            }
        }
    }

    c1 /= 2LL;
    ans += c1;
    cout<<ans<<"\n";

    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            cout<<a[i][j];
        }
        cout<<"\n";
    }

    return;

}

signed main(){
    ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
    int T = 1;
    //cin>>T;
    while(T--){
        solve();
    }
    return 0;
}


Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3584kb

input:

4
.pm.
Mom.
OOm.
p..p

output:

4 13
.PM.
MOM.
OOm.
p..p

result:

ok 5 lines

Test #2:

score: 0
Accepted
time: 0ms
memory: 3584kb

input:

2
.P
P.

output:

2 2
.P
P.

result:

ok 3 lines

Test #3:

score: 0
Accepted
time: 0ms
memory: 3712kb

input:

3
...
.pp
.m.

output:

0 0
...
.pp
.m.

result:

ok 4 lines

Test #4:

score: 0
Accepted
time: 0ms
memory: 3712kb

input:

4
....
....
....
....

output:

0 0
....
....
....
....

result:

ok 5 lines

Test #5:

score: 0
Accepted
time: 1ms
memory: 3712kb

input:

5
m....
m.Mop
OOpoo
PMp..
Oo...

output:

8 15
m....
m.Mop
OOPoo
PMP..
OO...

result:

ok 6 lines

Test #6:

score: 0
Accepted
time: 1ms
memory: 3712kb

input:

6
Mo..Op
..P.p.
p.MopP
mMpO.P
..mp.p
OM.Mo.

output:

12 26
Mo..Op
..P.p.
P.MOpP
MMPO.P
..MP.p
OM.Mo.

result:

ok 7 lines

Test #7:

score: 0
Accepted
time: 0ms
memory: 3712kb

input:

7
.M.O.M.
.PM...M
MO.MMP.
O.O.P.P
POOOOM.
MO...MP
..MOP.O

output:

53 53
.M.O.M.
.PM...M
MO.MMP.
O.O.P.P
POOOOM.
MO...MP
..MOP.O

result:

ok 8 lines

Test #8:

score: 0
Accepted
time: 1ms
memory: 3712kb

input:

8
m.mm..p.
.oo.op.p
.op.pm..
...p.pmp
.o.ooo..
m.momo.o
omp.pmmo
mp.mmo..

output:

0 0
m.mm..p.
.oo.op.p
.op.pm..
...p.pmp
.o.ooo..
m.momo.o
omp.pmmo
mp.mmo..

result:

ok 9 lines

Test #9:

score: 0
Accepted
time: 1ms
memory: 3584kb

input:

9
pp...p.pP
...PmOM.o
.MOM.M.Mm
O.op.pppP
Oo..opMp.
.pPM..p.p
.m.M.o.m.
pPP.PO.O.
mopMooom.

output:

31 93
pp...P.PP
...PMOM.o
.MOM.M.MM
O.OP.PPPP
OO..oPMP.
.PPM..P.P
.M.M.O.M.
PPP.PO.O.
MoPMOOOm.

result:

ok 10 lines

Test #10:

score: 0
Accepted
time: 1ms
memory: 3712kb

input:

10
M.oMppo..p
Pp...pmMp.
o..mp.P.m.
OMm..M..M.
OPPmM.o.M.
.pO..mOm.p
O..o..P.m.
.m..OOp.m.
p..Oomm...
.p.oMpmmp.

output:

30 86
M.oMPPo..p
PP...PMMP.
O..MP.P.M.
OMM..M..M.
OPPMM.O.M.
.pO..MOM.P
O..O..P.M.
.m..OOP.m.
p..OOMM...
.p.OMPMmp.

result:

ok 11 lines

Test #11:

score: 0
Accepted
time: 0ms
memory: 3584kb

input:

10
P.o.OoP...
Mpm.PmPpMm
p.....O..M
MpOM..Ompp
.m.Oo.pM.P
....mOmmPo
Ppoo.mm...
..OM.o.P.p
OPO....M.P
P.ooo.mP.p

output:

36 89
P.o.OOP...
MPM.PMPPMm
P.....O..M
MPOM..OMPP
.M.OO.PM.P
....mOMMPo
PpOO.mM...
..OM.o.P.p
OPO....M.P
P.OOO.MP.p

result:

ok 11 lines

Test #12:

score: 0
Accepted
time: 1ms
memory: 3584kb

input:

10
.m..Oooomo
..........
MOMoomp.Pp
..........
mMP..omOoM
.........O
mmOmoOm.PM
m.........
PmM.O.Mpp.
.........o

output:

20 37
.m..OOOOmo
..........
MOMoomp.Pp
..........
mMP..omOOM
.........O
mmOmOOm.PM
M.........
PMM.O.MPp.
.........o

result:

ok 11 lines

Test #13:

score: 0
Accepted
time: 1ms
memory: 3584kb

input:

10
Oooooooooo
oooooooooo
oooooooooo
oooooooooo
oooooooooo
oooooooooo
oooooooooo
oooooooooo
oooooooooo
oooooooooo

output:

1 442
OOOOOOOOOO
OOOOOOOOOO
OOOOOOOOOO
OOOOOOOOOO
OOOOOOOOOO
OOOOOOOOOO
OOOOOOOOOO
OOOOOOOOOO
OOOOOOOOOO
OOOOOOOOOO

result:

ok 11 lines

Test #14:

score: 0
Accepted
time: 0ms
memory: 3712kb

input:

10
Oooooooooo
.........o
oooooooooo
o.........
oooooooooo
.........o
oooooooooo
o.........
oooooooooo
.........o

output:

1 118
OOOOOOOOOO
.........O
OOOOOOOOOO
O.........
OOOOOOOOOO
.........O
OOOOOOOOOO
O.........
OOOOOOOOOO
.........O

result:

ok 11 lines

Test #15:

score: 0
Accepted
time: 1ms
memory: 3712kb

input:

10
Mm.Op.OM.m
oP.o..mO.m
..........
pm....oo.P
pm.mp..O.o
..........
.p.m.....M
Mm.M..pM.o
..........
OP.Mp.oP.P

output:

19 36
MM.Op.OM.m
oP.O..mO.m
..........
pm....OO.P
pm.mp..O.o
..........
.P.m.....M
MM.M..PM.o
..........
OP.MP.oP.P

result:

ok 11 lines

Test #16:

score: 0
Accepted
time: 0ms
memory: 3584kb

input:

10
mpm.mpmpmp
pmpmpm..pm
mpmpm.mpmp
.mpmpmpmpm
mpmpmpmpm.
pmpm..p.p.
mpmpmpmpmp
..pmpmpm.m
mpmpmpmpmp
pmpmpmpmpM

output:

1 224
MPM.MPMPMP
PMPMPM..PM
MPMPM.MPMP
.MPMPMPMPM
MPMPMPMPM.
PMPM..P.P.
MPMPMPMPMP
..PMPMPM.M
MPMPMPMPMP
PMPMPMPMPM

result:

ok 11 lines

Test #17:

score: 0
Accepted
time: 1ms
memory: 3712kb

input:

10
OM.op.MO.o
po.MO.op.O
..........
OP.om.po.O
mO.Po.OM.o
..........
PO.mo.pp.P
Om.oP.mm.m
........O.
Oo.oO.Mp.o

output:

25 63
OM.OP.MO.O
PO.MO.OP.O
..........
OP.oM.PO.O
MO.Po.OM.O
..........
PO.Mo.pp.P
OM.oP.mm.M
........O.
OO.OO.MP.O

result:

ok 11 lines

Extra Test:

score: 0
Extra Test Passed