oj.uz

답안 #802137

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
802137 2023-08-02T10:16:44 Z starchan Advertisement 2 (JOI23_ho_t2) C++17
100 / 100
 248 ms 45652 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define in pair<int, int>
#define f first
#define s second
#define pb push_back
#define pob pop_back
#define INF (int)1e17
#define MX (int)3e5+5
#define fast() ios_base::sync_with_stdio(false); cin.tie(NULL)
struct janitor
{
	set<in> ok;
	void add(in zz)
	{
		auto it1 = ok.lower_bound({zz.f, -INF});
		if(it1 == ok.end())
		{
			ok.insert(zz);
			return;
		}
		if((*it1).s >= zz.s)
			return;
		ok.insert(zz);
		return;
	}
	int size()
	{
		return ok.size();
	}
};
signed main()
{
	fast();
	int n;
	cin >> n;
	vector<in> ex(n+1);
	ex[0] = {INF, INF};
	for(int i = 1; i <= n; i++)
	{
		cin >> ex[i].s >> ex[i].f;
	}
	sort(ex.rbegin(), ex.rend());
	janitor work;
	for(int i = 1; i <= n; i++)
		work.add({ex[i].f+ex[i].s, ex[i].f-ex[i].s});
	cout << work.size() << "\n";
	return 0;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 61 ms 12000 KB Output is correct
3 Correct 68 ms 11312 KB Output is correct
4 Correct 119 ms 16760 KB Output is correct
5 Correct 60 ms 11724 KB Output is correct
6 Correct 248 ms 45652 KB Output is correct
7 Correct 208 ms 31368 KB Output is correct
8 Correct 137 ms 18112 KB Output is correct
9 Correct 85 ms 17864 KB Output is correct

Subtask #2
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 316 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 0 ms 212 KB Output is correct
14 Correct 0 ms 320 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct

Subtask #3
36.0 / 36.0

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

Subtask #4
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 61 ms 12000 KB Output is correct
3 Correct 68 ms 11312 KB Output is correct
4 Correct 119 ms 16760 KB Output is correct
5 Correct 60 ms 11724 KB Output is correct
6 Correct 248 ms 45652 KB Output is correct
7 Correct 208 ms 31368 KB Output is correct
8 Correct 137 ms 18112 KB Output is correct
9 Correct 85 ms 17864 KB Output is correct
10 Correct 0 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 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 316 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 320 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 356 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 340 KB Output is correct
36 Correct 91 ms 11912 KB Output is correct
37 Correct 114 ms 15128 KB Output is correct
38 Correct 132 ms 17804 KB Output is correct
39 Correct 124 ms 14768 KB Output is correct
40 Correct 140 ms 17764 KB Output is correct
41 Correct 133 ms 17752 KB Output is correct
42 Correct 141 ms 17860 KB Output is correct
43 Correct 150 ms 24776 KB Output is correct
44 Correct 124 ms 17740 KB Output is correct
45 Correct 245 ms 45240 KB Output is correct