Kamen

input/code.cpp: In function 'int main()':
input/code.cpp:34:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d", &n, &m);
     ~~~~~^~~~~~~~~~~~~~~~
input/code.cpp:48:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &amt);
     ~~~~~^~~~~~~~~~~~
input/code.cpp:52:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &it);
         ~~~~~^~~~~~~~~~~

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("arch=sandybridge")
#include<stdio.h>
#define N 30100
#define M 35
char board[N][M];
int n, m;
inline int isfree(int y, int x)
{
    if (y >= n || x >= m || y < 0 || x < 0) return 0;
    return board[y][x] == '.';
}
int min(int a, int b) { return a < b ? a : b; }
const int sz = 1 << 15;
int puu[M][sz * 2];
void muuta(int ind, int k, int x)
{
    k++;
    puu[ind][k += sz] = x;
    for (k/=2;k;k/=2)puu[ind][k]=min(puu[ind][k*2],puu[ind][k*2+1]);
}
int hae(int ind, int a, int b)
{
    a++;b++;
    int r = N;
    for (a+=sz,b+=sz;a<=b;a/=2,b/=2) {
        if (a & 1) r = min(r, puu[ind][a++]);
        if (~b& 1) r = min(r, puu[ind][b--]);
    }
    return r;
}
int main()
{
    scanf("%d%d", &n, &m);
    for (int j = 0; j < m; ++j) {
        for (int i = 0; i < sz*2;++i)puu[j][i]=n;
    }
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            char &c = board[i][j];
            do {c=getchar_unlocked();} while(c!='X'&&c!='.');
            if (c == 'X') {
                muuta(j,i,i);
            }
        }
    }
    int amt;
    scanf("%d", &amt);
    for (int i = 0; i < amt; ++i) {
        int it;
//        printf("kivi %d\n", i);
        scanf("%d", &it);
        int y = 0;
        int x = it - 1;
        for (;;)
        {
            y = hae(x,y, n) - 1;
//            printf("y=%d x=%d\n", y, x);
            if (y + 1 >= n) break;
            else if (board[y + 1][x] == 'O') {
                if (isfree(y + 1, x - 1) && isfree(y, x - 1)) {
                    x--;
                    y++;
                }
                else if (isfree(y, x + 1) && isfree(y + 1, x + 1)) {
                    x++;
                    y++;
                }
                else break;
            }
            else break;
        }
        muuta(x,y, y);
        board[y][x] = 'O';
    }
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            putchar_unlocked(board[i][j]);
        }
        putchar_unlocked('\n');
    }
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: TIME LIMIT EXCEEDED

Test 8

Verdict: TIME LIMIT EXCEEDED

Test 9

Verdict: TIME LIMIT EXCEEDED

Test 10

Verdict: TIME LIMIT EXCEEDED