1 #include<iostream>
 2 #include<algorithm>
 3 #include<cstdio>
 4 using namespace std;
 5
 6 #define maxn 200010
 7 #define ll long long
 8 #define fi first
 9 #define se second
10 ll a[maxn],b[maxn],c[maxn],d[maxn];
11 ll n,m,k,x,s;
12
13 ll get(ll mon)
14 {
15     ll l=0,r=k;
16     while(l<r)
17     {
18         ll mid=(l+r+1)/2;
19         if(d[mid]>mon)
20             r=mid-1;
21         else
22             l=mid;
23     }
24     return c[l];
25 }
26 int main()
27 {
28
29     cin>>n>>m>>k;
30     cin>>x>>s;
31     ll ans=n*x;
32     a[0]=x;  //type1没有选中的spell时注意初始化
33     for(ll i=1;i<=m;i++) cin>>a[i];
34     for(ll i=1;i<=m;i++) cin>>b[i];
35     for(ll i=1;i<=k;i++) cin>>c[i];
36     for(ll i=1;i<=k;i++) cin>>d[i];
37     for(int i=0;i<=m;i++) //i要从0开始，因为tyoe1可能也没有可以使用的pell
38     {
39         ll s1=s-b[i];
40         //cout<<s1<<"  "<<get(s1)<<" "<<(n-get(s1))*a[i]<<endl;
41         if(s1<0)continue;
42         ans=min(ans,(n-get(s1))*a[i]);
43     }
44     cout<<ans<<endl;
45     return 0;
46 }

#include<iostream>
#include<cstdio>
#include<cmath>
#include<string>
#include<cstring>
using namespace std;#define ll long long
#define fi first
#define se second
pair<ll,ll>p[10];
int flag[10];
char cr[10];
ll xx;
ll yy;int judge(char c,ll x,ll y)
{if(x==xx){if(y<yy){if(!flag[1]){flag[1]=1;p[1].se=y;p[1].fi=xx;cr[1]=c;}p[1].se=max(p[1].se,y);if(p[1].se==y) cr[1]=c;}else{if(!flag[5]){flag[5]=1;p[5].se=y;p[5].fi=xx;cr[5]=c;}p[5].se=min(p[5].se,y);if(p[5].se==y) cr[5]=c;}}else if(y==yy){if(x<xx){if(!flag[3]){flag[3]=1;p[3].fi=x;p[3].se=yy;cr[3]=c;}p[3].fi=max(p[3].fi,x);if(p[3].fi==x) cr[3]=c;}else{if(!flag[7]){flag[7]=1;p[7].fi=x;p[7].se=yy;cr[7]=c;}p[7].fi=min(p[7].fi,x);if(p[7].fi==x) cr[7]=c;}}else if(x+y==xx+yy){if(x>xx&&y<yy){if(!flag[8]){flag[8]=1;p[8].fi=x;p[8].se=y;cr[8]=c;}p[8].fi=min(p[8].fi,x);p[8].se=max(p[8].se,y);if(p[8].fi==x) cr[8]=c;}else{if(!flag[4]){flag[4]=1;p[4].fi=x;p[4].se=y;cr[4]=c;}p[4].fi=max(p[4].fi,x);p[4].se=min(p[4].se,y);if(p[4].fi==x) cr[4]=c;}}else if(x-y==xx-yy){if(x<xx&&y<yy){if(!flag[2]){flag[2]=1;p[2].fi=x;p[2].se=y;cr[2]=c;}p[2].fi=max(p[2].fi,x);p[2].se=max(p[2].se,y);if(p[2].fi==x)cr[2]=c;}else{if(!flag[6]){flag[6]=1;p[6].fi=x;p[6].se=y;cr[6]=c;}p[6].fi=min(p[6].fi,x);p[6].se=min(p[6].se,y);if(p[6].fi==x) cr[6]=c;}}
}int main()
{int n;cin>>n;cin>>xx>>yy;ll x,y;char c;while(n--){cin>>c>>x>>y;judge(c,x,y);}bool is=false;for(int i=1;i<=8;i++){//cout<<p[i].fi<<" "<<p[i].se<<" "<<cr[i]<<endl;if(i%2&&(cr[i]=='R'||cr[i]=='Q'))is=true;else if(i%2==0&&(cr[i]=='B'||cr[i]=='Q'))is=true;}if(is)cout<<"YES\n";elsecout<<"NO\n";return 0;
}

#include <cstdio>
#include <algorithm>using namespace std;inline char in_char()
{char c = '\0';while (c <= ' ')c = getchar();return c;
}inline int in_int()
{int n;scanf("%d", &n);return n;
}struct figurine
{char kind;int x, y;
};int n;
int x0, y0;
figurine nearest[8];inline int dist(int x1, int y1, int x2, int y2)
{return max(abs(x1 - x2), abs(y1 - y2));
}inline void upd_nearest(figurine& was, const figurine& cur)
{if (was.kind == '?' ||dist(x0, y0, cur.x, cur.y) < dist(x0, y0, was.x, was.y))was = cur;
}inline int get_direction(const figurine& cur)
{// verticalif (cur.x == x0 && cur.y < y0) return 0;if (cur.x == x0 && cur.y > y0) return 1;// horizontalif (cur.y == y0 && cur.x < x0) return 2;if (cur.y == y0 && cur.x > x0) return 3;// diagonal 1if ((cur.y - y0) == (cur.x - x0) && cur.x < x0) return 4;if ((cur.y - y0) == (cur.x - x0) && cur.x > x0) return 5;// diagonal 2if ((cur.y - y0) == (x0 - cur.x) && cur.y < y0) return 6;if ((cur.y - y0) == (x0 - cur.x) && cur.y > y0) return 7;// the piece doesn't lie on any of the eight directionsreturn -1;
}int main()
{n = in_int();x0 = in_int(); y0 = in_int();for (int i = 0; i < 8; i++)nearest[i].kind = '?';// read and update nearestfor (int i = 0; i < n; i++){figurine cur;cur.kind = in_char(); cur.x = in_int(); cur.y = in_int();int dir = get_direction(cur);if (dir >= 0)upd_nearest(nearest[dir], cur);}bool ans = false;// check verticals and horizontalsfor (int i = 0; i < 4; i++)if (nearest[i].kind == 'R' || nearest[i].kind == 'Q')ans = true;// check diagonalsfor (int i = 4; i < 8; i++)if (nearest[i].kind == 'B' || nearest[i].kind == 'Q')ans = true;// outputputs(ans ? "YES" : "NO");return 0;
}