QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#228127#6703. Tokens on the SegmentsekatsimAC ✓77ms4332kbC++17953b2023-10-28 12:21:432023-10-28 12:21:44

Judging History

你现在查看的是最新测评结果

  • [2023-10-28 12:21:44]
  • 评测
  • 测评结果:AC
  • 用时:77ms
  • 内存:4332kb
  • [2023-10-28 12:21:43]
  • 提交

answer

#include<bits/stdc++.h>
#define lson(x) x<<1
#define rson(x) x<<1|1
#define inf 1000000000000000000
//#define int long long
using namespace std;
const int maxn=1e5+5;
pair<int,int>all[maxn];
void solve()
{
    priority_queue<int,vector<int>,greater<> >q;
    int n;
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        cin>>all[i].first>>all[i].second;
    }
    sort(all+1,all+n+1);
    int tail=1,ans=0;
    for(int i=0;;i++)
    {
        while(!q.empty()&&q.top()<i)
            q.pop();
        if(q.empty()&&tail>n)
            break;
        if(q.empty())
            i=all[tail].first;
        while(tail<=n&&all[tail].first==i)
            q.push(all[tail++].second);
        q.pop();
        ans++;
    }
    cout<<ans<<"\n";
}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t=1;
    cin>>t;
    while(t--)
    {
        solve();
    }
    return 0;
}


这程序好像有点Bug,我给组数据试试?

詳細信息

Test #1:

score: 100
Accepted
time: 0ms
memory: 3832kb

input:

2
3
1 2
1 1
2 3
3
1 2
1 1
2 2

output:

3
2

result:

ok 2 number(s): "3 2"

Test #2:

score: 0
Accepted
time: 77ms
memory: 4332kb

input:

10000
6
5 19
7 12
10 10
4 14
1 12
5 11
7
3 5
1 10
12 15
2 13
8 11
5 20
11 14
18
6 17
6 9
6 20
2 7
1 11
16 19
2 5
1 14
5 8
14 19
4 7
11 19
11 13
2 9
3 12
12 13
19 19
13 16
11
11 13
1 2
14 17
15 16
12 17
15 17
6 7
8 11
12 19
3 8
10 19
18
6 9
16 18
13 15
14 15
9 13
2 8
12 18
8 16
16 18
3 18
1 12
4 13
1...

output:

6
7
18
11
18
12
8
18
16
3
4
5
9
18
14
19
18
13
8
17
16
19
11
17
11
14
4
13
13
3
5
15
9
3
17
8
8
15
7
20
4
11
18
19
6
13
14
12
20
10
6
6
11
7
13
12
19
3
16
17
14
14
7
6
6
11
13
13
3
5
3
4
10
6
3
7
19
14
13
4
9
8
15
19
10
11
10
8
4
18
20
8
19
10
18
19
13
11
6
16
16
18
10
6
8
8
9
16
8
14
14
15
13
17
18...

result:

ok 10000 numbers