QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #254070 | #6703. Tokens on the Segments | Lionel_ZQY# | WA | 69ms | 4948kb | C++20 | 581b | 2023-11-17 23:55:27 | 2023-11-17 23:55:28 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
void solve(){
int n;
cin>>n;
vector<array<i64,2>> s(n+1);
for(int i=1;i<=n;i++){
i64 l,r;
cin>>l>>r;
s[i]={l,r};
}
sort(s.begin()+1, s.end());
int ans=0,pos=0;
for(int i=1;i<=n;i++){
if(s[i][0]>pos){
ans++;
pos=s[i][0];
}else{
if(pos>=s[i][1]) continue;
else{
pos++;
ans++;
}
}
}
cout<<ans<<'\n';
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0),cout.tie(0);
int t;
cin>>t;
while(t--){
solve();
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 1ms
memory: 3396kb
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: -100
Wrong Answer
time: 69ms
memory: 4948kb
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 17 11 18 11 8 15 15 3 4 5 9 16 14 18 16 12 8 16 15 15 11 15 11 12 4 13 13 3 5 14 9 3 17 8 8 13 7 17 4 11 17 17 6 13 14 12 15 10 6 6 11 7 12 12 17 3 13 16 14 13 7 6 6 11 13 11 3 5 3 4 10 6 3 7 18 12 13 4 9 8 14 18 10 11 10 8 4 18 16 8 16 10 14 17 13 11 6 15 14 18 10 5 8 8 9 15 8 13 14 14 13 16 16...
result:
wrong answer 3rd numbers differ - expected: '18', found: '17'