防线

 

 

#include <bits/stdc++.h>
using namespace std;
const int N = 200010;
typedef long long ll;
struct seq {
    int s, e, d;
} seqs[N];
int n;
ll get_sum(int x) { //get_sum返回小于等于x的数的个数
    ll res = 0;
    for (int i = 0; i < n; i++) { //遍历所有序列
        if (seqs[i].s <= x) {
            res += (min(seqs[i].e, x) - seqs[i].s) / seqs[i].d + 1;
        }
    }
    return res;
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t;
    cin >> t;
    while (t--) {
        int l = 0, r = 0;
        cin >> n;
        for (int i = 0; i < n; i++) {
            int s, e, d;
            cin >> s >> e >> d;
            seqs[i] = {s, e, d};
            r = max(r, e);
        }
        while (l < r) {
            int mid = (l + r) / 2;
            if (get_sum(mid) & 1) { //如果是奇数的话
                r = mid;
            } else {
                l = mid + 1;
            }
        }
        //看一下二分出来的这个点上的数的个数是多少
        //小于等于l的数的个数减去小于等于l - 1的数的个数就是等于l的数的个数
        ll sum = get_sum(l) - get_sum(l - 1); 
        if (sum & 1) { //如果是奇数，就是答案
            cout << l << " " << sum << endl;
        } else { //否则无解
            cout << "There's no weakness." << endl;
        }
    }
    return 0;
}