oj.uz

답안 #715971

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
715971 2023-03-28T16:18:49 Z tengiz05 Wish (LMIO19_noras) C++17
38 / 100
 1000 ms 5616 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);
    }
    i64 length() {
        return x * x + y * y;
    }
};
 
int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    
    int n;
    i64 R;
    std::cin >> n >> R;
    
    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++) {
        int l = -1, r = -1;
        Vector cur = a[i];
        Vector delta = b[i] - a[i];
        for (int j = 0; j < 20005; j++) {
            if (cur.length() <= R * R) {
                if (l == -1) {
                    l = j;
                }
                r = j;
            }
            cur = cur + delta;
        }
        if (l != -1) {
            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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 19 ms 372 KB Output is correct
4 Correct 30 ms 372 KB Output is correct
5 Correct 19 ms 380 KB Output is correct
6 Correct 21 ms 368 KB Output is correct
7 Correct 19 ms 368 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 320 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 22 ms 380 KB Output is correct
15 Correct 23 ms 376 KB Output is correct
16 Correct 23 ms 388 KB Output is correct
17 Correct 22 ms 340 KB Output is correct
18 Correct 23 ms 372 KB Output is correct
19 Correct 22 ms 468 KB Output is correct
20 Correct 22 ms 376 KB Output is correct
21 Correct 20 ms 372 KB Output is correct
22 Correct 25 ms 332 KB Output is correct

Subtask #2
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 19 ms 372 KB Output is correct
4 Correct 30 ms 372 KB Output is correct
5 Correct 19 ms 380 KB Output is correct
6 Correct 21 ms 368 KB Output is correct
7 Correct 19 ms 368 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 320 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 22 ms 380 KB Output is correct
15 Correct 23 ms 376 KB Output is correct
16 Correct 23 ms 388 KB Output is correct
17 Correct 22 ms 340 KB Output is correct
18 Correct 23 ms 372 KB Output is correct
19 Correct 22 ms 468 KB Output is correct
20 Correct 22 ms 376 KB Output is correct
21 Correct 20 ms 372 KB Output is correct
22 Correct 25 ms 332 KB Output is correct
23 Execution timed out 1076 ms 5616 KB Time limit exceeded
24 Halted 0 ms 0 KB -

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 19 ms 372 KB Output is correct
4 Correct 30 ms 372 KB Output is correct
5 Correct 19 ms 380 KB Output is correct
6 Correct 21 ms 368 KB Output is correct
7 Correct 19 ms 368 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 320 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 22 ms 380 KB Output is correct
15 Correct 23 ms 376 KB Output is correct
16 Correct 23 ms 388 KB Output is correct
17 Correct 22 ms 340 KB Output is correct
18 Correct 23 ms 372 KB Output is correct
19 Correct 22 ms 468 KB Output is correct
20 Correct 22 ms 376 KB Output is correct
21 Correct 20 ms 372 KB Output is correct
22 Correct 25 ms 332 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 20 ms 340 KB Output is correct
25 Correct 22 ms 380 KB Output is correct
26 Correct 19 ms 368 KB Output is correct
27 Correct 19 ms 376 KB Output is correct
28 Correct 28 ms 376 KB Output is correct

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 19 ms 372 KB Output is correct
4 Correct 30 ms 372 KB Output is correct
5 Correct 19 ms 380 KB Output is correct
6 Correct 21 ms 368 KB Output is correct
7 Correct 19 ms 368 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 320 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 22 ms 380 KB Output is correct
15 Correct 23 ms 376 KB Output is correct
16 Correct 23 ms 388 KB Output is correct
17 Correct 22 ms 340 KB Output is correct
18 Correct 23 ms 372 KB Output is correct
19 Correct 22 ms 468 KB Output is correct
20 Correct 22 ms 376 KB Output is correct
21 Correct 20 ms 372 KB Output is correct
22 Correct 25 ms 332 KB Output is correct
23 Execution timed out 1076 ms 5616 KB Time limit exceeded
24 Halted 0 ms 0 KB -

Subtask #5
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 19 ms 372 KB Output is correct
4 Correct 30 ms 372 KB Output is correct
5 Correct 19 ms 380 KB Output is correct
6 Correct 21 ms 368 KB Output is correct
7 Correct 19 ms 368 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 320 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 22 ms 380 KB Output is correct
15 Correct 23 ms 376 KB Output is correct
16 Correct 23 ms 388 KB Output is correct
17 Correct 22 ms 340 KB Output is correct
18 Correct 23 ms 372 KB Output is correct
19 Correct 22 ms 468 KB Output is correct
20 Correct 22 ms 376 KB Output is correct
21 Correct 20 ms 372 KB Output is correct
22 Correct 25 ms 332 KB Output is correct
23 Execution timed out 1076 ms 5616 KB Time limit exceeded
24 Halted 0 ms 0 KB -