백준 15662 톱니바퀴(2)

https://www.acmicpc.net/problem/15662

15662번: 톱니바퀴 (2)

#include<stdio.h>
#include<iostream>
#include<string.h>
#define TSIZE 1001
using namespace std;
int gearRot[TSIZE];
char gearState[TSIZE][8];
int T,K,ret;
void init() {
    scanf("%d", &T);
    for (int i = 1; i <= T; i++) {
        scanf("%s", gearState[i]);
    }
}
void rightClock(int num) {
    int end = gearState[num][7];
        for (int i = 6; i >= 0; i--) {
            gearState[num][i+1] = gearState[num][i];
        }
        gearState[num][0] = end;
}
void leftClock(int num) {
    int start = gearState[num][0];
    for (int i = 1; i < 8; i++) {
        gearState[num][i - 1] = gearState[num][i];
    }
    gearState[num][7] = start;
}
void play() {
    scanf("%d", &K);
    for (int i = 0; i < K; i++) {
        int gearNum; int dir;
        scanf("%d %d", &gearNum, &dir);
        memset(gearRot, 0, sizeof(gearRot));
        gearRot[gearNum] = dir;
        for (int L = gearNum; L <= T-1; L++) {
            if (gearState[L][2] == gearState[L + 1][6]) gearRot[L + 1] = 0;
            else {
                gearRot[L + 1]= gearRot[L]* -1;
            }
        }
 
        for (int R = gearNum; R >= 1; R--) {
            if (gearState[R][6] == gearState[R - 1][2])gearRot[R - 1] = 0;
            else {
                gearRot[R-1] = gearRot[R] * -1;
            }
        }
        for (int j = 1; j <= T; j++) {
            if (gearRot[j] == -1) { leftClock(j); }
            else if (gearRot[j] == 1) { rightClock(j); }
        }
 
    }
    for (int i = 1; i <= T; i++) {
        if (gearState[i][0] == '1') ret++;
    }
}
int main(void) {
    init();
    play();
    cout << ret << endl;
    return 0;
}