# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
862264 | 2023-10-17T21:27:31 Z | TAhmed33 | Osumnjičeni (COCI21_osumnjiceni) | C++ | 1000 ms | 8132 KB |
#include <bits/stdc++.h> using namespace std; int main () { int n; cin >> n; pair <int, int> arr[n + 1]; for (int i = 1; i <= n; i++) cin >> arr[i].first >> arr[i].second; int q; cin >> q; while (q--) { int l, r; cin >> l >> r; multiset <int> cur; vector <pair <int, int>> p; for (int i = l; i <= r; i++) { p.push_back(arr[i]); } sort(p.begin(), p.end()); int ans = 0; for (auto [x, y] : p) { if (cur.empty()) { cur.insert(y); ans++; continue; } auto l = cur.begin(); if (*l >= x) { cur.insert(y); ans++; } else { cur.erase(l); cur.insert(y); } } cout << ans << '\n'; } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 160 ms | 7868 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1020 ms | 652 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1020 ms | 652 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 1032 ms | 8132 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 160 ms | 7868 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |