# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
494934 | Christopher_ | Trading (IZhO13_trading) | C++17 | 0 ms | 208 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, q;
cin >> n >> q;
vector<pair<int,int>> g(n);
vector<int> dist(n);
for (int i = 0; i < q; ++i) {
int l, r, x;
cin >> l >> r >> x;
--l, --r;
g[l] = max(g[l], {x, r - l});
}
priority_queue<pair<int,int>> pq;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |