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>用户输出
38Special Judge 信息
Files user_out and answer differ
系统信息
Exited with return code 0| 编号 | 题目 | 状态 | 分数 | 总时间 | 内存 | 代码 / 答案文件 | 提交者 | 提交时间 |
|---|---|---|---|---|---|---|---|---|
| #71988 | #1021. jwp的区间游戏 | Wrong Answer | 0 | 1453 ms | 13492 K | C++ 17 / 508 B | Rhodoks | 2022-06-30 11:09:31 |
#include <bits/stdc++.h>
using namespace std;
struct qujian {
int t;
int f;
} a[2000005];
bool cmp(struct qujian x, struct qujian y) {
if (x.t < y.t)
return 1;
if (x.t > y.t)
return 0;
if (x.f)
return 1;
return 0;
}
int main() {
int n;
cin >> n;
int temp = 1;
for (int i = 1; i <= 2 * n; i++) cin >> a[i].t, a[i].f = temp % 2, temp++;
sort(a + 1, a + 2 * n + 1, cmp);
long long ans = 0;
temp = 0;
for (int i = 1; i <= 2 * n; i++) {
if (a[i].f)
temp = 1;
else if (temp)
ans++, temp = 0;
}
cout << ans;
return 0;
}
// day2 B131
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>用户输出
38Special 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>用户输出
14Special 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>用户输出
14010Special 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>用户输出
31260Special Judge 信息
Files user_out and answer differ
系统信息
Exited with return code 0