这个代码蒟蒻已经喂给deepseek改了两次了，在遇到样例时仍然输出零，测试点四个TLE其他全是WA

受害者代码如下

#include <bits/stdc++.h>
using namespace std;

int main() {
	int n;
	cin >> n;
	string s;
	cin >> s;
	vector<pair<int, int>> p(n);
	for (int i = 0; i < n; i++) {
		cin >> p[i].first >> p[i].second;
	}

	int Gmin = n + 1, Gmax = 0, Hmin = n + 1, Hmax = 0;
	for (int i = 0; i < n; i++) {
		if (s[i] == 'G') {
			Gmin = min(Gmin, i + 1);
			Gmax = max(Gmax, i + 1);
		} else {
			Hmin = min(Hmin, i + 1);
			Hmax = max(Hmax, i + 1);
		}
	}

	long long ans = 0;
	for (int i = 0; i < n; i++) {
		if (s[i] != 'G')
			continue;
		for (int j = 0; j < n; j++) {
			if (s[j] != 'H')
				continue;
			bool c1 = (p[i].first <= Gmin && p[i].second >= Gmax) ||
			          (p[i].first <= (j + 1) && (j + 1) <= p[i].second);
			bool c2 = (p[j].first <= Hmin && p[j].second >= Hmax) ||
			          (p[j].first <= (i + 1) && (i + 1) <= p[j].second);
			bool c3 = max(p[i].first, p[j].first) <= min(p[i].second, p[j].second);
			if (c1 && c2 && c3)
				ans++;
		}
	}
	cout << ans;
	return 0;
}