# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
118856 | tmwilliamlin168 | Examination (JOI19_examination) | C++14 | 528 ms | 26868 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;
const int mxN=1e5;
int n, q, s[mxN], t[mxN], x, a[mxN], b[mxN], c[mxN], ans[mxN];
vector<int> vs, vt[mxN+1], ft[mxN+1];
array<int, 2> d[mxN], e[mxN];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n >> q;
for(int i=0; i<n; ++i) {
cin >> s[i] >> t[i], s[i]=-s[i], t[i]=-t[i];
vs.push_back(s[i]);
d[i]={s[i]+t[i], i};
}
sort(vs.begin(), vs.end());
vs.resize(x=unique(vs.begin(), vs.end())-vs.begin());
for(int i=0; i<n; ++i) {
s[i]=lower_bound(vs.begin(), vs.end(), s[i])-vs.begin();
for(int j=s[i]+1; j<=x; j+=j&-j)
vt[j].push_back(t[i]);
}
for(int i=1; i<=x; ++i) {
sort(vt[i].begin(), vt[i].end());
vt[i].resize(unique(vt[i].begin(), vt[i].end())-vt[i].begin());
ft[i].resize(vt[i].size()+1);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |