#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
#include <algorithm>
#include <string.h>
#include <map>
#include <vector>
using namespace std;
long long x[200005],y[200005];
pair < long long , long long > all[200005];
vector < pair < pair < long long , long long > , pair < long long , long long > > > a,b;
bool F(pair < long long , long long > a,pair < long long , long long > b)
{
if(a.first>b.first) return 1;
if(a.first<b.first) return 0;
return a.second<b.second;
}
int main()
{
long long N,K,i,j,con,ok=0,ans=0;
scanf("%lld %lld",&N,&K);
for(i=0;i<N;i++) scanf("%lld %lld",&x[i],&y[i]);
for(i=1;i<=K;i++)
{
scanf("%lld",&all[i].first);
all[i].second=i;
}
all[0].first=2e9;
all[0].second=0;
sort(all,all+K+1,F);
all[K+1].first=0;
for(i=1;i<=K+1;i++)
{
con=0;
for(j=0;j<i;j++) if(all[j].second>all[i].second&&all[j].first>all[i].first) con++;
if(all[i].first!=all[i-1].first)
{
if(i%2==1) a.push_back(make_pair(make_pair(all[i].first+1,all[i-1].first),make_pair(all[i].first+1,all[i-1].first)));
if(con%2==0)
{
a.push_back(make_pair(make_pair(all[i].first+1,all[i-1].first),make_pair(0,all[i].first)));
b.push_back(make_pair(make_pair(0,all[i].first+1),make_pair(all[i].first+1,all[i-1].first)));
}
else
{
b.push_back(make_pair(make_pair(all[i].first+1,all[i-1].first),make_pair(0,all[i].first)));
a.push_back(make_pair(make_pair(0,all[i].first+1),make_pair(all[i].first+1,all[i-1].first)));
}
}
}
for(i=0;i<N;i++)
{
ok=0;
for(auto j:a) if(x[i]>=j.first.first&&x[i]<=j.first.second&&y[i]>=j.second.first&&y[i]<=j.second.second) ok=1;
if(ok) ans+=x[i];
else ans+=y[i];
}
printf("%lld\n",ans);
return 0;
}
Compilation message
fortune_telling2.cpp: In function 'int main()':
fortune_telling2.cpp:23:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
23 | scanf("%lld %lld",&N,&K);
| ~~~~~^~~~~~~~~~~~~~~~~~~
fortune_telling2.cpp:24:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
24 | for(i=0;i<N;i++) scanf("%lld %lld",&x[i],&y[i]);
| ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
fortune_telling2.cpp:27:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
27 | scanf("%lld",&all[i].first);
| ~~~~~^~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
492 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
492 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
492 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
