Submission #954371

#TimeUsernameProblemLanguageResultExecution timeMemory
954371codefoxPairs (IOI07_pairs)C++14
30 / 100
15 ms1124 KiB
#include<bits/stdc++.h> using namespace std; #define pii pair<int, int> #define ll long long int main() { //freopen("input.txt", "r", stdin); //freopen("output.txt", "w", stdout); ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int b, n, d, m; cin >> b >> n >> d >> m; if (b == 1) { vector<int> nums(n); for (int i =0; i < n; i++) cin >> nums[i]; sort(nums.begin(), nums.end()); ll sol = 0; queue<int> q; for (int i = 0; i < n; i++) { while (q.size() && nums[i]-q.front()> d) q.pop(); sol += q.size(); q.push(nums[i]); } cout << sol; } return 0; }
#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...