8231 | 2024. 01. 12 22:26:04 | CWM | Háromszögek | cpp17 | Elfogadva 40/40 | 194ms | 4576 KiB |
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <climits>
using namespace std;
signed main()
{
int n, m;
cin >> n >> m;
vector<int> lenghts(n);
for (size_t i = 0; i < n; i++)
{
cin >> lenghts[i];
}
sort(lenghts.begin(), lenghts.end());
for (size_t i = 0; i < m; i++)
{
int a, b;
cin >> a >> b;
int res1 = 0;
if (lenghts[0] <= abs(a - b)) {
res1 = upper_bound(lenghts.begin(), lenghts.end(), abs(a - b))-lenghts.begin();
}
int res2 = lenghts.size();
if (lenghts[lenghts.size() - 1] >= a + b) {
res2 = lower_bound(lenghts.begin(), lenghts.end(), abs(a + b)) - lenghts.begin();
}
cout << res2 - res1 << "\n";
}
}
Részfeladat | Összpont | Teszt | Verdikt | Idő | Memória | ||
---|---|---|---|---|---|---|---|
base | 40/40 | ||||||
1 | Elfogadva | 0/0 | 3ms | 1812 KiB | |||
2 | Elfogadva | 0/0 | 3ms | 2004 KiB | |||
3 | Elfogadva | 0/0 | 16ms | 2124 KiB | |||
4 | Elfogadva | 4/4 | 4ms | 2292 KiB | |||
5 | Elfogadva | 2/2 | 4ms | 2452 KiB | |||
6 | Elfogadva | 1/1 | 167ms | 3264 KiB | |||
7 | Elfogadva | 1/1 | 153ms | 3248 KiB | |||
8 | Elfogadva | 2/2 | 153ms | 3448 KiB | |||
9 | Elfogadva | 2/2 | 155ms | 3532 KiB | |||
10 | Elfogadva | 1/1 | 143ms | 3532 KiB | |||
11 | Elfogadva | 1/1 | 140ms | 3656 KiB | |||
12 | Elfogadva | 2/2 | 142ms | 3888 KiB | |||
13 | Elfogadva | 2/2 | 143ms | 3944 KiB | |||
14 | Elfogadva | 1/1 | 177ms | 3940 KiB | |||
15 | Elfogadva | 1/1 | 162ms | 3904 KiB | |||
16 | Elfogadva | 1/1 | 184ms | 3816 KiB | |||
17 | Elfogadva | 1/1 | 180ms | 3944 KiB | |||
18 | Elfogadva | 1/1 | 179ms | 4152 KiB | |||
19 | Elfogadva | 2/2 | 149ms | 4252 KiB | |||
20 | Elfogadva | 2/2 | 159ms | 4240 KiB | |||
21 | Elfogadva | 3/3 | 187ms | 4368 KiB | |||
22 | Elfogadva | 5/5 | 194ms | 4456 KiB | |||
23 | Elfogadva | 5/5 | 181ms | 4576 KiB |