QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#485335 | #6703. Tokens on the Segments | Ink_bai | WA | 221ms | 5952kb | C++14 | 1015b | 2024-07-20 16:33:56 | 2024-07-20 16:33:57 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin >> n;
while(n--)
{
int m;
cin >> m;
vector<pair<int, int>> v;
for(int i=0; i<m; i++)
{
int x1, x2;
cin >> x1 >> x2;
v.push_back({x1, x2});
}
sort(v.begin(), v.end());
vector<pair<int, int>> v1;
v1.push_back(v[0]);
for(int i=1; i<m; i++)
{
for(auto &t: v1)
{
if(v[i].first > t.second)
{
v1.push_back(v[i]);
break;
}
else
{
t.second = max(t.second, v[i].second);
break;
}
}
}
int sum = 0;
for(auto t: v1)
{
sum += t.second - t.first + 1;
}
cout << min(sum, m) << endl;
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3848kb
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: 221ms
memory: 5952kb
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 20 18 14 8 17 16 19 11 17 11 14 4 13 13 3 5 15 9 3 17 8 8 15 7 20 4 11 19 19 6 13 14 12 20 10 6 6 11 7 13 12 19 3 16 18 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 20 13 11 6 16 16 19 10 6 8 8 9 16 8 14 14 15 13 17 18...
result:
wrong answer 16th numbers differ - expected: '19', found: '20'