結果

問題 No.1708 Quality of Contest
ユーザー eQeeQe
提出日時 2022-07-28 07:57:48
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 122 ms / 2,000 ms
コード長 18,066 bytes
コンパイル時間 10,093 ms
コンパイル使用メモリ 461,452 KB
実行使用メモリ 24,076 KB
最終ジャッジ日時 2024-07-17 22:13:25
合計ジャッジ時間 11,799 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,812 KB
testcase_01 AC 2 ms
6,940 KB
testcase_02 AC 2 ms
6,940 KB
testcase_03 AC 3 ms
6,944 KB
testcase_04 AC 4 ms
6,940 KB
testcase_05 AC 3 ms
6,940 KB
testcase_06 AC 3 ms
6,944 KB
testcase_07 AC 2 ms
6,940 KB
testcase_08 AC 2 ms
6,940 KB
testcase_09 AC 111 ms
24,076 KB
testcase_10 AC 86 ms
20,044 KB
testcase_11 AC 94 ms
17,692 KB
testcase_12 AC 100 ms
18,712 KB
testcase_13 AC 90 ms
17,048 KB
testcase_14 AC 100 ms
20,032 KB
testcase_15 AC 122 ms
21,984 KB
testcase_16 AC 103 ms
21,812 KB
testcase_17 AC 96 ms
19,480 KB
testcase_18 AC 95 ms
19,788 KB
testcase_19 AC 98 ms
21,424 KB
testcase_20 AC 91 ms
19,368 KB
testcase_21 AC 98 ms
19,836 KB
testcase_22 AC 94 ms
18,964 KB
testcase_23 AC 102 ms
22,368 KB
testcase_24 AC 78 ms
15,508 KB
testcase_25 AC 77 ms
15,772 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

//#ifdef ONLINE_JUDGE
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<atcoder/all>
#include<boost/multiprecision/cpp_int.hpp>
//#endif
#include<bits/stdc++.h>
namespace my{

namespace my{
#define fin(...) exit(pp(__VA_ARGS__))
#define ep(...) emplace(__VA_ARGS__)
#define eb(...) emplace_back(__VA_ARGS__)
#define pb() pop_back()
#define ef(...) emplace_front(__VA_ARGS__)
#define pf(a) pop_front(a)
#define ei(...) else if(__VA_ARGS__)
#define el else
#define wh(...) while(__VA_ARGS__)
#define lb(...) lower_bound(__VA_ARGS__)
#define ub(...) upper_bound(__VA_ARGS__)
#define itmax(...) max_element(al(__VA_ARGS__))
#define itmin(...) min_element(al(__VA_ARGS__))
#define srt(...) sort(al(__VA_ARGS__))
#define rev(...) reverse(al(__VA_ARGS__))
#define uq(a) srt(a);a.erase(unique(al(a)),end(a))
#define jo(a,b) copy(al(b),back_inserter(a))
#define ov3(a,b,c,d,...) d
#define ov4(a,b,c,d,e,...) e
#define ov5(a,b,c,d,e,f,...) f
#define ov6(a,b,c,d,e,f,g,...) g
#define bg begin
#define rbg rbegin
#define al1(v) bg(v),end(v)
#define al2(v,b) bg(v),bg(v)+b
#define al3(v,a,b) bg(v)+a,bg(v)+b
#define al(...) ov3(__VA_ARGS__,al3,al2,al1)(__VA_ARGS__)
#define rl1(v) rbg(v),rend(v)
#define rl2(v,b) rbg(v),rbg(v)+b
#define rl3(v,a,b) rbg(v)+a,rbg(v)+b
#define rl(...) ov3(__VA_ARGS__,rl3,rl2,rl1)(__VA_ARGS__)
#define rp1(b) fo(ll ii=0;ii<(ll)(b);ii++)
#define rp2(i,b) fo(ll i=0;i<(ll)(b);i++)
#define rp3(i,a,b) fo(ll i=(ll)(a);i<(ll)(b);i++)
#define rp4(i,a,b,c) fo(ll i=(ll)(a);i<(ll)(b);i+=(ll)(c))
#define rp(...) ov4(__VA_ARGS__,rp4,rp3,rp2,rp1)(__VA_ARGS__)
#define pr1(a) rp(a)
#define pr2(i,a) fo(ll i=(ll)(a)-1;i>=0;i--)
#define pr3(i,a,b) fo(ll i=(ll)(a)-1;i>=(ll)(b);i--)
#define pr4(i,a,b,c) fo(ll i=(ll)(a)-1;i>=(ll)(b);i-=(ll)(c))
#define pr(...) ov4(__VA_ARGS__,pr4,pr3,pr2,pr1)(__VA_ARGS__)
#define fe1(a) rp(len(a))
#define fe2(a,v) fo(au&&a:v)
#define fe3(a,b,v) fo(au&&[a,b]:v)
#define fe4(a,b,c,v) fo(au&&[a,b,c]:v)
#define fe5(a,b,c,d,v) fo(au&&[a,b,c,d]:v)
#define fe(...) ov5(__VA_ARGS__,fe5,fe4,fe3,fe2,fe1)(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;li(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__;li(__VA_ARGS__)
#define STR(...) str __VA_ARGS__;li(__VA_ARGS__)
#define UL2(n,a) u1 a(n);li(a)
#define UL3(n,a,b) u1 a(n),b(n);li(a,b)
#define UL4(n,a,b,c) u1 a(n),b(n),c(n);li(a,b,c)
#define UL5(n,a,b,c,d) u1 a(n),b(n),c(n),d(n);li(a,b,c,d)
#define UL6(n,a,b,c,d,e) u1 a(n),b(n),c(n),d(n),e(n);li(a,b,c,d,e)
#define UL(...) ov6(__VA_ARGS__,UL6,UL5,UL4,UL3,UL2)(__VA_ARGS__)
#define UV2(n,a) u1 a(n);vi(a)
#define UV3(n,a,b) u1 a(n),b(n);vi(a,b)
#define UV4(n,a,b,c) u1 a(n),b(n),c(n);vi(a,b,c)
#define UV5(n,a,b,c,d) u1 a(n),b(n),c(n),d(n);vi(a,b,c,d)
#define UV6(n,a,b,c,d,e) u1 a(n),b(n),c(n),d(n),e(n);vi(a,b,c,d,e)
#define UV(...) ov6(__VA_ARGS__,UV6,UV5,UV4,UV3,UV2)(__VA_ARGS__)
#define DL2(n,a) v1<ld>a(n);li(a)
#define DL3(n,a,b) v1<ld>a(n),b(n);li(a,b)
#define DL4(n,a,b,c) v1<ld>a(n),b(n),c(n);li(a,b,c)
#define DL5(n,a,b,c,d) v1<ld>a(n),b(n),c(n),d(n);li(a,b,c,d)
#define DL(...) ov5(__VA_ARGS__,DL5,DL4,DL3,DL2)(__VA_ARGS__)
#define DV2(n,a) v1<ld>a(n);vi(a)
#define DV3(n,a,b) v1<ld>a(n),b(n);vi(a,b)
#define DV4(n,a,b,c) v1<ld>a(n),b(n),c(n);vi(a,b,c)
#define DV5(n,a,b,c,d) v1<ld>a(n),b(n),c(n),d(n);vi(a,b,c,d)
#define DV(...) ov5(__VA_ARGS__,DV5,DV4,DV3,DV2)(__VA_ARGS__)
#define aa2(a,b) ((a) an (b))
#define aa3(a,b,c) ((a) an (b) an (c))
#define aa4(a,b,c,d) ((a) an (b) an (c) an (d))
#define aa5(a,b,c,d,e) ((a) an (b) an (c) an (d) an (e))
#define aa6(a,b,c,d,e,f) ((a) an (b) an (c) an (d) an (e) an (f))
#define aa(...) ov6(__VA_ARGS__,aa6,aa5,aa4,aa3,aa2)(__VA_ARGS__)
#define oo2(a,b) ((a) or (b))
#define oo3(a,b,c) ((a) or (b) or (c))
#define oo4(a,b,c,d) ((a) or (b) or (c) or (d))
#define oo5(a,b,c,d,e) ((a) or (b) or (c) or (d) or (e))
#define oo6(a,b,c,d,e,f) ((a) or (b) or (c) or (d) or (e) or (f))
#define oo(...) ov6(__VA_ARGS__,oo6,oo5,oo4,oo3,oo2)(__VA_ARGS__)
#define I template
#define J class
#define rr return
#define ss struct
#define uu using
#define an and
#define as assert
#define au auto
#define bk break
#define cs const
#define ct continue
#define endl "\n"
#define fd friend
#define fo for
#define op operator
#define stc static
#define th this
}//def

namespace my{
//#ifdef ONLINE_JUDGE
uu namespace atcoder;
uu namespace boost::multiprecision;
uu mint=modint1000000007;
//endif
uu namespace std;
uu ll=long long;
uu ld=long double;
uu ul=unsigned long long;
uu cha=char;
uu str=string;
uu bo=bool;
uu vo=void;
uu is=istream;
uu os=ostream;
str sp=" ",nc="",nl="\n";
au np=nullptr;
I<J T>uu v1=vector<T>;
I<J T>uu v2=v1<v1<T>>;
I<J T>uu v3=v1<v2<T>>;
I<J T>uu v4=v1<v3<T>>;
I<J T>uu mset=multiset<T>;
I<J T>uu fn=function<T>;
I<J T>uu pqmax=priority_queue<T>;
I<J T>uu pqmin=priority_queue<T,v1<T>,greater<T>>;
I<J A,J B>ss cp{
  A a;B b;
  cp():a(A()),b(B()){}
  cp(A a,B b):a(a),b(b){}
  cp op+()cs{rr*th;}
  cp op-()cs{rr cp(-a,-b);}
  cp&op++(){a++,b++;rr*th;}
  cp&op--(){a--,b--;rr*th;}
  cp op++(int){cp r=*th;++*th;rr r;}
  cp op--(int){cp r=*th;--*th;rr r;}
  cp&op+=(cs cp&c){a+=c.a;b+=c.b;rr*th;}
  cp&op-=(cs cp&c){a-=c.a;b-=c.b;rr*th;}
  cp&op*=(cs cp&c){a*=c.a;b*=c.b;rr*th;}
  cp op+(cs cp&c)cs{rr cp(*th)+=c;}
  cp op-(cs cp&c)cs{rr cp(*th)-=c;}
  cp op*(cs cp&c)cs{rr cp(*th)*=c;}
  cp&op+=(cs A&d){a+=d;b+=d;rr*th;}
  cp&op-=(cs A&d){a-=d;b-=d;rr*th;}
  cp&op*=(cs A&d){a*=d;b*=d;rr*th;}
  cp op+(cs A&d)cs{rr cp(*th)+=d;}
  cp op-(cs A&d)cs{rr cp(*th)-=d;}
  cp op*(cs A&d)cs{rr cp(*th)*=d;}
  bo op==(cs cp&c)cs{rr aa(a==c.a,b==c.b);}
  bo op!=(cs cp&c)cs{rr!(*th==c);}
  bo op<(cs cp&c)cs{rr a!=c.a?a<c.a:b<c.b;}
  bo op>(cs cp&c)cs{rr a!=c.a?a>c.a:b>c.b;}
  bo op<=(cs cp&c)cs{rr!(*th>c);}
  bo op>=(cs cp&c)cs{rr!(*th<c);}
  fd is&op>>(is&i,cp&c){rr i>>c.a>>c.b;}
  fd os&op<<(os&o,cs cp&c){rr o<<c.a<<sp<<c.b;}
};
I<J A,J B,J C>ss tr{
  A a;B b;C c;
  tr():a(A()),b(B()),c(C()){}
  tr(A a,B b,C c):a(a),b(b),c(c){}
  bo op==(cs tr&t)cs{rr aa(a==t.a,b==t.b,c==t.c);}
  bo op!=(cs tr&t)cs{rr!(*th==t);}
  bo op<(cs tr&t)cs{rr a!=t.a?a<t.a:b!=t.b?b<t.b:c<t.c;}
  bo op>(cs tr&t)cs{rr a!=t.a?a>t.a:b!=t.b?b>t.b:c>t.c;}
  bo op<=(cs tr&t)cs{rr!(*th>t);}
  bo op>=(cs tr&t)cs{rr!(*th<t);}
  fd is&op>>(is&i,tr&t){rr i>>t.a>>t.b>>t.c;}
  fd os&op<<(os&o,cs tr&t){rr o<<t.a<<sp<<t.b<<sp<<t.c;}
};
I<J A,J B,J C,J D>ss qu{
  A a;B b;C c;D d;
  qu():a(A()),b(B()),c(C()),d(D()){}
  qu(A a,B b,C c,D d):a(a),b(b),c(c),d(d){}
  bo op==(cs qu&q)cs{rr aa(a==q.a,b==q.b,c==q.c,d==q.d);}
  bo op!=(cs qu&q)cs{rr!(*th==q);}
  bo op<(cs qu&q)cs{rr a!=q.a?a<q.a:b!=q.b?b<q.b:c!=q.c?c<q.c:d<q.d;}
  bo op>(cs qu&q)cs{rr a!=q.a?a>q.a:b!=q.b?b>q.b:c!=q.c?c>q.c:d>q.d;}
  bo op<=(cs qu&q)cs{rr!(*th>q);}
  bo op>=(cs qu&q)cs{rr!(*th<q);}
  fd is&op>>(is&i,qu&q){rr i>>q.a>>q.b>>q.c>>q.d;}
  fd os&op<<(os&o,cs qu&q){rr o<<q.a<<sp<<q.b<<sp<<q.c<<sp<<q.d;}
};
uu u1=v1<ll>;
uu u2=v1<u1>;
uu u3=v1<u2>;
uu u4=v1<u3>;
uu cl=cp<ll,ll>;
uu ql=queue<ll>;
uu sl=set<ll>;
uu msl=mset<ll>;
uu ml=map<ll,ll>;
ss edg{ll t,w;edg(){}edg(ll t,ll w=1):t(t),w(w){}};
uu graph=v2<edg>;
ll inf=3e18;
ld pi=acosl(-1);
ld ee=1e-10;
u1 dx={-1,0,1,0,-1,1,1,-1};
u1 dy={0,-1,0,1,-1,-1,1,1};
str first(bo t=1){rr t?"first":"second";}
str First(bo t=1){rr t?"First":"Second";}
str yes(bo t=1){rr t?"yes":"no";}
str Yes(bo t=1){rr t?"Yes":"No";}
str YES(bo t=1){rr t?"YES":"NO";}
str no(){rr "no";}
str No(){rr "No";}
str NO(){rr "NO";}
str possible(bo t=1){rr t?"possible":"impossible";}
str Possible(bo t=1){rr t?"Possible":"Impossible";}
str POSSIBLE(bo t=1){rr t?"POSSIBLE":"IMPOSSIBLE";}
}//var

namespace my{
ul rnd(){
  stc ul x=123456789,y=362436069,z=521288629,w=88675123;
  ul t=(x^(x<<11));
  x=y,y=z,z=w;
  rr(w=(w^(w>>19))^(t^(t>>8)));
}
ld rnd_prob(){rr (ld)rnd()/UINT_MAX;}
ll rnd_rng(ll r){rr rnd()%r;}
ll rnd_rng(ll l,ll r){rr rnd()%(r-l)+l;}

ll bit(ll a){rr 1LL<<a;}
ll ppc(ll a){rr __builtin_popcountll(a);}
ll sqr(ll x){ll r=sqrtl(x)-1;wh(r+1<=x/(r+1))r++;rr r;}
ll lg2(ll n){ll r=0;wh(n){n/=2;r++;}rr r;}
str to_str(cha a){rr str()+a;}
I<J T>str to_str(T a){rr to_string(a);}
I<J T>ll len(cs T&a){rr a.size();}
I<J T>T sq(T a){rr a*a;}
I<J T,J U>au cei(T a,U b){rr (a+b-1)/b;}
ll at(ll S,ll i){rr S>>i&1;}
I<J T>T at(cs v1<T>&v,ll i){ll n=len(v);rr v[(i%n+n)%n];}
I<J T>ll sgn(cs T&a){rr(a>ee)-(a<-ee);}
I<J T,J U>ll sgn(cs T&a,cs U&b){rr sgn(a-b);}
}//fn simple

namespace my{
I<J T>au&op+(v1<T>&v){rr v;}
I<J T>au&op-(v1<T>&v){fe(x,v)x=-x;rr v;}
I<J T>au&op++(v1<T>&v){fe(x,v)x++;rr v;}
I<J T>au&op--(v1<T>&v){fe(x,v)x--;rr v;}
I<J T>au op++(v1<T>&v,int){au r=v;++v;rr r;}
I<J T>au op--(v1<T>&v,int){au r=v;--v;rr r;}
I<J T>au&op+=(v1<T>&v,cs v1<T>&u){rp(i,len(v))v[i]+=u[i];rr v;}
I<J T>au&op-=(v1<T>&v,cs v1<T>&u){rp(i,len(v))v[i]-=u[i];rr v;}
I<J T>au&op*=(v1<T>&v,cs v1<T>&u){rp(i,len(v))v[i]*=u[i];rr v;}
I<J T>au op+(v1<T>v,cs v1<T>&u){rr v+=u;}
I<J T>au op-(v1<T>v,cs v1<T>&u){rr v-=u;}
I<J T>au op*(v1<T>v,cs v1<T>&u){rr v*=u;}
I<J T,J U>au&op+=(v1<T>&v,cs U&a){fe(x,v)x+=a;rr v;}
I<J T,J U>au&op-=(v1<T>&v,cs U&a){fe(x,v)x-=a;rr v;}
I<J T,J U>au&op*=(v1<T>&v,cs U&a){fe(x,v)x*=a;rr v;}
I<J T,J U>au op+(v1<T>v,cs U&a){rr v+=a;}
I<J T,J U>au op-(v1<T>v,cs U&a){rr v-=a;}
I<J T,J U>au op*(v1<T>v,cs U&a){rr v*=a;}
I<J T,J U>bo amax(T&a,cs U&b){rr a<b?a=b,1:0;}
I<J T,J U>bo amin(T&a,cs U&b){rr a>b?a=b,1:0;}
I<J T>T max(cs v1<T>&a){rr *itmax(a);}
I<J T>T min(cs v1<T>&a){rr *itmin(a);}
I<J T>au max(cs v2<T>&a){rr max(*itmax(a));}
I<J T>au min(cs v2<T>&a){rr min(*itmin(a));}
I<J...T>au max(T...a){rr max(initializer_list<common_type_t<T...>>{a...});}
I<J...T>au min(T...a){rr min(initializer_list<common_type_t<T...>>{a...});}
I<J T>ll argmax(cs v1<T>&a){rr itmax(a)-bg(a);}
I<J T>ll argmin(cs v1<T>&a){rr itmin(a)-bg(a);}
I<J T,J...A>T gcd(cs T&a,cs A&...b){rr gcd(a,gcd(b...));}
I<J T>T sum(cs v1<T>&a){rr accumulate(al(a),T(0));}
I<J T,J U>ll lbs(cs v1<T>&a,cs U&b){rr lb(al(a),b)-bg(a);}
I<J T,J U>ll ubs(cs v1<T>&a,cs U&b){rr ub(al(a),b)-bg(a);}
I<J T,J U>au minmax(cs T&a,cs U&b){rr cp(min(a,b),max(a,b));}
I<J T,J U>au minmax(cs cp<T,U>&p){rr minmax(p.a,p.b);}
I<J T>vo emplace_front(v1<T>&v,T x=0){v.ep(bg(v),x);}
I<J T>vo pop_front(v1<T>&v){v.erase(bg(v));}
I<J X,J Y>au mp(cs fn<Y(X)>&f,v1<X>x){v1<Y>y;fe(a,x)y.eb(f(a));rr y;}
I<J T,J U>au keys(cs map<T,U>&m){v1<T>r;fe(k,z,m)r.eb(k);rr r;}
I<J T,J U>au vals(cs map<T,U>&m){v1<U>r;fe(z,v,m)r.eb(v);rr r;}
u1 io(ll n,ll a=0){u1 i(n);iota(al(i),a);rr i;}
I<J T>T gp(queue<T>&q){T r=q.front();q.pop();rr r;}
I<J T>T gp(pqmax<T>&q){T r=q.top();q.pop();rr r;}
I<J T>T gp(pqmin<T>&q){T r=q.top();q.pop();rr r;}
}//STL

namespace my{
ss z{z(){cin.tie(0);ios::sync_with_stdio(0);cout<<fixed<<setprecision(10);}}z;
is&op>>(is&i,mint&x){ll t;i>>t;x=t;rr i;}
os&op<<(os&o,cs mint&x){rr o<<x.val();}
I<J T,J U>is&op>>(is&i,pair<T,U>&p){rr i>>p.first>>p.second;}
I<J T,J U>os&op<<(os&o,cs pair<T,U>&p){rr o<<p.first<<sp<<p.second;}
I<J T>is&op>>(is&i,v1<T>&v){fe(x,v)i>>x;rr i;}
I<J T>os&op<<(os&o,cs v1<T>&v){fe(x,v)o<<x<<(&x==&*rbg(v)?nc:sp);rr o;}
I<J T>os&op<<(os&o,cs v2<T>&v){fe(x,v)o<<x<<(&x==&*rbg(v)?nc:nl);rr o;}
I<J T>os&op<<(os&o,cs set<T>&s){fe(x,s)o<<x<<(&x==&*rbg(s)?nc:sp);rr o;}
I<J T>os&op<<(os&o,cs mset<T>&s){fe(x,s)o<<x<<(&x==&*rbg(s)?nc:sp);rr o;}
I<J T,J U>os&op<<(os&o,cs map<T,U>&m){fe(p,m)o<<p<<(&p==&*rbg(m)?nc:nl);rr o;}
I<J T>os&op<<(os&o,queue<T>q){wh(len(q))o<<q.front()<<sp,q.pop();rr o;}
I<J T>os&op<<(os&o,deque<T>q){wh(len(q))o<<q.front()<<sp,q.pop_front();rr o;}
I<J T>os&op<<(os&o,pqmax<T>q){wh(len(q))o<<q.top()<<sp,q.pop();rr o;}
I<J T>os&op<<(os&o,pqmin<T>q){wh(len(q))o<<q.top()<<sp,q.pop();rr o;}
ll pp(){cout<<endl;rr 0;}
I<J T,J...A>ll pp(cs T&a,cs A&...b){cout<<a;((cout<<sp<<b),...);rr pp();}
I<J...T>vo li(T&...a){(cin>>...>>a);}
I<J...T>vo vi(ll i,T&...a){(cin>>...>>a[i]);}
I<J T,J...A>vo vi(v1<T>&a,A&...b){rp(i,len(a))vi(i,a,b...);}
I<J T>vo rs(v1<T>&v,ll n){v.resize(n);}
I<J T,J...A>vo rs(v1<T>&V,ll n,cs A&...a){rs(V,n);fe(v,V)rs(v,a...);}
I<J T,J U>vo fl(T&x,cs U&a){x=a;}
I<J T,J U>vo fl(v1<T>&V,cs U&a){fe(v,V)fl(v,a);}
vo gi(u2&g,ll m,bo d=1){rp(i,m){LL(a,b);a--,b--;g[a].eb(b);if(d)g[b].eb(a);}}
vo gi(graph&g,ll m,bo w=1,bo d=1){
  rp(i,m){
    LL(a,b);a--,b--;ll c=1;if(w)li(c);
    g[a].eb(b,c);if(d)g[b].eb(a,c);
  }
}
vo ti(u2&g,bo d=1){gi(g,len(g)-1,d);}
vo ti(graph&g,bo w=1,bo d=1){gi(g,len(g)-1,w,d);}
}//io

namespace my{
vo pz(cs u1&v,u1&h){fe(x,h)x=lbs(v,x);}
I<J...T>vo pz(cs u1&v,u1&h,T&...t){pz(v,h);pz(v,t...);}
I<J...T>u1 zp(T&...a){u1 v;fe(e,{a...})jo(v,e);uq(v);pz(v,a...);rr v;}
I<J T>vo vs(cs u1&o,v1<T>&a){au c=a;rp(i,len(a))a[i]=c[o[i]];}
I<J T,J...A>vo vs(cs u1&o,v1<T>&a,A&...b){vs(o,a);vs(o,b...);}
I<J...T>au vs(cs fn<bo(ll,ll)>&f,T&...a){
  ll n=0;fe(e,{a...})n=len(e);
  u1 o=io(n),p(n);
  sort(al(o),f);
  rp(i,n)p[o[i]]=i;
  vs(o,a...);
  rr cp(o,p);
}
I<J T>T bs(cs fn<bo(T)>&j,T o,T n){
  T d=(T)ee?ee:1;
  wh(abs(o-n)>d)(j((o+n)/2)?o:n)=(o+n)/2;
  rr o;
}
I<J T>au zet(v1<T>a){rp(i,1,len(a))a[i]+=a[i-1];rr a;}
I<J T>au moe(v1<T>a){pr(i,len(a),1)a[i]-=a[i-1];rr a;}
I<J T>au zet(v2<T>a){fe(v,a)v=zet(v);rp(i,1,len(a))a[i]+=a[i-1];rr a;}
I<J T>au moe(v2<T>a){fe(v,a)v=moe(v);pr(i,len(a),1)a[i]-=a[i-1];rr a;}
vo wafl(u2&d){ll n=len(d);rp(k,n)rp(i,n)rp(j,n)amin(d[i][j],d[i][k]+d[k][j]);}
I<J T>T exq(T x,ll n,T e){wh(n){if(n&1)e*=x;x*=x;n/=2;}rr e;}
u1 divs(ll n){ml m;rp(i,1,n/i+1)if(n%i==0)m[i]++,m[n/i]++;rr keys(m);}
ml fact(ll n){ml m;rp(i,2,n/i+1)wh(n%i==0)m[i]++,n/=i;if(n>1)m[n]++;rr m;}
ll pow(ll x,ll n,ll m=inf){ll r=1;wh(n){if(n&1)r*=x,r%=m;x*=x,x%=m,n/=2;}rr r;}
ll inv(ll a,ll m){
  ll b=m,u=1,v=0;
  wh(b)u-=a/b*v,swap(u,v),a-=a/b*b,swap(a,b);
  rr(u%m+m)%m;
}
I<J T>ll mrgc(v1<T>&a){
  ll n=len(a);
  if(n<=1)rr 0;
  v1<T>b(al(a,n/2)),c(al(a,n/2,n));
  ll cnt=mrgc(b)+mrgc(c);
  fo(ll i=0,j=0,k=0;i<n;){
    if(aa(j<len(b),oo(k==len(c),b[j]<=c[k])))a[i++]=b[j++];
    el cnt+=n/2-j,a[i++]=c[k++];
  }
  rr cnt;
}
I<J T>ll invc(v1<T>a){rr mrgc(a);}


u1 djks(cs graph&g,ll s){
  ll n=len(g);
  u1 d(n,inf);
  pqmin<cl>q;
  d[s]=0;
  q.ep(0,s);
  wh(len(q)){
    au[du,u]=gp(q);
    if(d[u]<du)ct;
    fe(v,w,g[u])if(amin(d[v],du+w))q.ep(du+w,v);
  }
  rr d;
}


I<J T>ss mat{
  v2<T>m;
  ll h,w;
  mat(ll n):h(n),w(n){rs(m,n,n);}
  mat(ll h,ll w):h(h),w(w){rs(m,h,w);}
  mat(ll h,ll w,T x):h(h),w(w){rs(m,h,w);fl(m,x);}
  mat(v2<T>a):h(len(a)),w(len(a[0])),m(a){}
  
  v1<T>op[](cs ll&i)cs{rr m[i];}
  v1<T>&op[](cs ll&i){rr m[i];}
  
  mat&op+=(cs mat&a){as(aa(h==a.h,w==a.w));rp(i,h)m[i]+=a[i];rr*th;}
  mat&op-=(cs mat&a){as(aa(h==a.h,w==a.w));rp(i,h)m[i]-=a[i];rr*th;}
  mat&op*=(cs mat&a){
    as(w==a.h);
    mat m2(h,a.w);
    rp(i,h)rp(k,w)rp(j,a.w)m2[i][j]+=m[i][k]*a[k][j];
    rr*th=m2;
  }
  //行列
  mat op+(cs mat&a)cs{rr mat(*th)+=a;}
  mat op-(cs mat&a)cs{rr mat(*th)-=a;}
  mat op*(cs mat&a)cs{rr mat(*th)*=a;}
  bo op==(cs mat&a){rr m==a.m;}
  //スカラ
  mat&op+=(cs T&a){fe(v,m)v+=a;rr*th;}
  mat&op-=(cs T&a){fe(v,m)v-=a;rr*th;}
  mat&op*=(cs T&a){fe(v,m)v*=a;rr*th;}
  mat&op/=(cs T&a){fe(v,m)v/=a;rr*th;}
  mat op+(cs T&a)cs{rr mat(*th)+=a;}
  mat op-(cs T&a)cs{rr mat(*th)-=a;}
  mat op*(cs T&a)cs{rr mat(*th)*=a;}
  mat op/(cs T&a)cs{rr mat(*th)/=a;}
  
  mat pow(ll n){mat x=*th;mat r(h);rp(i,h)r[i][i]=1;rr exq(x,n,r);}
  vo trs(){mat m2(w,h);rp(i,h)rp(j,w)m2[j][i]=m[i][j];*th=m2;}
  fd is&op>>(is&i,mat&m){rr i>>m.m;}
  fd os&op<<(os&o,cs mat&m){rr o<<m.m;}
};


I<J T>ss com{
  v1<T>fa,ra,bs;
  v2<T>m;
  v2<bo>u;
  com(ll n){
    n++;
    rs(fa,n);rs(ra,n);rs(bs,n);
    fa[0]=ra[0]=bs[0]=1;
    rp(i,1,n)fa[i]=fa[i-1]*i,ra[i]=ra[i-1]/i;
    rp(i,1,n)bs[i]=bs[i-1]+ra[i]*pow(-1,i&1);
    if(n<=5e3)rs(m,n,n),rs(u,n,n);
  }
  T c(ll n,ll k){rr oo(n<k,n<0,k<0)?0:fa[n]*ra[k]*ra[n-k];}
  T p(ll n,ll k){rr c(n,k)*fa[k];}
  T h(ll n,ll k){rr c(n+k-1,n);}//n個の区別できない球をk個の区別できる箱に配る
  T s(ll n,ll k){T r=0;rp(i,k+1)r+=c(k,i)*T(i).pow(n)*pow(-1,k-i);rr r*ra[k];}
  T b(ll n,ll k){T r=0;rp(i,k+1)r+=T(i).pow(n)*ra[i]*bs[k-i];rr r;}
  T par(ll n,ll k){//自然数nをk個の0以上の整数に分割する
    if(aa(n==0,k==0))rr 1;
    ei(k==0)rr 0;
    ei(u[n][k])rr m[n][k];
    ei(n-k>=0)rr u[n][k]=1,m[n][k]=p(n,k-1)+p(n-k,k);
    el rr u[n][k]=1,m[n][k]=p(n,k-1);
  }
};


I<J S,cs fn<S(S,S)>&f,cs fn<S()>&e>ss sgt{
  ll n,A,log;
  v1<S>d;
  sgt(ll n):sgt(v1<S>(n,e())){}
  sgt(cs v1<S>&v):n(len(v)){
    log=lg2(n*2-1)-1;
    A=bit(log);
    d=v1<S>(A*2,e());
    rp(i,n)d[i+A]=v[i];
    pr(i,A,1)upd(i);
  }
  vo upd(ll k){d[k]=f(d[k*2],d[k*2+1]);}
  vo set(ll i,S x){as(aa(0<=i,i<n));i+=A;d[i]=x;rp(j,1,log+1)upd(i>>j);}
  vo add(ll i,S x){as(aa(0<=i,i<n));set(i,get(i)+x);}
  S get(ll i)cs{as(aa(0<=i,i<n));rr d[i+A];}
  S aprod(){rr d[1];}
  S prod(ll l,ll r){
    as(aa(0<=l,l<=r,r<=n));
    S sml=e(),smr=e();
    l+=A,r+=A;
    wh(l<r){if(l&1)sml=f(sml,d[l++]);if(r&1)smr=f(d[--r],smr);l/=2,r/=2;}
    rr f(sml,smr);
  }
  fd os&op<<(os&o,cs sgt&s){rp(i,s.n)o<<s.get(i)<<(i==s.n-1?nc:sp);rr o;}
};


ss ufd{
  ll n;
  u1 d;
  ufd():n(0){}
  ufd(ll n):n(n),d(n,-1){}
  
  ll top(ll a){
    as(aa(0<=a,a<n));
    if(d[a]<0)rr a;
    rr d[a]=top(d[a]);
  }
  ll merge(ll a,ll b){
    as(aa(0<=a,a<n,0<=b,b<n));
    ll x=top(a),y=top(b);
    if(x==y)rr x;
    if(-d[x]<-d[y])swap(x,y);
    d[x]+=d[y];
    d[y]=x;
    rr x;
  }
  bo same(ll a,ll b){as(aa(0<=a,a<n,0<=b,b<n));rr top(a)==top(b);}
  ll size(ll a){as(aa(0<=a,a<n));rr-d[top(a)];}

  u2 groups(){
    u1 t(n),gsz(n);
    u2 g(n);
    rp(i,n)t[i]=top(i),gsz[t[i]]++;
    rp(i,n)g[i].reserve(gsz[i]);
    rp(i,n)g[t[i]].eb(i);
    rp(i,n)srt(g[i]);
    srt(g);
    g.erase(remove_if(al(g),[&](cs u1&v){rr v.empty();}),end(g));
    rr g;
  }
};
}//fn

namespace my{vo solve();}
}
int main(){my::my::solve();}

namespace my{namespace my{
vo solve(){
  LL(N,M,X);
  UV(N,a,b);b--;
  LL(K);
  UL(K,c);
  
  u2 g(M);
  rp(i,N)g[b[i]].eb(a[i]);
  u1 v;
  rp(i,M){
    srt(g[i]),rev(g[i]);
    if(len(g[i]))g[i][0]+=X;
    fe(x,g[i])v.eb(x);
  }
  srt(v),rev(v);
  
  au s=zet(v);
  ef(s);
  
  ll ans=0;
  rp(i,K)ans+=s[c[i]];
  pp(ans);
}}}
0