답안 #955602

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
955602	2024-03-31T05:36:47 Z	Kakarot	Advertisement 2 (JOI23_ho_t2)	C++	59 / 100	2000 ms	2396 KB

Main

#include <bits/stdc++.h>
#define int int64_t
using namespace std;

void setIO() {
    cin.tie(0)->sync_with_stdio(0);
}

bool pred(pair<int, int> &src, pair<int, int> &dest) {
    return (abs(src.first - dest.first) <= src.second - dest.second);
}

void mark(int idx, vector<bool> &marked, vector<pair<int, int>> &points) {
    if(marked[idx]) return;
    marked[idx] = true;
    for(int i = 0; i < idx; i++) {
        if(marked[i] or !pred(points[idx], points[i])) continue;
        mark(i, marked, points);
    }
}

void solve() {
    //cout << "zco";
    int n;
    cin >> n;
    vector<pair<int, int>> points(n);
    for(auto &x : points) cin >> x.first >> x.second;
    sort(points.begin(), points.end(), [](pair<int, int> &a, pair<int, int> &b) { return a.second < b.second; });
    int ans = 0;
    vector<bool> marked(n, false);
    for(int i = n-1; i > -1; i--) {
        if(marked[i]) continue;
        mark(i, marked, points);
        ans++;
    }    
    cout << ans;
}

int32_t main() {
    setIO();
    solve();
    return 0;
}

Subtask #1

0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Execution timed out	2023 ms	2396 KB	Time limit exceeded
3	Halted	0 ms	0 KB	-

Subtask #2

23.0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	452 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	344 KB	Output is correct
12	Correct	0 ms	344 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	548 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	344 KB	Output is correct

Subtask #3

36.0 / 36.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	452 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	344 KB	Output is correct
12	Correct	0 ms	344 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	548 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	344 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	1 ms	488 KB	Output is correct
21	Correct	1 ms	344 KB	Output is correct
22	Correct	1 ms	492 KB	Output is correct
23	Correct	1 ms	488 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	2 ms	348 KB	Output is correct
26	Correct	2 ms	348 KB	Output is correct

Subtask #4

0 / 31.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Execution timed out	2023 ms	2396 KB	Time limit exceeded
3	Halted	0 ms	0 KB	-