# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
159082 | TadijaSebez | Worst Reporter 2 (JOI16_worst_reporter2) | C++11 | 2 ms | 508 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 N=200050;
int a[N],b[N],c[N],d[N];
int main()
{
int n;
scanf("%i",&n);
for(int i=1;i<=n;i++) scanf("%i %i",&a[i],&b[i]);
for(int i=1;i<=n;i++) scanf("%i %i",&c[i],&d[i]);
map<int,int> cnt;
int all=0,ans=n;
for(int i=n,j=n;i>=1;i--)
{
for(;j>=1 && b[j]<=d[i];j--)
{
cnt[a[j]]++;
all++;
}
if(cnt[c[i]])
{
cnt[c[i]]--;
ans--;
}
all--;
if(all==0) cnt.clear();
}
printf("%i\n",ans);
return 0;
}
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... |