10分，求大佬指出问题

#include<iostream>
#include<algorithm>
using namespace std;
const int N = 1e5 + 10;
int a[N];
int b[N];
int c[N];
int total[4];
int sum;
int main() {
	int n;
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
	}
	for (int i = 1; i <= n; i++) {
		cin >> b[i];
	}
	for (int i = 1; i <= n; i++) {
		cin >> c[i];
	}
	int m;
	cin >> m;
	int cnt1 = 1;
	int cnt2 = 1;
	int cnt3 = 1;
	for (int i = 1; i <= m; i++) {
		int cnt;
		cin >> cnt;
		cnt1 = (cnt1 + cnt) % n;
		if (cnt1 == 0)cnt1 = n;
		total[1] = a[cnt1];
		cin >> cnt;
		cnt2 = (cnt2 + cnt) % n;
		if (cnt2 == 0)cnt2 = n;
		total[2] = b[cnt2];
		cin >> cnt;
		cnt3 = (cnt3 + cnt) % n;
		if (cnt3 == 0)cnt3 = n;
		total[3] = c[cnt3];
		if (total[1] == total[2] && total[2] == total[3]) {
			sum += 200;
			continue;
		}
		if (total[2] - total[1] == 1 && total[3] - total[2] == 1) {
			sum += 200;
			continue;
		}
		sort(total + 1, total + 3);
		if (total[2] == total[1] || total[3] == total[2]) {
			sum += 100;
			continue;
		}
		if (total[2] - total[1] == 1 && total[3] - total[2] == 1)sum += 100;
	}
	cout << sum;
}