#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define pb emplace_back
#define lb(v,k) (lower_bound(all(v),(k))-v.begin())
#define ub(v,k) (upper_bound(all(v),(k))-v.begin())
#define fi first
#define se second
#define pi M_PI
#define PQ(T) priority_queue<T>
#define SPQ(T) priority_queue<T,vector<T>,greater<T>>
#define dame(a) {out(a);return 0;}
#define decimal cout<<fixed<<setprecision(15);
#define all(a) a.begin(),a.end()
#define rsort(a) {sort(all(a));reverse(all(a));}
#define dupli(a) {sort(all(a));a.erase(unique(all(a)),a.end());}
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef tuple<ll,ll,ll,ll> PPP;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
using vvvvi=vector<vvvi>;
using vp=vector<P>;
using vvp=vector<vp>;
using vb=vector<bool>;
using vvb=vector<vb>;
const ll inf=1001001001001001001;
const ll INF=1001001001;
const ll mod=1000000007;
const double eps=1e-10;
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}
template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';}
template<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}
template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}
template<class T> void yesno(T b){if(b)out("yes");else out("no");}
template<class T> void YesNo(T b){if(b)out("Yes");else out("No");}
template<class T> void YESNO(T b){if(b)out("YES");else out("NO");}
template<class T> void outset(T s){auto itr=s.begin();while(itr!=s.end()){if(itr!=s.begin())cout<<' ';cout<<*itr;itr++;}cout<<'\n';}
void outs(ll a,ll b){if(a>=inf-100)out(b);else out(a);}
ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}
ll modpow(ll a,ll b){ll res=1;a%=mod;while(b){if(b&1)res=res*a%mod;a=a*a%mod;b>>=1;}return res;}
class BIT{
vi bit;
public:
BIT(ll n):bit(n){}
void add(ll i,ll x){
for(int j=i;j<bit.size();j=j|(j+1))bit[j]+=x;
}
ll get(ll i){
ll res=0;
for(int j=i;j>=0;j=((j+1)&j)-1)res+=bit[j];
return res;
}
ll get(ll a,ll b){
return get(b-1)-get(a-1);
}
};
queue<ll> que;
class segtree{
ll N=1;
vvp segl,segr;
void add(ll id,ll a,ll b,ll k,ll l,ll r){
if(r-l==1){
segl[k].pb(a,id);
segr[k].pb(b,id);
return;
}
ll md=(l+r)/2;
if(md<=a)add(id,a,b,k*2+2,md,r);
else if(md>=b)add(id,a,b,k*2+1,l,md);
else{
segl[k].pb(a,id);
segr[k].pb(b,id);
}
}
public:
segtree(vp v){
while(N<v.size())N*=2;
segl=vvp(N*2-1);segr=vvp(N*2-1);
rep(i,v.size())if(v[i].fi!=v[i].se)add(i,v[i].fi,v[i].se,0,0,N);
rep(i,N*2-1){
sort(all(segr[i]));
rsort(segl[i]);
}
}
void query(ll x){
ll k=x+N-1,l=x,r=x+1,cnt=0;
while(segl[k].size()){
que.push(segl[k].back().se);segl[k].pop_back();
}
while(k>0){
k=(k-1)/2;
if(l>>cnt&1)l-=1<<cnt;
if(r>>cnt&1)r+=1<<cnt;
cnt++;
ll md=(l+r)/2;
// cout<<' '<<md<<endl;
if(md<=x){
while(segr[k].size()&&segr[k].back().fi>x){
que.push(segr[k].back().se);segr[k].pop_back();
}
}
else{
while(segl[k].size()&&segl[k].back().fi<=x){
// out(x);
que.push(segl[k].back().se);segl[k].pop_back();
}
}
}
}
};
int main(){
ll n,k;cin>>n>>k;
vp v(n);
rep(i,n)cin>>v[i].fi>>v[i].se;
vb swapped(n,false);
rep(i,n){
if(v[i].fi>v[i].se){
swap(v[i].fi,v[i].se);
swapped[i]=true;
}
}
vi t(k);
rep(i,k)cin>>t[i];
vi srt;
rep(i,n){
srt.pb(v[i].fi);srt.pb(v[i].se);
}
rep(i,k)srt.pb(t[i]);
dupli(srt);
BIT bit(srt.size());
vp id(n);
rep(i,n){
id[i].fi=lb(srt,v[i].fi);
id[i].se=lb(srt,v[i].se);
}
vb done(n,false);
ll ans=0;
rep(i,n)if(v[i].fi==v[i].se){
ans+=v[i].fi;done[i]=true;
}
segtree seg(id);
// outvp(id);
for(int i=k-1;i>=0;i--){
ll l=lb(srt,t[i]);
// seg.query(l);
while(!que.empty()){
ll u=que.front();que.pop();
if(done[u])continue;
// cout<<l<<' '<<u<<endl;
done[u]=true;
ll num=bit.get(id[u].se,srt.size());
if(num&1)ans+=v[u].fi;
else ans+=v[u].se;
}
bit.add(l,1);
}
rep(j,n)if(!done[j]){
ll num=bit.get(id[j].se,srt.size());
if(swapped[j])num++;
if(num&1)ans+=v[j].se;
else ans+=v[j].fi;
}
out(ans);
}
Compilation message
fortune_telling2.cpp: In member function 'void BIT::add(ll, ll)':
fortune_telling2.cpp:55:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
55 | for(int j=i;j<bit.size();j=j|(j+1))bit[j]+=x;
| ~^~~~~~~~~~~
fortune_telling2.cpp: In constructor 'segtree::segtree(vp)':
fortune_telling2.cpp:86:16: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
86 | while(N<v.size())N*=2;
| ~^~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
