131
272 428
185 936
3 288
271 549
707 958
362 614
128 778
512 570
233 880
68 475
517 986
<1061 bytes omitted>用户输出
5
Special Judge 信息
Files user_out and answer differ
系统信息
Exited with return code 0| 编号 | 题目 | 状态 | 分数 | 总时间 | 内存 | 代码 / 答案文件 | 提交者 | 提交时间 |
|---|---|---|---|---|---|---|---|---|
| #48731 | #1021. jwp的区间游戏 | Wrong Answer | 0 | 54 ms | 1012 K | C++ (NOI) / 560 B | alex_xin | 2021-05-18 15:25:18 |
#include <cstdio>
#include <algorithm>
#define MAXN 100005
using namespace std;
int n;
struct scale {
int x, y;
bool operator<(const scale b) const { return this->x < b.x; }
} val[MAXN];
void solve() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%d%d", &val[i].x, &val[i].y);
sort(val + 1, val + 1 + n);
int cnt = 0, yy = 0;
for (int i = 1; i <= n; i++) {
if (yy < val[i].x) {
cnt++;
yy = val[i].y;
}
}
printf("%d\n", cnt);
}
int main() {
solve();
return 0;
}
131
272 428
185 936
3 288
271 549
707 958
362 614
128 778
512 570
233 880
68 475
517 986
<1061 bytes omitted>用户输出
5
Special Judge 信息
Files user_out and answer differ
系统信息
Exited with return code 043
27 52
40 72
16 58
45 77
74 99
17 18
39 64
30 94
2 88
14 93
85 86
6 28
86 93
29 45
<200 bytes omitted>用户输出
3
Special Judge 信息
Files user_out and answer differ
系统信息
Exited with return code 047669
17877 19471
11395 15218
2902 18871
26938 27448
7762 11681
34 8895
19658 23096
1358 229
<587181 bytes omitted>用户输出
4
Special Judge 信息
Files user_out and answer differ
系统信息
Exited with return code 0706251
8804 16040
19927 24477
13287 18478
28138 29487
6264 25954
5313 29464
13205 16993
1231
<8702005 bytes omitted>用户输出
6
Special Judge 信息
Files user_out and answer differ
系统信息
Exited with return code 0