oj.uz

Submission #716109

# Submission time Handle Problem Language Result Execution time Memory
716109 2023-03-29T03:58:09 Z tengiz05 Wish (LMIO19_noras) C++17
38 / 100
 1000 ms 3992 KB 
#include <bits/stdc++.h>

using i64 = long long;

struct Vector {
    i64 x, y;
    Vector(i64 x = 0, i64 y = 0) : x(x), y(y) {}
    Vector operator-(Vector b) {
        return Vector(x - b.x, y - b.y);
    }
    Vector operator+(Vector b) {
        return Vector(x + b.x, y + b.y);
    }
    Vector operator*(i64 k) {
        return Vector(x * k, y * k);
    }
    __int128 length() {
        return __int128(x) * x + __int128(y) * y;
    }
};

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    
    int n;
    i64 Rin;
    std::cin >> n >> Rin;
    __int128 R = __int128(Rin) * Rin;
    
    std::vector<Vector> a(n), b(n);
    for (int i = 0; i < n; i++) {
        std::cin >> a[i].x >> a[i].y >> b[i].x >> b[i].y;
    }
    
    std::vector<std::pair<int, int>> v;
    for (int i = 0; i < n; i++) {
        Vector cur = a[i];
        Vector delta = b[i] - a[i];
        int lo = 0, hi = 20000;
        while (lo < hi) {
            int m = (lo + hi + 1) / 2;
            if (cur.length() >= (delta * m).length() && cur.length() >= (cur + delta * m).length()) {
                lo = m;
            } else {
                hi = m - 1;
            }
        }
        int p = 0;
        while (p < 20000 && (cur + delta * p).length() > R) p++;
        if ((cur + delta * p).length() > R) continue;
        int l = -1, r = -1;
        cur = a[i];
        delta = b[i] - a[i];
        for (int j = 0; j < 20005; j++) {
            if (cur.length() <= R) {
                if (l == -1) {
                    l = j;
                }
                r = j;
            }
            cur = cur + delta;
        }
        assert(l != -1);
        std::cerr << l << " " << r << "\n";
        v.push_back({l, r});
        //~ int l = lo;
        //~ while (l > 0 && (cur - delta).length() <= R) {
            //~ cur = cur - delta;
            //~ l--;
        //~ }
        //~ int r = l;
        //~ while ((cur + delta).length() <= R) {
            //~ cur = cur + delta;
            //~ r++;
        //~ }
        //~ v.push_back({l, r});
    }
    
    std::vector<std::pair<int, int>> events;
    for (auto [l, r] : v) {
        events.emplace_back(l, 1);
        events.emplace_back(r + 1, -1);
    }
    std::sort(events.begin(), events.end());
    int k = events.size();
    int cnt = 0;
    int ans = 0;
    for (int i = 0; i < k; ) {
        int j = i;
        while (j < k && events[i].first == events[j].first)
            j++;
        while (i < j) {
            cnt += events[i].second;
            i++;
        }
        ans = std::max(ans, cnt);
    }
    
    std::cout << ans << "\n";
    
    return 0;
}

Subtask #1
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 40 ms 360 KB Output is correct
4 Correct 41 ms 356 KB Output is correct
5 Correct 41 ms 356 KB Output is correct
6 Correct 44 ms 348 KB Output is correct
7 Correct 39 ms 352 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 62 ms 356 KB Output is correct
15 Correct 60 ms 340 KB Output is correct
16 Correct 60 ms 360 KB Output is correct
17 Correct 62 ms 356 KB Output is correct
18 Correct 62 ms 356 KB Output is correct
19 Correct 45 ms 352 KB Output is correct
20 Correct 49 ms 356 KB Output is correct
21 Correct 49 ms 352 KB Output is correct
22 Correct 47 ms 360 KB Output is correct

Subtask #2
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 40 ms 360 KB Output is correct
4 Correct 41 ms 356 KB Output is correct
5 Correct 41 ms 356 KB Output is correct
6 Correct 44 ms 348 KB Output is correct
7 Correct 39 ms 352 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 62 ms 356 KB Output is correct
15 Correct 60 ms 340 KB Output is correct
16 Correct 60 ms 360 KB Output is correct
17 Correct 62 ms 356 KB Output is correct
18 Correct 62 ms 356 KB Output is correct
19 Correct 45 ms 352 KB Output is correct
20 Correct 49 ms 356 KB Output is correct
21 Correct 49 ms 352 KB Output is correct
22 Correct 47 ms 360 KB Output is correct
23 Execution timed out 1058 ms 3992 KB Time limit exceeded
24 Halted 0 ms 0 KB -

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 40 ms 360 KB Output is correct
4 Correct 41 ms 356 KB Output is correct
5 Correct 41 ms 356 KB Output is correct
6 Correct 44 ms 348 KB Output is correct
7 Correct 39 ms 352 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 62 ms 356 KB Output is correct
15 Correct 60 ms 340 KB Output is correct
16 Correct 60 ms 360 KB Output is correct
17 Correct 62 ms 356 KB Output is correct
18 Correct 62 ms 356 KB Output is correct
19 Correct 45 ms 352 KB Output is correct
20 Correct 49 ms 356 KB Output is correct
21 Correct 49 ms 352 KB Output is correct
22 Correct 47 ms 360 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 44 ms 468 KB Output is correct
25 Correct 57 ms 368 KB Output is correct
26 Correct 45 ms 348 KB Output is correct
27 Correct 45 ms 368 KB Output is correct
28 Correct 45 ms 364 KB Output is correct

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 40 ms 360 KB Output is correct
4 Correct 41 ms 356 KB Output is correct
5 Correct 41 ms 356 KB Output is correct
6 Correct 44 ms 348 KB Output is correct
7 Correct 39 ms 352 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 62 ms 356 KB Output is correct
15 Correct 60 ms 340 KB Output is correct
16 Correct 60 ms 360 KB Output is correct
17 Correct 62 ms 356 KB Output is correct
18 Correct 62 ms 356 KB Output is correct
19 Correct 45 ms 352 KB Output is correct
20 Correct 49 ms 356 KB Output is correct
21 Correct 49 ms 352 KB Output is correct
22 Correct 47 ms 360 KB Output is correct
23 Execution timed out 1058 ms 3992 KB Time limit exceeded
24 Halted 0 ms 0 KB -

Subtask #5
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 40 ms 360 KB Output is correct
4 Correct 41 ms 356 KB Output is correct
5 Correct 41 ms 356 KB Output is correct
6 Correct 44 ms 348 KB Output is correct
7 Correct 39 ms 352 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 62 ms 356 KB Output is correct
15 Correct 60 ms 340 KB Output is correct
16 Correct 60 ms 360 KB Output is correct
17 Correct 62 ms 356 KB Output is correct
18 Correct 62 ms 356 KB Output is correct
19 Correct 45 ms 352 KB Output is correct
20 Correct 49 ms 356 KB Output is correct
21 Correct 49 ms 352 KB Output is correct
22 Correct 47 ms 360 KB Output is correct
23 Execution timed out 1058 ms 3992 KB Time limit exceeded
24 Halted 0 ms 0 KB -