modified: 35.cpp

35.cpp

@@ -4,21 +4,35 @@ using namespace std;
 int t;
 struct node
 {
-    int l, r, d;
+    long long l, r, d;
-} arm[200005];
+} a[200005];
-map<int, int> qsum;
 int n;
-bool check(int now)
+int pre(long long x)
 {
-    pair<int, int> pre;
+    int res = 0;
-    for (auto k : qsum)
+    for (int i = 0; i < n; ++i)
     {
-        if (pre.first < now && k.first >= now)
+        if (x < a[i].l)
-        {
+            continue;
-            return k.second % 2;
+        long long end = min(x, a[i].r);
-        }
+        if (end < a[i].l)
-        pre = k;
+            continue;
+        long long cnt = (end - a[i].l) / a[i].d + 1;
+        res ^= (cnt & 1);
     }
+    return res;
+}
+long long at(long long p)
+{
+    long long cnt = 0;
+    for (int i = 0; i < n; ++i)
+    {
+        if (p < a[i].l || p > a[i].r)
+            continue;
+        if ((p - a[i].l) % a[i].d == 0)
+            ++cnt;
+    }
+    return cnt;
 }
 int main()
 {
@@ -26,29 +40,28 @@ int main()
     while (t--)
     {
         scanf("%d", &n);
-        int maxr = 0;
+        long long maxE = 0;
-        qsum.clear();
+
-        for (int i = 1; i <= n; ++i)
+        for (int i = 0; i < n; ++i)
         {
-            scanf("%d%d%d", &arm[i].l, &arm[i].r, &arm[i].d);
+            scanf("%lld%lld%lld", &a[i].l, &a[i].r, &a[i].d);
-            for (int j = arm[i].l; j <= arm[i].r; j += arm[i].d)
+            maxE = max(maxE, a[i].r);
-            {
-                qsum[j] += (j - arm[i].l + arm[i].d) / arm[i].d;
-                maxr = max(maxr, j);
-            }
         }
-        if (qsum[maxr] % 2 == 0)
+        if (pre(maxE) == 0)
+        {
             puts("There's no weakness.");
-        else
+            continue;
-        {
-            int l = 0, r = maxr, mid;
-            while (l < r)
-                if (check(mid))
-                    r = mid;
-                else
-                    l = mid + 1;
-            printf("%d\n", mid);
         }
+        long long l = 0, r = maxE;
+        while (l < r)
+        {
+            long long mid = (l + r) >> 1;
+            if (pre(mid) == 1)
+                r = mid;
+            else
+                l = mid + 1;
+        }
+        printf("%lld %lld\n", l, at(l));
     }
     return 0;
 }