Kamen

#include<bits/stdc++.h>
using namespace std;
using ii=long long;
#define all(x) x.begin(), x.end()
#define F first
#define S second

char board[30100][35];

int tt[30100][35];

int n, m;
struct aaa {
    vector<int> joukko;
    int get_index(int i, int j)
    {
        return i * m + j;
    }
    int hae(int x)
    {
        while (joukko[x] != joukko[joukko[x]]) {
            joukko[x] = joukko[joukko[x]];
        }
        return joukko[x];
    }
    pair<int,int> decode(int x)
    {
        return make_pair(x / m + 1, x % m + 1);
    }
    void liita(int y, int x)
    {
        x = hae(x);
        y = hae(y);
        joukko[y] = x;
    }
    aaa()
    {
        joukko.resize(n * m);
        iota(all(joukko), 0);
    }
    pair<int,int> hae(int i, int j)
    {
        i--; j--;
        return decode(hae(get_index(i, j)));
    }
    // x -> y
    void liita(int ix, int jx, int iy, int jy)
    {
        ix--; jx--;
        iy--; jy--;
        liita(get_index(ix, jx), get_index(iy, jy));
    }
};


int main()
{
    cin >> n >> m;
    aaa lauta;
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= m; ++j) {
            cin >> board[i][j];
        }
    }
    for (int i = n; i >= 1; --i) {
        for (int j = 1; j <= m; ++j) {
            if (board[i][j] != '.') continue;
            if (i == n) continue;
            if (board[i][j] == '.' && board[i + 1][j] == '.') {
                lauta.liita(i, j, i + 1, j);
            }
        }
    }
    int amt;
    cin >> amt;
    for (int it = 1; it <= amt; ++it) {
        int x;
        cin >> x;
        auto u = lauta.hae(1, x);
        //cout << "landed @ {"<<u.F<<","<<u.S<<"}\n";
//        assert(board[u.F][u.S] == '.');
        board[u.F][u.S] = 'O';
        if (u.F == 1) continue;
        u.F--;
//        assert(board[u.F][u.S] == '.');
        if (tt[u.F + 1][u.S] && board[u.F + 1][u.S + 2] == '.') {
            //cout << "Move jump right\n";
            lauta.liita(u.F + 1, u.S, u.F + 1, u.S + 2);
        }
        else if (board[u.F][u.S - 1] == '.' && board[u.F + 1][u.S - 1] == '.') {
            //cout << "Move left\n";
            lauta.liita(u.F + 1, u.S, u.F + 1, u.S - 1);
            tt[u.F + 1][u.S - 1] = 1;
        }
        else if (board[u.F][u.S + 1] == '.' && board[u.F + 1][u.S + 1] == '.') {
            //cout << "Move right\n";
            lauta.liita(u.F + 1, u.S, u.F + 1, u.S + 1);
        }
        else {
            //cout << "Move up:(\n";
            if (tt[u.F + 1][u.S]) tt[u.F][u.S] = 1;
            lauta.liita(u.F + 1, u.S, u.F, u.S);
        }
    }
    for (int i = 1; i <= n; ++i) {
        for (int j = 1; j <= m; ++j) {
            cout << board[i][j];
        }
        cout << "\n";
    }
}

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: WRONG ANSWER

Test 8

Verdict: WRONG ANSWER

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: WRONG ANSWER