Submission #838862

#TimeUsernameProblemLanguageResultExecution timeMemory
838862fanwenPairs (IOI07_pairs)C++17
30 / 100
17 ms1620 KiB
#include <bits/stdc++.h> using namespace std; namespace SUB1 { void Main() { int n, d, m; cin >> n >> d >> m; vector <int> a(n); for (auto &x : a) cin >> x; sort(a.begin(), a.end()); long long ans = 0; for (int i = 1, j = 0; i < n; ++i) { while(j < i and a[i] - a[j] > d) j++; ans += i - j; } cout << ans; exit(0); } } void you_make_it(void) { int b; cin >> b; if(b == 1) SUB1::Main(); } signed main() { #ifdef LOCAL freopen("TASK.inp", "r", stdin); freopen("TASK.out", "w", stdout); #endif auto start_time = chrono::steady_clock::now(); cin.tie(0), cout.tie(0) -> sync_with_stdio(0); you_make_it(); auto end_time = chrono::steady_clock::now(); cerr << "\nExecution time : " << chrono::duration_cast <chrono::milliseconds> (end_time - start_time).count() << "[ms]" << endl; return (0 ^ 0); } // Dream it. Wish it. Do it.
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...