Kamen

input/code.cpp: In function 'int main()':
input/code.cpp:47: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:60:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &amt);
     ~~~~~^~~~~~~~~~~~
input/code.cpp:64: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>
#include<vector>
#include<assert.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; }
struct segtree {
    int sz;
    std::vector<int> puu;
    segtree (int n, int fill)
    {
        n++;
        int c = 1;
        while (c * 2 <= n) c*= 2;
        sz = c;
        puu.resize(sz*2+5,fill);
    }
    void muuta(int k, int x)
    {
        k++;
        puu[k += sz] = x;
        for (k/=2;k;k/=2)puu[k]=min(puu[k*2],puu[k*2+1]);
    }
    int hae(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[a++]);
            if (~b& 1) r = min(r, puu[b--]);
        }
        return r;
    }
};
segtree*asd[M];
int main()
{
    scanf("%d%d", &n, &m);
    for (int j = 0; j < m; ++j)
        asd[j] = new segtree(n+1,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') {
                asd[j]->muuta(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 = (asd[x]->hae(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;
        }
        asd[x]->muuta(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: RUNTIME ERROR

Test 8

Verdict: RUNTIME ERROR

Test 9

Verdict: RUNTIME ERROR

Test 10

Verdict: RUNTIME ERROR