| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1366302 | kunzaZa183 | Pairs (IOI07_pairs) | C++20 | 208 ms | 295868 KiB |
#include <bits/stdc++.h>
using namespace std;
int main() {
int b, n, d, m;
cin >> b >> n >> d >> m;
if (b == 1) {
vector<int> qs(m + d + 1), vi(n);
set<int> si;
for (auto &a : vi) {
cin >> a;
qs[a]++;
si.insert(a);
}
for (int i = 1; i <= m; i++) {
qs[i] += qs[i - 1];
}
long long tot = 0;
for (auto a : si) {
long long x = qs[a] - qs[a - 1];
tot += x * (qs[a + d] - qs[a]) + x * (x - 1) / 2;
// cout << tot << "\n";
}
cout << tot << "\n";
}
}
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
