Submission #654285

#TimeUsernameProblemLanguageResultExecution timeMemory
654285four_specksPairs (IOI07_pairs)C++17
30 / 100
38 ms7572 KiB
#include <bits/stdc++.h> using namespace std; inline namespace { } // namespace void solve() { int b; int n; long m, d; cin >> b >> n >> d >> m; vector board(n, vector<long>(b)); for (int i = 0; i < n; i++) { for (long &x : board[i]) cin >> x, --x; } long cnt = 0; if (b == 1) { vector<long> a(n); for (int i = 0; i < n; i++) a[i] = board[i][0]; sort(a.begin(), a.end()); for (int i = 0; i < n; i++) cnt += i - (lower_bound(a.begin(), a.end(), a[i] - d) - a.begin()); } else if (b == 2) { } else if (b == 3) { } cout << cnt << '\n'; } int main() { ios_base::sync_with_stdio(false), cin.tie(NULL); solve(); 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...