TLE70pt求调

#include<iostream>
#include<vector>
#include<algorithm>
#include<cstring>
using namespace std;
const int N = 1e5+10;
int indexx[N];
struct ship {
	unsigned long long t;
	int country[3001];
}Ship[N];
int main() {
	int n;
	cin >> n;
	for (int i = 1; i <= n; i++) {
		int cnt = 0;
		int t;
		int k;
		cin >> t;
		cin >> k;
		Ship[i].t = t;
		for (int j = 0; j < k; j++) {
			int x;
			cin >> x;
			Ship[i].country[j] = x;
		}
		for (int j = 1; j <= n; j++) {
			if (Ship[j].t <= Ship[i].t&& Ship[j].t> Ship[i].t-86400) {
				for (int m = 0; Ship[j].country[m] != 0; m++) {
					if (indexx[Ship[j].country[m]] == 0) {
						cnt++;
						indexx[Ship[j].country[m]]++;
					}
				}
			}
		}
		memset(indexx, 0, sizeof(indexx));
		cout << cnt << endl;
	}
}