p_id
stringlengths 6
6
| language
stringclasses 10
values | code
stringlengths 11
983k
|
|---|---|---|
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define repp(i,a,b) for(int i = (int)(a) ; i < (int)(b) ; ++i)
#define repm(i,a,b) for(int i = (int)(a) ; i > (int)(b) ; --i)
int main(){
int N,Q; cin >> N >> Q;
vector<int> A(N),X(Q),s(Q);
repp(i,0,N) cin >> A[i];
repp(i,0,Q){
cin >> X[i];
s[i] = i;
}
sort(s.begin(),s.end(),[&](const int &a, const int &b){return X[a] < X[b];});
vector<LL> ans(Q);
LL z = A[N-1];
for(int i = N-3 ; i >= 0 ; i -= 2) z += A[i];
int k = 1;
repm(i,Q-1,-1){
while(N-2*k-1 >= 0 && 2*X[s[i]] <= A[N-2*k-1]+A[N-k-1]){
++k;
z += A[N-k] - A[N-2*k+1];
}
ans[s[i]] = z;
}
repp(i,0,Q) cout << ans[i] << endl;
return 0;
}
|
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<int(n);++i)
#define all(a) (a).begin(),(a).end()
typedef long long ll;
#define rep1(i,n) for(int i=1;i<=int(n);++i)
#define lb(s,x) (lower_bound(all(s),x)-s.begin())
#define ub(s,x) (upper_bound(all(s),x)-s.begin())
#define uniq(a) a.erase(unique(all(a)),a.end())
#define bit(k) (1LL<<(k))
const int INF = 1e9;
#define debug(x) cerr<<(#x)<<": "<<(x)<<endl
template<class T,class U>
ostream& operator<<(ostream& o, const pair<T,U> &p){
o<<"("<<p.first<<", "<<p.second<<")";
return o;
}
#define print(v) { cerr<<#v<<": [ "; for(auto _ : v) cerr<<_<<", "; cerr<<"]"<<endl; }
int n;
vector<int> a;
bool check(int x, int d){
int u = ub(a,x+d);
int l = lb(a,x-d);
return u-l <= n-u;
}
int main(void){
int q;
cin >> n >> q;
a.resize(n);
rep(i,n) cin >> a[i];
vector<ll> sum(n+1), t_sum(n+1);
rep(i,n){
sum[i+1] = sum[i] + a[i];
if (i % 2 != n % 2) {
t_sum[i+1] = t_sum[i] + a[i];
} else {
t_sum[i+1] = t_sum[i];
}
}
rep(_,q){
int x;
cin >> x;
int l = 0, r = 1e9;
while (l + 1 < r) {
int m = (l+r)/2;
if (check(x, m)) l = m;
else r = m;
}
ll d = l;
debug(x);
debug(d);
debug(a[ub(a,x+d)]);
debug(a[lb(a,x-d)]);
debug(n - ub(a,x+d));
debug(ub(a,x+d) - lb(a,x-d));
int dif = (n - ub(a,x+d)) - (ub(a,x+d) - lb(a,x-d));
ll tmp = 0;
if (dif == 2) {
tmp = - a[(lb(a,x-d)-1)];
} else if (dif == -1) {
tmp = + a[n-1];
}
cout << sum[n]-sum[ub(a,x+d)]+t_sum[lb(a,x-d)] + tmp << endl;
}
return 0;
}
|
p03158 | C++ | #include <bits/stdc++.h>
#define REP(a, b) for(int a = 0; a < b; a++)
#define FOR(i, a, b) for(int i = a; i <= b; i++)
#define mp make_pair
#define f first
#define s second
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef pair<ll, ll> LL;
typedef vector<int> vi;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
const int MAXN = 1e5 + 100;
ll gangen[MAXN], pre[MAXN];
vector<LL> batas;
ll A[MAXN];
int n, q;
int main() {
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
ios::sync_with_stdio(0); cin.tie(0);
cin >> n >> q;
FOR(i, 1, n) cin >> A[i];
sort(A + 1, A + n + 1);
ll sek = 0;
FOR(i, 1, n) {
pre[i] = pre[i - 1] + A[i];
if (n % 2 == i % 2) {
sek += A[i];
gangen[i] = sek;
}
}
int kiri = n - 2, kanan = n - 1;
while(kiri >= 1) {
int tengah = (A[kiri] + A[kanan]) >> 1;
batas.pb(mp(tengah + 1, gangen[kiri] + pre[n] - pre[kanan]));
//cout << batas[batas.size() - 1].f << ' ' << batas[batas.size() - 1].s << " EA\n";
kiri -= 2, kanan -= 1;
}
batas.pb(mp(0, pre[n] - pre[n / 2]));
reverse(batas.begin(), batas.end());
while(q--) {
int x;
cin >> x;
int kiri = 0, kanan = batas.size() - 1;
int res = -1;
while(kiri <= kanan) {
int tengah = (kiri + kanan) >> 1;
if (batas[tengah].f <= x) {
res = tengah;
kiri = tengah + 1;
}
else kanan = tengah - 1;
}
cout << batas[res].s << '\n';
}
} |
p03158 | C++ | #include <algorithm>
#include <vector>
#include <iostream>
using namespace std;
vector<int> a(100100);
int main() {
int n, q; cin >> n >> q;
long long sum[n+1] = {}, sum2[n+1] = {};
for (int i = 0; i < n; i++) {
cin >> a[i];
sum[i+1] = sum[i] + a[i];
if (i >= 2) sum2[i] = sum2[i-2] + a[i];
else sum2[i] = a[i];
}
a.resize(n);
while (q--) {
int x; cin >> x;
if (x >= a[n-2]) { cout << sum2[n-1] << endl; continue; }
int lb = 0, ub = 1<<30;
while (ub - lb > 1) {
int mid = (lb + ub) / 2;
int right = upper_bound(a.begin(), a.end(), x + mid) - a.begin() - 1,
left = lower_bound(a.begin(), a.end(), x - mid) - a.begin();
if (n - (right - left + 1) > right) lb = mid;
else ub = mid;
}
int right = upper_bound(a.begin(), a.end(), x + lb) - a.begin() - 1,
left = lower_bound(a.begin(), a.end(), x - lb) - a.begin(),
t = n - (right - left + 1);
long long ans = 0;
ans += sum[n] - sum[t];
bool turn_T = true;
while (t - right > 1) {
if (turn_T) ans += a[--t];
else if (left > 0 && x - a[left-1] <= a[right+1] - x) left--;
else right++;
turn_T = !turn_T;
}
if (turn_T && left > 0) ans += sum2[left-1];
else if (left > 1) ans += sum2[left-2];
cout << ans << endl;
}
}
|
p03158 | C++ | #include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<queue>
#include<cmath>
#include<vector>
#include<stack>
#include<map>
#include<set>
#define Run(i,l,r) for(int i=l;i<=r;i++)
#define Don(i,l,r) for(int i=l;i>=r;i--)
#define ll long long
#define ld long double
#define inf 0x3f3f3f3f
#define mk make_pair
#define fir first
#define sec second
#define il inline
#define rg register
#define pb push_back
using namespace std;
const int N = 100010;
int n,m,a[N];
ll pre[N],suf[N];
void solve(int x){
int p = lower_bound(a+1,a+n+1,x)-a;
int l = (n - p + 2)>>1, r = min((n+1)>>1, n - p + 1);
// int l = 1, r = n + 1;
while(l<r){
int mid = (l+r)>>1;
int p1 = max(n - mid * 2, 0) , p2 = n - mid;
if( abs( a[p1] - x ) > abs( a[p2] - x) ) r = mid;
else l = mid + 1;
}
ll ans=pre[n]-pre[n-r]+suf[1]-suf[max(1,n-r*2+1)];
printf("%lld\n",ans);
}
int main(){
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++)scanf("%d",&a[i]);
sort(a+1,a+n+1);
for(int i=1;i<=n;i++){
pre[i]=pre[i-1]+a[i];
if(i&1)suf[n-i+1]=suf[n-i+2]+a[n-i+1];
else suf[n-i+1]=suf[n-i+2];
}
for(int i=1,x;i<=m;i++){
scanf("%d",&x);
solve(x);
}
return 0;
}//by tkys_Austin;
|
p03158 | C++ | #include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef long double ld;
typedef complex<ld> Point;
const ld eps = 1e-11;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;
typedef pair<ld, ld> LDP;
typedef unsigned long long ul;
ll a[1 << 17];
ll ra[2][1 << 17];
ll s[1 << 17];
int n, q;
bool can(ll x, int id) {
ll dif = a[id] - x;
int le = lower_bound(a, a + n, x - dif) - a;
bool res = false;
return id - le + 1 <= n - id - 1;
}
int main() {
cin >> n >> q;
rep(i, n)cin >> a[i];
rep(i, n)s[i + 1] = s[i] + a[i];
rep(i, n) {
if (i % 2==0) {
ra[0][i + 1] = ra[0][i] + a[i];
ra[1][i + 1] = ra[1][i];
}
else {
ra[1][i + 1] = ra[1][i] + a[i];
ra[0][i + 1] = ra[0][i];
}
}
rep(i, q) {
ll x; cin >> x;
int le = lower_bound(a, a + n, x) - a; int ri = n;
if (le == n)le--;
while (ri - le > 1) {
int mid = (ri + le) / 2;
if (can(x, mid))le = mid;
else ri = mid;
}
if (!can(x, le))le--;
int num = n - le - 1;
int id = lower_bound(a, a + n, x - (a[le] - x)) - a;
if (x > a[le])id = le;
int num2 = le - id + 1;
int lle = max(id - (num - num2),0);
cout << s[n] - s[le + 1] + ra[(lle % 2) ^ 1][lle] << endl;
}
//stop
return 0;
}
|
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
using pii = pair<int,int>;
using ll = long long;
#define rep(i, j) for(int i=0; i < (int)(j); i++)
#define repeat(i, j, k) for(int i = (j); i < (int)(k); i++)
#define all(v) v.begin(),v.end()
#define debug(x) cerr << #x << " : " << x << endl
template<class T> bool set_min(T &a, const T &b) { return a > b ? a = b, true : false; }
template<class T> bool set_max(T &a, const T &b) { return a < b ? a = b, true : false; }
// vector
template<class T> istream& operator >> (istream &is , vector<T> &v) { for(T &a : v) is >> a; return is; }
template<class T> ostream& operator << (ostream &os , const vector<T> &v) { for(const T &t : v) os << "\t" << t; return os << endl; }
// pair
template<class T, class U> ostream& operator << (ostream &os , const pair<T, U> &v) { return os << "<" << v.first << ", " << v.second << ">"; }
const int INF = 1 << 30;
const ll INFL = 1LL << 60;
class Solver {
public:
bool solve() {
int N, Q; cin >> N >> Q;
vector<ll> A(N); cin >> A;
vector<ll> X(Q); cin >> X;
sort(all(A)); reverse(all(A));
vector<ll> sum(N + 1);
rep(i, N) sum[i + 1] = sum[i] + A[i];
vector<ll> rsum1(N + 1), rsum2(N + 1);
rep(i, N) {
rsum1[N - i - 1] = rsum1[N - i] + (i % 2 == 0 ? A[N - i - 1] : 0);
rsum2[N - i - 1] = rsum2[N - i] + (i % 2 == 1 ? A[N - i - 1] : 0);
}
rep(q, Q) {
auto check = [&] (int m) {
if(m == 0) return true;
if(m >= N / 2 + N % 2) return false;
ll a = abs(A[m] - X[q]);
ll b = abs(A[m + m] - X[q]);
return a >= b;
};
int l = 0, r = N;
while(l + 1 < r) {
int m = (l + r) / 2;
(check(m) ? l : r) = m;
}
cerr << l << endl;
ll ans = sum[r] + ((N - r * 2) % 2 == 0 ? rsum2 : rsum1)[r * 2];
cout << ans << endl;
}
return 0;
}
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
Solver s;
s.solve();
return 0;
}
|
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define all(a) (a).begin(),(a).end()
#define endl "\n"
#define aim_cpo do{ios::sync_with_stdio(false);\
cin.tie(nullptr);cout.precision(10);cout<<fixed;}while(0)
#define LOCAL_INPUT do{FILE *stream1;\
stream1=freopen("/Users/aim_cpo/CLionProjects/competitive/in.txt","r",stdin);\
if(stream1==nullptr)return 0;}while(0)
#define LOCAL_OUTPUT do{FILE *stream2;\
stream2 = freopen("out.txt", "w", stdout);\
if (stream2 == nullptr) return 0;}while(0)
#ifdef LOCAL_DEFINE
#define show(x) cerr << #x << " = " << (x) << endl
#define showV(v, n) do{\
for(int _i_t_e_=0; _i_t_e_<(n);_i_t_e_++)\
cerr<<"("<<_i_t_e_<<" = "<<(v)[_i_t_e_]<<") ";\
cerr<<endl;}while(0);
#define showA(a, n) do{\
for(int _i_t_e_=0;_i_t_e_<(n);_i_t_e_++)\
cerr<<"("<<_i_t_e_<<" = "<<(a)[_i_t_e_]<<") ";\
cerr<<endl;}while(0);
#else
#define show(x)
#define showV(v, n)
#define showA(a, n)
#endif
typedef long long ll;
typedef unsigned long long ull;
constexpr const int INT_INF=0x3f3f3f3f; // 1061109567
constexpr const ll LL_INF=0x3f3f3f3f3f3f3f3f; // 4557430888798830399
template <typename T> bool chmin(T &a, T b){return a>b?(a=b,true):false;}
template <typename T> bool chmax(T &a, T b){return a<b?(a=b,true):false;}
// INT
#define GCD(a, b) __gcd(a, b)
template <typename T> T LCM(T a, T b) {return a / GCD(a, b) * b;}
template <typename T> T EXTGCD(T a, T b, T& x, T& y) {
T d = a;
if (b != 0) {d=EXTGCD(b,a%b,y,x);y-=(a/b)*x;}
else x=1,y=0;
return d;
}
template <typename T> bool is_prime(T a) {
for(int i=2;i*i<=a;i++)if(a%i==0)return 1;
return 0;
}
// MOD
ll MOD = 1000000000L + 7L;
#define add(a, b) ((a % MOD) + (b % MOD)) % MOD
#define mul(a, b) ((a % MOD) * (b % MOD)) % MOD
#define sub(a, b) ((a % MOD) + MOD - (b % MOD)) % MOD
template <typename T> T mod_inverse(T a, T mod, bool prime){ // if mod is prime, "prime" is true.
if(prime){
T tmp=mod-2,now=a,res=1;while(tmp){if(tmp&1)res=mul(res,now);now=mul(now,now);tmp>>=1;}
return res;
}else{T x,y;EXTGCD(a,mod,x,y);return (mod+x%mod)%mod;}
}
#define divide(a, b) ((a % MOD) * (mod_inverse(b, MOD, true))) % MOD
//LLの数値をつかう時は最後にLをつける癖をつけよう
//
// ┏┓┏┓ ┓ ┏┓
// ┏┛┃┃ ┃ ┗┫
// ┗┛┗┛ ┻ ┗┛
//
// 謹┃賀┃新┃年┃
// ━┛━┛━┛━┛
//WWWWWWWWWWWWWWWWWWWWWW
int n, q;
int a[100001];
ll sum1[100001], sum2[100001], sum3[100001];
bool check(int x, int left, int right) {
ll d1 = abs(x - a[left]);
ll d2 = abs(x - a[right]);
if (d1 > d2) return false;
return true;
}
int main() {
aim_cpo; // インタラクティブのときは消すように.
#ifdef LOCAL_DEFINE
LOCAL_INPUT; // インタラクティブのときは消すように.
// LOCAL_OUTPUT; // ファイルに出力したいときのみ
show(MOD);
#endif
cin >> n >> q;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sum1[0] = a[0];
for (int i = 1; i < n; i++) {
sum1[i] = sum1[i - 1] + a[i];
}
sum2[0] = a[0];
sum2[1] = a[1];
for (int i = 2; i < n; i++) {
sum2[i] = sum2[i - 2] + a[i];
}
for (int i = 0; i < q; i++) {
int x; cin >> x;
int ok = 2, ng = n + 1;
while (ng - ok > 1) {
int mid = (ng + ok) / 2;
int right = n - (mid + 1) / 2;
int left = n - mid;
if (check(x, left, right)) ok = mid;
else ng = mid;
}
show(ok);
ll ans = sum1[n - 1] - sum1[n - (ok + 1) / 2 - 1];
if (ok < n) {
if (ok & 1) ans += sum2[n - ok - 2];
else ans += sum2[n - ok - 1];
}
cout << ans << endl;
}
#ifdef LOCAL_DEFINE
cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << "s." << endl;
#endif
return 0;
} |
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define int long long int
#define endl "\n"
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
const int N=1e5+5;
int a[N],pref[N],odd[N],even[N];
int n,q;
int check(int idx,int x)
{
int have=n-idx+1;
idx--;
if(idx<1)
return true;
int st=(lower_bound(a+1,a+1+n,x-(a[idx]-x))-a);
st=min(st,idx);
int chances=idx-st+1;
if(chances>have)
return false;
return true;
}
int binsearch(int x)
{
int low=lower_bound(a+1,a+1+n,x)-a;
int high=n;
while(low<high)
{
int mid=(low+high+1)/2;
if(check(mid,x))
low=mid;
else
high=mid-1;
}
return low;
}
int32_t main()
{
cin>>n>>q;
for(int i=1;i<=n;i++)
cin>>a[i];
for(int i=1;i<=n;i++)
{
odd[i]=odd[i-1];
even[i]=even[i-1];
pref[i]=pref[i-1]+a[i];
if(i%2)
odd[i]+=a[i];
else
even[i]+=a[i];
}
while(q--)
{
int x;
cin>>x;
if(x>=a[n])
{
cout<<(n%2?odd[n]:even[n])<<endl;
continue;
}
int idx=binsearch(x);
int ans=pref[n]-pref[idx-1];
int st=n-2*(n-(idx)+1);
ans+=(st%2?odd[st]:even[st]);
cout<<ans<<endl;
}
} |
p03158 | C++ | #include<cstdio>
#include<algorithm>
using namespace std;
const int MAX_N = 100000;
const int MAX_Q = 100000;
const long long UB = 1000000000;
long long A[MAX_N];
int N;
long long eSum[MAX_N], oSum[MAX_N];
long long sum[MAX_N];
bool lt(int x, int a, int b){
long long d1 = abs(x - A[a]);
long long d2 = abs(x - A[b]);
if(d1 < d2) return true;
return false;
}
long long calc(int r, int d){
if(r < 0) return 0;
if(d == 0) return eSum[r];
else if(d == 1) return oSum[r];
else return sum[r];
}
long long calc(int l, int r, int d){
if(l > r) return 0;
return calc(r, d) - calc(l - 1, d);
}
long long query(int x){
int lb = 1, ub = N + 1;
while(ub - lb > 1){
int mid = (lb + ub) / 2;
int a = mid / 2;
int b = mid / 2;
if(a + b < mid) a++;
int l = N - mid;
int r = N - a - 1;
// take [l, r]
if(lt(x, r + 1, l)) ub = mid;
else lb = mid;
}
// lb cards: no conflict
int a = (lb + 1) / 2;
int d = N % 2;
long long ans = calc(0, N - lb - 1, d) + calc(N - lb, N - a - 1, -1);
return sum[N - 1] - ans;
}
int main(){
int Q;
scanf("%d%d", &N, &Q);
for(int i = 0; i < N; ++i) scanf("%lld", A + i);
sum[0] = A[0];
for(int i = 1; i < N; ++i) sum[i] = sum[i - 1] + A[i];
eSum[0] = A[0];
for(int i = 1; i < N; ++i) eSum[i] = eSum[i - 1] + (i % 2 == 0 ? A[i] : 0);
oSum[0] = 0;
for(int i = 1; i < N; ++i) oSum[i] = oSum[i - 1] + (i % 2 == 1 ? A[i] : 0);
for(int i = 0; i < Q; ++i){
long long x;
scanf("%lld", &x);
long long ans = query(x);
printf("%lld\n", ans);
}
return 0;
}
|
p03158 | C++ | #include <bits/stdc++.h>
#define int long long
#define uint unsigned int
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i, a, b) for (int i = (a); i >= (b); --i)
#define ALL(a) (a).begin(), (a).end()
#define ALLR(a) (a).rbegin(), (a).rend()
#define SZ(a) ((int)(a).size())
#define PB(a) push_back(a)
#define EMP emplace
#define EMPB(...) emplace_back(__VA_ARGS__)
#define MP(a, b) make_pair(a, b)
#define MT(...) make_tuple(__VA_ARGS__)
#define Bit(n) (1LL << (n))
using namespace std;
using pii = pair<int, int>;
template <class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template <class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
const int MOD = 1000000007;
const int INF = 1LL << 30;
const double EPS = 1e-10;
int N, Q;
int A[100010];
int X[100010];
int cum1[100010];
int cum2[100010];
bool check(int x, int m) {
int pos = lower_bound(A, A+N, x-(A[m]-x)) - A;
int numT = N - m;
int numA = m - pos;
return numT - numA <= 1;
}
signed main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(10);
cin >> N >> Q;
REP(i, N) cin >> A[i];
REP(i, Q) cin >> X[i];
REP(i, N) cum1[i+1] = cum1[i] + A[i];
REP(i, N) cum2[i+1] = cum2[max(0LL, i-1)] + A[i];
REP(i, Q) {
int ok = N-1, ng = 0;
while (ok - ng > 1) {
int m = (ok + ng) / 2;
if (check(X[i], m)) ok = m;
else ng = m;
}
int numT = N - ok;
int sumT = cum1[N] - cum1[ok];
int rem = max(0LL, N - 2 * numT);
sumT += cum2[rem];
cout << sumT << endl;
}
return 0;
} |
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vb=vector<bool>;
using vvb=vector<vb>;
using vd=vector<double>;
using vvd=vector<vd>;
using vi=vector<int>;
using vvi=vector<vi>;
using vl=vector<ll>;
using vvl=vector<vl>;
using pll=pair<ll,ll>;
using tll=tuple<ll,ll>;
using vs=vector<string>;
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define rep(i,n) range(i,0,n)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define range(i,a,n) for(int i=(a);i<(n);i++)
#define LINF ((ll)1ll<<60)
#define INF ((int)1<<30)
#define EPS (1e-9)
#define MOD (1000000007ll)
#define fcout(a) cout<<setprecision(a)<<fixed
#define fs first
#define sc second
#define PI (3.1415926535897932384)
int dx[]={1,0,-1,0,1,-1,-1,1},dy[]={0,1,0,-1,1,1,-1,-1};
template<class S,class T>ostream&operator<<(ostream&os,pair<S,T>p){os<<"["<<p.first<<", "<<p.second<<"]";return os;};
template<class S>auto&operator<<(ostream&os,vector<S>t){bool a=1; for(auto s:t){os<<(a?"":" ")<<s; a=0;} return os;}
template<class T> void chmax(T &a, const T &b){if(a<b)a=b;}
template<class T> void chmin(T &a, const T &b){if(a>b)a=b;}
void YN(bool b){cout<<(b?"YES":"NO")<<endl;}
void Yn(bool b){cout<<(b?"Yes":"No")<<endl;}
void yn(bool b){cout<<(b?"yes":"no")<<endl;}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll n,q,in,ans=0;
cin>>n>>q;
int ev = (n%2==0?1:0);
vl a(n),sum(n+1);
rep(i,n)cin>>a[i];
if(ev==1){
n--;
a.erase(a.begin());
}
rrep(i,n) sum[i]=sum[i+1]+a[i];
vl line,lsum(1);
for(int i=0;i<n-2;i+=2){
line.push_back((a[i]+a[i+(n-i-1)/2])/2+1);
lsum.push_back(lsum.back()+a[i]);
}
line.push_back(LINF);
//scout<<line<<endl;
//cout<<lsum<<endl;
rep(i,q){
cin>>in;
int e=upper_bound(all(line),in)-line.begin();
cout<<lsum[e]+sum[n/2+e] <<"\n";
//cout<<e<<" "<<lsum[e]<<" "<<sum[n/2+e] <<"\n";
}
}
|
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
/*{{{*/ //template
#define rep(i,n) for(int i=0;i<(int)(n);i++)
constexpr int INF = numeric_limits<int>::max()/2;
constexpr long long LINF = numeric_limits<long long>::max()/3;
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
#define sz(x) (int)(x).size()
#define debug(x) cerr<<#x<<":"<<x<<endl
#define debug2(x,y) cerr<<#x<<","<<#y":"<<x<<","<<y<<endl
//struct fin{ fin(){ cin.tie(0); ios::sync_with_stdio(false); } } fin_;
struct Double{ double d; explicit Double(double x) : d(x){} };
ostream& operator<<(ostream& os,const Double x){ os << fixed << setprecision(20) << x.d; return os; }
template<typename T> ostream& operator<<(ostream& os,const vector<T>& vec){ os << "["; for(const auto& v : vec){ os << v << ","; } os << "]"; return os; }
template<typename T,typename U> ostream& operator<<(ostream& os,const pair<T,U>& p){ os << "(" << p.first << ","<< p.second <<")"; return os; }
template<typename T> ostream& operator<<(ostream& os,const set<T>& st){ os<<"{"; for(T v:st) os<<v<<","; os <<"}"; return os; }
template<typename T,typename U> inline void chmax(T &x,U y){ if(y>x) x = y; }
template<typename T,typename U> inline void chmin(T &x,U y){ if(y<x) x = y; }
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
ll gcd(ll a,ll b){ if(b==0) return a; else return gcd(b,a%b); }
//constexpr double eps = 1e-14;
constexpr double eps = 1e-10;
constexpr ll mod = 1e9+7;
const int dx[]={1,0,-1,0} ,dy[] = {0,1,0,-1};
/*}}}*/
struct RSQ{
public:
int n;
vector<ll> data;
RSQ(int n_){
n = 1;
while(n<n_) n*=2;
data.resize(2*n-1);
for(int i=0;i<2*n-1;i++) data[i]=0;
}
void update(int k,ll a){
k+=n-1;
data[k]=a;
while(k>0){
k=(k-1)/2;
data[k]=data[k*2+1]+data[k*2+2];
}
}
ll query(int a,int b,int k,int l,int r){
if(r<=a or b<=l) return 0;
if(a<=l and r<=b) return data[k];
else return query(a,b,k*2+1,l,(l+r)/2)+query(a,b,k*2+2,(l+r)/2,r);
}
ll query(int a,int b){ return query(a,b,0,0,n); }
};
ll N,Q,x;
vector<ll> A;
int main(){
scanf("%lld %lld",&N,&Q);
A.resize(N);
RSQ seg(N);
rep(i,N){
scanf("%lld",&A[i]);
seg.update(i,A[i]);
}
RSQ seg_even(N),seg_odd(N);
for(int i=0;i<N;i++){
if(i%2==0) seg_even.update(i,A[i]);
else seg_odd.update(i,A[i]);
}
rep(loop,Q){
scanf("%lld",&x);
ll l,r;
l = 0;
r = N+10;
//cerr << "--------------------" << endl;
while(r-l>1){
int d=(l+r)/2;
//cerr << l << " " << r << " " << d << endl;
if(N-d<0){
r = d;
continue;
}
if(A[N-d] <= x){
r = d;
continue;
}
if(N-2*d+1 < 0){
r = d;
continue;
}
// 最後の1個前 -> A[N-2*d+1]
if(x - A[N-2*d+1] <= A[N-d] - x){
l = d;
}else{
r = d;
}
}
//cerr << "break" << endl;
const int d = l;
//cout << "d = " << d << endl;
int li = (N-2*d>=0) ? N-2*d : N-2*d+1;
ll ans = seg.query(N-d,N);
if(li%2==0){
ans += seg_odd.query(0,li);
}else{
ans += seg_even.query(0,li);
}
cout << ans << endl;
}
}
|
p03158 | C++ | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int N, Q; cin >> N >> Q;
vector<long long> A(N);
for (int i = 0; i < N; ++i) cin >> A[i];
reverse(A.begin(), A.end()); // 考えやすいように左右反転
vector<long long> sum(N+1), evensum(N+1); // 累積和、偶数番目累積和
for (int i = 0; i < N; ++i) {
sum[i+1] = sum[i] + A[i];
evensum[i+1] = evensum[i] + (i % 2 == 0 ? A[i] : 0);
}
vector<long long> ths, vals; // ths: L の値が変化する x の境目、vals: またそのときの先手のスコア
for (int i = 0; i < (N-1)/2; ++i) {
long long th = (A[i+1] + A[i*2+2])/2 + 1;
long long val = (sum[i+1] - sum[0]) + (evensum[N] - evensum[i*2+2]);
ths.push_back(th); vals.push_back(val);
}
reverse(ths.begin(), ths.end()); reverse(vals.begin(), vals.end());
for (int _ = 0; _ < Q; ++_) {
long long x; cin >> x;
int it = upper_bound(ths.begin(), ths.end(), x) - ths.begin(); // L の値が何かを求める
if (it == 0) cout << sum[(N+1)/2] - sum[0] << endl;
else cout << vals[it-1] << endl;
}
} |
p03158 | C++ | #include <iostream>
#include <utility>
#include <algorithm>
#include <cmath>
using namespace std;
long long sum[3][100010] = {},a[100010],ans[100010];
pair<int,int> p[100010];
int main(){
int i,n,q;
cin >> n >> q;
for(i=0;i<n;i++){
cin >> a[i];
sum[0][i+1] = sum[0][i];
sum[1][i+1] = sum[1][i];
sum[i&1][i+1] += a[i];
}
for(i=n;i>=1;i--){
sum[2][i] = sum[2][i+1] + a[i-1];
}
for(i=0;i<q;i++){
int x; cin >> x;
p[i] = {x,i};
}
sort(p,p+q);
int r = 0;
for(i=0;i<q;i++){
while(r<n && abs(a[r+1] - p[i].first)<abs(a[r] - p[i].first)) r++;
while(1){
if(r==n){
ans[p[i].second] = sum[!(n&1)][n];
break;
}
int l = 2*r - n + 2;
if(l>=0 && abs(a[l]-p[i].first)<=abs(a[r+1] - p[i].first)){
ans[p[i].second] = sum[!(l&1)][l] + sum[2][r+2];
break;
}
l = 2*r - n + 3;
if(l>=0 && abs(a[l] - p[i].first)<=abs(a[r+1] - p[i].first)){
ans[p[i].second] = sum[(l&1)][l] + sum[2][r+2];
break;
}
r++;
}
}
for(i=0;i<q;i++){
cout << ans[i] << endl;
}
} |
p03158 | C++ | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
template<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P)
{ return s << '<' << P.first << ", " << P.second << '>'; }
template<class T> ostream& operator << (ostream &s, vector<T> P)
{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << " "; } s << P[i]; } return s; }
template<class T> ostream& operator << (ostream &s, vector<vector<T> > P)
{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }
using pll = pair<long long, long long>;
int N, Q;
vector<long long> A;
vector<long long> sum, evensum;
vector<long long> ths, vals;
int main() {
while (cin >> N >> Q) {
A.resize(N);
for (int i = 0; i < N; ++i) cin >> A[i];
reverse(A.begin(), A.end());
sum.assign(N+1, 0); evensum.assign(N+1, 0);
for (int i = 0; i < N; ++i) {
sum[i+1] = sum[i] + A[i];
evensum[i+1] = evensum[i] + (i % 2 == 0 ? A[i] : 0);
}
ths.clear(); vals.clear();
for (int i = 0; i < (N-1)/2; ++i) {
long long th = (A[i+1] + A[i*2+2])/2 + 1;
long long val = (sum[i+1] - sum[0]) + (evensum[N] - evensum[i*2+2]);
ths.push_back(th); vals.push_back(val);
}
reverse(ths.begin(), ths.end());
reverse(vals.begin(), vals.end());
for (int _ = 0; _ < Q; ++_) {
long long x; cin >> x;
int it = upper_bound(ths.begin(), ths.end(), x) - ths.begin();
if (it == 0) cout << sum[(N+1)/2] - sum[0] << endl;
else cout << vals[it-1] << endl;
}
}
}
|
p03158 | C++ | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <functional>
#include <iomanip>
#include <bitset>
using namespace std;
typedef long long ll;
int N, Q;
ll x;
ll a[100005], sum[100005], jmp[100005];
bool check(int idx) {
if (a[idx] < x) return false;
ll t = abs(a[idx] - x);
int lo = -1, hi = idx + 1;
while (hi - lo > 1) {
int mid = lo + (hi - lo) / 2;
if (t < abs(x - a[mid])) lo = mid;
else hi = mid;
}
return N - 1 - idx < idx - lo;
}
int main() {
cin >> N >> Q;
for (int i = 0; i < N; i++) cin >> a[i];
for (int i = 0; i < N; i++) sum[i + 1] = sum[i] + a[i];
jmp[1] = a[0];
for (int i = 1; i < N; i++) jmp[i + 1] = jmp[i - 1] + a[i];
while (Q--) {
cin >> x;
int lo = 0, hi = N;
while (hi - lo > 1) {
int mid = lo + (hi - lo) / 2;
if (check(mid)) hi = mid;
else lo = mid;
}
//cout << lo << " " << hi << endl;
ll ans = sum[N] - sum[hi];
if (2*hi - N >= 0) ans += jmp[2 * hi - N];
cout << ans << endl;
}
return 0;
}
|
p03158 | C++ | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <functional>
#include <iomanip>
#include <bitset>
using namespace std;
typedef long long ll;
int N, Q;
ll x;
ll a[100005], sum[100005], jmp[100005];
bool check(int idx) {
if (a[idx] < x) return false;
ll t = abs(a[idx] - x);
int lo = -1, hi = idx + 1;
while (hi - lo > 1) {
int mid = lo + (hi - lo) / 2;
if (t < abs(x - a[mid])) lo = mid;
else hi = mid;
}
return N - 1 - idx < idx - lo;
}
int main() {
cin >> N >> Q;
for (int i = 0; i < N; i++) cin >> a[i];
for (int i = 0; i < N; i++) sum[i + 1] = sum[i] + a[i];
jmp[1] = a[0];
for (int i = 1; i < N; i++) jmp[i + 1] = jmp[i - 1] + a[i];
while (Q--) {
cin >> x;
int lo = -1, hi = N;
while (hi - lo > 1) {
int mid = lo + (hi - lo) / 2;
if (check(mid)) hi = mid;
else lo = mid;
}
//cout << lo << " " << hi << endl;
ll ans = sum[N] - sum[hi];
if (2*hi - N >= 0) ans += jmp[2 * hi - N];
cout << ans << endl;
}
return 0;
}
|
p03158 | C++ | #include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <functional>
#include <iomanip>
#include <bitset>
using namespace std;
typedef long long ll;
int N, Q;
ll x;
ll a[100005], sum[100005], jmp[100005];
bool check(int idx) {
if (a[idx] < x) return false;
ll t = abs(a[idx] - x);
int lo = -1, hi = idx + 1;
while (hi - lo > 1) {
int mid = lo + (hi - lo) / 2;
if (t < abs(x - a[mid])) lo = mid;
else hi = mid;
}
return N - 1 - idx < idx - lo;
}
int main() {
cin >> N >> Q;
for (int i = 0; i < N; i++) cin >> a[i];
for (int i = 0; i < N; i++) sum[i + 1] = sum[i] + a[i];
for (int i = 0; i < N; i++) jmp[i + 1] = (i ? jmp[i - 1] : 0) + a[i];
while (Q--) {
cin >> x;
int lo = -1, hi = N;
while (hi - lo > 1) {
int mid = lo + (hi - lo) / 2;
if (check(mid)) hi = mid;
else lo = mid;
}
ll ans = sum[N] - sum[hi];
if (2*hi - N >= 0) ans += jmp[2*hi - N];
cout << ans << endl;
}
return 0;
}
|
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;
int N, Q;
vector<ll> A;
ll sum[100005];
ll sumE[100005];
ll sumO[100005];
bool check(int turn, ll X){
int aok = turn/2;
int tak = turn - turn/2;
int a = N - tak;
int b = a - aok;
if(b < 0) return false;
return abs(A[b]-X) <= abs(A[a]-X);
}
ll solve(ll X){
int lb = 0, ub = N+1;
while(ub-lb>1){
int t = (lb+ub)/2;
if(check(t, X)) lb = t;
else ub = t;
}
int aok = lb/2;
int tak = lb - lb/2;
ll ret = sum[N-1] - ((N-tak-1>=0)?sum[N-tak-1]:0);
if(lb != N){
int pos = N - lb - 1;
if(lb%2==0){
if(pos%2==0) ret += sumE[pos];
else ret += sumO[pos];
}else{
pos--;
if(pos >= 0){
if(pos%2==0) ret += sumE[pos];
else ret += sumO[pos];
}
}
}
return ret;
}
int main(){
cin >> N >> Q;
rep(i,N){
ll a;
cin >> a;
A.push_back(a);
}
rep(i,N){
sum[i] = A[i] + ((i-1>=0)?sum[i-1]:0);
if(i%2==0) sumE[i] = A[i] + ((i-2>=0)?sumE[i-2]:0);
else sumO[i] = A[i] + ((i-2>=0)?sumO[i-2]:0);
}
rep(i,Q){
ll X;
cin >> X;
cout << solve(X) << endl;
}
return 0;
}
|
p03158 | C++ | #define _CRT_SECURE_NO_WARNINGS
#include <cassert>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <functional>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const int SZ = 100333;
int N, Q;
int A[SZ];
ll psum[SZ];
ll jsum[SZ];
ll solve(int X) {
if (A[N-2] <= X) return jsum[N-1];
int lo = 0; // disjoint
int hi = N + 1;
while (lo + 2 <= hi) {
int mi = (lo+hi)/2;
int a = N - mi;
int b = N - (mi+1)/2;
if (abs(X-A[a]) <= abs(X-A[b]))
lo = mi;
else
hi = mi;
}
int a = N - lo;
int b = N - (lo+1)/2;
ll ans = psum[N-1] - psum[b-1];
int t = a - 1;
if (lo&1) t--;
ans += t>=0 ? jsum[t] : 0;
return ans;
}
int main() {
scanf("%d%d", &N, &Q);
for (int i=0; i<N; i++) scanf("%d", &A[i]);
for (int i=0; i<N; i++) {
psum[i] = i==0 ? A[i] : psum[i-1] + A[i];
jsum[i] = i<=1 ? A[i] : jsum[i-2] + A[i];
}
for (int z=0; z<Q; z++) {
int X; scanf("%d", &X);
ll ans = solve(X);
//printf("--------");
printf("%lld\n", ans);
}
return 0;
} |
p03158 | C++ | #include <bits/stdc++.h>
#define REP(i, a, n) for (ll i = ((ll) a); i < ((ll) n); i++)
using namespace std;
typedef long long ll;
ll N, Q, A[100000], X[100000];
ll sum[100001], se[100001], so[100001];
ll solve(ll x) {
ll l = 1, h = N + 1;
while (h - l > 1) {
ll m = (l + h) / 2;
ll p = (m + 1) / 2;
(abs(A[N - m] - x) <= abs(A[N - p] - x) ? l : h) = m;
}
return (sum[N] - sum[N - (l + 1) / 2]) + (N % 2 == 0 ? so[N - l] : se[N - l]);
}
int main(void) {
cin >> N >> Q;
REP(i, 0, N) cin >> A[i];
REP(i, 0, Q) cin >> X[i];
REP(i, 0, N) sum[i + 1] = sum[i] + A[i];
REP(i, 0, N) se[i + 1] = se[i] + (i % 2 == 0 ? A[i] : 0);
REP(i, 0, N) so[i + 1] = so[i] + (i % 2 == 1 ? A[i] : 0);
REP(i, 0, Q) cout << solve(X[i]) << endl;
} |
p03158 | C++ | #include <bits/stdc++.h>
#define REP(i, a, n) for (ll i = ((ll) a); i < ((ll) n); i++)
using namespace std;
typedef long long ll;
ll N, Q, A[100000], X[100000];
ll sum[100001], se[100001], so[100001];
bool check(ll x, ll a, ll b) {
return abs(A[b] - x) < abs(A[a] - x);
}
ll solve(ll x) {
ll l = 1, h = N + 1;
while (h - l > 1) {
ll m = (l + h) / 2;
ll p = (m + 1) / 2;
ll q = m / 2;
if (check(x, N - m, N - p)) h = m;
else l = m;
}
return (sum[N] - sum[N - (l + 1) / 2]) + (N % 2 == 0 ? so[N - l] : se[N - l]);
}
int main(void) {
cin >> N >> Q;
REP(i, 0, N) cin >> A[i];
REP(i, 0, Q) cin >> X[i];
REP(i, 0, N) sum[i + 1] = sum[i] + A[i];
REP(i, 0, N) se[i + 1] = se[i] + (i % 2 == 0 ? A[i] : 0);
REP(i, 0, N) so[i + 1] = so[i] + (i % 2 == 1 ? A[i] : 0);
REP(i, 0, Q) cout << solve(X[i]) << endl;
} |
p03158 | C++ | #include <bits/stdc++.h>
#define REP(i, a, n) for (ll i = ((ll) a); i < ((ll) n); i++)
using namespace std;
typedef long long ll;
ll N, Q, A[100000], X[100000];
ll sum[100001], se[100001], so[100001];
bool check(ll x, ll a, ll b) {
if (abs(A[b] - x) < abs(A[a] - x)) return true;
if (abs(A[b] - x) == abs(A[a] - x)) return b < a;
return false;
}
ll solve(ll x) {
ll l = 1, h = N + 1;
while (h - l > 1) {
ll m = (l + h) / 2;
ll p = (m + 1) / 2;
ll q = m / 2;
if (check(x, N - m, N - p)) h = m;
else l = m;
}
return (sum[N] - sum[N - (l + 1) / 2]) + (N % 2 == 0 ? so[N - l] : se[N - l]);
}
int main(void) {
cin >> N >> Q;
REP(i, 0, N) cin >> A[i];
REP(i, 0, Q) cin >> X[i];
REP(i, 0, N) sum[i + 1] = sum[i] + A[i];
REP(i, 0, N) se[i + 1] = se[i] + (i % 2 == 0 ? A[i] : 0);
REP(i, 0, N) so[i + 1] = so[i] + (i % 2 == 1 ? A[i] : 0);
REP(i, 0, Q) cout << solve(X[i]) << endl;
} |
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using tpl = tuple<int, int, int>;
typedef pair<int,int> pii;
void fastStream(){cin.tie(0);std::ios_base::sync_with_stdio(0);}
ll N;
ll Q;
ll A[100010];
ll X[100010];
ll sums1[100010];
ll sums_alt[100010];
bool check(ll k, ll x){
// A[N - k] の要素まで取ることができる
// x からの差分を計算する
ll diff = A[N - k] - x;
ll l = lower_bound(A, A + N, x - diff) - A;
ll r = lower_bound(A, A + N, x + diff) - A;
ll cnt = r - l + 1;
// cout << k << " " << cnt << endl;
return (cnt >= k);
}
int main(){
cin >> N >> Q;
for(ll i = 0; i < N; i++){
cin >> A[i];
}
for(ll i = 0; i < Q; i++){
cin >> X[i];
}
for(ll i = 0; i < N; i++){
sums1[i + 1] = sums1[i] + A[i];
sums_alt[i + 1] = A[i];
if(i - 1 >= 0) {
sums_alt[i + 1] += sums_alt[i - 1];
}
}
for(ll i = 0; i < Q; i++){
ll ub = N + 1;
ll lb = 1;
while(ub - lb > 1){
// cout << ub << ", " << lb << endl;
ll mid = (ub + lb) / 2;
if(check(mid, X[i])){
lb = mid;
}
else{
ub = mid;
}
}
ll K = lb;
// cout << K << endl;
// cout << sums_alt[N-2*K] << endl;
ll ans = sums1[N] - sums1[N - K] + (N - 2 * K >= 0 ? sums_alt[N - 2 * K] : 0);
cout << ans << endl;
}
}
|
p03158 | C++ | #include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 1e5;
int n,q;
LL li[N+5];
LL pso[N+5];
LL ps[N+5];
int main(){
scanf("%d%d",&n,&q);
for(int i=1;i<=n;i++) scanf("%lld",&li[i]),ps[i]=ps[i-1]+li[i];
for(int i=2;i<=n;i+=2) pso[i] = pso[i-2]+li[i];
while(q--){
int x;
scanf("%d",&x);
int l = 1;
int r = n;
int id = 0;
while(l<=r){
int mid = (l+r)/2;
if(li[mid] > x){
r = mid-1;
} else {
id = mid;
l = mid+1;
}
}
// cout << ">>> " << id << endl;
l = min(n,max(id,n/2));
r = n;
int ans = l-1;
while(l<=r){
int mid = (l+r)/2;
// cout << "mid = " << mid << endl;
int tmp = n-mid;
int ud = mid-id;
int sisa = tmp-ud;
int idd = id-sisa+1;
idd = min(id,idd);
int dif = x-li[idd+1];
if(dif <= abs(li[mid+1]-x)){
ans = mid;
r = mid-1;
} else {
l = mid+1;
}
}
// cout << ">> " << ans << endl;
LL jaw = ps[n] - ps[ans];
int tmp = n-ans;
int idd = max(0,ans-tmp);
if(idd%2==0) jaw+=pso[idd];
else jaw+=ps[idd]-pso[idd-1];
printf("%lld\n",jaw);
}
return 0;
}
|
p03158 | C++ | #include <bits/stdc++.h>
#define REP(i, a, n) for (ll i = ((ll) a); i < ((ll) n); i++)
using namespace std;
typedef long long ll;
ll N, Q, A[100000], X[100000];
ll sum[100001], se[100001], so[100001];
bool check(ll x, ll a, ll b) {
if (!(0 <= a && a < N)) return true;
if (!(0 <= b && b < N)) return false;
if (abs(A[b] - x) < abs(A[a] - x)) return true;
if (abs(A[b] - x) == abs(A[a] - x)) return b < a;
return false;
}
ll solve(ll x) {
ll l = 1, h = N + 1;
while (h - l > 1) {
ll m = (l + h) / 2;
ll p = (m + 1) / 2;
ll q = m / 2;
if (check(x, N - m, N - p)) h = m;
else l = m;
}
return (sum[N] - sum[N - (l + 1) / 2]) + (N % 2 == 0 ? so[N - l] : se[N - l]);
}
int main(void) {
cin >> N >> Q;
REP(i, 0, N) cin >> A[i];
REP(i, 0, Q) cin >> X[i];
REP(i, 0, N) sum[i + 1] = sum[i] + A[i];
REP(i, 0, N) se[i + 1] = se[i] + (i % 2 == 0 ? A[i] : 0);
REP(i, 0, N) so[i + 1] = so[i] + (i % 2 == 1 ? A[i] : 0);
REP(i, 0, Q) cout << solve(X[i]) << endl;
} |
p03158 | C++ | #include <bits/stdc++.h>
#define REP(i, a, n) for (ll i = ((ll) a); i < ((ll) n); i++)
using namespace std;
typedef long long ll;
ll N, Q, A[100000], X[100000];
ll sum[100001], se[100001], so[100001];
bool ok(ll x, ll a, ll b) {
if (!(0 <= a && a < N)) return true;
if (!(0 <= b && b < N)) return false;
ll da = abs(A[a] - x);
ll db = abs(A[b] - x);
if (db < da) return true;
if (db == da) return b < a;
return false;
}
ll solve(ll x) {
ll l = 1, h = N + 1;
while (h - l > 1) {
ll m = (l + h) / 2;
ll p = (m + 1) / 2;
ll q = m / 2;
if (ok(x, N - m, N - p)) h = m;
else l = m;
}
ll u = N - (l + 1) / 2;
ll v = N - l;
return (sum[N] - sum[u]) + (((l % 2) + (v % 2)) % 2 == 0 ? so[v] : se[v]);
}
int main(void) {
cin >> N >> Q;
REP(i, 0, N) cin >> A[i];
REP(i, 0, Q) cin >> X[i];
REP(i, 0, N) {
sum[i + 1] = sum[i] + A[i];
se[i + 1] = se[i] + (i % 2 == 0 ? A[i] : 0);
so[i + 1] = so[i] + (i % 2 == 1 ? A[i] : 0);
}
REP(i, 0, Q) {
cout << solve(X[i]) << endl;
}
} |
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a[100010];
ll sum[100010];
vector<ll> sum1;
vector<ll> sum2;
int n;
bool ok(int num, int x) {
ll aa = a[n - num * 2 + 1];
//int bb = a[n - num - 1];
//int cc = a[n - num * 2 - 1];
ll dd = a[n - num];
return (ll)x - aa <= dd - (ll)x;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n;
int q;
cin >> q;
sum1.push_back(0LL);
sum2.push_back(0LL);
for (int i = 0; i < n; i++) {
cin >> a[i];
if (i & 1) {
sum2.push_back(a[i]);
} else {
sum1.push_back(a[i]);
}
}
for (int i = 1; i <= n; i++) {
sum[i] = a[i - 1];
sum[i] += sum[i - 1];
}
for (int i = 1; i < sum1.size(); i++) {
sum1[i] += sum1[i - 1];
}
for (int i = 1; i < sum2.size(); i++) {
sum2[i] += sum2[i - 1];
}
int aoki = n / 2, taka = n - aoki;
while (q--) {
int x;
cin >> x;
ll midr = a[aoki];
if (x <= midr && midr - x >= x - a[0]) {
cout << sum[n] - sum[aoki] << endl;
continue;
}
int ret = 0;
for (int i = 20; i >= 0; i--) {
if ((ret + (1 << i)) * 2 > n) continue;
ll left = a[n - (ret + (1 << i)) * 2];
ll right = a[n - (ret + (1 << i))];
if (x < left) {ret += (1 << i); continue;}
if (x > right) continue;
if (ok(ret + (1 << i), x)) ret += (1 << i);
}
ll ans = 0;
ans += sum[n] - sum[n - ret];
//cout << "ret " << ret << endl;
//cout << "a " << ans << endl;
int k = n - ret * 2;
k /= 2;
if (n & 1) k++;
if (n & 1) ans += sum1[k];
else ans += sum2[k];
cout << ans <<endl;
}
return 0;
}
|
p03158 | C++ | //https://atcoder.jp/contests/aising2019/tasks/aising2019_d
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
#ifdef BTK
#define DEBUG if(1)
#else
#define CIN_ONLY if(1)
struct cww {cww() {CIN_ONLY{ios::sync_with_stdio(false); cin.tie(0);}}}star;
#define DEBUG if(0)
#endif
#define ALL(v) (v).begin(),(v).end()
#define REC(ret, ...) std::function<ret (__VA_ARGS__)>
template <typename T>inline bool chmin(T &l, T r){bool a = l>r; if (a)l = r; return a;}
template <typename T>inline bool chmax(T &l, T r){bool a = l<r; if (a)l = r; return a;}
template <typename T>istream& operator>>(istream &is, vector<T> &v){for (auto &it : v)is >> it;return is;}
class range {private: struct I { int x; int operator*() { return x; }bool operator!=(I& lhs) { return x<lhs.x; }void operator++() { ++x; } }; I i, n;public:range(int n) :i({ 0 }), n({ n }) {}range(int i, int n) :i({ i }), n({ n }) {}I& begin() { return i; }I& end() { return n; }};
int N,Q;
LL A[112345];
LL X[112345];
LL AS[112345];
LL ASS[112345][2];
bool check(LL x,int l,int r){
if(l<0)return false;
return max(abs(x-A[l]),abs(x-A[r-1]))<abs(x-A[r]);
}
int main(){
cin>>N>>Q;
for(int i:range(N)){
cin>>A[i];
AS[i+1]=AS[i]+A[i];
ASS[i+1][0]+=ASS[i][0];
ASS[i+1][1]+=ASS[i][1];
ASS[i+1][i%2]+=A[i];
}
for(int i:range(Q))cin>>X[i];
for(int i:range(N))A[i]=A[i]*3+1;
for(int i:range(Q))X[i]=X[i]*3;
for(int i:range(Q)){
int lb=0,ub=(N+1)/2+1;
while(ub-lb>1){
const int mid = (lb+ub)/2;
const int r=N-mid;
const int l=N-mid-mid;
if(check(X[i],l,r)||check(X[i],l+1,r))lb=mid;
else ub=mid;
}
//cout<<lb<<" ";
{
int r=N-lb;
int l=max(N-lb-lb,0);
LL first = AS[N]-AS[r];
LL second = ASS[l][1-N%2];
cout<<first+second<<endl;
}
}
return 0;
}
|
p03158 | C++ | #include <bits/stdc++.h>
#define all(vec) vec.begin(),vec.end()
#define mp make_pair
using namespace std;
using ll=long long;
using P=pair<int,int>;
const ll INF=1LL<<30;
const ll LINF=1LL<<60;
const double eps=1e-5;
const ll MOD=1e+7;
template<typename T>void chmin(T &a,T b){a=min(a,b);};
template<typename T>void chmax(T &a,T b){a=max(a,b);};
int dx[4]={0,1,0,-1};
int dy[4]={1,0,-1,0};
int main(){
int n,q;cin>>n>>q;
vector<ll> a(n+10),s1(n+10),s2(n+10),s3(n+10);
for(int i=0;i<n;i++)cin>>a[i];
for(int i=n-1;i>=0;i--)s1[i]=s1[i+1]+a[i];
for(int i=0;i<n;i++){
if(i%2){
s3[i]+=a[i];
}else{
s2[i]+=a[i];
}
s2[i+1]+=s2[i];
s3[i+1]+=s3[i];
}
for(int i=0;i<q;i++){
ll x;cin>>x;
int ok=-1,ng=n+1;
while(ng-ok>1){
int k=(ok+ng)/2;
if(abs(a[n-k]-x)<=abs(a[n-k/2-k%2]-x)){
ok=k;
}else{
ng=k;
}
}
cout<<s1[n-ok/2-ok%2]+(ok<n?(n%2?s2[n-ok-1]:s3[n-ok-1]):0)<<endl;
}
}
|
p03158 | C++ | #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <cmath>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <functional>
#include <iomanip>
#include <bitset>
using namespace std;
typedef long long ll;
int main() {
int N, Q; cin >> N >> Q;
vector<ll> a(N + 1), xs(Q);
ll ma = 0;
for (int i = 1; i <= N; i++) cin >> a[i], a[i] *= 4, ma = max(ma, a[i]);
for (int i = 0; i < Q; i++) cin >> xs[i], xs[i] = 4*xs[i] - 1, ma = max(ma, xs[i]);
vector<ll> sum(N + 2), jmp(N + 2);
for (int i = 1; i <= N; i++) sum[i] = sum[i - 1] + a[i];
jmp[1] = a[1];
for (int i = 2; i <= N; i++) jmp[i] = jmp[i - 2] + a[i];
for (ll x : xs) {
ll blo = 0, bhi = ma + 1;
int llo, lhi, hlo, hhi;
while (bhi - blo > 1) {
ll bmid = blo + (bhi - blo) / 2;
hlo = 0, hhi = N + 1;
while (hhi - hlo > 1) {
int mid = hlo + (hhi - hlo) / 2;
if (a[mid] > x + bmid) hhi = mid;
else hlo = mid;
}
llo = 0, lhi = N + 1;
while (lhi - llo > 1) {
int mid = llo + (lhi - llo) / 2;
if (a[mid] >= x - bmid) lhi = mid;
else llo = mid;
}
if (N - hlo >= hlo - llo) blo = bmid;
else bhi = bmid;
}
hlo = 0, hhi = N + 1;
while (hhi - hlo > 1) {
int mid = hlo + (hhi - hlo) / 2;
if (a[mid] > x + blo) hhi = mid;
else hlo = mid;
}
llo = 0, lhi = N + 1;
while (lhi - llo > 1) {
int mid = llo + (lhi - llo) / 2;
if (a[mid] >= x - blo) lhi = mid;
else llo = mid;
}
ll ans = sum[N] - sum[hlo];
if (N - hlo > hlo - llo && llo > 0) ans += jmp[llo - 1];
else ans += jmp[llo];
ans /= 4;
cout << ans << endl;
}
return 0;
}
|
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
int a[111111];
long b[111111], o[111111];
int main() {
int n, q;
cin >> n >> q;
for (int i = 0; i < n; i++) {
scanf("%d", a + i);
b[i + 1] = b[i] + a[i];
o[i + 1] = o[i] + (i % 2 ? a[i] : 0);
}
a[n] = 1e9 + 1;
for (int i = 0; i < q; i++) {
int x;
scanf("%d", &x);
int l = 0, r = n;
while (l + 1 < r) {
int m = (l + r) / 2;
if (n - m <= m || x - a[n - m - m - 1] > a[n - m - 1] - x)
r = m;
else l = m;
}
if (n - l <= l || x - a[n - l - l - 1] > a[n - l - 1] - x)
r = 0;
else r = 1, l++;
cout << b[n] - b[n - l] + (n % 2 ? b[n - l - l + r] - o[n - l - l + r] : o[n - l - l + r]) << '\n';
}
cout << flush;
return 0;
}
|
p03158 | C++ | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
#define ll long long
#define pb push_back
#define sz(x) (int)(x).size()
#define mp make_pair
#define f first
#define s second
#define all(x) x.begin(), x.end()
#define D(x) cerr << #x << " is " << (x) << "\n";
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>; ///find_by_order(),order_of_key()
template<class T1, class T2> ostream& operator<<(ostream& os, const pair<T1,T2>& a) { os << '{' << a.f << ", " << a.s << '}'; return os; }
template<class T> ostream& operator<<(ostream& os, const vector<T>& a){os << '{';for(int i=0;i<sz(a);i++){if(i>0&&i<sz(a))os << ", ";os << a[i];}os<<'}';return os;}
template<class T> ostream& operator<<(ostream& os, const set<T>& a) {os << '{';int i=0;for(auto p:a){if(i>0&&i<sz(a))os << ", ";os << p;i++;}os << '}';return os;}
template<class T> ostream& operator<<(ostream& os, const multiset<T>& a) {os << '{';int i=0;for(auto p:a){if(i>0&&i<sz(a))os << ", ";os << p;i++;}os << '}';return os;}
template<class T1,class T2> ostream& operator<<(ostream& os, const map<T1,T2>& a) {os << '{';int i=0;for(auto p:a){if(i>0&&i<sz(a))os << ", ";os << p;i++;}os << '}';return os;}
vector<int> a;
int n;
vector<ll> sol[2];
vector<ll> suffix;
ll solve(int x)
{
int i=lower_bound(a.begin(),a.end(),x)-a.begin();
//printf("%i\n",i);
if(i==n)
return sol[0][n-1];
int l=i,r=n-1;
while(l<r)
{
int mid=(l+r)>>1;
int num=mid-i+1;
int diff=a[mid]-x;
assert(diff>=0);
int j=lower_bound(a.begin(),a.end(),x-diff)-a.begin();
num=i-j+num;
int drugi=n-mid-1;
if(drugi<num)
r=mid;
else
l=mid+1;
}
int num=l-i+1;
int diff=a[l]-x;
assert(diff>=0);
int j=lower_bound(a.begin(),a.end(),x-diff)-a.begin();
num=i-j+num;
int drugi=n-l-1;
if(num==drugi)
{
ll s=suffix[l+1];
if(j>0)
s+=sol[0][j-1];
return s;
}
if(num==drugi-1)
{
ll s=suffix[l+1];
if(j>0)
s+=sol[1][j-1];
return s;
}
ll s=suffix[l];
num--;
drugi++;
int pos=j-1+num-drugi;
if(pos>=0)
s+=sol[0][pos];
return s;
}
int main()
{
int q;
scanf("%i %i",&n,&q);
a.resize(n);
sol[0].resize(n);
sol[1].resize(n);
suffix.resize(n);
for(int i=0;i<n;i++)
scanf("%i",&a[i]);
a.pb({INT_MAX});
sol[0][0]=a[0];
sol[1][0]=0;
suffix[n-1]=a[n-1];
for(int i=n-2;i>=0;i--)
suffix[i]=(ll)suffix[i+1]+a[i];
for(int i=1;i<n;i++)
{
sol[0][i]=(ll)a[i]+sol[1][i-1];
sol[1][i]=sol[0][i-1];
}
for(int i=0;i<q;i++)
{
int x;
scanf("%i",&x);
printf("%lld\n",solve(x));
}
return 0;
}
|
p03158 | C++ | #include<bits/stdc++.h>
#define REP(i,s,n) for(int i=s;i<n;++i)
#define rep(i,n) REP(i,0,n)
#define ALL(x) x.begin(),x.end()
#define EPS (1e-8)
#define equals(a,b) (fabs((a)-(b))<EPS)
using namespace std;
typedef long long ll;
bool LTE(double a,double b) { return equals(a,b) || a < b; }
bool LT(double a,double b) { return !equals(a,b) && a < b; }
const bool debug = 0;
#define MAX 100100
int N,Q;
int A[MAX], X[MAX];
ll sum[MAX], sum0[MAX];
bool check(int i, int x) {
int diff = abs( A[i] - x );
int L = lower_bound(A,A+N,x-diff) - A;
int idx = i - L;
int xyz = N - 1 - i;
if( debug ) {
cout << " -- i = " << i << ", x = " << x << endl;
cout << " idx = " << idx << ", xyz = " << xyz << endl;
}
return idx < xyz;
}
int calcPos(int x) {
int L = 0, R = N;
while( R - L ){
int M = ( L + R ) / 2;
if( check(M,x) ) L = M + 1LL;
else R = M;
}
return L;
}
void compute() {
sum[0] = sum0[0] = A[0];
REP(i,1,N) {
sum[i] = sum[i-1] + A[i];
sum0[i] = sum0[i-1];
if( i % 2 == 0 ) sum0[i] += A[i];
}
rep(i,Q) {
int tL = calcPos(X[i]);
int len = N - tL;
int aL = tL - len;
if( debug ) {
cout << i << "-th :" << endl;
cout << " tL = " << tL << endl;
cout << " aL = " << aL << endl;
}
if( aL - 1 < 0 ) {
cout << sum[N-1] - ( ( tL - 1 >= 0 ) ? sum[tL-1] : 0 ) << endl;
} else {
ll answer = sum[N-1] - ( ( tL - 1 >= 0 ) ? sum[tL-1] : 0 );
if( N & 1 ) {
answer += sum0[aL-1];
} else {
answer += ( sum[aL-1] - sum0[aL-1] );
}
cout << answer << endl;
}
}
}
int main() {
cin >> N >> Q;
rep(i,N) cin >> A[i];
rep(i,Q) cin >> X[i];
compute();
return 0;
}
|
p03158 | C++ | #include <iostream>
#include <cstdio>
#include <vector>
#include <cmath>
#include <cstring>
#include <numeric>
#include <algorithm>
#include <functional>
#include <array>
#include <map>
#include <queue>
#include <limits.h>
#include <set>
#include <stack>
#include <random>
#include <complex>
#include <unordered_map>
#define rep(i,s,n) for(int i = (s); (n) > i; i++)
#define REP(i,n) rep(i,0,n)
#define RANGE(x,a,b) ((a) <= (x) && (x) < (b))
#define DUPLE(a,b,c,d) (RANGE(a,c,d) || RANGE(b,c,d) || RANGE(c,a,b) || RANGE(d,a,b))
#define INCLU(a,b,c,d) (RANGE(a,c,d) && (b,c,d))
#define PW(x) ((x)*(x))
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define MODU 1000000007
#define bitcheck(a,b) ((a >> b) & 1)
#define bitset(a,b) ( a |= (1 << b))
#define bitunset(a,b) (a &= ~(1 << b))
#define MP(a,b) make_pair((a),(b))
#define Manh(a,b) (abs((a).first-(b).first) + abs((a).second - ((b).second))
#define pritnf printf
#define scnaf scanf
#define itn int
#define PI 3.141592653589
#define izryt bool
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
template<typename A, size_t N, typename T>
void Fill(A(&array)[N], const T &val) {
std::fill((T*)array, (T*)(array + N), val);
}
pii Dir[8] = { //移動
{ 0 ,1 },{ -1 ,0 },{ 1 ,0 },{ 0 ,-1 },
{ 1 ,1 },{ 1 ,-1 },{ -1 ,1 },{ -1 ,-1 }
};
//[a, b)
#define Getsum(ar, a,b) (ar[b] - ar[a])
#define int ll
signed main(void) {
int n, q;
cin >> n >> q;
ll sumsum = 0;
vector<ll> a(n), x(q), rui(n + 1), oddrui(n + 1), everui(n + 1);
vector<ll> ans(q);
REP(i, n) {
scanf("%lld", &a[i]);
sumsum += a[i];
rui[i + 1] = a[i] + rui[i];
oddrui[i + 1] = oddrui[i] + (i % 2 ? a[i] : 0);
everui[i + 1] = everui[i] + (i % 2 ? 0 : a[i]);
}
REP(i, q) {
scanf("%lld", &x[i]);
}
REP(qnum, q) {
ll target = x[qnum];
int nearest = lower_bound(ALL(a), target) - a.begin();
if (nearest == a.size()) nearest = a.size() - 1;
else if(nearest > 0){
if (abs(a[nearest] - target) > abs(a[nearest - 1] - target))
nearest--;
}
auto calcturn = [&](int right) {
int dist = a[right] - target;
int leftbound = target - dist; //kore ijou ha hukumareru
int lbound = lower_bound(ALL(a), leftbound) - a.begin();
return right - lbound + 1;
};
int ri = a.size(), le = 0;
while (ri-1 > le) {
int mid = (ri + le) / 2;
int turn = calcturn(mid);
if (mid >= a.size() - turn) {//kabuttetara out
ri = mid;
}
else le = mid;
}
int turn = calcturn(le);
int amari = a.size() - turn - le - 1;
int rightbound = le;
int leftbound = le + 1 - turn - amari;
leftbound = max(0LL, leftbound);
int sum = Getsum(rui, max(0LL,leftbound), rightbound + 1);
if (n % 2) {
sum += oddrui[max(0LL,leftbound-1)];
}
else {
sum += everui[max(0LL, leftbound - 1)];
}
printf("%lld\n", sumsum - sum);
}
return 0;
}
|
p03158 | C++ | #include<bits/stdc++.h>
using namespace std;
using ll = int64_t;
const ll MOD = 1e9 + 7;
const ll INF = 5e15;
int main(){
ll N;
ll Q;
cin >> N >> Q;
vector<ll> A(N);
for(ll &a : A) cin >> a;
auto AR = A;
reverse(AR.begin(), AR.end());
for(ll &a : AR) a *= -1;
vector<ll> sum(N + 1), osum(N + 1), esum(N + 1);
for(ll i = 0; i < N; i++){
sum[i + 1] = sum[i] + A[i];
osum[i + 1] = osum[i];
esum[i + 1] = esum[i];
(i % 2 ? osum : esum)[i + 1] += A[i];
}
if(N == 2){
for(ll i = 0; i < Q; i++) cout << A[1] << '\n';
return 0;
}
for(ll QQ = 0; QQ < Q; QQ++){
ll X;
cin >> X;
ll ok = 0, ng = 1e10;
if(abs(X - A[N - 2]) > abs(X - A[N - 1])){
cout << (N & 1 ? esum[N] : osum[N]) << '\n';
continue;
}
while(abs(ok - ng) > 1){
ll mid = (ok + ng) / 2;
auto ite1 = upper_bound(A.begin(), A.end(), X + mid);
auto ite2 = upper_bound(AR.begin(), AR.end(), -(X - mid));
ll right = ite1 - A.begin() - 1;
ll left = AR.end() - ite2;
if(left == N){ // <=> right == -1 ????
ng = mid;
continue;
}
ll cnt = right - left + 1;
ll senkou = N - cnt;
if(right < senkou || (right == senkou && A[right] == X + mid && A[left] == X - mid)) ok = mid;
else ng = mid;
}
auto ite1 = upper_bound(A.begin(), A.end(), X + ok);
auto ite2 = upper_bound(AR.begin(), AR.end(), -(X - ok));
ll idx1 = ite1 - A.begin() - 1;
ll idx2 = AR.end() - ite2;
ll cnt = (idx1 - idx2 + 1);
ll snum = cnt, knum = cnt;
if(idx1 == N - snum){
idx1--;
cnt--;
}
ll senkou = sum[N] - sum[idx1 + 1];
ll koukou = sum[idx1 + 1] - sum[idx2];
if(N & 1){
if((knum + snum) % 2 == 0){
senkou += esum[idx2];
koukou += osum[idx2];
}else{
senkou += osum[idx2];
koukou += esum[idx2];
}
}else{
if((knum + snum) % 2 == 0){
senkou += osum[idx2];
koukou += esum[idx2];
}else{
senkou += esum[idx2];
koukou += osum[idx2];
}
}
cout << senkou << '\n';
}
return 0;
}
|
p03158 | C++ | #include <bits/stdc++.h>
#include <boost/range/irange.hpp>
using namespace std;
using namespace boost;
main() {
int64_t n, q;
cin >> n >> q;
vector<int64_t> a(n);
vector<int64_t> sum;
vector<int64_t> psum;
for (auto&& aa : a) {
cin >> aa;
sum.push_back(sum.empty() ? 0 : sum.back());
sum.back() += aa;
psum.push_back(psum.size() >= 2 ? psum[psum.size() - 2] : 0);
psum.back() += aa;
}
for (auto _ : irange(0L, q)) {
int64_t x;
cin >> x;
auto r = irange(0L, n);
auto i = *partition_point(r.begin(), r.end(), [x, n, &a](int64_t i) {
// i ～ n-1 番目までを全て先手がとるときにfalse
auto k = n - i;
auto j = n - 2 * k + 1;
if (j < 0) {
return true;
}
auto c = a[j];
auto d = a[i];
if (abs(c - x) <= abs(d - x)) {
return false;
}
return true;
});
int64_t ans = 0;
ans += sum.back() - sum[i - 1];
auto k = n - i;
auto j = n - 2 * k - 1;
if (j >= 0) {
ans += psum[j];
}
cout << ans << endl;
}
} |
p03158 | C++ | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int N, Q;
long long int A[100005], X[100005];
long long int S[100005];
long long int L[100005];
vector<long long int >V;
int ORDER(long long int X, long long int val) {
long long int W;
if (X > val) { W = X - val; }
else { W = val - X; }
auto it1 = upper_bound(V.begin(), V.end(), X + W);
auto it2 = lower_bound(V.begin(), V.end(), X - W);
int num = it1 - it2;
it1--;
if (((*it1)-X) != (X-(*it2))) { return num; }
else {
if (val < X) { return num - 1; }
}
return num;
}
int POSSIBLE(long long int X,int M) {
if (X > V[M-1]) { return -1; }
if (ORDER(X, V[M-1]) >= N - M + 1) { return 1; }
return -1;
}
int BINARY(long long int X) {
int left, med, right;
left = 1; right = N;
while (right-left>1) {
//cout << "left= " << left << " right= " << right << endl;
med = (right + left) / 2;
if (POSSIBLE(X, med) == 1) {
right= med;
}
else {
left = med;
}
}
//cout << "left= " << left << " right= " << right << endl;
return right;
}
int main(void) {
cin >> N >> Q;
for (int i = 1; i <= N; i++) {
cin >> A[i];
V.push_back(A[i]);
}
for (int i = 1; i <= Q; i++) {
cin >> X[i];
}
S[1] = A[1]; S[2] = A[2];
for (int i = 3; i <= N; i++) {
S[i] =A[i]+S[i - 2];
}
for (int i = N; i >= 1; i--) {
L[i] = A[i] + L[i + 1];
}
long long int ans;
for (int i = 1; i <= Q; i++) {
int M = BINARY(X[i]);
//cout << X[i] << " " << BINARY(X[i]) << endl;
if (M<=N/2+1) {
ans = L[N/ 2+1];
}
else {
ans = L[M] + S[M -(N-M+1)- 1];
}
cout << ans << endl;
}
//system("pause");
return 0;
} |
p03158 | C++ | #include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <sstream>
#include <cassert>
#include <queue>
#include <bitset>
#include <ctime>
using namespace std;
#define forr(i, a, b) for(int i = (a); i < (int) (b); i++)
#define forn(i, n) forr(i, 0, n)
#define db(v) cerr << #v << " = " << v << endl
#define pb push_back
#define sz(x) ((int)x.size())
#define fst first
#define snd second
typedef long long ll;
typedef pair<int, int> ii;
const int MAXN = 100050;
int n, q, A[MAXN], x;
ll add[MAXN], alt[MAXN];
ll suf(int p){
return add[n]-add[p];
}
int main(){
while(scanf("%d %d", &n, &q) >= 1){
memset(add, 0, sizeof(add));
memset(alt, 0, sizeof(alt));
forn(i, n){
scanf("%d", &A[i]);
add[i+1] = add[i] + A[i];
alt[i+1] = (i?alt[i-1]:0)+A[i];
}
forn(z, q){
scanf("%d", &x);
ll ans = 0;
int a = -1;
int b = (int)2e9 + 9901;
while(b - a > 1){
int c = a + (b - a) / 2;
int left = x - (c+1)/2;
int right = x + 1 + c/2;
int itl = lower_bound(A, A+n, left) - A;
int itr = lower_bound(A, A+n, right) - A;
ii aoki = {itl, itr}; int len = (itr-itl);
ii taka = {n-len, n};
//~ printf("[%d, %d) = ranges [%d, %d), [%d, %d)\n", left, right, aoki.fst, aoki.snd, taka.fst, taka.snd);
// take care of case both empty sets...
ii inter = {max(aoki.fst, taka.fst), min(aoki.snd, taka.snd)};
int dif = inter.snd - inter.fst;
//~ printf("DIF = %d\n", dif);
if(len == 0){
a = c;
} else if(dif >= 1){
b = c;
if(dif == 1 && len == 1){
if(!ans) ans = alt[n];
}
} else if(dif == 0){
//~ printf("[%d, %d) vs [%d, %d) = %lld + %lld\n", aoki.fst, aoki.snd, taka.fst, taka.snd, alt[aoki.fst], suf(taka.fst));
ans = alt[aoki.fst] + suf(taka.fst);
break;
} else if(dif == -1){
ans = (add[aoki.fst]-alt[aoki.fst]) + suf(taka.fst-1);
break;
} else {
a = c;
}
}
printf("%lld\n", ans);
}
}
return 0;
}
|
p03158 | C++ | #include<iostream>
using namespace std; // 575
const int MAX = 100001;
int main() {
int N, Q;
static int A[MAX], X;
cin >> N >> Q;
for (int i = 0;i < N;++ i) cin >> A[i];
static pair<int, long long> ans[MAX]; // ans[i].first ≦ X < ans[i + 1].firstならans[i].secondが答えになるよ
ans[0] = make_pair(0, 0);
for (int i = N / 2;i < N;++ i) ans[0].second += A[i]; // xが最小の時の答え
for (int i = 0, l = N + 1 & 1, r = N / 2;r < N;++ i, l += 2, ++ r) ans[i + 1] = make_pair((A[r] + A[l]) / 2, ans[i].second - A[r] + A[l]); // 区間(l, r]が青木くんが連続して取った区間だよ
for (int i = 0, min, mid, max, halfDiff;i < Q;++ i) {
min = 0;
max = (N + 3) / 2;
cin >> X;
while(halfDiff = max - min >> 1) (ans[mid = min + halfDiff].first < X ? min : max) = mid; // 二分探索O(logN)
cout << ans[min].second << endl;
}
return 0;
}
/*
31536000のコメント解説欄
ここテンプレで用意してるから、A問題とかだとこの先空欄の危険あり
また、コンテスト後に https://31536000.hatenablog.com/ で解説していると思うので、良かったら読んでねー
O(N+QlogN)
*/ |
p03158 | C++ | #include "bits/stdc++.h"
using namespace std;
using ll=long long;
using ull=unsigned long long;
typedef pair<int,int>Pi;
typedef pair<long long,long long>P;
typedef pair<long long,P>PP;
typedef pair<P,P>PPP;
const long long MOD=1e9+7;
const long long INF=5e18;
const int di[4]={1,0,-1,0};
const int dj[4]={0,1,0,-1};
#define fr first
#define sc second
#define pb push_back
#define eb emplace_back
#define ALL(x) (x).begin(),(x).end()
#define ALLR(x) (x).rbegin(),(x).rend()
int n,q;
ll a[100010],x,sum[100010],osum[100010],esum[100010];
void input(){
cin>>n>>q;
for(int i=0;i<n;i++){
cin>>a[i];
sum[i+1]=sum[i]+a[i];
if(i%2==0)esum[i+1]=esum[i]+a[i],osum[i+1]=osum[i];
else osum[i+1]=osum[i]+a[i],esum[i+1]=esum[i];
}
return;
}
void solve(){
while(q--){
cin>>x;
int l=0,r=(n+1)/2,mid;
while(r-l>1){
mid=(r+l)/2;
if(n-mid*2<0){
r=mid;
continue;
}
int it2=n-mid-1,it1=n-mid*2-1;
if(abs(x-a[it2])<abs(x-a[it1]))r=mid;
else l=mid;
}
ll ans=sum[n]-sum[n-r];
if((n-r*2)%2==0)ans+=osum[n-r*2];
else ans+=esum[n-r*2];
cout<<ans<<endl;
}
return;
}
int main(){
input();
solve();
return 0;
} |
p03158 | C++ | #include<cstdio>
#include<cmath>
#include<cstdlib>
using namespace std;
int main(){
long sum[100001],sum1[100001],a[100000],f[50000],l,r,mid,z;
int n,q,x;
scanf("%d %d",&n,&q);
sum[0]=sum1[0]=0;
for(int i=0;i<n;i++){
scanf("%ld",&a[i]);
sum[i+1]=sum[i]+a[i];
sum1[i+1]=sum1[i];
if(i%2!=n%2){
sum1[i+1]+=a[i];
}
}
f[n/2-1]=0;
for(int i=0;i<n/2;i++){
x=n-2-2*i;
if(x==0){
break;
}
l=a[x-1];
r=a[n-1-i];
while(l<=r){
mid=(l+r)/2;
if(labs(a[n-i-2]-mid)<labs(a[x-1]-mid)){
r=mid-1;
}
else{
l=mid+1;
}
}
f[i]=l;
}
for(int i=0;i<q;i++){
scanf("%d",&z);
if(n%2&&z<f[n/2-1]){
printf("%ld\n",sum[n]-sum[n/2]);
}
else{
l=0;
r=n/2-1;
while(l<r){
mid=(l+r)/2;
if(f[mid]>z){
l=mid+1;
}
else{
r=mid;
}
}
printf("%ld\n",sum[n]-sum[n-l-1]+sum1[n-(l+1)*2]);
}
}
} |
p03158 | C++ |
#include "bits/stdc++.h"
using namespace std;
int Array[100005];
long long Prefix[3][100005];
int N;
int BinarySearch( int low , int high , int key ){
if( low >= high ) return low;
else{
int middle = ( low + high ) >> 1;
if( Array[middle] == key ) return middle;
else if( Array[middle] > key ) return BinarySearch( low , middle - 1 , key );
else return BinarySearch( middle + 1 , high , key );
}
}
bool IsPossible( int middle , int start , int X ){
int a = middle - start;
int b = N - middle + 1 - a;
int l = start - b + 1;
if( l <= 0 ) return false;
if( middle == start ){
if( l == middle ) return true;
else{
if( Array[middle] - X >= X - Array[l] ) return true;
else return false;
}
}
if( X - Array[l] > Array[middle - 1] - X ){
if( Array[middle] - X >= X - Array[l] ) return true;
else return false;
}
else return true;
}
pair<int,int> Find_Segment( int start , int X ){
int low = start , high = N , middle;
int length = ceil( (float)(N - start + 1) / 2 );
while( low < high ){
middle = ( low + high ) >> 1;
if( N - middle + 1 <= length ) high = middle - 1;
else{
if( IsPossible( middle , start , X ) ) high = middle - 1;
else low = middle + 1;
}
}
if( !IsPossible( low , start , X ) ) ++low;
int b = N - low + 1 - ( low - start );
return make_pair( start - b - 1 , low );
}
int main(){
int q , i;
scanf( "%d%d" , &N , &q );
for( i = 1 ; i <= N ; ++i )
scanf( "%d" , Array + i );
sort( Array + 1 , Array + N + 1 );
for( i = 1 ; i <= N ; ++i ){
Prefix[i&1][i] = Prefix[i&1][i - 1] + Array[i];
Prefix[(i-1)&1][i] = Prefix[(i-1)&1][i - 1];
Prefix[2][i] = Prefix[2][i - 1] + Array[i];
}
long long Ans;
int index , X;
pair<int,int> P;
for( i = 1 ; i <= q ; ++i ){
scanf( "%d" , &X );
if( X >= Array[N] ) Ans = Prefix[N&1][N];
else if( X <= Array[1] ) Ans = Prefix[2][N] - Prefix[2][N/2];
else{
index = BinarySearch( 1 , N , X );
if( Array[index] > X ) --index;
P = Find_Segment( index + 1 , X );
Ans = Prefix[2][N] - Prefix[2][P.second - 1] + Prefix[P.first & 1][P.first];
}
printf( "%lld\n" , Ans );
}
return 0;
} |
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll solve(int n, vector<ll>& a, vector<ll>& sum, vector<ll>& sum2, ll x) {
int idx = lower_bound(a.begin(), a.end(), x) - a.begin();
if (idx == n) idx = n - 1;
else if (idx > 0) {
if (abs(a[idx - 1] - x) <= abs(a[idx] - x)) idx--;
}
if (idx == n - 1) return sum2[n - 1];
int ok = idx, ng = n;
while (ng - ok > 1) {
int mid = (ok + ng) / 2;
ll d = a[mid] - x;
int idx2 = lower_bound(a.begin(), a.end(), x - d) - a.begin();
int num = mid - idx2 + 1;
if (num > n / 2 || n - num <= mid) ng = mid;
else ok = mid;
}
ll res = sum[ok];
int num = n - 1 - ok;
int idx2 = ok - min(num, n / 2) + 1;
if (idx2 > 0) res += sum2[idx2 - 1];
return res;
}
ll solve2(int n, vector<ll>& a, ll x) {
vector<pair<ll, int> > v;
for (int i = 0; i < n; i++) {
v.emplace_back(abs(a[i] - x), i);
}
sort(v.begin(), v.end());
vector<int> used(n, false);
ll res = 0;
int ok = 0;
for (int i = 0, j = n - 1; ;) {
while (j >= 0) {
if (!used[j]) break;
j--;
}
if (j < 0) break;
used[j] = true;
res += a[j];
while (i < n) {
if (!used[v[i].second]) break;
i++;
}
if (i == n) break;
used[v[i].second] = true;
ok = max(ok, v[i].second);
}
return res;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, q;
cin >> n >> q;
vector<ll> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<ll> sum(n, 0);
for (int i = n - 2; i >= 0; i--) {
sum[i] = sum[i + 1] + a[i + 1];
}
vector<ll> sum2(n, 0);
sum2[0] = a[0];
sum2[1] = a[1];
for (int i = 2; i < n; i++) {
sum2[i] = sum2[i - 2] + a[i];
}
for (int i = 0; i < q; i++) {
ll x;
cin >> x;
cout << solve(n, a, sum, sum2, x) << endl;
}
return 0;
} |
p03158 | C++ | #include <stdio.h>
#include <string.h>
#include <stdlib.h>
//#include <math.h>
#include <algorithm>
#include <vector>
typedef long long ll;
#define MIN(a, b) ((a)>(b)? (b): (a))
#define MAX(a, b) ((a)<(b)? (b): (a))
using namespace std;
#define MOD 1000000007
int main(int argc, char* argv[])
{
long n, qq;
scanf("%ld %ld", &n, &qq);
vector<long> a(n,0);
vector<ll> s(n+1,0);
vector<ll> tt(n+1,0);
long i;
for(i=0; i<n; i++) {
scanf("%ld", &(a[n-1-i]));
}
for(i=0; i<n; i++) {
s[i+1] = s[i] + a[i];
}
vector<ll> ans(n,0);
long kmax=(n-1)/2;
for(i=0; i<=kmax; i++) {
tt[i+1] = tt[i] + a[2*i];
}
vector<long> judge(kmax,0);
long k;
for(k=1; k<=kmax; k++) {
judge[kmax-k] = (a[k] + a[k*2])/2;
ans[kmax-k] = s[k] + tt[kmax+1] - tt[k];
}
vector<long> x(qq);
for(i=0; i<qq; i++) {
scanf("%ld", &(x[i]));
}
for(i=0; i<qq; i++) {
if(kmax>0) {
vector<long>::iterator it = lower_bound( judge.begin(), judge.end(), x[i]);
if(it==judge.end()) {
printf("%lld\n", ans[kmax-1]);
}
else {
long tmp = it-judge.begin();
if(tmp==0) {
printf("%lld\n", s[(n+1)/2]);
}
else {
printf("%lld\n", ans[tmp-1]);
}
}
}
else {
printf("%ld\n", a[0]);
}
}
return 0;
}
|
p03158 | C++ | #include<iostream>
#include<algorithm>
#include<string>
#include<cstdlib>
#include<map>
#include<iomanip>
using namespace std;
long long int n, q, m, p[20000] = {}, a[300000] = {}, b, lef[200000], h, w, tab[500][500] = {}, same = 0, qu[300000], rui[300000] = {}, giza[300000] = {}, res[300000] = {};
int nibutan(long long int check,int left,int right) {
int nibu = (left + right) / 2;
if (right-left==1&& check < lef[nibu]) {
return nibu+1;
}
if (check >= lef[nibu]&&check<lef[nibu-1]) {
return nibu;
}
else if (check >= lef[nibu]) {
return nibutan(check, left, nibu);
}
else {
return nibutan(check, nibu, right);
}
}
int main() {
string str[600];
cin >> n >> q;
for (int i = 1; i <= n; i++) {
cin >> a[i];
rui[i] = rui[i - 1] + a[i];
}
for (int i = 1; i <= q; i++) {
cin >> qu[i];
}
giza[1] = a[1];
for (int i = 2; i <= n; i++) {
giza[i] = giza[i - 2] + a[i];
}
res[0] = giza[n];
res[1] = giza[n];
for (int i =2; i <= n/2; i++) {
res[i] = rui[n] - rui[n - i] + giza[n - 2 * i];
}
res[n / 2 + 1] = rui[n] - rui[n / 2];
for (int i = 0; i <= n/2; i++) {
lef[i] = (a[n - i] + a[n - 2 * i]) / 2 + 1;
}
lef[n / 2 + 1] = 0;
for (int i = 1; i <= q; i++) {
if (qu[i] > a[n]) { cout << res[0] << endl; }
else {
cout << res[nibutan(qu[i], 0, n / 2 + 1)] << endl;
}
}
} |
p03158 | C++ | #include <iostream>
#include <algorithm>
using namespace std;
int main() {
int n, q;
cin >> n >> q;
int a[n+1];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
long long psr[n+2], ps2[n+1];
ps2[0] = 0, ps2[1] = a[1];
for (int i = 2; i <= n; i++) {
ps2[i] = ps2[i-2] + a[i];
}
psr[n+1] = 0;
for (int i = n; i > 0; i--) {
psr[i] = psr[i+1] + a[i];
}
for (int i = 0; i < q; i++) {
int x;
cin >> x;
int l = 1, r = n + 1;
while (r - l > 1) {
int mid = (l + r) / 2;
int l2 = 2 * mid - 1 - n;
if (l2 < 1) {
l = mid;
continue;
}
int r2 = l2 == 1 ? n : lower_bound(a+1, a+n+1, x*2-a[l2-1]) - a - 1;
if (r2 < mid - 1) {
r = mid;
} else {
l = mid;
}
}
cout << psr[l] + (l * 2 - n - 2 > 0 ? ps2[l*2-n-2] : 0) << endl;
}
return 0;
}
|
p03158 | C++ | #include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <algorithm>
#include <numeric>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <functional>
#define _USE_MATH_DEFINES
#include <cmath>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cfloat>
#include <cmath>
#include <ctime>
#include <cstdio>
#include <cassert>
using namespace std;
#define EPS 1e-12
#define ull unsigned long long
#define ll long long
#define VI vector<ll>
#define PII pair<ll, ll>
#define VVI vector<vector<ll> >
#define REP(i,n) for(int i=0,_n=(n);(i)<(int)_n;++i)
#define RANGE(i,a,b) for(int i=(int)a,_b=(int)(b);(i)<_b;++i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define ALL(c) (c).begin(), (c).end()
#define ALLR(c) (c).rbegin(), (c).rend()
#define PB push_back
#define MP(a, b) make_pair(a, b)
#define POPCOUNT __builtin_popcount
#define POPCOUNTLL __builtin_popcountll
#define CLEAR(table, v) memset(table, v, sizeof(table));
#define PRINT1(table, D0) REP(d0, D0) cout<<table[d0]<<" "; cout<<"\n";
#define PRINT2(table, D0, D1) REP(d0, D0) { REP(d1, D1) cout<<table[d0][d1]<<" "; cout<<"\n"; }
#define PRINT3(table, D0, D1, D2) REP(d0, D0) { REP(d1, D1) { REP(d2, D2) cout<<table[d0][d1][d2]<<" "; cout<<"\n"; } cout<<"\n"; }
#define UNIFORM_DOUBLE(a, b) (((b-a)*(double)rand()/RAND_MAX)+a) // [a, b)
#define UNIFORM_LL(a, b) (ll)UNIFORM_DOUBLE(a, b) // [a, b)
#define IN(v, lo, hi) ((lo)<=(v) && (v)<(hi))
#define DD(v) cout<<#v<<": "<<v<<endl
template <typename T0, typename T1> std::ostream& operator<<(std::ostream& os, const map<T0, T1>& v) { for( typename map<T0, T1>::const_iterator p = v.begin(); p!=v.end(); p++ ){os << p->first << ": " << p->second << " ";} return os; }
template <typename T0, typename T1> std::ostream& operator<<(std::ostream& os, const pair<T0, T1>& v) { os << v.first << ": " << v.second << " "; return os; }
template <typename T> std::ostream& operator<<(std::ostream& os, const vector<T>& v) { for( int i = 0; i < (int)v.size(); i++ ) { os << v[i] << " "; } return os; }
template <typename T> std::ostream& operator<<(std::ostream& os, const vector<vector<T> >& v) { for( int i = 0; i < (int)v.size(); i++ ) { os << v[i] << endl; } return os; }
template <typename T> std::ostream& operator<<(std::ostream& os, const set<T>& v) { vector<T> tmp(v.begin(), v.end()); os << tmp; return os; }
template <typename T> std::ostream& operator<<(std::ostream& os, const deque<T>& v) { vector<T> tmp(v.begin(), v.end()); os << tmp; return os; }
/*
idx->そこをとるのが何step目か
がわかればにぶたんでOK
3 5 7 11 13
x<=4
1 2 3 4 5
x<=6
2 1 3 4 5
x=7
4 3 1 2 5
3 5 9 10 20
x<=4
1 2 3 4 5
x<=6
2 1 3 4 5
x<=7
4 1 2 3 5
xから距離r以内の左端右端はlogNでわかる→何個とったかわかる
rに対して右端と何個取ったかlogNでわかる
*/
#define MOD 1000000007LL
#define INF (1LL<<60)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N,Q,x;
while(cin>>N>>Q) {
VI A(N);
REP(i, N) cin>>A[i];
// sum[i, N)
VI rsum(N+1);
VI rsum2(N+1);
REP(i, N) rsum2[i+1]=rsum2[i]+A[i];
for(int i=N-1;i>=0;i--) {
rsum[i]=rsum[i+1]+A[i];
}
// DD(rsum);DD(rsum2);
// sum[0, i, step2]
// VI lsum(N);
// REP(i, N) {
// if(i<=1) lsum[i]=A[i];
// else lsum[i]=A[i]+lsum[i-2];
// }
VI lsum2(N+1);
lsum2[1]=A[0];
RANGE(i, 1, N) lsum2[i+1]=lsum2[i-1]+A[i];
REP(i, N) A[i]=A[i]*10+1;
// DD(rsum);
// DD(lsum);
REP(i, Q) {
cin>>x;
x *= 10;
// DD(x);
// lo: ?手終了時点で後攻の右端<=先攻の左端
ll lo=-1, hi=1LL<<60;
while(lo+1<hi) {
ll r = (lo+hi)/2;
ll L = lower_bound(ALL(A), x-r)-A.begin();
ll R = upper_bound(ALL(A), x+r)-A.begin();
// ll co = R-L;
// ll al = N-co;
// DD(r);
// DD(L);DD(R);DD(co);DD(al);
// if(R<=al) lo=r; else hi=r;
if(N-R >= R-L) lo=r; else hi=r;
}
ll r = lo;
ll L = lower_bound(ALL(A), x-r)-A.begin();
ll R = upper_bound(ALL(A), x+r)-A.begin();
// ll co = R-L;
// ll al = N-co;
ll ans = 0;
assert ((N - R) - (R - L) >= 0);
assert ((N - R) - (R - L) <= 1);
// DD(r);
// DD(L);DD(R);DD(co);DD(al);
// R==al or R+1==al
// if(R==al) {
if(N-R==R-L) {
// 先攻はsum[R, N) + L-2から1ことび
// ans = accumulate(A.begin()+R, A.end(), 0LL);
// ans = rsum[R-1];
// if(0<=L-2) for(int i=(L-2)%2;i<=L-2;i+=2) ans += A[i];
// if(0<=L-2) ans += lsum[L-2];
ans = rsum[R] + lsum2[L];
// if(0<=L-1) ans += lsum[L-1];
// if(0<=L-2) ans += lsum[L-2];
// ans = rsum2[N]-rsum2[R] + lsum2[L];
} else {
// 先攻はsum[R+1, N) + L-1から1ことび
// ans = accumulate(A.begin()+R+1, A.end(), 0LL);
// ans = rsum[R];
// if(0<=L-1) for(int i=(L-1)%2;i<=L-1;i+=2) ans += A[i];
// if(0<=L-2) ans += lsum[L-2];
// ans = rsum2[N]-rsum2[R]+ (0<=L-1 ? lsum2[L-1] : 0);
ans = rsum[R] + (0<=L-1 ? lsum2[L-1] : 0);
}
cout<<ans<<endl;
}
// break;
}
return 0;
}
|
p03158 | C++ | #include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <algorithm>
#include <numeric>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <functional>
#define _USE_MATH_DEFINES
#include <cmath>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cfloat>
#include <cmath>
#include <ctime>
#include <cstdio>
#include <cassert>
using namespace std;
#define EPS 1e-12
#define ull unsigned long long
#define ll long long
#define VI vector<ll>
#define PII pair<ll, ll>
#define VVI vector<vector<ll> >
#define REP(i,n) for(int i=0,_n=(n);(i)<(int)_n;++i)
#define RANGE(i,a,b) for(int i=(int)a,_b=(int)(b);(i)<_b;++i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define ALL(c) (c).begin(), (c).end()
#define ALLR(c) (c).rbegin(), (c).rend()
#define PB push_back
#define MP(a, b) make_pair(a, b)
#define POPCOUNT __builtin_popcount
#define POPCOUNTLL __builtin_popcountll
#define CLEAR(table, v) memset(table, v, sizeof(table));
#define PRINT1(table, D0) REP(d0, D0) cout<<table[d0]<<" "; cout<<"\n";
#define PRINT2(table, D0, D1) REP(d0, D0) { REP(d1, D1) cout<<table[d0][d1]<<" "; cout<<"\n"; }
#define PRINT3(table, D0, D1, D2) REP(d0, D0) { REP(d1, D1) { REP(d2, D2) cout<<table[d0][d1][d2]<<" "; cout<<"\n"; } cout<<"\n"; }
#define UNIFORM_DOUBLE(a, b) (((b-a)*(double)rand()/RAND_MAX)+a) // [a, b)
#define UNIFORM_LL(a, b) (ll)UNIFORM_DOUBLE(a, b) // [a, b)
#define IN(v, lo, hi) ((lo)<=(v) && (v)<(hi))
#define DD(v) cout<<#v<<": "<<v<<endl
template <typename T0, typename T1> std::ostream& operator<<(std::ostream& os, const map<T0, T1>& v) { for( typename map<T0, T1>::const_iterator p = v.begin(); p!=v.end(); p++ ){os << p->first << ": " << p->second << " ";} return os; }
template <typename T0, typename T1> std::ostream& operator<<(std::ostream& os, const pair<T0, T1>& v) { os << v.first << ": " << v.second << " "; return os; }
template <typename T> std::ostream& operator<<(std::ostream& os, const vector<T>& v) { for( int i = 0; i < (int)v.size(); i++ ) { os << v[i] << " "; } return os; }
template <typename T> std::ostream& operator<<(std::ostream& os, const vector<vector<T> >& v) { for( int i = 0; i < (int)v.size(); i++ ) { os << v[i] << endl; } return os; }
template <typename T> std::ostream& operator<<(std::ostream& os, const set<T>& v) { vector<T> tmp(v.begin(), v.end()); os << tmp; return os; }
template <typename T> std::ostream& operator<<(std::ostream& os, const deque<T>& v) { vector<T> tmp(v.begin(), v.end()); os << tmp; return os; }
/*
idx->そこをとるのが何step目か
がわかればにぶたんでOK
3 5 7 11 13
x<=4
1 2 3 4 5
x<=6
2 1 3 4 5
x=7
4 3 1 2 5
3 5 9 10 20
x<=4
1 2 3 4 5
x<=6
2 1 3 4 5
x<=7
4 1 2 3 5
xから距離r以内の左端右端はlogNでわかる→何個とったかわかる
rに対して右端と何個取ったかlogNでわかる
*/
#define MOD 1000000007LL
#define INF (1LL<<60)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N,Q,x;
while(cin>>N>>Q) {
VI A(N);
REP(i, N) cin>>A[i];
// sum[i, N)
// VI rsum(N);
VI rsum2(N+1);
REP(i, N) rsum2[i+1]=rsum2[i]+A[i];
// for(int i=N-1;i>=0;i--) {
// if(i==N-1) rsum[i]=A[i];
// else rsum[i]=rsum[i+1]+A[i];
// }
// sum[0, i, step2]
// VI lsum(N);
// REP(i, N) {
// if(i<=1) lsum[i]=A[i];
// else lsum[i]=A[i]+lsum[i-2];
// }
VI lsum2(N+1);
lsum2[1]=A[0];
RANGE(i, 1, N) lsum2[i+1]=lsum2[i-1]+A[i];
REP(i, N) A[i]=A[i]*10+1;
// DD(rsum);
// DD(lsum);
REP(i, Q) {
cin>>x;
x *= 10;
// DD(x);
// lo: ?手終了時点で後攻の右端<=先攻の左端
ll lo=-1, hi=1LL<<60;
while(lo+1<hi) {
ll r = (lo+hi)/2;
ll L = lower_bound(ALL(A), x-r)-A.begin();
ll R = upper_bound(ALL(A), x+r)-A.begin();
// ll co = R-L;
// ll al = N-co;
// DD(r);
// DD(L);DD(R);DD(co);DD(al);
// if(R<=al) lo=r; else hi=r;
if(N-R >= R-L) lo=r; else hi=r;
}
ll r = lo;
ll L = lower_bound(ALL(A), x-r)-A.begin();
ll R = upper_bound(ALL(A), x+r)-A.begin();
// ll co = R-L;
// ll al = N-co;
ll ans = 0;
assert ((N - R) - (R - L) >= 0);
assert ((N - R) - (R - L) <= 1);
// DD(r);
// DD(L);DD(R);DD(co);DD(al);
// R==al or R+1==al
// if(R==al) {
if(N-R==R-L) {
// 先攻はsum[R, N) + L-2から1ことび
// ans = accumulate(A.begin()+R, A.end(), 0LL);
// ans = rsum[R-1];
// if(0<=L-2) for(int i=(L-2)%2;i<=L-2;i+=2) ans += A[i];
// if(0<=L-2) ans += lsum[L-2];
// ans = rsum[R];
// if(0<=L-1) ans += lsum[L-1];
// if(0<=L-2) ans += lsum[L-2];
ans = rsum2[N]-rsum2[R] + lsum2[L];
} else {
// 先攻はsum[R+1, N) + L-1から1ことび
// ans = accumulate(A.begin()+R+1, A.end(), 0LL);
// ans = rsum[R];
// if(0<=L-1) for(int i=(L-1)%2;i<=L-1;i+=2) ans += A[i];
// if(0<=L-2) ans += lsum[L-2];
ans = rsum2[N]-rsum2[R]+ (0<=L-1 ? lsum2[L-1] : 0);
}
cout<<ans<<endl;
}
// break;
}
return 0;
}
|
p03158 | C++ | #include<algorithm>
#include<cmath>
#include<fstream>
#include<iomanip>
#include<iostream>
#include<map>
#include<numeric>
#include<queue>
#include<random>
#include<set>
#include<sstream>
#include<sys/time.h>
#include<unordered_map>
#include<unordered_set>
#include<vector>
using ll = long long;
enum : int { M = (int)1e9 + 7 };
enum : ll { MLL = (ll)1e18L + 9 };
using namespace std;
#ifdef LOCAL
#include"rprint2.hpp"
#else
#define FUNC(name) template <ostream& out = cout, class... T> void name(T&&...){ }
FUNC(prints) FUNC(printw) FUNC(printwe) FUNC(printb) FUNC(printbe) FUNC(printd) FUNC(printde) FUNC(printdu);
#endif
template <class S, class T>
istream& operator >> (istream& in, pair<S, T>& p){ return in >> p.first >> p.second; }
template <class T>
istream& operator >> (istream& in, vector<T>& v){ for(auto& e : v){ in >> e; } return in; }
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n, q;
cin >> n >> q;
vector<int> as(n); cin >> as;
vector<ll> accs(n + 1), accs2(n + 1);
for(int i = n - 1; i >= 0; i--){
accs[i] = accs[i + 1] + as[i];
}
for(int i = 0; i < n; i++){
accs2[i] = (i >= 2 ? accs2[i - 2] : 0) + as[i];
}
printde(as, accs, accs2);
for(int i = 0; i < q; i++){
int x; cin >> x;
int tin = 1, tout = n - 1;
ll ans = 0;
auto proc = [&](int& tin, int& tout){
int num = (tin + tout) / 2;
int diff = as[n - num - 1] - x;
int diff2 = as[n - num] - x;
auto idx = lower_bound(as.begin(), as.end(), x - diff) - as.begin();
auto idx2 = lower_bound(as.begin(), as.end(), x - diff2) - as.begin();
// ---- idx2 ---- idx ---
int numa = max(0l, n - num - 1 - idx + 1);
int numb = max(0l, n - num - 1 - idx2 + 1);
printde(num, idx, idx2, numa, numb);
if(num < numa){
tin = num;
}else if(num > numb + 1){
tout = num;
}else{
int idx = n - num - num - 1;
ll cand = accs[n - num] + (idx >= 0 ? accs2[idx] : 0);
printde(num, cand, accs[n - num], (idx >= 0 ? accs2[idx] : 0), ans);
ans = max(ans, cand);
tin = max(1, num - 10);
tout = min(n - 1, num + 10);
}
};
while(tin + 20 < tout){
proc(tin, tout);
}
for(int i = tin; i <= tout; i++){
int tin = i, tout = i;
proc(tin, tout);
}
// if(ans == 0){
// exit(1);
// }
cout << ans << '\n';
}
}
|
p03158 | C++ | #include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x) cerr << #x << " = " << (x) << endl;
#define INF 2000000000
#define mod 1000000007
#define INF2 1000000000000000000
#define int long long
int ans[100010];
signed main(void)
{
cin.tie(0);
ios::sync_with_stdio(false);
int N, Q;
cin >> N >> Q;
int left = 1, right = N / 2;
int a[100010];
rep(i, N) cin >> a[i];
RREP(i, N - 1, N / 2) {
ans[0] += a[i];
}
rep(i, (N + 1) / 2) {
ans[i + 1] = ans[i] - a[N / 2 + i] + a[i * 2 + (N + 1) % 2];
}
//rep(i, (N + 1) / 2) cout << ans[i] << " ";
//cout << endl;
vector<int> v;
left -= N % 2;
rep(i, ((N + 1) / 2) - 1) {
//cout << a[left] << " " << a[right] << "->" << ((a[right] + a[left]) / 2) << endl;
v.push_back(((a[right] + a[left]) / 2));
right++;
left += 2;
}
rep(i, Q) {
int X; cin >> X;
auto it = lower_bound(v.begin(), v.end(), X);
cout << ans[it - v.begin()] << endl;
}
return 0;
}
|
p03158 | C++ | #include<bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
#define RALL(A) A.rbegin(),A.rend()
typedef long LL;
typedef pair<LL,LL> P;
const LL mod=1e9+7;
const LL LINF=1LL<<62;
const int INF=1000000000;
int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1};
int main(){
int n,q;
cin >> n >> q;
vector<LL> a(n),x(q);
LL sum=0;
for (int i = 0; i < n; i++) {
cin >> a[i];
sum+=a[i];
}
for (int i = 0; i < q; i++) {
cin >> x[i];
}
int k=n/2;
int r=k+1;
vector<LL> p;
for (int r = k; r < n-1; r++) {
int l=n-(r+1);
p.pb(a[r-l]+(a[r]-a[r-l])/2+1);
}
vector<LL> ss(n+1,0);
for (int i = 0; i < n; i++) {
ss[i+1]=ss[i]+a[i];
}
vector<LL> sc(n+1,0),sk(n+1,0);
int t=0;
for (int i = 0; i < n; i+=2) {
sc[t+1]=sc[t]+a[i];
t++;
}
t=0;
for (int i = 1; i < n; i+=2){
sk[t+1]=sk[t]+a[i];
t++;
}
for (int i = 0; i < q; i++) {
int s=upper_bound(ALL(p),x[i])-p.begin();
LL ans=0;
ans+=ss[n]-ss[n-(n+1)/2+s];
if(n%2) ans+=sc[s];
else ans+=sk[s];
cout << ans << endl;
}
return 0;
}
|
p03158 | C++ | #include <stdio.h>
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define P pair<ll,ll>
#define FOR(i,n,m) for(ll i=n; i<(ll)m;i++)
#define FORr(i,n,m) for(ll i=n; i>=(ll)m; i--)
#define FORm(i,m) for(auto i=m.begin();i!=m.end();i++)
#define VEC2(x,a,b) vector<vector<ll>> x = vector<vector<ll>>(a,vector<ll>(b,0))
#define sortAl(v) sort(v.begin(),v.end())
#define sortAlr(v) sort(v.begin(),v.end()); reverse(v.begin(),v.end())
#define cinv(v,n,m) FOR(i,n,m) cin>>v.at(i)
#define coutv(v,n,m) FOR(i,n,m) cout<<v.at(i) <<" "; cout<<endl
#define cout(n) cout<<fixed<<setprecision(n)
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll n,q;
cin>>n>>q;
vector<ll> v(n);
cinv(v,0,n);
ll tmp=0;
for(ll i=n-1; i>=(ll)0; i-=2){
tmp+=v[i];
}
vector<ll> ans(0);
ans.push_back(tmp);
FOR(i,1,(n+1)/2){
tmp = tmp + v[n-1-i] - v[n-2*i-1];
ans.push_back(tmp);
//cout<<tmp<<endl;
}
vector<ll> flag(0);//(n+1)/2個ある
FOR(i,1,(n+1)/2){
ll x = v[n-1-i] + v[n-2*i-1];
x = x/2 + 1;
//cout<<x<<endl;
flag.push_back(x);
}
reverse(ans.begin(), ans.end());
reverse(flag.begin(), flag.end());
//coutv(ans,0,ans.size());
//coutv(flag,0,flag.size());
// cout<<flag[0]<<endl;
FOR(i,0,q){
if(n==2)break;
ll in;
cin>>in;
ll l=0;
ll r=flag.size()-1;
while(r-l > 1){
ll mid = (r+l)/2;
if(flag[mid]<=in) l = mid;
else r = mid;
}
// cout<<"l="<<l<<" r="<<r<<endl;
ll res = l;
if(flag[l]<=in && in<flag[r])res=r;
else if(flag[r]<=in) res=r+1;
if(flag.size()==1){
if(flag[0]<=in) res=1;
else res=0;
}
cout<<ans[res]<<endl;
}
if(n==2){
FOR(i,0,q){
ll in;
cin>>in;
cout<<v[1]<<endl;
}
}
}
|
p03158 | C++ | #include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <cstring>
#include <queue>
#include <functional>
#include <string>
#include <set>
#include <map>
#include <cmath>
#include <cassert>
#define SIZE 100005
using namespace std;
typedef long long int ll;
typedef pair <int,int> P;
ll A[SIZE];
ll sum[SIZE];
ll s2[SIZE];
int main()
{
int n,Q;
scanf("%d %d",&n,&Q);
for(int i=0;i<n;i++) scanf("%lld",&A[i]);
for(int i=0;i<n;i++)
{
sum[i]=0;
if((n-i-1)%2==0) sum[i]=A[i];
if(i>0) sum[i]+=sum[i-1];
s2[i]=A[i];
if(i>0) s2[i]+=s2[i-1];
}
while(Q--)
{
ll x;
scanf("%lld",&x);
int l=0,r=n+1;
while(r-l>1)
{
int d=(l+r)/2;
if(A[n-d]<=x) r=d;
else
{
if(2*d-1>n) r=d;
else
{
if(A[n-d]-x>=x-A[n-2*d+1]) l=d;
else r=d;
}
}
}
ll ret=s2[n-1]-s2[n-l-1];
if(n-2*l-1>=0) ret+=sum[n-2*l-1];
printf("%lld\n",ret);
}
return 0;
}
|
p03158 | C++ | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using vll = vector<ll>;
using pl4 = pair<ll,ll>;
using str = string;
using vpl4 = vector<pair<ll,ll>>;
#define sz size()
#define be begin()
#define en end()
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define llin(x) ll (x);cin >>(x);
#define stin(x) str (x);cin >>(x);
#define FOR(i,a,b) for(ll i = a ; i <= b ; i++)
#define rFOR(i,b,a) for(ll i = a; i >= b ; i--)
#define SORT(x) sort(x.be, x.en)
#define rSORT(x) sort(x.rbegin(), x.rend())
#define say(x) cout<<(x);
#define sal(x) cout<<(x)<<endl;
#define yn(a) cout <<((a)?"yes":"no")<<endl;
#define Yn(a) cout <<((a)?"Yes":"No")<<endl;
#define YN(a) cout <<((a)?"YES":"NO")<<endl;
#define Imp(a) cout <<((a)?"Possible":"Impossible")<<endl;
#define IMP(a) cout <<((a)?"POSSIBLE":"IMPOSSIBLE")<<endl;
signed main(){
llin(n);
llin(q);
vll a(n);
vll aa(n);
vll d(n);
vll u(n);
vpl4 x(q);
cin >>a[0];
aa[0]=a[0];
FOR(i,1,n-1){
cin >>a[i];
aa[i]+=aa[i-1]+a[i];
}
FOR(i,0,q-1){
cin >>x[i].fi;
x[i].se=i;
}
ll e=0;
FOR(i,0,n-1){
e=n-((n-i)/2+((n-i)%2));
d[i]=(a[i]+a[e])/2;
}
vll c(n,0);
if(n%2==0){
FOR(i,1,n-1){
c[i]=((i%2==0)?c[i-1]:c[i-1]+a[i]);
}
}else{
c[0]=a[0];
FOR(i,1,n-1){
c[i]=((i%2==0)?c[i-1]+a[i]:c[i-1]);
}
}
SORT(x);
ll j=2-(n%2);
vll z(q,0);
FOR(i,0,q-1){
if(x[i].fi>d[1-(n%2)]){
while(j<n-1 && x[i].fi>d[j+1]){
j+=2;
}
if(j<n-1){
z[x[i].se]=c[j-1]+(aa[n-1]-aa[n-(n-j)/2-1]);
}else{
z[x[i].se]=c[n-1];
}
}else{
z[x[i].se]=aa[n-1]-aa[n/2-1];
}
}
FOR(i,0,q-1){
sal(z[i]);
}
}
|
p03158 | C++ | /*
memo for solution
*/
#include <cstdlib>
#include <numeric>
#include <cstring>
#include <cstdio>
#include <cfloat>
#include <map>
#include <cassert>
#include <cmath>
#include <climits>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <iomanip>
#include<sys/time.h>
using namespace std;
double e_time(void){static struct timeval now;gettimeofday(&now, NULL);return (double)(now.tv_sec + now.tv_usec/1000000.0);}
#define REP(i,b,n) for(int i=b;i<n;i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define mp make_pair
#define ALL(C) (C).begin(),(C).end()
#define fe(c,itr) for(__typeof((c).begin()) itr=(c).begin();itr != (c).end();itr++)
#define BITSHIFT(X) ( (1<<(X)) )
#define CONTAIN(S,X) ( ((S)&BITSHIFT(X)) != 0)
typedef complex<double>P;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vint;
template<class T> void vp(T &a,int p){rep(i,p)cout << a[i]<<" ";cout << endl;}
template<class T> T ceilUp(const T& a,const T& b){return (a+b-1)/b;}
const ll mod = 1000000009;
inline ll modadd(ll a,ll b){a %= mod;b %= mod;return (a+b)%mod;}
inline ll modsub(ll a,ll b){a %= mod;b %= mod;a-=b;a%=mod;if (a<0)a+=mod;return a;}
inline ll modmul(ll a,ll b){a %= mod;b %= mod;return (a*b)%mod;}
inline ll modeq(ll a,ll b,ll m){a = (a%m+m)%m; b = (b%m+m)%m;return a == b;}
//ll modpow(ll n,ll p){if (p == 0)return 1;if (p == 1)return n;ll ret=mypow(n,p/2);ret=ret*ret%mod;if (p&1)ret=ret*n%mod;return ret;}
//ll getinv(ll a){return mypow(a,mod-2);}
ll mypow(ll n,ll p){
if (p == 0)return 1;
if (p == 1)return n;
ll ret=mypow(n,p/2);
ret=ret*ret;
if (p&1)ret=ret*n;
return ret;
}
const int N = 100000;
long long sum[N];
long long p_sum[2][N];
int mini[N];
int maxi[N];
long long ans[N];
void preproc(int n, const vector<int> & in){
// copute sum
sum[0] = in[0];
REP(i, 1, n){
sum[i] = in[i] + sum[i-1];
}
p_sum[0][0] = in[0];
for(int i = 2;i < n;i+=2){
p_sum[0][i] = in[i] + p_sum[0][i-2];
}
long long last = n%2 == 0 ? p_sum[0][n-2] : p_sum[0][n-1];
for(int i = 1;i <= n/2; i++){
if (i == 1){
maxi[1] = 1e9;
mini[i] = ((in[i] + in[2*i])) / 2;
} else {
maxi[i] = mini[i-1];
mini[i] = ((in[i] + in[2*i])) / 2;
}
ans[i] = sum[i-1] + last - p_sum[0][2*i - 2];
//cout << i <<" " << mini[i] <<" " << maxi[i] <<" " << ans[i] << endl;
}
maxi[1] = 1e9;
}
long long solve(int query, int n){
int l =1, r = n/2;
int cnt = 50;
while(l < r && cnt){
int mid = (l+r)/2;
if (mini[mid] < query && query <= maxi[mid])return ans[mid];
if (query <= mini[mid]){
l = mid+1;
} else if (maxi[mid] < query){
r = mid-1;
}
}
return ans[l];
}
int main(){
int n , q;
//cin >> n >> q;
scanf("%d%d", &n, &q);
vector<int> in(n);
rep(i,n){
scanf("%d", &in[i]);
}
int a = n%2 == 1 ? -1e9 : 0;
if (n%2 == 1){
in.emplace_back(-1e9);
n++;
}
sort(begin(in), end(in), greater<int>());
preproc(n, in);
rep(i,q){
int query;
scanf("%d", &query);
cout << solve(query, n) << endl;
}
return 0;
}
|
p03158 | C++ | #include "bits/stdc++.h"
#define REP(i,n) for(ll i=0;i<ll(n);++i)
#define RREP(i,n) for(ll i=ll(n)-1;i>=0;--i)
#define FOR(i,m,n) for(ll i=m;i<ll(n);++i)
#define RFOR(i,m,n) for(ll i=ll(n)-1;i>=ll(m);--i)
#define ALL(v) (v).begin(),(v).end()
#define UNIQUE(v) v.erase(unique(ALL(v)),v.end());
#define INF 1000000001ll
#define MOD 1000000007ll
#define EPS 1e-9
constexpr int dx[8] = { 1,1,0,-1,-1,-1,0,1 };
constexpr int dy[8] = { 0,1,1,1,0,-1,-1,-1 };
using namespace std;
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
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; }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, q;
cin >> n >> q;
vl v(n);
REP(i, n)cin >> v[i];
vl e(n + 1, 0), o(n + 1, 0);
REP(i, n) {
e[i + 1] += e[i];
o[i + 1] += o[i];
if (i & 1)o[i + 1] += v[i];
else e[i + 1] += v[i];
}
vl p(n + 1, 0);
RREP(i, n)p[i] = p[i + 1] + v[i];
REP(aa, q) {
int x;
cin >> x;
if (x >= v.back()) {
if (n & 1)cout << e[n] << endl;
else cout << o[n] << endl;
continue;
}
if (x <= v.front()) {
cout << p[n / 2] << endl;
continue;
}
int l = -1, r = INF;
while (r - l > 1) {
int mid = (r + l) / 2;
int a = lower_bound(ALL(v), x - mid) - v.begin();
int b1 = lower_bound(ALL(v), x + mid) - v.begin();
int b2 = upper_bound(ALL(v), x + mid) - v.begin();
if (n - b1 - (b1 - a) > 1) {
if (n - b2 - (b2 - a) > 1) {
l = mid;
}
else r = mid;
}
else {
r = mid;
}
}
int a = lower_bound(ALL(v), x - r) - v.begin();
int b1 = lower_bound(ALL(v), x + r) - v.begin();
int b2 = upper_bound(ALL(v), x + r) - v.begin();
if (n - b1 - (b1 - a) > 1) {
if (n - b2 - (b2 - a) == 1) {
ll ans = p[b2];
if (a == 0) {
cout << ans << endl;
}
else {
a--;
if (a & 1)ans += e[a];
else ans += o[a];
cout << ans << endl;
}
}
else {
//assert(n - b2 - (b2 - a) == 0);
ll ans = p[b2];
if (a & 1)ans += e[a];
else ans += o[a];
cout << ans << endl;
}
}
else {
if (n - b1 - (b1 - a) == 1) {
ll ans = p[b1];
if (a == 0) {
cout << ans << endl;
}
else {
a--;
if (a & 1)ans += e[a];
else ans += o[a];
cout << ans << endl;
}
}
else {
assert(n - b1 - (b1 - a) == 0);
ll ans = p[b1];
if (a & 1)ans += e[a];
else ans += o[a];
cout << ans << endl;
}
}
}
} |
p03158 | C++ | #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <utility>
#include <string>
#include <algorithm>
#include <map>
#include <vector>
#include <climits>
#include <numeric>
#include<stdio.h>
#include <queue>
#include <iomanip>
#include <float.h>
#include <set>
#include<functional>
#include <stack>
#include <time.h>
using namespace std;
int gcd(int a, int b) {
if (a < b) gcd(b, a);
int r;
while ((r = a%b)) {
a = b;
b = r;
}
return b;
}
long long lcm(long long a, long long b) {
return a / gcd(a, b) * b;
}
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
int cntb = 0;
int cntw = 0;
int h, w;
int field[403][403];
int siyouzumi[403][403];
void dfs(int nowh,int noww,int bw) {
if (siyouzumi[nowh][noww])return;
siyouzumi[nowh][noww] = 1;
if (bw == 0) {
cntb += 1;
}
else cntw += 1;
if (nowh > 0) {
if (field[nowh - 1][noww] == 1 - bw&&siyouzumi[nowh - 1][noww] == 0) {
dfs(nowh - 1, noww, 1 - bw);
}
}
if (nowh < h - 1) {
if (field[nowh + 1][noww] == 1 - bw&&siyouzumi[nowh + 1][noww] == 0) {
dfs(nowh + 1, noww, 1 - bw);
}
}
if (noww < w - 1) {
if (field[nowh][noww+1] == 1 - bw&&siyouzumi[nowh][noww+1] == 0) {
dfs(nowh, noww+1, 1 - bw);
}
}
if (noww > 0) {
if (field[nowh][noww-1] == 1 - bw&&siyouzumi[nowh][noww-1] == 0) {
dfs(nowh, noww-1, 1 - bw);
}
}
}
signed main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int n, q;
cin >> n >> q;
int a[100004];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
long long ruiseki[100005];
ruiseki[0] = a[0];
ruiseki[1] = a[1];
for (int i = 2; i < n; i+=2) {
ruiseki[i] = ruiseki[i - 2] + a[i];
}
for (int i = 3; i < n; i += 2) {
ruiseki[i] = ruiseki[i - 2] + a[i];
}
long long ruiseki2[100005];
ruiseki2[0] = a[0];
for (int i = 1; i < n; i++) {
ruiseki2[i] = ruiseki2[i - 1] + a[i];
}
long long x;
for (int z = 0; z < q; z++) {
cin >> x;
long long ans = 0;
long long lb = -2;
long long ub = 1000000003;
long long mid, migi, hidari;
int hidarix, migix, num, takahashi, b;
while ( 1) {
mid = (ub + lb) / 2;
migi = x + mid;
hidari = x - mid;
hidarix = lower_bound(a, a + n, hidari) - a;
if (a[n - 1] <= migi)migix = n - 1;
else migix = upper_bound(a, a + n, migi) - a - 1;
num = max(0, migix - hidarix + 1);
if (a[migix]<hidari || a[hidarix]>migi)num = 0;
takahashi = n - num;
b = takahashi - migix;
if (x-a[hidarix] == a[migix]-x&&x-a[hidarix]>0 && b ==0) {
b += 2;
takahashi += 1;
num += 1;
}
if (num == 0&&mid==-1)break;
if (b > 0 && b <= 2)break;
if (b <= 0)ub = mid;
if (b > 2)lb = mid+1;
}
if (num == 0) { cout << ruiseki[n - 1] << "\n"; continue; }
if (b == 2) {
ans = ruiseki2[n - 1] - ruiseki2[takahashi - 2];
if (hidarix >= 2)ans += ruiseki[hidarix - 2];
cout << ans << "\n";
}
else {
ans = ruiseki2[n - 1] - ruiseki2[takahashi - 1];
if (hidarix >= 1)ans += ruiseki[hidarix - 1];
cout << ans << "\n";
}
}
} |
p03158 | C++ | #include <iostream>
#include <algorithm>
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <cstring>
#include <utility>
#include <vector>
#include <complex>
#include <valarray>
#include <fstream>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <numeric>
#define rep(X,Y) for (int (X) = 0;(X) < (Y);++(X))
#define rrep(X,Y) for (int (X) = Y-1;(X) >= 0;--(X))
#define repa(X,A,Y) for (int (X) = A;(X) <= (Y);++(X))
#define all(X) (X).begin(),(X).end()
#define mod(n, m) (((n)%(m)+(m))%m)
#define fi first
#define sc second
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;
const int INFINT = 1 << 30; // 1.07x10^ 9
const ll INFLL = 1LL << 60; // 1.15x10^18
const double EPS = 1e-10;
const int MOD = 1000000007;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const int MAX_N = 100000, MAX_Q = 100000;
int N, Q;
ll A[MAX_N];
ll X[MAX_Q];
ll sum_odd[MAX_N];
ll sum_even[MAX_N];
ll sum[MAX_N];
int main() {
std::ios::sync_with_stdio(false);std::cin.tie(0);
cin >> N >> Q;
rep(i, N) cin >> A[i];
rep(i, Q) cin >> X[i];
sum_even[0] = A[0];
sum_odd[1] = A[1];
for (ll i = 2; i < N; i += 2) {
sum_even[i] = A[i] + sum_even[i-2];
}
for (ll i = 3; i < N; i += 2) {
sum_odd[i] = A[i] + sum_odd[i-2];
}
sum[0] = A[0];
for (ll i = 1; i < N; ++i) sum[i] = A[i] + sum[i-1];
for (ll q = 0; q < Q; ++q) {
ll x = X[q];
ll lb = -1, ub = 1e10, mid;
while (ub-lb > 1) {
mid = (lb+ub)/2;
ll _idx1 = lower_bound(A, A+N, x-mid) - A;
ll _idx2 = upper_bound(A, A+N, x+mid) - A;
ll _aoki = _idx2-_idx1, _takahashi = N-_idx2;
if (_aoki >= _takahashi) ub = mid;
else lb = mid;
}
ll idx1 = lower_bound(A, A+N, x-ub) - A;
ll idx2 = upper_bound(A, A+N, x+ub) - A;
ll aoki = idx2-idx1, takahashi = N-idx2;
ll ans = 0;
if (aoki == takahashi) {
ans = sum[N-1]-sum[idx2-1];
if (0 <= idx1-1 && (idx1-1)%2 == 0) ans += sum_even[idx1-1];
if (0 <= idx1-1 && (idx1-1)%2 == 1) ans += sum_odd[idx1-1];
} else if (aoki == takahashi+1) {
ll addIdx = idx2-1;
if (abs(A[idx1]-x) > abs(A[idx2-1]-x)) addIdx = idx1;
ans = sum[N-1]-sum[idx2-1];
ans += A[addIdx];
if (0 <= idx1-2 && (idx1-2)%2 == 0) ans += sum_even[idx1-2];
if (0 <= idx1-2 && (idx1-2)%2 == 1) ans += sum_odd[idx1-2];
} else if (aoki == takahashi+2) {
ans = sum[N-1]-sum[idx2-2];
if (0 <= idx1-1 && (idx1-1)%2 == 0) ans += sum_even[idx1-1];
if (0 <= idx1-1 && (idx1-1)%2 == 1) ans += sum_odd[idx1-1];
}
cout << ans << endl;
}
return 0;
}
|
p03158 | C++ | #include<bits/stdc++.h>
using namespace std;
using LL=long long;
int main(){
int N,Q;cin>>N>>Q;
LL A[100002];
for(int i=1;i<=N;i++)
scanf("%lld",&A[i]);
if(N%2!=0){
for(int i=N;i>=1;i--)A[i+1]=A[i];
A[1]=0;
N+=1;
}
LL s[100002]={},k[100002]={};
for(int i=1;i<=N;i++)s[i]=s[i-1]+A[i];
for(int i=1;i<=N;i++)k[i]=k[i-1]+(i%2==0?A[i]:0);
vector<LL>d(N/2+1);
for(int i=1;i<=N/2;i++){
d[i]=(A[N/2+i]+A[i*2])/2;
}
while(Q--){
LL X;scanf("%lld",&X);
vector<LL>::iterator it=lower_bound(d.begin(),d.end(),X);
int t=N/2-(it-d.begin())+1;
printf("%lld\n",s[N]-s[N-t]+k[N-t*2]);
}
}
|
p03158 | C++ | #include <iostream>
#include <vector>
#include <map>
#include <unordered_map>
#include <queue>
#include <set>
#include <algorithm>
#include <string>
#include <math.h>
#include <limits.h>
#include <stack>
#include <complex>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll a[120000];
ll x[120000];
vector<ll> x_lower;
vector<ll> x_upper;
ll s1[120000];
ll s2[120000];
ll abs(ll x){
if(x > 0)
return x;
else
return -x;
}
int main(){
int N, Q; cin >> N >> Q;
for(int i = 0; i < N; i++){
cin >> a[i];
}
for(int i = 0; i < Q; i++){
cin >> x[i];
}
for(int k2 = 0; k2 < N; k2++){
int k;
if((N-k2) % 2 == 0){
k = (N-k2)/2+k2;
x_lower.push_back(a[k] + a[k2+1]);
}
else{
k = (N-k2-1)/2+k2;
x_lower.push_back(a[k]+a[k2]);
}
}
s1[0] = a[0];
s1[1] = a[1];
for(int i = 2; i < N; i+=2){
s1[i] = s1[i-2] + a[i];
}
for(int i = 3; i < N; i+=2){
s1[i] = s1[i-2] + a[i];
}
s2[N-1] = a[N-1];
for(int i = N-2; i >= 0; i--){
s2[i] = s2[i+1] + a[i];
}
for(int i = 0; i < Q; i++) {
auto it1 = lower_bound(x_lower.begin(), x_lower.end(), 2 * x[i]);
// auto it2 = lower_bound(x_upper.begin(), x_upper.end(), 2 * x[i]);
int k2 = it1 - x_lower.begin();
int k, kt;
if(k2 <= -1) {
k = N / 2;
kt = -1;
}
else if((N-k2) % 2 == 0){
k = (N-k2)/2+k2;
kt = k2-1;
}
else{
k = (N-k2-1)/2+k2;
kt = k2-2;
}
// cout << k << " " << kt << " " << k2 << endl;
ll res = 0;
if(kt >= 0){
res += s1[kt];
}
res += s2[k];
cout << res << endl;
// cout << endl;
}
return 0;
}
|
p03158 | C++ | #include <bits/stdc++.h>
int nextInt();
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
int n, q, i;
int A[100005];
int vt[100005];
void pro(int x) {
for(int i=1;i<=n;i++) vt[i] = 0;
for(int i=1;i<=n/2;i++) {
for(int j=n;j>=1;j--) {
if(vt[j] == 0) {
vt[j] = 1;
cout<<A[j]<<' ';
break;
}
}
int jidx = -1;
for(int j=1;j<=n;j++) {
if(vt[j] == 0) {
if(jidx == -1) jidx = j;
else {
if(abs(x - A[jidx]) > abs(x - A[j])) jidx = j;
}
}
}
vt[jidx] = 1;
}
for(int i=1;i<=n;i++) if(vt[i] == 0) cout<<A[i];
cout<<'\n';
}
int dp[100005];
ll X[100005];
int main() {
n = nextInt();
q = nextInt();
for(i=1; i<=n;i++){
A[i] = nextInt();
}
sort(A+1,A+n+1);
int r = n/2 + 1;
int l = 2;
if(n%2) l--;
int cnt=0;
ll sum = 0;
for(int i=r;i<=n;i++) sum += (ll)A[i];
while(l<r) {
dp[cnt++] = (A[l]+A[r])/2;
X[cnt-1] = sum;
sum -= (ll)A[r];
sum += (ll)A[l];
l+=2;
r++;
}
X[cnt] = sum;
while(q--){
int a = nextInt();
int idx = lower_bound(dp,dp+cnt,a) - dp;
cout<<X[idx]<<'\n';
}
return 0;
}
int nextInt(){
int f=0; char c=getchar();
while((c<'0')||('9'<c)){c=getchar();}
while((c>='0')&&(c<='9')){f=f*10+(c-'0'); c=getchar();}
return f;
}
|
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
//#define int long long
typedef long long ll; typedef long double ld; typedef pair<int,int> pii; typedef pair<ll,ll> pll; typedef vector<int> vi; typedef vector<ll> vl;
typedef vector<string> vst; typedef vector<bool> vb; typedef vector<ld> vld; typedef vector<pii> vpii; typedef vector<pll> vpll; typedef vector<vector<int> > vvi;
const int INF = (0x7FFFFFFFL); const ll INFF = (0x7FFFFFFFFFFFFFFFL); const string ALPHABET = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const int MOD = 1e9 + 7; const int MODD = 998244353; const string alphabet = "abcdefghijklmnopqrstuvwxyz";
const double PI = acos(-1.0); const double EPS = 1e-9; const string Alphabet = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz";
int dx[9] = { 1, 0, -1, 0, 1, -1, -1, 1, 0 };
int dy[9] = { 0, 1, 0, -1, -1, -1, 1, 1, 0 };
#define ln '\n'
#define scnaf scanf
#define sacnf scanf
#define sancf scanf
#define SS(type, ...)type __VA_ARGS__;MACRO_VAR_Scan(__VA_ARGS__);
template<typename T> void MACRO_VAR_Scan(T& t){cin >> t;}template<typename First, typename...Rest> void MACRO_VAR_Scan(First& first, Rest&...rest){cin >> first;MACRO_VAR_Scan(rest...);}
#define SV(type,c,n) vector<type> c(n);for(auto& i:c)cin >> i;
#define SVV(type,c,n,m) vector<vector<type>> c(n,vector<type>(m));for(auto& r:c)for(auto& i:r)cin >> i;
template<class T>ostream &operator<<(ostream &o,const vector<T>&j){o<<"{";for(int i=0;i<(int)j.size();++i)o<<(i>0?", ":"")<<j[i];o<<"}";return o;}
template<class T,class U>ostream &operator<<(ostream &o,const pair<T,U>&j){o<<"{"<<j.first<<", "<<j.second<<"}";return o;}
template<class T,class U>ostream &operator<<(ostream &o,const map<T,U>&j){o<<"{";for(auto t=j.begin();t!=j.end();++t)o<<(t!=j.begin()?", ":"")<<*t;o<<"}";return o;}
template<class T>ostream &operator<<(ostream &o,const set<T>&j){o<<"{";for(auto t=j.begin();t!=j.end();++t)o<<(t!=j.begin()?", ":"")<<*t;o<<"}";return o;}
inline int print(void){cout << endl; return 0;}
template<class Head> int print(Head&& head){cout << head;print();return 0;} template<class Head,class... Tail> int print(Head&& head,Tail&&... tail){cout<<head<<" ";print(forward<Tail>(tail)...);return 0;}
inline int debug(void){cerr << endl; return 0;}
template<class Head> int debug(Head&& head){cerr << head;debug();return 0;} template<class Head,class... Tail> int debug(Head&& head,Tail&&... tail){cerr<<head<<" ";debug(forward<Tail>(tail)...);return 0;}
template<typename T> void PA(T &a){int ASIZE=sizeof(a)/sizeof(a[0]);for(int ii=0;ii<ASIZE;++ii){cout<<a[ii]<<" \n"[ii==ASIZE-1];}}
template<typename T> void PV(T &v){int VSIZE=v.size();for(int ii=0;ii<VSIZE;++ii){cout<<v[ii]<<" \n"[ii==VSIZE-1];}}
#define ER(x) cerr << #x << " = " << (x) << endl;
#define ERV(v) {cerr << #v << " : ";for(const auto& xxx : v){cerr << xxx << " ";}cerr << "\n";}
inline int YES(bool x){cout<<((x)?"YES":"NO")<<endl;return 0;} inline int Yes(bool x){cout<<((x)?"Yes":"No")<<endl;return 0;} inline int yes(bool x){cout<<((x)?"yes":"no")<<endl;return 0;}
inline int yES(bool x){cout<<((x)?"yES":"nO")<<endl;return 0;} inline int Yay(bool x){cout<<((x)?"Yay!":":(")<<endl;return 0;}
template<typename A,typename B> void sankou(bool x,A a,B b){cout<<((x)?(a):(b))<<endl;}
#define _overload3(_1,_2,_3,name,...) name
#define _REP(i,n) REPI(i,0,n)
#define REPI(i,a,b) for(ll i=ll(a);i<ll(b);++i)
#define REP(...) _overload3(__VA_ARGS__,REPI,_REP,)(__VA_ARGS__)
#define _RREP(i,n) RREPI(i,n,0)
#define RREPI(i,a,b) for(ll i=ll(a);i>=ll(b);--i)
#define RREP(...) _overload3(__VA_ARGS__,RREPI,_RREP,)(__VA_ARGS__)
#define EACH(e,v) for(auto& e : v)
#define PERM(v) sort((v).begin(),(v).end());for(bool c##p=1;c##p;c##p=next_permutation((v).begin(),(v).end()))
#define ADD(a,b) a=(a+ll(b))%MOD
#define MUL(a,b) a=(a*ll(b))%MOD
inline ll MOP(ll x,ll n,ll m=MOD){ll r=1;while(n>0){if(n&1)(r*=x)%=m;(x*=x)%=m;n>>=1;}return r;}
inline ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}inline ll lcm(ll a,ll b){return a*b/gcd(a,b);}inline ll POW(ll a,ll b){ll c=1ll;do{if(b&1)c*=1ll*a;a*=1ll*a;}while(b>>=1);return c;}
template<typename T,typename A,typename B> inline bool between(T x,A a,B b) {return ((a<=x)&&(x<b));}template<class T> inline T sqr(T x){return x*x;}
template<typename A,typename B> inline bool chmax(A &a,const B &b){if(a<b){a=b;return 1;}return 0;}
template<typename A,typename B> inline bool chmin(A &a,const B &b){if(a>b){a=b;return 1;}return 0;}
#define tmax(x,y,z) max((x),max((y),(z)))
#define tmin(x,y,z) min((x),min((y),(z)))
#define PB push_back
#define MP make_pair
#define MT make_tuple
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define SORT(v) sort((v).begin(),(v).end())
#define RSORT(v) sort((v).rbegin(),(v).rend())
#define EXIST(s,e) (find((s).begin(),(s).end(),(e))!=(s).end())
#define EXISTST(s,c) (((s).find(c))!=string::npos)
#define POSL(x,val) (lower_bound(x.begin(),x.end(),val)-x.begin())
#define POSU(x,val) (upper_bound(x.begin(),x.end(),val)-x.begin())
#define SZV(a) int((a).size())
#define SZA(a) sizeof(a)/sizeof(a[0])
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
#define MEMINF(a) memset(a,0x3f,sizeof(a))
#define FILL(a,b) memset(a,b,sizeof(a))
#define UNIQUE(v) sort((v).begin(),(v).end());(v).erase(unique((v).begin(),(v).end()),(v).end())
struct abracadabra{
abracadabra(){
cin.tie(0); ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
cerr << fixed << setprecision(5);
};
} ABRACADABRA;
//---------------8<---------------8<---------------8<---------------8<---------------//
/*
・1次元累積和
> build O(n)
> add,query O(1)
[応用例] 加減算をそれぞれXORにすると, 累積XOR
[使用例]
CumulativeSum<int> acc(n); // 要素数nの累積和用の配列
acc.add(k,x); // 要素kに値xを加える
acc.build(); // 累積和を取る
cout << acc.query(k) << endl; // 区間[0,k]の和
cout << acc.query(l,r) << endl; // 区間[l,r)の和
*/
template<class T> struct CumulativeSum {
vector<T> data;
CumulativeSum(int sz) : data(sz, 0) {};
void add(int k, T x) {
data[k] += x;
// data[k] ^= x;
}
void build() {
for(int i = 1; i < data.size(); i++) {
data[i] += data[i - 1];
// data[i] ^= data[i - 1];
}
}
T query(int k) {
if (k < 0) return (0);
return (data[min(k, (int) data.size() - 1)]);
}
T query(int l, int r) {
T ret = (data[min(r-1, (int) data.size() - 1)]);
if (l >= 0) ret -= (data[min(l-1, (int) data.size() - 1)]);
// if (l >= 0) ret ^= (data[min(l-1, (int) data.size() - 1)]);
return ret;
}
};
signed main() {
SS(int, N, Q);
SV(int, A, N);
CumulativeSum<ll> big(N);
CumulativeSum<ll> small(N / 2 + 1);
RREP(i, N - 1, 0) big.add(N - i - 1, A[i]);
big.build();
// 奇数だったら一番下から
// 偶数だったら下から1番目から
int fir = int(N % 2 == 0);
for (int i = fir, j = 0; i < N; i += 2, ++j) {
small.add(j, A[i]);
}
small.build();
while (Q--) {
SS(int, X);
// int x_pos = POSU(A, X);
int x_pos = POSL(A, X);
// debug(x_pos);
int ok = x_pos - 1, ng = N;
while (abs(ok - ng) > 1) {
int mid = (ok + ng) / 2;
int circle = mid - x_pos;
int pos = POSL(A, X - abs(A[mid] - X));
if (pos != x_pos) circle += x_pos - pos;
int triangle = N - mid - 1;
if (triangle > circle) {
ok = mid;
} else {
ng = mid;
}
// print(X, mid, pos, circle, ok, ng);
}
// print(ok);
// 上から p = (N - ok - 1) 個とる
// あとは下からとびとびに (N - 2 * p) 個とる
int p = N - ok - 1;
int q = (max(0, N - 2 * p) + 1) / 2;
ll sum = big.query(p - 1) + small.query(q - 1);
// print(p, q, big.query(p - 1), small.query(q - 1));
print(sum);
}
}
|
p03158 | C++ | #include<bits/stdc++.h>
using namespace std;
typedef pair<int,int>P;
vector<P>vec;
vector<int>b;
long long sum[100009],s[100009];
int main(){
int n,q;
int a[100009];
cin>>n>>q;
for(int i=0;i<n;i++){
cin>>a[i];
b.push_back(a[i]);
}
for(int i=1;i<=n;i++){
int idx=n-i;
if(idx-i+1>=0){
int mid=(a[idx]+a[idx-i+1])/2;
vec.push_back(P(mid,i));
}
}
sort(vec.begin(),vec.end());
reverse(b.begin(),b.end());
for(int i=0;i<n;i++){
if(i>0){
sum[i]=sum[i-1];
s[i]=s[i-1];
}
sum[i]+=b[i];
if(i%2==0)s[i]+=b[i];
}
for(int i=0;i<vec.size();i++){
//cout<<vec[i].first<<' '<<vec[i].second<<endl;
}
for(int i=0;i<q;i++){
int x;
cin>>x;
int idx=upper_bound(vec.begin(),vec.end(),P(x,0))-vec.begin();
//cout<<idx<<endl;
int t=vec[idx].second;
//cout<<t<<endl;
long long ans=sum[t-1];
//if(t*2<n)ans+=s[t*2];
if(t*2<n&&t*2-1>=0)ans+=s[n-1]-s[t*2-1];
if(t*2<n&&t*2==0)ans+=s[n-1];
cout<<ans<<endl;
}
return(0);
}
|
p03158 | C++ | #include <cstdio>
#include <algorithm>
#include <vector>
#define mp make_pair
#define x first
#define y second
#define ll long long
using namespace std;
ll n,q,ans,ps_o[50005],ps_e[50005],a[100005],ps[100005],l,r,mid,num,p,p2;
int main(){
scanf("%lld%lld",&n,&q);
for (int i=1;i<=n;i++){
scanf("%lld",&a[i]);
if (i%2 == 0)
ps_e[i/2]=ps_e[i/2-1]+a[i];
else
ps_o[i/2+1]=ps_o[i/2]+a[i];
ps[i]=ps[i-1]+a[i];
}
for (int i=1;i<=q;i++){
scanf("%lld",&num);
l=0; r=n/2;
while (l <= r){
mid=(l+r)/2;
if (abs(a[n-mid+1]-num) >= abs(num-a[n-mid*2+1]))
l=mid;
else
r=mid;
if (r-l <= 1){
if (abs(a[n-r+1]-num) >= abs(num-a[n-r*2+1]))
p=r;
else
p=l;
break;
}
}
ans=ps[n]-ps[n-p];
if (abs(num-a[n-p]) >= abs(num-a[n-p*2]) && n-p*2 > 0){
ans+=a[n-p];
p2=n-p*2-1;
if (p2%2 == 0)
ans+=ps_o[p2/2];
else
ans+=ps_e[p2/2];
}
else
{
p2=n-p*2;
if (p2%2 == 0)
ans+=ps_e[p2/2];
else
ans+=ps_o[p2/2+1];
}
printf("%lld\n",ans);
}
return 0;
} |
p03158 | C++ | #include <bits/stdc++.h>
#include <ostream>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
template<class T> using V = vector<T>;
template<class T> using VV = V<V<T>>;
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n-1); }
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout << setprecision(20) << fixed;
int n, q;
cin >> n >> q;
V<ll> a(n), as(n + 1);
V<ll> two(n);
for (int i = 0; i < n; ++i) {
cin >> a[i]; a[i] *= 3;
as[i + 1] = as[i] + a[i];
two[i] = (i >= 2 ? two[i - 2] : 0) + a[i];
}
for (int ph = 0; ph < q; ph++) {
ll x;
cin >> x;
x *= 3; x--;
ll lw = 0, up = TEN(10);
while (up - lw > 1) {
ll md = (lw + up) / 2;
int cnt0 = upper_bound(a.begin(), a.end(), x + md) - lower_bound(a.begin(), a.end(), x - md);
int cnt1 = a.end() - upper_bound(a.begin(), a.end(), x + md);
if (cnt0 <= cnt1) {
lw = md;
} else {
up = md;
}
}
ll md = lw;
int cnt0 = upper_bound(a.begin(), a.end(), x + md) - lower_bound(a.begin(), a.end(), x - md);
int cnt1 = a.end() - upper_bound(a.begin(), a.end(), x + md);
ll ans = as.back() - as[n - cnt1];
if (cnt0 < cnt1) {
if (n - cnt1 - cnt0 - 2 >= 0) ans += two[n - cnt1 - cnt0 - 2];
} else {
if (n - cnt1 - cnt0 - 1 >= 0) ans += two[n - cnt1 - cnt0 - 1];
}
cout << ans / 3 << endl;
}
return 0;
}
|
p03158 | C++ | #include <algorithm>
#include <bitset>
#include <cctype>
#include <chrono>
#include <cmath>
#include <cstdio>
#include <ctime>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3fLL;
/*----------------------------------------*/
int main() {
cin.tie(0); ios::sync_with_stdio(false);
// freopen("input.txt", "r", stdin);
int n, q; cin >> n >> q;
vector<int> a(n); REP(i, n) cin >> a[i];
vector<long long> ruiseki(n+1, 0), odd(n, 0), even(n, 0);
REP(i, n) ruiseki[i+1] = ruiseki[i] + a[i];
even[0] = a[0];
FOR(i, 1, n) {
if (i % 2 == 0) {
odd[i] = odd[i-1];
even[i] = even[i-1] + a[i];
} else {
odd[i] = odd[i-1] + a[i];
even[i] = even[i-1];
}
}
vector<pair<int, int>> x(q);
REP(i, q) {
cin >> x[i].first;
x[i].second = i;
}
sort(ALL(x));
map<int, long long> mp;
int left = 0, width = n/2, border = (n+1)/2;
REP(repeat, q) {
int xx = x[repeat].first;
while (left < n-1) {
if (abs(a[left] - xx) > abs(a[left+width] - xx)) {
++left;
if (left+width-1 == border) {
--width;
++border;
}
} else break;
}
long long res = ruiseki[n] - ruiseki[left+width];
if (n % 2 == 0) {
if ((n-left) % 2 == 0) {
if (left-1>=0) res += odd[left-1];
} else if (left - 2 >= 0) res += odd[left-2];
} else {
if ((n-left) % 2 == 0) {
if (left-1>=0) res += even[left-1];
} else if (left - 2 >= 0) res += even[left-2];
}
mp[x[repeat].second] = res;
// cout << left << " " << width << " " << border << '\n';
}
REP(i, q) cout << mp[i] << '\n';
return 0;
}
|
p03158 | C++ | #include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long LL;
const int MAXN=100000;
int n,q;
LL a[MAXN+1],sum[MAXN+1],sum2[MAXN+1];
void init(){
scanf("%d%d",&n,&q);
for(int i=1;i<=n;i++)
scanf("%lld",&a[i]);
sum[0]=0;
for(int i=1;i<=n;i++) sum[i]=sum[i-1]+a[i];
sum2[0]=0;
sum2[1]=a[1];
for(int i=2;i<=n;i++) sum2[i]=sum2[i-2]+a[i];
}
void solve(){
while(q--){
LL x; scanf("%lld",&x);
int L=1,R=(n+1)/2,Mid;
int i,j;
while(L<R){
Mid=(L+R)/2;
j=n-Mid;
i=j-Mid;
if(i>0&&abs(x-a[i])<=abs(x-a[j])) L=Mid+1;
else R=Mid;
}
Mid=(L+R)/2;
j=n-Mid;
i=j-Mid;
LL ans=sum[n]-sum[j]+sum2[i];
printf("%lld\n",ans);
}
}
int main(){
init();
solve();
} |
p03158 | C++ | //In The Name Of God
#include <bits/stdc++.h>
#define F first
#define S second
#define mp make_pair
#define L(x) (2*(x))
#define R(x) ((2*(x))+1)
#define pii pair<int, int>
#define pb push_back
using namespace std;
const int N = 1e5 + 5, Mod = 1e9 + 7, P = 727, Lg = 17, TOF = 1900;
#define int long long
int ret[N][2] , A[N] , n , Ps[N];
bool Check(int x, int id, int f){
int num1 = n - id + 1 - f;
int num2 = f;
int y = A[id + f - 1] - x;
if(id + f - 1 > n)
y = 0;
int xx = lower_bound(A + 1 , A + n + 1 , x - y) - A;
num2 += id - xx;
//cout << id << " " << A[id] - y << " " << y << endl;
if(num2 <= num1)
return true;
return false;
}
int32_t main(){
ios_base::sync_with_stdio(0); cin.tie(0);
int q; cin >> n >> q;
for(int i = 1; i <= n; i++)
cin >> A[i];
sort(A + 1, A + n + 1);
for(int i = 1 ; i <= n ; i++){
Ps[i] = Ps[i - 1] + A[i];
ret[i][0] = ret[i - 1][0];
ret[i][1] = ret[i - 1][1];
if(i % 2 == 0)
ret[i][0] += A[i];
else
ret[i][1] += A[i];
}
for(int i = 1; i <= q; i++){
int x; cin >> x;
if(x >= A[n]){
cout << ret[n][n % 2] << "\n";
continue;
}
int id = lower_bound(A + 1, A + n + 1, x) - A;
int l = 0, r = n - id + 2;
while(r - l > 1){
int mid = (r + l) / 2;
if(Check(x, id, mid))
l = mid;
else
r = mid;
}
//cout << l << endl << endl;
long long Ans = Ps[n] - Ps[id + l - 1];
x = 2 * id - 2 + 2 * l - n;
Ans += ret[x][x % 2];
cout << Ans << '\n';
}
return 0;
}
|
p03158 | C++ | #include <stdio.h>
long long n, q;
long long a[100000];
long long x[100000];
long long r[100000];
long long r0[100000];
long long xd, xu, xm;
long long yd, yu, ym;
long long z;
long long wd, wu;
int k;
int main() {
scanf("%lld%lld", &n, &q);
for (int i = 0; i < n; i++)scanf("%lld", a + i);
for (int i = 0; i < q; i++)scanf("%lld", x + i);
r[0] = a[0]; r[1] = a[0] + a[1];
r0[0] = a[0]; r0[1] = a[1];
for (int i = 2; i < n; i++) {
r[i] = r[i - 1] + a[i];
if (i % 2)r0[i] = r0[i - 2] + a[i];
else r0[i] = r0[i - 2] + a[i];
}
for (int i = 0; i < q; i++) {
xd = 0; xu = a[n - 1];
while (xu - xd > 1) {
xm = (xd + xu) / 2;
z = xm + x[i];
yd = 0; yu = n - 1;
while (yu - yd > 1) {
ym = (yd + yu) / 2;
if (a[ym] < z)yd = ym;
else yu = ym;
}
if (a[n - 1] <= z)yd = n - 1;
wu = yd;
z = x[i] - xm;
yd = 0; yu = n - 1;
while (yu - yd > 1) {
ym = (yd + yu) / 2;
if (a[ym] >= z)yu = ym;
else yd = ym;
}
if (a[0] >= z)yu = 0;
wd = yu;
if (2 * wu - wd + 1 > n - 1)xu = xm;
if (2 * wu - wd + 1 < n - 2) {
if (wu < n&&a[wu + 1] == x[i] + xm)wu++;
}
if (2 * wu - wd + 1 < n - 2)xd = xm;
if (2 * wu - wd + 1 == n - 1) {
k = 0;
break;
}
if (2 * wu - wd + 1 == n - 2) {
k = 1;
break;
}
}
if (2 * wu - wd + 1 >= n)printf("%lld\n", r0[n - 1]);
else {
if (k)printf("%lld\n", r[n - 1] - r[wu] + r0[wd - 2]);
else printf("%lld\n", r[n - 1] - r[wu] + r0[wd - 1]);
}
}
return 0;
} |
p03158 | C++ | #include <iostream>
#include <iomanip>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <stack>
#include <queue>
#include <bitset>
// #define int ll; // ＾o＾
#define FOR(i, b, e) for(ll i = (ll)(b); i < (ll)(e); ++i)
#define RFOR(i, b, e) for(ll i = (ll)(e-1); i >= (ll)(b); --i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define REPC(x,c) for(const auto& x:(c))
#define REPI2(it,b,e) for(auto it = (b); it != (e); ++it)
#define REPI(it,c) REPI2(it, (c).begin(), (c).end())
#define REPIR(it,c) REPI2(it, (c).rbegin(), (c).rend())
#define REPI_ERACE2(it, b, e) for(auto it = (b); it != (e);)
#define REPI_ERACE(it, c) REPI_ERACE2(it, (c).begin(), (c).end())
#define ALL(x) (x).begin(),(x).end()
#define SORT(x) sort(ALL(x))
#define RSORT(x) sort((x).rbegin(),(x).rend())
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
#define BR cout<<"\n";
#define dump(...) { auto __DUMP_NAME_LIST__ = split(#__VA_ARGS__,','); print(__DUMP_NAME_LIST__, __VA_ARGS__);BR;}
using ll = long long;
using PAIR = std::pair<ll, ll>;
using VS = std::vector<std::string>;
using VL = std::vector<long long>;
using VD = std::vector<double>;
// using VI = std::vector<int>;
// using VVI = std::vector<std::vector<int>>;
using VVL = std::vector<std::vector<ll>>;
using std::cout;
// using std::endl;
#define endl '\n'
using std::cin;
using std::sort;
using std::pair;
using std::string;
using std::stack;
using std::queue;
using std::vector;
using std::list;
using std::map;
using std::unordered_map;
using std::multimap;
using std::unordered_multimap;
using std::set;
using std::unordered_set;
using std::multiset;
using std::bitset;
constexpr ll MOD = 1000000007;
//constexpr ll MOD = 998244353;
constexpr ll INF = 1LL << 60;
template<class T> std::istream& operator >> (std::istream& is, vector<T>& vec) { for (T& x : vec) is >> x; return is; }
template<class S, class T>std::ostream& operator<<(std::ostream& os, const std::pair<S, T>& p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
inline std::list<std::string> split(std::string str, char del) { std::list<std::string> sList; string s = ""; for (const auto& c : str) { if (c == del) { sList.emplace_back(s); s = ""; } else { if (c != ' ' || del == ' ') { s += c; } } }sList.emplace_back(s); return sList; }
struct Preprocessing { Preprocessing() { std::cin.tie(0); std::ios::sync_with_stdio(0); }; };
template<class T>struct has_begin { private: template <class U> static auto check(U x) -> decltype(x.begin(), std::true_type{}); static std::false_type check(...); public: static bool const value = decltype(check(std::declval<T>()))::value; };
inline void print(std::list<std::string>& str); template<class Primitive, class... Tail, std::enable_if_t<!has_begin<Primitive>::value, std::nullptr_t> = nullptr>inline void print(std::list<std::string>& str, const Primitive& x, const Tail&... tail); template<class Container, class... Tail>inline auto print(std::list<std::string>& str, const Container& c, const Tail&... tail) -> decltype(c.begin()); template<class... Tail>inline void print(std::list<std::string>& str, const std::string& s, const Tail&... tail);
template<class Container>inline auto printSingle(const Container& c) ->decltype(c.begin()) { for (const auto& x : c) { std::cout << x << " "; }std::cout << "\n"; return c.begin(); }
template<class Primitive, std::enable_if_t<!has_begin<Primitive>::value, std::nullptr_t> = nullptr>inline void printSingle(const Primitive& x) { std::cout << x << " "; }
inline void print(std::list<std::string>& str) {}
template<class Primitive, class... Tail, std::enable_if_t<!has_begin<Primitive>::value, std::nullptr_t> = nullptr>inline void print(std::list<std::string>& str, const Primitive& x, const Tail&... tail) { std::cout << *str.begin() << ":" << x << " "; if (sizeof...(tail) > 0) { std::cout << "\n"; str.pop_front(); print(str, tail...); } }
template<class Container, class... Tail>inline auto print(std::list<std::string>& str, const Container& c, const Tail&... tail) ->decltype(c.begin()) { std::cout << "-- " << *str.begin() << " --\n"; for (const auto& x : c) { printSingle(x); }std::cout << "\n"; str.pop_front(); print(str, tail...); return c.begin(); }
template<class... Tail>inline void print(std::list<std::string>& str, const std::string& s, const Tail&... tail) { std::cout << *str.begin() << ":" << s << "\n"; str.pop_front(); print(str, tail...); }
//=============================================================================================
// ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
// ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
// ll pow(ll a, ll b) { ll ans = 1; while (b > 0) { if (b % 2 == 1) { ans *= a; ans %= MOD; }b /= 2; a *= a; a %= MOD; }return ans; }
// ll comb(ll a, ll b) { static constexpr ll size = 1e6; static VL fac(size); static VL finv(size); static VL inv(size); static ll n = 0; if (n > a) { return fac[a] * (finv[b] * finv[a - b] % MOD) % MOD; }fac[0] = fac[1] = 1; finv[0] = finv[1] = 1; inv[1] = 1; FOR(i, 2, a + 1) { inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD; fac[i] = fac[i - 1] * (ll)i%MOD; finv[i] = finv[i - 1] * inv[i] % MOD; }n = a + 1; return comb(a, b); }
// multiset<ll> prime_decomposition(ll n) { ll i = 2; multiset<ll> table{}; while (i * i <= n) { while (n % i == 0) { n /= i; table.emplace(i); }++i; }if (n > 1) { table.emplace(n); return table; }return table; }
// vector<bool> eratosthenes(ll n) { vector<bool> lst(n + 1, true); lst[0] = lst[1] = false; FOR(i, 2, n / 2 + 1) { lst[i * 2] = false; }for (ll i = 3; i <= n; i += 2) { if (lst[i] == false) { continue; }FOR(j, 2, n / i + 1) { lst[i*j] = false; } }return lst; }
//==============================================================================================
signed main() {
ll n, q;
cin >> n >> q;
VL a(n);
cin >> a;
VL sum(1);
sum.reserve(n + 1);
REP(i, n) {
sum.emplace_back(sum[i] + a[i]);
}
VL sum2(1);
VL sum3(1);
sum2.reserve(n / 2 + 1);
sum3.reserve(n / 2 + 1);
for (int i = 0; i < n; i += 2) {
sum2.emplace_back(sum2[i / 2] + a[i]);
}
for (int i = 1; i < n; i += 2) {
sum3.emplace_back(sum3[i / 2] + a[i]);
}
VL dNum;
dNum.reserve(n);
FOR(i, 1, (n+1) / 2) {
dNum.emplace_back(a[n - 2 * i - 1] + (a[n - i - 1] - a[n - 2*i - 1]) / 2);
}
std::sort(ALL(dNum));
REP(i, q) {
ll x;
cin >> x;
ll limit = std::lower_bound(ALL(dNum), x) - dNum.begin();
ll ans = 0;
ll p = (n+1) / 2 - limit;
ans += sum[n] - sum[n - p];
ll www = n - p * 2;
if (www > 0) {
if (www % 2 == 1) {
ans += sum2[(www+1) / 2];
} else {
ans += sum3[(www+1) / 2];
}
}
cout << ans << endl;
}
}
|
p03158 | C++ | #pragma GCC optimize ("Ofast","unroll-loops")
#include <bits/stdc++.h>
#define pb push_back
#define eb emplace_back
#define MP make_pair
#define F first
#define S second
#define MEM(a,b) memset(a,b,sizeof a)
#define Tie ios::sync_with_stdio(0),cin.tie(0);
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll n,q,a[100100],b[100100],x,tmp,ans,l,r,all;
const ll M=1000000000;
struct nodes
{
ll p,p2;
nodes *l,*r;
nodes():p(0),p2(0),l(0),r(0){}
};
nodes *head;
void fix(nodes *&o,ll l,ll r,ll x)
{
ll m=l+r>>1;
o->p++,o->p2+=x;
if(l==r)
return;
if(x<=m)
{
if(!o->l)
o->l=new nodes();
fix(o->l,l,m,x);
}
else
{
if(!o->r)
o->r=new nodes();
fix(o->r,m+1,r,x);
}
}
int search(nodes *o,ll l,ll r,ll tl,ll tr)
{
if(l<=tl&&tr<=r)
return o->p;
ll m=tl+tr>>1,re=0;
if(l<=m&&o->l)
re+=search(o->l,l,r,tl,m);
if(m+1<=r&&o->r)
re+=search(o->r,l,r,m+1,tr);
return re;
}
ll search2(nodes *o,ll l,ll r,ll tl,ll tr)
{
if(l<=tl&&tr<=r)
return o->p2;
ll m=tl+tr>>1,re=0;
if(l<=m&&o->l)
re+=search2(o->l,l,r,tl,m);
if(m+1<=r&&o->r)
re+=search2(o->r,l,r,m+1,tr);
return re;
}
ll f1(ll x)
{
ll l=0,r=M-x-1,m;
while(l!=r)
{
m=l+r>>1;
if(search(head,max(0LL,x-m),x+m,1,M)+1<search(head,x+m+1,M,1,M))
l=m+1;
else
r=m;
}
return l;
}
ll f2(ll x)
{
ll l=0,r=n+1,m;
while(l!=r)
{
m=l+r>>1;
if(a[m]<x)
l=m+1;
else
r=m;
}
return l;
}
int main()
{Tie
head=new nodes();
cin>>n>>q,a[n+1]=2000000000;
for(int i=1;i<=n;i++)
{
cin>>a[i],fix(head,1,M,a[i]),b[i]=a[i],all+=a[i];
if(i>1)
b[i]+=b[i-2];
}
for(int i=0;i<q;i++)
{
cin>>x;
tmp=f1(x);
l=search(head,x-tmp,x+tmp,1,M);
if(x+tmp+1>1000000000)r=0;
else r=search(head,x+tmp+1,M,1,M);
ans=0;
if(l==r)
{
ans=search2(head,x-tmp,x+tmp,1,M);
if(a[1]<x-tmp)
{
tmp=f2(x-tmp)-2;
if(tmp>=0)
ans+=b[tmp];
}
}
else if(l+1==r)
{
ans=search2(head,x-tmp,x+tmp,1,M);
if(a[1]<x-tmp)
{
tmp=f2(x-tmp)-1;
if(tmp>=0)
ans+=b[tmp];
}
}
else if(l==r+1)
{
ans=search2(head,x-tmp,x+tmp,1,M);
ans-=a[f2(x+tmp+1)-1];
if(a[1]<x-tmp)
{
tmp=f2(x-tmp)-1;
if(tmp>=0)
ans+=b[tmp];
}
}
cout << all-ans<<'\n';
}
} |
p03158 | C++ | #include <iostream>
#include <iomanip> // << fixed << precision(10)
#include <vector>
#include <string>
#include <map>
#include <set>
#include <cmath>
#include <algorithm>
using namespace std;
#define FOR(i,s,t) for(int i=s;i<t;i++)
#define REP(i,n) FOR(i,0,n)
#define PRINT(s) cout << s << "\n"
#define SORT(A) sort(A.begin(), A.end())
#define EACHPRINT(A, T) for_each(begin(A), end(A), [&](T i){ cout << i << " "; });cout << "\n"
typedef long long lint;
typedef pair<lint, lint> P;
bool lessPair(const P& l, const P& r){return l.second < r.second;}
bool lessindex(const P& l, const P& r){return l.first < r.first;}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
lint N; cin >> N;
lint Q; cin >> Q;
vector<lint> A(N);
REP(i, N) {
lint a; cin >> a; A[i] = a;
}
vector<P> X(Q);
vector<lint> res(Q);
REP(i, Q) {
lint a; cin >> a; X[i] = P(i, a);
}
sort(X.begin(), X.end(), lessPair);
lint tmp = 0;
FOR(i, N/2, N) {
tmp += A[i];
}
lint i1,i2;
if(N%2 == 1) {
i1 = 0;
i2 = N-2 -(N-3)/2;
}
else {
i1 = 1;
i2 = N-2 -(N-4)/2;
}
REP(i, Q) {
lint x = X[i].second;
while(x > (A[i1] + A[i2])/2 && i1 != i2) {
tmp -= A[i2];
tmp += A[i1];
i1 += 2;
i2 += 1;
}
// cout << "x " << x << "\n";
// cout << i1 << " " << i2 << "\n";
res[X[i].first] = tmp;
}
REP(i, Q) {
cout << res[i] << "\n";
}
return 0;
}
|
p03158 | C++ | #include<stdio.h>
#include<vector>
#include<algorithm>
using namespace std;
typedef long long ll;
ll dat[101010], rh[2][101010], rui[101010], d10[101010];
ll get(ll x, int num)
{
ll beg = 0, end = 10100000000LL;
for (;;)
{
if (beg == end)break;
ll med = (beg + end + 1) / 2;
int s1 = lower_bound(d10, d10 + num, x * 10 - 1 - med) - d10;
int s2 = upper_bound(d10, d10 + num, med + x * 10 - 1) - d10 - 1;
if (s2 - s1 + 1 <= num - s2 - 1)beg = med;
else end = med - 1;
}
int s1 = lower_bound(d10, d10 + num, x * 10 - 1 - beg) - d10;
int s2 = upper_bound(d10, d10 + num, beg + x * 10 - 1) - d10 - 1;
//printf("%lld %d %d\n", beg, s1, s2);
ll ans = rui[num] - rui[s2 + 1];
if (num % 2 == 0)ans += rh[1][(((s1 - 1) % 2 == 1) ? (s1 - 1) : (s1 - 2)) + 2];
else ans += rh[0][(((s1 - 1) % 2 == 0) ? (s1 - 1) : (s1 - 2)) + 2];
return ans;
}
int main()
{
int num, query;
scanf("%d%d", &num, &query);
for (int i = 0; i < num; i++)scanf("%lld", &dat[i]);
for (int i = 0; i < num; i++)
{
if (i % 2 == 0)rh[0][i + 2] = rh[0][i] + dat[i];
else rh[1][i + 2] = rh[1][i] + dat[i];
rui[i + 1] = rui[i] + dat[i];
d10[i] = dat[i] * 10;
}
for (int p = 0; p < query; p++)
{
ll z;
scanf("%lld", &z);
printf("%lld\n", get(z, num));
}
} |
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<ll, pair<ll, ll> > P3;
const ll MOD = 1000000007;
const int IINF = INT_MAX;
const ll LLINF = LLONG_MAX;
const int MAX_N = int(1e5 + 5);
const double EPS = 1e-10;
const int di[] = {0, 1, 0, -1}, dj[] = {1, 0, -1, 0};
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define SORT(v) sort((v).begin(), (v).end())
#define ALL(v) (v).begin(), (v).end()
ll n, q, a[MAX_N], cum[MAX_N], eve[MAX_N];
int main() {
cin >> n >> q;
REP(i,n)cin >> a[i];
REP(i,n){
cum[i+1] += cum[i]+a[i];
eve[i+1] += eve[i]+(i%2?a[i]:0ll);
}
REP(i,q){
ll x, ok = 0, ng = n-n/2+1, ans = 0, k;
cin >> x;
k = lower_bound(a,a+n,x) - a;
ng = min(ng, n-k+1);
while(abs(ok-ng)>1){
ll mid = (ok+ng)/2, l, r;
l = max(0ll,n-2*mid+1);
r = n-mid;
//cout << a[l] << " " << a[r] << endl;
if( (x-a[l] <= a[r]-x)){
ok = mid;
}
else{
ng = mid;
}
}
//cout << "ok" << ok << endl;
ans += cum[n]-cum[n-ok];
if(n%2) ans += cum[n-2*ok] - eve[n-2*ok];
else ans += eve[n-2*ok];
cout << ans << endl;
}
return 0;
} |
p03158 | C++ | //12, 01, 2019, 10:42:24 Rafaelcs cpp
#include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, int> pii;
const int N = int(1e5 + 100);
ll a[N];
ll pref[N], pref_i[N], pref_p[N];
int n, q;
ll resp[N];
pii qu[N];
int m_lower_bound(ll val){
int r = 1;
int lo = 1, hi = n;
while(lo <= hi){
int mid = (lo + hi) >> 1;
if(a[mid] > val){
hi = mid - 1;
}else{
lo = mid + 1;
r = mid;
}
}
return r;
}
int m_upper_bound(ll val){
int r = n;
int lo = 1, hi = n;
// cout << "searching for " << val << endl;
while(lo <= hi){
int mid = (lo + hi) >> 1;
if(a[mid] < val){
lo = mid + 1;
}else{
r = mid;
hi = mid - 1;
}
}
return r;
}
bool can(int lo, int hi, ll val){
int loo = 1;
int hii = lo;
int l_taked = n - hi;
int r = lo + 1;
ll mdif = abs(a[hi] - val);
while(loo <= hii){
int mid = (loo + hii) >> 1;
ll diff = abs(a[mid] - val);
if(diff <= mdif){
r = mid;
hii = mid - 1;
}else{
loo = mid + 1;
}
}
int have = lo - r + 1 + hi - lo;
return have <= l_taked;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> q;
for(int i = 1 ; i <= n ; i++){
cin >> a[i];
pref[i] = pref[i - 1] + a[i];
pref_i[i] = pref_i[i - 1];
pref_p[i] = pref_p[i - 1];
if(i & 1){
pref_i[i] += a[i];
}else{
pref_p[i] += a[i];
}
}
for(int i = 0 ; i < q ; i++){
cin >> qu[i].first;
qu[i].second = i;
}
sort(qu, qu + q);
int hi = n;
// cout << "aqui!" << endl;
for(int i = q - 1 ; i >= 0 ; i--){
ll xi;
xi = qu[i].first;
// cout << "processando " << xi << endl;
if(xi <= a[1]){
resp[qu[i].second] = pref[n] - pref[n / 2];
continue;
}else if(xi >= a[n]){
if(n & 1){
resp[qu[i].second] = pref[n] - pref_p[n];
}else{
resp[qu[i].second] = pref[n] - pref_i[n];
}
continue;
}
int lo = m_lower_bound(xi);
// cout << "Lo = " << lo << endl;
while(lo < hi && !can(lo, hi, xi)){
// cout << "hi= " << hi << endl;
hi--;
}
int have = n - hi;
ll sum = 0LL;
sum = pref[hi] - pref[hi - have];
int idx = hi - have;
if(idx & 1){
sum += pref_p[idx];
}else{
sum += pref_i[idx];
}
resp[qu[i].second] = pref[n] - sum;
}
for(int i = 0 ; i < q; i++){
cout << resp[i] << endl;
}
return 0;
} |
p03158 | C++ | #define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<sstream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<climits>
#include<cmath>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<numeric>
#include<functional>
#include<algorithm>
#include<bitset>
#include<tuple>
#include<unordered_set>
#include<random>
#include<array>
#include<cassert>
using namespace std;
#define INF (1<<29)
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(v) v.begin(),v.end()
#define uniq(v) v.erase(unique(all(v)),v.end())
int n, q;
int a[100000];
int x[100000];
long long sumt[100001];
long long sum[100000];
pair<int, int> draw(int x, int k) {
// 最大の差
int lb = -1, ub = a[n - 1];
while (ub - lb > 1) {
int mid = (lb + ub) / 2;
int le = lower_bound(a, a + n, x - mid) - a;
int ri = upper_bound(a, a + n, x + mid) - a;
if (ri - le >= k)ub = mid;
else lb = mid;
}
int diff = ub;
int le = lower_bound(a, a + n, x - diff) - a;
int ri = upper_bound(a, a + n, x + diff) - a;
if (ri - le > max(1, k) && x - a[le] == a[ri - 1] - x) {
ri--;
}
return make_pair(le, ri); // [le,ri)
}
//にぶたん用軽量版
bool check(int x, int k) {
if (k == 0)return true;
int tail = a[n - k];
int ri = n - k;
int le = lower_bound(a, a + n, x - abs(tail - x)) - a;
return le < ri && k <= ri - le;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n >> q;
rep(i, n)cin >> a[i];
rep(i, q)cin >> x[i];
sort(a, a + n);
rep(i, n)sum[i] = a[i];
for (int i = 2; i < n; i++)sum[i] += sum[i - 2];
rep(i, n)sumt[i] = a[i];
for (int i = n - 2; i >= 0; i--)sumt[i] += sumt[i + 1];
rep(i, q) {
int X = x[i];
int lb = 0, ub = n;
//高橋君が何枚衝突するまでにとれるか
while (ub - lb > 1) {
int mid = (lb + ub) / 2;
/*auto p = draw(X, mid);
if (p.second <= n - mid)lb = mid;
else ub = mid;*/
if (check(X, mid))lb = mid;
else ub = mid;
}
int k = lb;
long long ans = sumt[n - k];
auto p = draw(X, k);
if (p.second == n) {
ans += sum[n - 1];
}
else if (p.second == n - k) {
if (p.first >= 0)ans += sum[p.first - 1];
}
else {
ans += a[p.second];
if (p.first >= 2)ans += sum[p.first - 2];
}
cout << ans << endl;
}
return 0;
} |
p03158 | C++ | #include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <string>
#include <map>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n) - 1; i >= 0; i--)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (a); i > (b); i--)
#define ALL(a) (a).begin(), (a).end()
int main() {
ll N, Q, A[100000], X[100000], cs1[100001], cs2[100000];
cin >> N >> Q;
REP(i, N) cin >> A[i];
REP(i, Q) cin >> X[i];
cs1[0] = 0, cs2[0] = A[0], cs2[1] = A[1];
REP(i, N) cs1[i + 1] = A[i] + cs1[i];
FOR(i, 2, N) cs2[i] = A[i] + cs2[i - 2];
map<ll, ll> bm;
REP(i, (N - 1) / 2) {
ll r = N - i - 2, l = r - i - 1;
ll b = (A[r] + A[l]) / 2 + 1;
ll index = N;
bm[b] += cs1[index] - cs1[index - i - 1];
index -= 2 * i + 3;
bm[b] += cs2[index];
}
ll sum = 0;
REP(i, (N + 1) / 2) sum += A[N / 2 + i];
REP(q, Q) {
ll x = X[q];
auto it = bm.upper_bound(x);
if (it == bm.begin()) cout << sum << endl;
else cout << (--it)->second << endl;
}
return 0;
} |
p03158 | C++ | #include<bits/stdc++.h>
using namespace std;
using LL=long long;
int main(){
int N,Q;cin>>N>>Q;
vector<LL>A(N);
for(int i=0;i<N;i++)scanf("%lld",&A[i]);
if(N%2!=0){
A.insert(A.begin(),0);
N+=1;
}
A.push_back(100000000000L);
vector<LL>s(N),k(N);
s[0]=A[0];
for(int i=1;i<N;i++)s[i]=s[i-1]+A[i];
k[0]=A[0];
for(int i=1;i<N;i++)k[i]=k[i-1]+ (i%2==0?A[i]:0);
vector<LL>d(N/2);
for(int i=0;i<N/2;i++){
d[i]=(A[N-(N/2-i)]+A[i*2+1])/2;
}
for(int i=0;i<Q;i++){
LL X;scanf("%lld",&X);
vector<LL>::iterator it=lower_bound(d.begin(),d.end(),X);
int o=(it-d.begin());
printf("%lld\n",s[N-1]-((s[N-(N/2-o)-1]-(o*2-1<0?0:s[o*2-1])) + (o*2-1<0?0:k[o*2-1])));
}
}
|
p03158 | C++ | #include<iostream>
#include<cstdint>
using namespace std; // 575
const int MAX = 100001;
int main() {
int N, Q;
static int A[MAX], X;
cin >> N >> Q;
for (int i = 0;i < N;++ i) cin >> A[i];
static int64_t sum = 0;
static pair<int, int64_t> ans[MAX];
for (int i = N / 2;i < N;++ i) sum += A[i];
ans[0] = make_pair(0, sum);
for (int i = 0, l = (N + 1) % 2, r = N / 2;r < N;++ i, l += 2, ++ r) { // 区間(l, r]ですね
ans[i + 1] = make_pair(A[l] + (A[r] - A[l]) / 2, sum -= A[r] - A[l]);
}
for (int i = 0, min, mid, max, halfDiff;i < Q;++ i) {
min = 0;
max = (N + 3) / 2;
cin >> X;
while(halfDiff = max - min >> 1) (ans[mid = min + halfDiff].first < X ? min : max) = mid;
cout << ans[min].second << endl;
}
return 0;
}
/*
31536000のコメント解説欄
ここテンプレで用意してるから、A問題とかだとこの先空欄の危険あり
また、コンテスト後に https://31536000.hatenablog.com/ で解説していると思うので、良かったら読んでねー
O(N+QlogX)
*/ |
p03158 | C++ | #include <string>
#include <vector>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<functional>
#include<list>
#include<deque>
#include<bitset>
#include<set>
#include<map>
#include<unordered_map>
#include<unordered_set>
#include<cstring>
#include<sstream>
#include<complex>
#include<iomanip>
#include<numeric>
#include<cassert>
#define X first
#define Y second
#define pb push_back
#define rep(X,Y) for (int (X) = 0;(X) < (Y);++(X))
#define reps(X,S,Y) for (int (X) = S;(X) < (Y);++(X))
#define rrep(X,Y) for (int (X) = (Y)-1;(X) >=0;--(X))
#define rreps(X,S,Y) for (int (X) = (Y)-1;(X) >= (S);--(X))
#define repe(X,Y) for ((X) = 0;(X) < (Y);++(X))
#define peat(X,Y) for (;(X) < (Y);++(X))
#define all(X) (X).begin(),(X).end()
#define rall(X) (X).rbegin(),(X).rend()
#define eb emplace_back
#define UNIQUE(X) (X).erase(unique(all(X)),(X).end())
#define Endl endl
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
template<class T> using vv=vector<vector<T>>;
template<class T> ostream& operator<<(ostream &os, const deque<T> &t) {
os<<"{"; rep(i,t.size()) {os<<t[i]<<",";} os<<"}"<<endl; return os;}
template<class T> ostream& operator<<(ostream &os, const vector<T> &t) {
os<<"{"; rep(i,t.size()) {os<<t[i]<<",";} os<<"}"<<endl; return os;}
template<class T,size_t n> ostream& operator<<(ostream &os, const array<T,n> &t) {
os<<"{"; rep(i,n) {os<<t[i]<<",";} os<<"}"<<endl; return os;}
template<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<"("<<t.first<<","<<t.second<<")";}
template<class S, class T,class U> ostream& operator<<(ostream &os, const tuple<S,T,U> &t) { return os<<"("<<get<0>(t)<<","<<get<1>(t)<<","<<get<2>(t)<<")";}
template<class S, class T,class U,class V> ostream& operator<<(ostream &os, const tuple<S,T,U,V> &t) { return os<<"("<<get<0>(t)<<","<<get<1>(t)<<","<<get<2>(t)<<","<<get<3>(t)<<")";}
template<class S, class T,class U,class V,class W> ostream& operator<<(ostream &os, const tuple<S,T,U,V,W> &t) { return os<<"("<<get<0>(t)<<","<<get<1>(t)<<","<<get<2>(t)<<","<<get<3>(t)<<","<<get<4>(t)<<")";}
template<class T> inline bool MX(T &l,const T &r){return l<r?l=r,1:0;}
template<class T> inline bool MN(T &l,const T &r){return l>r?l=r,1:0;}
//#undef NUIP
#ifdef NUIP
#define out(args...){vector<string> a_r_g_s=s_p_l_i_t(#args, ','); e_r_r(a_r_g_s.begin(), args); }
vector<string> s_p_l_i_t(const string &s, char c){vector<string> v;int d=0,f=0;string t;for(char c:s){if(!d&&c==',')v.pb(t),t="";else t+=c;if(c=='\"'||c=='\'')f^=1;if(!f&&c=='(')++d;if(!f&&c==')')--d;}v.pb(t);return move(v);}
void e_r_r(vector<string>::iterator it) {}
template<typename T, typename... Args> void e_r_r(vector<string>::iterator it, T a, Args... args){ if(*it==" 1"||*it=="1") cerr<<endl; else cerr << it -> substr((*it)[0] == ' ', it -> length()) << " = " << a << ", "; e_r_r(++it, args...);}
#else
#define out
#endif
#ifdef __cpp_init_captures
template<typename T>vector<T> table(int n, T v){ return vector<T>(n, v);}
template <class... Args> auto table(int n, Args... args){auto val = table(args...); return vector<decltype(val)>(n, move(val));}
#endif
const ll MOD=1e9+7;
int main(){
ios_base::sync_with_stdio(false);
cout<<fixed<<setprecision(0);
int n,q;
cin>>n>>q;
// n=q=100;
vector<ll> a(n),qs(q);
rep(i,n) cin>>a[i];
rep(i,q) cin>>qs[i];
// rep(i,n) a[i]=rand();
// sort(all(a));
// rep(i,q) qs[i]=rand();
ll poyo=0,left=0;
rep(i,n)if(i%2==0) poyo+=a[n-1-i];
reps(i,n/2,n) left+=a[i];
vector<ll> odd(n+1),even(n+1);
rep(i,n){
if(i%2) odd[i+1]+=a[i];
else even[i+1]+=a[i];
odd[i+1]+=odd[i];
even[i+1]+=even[i];
}
for(ll x:qs){
if(x>=a[n-2]){
cout<<poyo<<"\n";
continue;
}
if(x<=a[0]){
cout<<left<<"\n";
continue;
}
int l=lower_bound(all(a),x)-a.begin()-1;
int r=n;
out(x,l,r,1);
while(r-l>1){
int m=(l+r)/2;
int t=m-(lower_bound(all(a),x-(a[m]-x))-a.begin())+1;
(m+t<n?l:r)=m;
}
out(x,l,r,1);
ll re=odd[n]-odd[r]+even[n]-even[r];
int t=max(0,r-(n-r));
if(t%2){
re+=even[t];
}else{
re+=odd[t];
}
cout<<re<<"\n";
if(0){
ll tmp=0;
auto aa=a;
while(aa.size()){
tmp+=aa.back(); aa.pop_back();
if(aa.empty()) break;
ll mn=MOD,ii;
rep(i,aa.size())if(MN(mn,abs(x-aa[i]))) ii=i;
aa.erase(aa.begin()+ii);
}
out(tmp,re,1);
assert(tmp==re);
}
}
return 0;
}
|
p03158 | C++ | #include <bits/stdc++.h>
#ifdef DEBUG_MD
#define debug(format, ...) fprintf(stderr, format, __VA_ARGS__)
#else
#define debug(format, ...) 0
#endif
typedef long long LL;
const int MAXN = 1e5 + 10;
int N, Q, A[MAXN], MAX_DELTA, MINA = 1e9 + 100, MAXA;
LL sum[MAXN], sume[MAXN], sumo[MAXN];
void solve();
int main() {
scanf("%d%d", &N, &Q);
for (int i = 1; i <= N; i++) {
scanf("%d", A + i);
MINA = std::min(MINA, A[i]);
MAXA = std::max(MAXA, A[i]);
}
MAX_DELTA = MAXA - MINA;
for (int i = 1; i <= N; i++) {
sum[i] = sum[i - 1] + A[i];
sumo[i] = sumo[i - 1] + LL(i & 1 ? A[i] : 0);
sume[i] = sume[i - 1] + LL(i & 1 ? 0 : A[i]);
}
for (int i = 0; i < Q; i++) solve();
return 0;
}
void solve() {
int X;
scanf("%d", &X);
int p = std::lower_bound(A + 1, A + 1 + N, X) - A;
if (p >= N || !MAX_DELTA || p + 1 == N && A[p] == X)
return (void)printf("%lld\n", N & 1 ? sumo[N] : sume[N]);
if (p == 1)
return (void)printf("%lld\n", sum[N] - sum[N / 2]);
int l = 0, r = 1e9 + 1, left, right; // [l, r)
while (r - l > 1) {
int mid = l + r >> 1;
debug(" [%d, %d), mid=%d, range[%d, %d]\n", l, r, mid, std::max(0, X - mid), X + mid);
left = std::lower_bound(A + 1, A + 1 + N, std::max(0, X - mid)) - A,
right = std::upper_bound(A + 1, A + 1 + N, X + mid) - A - 1;
debug(" Now: left=%d, A[left]=%d, right=%d, A[right]=%d\n", left, A[left], right, A[right]);
if (right - left + 1 > N - right) // Aoki get more
r = mid;
else // Takahashi get more
l = mid;
}
left = std::lower_bound(A + 1, A + 1 + N, std::max(0, X - l)) - A,
right = std::upper_bound(A + 1, A + 1 + N, X + l) - A - 1;
debug("l=%d, interval: [%d, %d]\n", l, left, right);
if (right - left + 1 != N - right) left = std::max(1, right - N + right + 1);
printf("%lld\n", (left & 1 ? sume[left - 1] : sumo[left - 1]) + sum[N] - sum[right]);
}
|
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
#define IO ios_base::sync_with_stdio(false); cin.tie(NULL);
#define endl '\n'
#define D(x) // cout << #x << " = " << (x) << endl;
long long solve(const vector<int> &v, int x, const vector<long long> &sum_a, const vector<long long> &sum_b) {
const int n = v.size();
D(x);
auto it = upper_bound(v.begin(), v.end(), x);
if (it == v.end() or it + 1 == v.end()) {
return sum_a.back();
}
D(*it);
if (it != v.begin()) {
auto it2 = it - 1;
D(*it2);
if (abs((*it2) - x) <= (abs((*it) - x))) {
it = it2;
}
}
D(*it);
int first_aoki = it - v.begin();
int l = first_aoki;
int r = n - 1;
while (r - l > 1) {
int mid = (l + r) / 2;
D(mid); D(v[mid]);
int diff = v[mid] - x;
D(diff);
auto it = lower_bound(v.begin(), v.end(), x - diff);
int l_mid = it - v.begin();
D(l_mid);
int turns = mid - l_mid + 1;
D(turns);
if (mid < n - turns) {
l = mid;
D(l);
} else {
r = mid;
D(r);
}
}
D(l); D(r);
int turns_taka = (n - r);
D(turns_taka);
long long ans = sum_b[n - turns_taka];
D(ans);
int t = n - turns_taka * 2 - 1;
D(t);
if (t >= 0) {
ans += sum_a[t];
D(ans);
}
D(ans);
return ans;
}
int main() { IO;
int n, q;
cin >> n >> q;
vector<int> v(n);
for (auto &x : v) cin >> x;
vector<int> x(q);
for (auto &xi : x) cin >> xi;
vector<long long> sum_a(n);
for (int i = 0; i < n; ++i) {
sum_a[i] = v[i];
if (i >= 2) {
sum_a[i] += sum_a[i - 2];
}
}
// cout << "sum_a:"; for (auto x : sum_a) cout << " " << x; cout << endl;
vector<long long> sum_b(n);
for (int i = n - 1; i >= 0; --i) {
sum_b[i] = v[i];
if (i < n - 1) {
sum_b[i] += sum_b[i + 1];
}
}
// cout << "sum_b:"; for (auto x : sum_b) cout << " " << x; cout << endl;
for (auto xi : x) {
long long ans = solve(v, xi, sum_a, sum_b);
cout << ans << endl;
}
return 0;
}
|
p03158 | C++ | #include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <string>
#include <queue>
#include <stack>
#include <math.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
#define REP(i, n) for (ll i = 0; i < (n); ++i)
#define REPR(i, n) for (ll i = (n) - 1; i >= 0; --i)
#define FOR(i, n, m) for (ll i = (n); i < (m); ++i)
#define FORR(i, n, m) for (ll i = (m) - 1; i >= (n); --i)
#define FORE(x, xs) for (auto &x: (xs))
#define ALL(v) v.begin(), v.end()
#define ZERO(a) memset(a,0,sizeof(a))
#define ANSWER(x) cout << x << endl;
const int INF = 1000000009;
const int MOD = 1000000007;
const double EPS = 1e-14;
const double PI = acos(-1);
const ll MAX = 1e5+10;
ll N, Q;
ll A[MAX];
ll odd[MAX], even[MAX], S[MAX];
int main() {
cin >> N >> Q;
REP (i, N) {
cin >> A[i];
if (i == 0) {
even[0] = A[0];
S[0] = A[0];
}
else {
odd[i] = odd[i-1];
even[i] = even[i-1];
S[i] = S[i-1] + A[i];
if (i&1) odd[i] += A[i];
else even[i] += A[i];
}
}
REP (q, Q) {
ll x;
cin >> x;
if (x >= A[N-1]) { // 最後の要素以上なら大きい方から交互にとる
ll ans;
if (N&1) ans = even[N-1];
else ans = odd[N-1];
ANSWER(ans);
continue;
} else if (x <= A[0]) { // 最初の要素以下なら大きい方半分
ANSWER(S[N-1] - S[N/2-1]);
continue;
}
ll lo = 0, hi = N;
while (hi-lo > 1) {
ll mid = (hi+lo)/2;
if (A[mid] <= x) lo = mid;
else hi = mid;
} // lo = max{i}(A[i] <= x)
ll idx = lo;
ll c1, c2, c3;
lo = idx, hi = N;
while (hi-lo > 1) {
ll mid = (hi+lo)/2;
c1 = mid-lo;
c2 = N-mid;
c3 = c2 - c1;
ll candL1 = A[N-c2-1], candL2 = A[N-2*c2+1];
ll candL = (abs(candL1-x) < abs(candL2-x)) ? candL2 : candL1;
ll candR = A[N-c2];
if (abs(x-candL) <= abs(x-candR)) hi = mid;
else lo = mid;
}
lo = max(lo, N/2 - 1); // loは青木くんが連続でとる最大
ll ans = S[N-1] - S[lo];
ll num = N-1 - lo;
if (N-num*2 > 0) {
if (N&1) ans += even[N-1-num*2];
else ans += odd[N-1-num*2];
}
ANSWER(ans);
}
} |
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,int> pli;
typedef pair<int,ll> pil;
const int INF = 1e9 ;
const int maxN = 1e5 + 5;
int n,Q;
int a[maxN];
int X[maxN];
bool check(int x,int m)
{
int z = a[n-m+1];
if(z < x)
return false;
int d = z - x;
int y = x - d;
int p = lower_bound(a+1,a+1+n,y) - a;
int q = n - m+1;
if((q - p +1) >= m)
{
return true;
}
else
{
return false;
}
}
ll s[maxN];
ll t[maxN];
int main()
{
scanf("%d%d",&n,&Q);
for(int i=1;i<=n;i++)
{
scanf("%d",&a[i]);
}
for(int i=1;i<=n;i++)
{
s[i] = s[i-1] + (ll)a[i];
}
t[1] = a[1];
t[2] = a[2];
for(int i=3;i<=n;i++)
{
t[i] = t[i-2] + (ll)a[i];
}
for(int i=1;i<=Q;i++)
{
scanf("%d",&X[i]);
int L=1,R=n;
int ans = 0;
ll cnt = 0;
while(L<=R)
{
int mid = (L+R)/2;
if(check(X[i],mid))
{
ans = mid;
L = mid+1;
}
else
{
R = mid - 1;
}
}
int p = n-ans +1;
int q = n - 2*ans + 1;
cnt += (s[n] - s[p-1]);
cnt += t[q-1];
cout<<cnt<<endl;
}
return 0;
} |
p03158 | C++ | #include <bits/stdc++.h>
using i64 = long long;
int main() {
i64 n, q;
std::cin >> n >> q;
std::vector<i64> a(n), s(n + 1), ss(n + 1);
for (int i = 0; i < n; i++) {
std::cin >> a[i];
s[i + 1] = s[i] + a[i];
}
ss[0] = a[0];
ss[1] = a[1];
for (int i = 2; i < n; i++) {
ss[i] = ss[i - 2] + a[i];
}
while (q--) {
i64 x;
std::cin >> x;
int pos = std::lower_bound(a.begin(), a.end(), x) - a.begin();
int l = pos ? pos - 1 : 0, r = n;
while (r - l > 1) {
int mid = (l + r) / 2;
i64 d = std::abs(a[mid] - x);
int p = std::lower_bound(a.begin(), a.end(), x - d) - a.begin();
int k = mid - p + 1;
// printf("d = %d, p = %d, k = %d\n", d, p, k);
if (n - k > mid) l = mid;
else r = mid;
}
// std::cout << "l : " << l << std::endl;
int k = n - 1 - l;
int p = l - k;
if (p < 0) {
std::cout << s[n] - s[l + 1] << std::endl;
} else {
std::cout << s[n] - s[l + 1] + ss[p] << std::endl;
}
}
return 0;
} |
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n, q;
int a[100010];
ll prefsum[100010];
ll even[100010];
ll odd[100010];
bool solve(int v, int x, int st, int &left, int &right){
if(st != n - 1){
int ne = st + 1;
if(abs(a[ne] - x) < abs(a[st] - x)) st = ne;
}
int lo = 0, hi = v;
while(lo != hi){
int mi = (lo + hi + 1) >> 1;
int to_right = mi;
int to_left = v - mi;
if(st + mi >= n){
hi = mi - 1;
continue;
}
if(st - to_left + 1 < 0){
lo = mi;
continue;
}
int le = st - to_left + 1;
int ri = st + to_right;
int dr = abs(a[ri] - x);
int dl = abs(x - a[le]);
if(dr >= dl){
if(le == 0 || abs(x - a[le-1]) > dr) lo = mi;
else hi = mi - 1;
}
else{
lo = mi;
}
}
int le = st - (v - lo) + 1;
int ri = st + lo;
left = le;
right = ri;
return ri < n - v;
}
void stupid(int x){
ll an = 0;
vector < char > used(n);
vector < int > b;
for(int i = 0; i < n; i++) b.push_back(a[i]);
for(int i = 0; i < n; i++){
if(i % 2 == 0){
for(int j = n - 1; j >= 0; j--){
if(!used[j]){
used[j] = true;
an += b[j];
cout << j << endl;
break;
}
}
}
else{
int best = 2e9;
int pos = -1;
for(int j = 0; j < n; j++){
if(!used[j]){
if(abs(b[j] - x) < best){
pos = j;
best = abs(b[j] - x);
}
}
}
used[pos] = true;
}
}
cout << an << endl;
}
int32_t main()
{
ios_base::sync_with_stdio(false);
cin >> n >> q;
for(int i = 0; i < n; i++){
cin >> a[i];
// a[i] = i;
// cout << a[i] << ' ';
prefsum[i] = a[i];
if(i){
prefsum[i] += prefsum[i-1];
odd[i] += odd[i-1];
even[i] += even[i-1];
}
if(i % 2 == 0){
odd[i] += a[i];
}
else even[i] += a[i];
}
// cout << endl;
for(int i = 0; i < q; i++){
int x;
cin >> x;
// cout << endl;
// stupid(x);
if(x < a[0]){
cout << prefsum[n-1] - prefsum[n/2 - 1] << '\n';
}
else if(x > a[n - 1]){
if(n & 1) cout << odd[n-1] << '\n';
else cout << even[n-1] << '\n';
}
else{
auto it = (int)(upper_bound(a, a + n, x) - a - 1);
int l, r;
int lo = 0, hi = n / 2;
while(lo != hi){
int mi = (lo + hi + 1) >> 1;
if(solve(mi, x, it, l, r)) lo = mi;
else hi = mi - 1;
}
solve(lo, x, it, l, r);
if(lo){
solve(lo, x, it, l, r);
// cout << lo << ' ' << l << ' ' << r << endl;
ll sum = prefsum[n-1] - prefsum[n-lo-1];
if(r + 1 == n - lo){
if(l - 1 >= 0){
if((l-1) % 2 == 0){
sum += odd[l-1];
}
else sum += even[l-1];
}
}
else{
sum += a[r+1];
if(l - 2 >= 0){
if((l-2) % 2 == 0){
sum += odd[l-2];
}
else sum += even[l-2];
}
}
cout << sum << '\n';
}
else{
if(n & 1) cout << odd[n-1] << '\n';
else cout << even[n-1] << '\n';
}
}
}
return 0;
}
|
p03158 | C++ | #include <iostream>
#include <cstdio>
#include <algorithm>
#define N 100005
using namespace std;
typedef long long ll;
ll n, t, Q, sz, st, l, r, md, ans, a[N], b[N], s[N], g1[N], g2[N];
int main()
{
ll i, x;
cin >> n >> Q;
for (i = 1; i<= n; i++) {
scanf ("%lld", &a[i]);
}
st = (n + 2) / 2;
sz = n - st;
for (i = st; i < n; i++) {
l = a[1];
r = a[i] + 1;
while (l < r) {
md = (l + r) / 2;
t = lower_bound(a + 1, a + n + 1, md - (a[i] - md)) - a;
if (i - t + 1 < n - i + 1) {
b[i - st] = md;
r = md;
} else {
l= md + 1;
}
}
}
// for (i = 1; i <=n; i++) printf("%")
for (i = 1; i <= n; i++) {
s[i] = s[i - 1] + a[i];
g1[i] = g1[i - 1];
g2[i] = g2[i - 1];
if (i % 2 == 0) g2[i] += a[i];
else g1[i] += a[i];
}
ll h;
while (Q--) {
scanf ("%lld", &x);
t = upper_bound(b, b + sz, x) - b;
t--;
t += st;
ans = s[n] - s[t];
h = t - (n - t);
if (h % 2 == 1) ans += g1[h];
else ans += g2[h];
printf("%lld\n", ans);
}
return 0;
}
|
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
using PII = pair<int, int>;
#define FI(i,a,b) for(int i=(a);i<=(b);++i)
#define FD(i,b,a) for(int i=(b);i>=(a);--i)
#define DEBUG(x) cerr << #x << ": " << (x) << endl;
constexpr LL inv(LL x, LL m) { return x > m ? inv(x % m, m) : x > 1 ? inv(m % x, m) * (m - m / x) % m : x; }
constexpr LL mpow(LL a, LL k, LL m) { LL r(1); for (a %= m; k; k >>= 1, a = a * a % m) if (k & 1)r = r * a % m; return r; }
const int N = 100005;
int n, q, A[N];
LL S[N], F[N];
int main() {
cin >> n >> q;
FI(i, 1, n) scanf("%d", &A[i]);
FI(i, 1, n) S[i] = S[i - 1] + A[i];
F[1] = A[1];
FI(i, 2, n) F[i] = F[i - 2] + A[i];
while (q--) {
int x;
scanf("%d", &x);
auto check = [&](int cnt) {
int l = n - cnt + 1;
if (A[l] < x) return false;
int dis = A[l] - x;
int pos = x - dis;
int L = lower_bound(A + 1, A + 1 + n, pos) - A;
if (l - L + 1 < cnt) return false;
return true;
};
int l = 0, r = n + 1;
while (l + 1 < r) {
int m = (l + r) >> 1;
if (check(m)) l = m;
else r = m;
}
LL sum = S[n] - S[n - l] + F[n - l - l];
printf("%lld\n", sum);
}
}
|
p03158 | C++ | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define maxs(x,y) (x = max(x,y))
#define mins(x,y) (x = min(x,y))
#define limit(x,l,r) max(l,min(x,r))
#define lims(x,l,r) (x = max(l,min(x,r)))
#define isin(x,l,r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)),x.end())
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define show(x) cout<<#x<<" = "<<x<<endl;
#define PQ(T) priority_queue<T,v(T),greater<T> >
#define bn(x) ((1<<x)-1)
#define dup(x,y) (((x)+(y)-1)/(y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
inline int in() { int x; scanf("%d",&x); return x;}
template<typename T>inline istream& operator>>(istream&i,v(T)&v)
{rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const v(T)&v)
{stringstream s;rep(i,sz(v))s<<' '<<v[i];return s.str().substr(1);}
template<typename T>inline ostream& operator<<(ostream&o,const v(T)&v)
{if(sz(v))o<<join(v);return o;}
template<typename T1,typename T2>inline istream& operator>>(istream&i,pair<T1,T2>&v)
{return i>>v.fi>>v.se;}
template<typename T1,typename T2>inline ostream& operator<<(ostream&o,const pair<T1,T2>&v)
{return o<<v.fi<<","<<v.se;}
template<typename T>inline ll suma(const v(T)& a) { ll res(0); for (auto&& x : a) res += x; return res;}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame { puts("-1"); return 0;}
#define yn {puts("Yes");}else{puts("No");}
const int MX = 200005;
// 整数スキャン（複数）
/*
int x;
scanf("%d",&x);
int y;
scanf("%d",&y);
int z;
scanf("%d",&z);
// n個の整数のスキャン
/*
ll a[n] = {};
rep(i,n){
scanf("%lld",&a[i]);
}
*/
// 文字列スキャン
/*
string s;
cin >> s;
*/
// n個の文字列スキャン
/*
vector<string> slist;
rep(i,n){
string s;
cin >> s;
slist.push_back(s);
}
*/
int select(int x, int y, ll c[],ll qq){
if(x==y){
return x;
}else{
if(c[(x+y)/2+1]<=qq){
select((x+y)/2+1,y,c,qq);
}else{
select(x,(x+y)/2,c,qq);
}
}
}
int main() {
int n;
scanf("%d",&n);
int q;
scanf("%d",&q);
ll a[n] = {};
rep(i,n){
scanf("%lld",&a[i]);
}
ll b[n] = {};
rep(i,n){
if(i==0||i==1){
b[i]=a[i];
}else{
b[i]=b[i-2]+a[i];
}
}
ll c[(n+1)/2];
rep(i,(n+1)/2){
if(i==(n+1)/2-1){
c[i]=0;
continue;
}
c[i] = (a[n-i-2]+a[n-2*i-3])/2+1;
}
sort(c,c+(n+1)/2);
ll ans[(n+1)/2]={};
rep(i,(n+1)/2){
if(i==0){
rep(j,(n+1)/2){
ans[i]+=a[n-1-j];
}
}else{
if(n%2==1){
ans[i]=ans[i-1]-a[n-(n+1)/2+i-1]+a[2*(i-1)];
}else{
ans[i]=ans[i-1]-a[n-(n+1)/2+i-1]+a[2*(i-1)+1];
}
}
//cout << ans[i] << ' ';
}
//cout << endl;
ll qq[q];
rep(i,q){
scanf("%lld",&qq[i]);
}
rep(i,q){
int aaa = 0;
int ii = select(aaa,(n+1)/2-1,c,qq[i]);
cout << ans[ii] << endl;
}
return 0;
}
|
p03158 | C++ |
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <queue>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <fstream>
#include <complex>
#include <cstdint>
#include <tuple>
#include <numeric>
#define M_PI 3.14159265358979323846
#ifdef LOCAL
#include <sys/types.h>
#include <sys/timeb.h>
#include <intrin.h>
#include <thread>
#else
#include <sys/time.h>
#endif
using namespace std;
//conversion
//------------------------------------------
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }
//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
//container util
//------------------------------------------
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define MT make_tuple
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define FILL(a, x) memset(a, x, sizeof(a))
//repetition
//------------------------------------------
#define FOR(i,s,n) for(int i=s;i<(int)n;++i)
#define REP(i,n) FOR(i,0,n)
const int N = 100005;
int a[N];
LL s[N];
LL s_oe[N];
int main(){
int n, q;
scanf("%d%d", &n, &q);
REP(i, n) scanf("%d", &a[i]);
s[0] = 0;
REP(i, n)s[i+1] = s[i] + a[i];
REP(i, n)s_oe[i+2] = s_oe[i] + a[i];
REP(i, q) {
int x;
scanf("%d", &x);
int l = 0;
int r = 1000000005;
while (r - l > 1) {
int mid = (l + r) / 2;
auto l_idx = lower_bound(a, a + n, x - mid) - a;
auto r_idx = upper_bound(a, a + n, x + mid) - a;
if (r_idx - l_idx + 1 < n - r_idx) {
l = mid;
}
else {
r = mid;
}
}
auto l_idx = lower_bound(a, a + n, x - l) - a;
auto r_idx = upper_bound(a, a + n, x + l) - a;
if (r_idx - l_idx + 1 < n - r_idx)l++;
l_idx = lower_bound(a, a + n, x - l) - a;
r_idx = upper_bound(a, a + n, x + l) - a;
int c = r_idx - l_idx;
int d = n - r_idx;
if (c > d) {
r_idx--;
c--;
d++;
}
LL ret = s[n] - s[r_idx];
if (c == d)ret += s_oe[l_idx+1];
else ret += s_oe[l_idx];
printf("%lld\n", ret);
}
return 0;
} |
p03158 | C++ | #include<iostream>
#include<vector>
#include<string>
#include<algorithm>
using namespace std;
#define int long long
#define vel vector<long long>
#define vvel vector<vel>
void mmin(int &a, int b) {
a = min(a, b);
}
void mmax(int &a, int b) {
a = max(a, b);
}
int nibl(vel &v, int tan) {
int up = v.size() - 1;
int lo = 0;
if (v[up] <= tan) return up;
while (up - lo > 1) {
int mi = (up + lo) / 2;
if (v[mi] <= tan) lo = mi;
if (tan < v[mi]) up = mi;
}
return lo;
}
signed main() {
int n;
int q;
cin >> n >> q;
vel a(n+1);
int ma = 100;
ma *= 100 * 100;
ma++;
vel s(n + 1);
vel bes(n + 1);
s[0] = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 1; i <= n; i++) {
s[i] = s[i - 1] + a[n - i];
}
int ko = (n + 1) / 2;
bes[0] = 0;
for (int i = n - 1; i >= 0; i -= 2) {
bes[0] += a[i];
}
for (int i = 1; i <= ko; i++) {
bes[i] = bes[i - 1] - a[n+1-2*i];
}
vel qa = a;
for (int i = 0; i < n; i++) {
a[i] = ma - qa[n-1-i];
}
a[n] = 2*ma;
for (int i = 0; i < q; i++) {
int x; cin >> x;
x = ma - x;
int lo = 1;
int up = (n + 3) / 2;
while (up-lo>1) {
int mi = (up + lo) / 2;
if (2 * mi -1< n) {
if (abs(x - a[mi]) >= abs(x - a[2 * mi])) {
lo = mi;
}
else if (abs(x - a[mi - 1]) < abs(x - a[2 * mi-2])) {
up = mi;
}
else {
lo = mi;
up = mi + 1;
}
}
else if (2 * mi - 1 == n) {
if (abs(x - a[mi - 1]) >= abs(x - a[2 * mi - 2])) {
lo = mi;
up = mi + 1;
}
else {
up = mi;
}
}
else {
up = mi;
}
}
cout << s[lo] + bes[lo] << endl;
}
return 0;
} |
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, q;
cin >> n >> q;
vector<int> a(n);
for (int i = 0; i < n; i++) {
int tmp;
cin >> tmp;
a[i] = tmp;
}
vector<long long> ac(n + 1, 0);
vector<long long> bc(n + 1, 0);
for (int i = 1; i <= n; i++) {
ac[i] = ac[i - 1] + a[i - 1];
}
bc[1] = a[0];
for (int i = 2; i <= n; i++) {
bc[i] = bc[i - 2] + a[i - 1];
}
while (q--) {
int x;
cin >> x;
int lb = 0;
int ub = n / 2 + 1;
int l;
if (abs(a[0] - x) <= abs(a[n / 2] - x)) {
l = n - n / 2;
}
else {
while (true) {
l = (lb + ub) / 2;
if (l >= 2 && abs(a[n - 2 * l + 1] - x) > abs(a[n - l] - x)) {
ub = l;
}
else if (n - 2 * l >= 2 && abs(a[n - l - 1] - x) >= abs(a[n - 2 * l - 1] - x)) {
lb = l;
}
else {
break;
}
}
}
long long ans;
if (n - 2 * l >= 0) {
ans = ac[n] - ac[n - l] + bc[n - 2 * l];
} else {
ans = ac[n] - ac[n / 2];
}
cout << ans << '\n';
}
return 0;
} |
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
signed main() {
ios::sync_with_stdio(false);
int N, Q;
cin >> N >> Q;
vector<int> A(N);
for (int i = 0; i < N; ++i) cin >> A[i];
if (N & 1) ++N, A.insert(A.begin(), 0);
vector<int> X(Q);
for (int i = 0; i < Q; ++i) cin >> X[i];
vector<vector<int64_t>> pa(2, vector<int64_t>(N + 1));
for (int t = 0; t < 2; ++t)
for (int i = 0; i < N; ++i)
pa[t][i + 1] = pa[t][i] + ((i & 1) == t) * A[i];
for (int i = 0; i < Q; ++i) {
if (N < 4) {
assert(N == 2);
cout << A[1] << endl;
} else if (A[N - 3] <= X[i]) {
if (abs(A[N - 2] - X[i]) < X[i] - A[N - 3]) {
cout << pa[1][N] << endl;
} else {
int k = N - 4;
cout << pa[~N & 1][k] +
(pa[0][N] + pa[1][N]) -
(pa[0][N + k >> 1] + pa[1][N + k >> 1])
<< endl;
}
} else {
int k = N - 4;
// while (2 <= k && abs(A[k - 2] - X[i]) <= abs(A[k] - X[i])) k -= 2;
int lb = 0, ub = k;
k = -1;
while (lb <= ub) {
int mb = lb + ub >> 1;
if (N - mb & 1) ++mb;
int q = mb + (N - mb >> 1);
vector<int> v; {
v.push_back(A[mb]);
v.push_back(A[q - 1]);
if (2 < q - mb) v.push_back(A[mb + 1]);
if (2 < q - mb) v.push_back(A[q - 2]);
sort(v.begin(), v.end(), [&](int x, int y) {
return make_pair(abs(X[i] - x), x) > make_pair(abs(X[i] - y), y);
});
}
int a = v[1];
int b = A[q];
if (abs(X[i] - b) < abs(X[i] - a)) {
lb = mb + 2;
} else {
k = mb;
ub = mb - 2;
}
}
cout << pa[~N & 1][k] +
(pa[0][N] + pa[1][N]) -
(pa[0][N + k >> 1] + pa[1][N + k >> 1])
<< endl;
}
}
return 0;
}
|
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<int(n);++i)
#define all(a) (a).begin(),(a).end()
typedef long long ll;
#define rep1(i,n) for(int i=1;i<=int(n);++i)
#define lb(s,x) (lower_bound(all(s),x)-s.begin())
#define ub(s,x) (upper_bound(all(s),x)-s.begin())
#define uniq(a) a.erase(unique(all(a)),a.end())
#define bit(k) (1LL<<(k))
const int INF = 1e9;
#define debug(x) cerr<<(#x)<<": "<<(x)<<endl
template<class T,class U>
ostream& operator<<(ostream& o, const pair<T,U> &p){
o<<"("<<p.first<<", "<<p.second<<")";
return o;
}
#define print(v) { cerr<<#v<<": [ "; for(auto _ : v) cerr<<_<<", "; cerr<<"]"<<endl; }
int n;
vector<int> a;
bool check(int x, int d){
int u = ub(a,x+d);
int l = lb(a,x-d);
return u-l <= n-u;
}
int main(void){
int q;
cin >> n >> q;
a.resize(n);
rep(i,n) cin >> a[i];
vector<ll> sum(n+1), t_sum(n+1);
rep(i,n){
sum[i+1] = sum[i] + a[i];
if (i % 2 != n % 2) {
t_sum[i+1] = t_sum[i] + a[i];
} else {
t_sum[i+1] = t_sum[i];
}
}
rep(_,q){
int x;
cin >> x;
int l = 0, r = 1e9;
while (l + 1 < r) {
int m = (l+r)/2;
if (check(x, m)) l = m;
else r = m;
}
ll d = l;
// debug(d);
// debug(a[ub(a,x+d)]);
// debug(a[lb(a,x-d)]);
// debug(n - ub(a,x+d));
// debug(ub(a,x+d) - lb(a,x-d));
int dif = (n - ub(a,x+d)) - (ub(a,x+d) - lb(a,x-d));
ll tmp = 0;
if (dif == 0 || dif == 1) {
} else if (dif == 2) {
tmp = - a[(lb(a,x-d)-1)];
} else if (dif == -1) {
tmp = + a[n-1];
}
cout << sum[n]-sum[ub(a,x+d)]+t_sum[lb(a,x-d)] + tmp << endl;
}
return 0;
}
|
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
int n, q;
long long a[100010];
long long rui_kg[100010] = {};
long long rui[100010] = {};
int main(){
cin >> n >> q;
for(int i = 0;i < n;i++){
cin >> a[i];
rui_kg[i+1] = a[i];
rui[i+1] = a[i];
}
for(int i = 1;i <= n;i++){
rui[i] += rui[i-1];
if(i >= 2) rui_kg[i] += rui_kg[i-2];
}
long long x;
for(int z = 0;z < q;z++){
cin >> x;
int x_i = lower_bound(a, a+n, x) - a;
if(x_i > 0){
if(abs(a[x_i]-x) >= abs(a[x_i-1]-x)){
x_i--;
}
}
int l = x_i, r = n;
while(r-l > 1){
int mid = l + (r-l)/2;
int num = a[mid] - x;
int se = x - num;
int s_i = lower_bound(a, a+n, se) - a;
int mas = mid-s_i+1;
if(mas <= n-mid-1) l = mid;
else r = mid;
}
if(x_i < n-1){
int s_i;
if(l != x_i){
int num = a[l] - x;
int se = x - num;
s_i = lower_bound(a, a+n, se) - a;
}else{
s_i = l;
}
while(s_i > 0 && n-r > l-s_i+1){
s_i--;
}
cout << rui[n]-rui[r] + rui_kg[s_i] << endl;
}else{
cout << rui_kg[n] << endl;
}
}
return 0;
}
|
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, q;
cin >> n >> q;
vector<ll> a(n + 1), s(n + 1), e(n + 1);
for (int i = 0; i < n; i++) {
cin >> a[i + 1];
s[i + 1] = s[i] + a[i + 1];
e[i + 1] = e[i] + ((n - i) % 2 ? a[i + 1] : 0);
}
for (; q > 0; q--) {
int x;
cin >> x;
int ok = 0, ng = 1e9;
int head, tail, first, second;
while (true) {
int w = (ok + ng) / 2;
head = lower_bound(begin(a) + 1, end(a), x - w) - begin(a);
tail = lower_bound(begin(a) + 1, end(a), x + w) - begin(a);
first = n + 1 - tail;
second = tail - head;
if (!(ok + 1 < ng)) {
break;
}
if (second + 1 <= first) {
ok = w;
} else if (second + 1 > first) {
ng = w;
}
}
if (second + 1 < first) {
tail++;
}
cout << (s[n] - s[tail - 1]) + e[head - 1] << endl;
}
}
|
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 100001;
int n, q;
int a[N];
int pr[N];
int pref[N][2];
int getcnt(int l, int r) {
if (r < l) return 0;
else return upper_bound(a, a + n, r) - lower_bound(a, a + n, l);
}
int getsum(int l, int r) {
if (r < l) return 0;
else return pr[r + 1] - pr[l];
}
int getsum(int l, int r, bool t) {
if (r < l) return 0;
else return pref[r + 1][t] - pref[l][t];
}
int getbetter(int x, int m) {
if (a[m] == x) {
return 0;
}
else if (a[m] < x) {
int r = x - a[m];
return getcnt(a[m] + 1, x + r - 1);
}
else {
int r = a[m] - x;
return getcnt(x - r, a[m] - 1);
}
}
void get1(int x, int k, int &wl, int &wr) {
if (k == 0) {
wl = wr = -1;
return;
}
int p = upper_bound(a, a + n, x) - a;
int l = -1, r = p;
while (l < r - 1) {
int m = (l + r) >> 1;
if (getbetter(x, m) >= k) l = m;
else r = m;
}
wl = r;
l = p - 1, r = n;
while (l < r - 1) {
int m = (l + r) >> 1;
if (getbetter(x, m) >= k) r = m;
else l = m;
}
wr = l;
}
void get2(int k, int &l, int &r) {
l = n - k;
r = n - 1;
}
bool check(int x, int k) {
int l1, r1, l2, r2;
get1(x, k >> 1, l1, r1); get2((k + 1) >> 1, l2, r2);
return r1 < l2;
}
int x[N];
int per[N], ans[N];
bool comp(int i, int j) {
return x[i] < x[j];
}
signed main() {
#ifdef HOME
freopen("input.txt", "r", stdin);
#else
ios_base::sync_with_stdio(0);
cin.tie(0);
#endif
cin >> n >> q;
for (int i = 0; i < n; ++i) cin >> a[i];
for (int i = 0; i < q; ++i) cin >> x[i];
for (int i = 0; i < n; ++i) {
pref[i + 1][i&1] = pref[i][i&1] + a[i];
pref[i + 1][(i&1)^1] = pref[i][(i&1)^1];
pr[i + 1] = pr[i] + a[i];
}
for (int i = 0; i < q; ++i) per[i] = i;
sort(per, per + q, comp);
int r = n + 1;
for (int ii = 0; ii < q; ++ii) {
int i = per[ii];
while (r && !check(x[i], r - 1)) --r;
int l = r - 1;
int l1, r1, l2, r2;
get1(x[i], l >> 1, l1, r1); get2((l + 1) >> 1, l2, r2);
int p;
if (l1 == -1) {
p = n - 2;
}
else {
p = l1 - 1;
}
bool t;
if (l & 1) {
t = (p+1)&1;
}
else {
t = p&1;
}
ans[i] = getsum(l2, r2) + getsum(0, p, t);
}
for (int i = 0; i < q; ++i) {
cout << ans[i] << '\n';
}
#ifdef HOME
cerr << "TIME : " << (double)clock()/CLOCKS_PER_SEC<<'\n';
#endif
} |
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
// #define int ll
using PII = pair<ll, ll>;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
template<typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template<typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }
template<typename T> bool IN(T a, T b, T x) { return a<=x&&x<b; }
template<typename T> T ceil(T a, T b) { return a/b + !!(a%b); }
template<typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}
template<typename T,typename V> typename enable_if<is_class<T>::value==0>::type
fill_v(T &t, const V &v) { t=v; }
template<typename T,typename V> typename enable_if<is_class<T>::value!=0>::type
fill_v(T &t, const V &v ) { for(auto &e:t) fill_v(e,v); }
template<class S,class T>
ostream &operator <<(ostream& out,const pair<S,T>& a){
out<<'('<<a.first<<','<<a.second<<')'; return out;
}
template<typename T>
istream& operator >> (istream& is, vector<T>& vec){
for(T& x: vec) {is >> x;} return is;
}
template<class T>
ostream &operator <<(ostream& out,const vector<T>& a){
out<<'['; for(T i: a) {out<<i<<',';} out<<']'; return out;
}
int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0}; // DRUL
const int INF = 1<<30;
const ll LLINF = 1LL<<60;
const int MOD = 1000000007;
signed main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, q;
cin >> n >> q;
vector<ll> a(n);
vector<PII> x(q);
REP(i, n) cin >> a[i];
REP(i, q) cin >> x[i].first, x[i].second = i;
sort(ALL(a));
sort(ALL(x));
vector<ll> b(n, 1);
FOR(i, n/2, n) {
// cout << "i=" << i << endl;
// i番目をn-i回目より前に取る最小のx
ll lb = 0, ub = a[i];
while(ub - lb > 1) {
ll mid = (lb+ub)/2;
// cout << lb << " " << mid << " " << ub << endl;
if(a[i] - mid < mid - a[i-n+i+1]) ub = mid;
else lb = mid;
}
b[i] = ub;
}
vector<ll> c(n);
FOR(i, n/2-1, n-1) c[i] = b[i+1]-1;
// cout << b << endl;
// cout << c << endl;
vector<ll> d(a);
FOR(i, 1, n) d[i] += d[i-1];
vector<ll> e(a);
for(int i=2; i<n; i+=2) e[i] += e[i-2];
for(int i=3; i<n; i+=2) e[i] += e[i-2];
// cout << d << endl << e << endl;
vector<ll> ans(q);
ll idx = n/2-1;
REP(i, q) {
while(!IN(b[idx], c[idx]+1, x[i].first) && idx+1 < n-1) idx++;
// cout << "x=" << x[i] << " idx=" << idx << endl;
// [idx+1, n-1]
ans[x[i].second] += d[n-1] - d[idx];
// idx - (n-1 - idx)
if(idx != n/2-1) ans[x[i].second] += e[idx-(n-1-idx)];
}
REP(i, q) cout << ans[i] << endl;
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.