# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
760357 | qwerasdfzxcl | Double Attendance (CCO22_day1problem3) | C++17 | 6 ms | 5124 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;
typedef long long ll;
constexpr int INF = 2e9 + 200;
int n[2], k, dist[2][600600];
pair<int, int> a[2][300300];
priority_queue<array<int, 3>, vector<array<int, 3>>, greater<array<int, 3>>> pq;
int getidx(int t, int p){
return upper_bound(a[t]+1, a[t]+n[t]+1, pair<int, int>(p, INF)) - a[t] - 1;
}
int calc(int t, int l, int r){
int li = getidx(t, l), ri = getidx(t, r);
return ri - li + (a[t][li].first <= l && l < a[t][li].second);
}
void push(int t, int c, int d){
if (dist[t][c] <= d) return;
dist[t][c] = d;
pq.push({d, t, c});
}
int main(){
scanf("%d %d %d", &n[0], &n[1], &k);
for (int i=0;i<2;i++){
for (int j=1;j<=n[i];j++){
scanf("%d %d", &a[i][j].first, &a[i][j].second);
}
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... |