p_id
stringlengths 6
6
| language
stringclasses 10
values | code
stringlengths 11
983k
|
|---|---|---|
p03158 | C++ | #include<stdio.h>
int main() {
long n, i, sum1[111111], sum2[111111], q, a[111111], b[111111], ans[111111], x;
scanf("%ld%ld", &n, &q);
for (i = 1; i <= n; i++)
scanf("%ld", &a[i]);
sum1[0] = 0;
sum2[n + 1] = 0;
for (i = 1; i <= n; i++) {
if ((n - i) % 2 == 0)
sum1[i] = sum1[i - 1] + a[i];
else
sum1[i] = sum1[i - 1];
sum2[n + 1 - i] = sum2[n + 2 - i] + a[n + 1 - i];
}
for (i = n - 1; i >= n / 2; i--) {
b[i] = (a[i] + a[i * 2 - n]) / 2;
}
long max, min, r;
for (i = 0; i < q; i++) {
scanf("%ld", &x);
max = n - 1;
min = n / 2;
while (max != min) {
r = (max + min) / 2;
if (min == r)
r++;
if (x <= b[r]) {
if (max == r)
max--;
else
max = r;
}
else
min = r;
}
if (min * 2 - n<0)
ans[i] = sum2[min + 1];
else
ans[i] = sum1[min * 2 - n] + sum2[min + 1];
}
for (i = 0; i < q; i++)
printf("%ld\n", ans[i]);
return 0;
} |
p03158 | C++ | #include <iostream>
#include <cmath>
#include <vector>
#include <map>
#include <stack>
#include <queue>
#include <set>
#include <algorithm>
#include <iomanip>
#include <string.h>
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(a) (a).begin(),(a).end()
typedef long long lint;
using namespace std;
int main(){
int N,Q;
cin>>N>>Q;
lint A[N];
lint X[Q];
REP(i,N)cin>>A[i];
REP(i,Q)cin>>X[i];
lint SA[N];
SA[0]=A[0];
FOR(i,1,N)SA[i]=SA[i-1]+A[i];
lint SO[N];
SO[0]=A[0];
for(int i=2;i<N;i+=2)SO[i]=SO[i-2]+A[i];
SO[1]=A[1];
for(int i=3;i<N;i+=2)SO[i]=SO[i-2]+A[i];
int h[N];
REP(i,N)h[i]=0;
h[N-1]=A[N-1];
FOR(i,1,(N+1)/2){
// l[i]=(A[N-i-1]+A[N-i*2-1])/2+1;
h[N-1-i]=(A[N-i-1]+A[N-i*2-1])/2;
cerr<<h[N-1-i];
cerr<<endl;
}
cerr<<endl;
REP(i,Q){
int H=N-(lower_bound(h,h+N,X[i])-h);
lint ans=0;
ans+=SA[N-1]-SA[N-H-1];
if(N-2*H-1>=0)ans+=SO[N-2*H-1];
cout<<ans<<endl;
}
return 0;
}
|
p03158 | C++ |
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <fstream>
#include <sstream>
#include <set>
#include <map>
#include <vector>
#include <list>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <string>
#include <stack>
#include <queue>
#include <bitset> //UWAGA - w czasie kompilacji musi byc znany rozmiar wektora - nie mozna go zmienic
#include <cassert>
#include <iomanip> //do setprecision
#include <ctime>
#include <complex>
using namespace std;
#define FOR(i,b,e) for(int i=(b);i<(e);++i)
#define FORQ(i,b,e) for(int i=(b);i<=(e);++i)
#define FORD(i,b,e) for(int i=(b)-1;i>=(e);--i)
#define REP(x, n) for(int x = 0; x < (n); ++x)
#define ST first
#define ND second
#define PB push_back
#define PF push_front
#define MP make_pair
#define LL long long
#define ULL unsigned LL
#define LD long double
#define pii pair<int,int>
#define pll pair<LL,LL>
const double pi = 3.14159265358979323846264;
const int mod=1000000007;
int main(){
int n,q;
cin>>n>>q;
vector<LL> a(n+1),x(q+1);
FOR(i,0,n)cin>>a[i+1];
FOR(i,0,q)cin>>x[i];
vector<LL> b(n+3),c(q+3);
FOR(i,0,n){
b[i+2]=a[i+1];
b[i+2]+=b[i];
c[i+1]=a[i+1];
c[i+1]+=c[i];
}
FOR(t,0,q){
int y=x[t];
int l=0,r=n,m=(l+r)/2;
while(l!=m){
if(2*m>n){
r=m;
m=(l+r)/2;
continue;
}
if(abs(a[n-m*2+1]-y)<=abs(a[n-m+1]-y)){
l=m;
}else{
r=m;
}
m=(l+r)/2;
}
//cerr<<"t:"<<t<<" y:"<<y<<" m:"<<m<<endl;
if(m==0){
cout<<b[n-1+2]<<endl;
}else{
if(abs(a[n-m*2+1]-y)==abs(a[n-m+1]-y)){
LL ans=c[n-1+1]-c[n-m-1+1]+b[n-2*m-1+2];
//cerr<<"type:"<<0<<" y:"<<y<<" m:"<<m<<endl;
cout<<ans<<endl;
}else{
if(n-1-2*m+1==0){
LL ans=c[n-1+1]-c[n-m-1+1]+b[n-2*m-1+2];
//cerr<<"type:"<<1<<" y:"<<y<<" m:"<<m<<endl;
cout<<ans<<endl;
}else if(abs(a[n-m*2-1+1]-y)<=abs(a[n-m-1+1]-y)){
LL ans=c[n-1+1]-c[n-m-2+1];
//cerr<<"type:"<<2<<" y:"<<y<<" m:"<<m<<endl;
if(n-3-2*m+1>0){
ans+=b[n-3-2*m+2];
}
cout<<ans<<endl;
}else{
LL ans=c[n-1+1]-c[n-m-1+1]+b[n-2*m-1+2];
//cerr<<"type:"<<3<<" y:"<<y<<" m:"<<m<<endl;
cout<<ans<<endl;
}
}
}
}
return 0;
}
|
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
class Solution {
vector<int> A;
vector<long long> altPre, pre;
struct Query {
int x;
int id;
long long ans;
Query(int x, int id) : x(x), id(id) {}
};
vector<Query> Qs;
int n;
void solve() {
sort(Qs.begin(), Qs.end(), [](Query a, Query b) { return a.x < b.x; });
int k = (n - 1) / 2;
for (Query &q : Qs) {
int x = q.x;
while (k and abs(A[n - 2 * k - 1] - x) > abs(A[n - k - 1] - x)) --k;
q.ans = altPre[n - 2 * k - 1] + pre[n] - pre[n - k - 1];
}
}
public:
void run(istream &in, ostream &out) {
int Q;
in >> n >> Q;
A.resize(n);
pre.resize(n + 1);
altPre.resize(n + 1);
for (int i = 0; i < n; ++i) in >> A[i];
for (int i = 0; i < n; ++i) {
altPre[i + 1] = altPre[i] + (i % 2 == n % 2 ? 0 : A[i]),
pre[i + 1] = pre[i] + A[i];
}
for (int i = 0; i < Q; ++i) {
int x;
cin >> x;
Qs.emplace_back(x, i);
}
solve();
sort(Qs.begin(), Qs.end(), [](Query a, Query b) { return a.id < b.id; });
for (int i = 0; i < Q; ++i) cout << Qs[i].ans << " \n"[i == Q - 1];
}
};
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
Solution().run(cin, cout);
}
|
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
long long S[2][100010];
pair<int, int> count_less(long long x, long long turn, vector<long long> &A) {
ll l = 0;
ll r = 1000000000ll;
auto f = [&](long long m) {
return upper_bound(A.begin(), A.end(), x + m) - lower_bound(A.begin(), A.end(), x - m);
};
while (l != r) {
ll m = (l + r - 1) / 2;
long c = f(m);
if (c < turn) {
l = m + 1;
} else {
r = m;
}
}
ll v = f(l);
int L = static_cast<int>(lower_bound(A.begin(), A.end(), x - l) - A.begin());
int R = static_cast<int>(upper_bound(A.begin(), A.end(), x + l) - A.begin());
if (v == turn) return {L, R};
if (v == turn + 1) {
return {
L,
R - 1
};
}
cout << v << " " << l << " " << r << " " << "|" << turn << " " << v << " " << L << "|" << R << endl;
assert(0);
}
long long sm(int p, int l, int r) {
return S[p][r] - S[p][l];
}
void solve(long long N, long long Q, vector<long long> A, vector<long long> X) {
rep(i, N) {
S[i % 2][i + 1] += A[i];
}
for (int i = 0; i < 2; i++) {
for (int j = 0; j < N; j++) {
S[i][j + 1] += S[i][j];
}
}
int l = N;
auto f = [&](ll x) {
while(true){
auto seg = count_less(x, l, A);
if (seg.second > N - l) {
l--;
}else{
break;
}
}
// cout << l << " " << r << endl;
ll sum = sm(0, N - l, N) + sm(1, N - l, N);
auto seg = count_less(x, l, A);
int flg = N - l - seg.second == 1;
sum += flg * A[N - l - 1];
// cout << "[" << seg.first << " " << seg.second << "|" << l << N - l - seg.second << endl;
ll le = max(0, seg.first - 1 - flg);
sum += sm(le%2, 0, seg.first - flg);
return sum;
};
auto g = [&](ll x){
set<ll> S(A.begin(), A.end());
ll sc = 0;
while( S.size() ){
sc += *S.rbegin();
S.erase(*S.rbegin());
if(S.empty()) break;
auto it = S.lower_bound(x);
auto it2 = it;
if( it2 != S.begin() ) it2--;
if( abs(*it - x) >= abs(x - *it2)){
S.erase(*it2);
}else{
S.erase(*it);
}
}
return sc;
};
vector<ll> res(X.size());
vector<pair<long long,int>> xx;
for(int i = 0 ; i < X.size() ; i++) xx.push_back({X[i], i});
sort(xx.begin(), xx.end());
for (auto &x : xx) {
res[x.second] = f(x.first);
}
for( auto &x: res){
cout << x << endl;
}
}
int main() {
long long N;
scanf("%lld", &N);
// N = 100;
long long Q;
scanf("%lld", &Q);
// Q = 100;
vector<long long> A(N);
for (int i = 0; i < N; i++) {
scanf("%lld", &A[i]);
// A[i] = rand() % 100 + (i?A[i-1]:0) + 1;
}
vector<long long> X(Q);
for (int i = 0; i < Q; i++) {
scanf("%lld", &X[i]);
// X[i] = A[i];
}
solve(N, Q, A, X);
// cout << "No submit" << endl;
return 0;
}
|
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
#define dump(...) do{print_vars(cout<<"# "<<#__VA_ARGS__<<'=',__VA_ARGS__);cout<<endl;}while(0)
#define repi(i,a,b) for(int i=int(a);i<int(b);i++)
#define peri(i,a,b) for(int i=int(b);i-->int(a);)
#define rep(i,n) repi(i,0,n)
#define per(i,n) peri(i,0,n)
#define all(c) begin(c),end(c)
#define mp make_pair
#define mt make_tuple
using uint=unsigned;
using ll=long long;
using ull=unsigned long long;
using vi=vector<int>;
using vvi=vector<vi>;
using vl=vector<ll>;
using vvl=vector<vl>;
using vd=vector<double>;
using vvd=vector<vd>;
using vs=vector<string>;
template<typename T,typename U>bool chmin(T& a,const U& b){return a>b?(a=b,1):0;}
template<typename T,typename U>bool chmax(T& a,const U& b){return a<b?(a=b,1):0;}
void print_vars(ostream&){}
template<typename Car,typename... Cdr>
void print_vars(ostream& os,const Car& car,const Cdr&... cdr){
print_vars(os<<car<<(sizeof...(cdr)?",":""),cdr...);
}
template<typename T1,typename T2>
ostream& operator<<(ostream& os,const pair<T1,T2>& p){
return os<<'('<<p.first<<','<<p.second<<')';
}
template<int I,typename Tuple>
void print_tuple(ostream&,const Tuple&){}
template<int I,typename Car,typename... Cdr,typename Tuple>
void print_tuple(ostream& os,const Tuple& t){
os<<get<I>(t)<<(sizeof...(Cdr)?",":"");
print_tuple<I+1,Cdr...>(os,t);
}
template<typename... Args>
ostream& operator<<(ostream& os,const tuple<Args...>& t){
print_tuple<0,Args...>(os<<'(',t);
return os<<')';
}
template<typename Ch,typename Tr,typename C>
basic_ostream<Ch,Tr>& operator<<(basic_ostream<Ch,Tr>& os,const C& c){
os<<'[';
for(auto i=begin(c);i!=end(c);++i)
os<<(i==begin(c)?"":" ")<<*i;
return os<<']';
}
constexpr int INF=1e9;
constexpr int MOD=1e9+7;
constexpr double EPS=1e-9;
int main()
{
#ifndef _GLIBCXX_DEBUG
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
constexpr char endl='\n';
#endif
for(int n,q;cin>>n>>q&&n|q;){
vl a(n);
rep(i,n) cin>>a[i];
vl sum(n+1),sume(n+1),sumo(n+1);
rep(i,n)
sum[i+1]=sum[i]+a[i];
rep(i,n){
sume[i+1]=sume[i];
sumo[i+1]=sumo[i];
if(i%2==0)
sume[i+1]+=a[i];
else
sumo[i+1]+=a[i];
}
rep(_,q){
ll x; cin>>x;
ll lo=0,hi=1e9;
while(lo<hi){
ll mi=(lo+hi)/2;
int l=lower_bound(all(a),x-mi)-begin(a);
int r=lower_bound(all(a),x+mi)-begin(a);
if(r-l>n-r)
hi=mi;
else
lo=mi+1;
}
// 青木くんが取る区間: [al,ar)
int al=lower_bound(all(a),x-(lo-1))-begin(a);
int ar=lower_bound(all(a),x+(lo-1))-begin(a);
// 高橋くんが取る区間: [tl,n)
int tl=n-(ar-al);
while(ar<tl){
tl--;
if(al==0&&ar==tl)
break;
if(al>0&&(ar==tl||abs(x-a[al-1])<=abs(x-a[ar])))
al--;
else
ar++;
}
ll res=sum[n]-sum[tl];
if(al%2==0)
res+=sumo[al];
else
res+=sume[al];
cout<<res<<endl;
}
}
}
|
p03158 | C++ | #pragma GCC optimize(3)
#include<bits/stdc++.h>
#define MAXN 100005
#define INF 1000000000000000000LL
#define MOD 1000000007
#define F first
#define S second
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
ll n,q,x,a[MAXN],sum[MAXN],even[MAXN];
int main()
{
scanf("%lld%lld",&n,&q);
for(ll i=1;i<=n;i++) scanf("%lld",&a[i]);
a[0]=-INF;
for(ll i=1;i<=n;i++)
{
sum[i]=sum[i-1]+a[i];
even[i]=even[i-1]+a[i]*(i&1?0:1);
}
for(ll i=0;i<q;i++)
{
scanf("%lld",&x);
if(x>=a[n])
{
if(n&1) printf("%lld\n",sum[n]-even[n]);
else printf("%lld\n",even[n]);
continue;
}
ll pos=lower_bound(a+1,a+n+1,x)-a;
ll l=pos-1,r=n;
while(r-l>1)
{
ll mid=(l+r)/2;
ll numr=n-mid+1;
ll numl=mid-(lower_bound(a,a+n+1,2*x-a[mid])-a);
if(numr-numl<=1) r=mid; else l=mid;
}
ll ans=sum[n]-sum[r-1];
ll pp=n-2*(n-r+1);
if(pp&1) ans+=sum[pp]-even[pp]; else ans+=even[pp];
printf("%lld\n",ans);
}
return 0;
}
|
p03158 | C++ | // クソ汚い.サンプルは合う.
#include<iostream>
#include<algorithm>
#include<vector>
#include<numeric>
using namespace std;
typedef long long ll;
int main(){
int n, q;
cin >> n >> q;
vector<int> a(n);
for(int i = 0; i < n; i++) cin >> a[i];
vector<ll> b(n), c(n+1);
b[0] = a[0], b[1] = a[1];
for(int i = 2; i < n; i++) b[i] = b[i-2] + a[i];
c[0] = 0;
for(int i = 0; i < n; i++) c[i+1] = a[i]+c[i];
int x;
while(q-- > 0){
cin >> x;
if(x > a[n-1]){
cout << b[n-1] << endl;
continue;
}else if(x < a[0]){
cout << c[n-1+1] - c[n/2-1+1] << endl;
continue;
}
// aokiが+-midの範囲のカードを取るとして二分探索
int l = 0, r = a[n-1]+1;
int aoki, taka, s, t;
ll ans = 0;
int cnt = 35;
while(true){
int mid = (l+r)/2;
auto ss = lower_bound(a.begin(), a.end(), x-mid);
auto tt = lower_bound(a.begin(), a.end(), x+mid);
s = ss-a.begin(), t = tt-a.begin();
if(*tt != x+mid) t--;
aoki = t-s+1;
taka = n-t-1;
// cout << "aoki takes " << a[s] << " to " << a[t] << endl;
// cout << aoki << " " << taka << endl;
if(*ss == x-mid && *tt == x+mid){
if(aoki-1+1 == taka+1){
t--;
ll tmp = c[t+1]-c[s];
if(s > 0) tmp += b[s-1];
ans = c[n]-tmp;
break;
}
}
if(aoki+1 == taka){
ll tmp = c[t+1]-c[s];
if(s > 0) tmp += b[s-1];
ans = c[n]-tmp;
break;
}
if(aoki == taka){
ll tmp = c[t+1]-c[s];
if(s > 1) tmp += b[s-2];
ans = c[n]-tmp;
break;
}
if(aoki+1 > taka){
r = mid;
}else{
l = mid+1;
}
}
cout << ans << endl;
}
return 0;
} |
p03158 | C++ | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef unsigned int uint;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i,n) for(int i = 0; i < (int)(n); ++i)
#define FOR(i,a,b) for(int i = (a); i < (int)(b); ++i)
#define ALL(c) (c).begin(), (c).end()
#define SIZE(v) ((int)v.size())
#define pb push_back
#define mp make_pair
#define mt make_tuple
ll slow_query(ll N, vector<ll>& As, ll x) {
ll ans = 0;
bool takahashi = true;
ll max_pos = N - 1;
vector<char> used(N);
REP(n, N) {
if (takahashi) {
while(true) {
if (!used[max_pos]) {
ans += As[max_pos];
used[max_pos] = 1;
max_pos--;
break;
} else {
--max_pos;
}
}
} else {
int best_pos = -1;
int best_dist = 1e9 + 100;
REP(i, N) {
if (used[i]) continue;
auto dist = abs(x - As[i]);
if (dist < best_dist) {
best_dist = dist;
best_pos = i;
}
}
used[best_pos] = 1;
}
takahashi = !takahashi;
}
return ans;
}
vector<ll> slow(ll N, vector<ll>& As, vector<ll>& Xs){
vector<ll> ans;
for(auto x: Xs) {
ans.pb(slow_query(N, As, x));
}
return ans;
}
ll cnt_elem_eq_or_less_than_n(vector<ll>& nums, ll n) {
return std::upper_bound(nums.begin(), nums.end(), n) - nums.begin();
}
ll fast_query(ll N, vector<ll>& As, ll x, set<ll>& pt_locs, vector<ll>& cum_left, vector<ll>& cum_right){
if (x >= As[N - 2]) return cum_left[N];
ll lo = 0;
ll hi = 1e9 + 100;
// 位置x にある点の数
ll pt_num = pt_locs.count(x);
while (lo < hi) {
ll k = (lo + hi) / 2;
// [x+1, x+k]の範囲にある点の数
ll pt_num_right
= cnt_elem_eq_or_less_than_n(As, x + k)
- cnt_elem_eq_or_less_than_n(As, x);
// [x-k, x-1]の範囲にある点の数
ll pt_num_left
= cnt_elem_eq_or_less_than_n(As, x - 1)
- cnt_elem_eq_or_less_than_n(As, x - k - 1);
ll aoki = pt_num + pt_num_right + pt_num_left;
// [x+k+1,]の範囲にある点の数
ll takahashi = N - cnt_elem_eq_or_less_than_n(As, x + k);
//cout << "k = " << k << ": aoki " << aoki << ", takahashi " << takahashi << endl;
auto diff = takahashi - aoki;
if (0 <= diff && diff <= 1) {
//cout << "ok. k = " << k << ": aoki " << aoki << ", takahashi " << takahashi << endl;
ll ans1 = cum_right[takahashi];
ll ans2 = cum_left[N - aoki - takahashi];
return ans1 + ans2;
}
if (aoki - takahashi == 1 && pt_locs.count(x - k) && pt_locs.count(x + k)) {
//cout << "ok. k = " << k << ": aoki " << aoki << ", takahashi " << takahashi << endl;
ll ans1 = cum_right[takahashi + 1];
ll ans2 = cum_left[N - aoki - takahashi];
return ans1 + ans2;
}
if (aoki > takahashi) {
hi = k;
} else {
lo = k + 1;
}
}
//cout << "ng. k = " << endl;
return 777;
}
vector<ll> fast(ll N, vector<ll>& As, vector<ll>& Xs){
vector<ll> ans;
set<ll> pt_locs;
for(auto a: As) pt_locs.insert(a);
// 右側からn個とるときの累積
vector<ll> cum_right(N+1);
ll tmp = 0;
REP(n, N) {
tmp += As[N - n - 1];
cum_right[n + 1] = tmp;
}
// 左側からn個とるときの累積
vector<ll> cum_left(N+1);
tmp = 0;
REP(n, N) {
if (N % 2 == 1) {
if (n % 2 == 0) tmp += As[n];
}
else if (N % 2 == 0) {
if (n % 2 == 1) tmp += As[n];
}
cum_left[n + 1] = tmp;
}
for(auto x: Xs) {
//cout << "============" << endl;
ans.pb(fast_query(N, As, x, pt_locs, cum_left, cum_right));
}
return ans;
}
int main(void)
{
cin.sync_with_stdio(false);
ll N, Q;
cin >> N >> Q;
vector<ll> As(N);
REP(n, N) cin >> As[n];
vector<ll> Xs(Q);
REP(q, Q) cin >> Xs[q];
// auto ans = slow(N, As, Xs);
auto ans = fast(N, As, Xs);
for(auto a: ans) cout << a << endl;
return 0;
}
|
p03158 | C++ | #include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
inline int read()
{
int res = 0; bool bo = 0; char c;
while (((c = getchar()) < '0' || c > '9') && c != '-');
if (c == '-') bo = 1; else res = c - 48;
while ((c = getchar()) >= '0' && c <= '9')
res = (res << 3) + (res << 1) + (c - 48);
return bo ? ~res + 1 : res;
}
template <class T>
inline void write(T x)
{
if (x > 9) write(x / 10);
putchar(x % 10 + '0');
}
template <class T>
inline T Min(const T &a, const T &b) {return a < b ? a : b;}
template <class T>
inline T Max(const T &a, const T &b) {return a > b ? a : b;}
typedef long long ll;
const int N = 1e5 + 5;
int n, q, a[N];
ll sum[N], xsum[N][2];
int queryt(int pos, int st, int ed, bool is, int k)
{
if (is) k++;
int l = Max(1, k - (n - ed + 1)), r = Min(k, st);
while (l <= r)
{
int mid = l + r >> 1;
int x1 = st - mid + 1, x2 = ed + (k - mid) - 1;
if (x2 == n || pos - a[x1] <= a[x2 + 1] - pos)
l = mid + 1;
else r = mid - 1;
}
return r;
}
ll query(int x)
{
int pos = std::upper_bound(a + 1, a + n + 1, x) - a - 1;
bool is = a[pos] == x;
int st = pos, ed = is ? pos : pos + 1, l = 1, r = n;
while (l <= r)
{
int mid = l + r >> 1;
int tmp = queryt(x, st, ed, is, mid), L, R;
L = st - tmp + 1; R = ed + (mid + is - tmp) - 1;
if (R < n - mid + 1) l = mid + 1;
else r = mid - 1;
}
if (!r) return xsum[n][n & 1];
int tq = r;
int tmp = queryt(x, st, ed, is, tq), L, R;
L = st - tmp + 1; R = ed + (tq + is - tmp) - 1;
if (R + 1 == n - tq + 1) return sum[n] - sum[R] + xsum[L - 1][L - 1 & 1];
return sum[n] - sum[R] + xsum[L - 1][L & 1];
}
int main()
{
int x;
n = read(); q = read();
for (int i = 1; i <= n; i++) a[i] = read();
for (int i = 1; i <= n; i++)
{
sum[i] = sum[i - 1] + a[i];
xsum[i][i & 1] = xsum[i - 1][i & 1] + a[i];
xsum[i][(i & 1) ^ 1] = xsum[i - 1][(i & 1) ^ 1];
}
while (q--)
{
x = read();
if (x <= a[1]) write(sum[n] - sum[n >> 1]), putchar('\n');
else if (x >= a[n]) write(xsum[n][n & 1]), putchar('\n');
else write(query(x)), putchar('\n');
}
return 0;
} |
p03158 | C++ | #include <bits/stdc++.h>
int main()
{
int n, q;
scanf("%d%d", &n, &q);
std::vector<int> a(n + 1);
std::vector<long long[2]> sum(n + 1);
for (int i{1}; i <= n; i++)
scanf("%d", &a[i]);
for (int i{1}; i <= n; i++)
sum[i][0] = sum[i - 1][0] + a[i];
sum[1][1] = a[1];
for (int i{2}; i <= n; i++)
sum[i][1] = sum[i - 2][1] + a[i];
// 最初ini個取る場合right[ini]が上限
std::vector<int> right((n + 1) / 2 + 1);
right[0] = 1 << 30;
for (int ini{1}; ini <= (n + 1) / 2; ini++)
right[ini] = (a[n - ini + 1] + a[n - 2 * ini + 2]) / 2;
for (int q_i{}; q_i < q; q_i++)
{
int x;
scanf("%d", &x);
int lb{}, ub{(n + 1) / 2 + 1};
while (lb + 1 < ub)
{
int mid{(lb + ub) / 2};
if (right[mid] >= x) lb = mid;
else ub = mid;
}
long long takahashi{sum[n][0] - sum[n - lb][0]};
takahashi += sum[std::max(0, n - lb * 2)][1];
printf("%lld\n", takahashi);
}
return 0;
} |
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int MX=100010;
int n, q, A[MX], m;
ll sum[MX];
bool valid(int k, int x){
if(k*2>=n) return true;
int r=A[n-k], l=A[n-2*k];
return abs(r-x)<abs(l-x);
}
int main(){
ios::sync_with_stdio(0), cin.tie(0);
cin>>n>>q; m=(n+1)/2;
for(int i=1; i<=n; i++) cin>>A[i];
for(int i=1; i<=m; i++) sum[i] = sum[i-1] + A[n-i+1];
// for(int i=0; i<=m; i++) cout<<sum[i]<<' ';
// cout<<'\n';
for(int i=m; i>=0; i--){
static ll now=0;
if(n-i*2<=0) continue;
now += A[n-i*2]; sum[i]+=now;
// cout<<i<<": "<<now<<'\n';
}
// for(int i=0; i<=m; i++) cout<<sum[i]<<' ';
// cout<<'\n';
for(int i=1; i<=q; i++){
int x; cin>>x;
int s=0, e=m;
// cout<<"Solving "<<x<<": ";
while(s<e){
int mid=(s+e)/2;
if(valid(mid,x)) e=mid;
else s=mid+1;
// cout<<mid<<"("<<(valid(mid,x)?'O':'X')<<") ";
}
// cout<<"\nans: ";
cout<<sum[s]<<'\n';
}
return 0;
} |
p03158 | C++ | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const double PI = 3.141592653589793238;
const double EPS = 1e-10;
ll A[100000];
ll sum[100000];
ll sum2[100000];
int main() {
int N, Q;
cin >> N >> Q;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
sum2[N - 1] = A[N - 1];
for (int i = N - 2; i >= 0; i--) {
sum2[i] = sum2[i + 1] + A[i];
}
sum[0] = A[0];
sum[1] = A[1];
for (int i = 2; i < N; i++) {
sum[i] = sum[i - 2] + A[i];
}
for (int i = 0; i < Q; i++) {
ll X;
cin >> X;
if (X <= A[0]) {
cout << sum2[N / 2] << endl;
continue;
}
if (X >= A[N - 1]) {
cout << sum[N - 1] << endl;
continue;
}
int x1 = upper_bound(A, A + N, X) - A - 1;
int l = x1, r = N - 1;
while ((r - l) > 1) {
int m = (l + r) / 2;
ll d = A[m] - X;
int x2 = lower_bound(A, A + N, X - d) - A;
int up = N - m;
int down = m - x2;
if (down >= up - 1) r = m;
else l = m;
}
int up = N - r;
int down = r - 1 - (N - r);
ll ans = sum2[r];
if (down >= 0) ans += sum[down];
cout << ans << endl;
}
} |
p03158 | C++ | #include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define rep(i,l,r) for (int i=(l); i<=(r); i++)
typedef long long ll;
using namespace std;
const int N=200010;
int n,Q,x,a[N];
ll sm[N],s[N];
void get(int x,int k,int &l,int &r){
int d=lower_bound(a+1,a+n+1,x)-a,L=0,R=d-1;
if (x<a[1]) { l=1; r=k; return; }
if (x>a[n]) { l=n-k+1; r=n; return; }
while (L<R){
int mid=(L+R+1)>>1;
if (d+k-mid-1>n) { L=mid+1; continue; }
if (d+k-mid>n || x-a[d-mid]<=a[d+k-mid]-x) L=mid; else R=mid-1;
}
l=d-L; r=d+k-L-1;
}
int main(){
scanf("%d%d",&n,&Q);
rep(i,1,n) scanf("%d",&a[i]);
sort(a+1,a+n+1); sm[1]=a[1]; sm[2]=a[2];
rep(i,3,n) sm[i]=sm[i-2]+a[i];
rep(i,1,n) s[i]=s[i-1]+a[i];
while (Q--){
scanf("%d",&x);
int L=0,R=n;
while (L<=R){
int mid=(L+R)>>1,l,r; get(x,mid,l,r);
if (r==n-mid){ printf("%lld\n",sm[l-1]+s[n]-s[r]); break; }
if (r+1==n-mid){ printf("%lld\n",sm[l-2]+s[n]-s[r]); break; }
if (r<n-mid) L=mid+1; else R=mid-1;
}
}
return 0;
} |
p03158 | C++ | /**
* File : D.cpp
* Author : Kazune Takahashi
* Created : 1/12/2019, 9:15:17 PM
* Powered by Visual Studio Code
*/
#include <iostream>
#include <iomanip> // << fixed << setprecision(xxx)
#include <algorithm> // do { } while ( next_permutation(A, A+xxx) ) ;
#include <vector>
#include <string> // to_string(nnn) // substr(m, n) // stoi(nnn)
#include <complex>
#include <tuple>
#include <queue>
#include <stack>
#include <map> // if (M.find(key) != M.end()) { }
#include <set>
#include <functional>
#include <random> // auto rd = bind(uniform_int_distribution<int>(0, 9), mt19937(19920725));
#include <chrono> // std::chrono::system_clock::time_point start_time, end_time;
// start = std::chrono::system_clock::now();
// double elapsed = std::chrono::duration_cast<std::chrono::milliseconds>(end_time-start_time).count();
#include <cctype>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
using namespace std;
#define DEBUG 0 // change 0 -> 1 if we need debug.
typedef long long ll;
// const int dx[4] = {1, 0, -1, 0};
// const int dy[4] = {0, 1, 0, -1};
// const int C = 1e6+10;
const ll infty = 100000000007;
int N, Q;
ll A[100010];
vector<ll> B;
ll X[100010];
set<ll> S;
map<ll, ll> M;
ll Y[100010];
ll Z[100010];
void flush()
{
for (auto i = 0; i < Q; i++)
{
cout << M[X[i]] << endl;
}
}
int main()
{
cin >> N >> Q;
for (auto i = 0; i < N; i++)
{
cin >> A[i];
}
for (auto i = 0; i < Q; i++)
{
cin >> X[i];
S.insert(X[i]);
}
reverse(A, A + N);
Y[N + 1] = 0;
Y[N] = 0;
Y[N - 1] = A[N - 1];
Y[N - 2] = A[N - 2];
for (auto i = N - 3; i >= 0; i--)
{
Y[i] = A[i] + Y[i + 2];
}
Z[0] = A[0];
for (auto i = 1; i < N; i++)
{
Z[i] = A[i] + Z[i - 1];
}
B.push_back(infty);
for (auto i = 0; i < N; i++)
{
B.push_back(A[i]);
}
B.push_back(-infty);
auto it = S.begin();
for (auto i = N; i >= 0; i--)
{
int second = i / 2;
int first = i - second;
ll score;
if (first == 0)
{
score = Y[0];
}
else if (first == second)
{
score = Z[first - 1] + Y[i];
}
else
{
score = Z[first - 1] + Y[i + 1];
}
ll upper, lower;
if (second == 0)
{
upper = infty;
lower = -infty;
}
else
{
ll FA = B[first];
ll FB = B[first + second];
upper = (FA + FB) / 2;
ll GA = B[first + 1];
ll GB = B[first + second + 1];
lower = (GA + GB) / 2 + 1;
}
// cerr << "i = " << i << ", upper = " << upper << ", lower = " << lower << endl;
while (it != S.end())
{
if (lower <= *it && *it <= upper)
{
M[*it] = score;
it++;
}
else
{
break;
}
}
}
assert(it == S.end());
flush();
} |
p03158 | C++ | #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <queue>
#include <functional>
#include <map>
#include <set>
#include <sys/timeb.h>
#include <fstream>
#include <random>
#include <regex>
#include <chrono>
#include <bitset>
#include <cassert>
#include <iomanip>
#include <limits>
#include <stack>
using namespace std;
#define DEBUG_
#define repr(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repr(i,0,n)
#define reprrev(i,a,b) for(int i=(int)(b)-1;i>=(int)(a);i--)
#define reprev(i,n) reprrev(i,0,n)
#define repi(itr,ds) for(auto itr=ds.begin();itr!=ds.end();itr++)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define mp make_pair
#define mt make_tuple
#define INF 1050000000
#define INFR INT_MAX
#define INFL (long long)(4e18)
#define INFLR LLONG_MAX
#define EPS (1e-10)
#define MOD 1000000007
#define PI 3.141592653589793238
#define RMAX 4294967295
#ifdef DEBUG_
#define DEB
#else
#define DEB if(false)
#endif
#ifdef DEBUG_
#define dump(...) DUMPOUT<<" "; \
dump_func(string(#__VA_ARGS__) + ":", "[" + to_string(__LINE__) + ":" + __FUNCTION__ + "]"); \
DUMPOUT<<" "; \
dump_func(__VA_ARGS__)
#else
#define dump(...)
#endif
typedef long long ll;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<double, double> Pd;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<Pi> vPi;
typedef vector<Pll> vPll;
typedef vector<Pd>vPd;
typedef vector<vector<int> > vvi;
typedef vector<vector<bool> > vvb;
typedef vector<vector<ll> > vvll;
typedef vector<vector<char> > vvc;
typedef vector<vector<string> > vvs;
typedef vector<vector<double> > vvd;
typedef vector<vector<Pi> > vvPi;
typedef vector<vector<vector<int> > > vvvi;
typedef vector<vector<vector<ll> > > vvvll;
typedef vector<vector<vector<Pi> > > vvvPi;
typedef vector<vector<vector<vector<Pi> > > > vvvvPi;
typedef priority_queue<int, vector<int>, greater<int> > pqli;
typedef priority_queue<ll, vector<ll>, greater<ll> > pqlll;
typedef priority_queue<Pi, vector<Pi>, greater<Pi> > pqlP;
template <class T>
using vec = vector<T>;
template<class T>
using pql = priority_queue<T, vector<T>, greater<T>>;
string debug_show(Pi a) {
return "(" + to_string(a.first) + "," + to_string(a.second) + ")";
}
#define DUMPOUT cerr
void dump_func() {
DUMPOUT << endl;
}
template <class Head, class... Tail>
void dump_func(Head&& head, Tail&&... tail) {
DUMPOUT << head;
if (sizeof...(Tail) <= 1) {
DUMPOUT << " ";
}
else {
DUMPOUT << ", ";
}
dump_func(std::move(tail)...);
}
// vector
template<typename T>
istream& operator >> (istream& is, vector<T>& vec) {
for (T& x : vec) is >> x;
return is;
}
// pair
template<typename T, typename U>
ostream& operator << (ostream& os, pair<T, U>& pair_var) {
os << "(" << pair_var.first << "," << pair_var.second << ")";
return os;
}
// pair
template<typename T, typename U>
ostream& operator << (ostream& os, const pair<T, U>& pair_var) {
os << "(" << pair_var.first << "," << pair_var.second << ")";
return os;
}
// vector
template<typename T>
ostream& operator << (ostream& os, const vector<T>& vec) {
os << "{";
for (int i = 0; i < vec.size(); i++) {
os << vec[i] << (i + 1 == vec.size() ? "" : ", ");
}
os << "}";
return os;
}
// map
template<typename T, typename U>
ostream& operator << (ostream& os, map<T, U>& map_var) {
os << "{";
repi(itr, map_var) {
os << "(" << itr->first << "," << itr->second << ")";
itr++;
if (itr == map_var.end()) os << ", ";
itr--;
}
os << "}";
return os;
}
// set
template<typename T>
ostream& operator << (ostream& os, set<T>& set_var) {
os << "{";
repi(itr, set_var) {
os << " " << *itr << endl;
itr++;
if (itr == set_var.end()) os << ", ";
itr--;
}
os << "}";
return os;
}
string YN(bool y, int id = 0) { if (id)cout << id; return (y ? "YES" : "NO"); }
string yn(bool y, int id = 0) { if (id)cout << id; return (y ? "Yes" : "No"); }
string ON(bool y, int id = 0) { if (id)cout << id; return (y ? "OK" : "NG"); }
int dir4[4][2] = { { 0,-1 },{ -1,0 },{ 1,0 },{ 0,1 } };
int dir8[8][2] = { { -1,-1 },{ 0,-1 },{ 1,-1 },{ -1,0 },{ 1,0 },{ -1,1 },{ 0,1 },{ 1,1 } };
char dirchar[4] = { '<','^','>','v' };
// [a,b)
int irand(int a, int b) {
static mt19937 Rand(static_cast<unsigned int>(time(nullptr)));
uniform_int_distribution<int> dist(a, b - 1);
return dist(Rand);
}
// [a,b)
double drand(int a, int b) {
static mt19937 Rand(static_cast<unsigned int>(time(nullptr)));
uniform_real_distribution<double> dist(a, b);
return dist(Rand);
}
struct Edge {
int from, to, cost;
bool operator<(Edge e) {
return cost < e.cost;
}
};
using Graph = vec<vec<Edge>>;
ostream& operator << (ostream& os, Edge &edge) {
os << "(" << edge.from << "->" << edge.to << ":" << edge.cost << ")";
return os;
}
//======================================================
int main(void) {
int N, Q;
cin >> N >> Q;
vi a;
if (N % 2 == 1) {
N++;
a = vi(N);
a[0] = 0;
rep(i, N - 1) {
cin >> a[i + 1];
}
}
else {
a = vi(N);
cin >> a;
}
vi x(Q);
cin >> x;
//cerr << a << endl;
vll cumsum(N + 1, 0), oddsum(N + 1, 0);
rep(i, N) {
cumsum[i + 1] = cumsum[i] + a[i];
if (i % 2 == 1) {
oddsum[i + 1] += oddsum[i - 1] + a[i];
}
}
//cerr << cumsum << endl << oddsum << endl;
vi border(N / 2 - 1);
rep(i, N / 2 - 1) {
border[N / 2 - 2 - i] = (a[N - 2 - i] + a[N - 3 - 2 * i]) / 2;
}
//cerr << border << endl;
rep(q, Q) {
int idx = lower_bound(all(border), x[q]) - border.begin();
//cerr << idx << endl;
ll ans = oddsum[2 * idx] + cumsum[N] - cumsum[N - (N / 2 - idx)];
cout << ans << endl;
}
} |
p03158 | C++ | #include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <cmath>
#include <iomanip>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cassert>
#include <cstring>
#include <climits>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define SORT(c) sort((c).begin(), (c).end())
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> V;
typedef map<int, int> M;
constexpr ll INF = 1e18;
constexpr ll MOD = 1e9 + 7;
constexpr double PI = 3.14159265358979323846;
constexpr int dx[] = {0, 0, 1, -1};
constexpr int dy[] = {1, -1, 0, 0};
int div_up(int a, int b)
{
return (a + b - 1) / b;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int n, q, a[112345], x[112345];
ll sum[112345], sum1[112345];
cin >> n >> q;
REP(i, n)
cin >> a[i];
REP(i, q)
cin >> x[i];
sum[0] = 0;
REP(i, n)
sum[i + 1] = sum[i] + a[i];
sum1[0] = 0;
bool b = n % 2;
REP(i, n)
{
sum1[i + 1] = sum1[i] + b * a[i];
b = !b;
}
REP(i, q)
{
//x[i]より大きい数の最小値のindex
int qi = upper_bound(a, a + n, x[i]) - lower_bound(a, a + n, 0);
int l = n / 2 - 1;
int r = div_up(n - 1 + qi, 2);
while (r - l > 1)
{
int mid = (r + l) / 2;
int Tnum = n - mid;
int dr = abs(a[mid] - x[i]);
int dl = abs(a[mid - (n - mid) + 1] - x[i]);
if (dr >= dl)
r = mid;
else
l = mid;
}
ll res = 0;
res += sum[n] - sum[r];
res += sum1[(r - (n - r))];
cout << res << endl;
// " " << x[i] << " " << r << endl;
}
return 0;
} |
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int max_size=100000;//количество факториалов, которых посчитает прога
int n;
ll a[200000];
ll chet[200000];
ll suf[200000];
ll Q;
ll x;
int ind;
bool r;
bool funk1(int l,int k){
if(ind+l+1>=n) return 1;
if(ind-(k-l-1)<0) return 0;
if(x-a[ind-(k-l-1)]>a[ind+l+1]-x) return 0;
// cout<<"lol";
return 1;
}
bool funk(int k){
// if()
ll mn=0;
ll mx=k+1;
ll md=(mn+mx)/2;
while(mn+1<mx){
if(funk1(md,k)==0){
mn=md;
md=(mn+mx)/2;
}
else{
mx=md;
md=(mx+mn)/2;
}
// cout<<mn<<" "<<md<<" "<<mx<<endl;
}
// cout<<funk1(1,2)<<" ";
// cout<<mn<<endl;
if(funk1(mn,k)==1) mx=mn;
// cout<<mx<<" "<<ind<<" " <<k<<" "<<n<<endl;
if(n>ind+mx+k){
if(n>ind+mx+k+1){
r=1;
}
else r=0;
return 1;
}
else{
return 0;
}
}
int main() {
ios_base::sync_with_stdio(false);
cin>>n>>Q;
for(int i=0;i<n;i++) cin>>a[i];
a[n]=-1e17;
n++;
sort(a,a+n);
chet[1]=a[1];
for(int i=2;i<n;i++){
chet[i]=chet[i-2]+a[i];
// cout<<chet[i]<<endl;
}
suf[n]=0;
for(int i=n-1;i>-1;i--){
suf[i]=a[i]+suf[i+1];
// cout<<suf[i]<<endl;
}
// x=9;
// ind=3;
// cout<<funk(2);
// return 0;
for(int T=0;T<Q;T++){
cin>>x;
int mn1=0,mx1=n,md1;
md1=(mn1+mx1)/2;
while(mn1+1<mx1){
if(a[md1]<=x){
mn1=md1;
md1=(mn1+mx1)/2;
}
else{
mx1=md1;
md1=(mn1+mx1)/2;
}
}
ind=mn1;
int mn=0,mx=n,md;
md=(mn+mx)/2;
while(mn+1<mx){
if(funk(md)==1){
mn=md;
md=(mn+mx)/2;
}
else{
mx=md;
md=(mn+mx)/2;
}
}
ll ans=0;
if(r){
// cout<<suf[n-(mn+1)]<<" "<<n-(mn+1)<<"xxx";
//cout<<chet[n-(mn+1)*2-1]<<" "<<n-(mn+1)*2<<"xxx";
ans=suf[n-(mn+1)]+chet[n-(mn+1)*2-1];
}
else{
// cout<<suf[n-mn]<<" "<<n-mn<<"xxx";
// cout<<chet[n-2*mn-1]<<" "<<n-2*mn<<"xxx";
ans=suf[n-mn]+chet[n-2*mn-1];
}
cout<<ans<<'\n';
}
return 0;
} |
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
using LL = long long;
using VL = vector<LL>;
using VVL = vector<VL>;
using PLL = pair<LL, LL>;
using VS = vector<string>;
#define ALL(a) begin((a)),end((a))
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define MT make_tuple
#define SZ(a) int((a).size())
#define SORT(c) sort(ALL((c)))
#define RSORT(c) sort(RALL((c)))
#define UNIQ(c) (c).erase(unique(ALL((c))), end((c)))
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define FF first
#define SS second
template<class S, class T>
istream& operator>>(istream& is, pair<S,T>& p){
return is >> p.FF >> p.SS;
}
template<class T>
istream& operator>>(istream& is, vector<T>& xs){
for(auto& x: xs)
is >> x;
return is;
}
template<class S, class T>
ostream& operator<<(ostream& os, const pair<S,T>& p){
return os << p.FF << " " << p.SS;
}
template<class T>
ostream& operator<<(ostream& os, const vector<T>& xs){
for(unsigned int i=0;i<xs.size();++i)
os << (i?" ":"") << xs[i];
return os;
}
template<class T>
void maxi(T& x, T y){
if(x < y) x = y;
}
template<class T>
void mini(T& x, T y){
if(x > y) x = y;
}
void debug(istringstream&){}
template <char sep=',', class Head, class... Tail>
void debug(istringstream& iss, Head&& head, Tail&&... tail)
{
string name;
getline(iss, name, ',');
cerr << sep << name << "=" << head;
debug(iss, forward<Tail>(tail)...);
}
#define DEBUG(...) \
do{ \
istringstream ss(#__VA_ARGS__); \
debug<' '>(ss, __VA_ARGS__); \
cerr<<endl; \
}while(0)
const double EPS = 1e-10;
const double PI = acos(-1.0);
const LL MOD = 1e9+7;
int main(){
cin.tie(0);
ios_base::sync_with_stdio(false);
int N, Q;
cin >> N >> Q;
VL xs(N);
cin >> xs;
VL acc(N+1);
VL ev(N+1);
REP(i,N) acc[i+1] = acc[i] + xs[i];
REP(i,N) ev[i+1] = ev[i] + (i % 2 == 0 ? xs[i] : 0ll);
auto cnt = [&](LL lb, LL ub){ // [lb,ub)
auto l = lower_bound(ALL(xs), lb);
auto r = lower_bound(ALL(xs), ub);
return r - l;
};
while(Q--){
LL X;
cin >> X;
int lb = 1, ub = N;
while(ub - lb > 1){
LL m = (lb + ub) / 2;
LL ed = xs[N - m];
LL c = cnt(X - abs(X - ed), ed);
if(c >= m) lb = m;
else ub = m;
}
// lb
LL tk = acc[N] - acc[N-lb];
int i1 = N - 1 - lb - lb;
int i2 = N - 1 - lb;
if(0 <= i1 && abs(X - xs[i1] <= abs(X - xs[i2]))){
tk += xs[i2];
int b = i1;
if(b % 2 == 0){
tk += ev[b];
}
else{
tk += acc[b] - ev[b];
}
}
else{
int b = i1+1;
if(b % 2 == 1){
tk += ev[b];
}
else{
tk += acc[b] - ev[b];
}
}
// DEBUG(X, lb, i1, i2, tk);
#if 0
LL ed = xs[N - lb];
LL c = cnt(X - abs(X - ed), ed);
if(c == 0){
int b = N - 1;
if(b % 2 == 0){
tk += ev[b];
}
else{
tk += acc[b] - ev[b];
}
}
else{
if(c == lb){
int b = N - 2*lb;
if(b %2 == 1){
tk += ev[b];
}
else{
tk += acc[b] - ev[b];
}
}
else{
int i2 = N - 1 - lb;
int i1 = i2 - lb;
DEBUG(i1,i2);
if(0 <= i1 && abs(X - xs[i1] <= abs(X - xs[i2]))){
int b = N - 2*lb - 1;
tk += xs[N - lb - 1];
if(b > 0){
if(b % 2 == 0){
tk += ev[b];
}
else{
tk += acc[b] - ev[b];
}
}
}
else{
int b = N - 2*lb;
if(b > 0){
if(b % 2 == 1){
tk += ev[b];
}
else{
tk += acc[b] - ev[b];
}
}
}
}
}
DEBUG(lb,c, tk);
#endif
cout << tk << endl;
}
return 0;
}
|
p03158 | C++ | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int INF = 987654321;
const int MOD = 1000000007;
ll A[100005];
ll sumA[100005];
ll sumT[100005];
ll sumb[100005];
vector<ll> v;
vector<ll> ans;
int main(){
int N,Q;
scanf("%d %d",&N,&Q);
for(int i=1;i<=N;i++){
scanf("%lld",&A[i]);
}
for(int i=N;i>=0;i--){
sumb[i] = sumb[i+1] + A[i];
}
if(N % 2 == 0){
sumA[1] = A[1];
sumT[2] = A[2];
for(int i=3;i<=N;i+=2){
sumA[i] = sumA[i-2] + A[i];
sumT[i+1] = sumT[i+1-2] + A[i+1];
}
}
else{
sumT[1] = A[1];
sumA[2] = A[2];
for(int i=3;i<=N;i+=2){
sumT[i] = sumT[i-2] + A[i];
sumA[i+1] = sumA[i+1-2] + A[i+1];
}
}
int cnt = 1;
while(cnt*2 < N){
ll x = A[N-(2*cnt)];
ll y = A[N-cnt];
ll mid = (x+y)/2;
v.pb(mid);
cnt++;
}
for(int i=0;i<v.size();i++){
cnt = i+1;
ans.pb(sumb[N-cnt+1] + sumT[N-cnt*2]);
}
v.pb(-INF);
ans.pb(sumb[N-(N+1)/2+1]);
reverse(v.begin(),v.end());
reverse(ans.begin(),ans.end());
// for(int i=0;i<ans.size();i++){
// printf("v : %lld ans : %lld\n",v[i],ans[i]);
// }
for(int i=0;i<Q;i++){
ll X; scanf("%lld",&X);
int idx = lower_bound(v.begin(),v.end(),X)-v.begin();
// printf("idx : %d\n",idx);
printf("%lld\n",ans[idx-1]);
}
} |
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
long long n, q;
long long a[100005] = {0};
long long x[100005] = {0};
long long ans[100005] = {0};
vector<long long> memo;
void solve();
int main() {
cin >> n >> q;
for(int i = 0; i < n; ++i) cin >> a[i];
for(int i = 0; i < q; ++i) cin >> x[i];
solve();
for(int i = 0; i < q; ++i)
cout
<< ans[upper_bound(memo.begin(), memo.end(), x[i]) -
memo.begin() - 1]
<< endl;
return 0;
}
void solve() {
memo.push_back(0);
for(int i = 0; i + n / 2 < n && 2 * i - n % 2 + 1 < n;
++i)
memo.push_back(
(a[2 * i - n % 2 + 1] + a[n / 2 + i] + 2) / 2);
for(int i = n / 2; i < n; ++i) ans[0] += a[i];
for(int i = 1;
i + n / 2 < n && (n + 1) % 2 + (2 * i) - 2 < n; ++i) {
long long now = ans[i - 1];
now -= a[n / 2 + i - 1];
now += a[(n + 1) % 2 + (2 * i) - 2];
ans[i] = now;
}
memo[memo.size() - 1] = 100000000000;
} |
p03158 | C++ |
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cctype>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>
using namespace std;
#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF 1e9
#define LINF (ll)INF*INF
#define MOD 1000000007
#define rep(i,n) for(int i=0;i<(n);i++)
#define loop(i,a,n) for(int i=a;i<(n);i++)
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)
#define int ll //!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int,int> pii;
typedef vector<pii> vp;
int gcd(int a, int b){
if(b==0) return a;
return gcd(b,a%b);
}
int lcm(int a, int b){
return a*b/gcd(a,b);
}
signed main(void) {
int i,j;
int n,q;
cin >> n >> q;
vi a(n);
rep(i,n) cin >> a[i];
vi sum(n),even(n),odd(n);
rep(i,n){
sum[i] = a[i];
if(i%2)odd[i] = a[i];
else even[i] = a[i];
}
rep(i,n-1){
sum[i+1] += sum[i];
odd[i+1] += odd[i];
even[i+1] += even[i];
}
/*
rep(i,n)cout << " " << sum[i];cout << endl;
rep(i,n)cout << " " << odd[i];cout << endl;
rep(i,n)cout << " " << even[i];cout << endl;
*/
rep(_,q){
int x;
cin >> x;
if(a.back() <= x){
if(n%2)cout << even[n-1] << endl;
else cout << odd[n-1] << endl;
continue;
}
if(a[0] > x){
cout << sum[n-1] - sum[n/2-1] << endl;
continue;
}
int ind = lower_bound(all(a),x) - a.begin();
//cout << " " << ind << endl;
int ok = 0;
int ng = n-ind;
while(ng - ok > 1){
int mid = (ok + ng)/2;
int diff = a[ind + mid-1] - x;
int l = lower_bound(all(a), x-diff) - a.begin();
int num = ind + mid - l;
//cout << ok << " " << ng << " " << mid << " " << diff << " " << l << " " << num << endl;
if(mid + num > n){
ng = mid;
}else{
if(x <= a[n - mid - num])ok = mid;
else ng = mid;
}
}
int b = n - (ind + ok);
int p = n - b*2;
int q = ind + ok;
//cout << p << " " << q << endl;
int ans = 0;
ans += sum[n-1] - sum[q-1];
if(p >= 0){
if(n%2)ans += even[p];
else ans += odd[p];
}
cout << ans << endl;
}
}
|
p03158 | C++ | #include<iostream>
#include<string>
#include<cmath>
#include<queue>
#include<map>
#include<set>
#include<list>
#include<iomanip>
#include<vector>
#include<random>
#include<functional>
#include<algorithm>
#include<stack>
#include<cstdio>
#include<bitset>
#include<unordered_map>
#include <climits>
#include<fstream>
using namespace std;
//---------------------------------------------------
//library zone!!!!!
typedef long long ll;
typedef long double ld;
#define rep(i,j) for(ll i=0;i<(long long)(j);i++)
#define all(a) (a).begin(),(a).end()
const ll Mod = 1000000007;
struct P {
ll pos, cost;
};
bool operator<(P a, P b) { return a.cost < b.cost; }
bool operator>(P a, P b) { return a.cost > b.cost; }
struct B {
ll to, cost;
};
struct E {
ll from, to, cost;
};
bool operator<(E a, E b) {
return a.cost < b.cost;
}
struct H {
ll x, y;
};
bool operator<(H a, H b) {
if (a.x != b.x) return a.x < b.x;
return a.y < b.y;
}
bool operator>(H a, H b) {
if (a.x != b.x) return a.x > b.x;
return a.y > b.y;
}
bool operator==(H a, H b) {
return a.x == b.x&&a.y == b.y;
}
bool operator!=(H a, H b) {
return a.x != b.x || a.y != b.y;
}
ll gcd(ll i, ll j) {
if (i > j) swap(i, j);
if (i == 0) return j;
return gcd(j%i, i);
}
ld mod_pow(ld x, ll n, ll p) {
ld res = 1;
while (n > 0) {
if (n & 1) res = res * x;
x = x * x;
n >>= 1;
}
return res;
}//x^n%p
const ll Inf = 3023372036854775807;
const int inf = 1500000000;
#define int long long
//----------------------------------------------------
//++++++++++++++++++++++++++++++++++++++++++++++++++++
int n, q;
int a[200000];
int u;
int solve(int t) {
int r = lower_bound(a, a + n, u + t) - a;
if (r >= n || a[r] > u + t) r--;
int l = lower_bound(a, a + n, u - t) - a;
if (a[l] < u - t) l++;
return r - l + 1;
}
int b[200000];
int c[200000], d[200000];
//偶数、奇数
signed main() {
cin >> n >> q;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (i == 0) b[i] = a[i];
else b[i] = b[i - 1] + a[i];
if (i % 2 == 0) {
if (i == 0) c[i] = a[i];
else c[i] = c[i - 2] + a[i];
}
else {
if (i == 1) d[i] = a[i];
else d[i] = d[i - 2] + a[i];
}
}
for (int i = 0; i < q; i++) {
cin >> u;
int s = -1, e = 2000000000, t;
while (e - s > 1) {
t = (s + e) / 2;
//solveはtまで離れたときのSnukeが食べるお菓子の寮
int k = n - (upper_bound(a, a + n, u + t) - a);
//kは勅題が食べるお菓子の寮
int o = solve(t);
if (o >= k) e = t;
else s = t;
}
//eはスヌケが食べるお菓子の差分
int k = n - (upper_bound(a, a + n, u + e) - a);
int w = solve(e);
int r = lower_bound(a, a + n, u + e) - a;
if (r >= n || a[r] > u + e) r--;
int l = lower_bound(a, a + n, u - e) - a;
if (a[l] < u - e) l++;
//l~rがスヌケの割り当て
//高橋はkこ食べる
//スヌケはwこ食べる
int ans = b[r] - (l == 0 ? 0 : b[l - 1]);
if (w > k) {
ans -= a[r];
r--;
}
if (r - l + 1 == n - r - 1) {
if (l - 2 >= 0) {
if (l % 2 == 0) ans += c[l - 2];
else ans += d[l - 2];
}
}
else {
if (l - 1 >= 0) {
if (l % 2 == 0) ans += d[l - 1];
else ans += c[l - 1];
}
}
cout << b[n - 1] - ans << endl;
}
} |
p03158 | C++ | #include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
long long N, Q, A[100000], X[100000];
vector<int>border;
long long a_sum[100001], a_skip_sum[100001];
int main(){
cin >> N >> Q;
for(int i = 0; i < N; i++){
cin >> A[i];
a_sum[i+1] = a_sum[i] + A[i];
a_skip_sum[i+1] = a_skip_sum[i] + (((N - i) % 2)? A[i]: 0);
}
for(int q = 0; q < Q; q++){
cin >> X[q];
}
border.push_back(-2e9);
for(int i = 1; i <= (N - 1)/2; i++){
border.push_back(-A[N-1-i] - A[N-1-2*i] - 1);
}
for(int q = 0; q < Q; q++){
int split = lower_bound(border.begin(), border.end(), -2 * X[q]) - border.begin();
long long t_sum = 0;
t_sum += a_sum[N] - a_sum[N - split];
t_sum += a_skip_sum[N - 2 * split];
/*
int a_sum = 0;
for(int i = 0; i < split; i++){
t_sum += A[N - 1 - i];
a_sum += A[N - 1 - split - i];
}
for(int i = N - 2 * split - 1; i >= 0; i--){
if((N - i) % 2){
t_sum += A[i];
}else{
a_sum += A[i];
}
}
*/
cout << t_sum << endl;
//cout << lower_bound(border.begin(), border.end(), -2 * X[q]) - border.begin() << endl;
}
}
|
p03158 | C++ | #include<iostream>
#include<iomanip>
#include<vector>
#include<map>
#include<set>
#include<algorithm>
#include<numeric>
#include<limits>
#include<bitset>
#include<functional>
#include<type_traits>
#include<queue>
#include<stack>
#include<array>
#include<random>
#include<utility>
#include<boost/multi_array.hpp>
#include<boost/optional.hpp>
#include<boost/range/irange.hpp>
#include<boost/range/algorithm.hpp>
#include<boost/range/adaptors.hpp>
#include<boost/range/numeric.hpp>
#ifdef _MSC_FULL_VER
#include"randomizer.hpp"
#include"debug_print.hpp"
#endif
#include<cstdlib>
#include<ctime>
namespace lib
{
template<class T>using pair = std::pair<T, T>;
template<class T>constexpr T pow(T base, std::uint64_t p)
{
T ret = T(1);
for (std::uint64_t i = 0; i <= 63; ++i)
{
if (((1ull << i) & p) != 0)
{
ret *= base;
}
base *= base;
}
return ret;
}
template<class T>using p_queue = std::priority_queue<T, std::vector<T>, std::greater<>>;
struct union_find
{
std::vector<int> upper;
union_find(std::size_t size):upper(size, -1) {}
int group(int index)
{
if (upper[index] == -1)
{
return index;
}
else
{
return upper[index] = group(upper[index]);
}
}
bool merge(int x, int y)
{
auto gx = group(x);
auto gy = group(y);
if (gx != gy)
{
upper[gx] = gy;
return true;
}
return false;
}
auto get()
{
std::map<int, std::set<int>> ret;
for (int i = 0; i < upper.size(); ++i)
{
ret[group(i)].emplace(i);
}
return ret;
}
auto tops()
{
std::set<int> ret;
for (int i = 0; i < upper.size(); ++i)
{
ret.emplace(group(i));
}
return ret;
}
bool is_same_group(int x, int y)
{
return group(x) == group(y);
}
};
}
namespace out
{
namespace detail
{
template<class>struct void_out
{
typedef void type;
};
template<class T>auto write(std::ostream& ost, T const& val)
->typename void_out<decltype(ost << val)>::type
{
ost << val;
}
template<class T, class... Ts>void write(std::ostream& ost, T const& val, Ts const&... nexts)
{
write(ost, val);
ost << " ";
write(ost, nexts...);
}
}
void write_line()
{
std::cout << std::endl;
}
template<class...Ts>void write_line(Ts const&... args)
{
detail::write(std::cout, args...);
write_line();
}
template<class Range>void write_range(Range const& rng)
{
for (auto const& v : rng)
{
write_line(v);
}
}
}
namespace adaptor = boost::adaptors;
void Main()
{
int N, Q;
std::cin >> N >> Q;
std::vector<std::int64_t> rest(N + 1);
std::vector<std::int64_t> tops(N);
std::vector<std::int64_t> cards(N);
std::int64_t x = 0, y = 0;
for (int i : boost::irange(0, N))
{
std::int64_t a;
std::cin >> a;
cards[i] = a;
x += a;
rest[i + 1] = x;
std::swap(x, y);
}
x = 0;
for (int i : boost::irange(0, N) | adaptor::reversed)
{
x += cards[i];
tops[i] = x;
}
for (int q : boost::irange(0, Q))
{
std::int64_t X;
std::cin >> X;
int min = 1, max = N / 2 + 2;
while (max - min > 1)
{
auto mid = (max + min) / 2;
auto target = cards[N - mid];
if (target < X)
{
max = mid;
continue;
}
auto left = boost::range::lower_bound(cards, 2 * X - target);
auto right = boost::range::lower_bound(cards, target);
auto a = right - left;
if (mid <= a + 1)
{
min = mid;
}
else
{
max = mid;
}
}
auto sum = tops[N - min];
auto a = std::min<int>(min, N - min);
sum += rest[N - min - a];
out::write_line(sum);
}
}
int main()
{
std::cin.tie(nullptr);
std::cin.sync_with_stdio(false);
std::cout << std::fixed << std::setprecision(15);
Main();
}
|
p03158 | C++ | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int Szukaj(vector<ll>& a, int x)
{
int l = 0, p = a.size() - 1, s, r = -1;
while (l <= p)
{
s = (l + p) / 2;
if (a[s] >= x)
{
r = s;
p = s - 1;
}
else
l = s + 1;
}
return r;
}
int main()
{
ios_base::sync_with_stdio(0);
int n, q;
cin >> n >> q;
vector<ll> a(n);
for (int i = 0; i < n; ++i)
cin >> a[i];
vector<ll> parz(n), nieparz(n);
for (int i = 0; i < n; ++i)
{
if (i == 0)
{
parz[0] = a[0];
nieparz[0] = 0;
}
if (i == 1)
{
parz[1] = parz[0];
nieparz[1] = a[1];
}
if (i >= 2)
{
if (i % 2 == 0)
{
parz[i] = parz[i - 1] + a[i];
nieparz[i] = nieparz[i - 1];
}
else
{
parz[i] = parz[i - 1];
nieparz[i] = nieparz[i - 1] + a[i];
}
}
}
vector<ll> suf(n);
suf[n - 1] = a[n - 1];
for (int i = n - 2; i >= 0; --i)
suf[i] = suf[i + 1] + a[i];
for (int i = 0; i < q; ++i)
{
int x;
cin >> x;
if (x > a[n - 1])
{
if ((n - 1) % 2 == 0)
cout << parz[n - 1];
else
cout << nieparz[n - 1];
cout << endl;
continue;
}
int pier = Szukaj(a, x);
int l = pier, p = n - 1, s, r = -1;
while (l <= p)
{
s = (l + p) / 2;
int dl_suf = n - s;
int R = a[s] - x;
int ile = s - pier + 1;
int nr = Szukaj(a, x - R);
if (nr < pier && nr != -1)
ile += (pier - 1) - nr + 1;
if (ile - 1 >= dl_suf - 1)
{
r = s;
p = s - 1;
}
else
l = s + 1;
}
ll odp = suf[r];
int dl_suf = n - r;
int nast = r - dl_suf - 1;
if (nast >= 0)
{
if (nast % 2 == 0)
odp += parz[nast];
else
odp += nieparz[nast];
}
cout << odp;
cout << endl;
}
return 0;
}
|
p03158 | C++ | #include <map>
#include <set>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#define ll long long
std::set<int> S;
std::set<int>::iterator it;
int now;
int n, Q;
int p[111111];
struct Qry{
int x, num;
bool operator <(const Qry &a)const{
return x > a.x;
}
}q[111111];
bool vis[111111];
int work(int X){
if(X <= p[1]) return n / 2 + 1;
if(X >= p[n]) return n;
int sm = 0, l, r, rr = n;
for(int i = 1; i <= n; i++)
if(p[i] >= X) {r = i; break;}
l = r - 1;
p[0] = -1000000007;
while(1){
if(vis[rr]) return rr + 1;
vis[rr] = true, rr--;
if(vis[rr]) return rr + 1;
if(p[r] - X < X - p[l]){
if(vis[r]) return r;
vis[r] = 1, r++;
}
else vis[l] = 1, l--;
}
}
ll pre[111111];
ll suf[111111];
ll ans[111111];
int main(){
scanf("%d %d", &n, &Q);
for(int i = 1; i <= n; i++) scanf("%d", &p[i]);
pre[1] = p[1];
for(int i = 1; i <= n; i++)
pre[i] = pre[i - 2] + p[i];
for(int i = n; i; i--) suf[i] = suf[i + 1] + p[i];
for(int i = 1; i <= Q; i++) scanf("%d", &q[i].x), q[i].num = i;
std::sort(q + 1, q + Q + 1);
int now = work(q[1].x);
ans[q[1].num] = suf[now] + ((2 * now - n - 2 >= 0) ? (pre[2 * now - n - 2]) : 0);
for(int i = 2; i <= Q; i++){
if(q[i].x <= p[1]) now = n / 2 + 1;
if(now <= n / 2 + 1) ans[q[i].num] = suf[now];
else{
int bg = 2 * now - n - 2;
while(bg && q[i].x - p[bg] <= p[now - 1] - q[i].x)
now--, bg = 2 * now - n - 2;
ans[q[i].num] = suf[now] + pre[bg];
}
}
for(int i = 1; i <= Q; i++) printf("%lld\n", ans[i]);
return 0;
} |
p03158 | C++ | #include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#define int long long
using namespace std;
int n, q;
int a[100000];
int SS;
int kisuu[100000], guusuu[100000];
int mix[100001];
signed main() {
cin >> n >> q;
for (int i = 0; i < n; i++)cin >> a[i];
for (int i = n - 1; i >= n / 2; i--)SS += a[i];
kisuu[1] = a[1]; guusuu[0] = a[0];
for (int i = 2; i < n; i+=2) {
guusuu[i] = guusuu[i - 2] + a[i];
}
for (int i = 3; i < n; i += 2) {
kisuu[i] = kisuu[i - 2] + a[i];
}
for (int i = 1; i <= n; i++) {
mix[i] = mix[i - 1] + a[i - 1];
}
for (int i = 0; i < q; i++) {
int k; cin >> k;
if (k >= a[n - 1]) {
cout << max(kisuu[n - 1], guusuu[n - 1]) << endl;
continue;
}
if (k <= a[0]) {
cout << SS << endl;
continue;
}
int L = 0, R = n;
while (R - L > 1) {
int T = (L + R) / 2;
if (a[T-1] <= k) {
L = T;
continue;
}
// a[T]>k
int l = -1, r = n-1;
while (r - l > 1) {
int t = (l + r) / 2;
if (a[T-1] - k >= k - a[t]) {
r = t;
}
else {
l = t;
}
}
if ((T - r) >= (n - T+1)) {
R = T;
}
else {
L = T;
}
}
int SSS = L * 2 - n;
int ans = mix[n] - mix[L];
SSS--;
if (SSS >= 0) {
ans += max(guusuu[SSS], kisuu[SSS]);
}
cout << ans << endl;
}
} |
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for(int i=0; i<(n); ++i)
#define FOR(i, a, b) for(int i=(a); i<(b); ++i)
#define FORR(i, a, b) for(int i=(b)-1; i>=(a); --i)
#define DEBUG(x) cout<<#x<<": "<<x<<'\n'
#define DEBUG_VEC(v) cout<<#v<<":";REP(i, v.size())cout<<' '<<v[i];cout<<'\n'
#define ALL(a) (a).begin(), (a).end()
#define CHMIN(a, b) a=min((a), (b))
#define CHMAX(a, b) a=max((a), (b))
const ll MOD=1000000007ll;
// const ll MOD=998244353ll;
#define FIX(a) ((a)%MOD+MOD)%MOD
const double EPS=1e-11;
#define EQ0(x) (abs((x))<EPS)
#define EQ(a, b) (abs((a)-(b))<EPS)
int n, q;
ll a[114514], x;
ll sum[114514], sum2[114514];
bool is_ok(int y){
int ind=2*y-n+2;
if(ind>0){
return abs(x-a[y])<abs(x-a[ind-1]);
}
else{
return y<n/2;
}
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cin>>n>>q;
REP(i, n){
cin>>a[i];
sum[i+1]=sum[i]+a[i];
if(i&1){
sum2[i+1]=sum2[i-1]+a[i];
}
}
REP(i, q){
cin>>x;
int lb=0, ub=n-1;
while(ub-lb>1){
int mid=(lb+ub)/2;
if(is_ok(mid)){
lb=mid;
}
else{
ub=mid;
}
}
// DEBUG(lb);
ll ans=sum[n]-sum[lb+1];
int ind=2*lb-n+2;
if(ind>0){
if(ind&1){
ans+=sum[ind]-sum2[ind-1];
}
else{
ans+=sum2[ind];
}
}
cout<<ans<<'\n';
}
return 0;
}
|
p03158 | C++ | #include<stdio.h>
#include<math.h>
int main(){
int n;
int q;
int a[100000];
long long int y[100000][2];
for(int i=0;i<100000;i++){
a[i]=0;
y[i][1]=0;//x>= notoki
y[i][0]=0;//ga ans
}
scanf("%d %d\n",&n,&q);
for(int i=0;i<n;i++){
scanf("%d\n", &a[i]);
}
for(int i=n-1; i>=0;i=i-2){
y[n-1][0]+=a[i];
}
y[n-1][1]=(a[n-2]+a[n-3]+2)/2;
for(int i=1; n-2*i-1>=0;i++){
y[n-i-1][0]=y[n-i][0]+a[n-i-1]-a[n-2*i-1];
}
for(int i=1; n-2*i-3>=0;i++){
y[n-i-1][1]=(a[n-i-2]+a[n-2*i-3]+2)/2;
}
int x=0;
// int ord=0;
// int nn=0;
// while(nn<<=n)
for(int i=0;i<q;i++){
scanf("%d\n",&x);
int min=0;
int max=n-1;
int mid=0;
int count=0;
while(min!=max&&count<20){
mid=(min+max)/2;
if(x>=y[mid][1]){
min=mid;
}else{
max=mid;
}
count++;
}
if(x>=y[max][1]){
printf("%lld\n", y[max][0]);
}else{
printf("%lld\n", y[min][0]);
}
}
} |
p03158 | C++ | #include <iostream>
#include <sstream>
#include <fstream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include <utility>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <stdio.h>
#include <string.h>
using namespace std;
static const double EPS = 1e-9;
template<class T> bool INRANGE(T x, T a, T b) { return a <= x && x <= b; }
template<class T> void amin(T &a, T v) { if (a > v) a = v; }
template<class T> void amax(T &a, T v) { if (a < v) a = v; }
int ROUND(double x) { return (int)(x + 0.5); }
bool ISINT(double x) { return fabs(ROUND(x) - x) <= EPS; }
bool ISEQUAL(double x, double y) { return fabs(x - y) <= EPS * max(1.0, max(fabs(x), fabs(y))); }
double SQSUM(double x, double y) { return x * x + y * y; }
#define PI (acos(-1))
#define ARRAY_NUM(a) (sizeof(a)/sizeof(a[0]))
#define NG (-1)
#define BIG ((int)1e9+10)
#define BIGLL ((ll)4e18)
#define SZ(a) ((int)(a).size())
#define SQ(a) ((a)*(a))
typedef unsigned long long ull;
typedef long long ll;
// ≦X の要素数を求める。
template <class T>
int numLTE(const vector <T>& v, T x)
{
return upper_bound(v.begin(), v.end(), x) - v.begin();
}
int main()
{
int N, Q;
scanf("%d %d", &N, &Q);
vector <ll> a(N);
vector <ll> basex(Q);
for (int i = 0; i < N; ++i)
{
scanf("%lld ", &a[i]);
}
for (int i = 0; i < Q; ++i)
{
scanf("%lld ", &basex[i]);
}
sort(a.begin(), a.end());
const int M = (N + 1) / 2;
vector <ll> sum_hi(M+1);
vector <ll> sum_lo(M + 1);
for (int i = 0; i < M; ++i)
{
sum_hi[i + 1] = sum_hi[i] + a[N-1-i];
sum_lo[i + 1] = sum_lo[i] + a[N - 1 - 2 * i];
}
for (ll x : basex)
{
// 高橋君が上位何個まで取れるかを求める。
ll lo = 1;
ll hi = (N+1)/2;
while (lo<hi)
{
ll mid = lo + (hi - lo + 1) / 2LL; // +1 is necessary, otherwise infinite loop when only two elements.
// BEGIN CUT HERE
// cerr << " mid=" << mid << endl;
// END CUT HERE
ll y = a[N - mid]; // 高橋君がとろうとしている
// BEGIN CUT HERE
// cerr << " y=" << y << endl;
// END CUT HERE
ll aokiNum = 0;
if (x < y)
{
// [2x-y, y]
aokiNum = numLTE(a, y) - numLTE(a, 2*x-y-1);
}
else
{
// [y, 2x-y-1]
aokiNum = NG; // numLTE(a, 2 * x - y - 1) - numLTE(a, y - 1);
}
// chokudaiNum > aokiNum chokudai勝ち
// chokudaiNum = aokiNum chokudai勝ち
// chokudaiNum < aokiNum aoki勝ち
// BEGIN CUT HERE
// cerr << " mid=" << mid << " aokiNum=" << aokiNum << endl;
// END CUT HERE
if (!(mid <= aokiNum))
{
hi = mid - 1; // chokudaiさげる
}
else
{
lo = mid;
}
}
const ll chokuNum = lo;
ll ans = 0;
ll realAns = 0;
// BEGIN CUT HERE
// cerr << " chokuNum=" << chokuNum << endl;
// END CUT HERE
/*
for (int i = 0; i<chokuNum; ++i)
{
ans += a[N - 1 - i];
}
*/
realAns += sum_hi[chokuNum];
/*
for (int i = chokuNum; i<M; ++i)
{
ans += a[N - 1 - 2 * i];
}
*/
realAns += sum_lo[M] - sum_lo[chokuNum];
cout << realAns << endl;
}
#if 0
const int N = 11;
vector <int> a;
for (int i = 0; i < N; ++i)
{
a.push_back(2*i*i+3*i+4);
}
for (int x = -5; x < a.back()+5; ++x)
{
// BEGIN CUT HERE
cerr << " x=" << x << endl;
// END CUT HERE
vector <bool> used(N);
int sum = 0;
while (1)
{
{
int best = NG;
int bestID = NG;
for (int i = 0; i < N; i++)
{
if (!used[i] && a[i]>best)
{
best = a[i];
bestID = i;
}
}
if (bestID == NG) break;
printf("tkhs=%d, ", bestID);
sum += best;
used[bestID] = true;
}
{
int best = BIG;
int bestID = NG;
for (int i = 0; i < N; i++)
{
if (!used[i] && abs(a[i]-x)<best || (abs(a[i] - x)==best && a[i] < best))
{
best = abs(a[i] - x);
bestID = i;
}
}
if (bestID == NG) break;
printf("aoki=%d, ", bestID);
used[bestID] = true;
}
}
// BEGIN CUT HERE
cerr << " sum=" << sum << endl;
// END CUT HERE
}
#endif
return 0;
}
|
p03158 | C++ | ///////////////////////// _LeMur_
#include <algorithm>
#include <iostream>
#include <cstring>
#include <cassert>
#include <bitset>
#include <cstdio>
#include <vector>
#include <string>
#include <ctime>
#include <stack>
#include <queue>
#include <cmath>
#include <ctime>
#include <list>
#include <map>
#include <set>
using namespace std;
const int N = 100005;
const int inf = 1000 * 1000 * 1000;
const int mod = 1000 * 1000 * 1000 + 7;
int n , q;
int a[N];
long long suf[N];
long long pref[N];
int main(){
scanf("%d%d",&n,&q);
for(int i=1;i<=n;i++){
scanf("%d",&a[i]);
pref[i] = ((i == 1) ? 0 : pref[i - 2]) + a[i];
}
for(int i=n;i>=1;i--){
suf[i] = suf[i + 1] + a[i];
}
while(q--){
int x;
scanf("%d",&x);
int ina = 1 , inb = n , id = n + 1;
while(ina <= inb){
int mid = (ina + inb) / 2;
if(a[mid] >= x){
id = mid;
inb = mid - 1;
}
else
ina = mid + 1;
}
ina = id;
inb = n;
int pos1 = n + 1 , pos2 = n;
while(ina <= inb){
int mid = (ina + inb) / 2;
int delta = a[mid] - x;
int s = 1 , e = id - 1 , ind = id;
while(s <= e){
int m = (s + e) / 2;
if(x - a[m] <= delta){
ind = m;
e = m - 1;
}
else
s = m + 1;
}
int cnt = mid - ind;
if(cnt >= n - mid){
pos1 = mid;
pos2 = ind - 2 + cnt - n + mid;
inb = mid - 1;
}
else
ina = mid + 1;
}
printf("%lld\n",suf[pos1] + ((pos2 == -1) ? 0 : pref[pos2]));
}
return 0;
}
|
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef vector<int> vi;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define ALL(c) (c).begin(),(c).end()
#define dump(x) cout << #x << " = " << (x) << endl
const int MN = 100010;
int N, Q;
ll A[MN];
ll s[2][MN];
int main() {
cin >> N >> Q;
rep(i, N) {
cin >> A[i];
s[0][i + 1] = s[0][i];
s[1][i + 1] = s[1][i];
s[i & 1][i + 1] += A[i];
}
rep(i, Q) {
int X; cin >> X;
int lo = 1, hi = N;
while (hi - lo > 1) { //takahashi
int m = (lo + hi) / 2;
ll d = abs(A[N-m] - X);
int l = lower_bound(A, A + N - m, X - d) - A;
int r = lower_bound(A, A + N - m, X + d) - A;
if (r - l >= m-1) {
lo = m;
} else {
hi = m;
}
}
ll ans = s[0][N] + s[1][N] - s[0][N - lo] - s[1][N - lo];
if (N-lo*2>=1) {
int f = (N-1-lo*2) & 1;
ans += s[f][N-lo*2];
}
cout << ans << "\n";
}
return 0;
} |
p03158 | C++ | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define LLINF 1000000000000000ll
#define sz(x) ((int)(x).size())
#define fi first
#define sec second
#define all(x) (x).begin(),(x).end()
#define sq(x) ((x)*(x))
#define rep(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define repn(i,a,n) for(int (i)=(a);(i)<(int)(n);(i)++)
#define EQ(a,b) (abs((a)-(b))<eps)
template<class T> void chmin(T& a,const T& b){if(a>b)a=b;}
template<class T> void chmax(T& a,const T& b){if(a<b)a=b;}
int N,Q;
int A[100100];
int X[100100];
ll rui[100100];
ll U[100100];
int Count(int l,int r){ //[l,r]
if(r<l)return 0;
return upper_bound(A,A+N,r)-lower_bound(A,A+N,l);
}
int check(int k,int x){
int tar = A[N-k];
int b = abs(x-tar);
int c = Count(x-b,min(x+b,tar));
return c;
}
ll up(int i){
if(i==0)return U[N-1];
return U[N-1]-U[i-1];
}
int main(){
cin >> N >> Q;
for(int i=0;i<N;i++)scanf("%d",&A[i]);
for(int i=0;i<Q;i++)scanf("%d",&X[i]);
rui[0]=A[0];
rui[1]=A[1];
for(int i=2;i<N;i++)rui[i]=rui[i-2]+A[i];
U[0]=A[0];
for(int i=1;i<N;i++)U[i]=U[i-1]+A[i];
sort(A,A+N);
for(int i=0;i<Q;i++){
int l = 0 ,r = N+1;
while(r-l>1){
int mid = (l+r)/2;
if(check(mid,X[i])>mid)l=mid;
else r = mid;
}
//cout << "l : " << l << endl;
ll ans = up(N-l);
//cout << "up: " << up(N-l) << endl;
if(check(l+1,X[i])>l){
ans += A[N-l-1];
if(N>=2*(l+1)+1)ans += rui[N-2*(l+1)-1];
}else{
if(N>=2*l+1)ans += rui[N-2*l-1];
}
printf("%lld\n",ans);
}
return 0;
} |
p03158 | C++ | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define INF (1<<30)
#define INFLL (1ll<<60)
typedef pair<int, int> P;
typedef pair<int, P> E;
#define MOD (1000000007ll)
#define l_ength size
void mul_mod(ll& a, ll b){
a *= b;
a %= MOD;
}
void add_mod(ll& a, ll b){
b += MOD;
a += b;
a %= MOD;
}
vector<ll> v;
ll st[100100]={0ll},ss[100100]={0ll};
int main(void){
int n,q,i,s,t;
ll a,x,l,r,m,ans;
bool flag;
cin >> n >> q;
for(i=0; i<n; ++i){
cin >> a;
st[i+1] = st[i] + a;
if(i%2){
ss[i+1] = ss[i] + a;
}else{
ss[i+1] = ss[i];
}
v.push_back(a);
}
for(i=0; i<q; ++i){
cin >> x;
l = 0ll; r = INF;
flag = false;
while(r-l){
m = (l+r)/2;
if(flag){
m = r;
l = r;
}else if(r-l==1ll){
m = l;
flag = true;
}
s = (int)(lower_bound(v.begin(),v.end(),x-m)-v.begin());
t = (int)(lower_bound(v.begin(),v.end(),x+m)-v.begin());
if(t<n && v[t]==x+m){
++t;
if(t-s==n-t){
ans = st[n]-st[t]+max(st[s]-ss[s],ss[s]);
break;
}else if(t-s+1==n-t){
ans = st[n]-st[t]+min(st[s]-ss[s],ss[s]);
break;
}
--t;
}
if(t-s==n-t){
ans = st[n]-st[t]+max(st[s]-ss[s],ss[s]);
break;
}else if(t-s+1==n-t){
ans = st[n]-st[t]+min(st[s]-ss[s],ss[s]);
break;
}else if(t-s>n-t){
r = m;
}else{
l = m;
}
}
cout << ans << endl;
}
return 0;
}
|
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
const int Maxn = 1e5+7;
int n, q;
int a[Maxn];
long long s[Maxn], ss[Maxn];
int main()
{
cin >> n >> q;
for(int i = 1; i <= n; ++i)
{
cin >> a[i];
s[i] = (i-2 > 0 ? s[i-2] : 0)+a[i];
ss[i] = ss[i-1]+a[i];
}
for(int i = 1, x; i <= q; ++i)
{
cin >> x;
if(x >= a[n-1])
{
cout << s[n] << endl;
continue;
}
int l = 0, r = a[n]-x, pl, pr;
while(l < r)
{
int mid = (l+r+1)>>1;
pl = lower_bound(a+1, a+n, x-mid)-a;
pr = upper_bound(a+1, a+n, x+mid)-a;
if(pr-pl > n-pr+1) r = mid-1;
else l = mid;
}
pl = lower_bound(a+1, a+n, x-l)-a;
pr = upper_bound(a+1, a+n, x+l)-a;
if(n-pr == pr-pl) cout << (ss[n]-ss[pr-1])+(pl-2 > 0 ? s[pl-2] : 0) << endl;
else if(pr-pl == n-pr+1) cout << (ss[n]-ss[pr-1])+(pl-1 > 0 ? s[pl-1] : 0) << endl;
else if(pr-pl == n-pr-1)
{
// choose pr
if(pl-1 < 1 || x-a[pl-1] > a[pr]-x)
cout << (ss[n]-ss[pr])+(pl-1 > 0 ? s[pl-1] : 0) << endl;
else // choose pl
cout << (ss[n]-ss[pr-1])+(pl-3 > 0 ? s[pl-3] : 0) << endl;
}
}
return 0;
} |
p03158 | C++ | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
using namespace std;
#define mod 1000000007
#define FOR(x,to) for(int x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
#define long long long
inline int rei(){int x;cin>>x;return x;}
inline long rel(){long x;cin>>x;return x;}
inline string res(){string x;cin>>x;return x;}
//-------------------------------------------------------
long A[100000];
int N;
int minOver(long X){
int bf = 0;
int bl = N;
while(bf != bl){
long bc = (bf+bl)/2;
if(bc == N || (A[bc] >= X)){
bl = bc;
}
else{
bf = bc+1;
}
}
return bf;
}
int maxBelow(long X){
int bf = -1;
int bl = N-1;
while(bf != bl){
long bc = (bf+bl+1)/2;
if(bc == -1 || (A[bc] <= X)){
bf = bc;
}
else{
bl = bc-1;
}
}
return bf;
}
long evensum[100001];
long oddsum[100001];
void Calc(){
N = rei();
int Q = rei();
for(int i=0;i<N;i++){
A[i] = rel();
}
for(int i=0;i<N;i++){
if(i % 2){
oddsum[i+1] = A[i];
}
else{
evensum[i+1] = A[i];
}
oddsum[i+1] += oddsum[i];
evensum[i+1] += evensum[i];
}
for(int query=0;query<Q;query++){
long X = rel();
int bf = 1;
int bl = (N+1)/2;
while(bf != bl){
int bc = (bf+bl+1)/2;
if(max(A[N-2*bc+1]-X,X-A[N-2*bc+1]) <= max(A[N-bc]-X,X-A[N-bc])){
bf = bc;
}
else{
bl = bc-1;
}
}
long ans = oddsum[N] + evensum[N]- oddsum[N-bf] - evensum[N-bf];
if(N > 2*bf){
if(N % 2 == 0){
ans += oddsum[N-2*bf];
}
else{
ans += evensum[N-2*bf];
}
}
cout << ans << endl;
}
}
int main(int argc,char** argv){
ios::sync_with_stdio(false), cin.tie(0);
cout.tie(0); Calc(); 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 = upper_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<bits/stdc++.h>
using namespace std;
int main(){
long long N, Q;
scanf("%lld%lld", &N, &Q);
vector<long long> A(N), AS(N + 2), S(N + 1), X((N - 1) / 2), a((N + 1) / 2);
for(int i = 0; i < N; ++i){
scanf("%lld", &A[i]);
AS[i + 2] = A[i] + AS[i];
S[i + 1] = A[i] + S[i];
}
for(int i = 1; i <= (N + 1) / 2; ++i){
a[i - 1] = S[N] - S[N - i] + AS[N - i * 2 + 1];
}
for(int i = 1; i <= (N - 1) / 2; ++i){
X[i - 1] = A[N - i - 1] + A[N - i * 2 - 1];
}
reverse(a.begin(), a.end());
reverse(X.begin(), X.end());
for(long long i = 0, x = 0; i < Q; ++i){
scanf("%lld", &x);
printf("%lld\n", a[lower_bound(X.begin(), X.end(), x * 2) - X.begin()]);
}
return 0;
} |
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define debug(a) cout << #a << ": " << a << endl
#define debuga1(a, l, r) fto(i, l, r) cout << a[i] << " "; cout << endl
#define fdto(i, r, l) for(int i = (r); i >= (l); --i)
#define fto(i, l, r) for(int i = (l); i <= (r); ++i)
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define sz(a) (int)a.size()
const double PI = acos(-1.0);
double fRand(double fMin, double fMax)
{
double f = (double)rand() / RAND_MAX;
return fMin + f * (fMax - fMin);
}
template <class T>
T min(T a, T b, T c) {
return min(a, min(b, c));
}
template <class T>
T max(T a, T b, T c) {
return max(a, max(b, c));
}
const int MAXN = 100005;
int n, q, a[MAXN];
ll pre2[MAXN], suf[MAXN];
int main () {
scanf("%d%d", &n, &q);
fto(i, 1, n) scanf("%d", &a[i]);
pre2[1] = a[1];
fto(i, 2, n)
pre2[i] = pre2[i-2] + a[i];
fdto(i, n, 1)
suf[i] = suf[i+1] + a[i];
fto(i, 1, q) {
int x; scanf("%d", &x);
ll lo = 0, hi = 2000000000;
int resL = n+1, resR = n;
while (lo <= hi) {
ll mid = (lo + hi)/2;
int l = x - (mid+1)/2, r = x + mid/2;
int posL = lower_bound(a+1, a+n+1, l) - a;
int posR = upper_bound(a+1, a+n+1, r) - a - 1;
int k = posR - posL + 1;
if (n - k >= posR) {
lo = mid + 1;
resL = posL;
resR = posR;
} else
hi = mid - 1;
}
ll ans = suf[resR + 1];
int k = resR - resL + 1;
if (n - k == resR)
ans += pre2[resL-1];
else if (resL > 1)
ans += pre2[resL-2];
printf("%lld\n", ans);
}
return 0;
}
|
p03158 | C++ | #include<iomanip>
#include<limits>
#include<thread>
#include<utility>
#include<iostream>
#include<string>
#include<algorithm>
#include<set>
#include<map>
#include<vector>
#include<stack>
#include<queue>
#include<cmath>
#include<numeric>
#include<cassert>
#include<random>
#include<chrono>
#include<unordered_map>
#include<fstream>
#include<list>
#include<functional>
#include<bitset>
#include<complex>
#include<tuple>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
typedef pair<ll,ll> pll;
typedef pair<int,int> pi;
typedef pair<double,double> pd;
typedef pair<double,ll> pdl;
#define F first
#define S second
const ll E=1e18+7;
const ll MOD=1000000007;
int main(){
ll n,q;
cin>>n>>q;
vector<ll> a(n);
for(auto &i:a){cin>>i;}
sort(a.begin(),a.end());
vector<ll> sum(n,0);
vector<ll> sum2(n,0);
sum[0]=a[0];
sum2[0]=a[0];
sum2[1]=a[1];
for(int i=1;i<n;i++){sum[i]=a[i]; sum[i]+=sum[i-1];}
for(int i=2;i<n;i++){sum2[i]=a[i]; sum2[i]+=sum2[i-2];}
while(q--){
ll x;
cin>>x;
if(x>=a.back()){cout<<sum2.back()<<endl; continue;}
ll l=1,r=n;
while(r-l>3){
ll m=l+(r-l)/2;
if(m&1){
ll k=a[n-m/2-1];
ll L=lower_bound(a.begin(),a.end(),x-(k-x))-a.begin();
if(n-L>=m){l=m;}
else{r=m-1;}
}
else{
ll k=a[n-m/2];
ll L=lower_bound(a.begin(),a.end(),x-(k-x))-a.begin();
if(n-L>=m){l=m;}
else{r=m-1;}
}
}
//cout<<x<<" "<<l<<" "<<r<<endl;
for(ll i=r;i>=l;i--){
if(i&1){
ll k=a[n-i/2-1];
ll L=lower_bound(a.begin(),a.end(),x-(k-x))-a.begin();
if(n-L>=i){
ll ans=sum.back();
if(n-i/2-2>=0){
ans-=sum[n-i/2-2];
}
if(n-i-2>=0){ans+=sum2[n-i-2];}
cout<<ans<<endl;
break;
}
else{continue;}
}
else{
ll k=a[n-i/2];
ll L=lower_bound(a.begin(),a.end(),x-(k-x))-a.begin();
if(n-i/2-L>=i/2){
ll ans=sum.back();
if(n-i/2-1>=0){
ans-=sum[n-i/2-1];
}
if(n-i-1>=0){ans+=sum2[n-i-1];}
cout<<ans<<endl;
break;
}
else{continue;}
}
}
}
return 0;
}
|
p03158 | C++ | #include <string>
#include <vector>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <map>
#include <list>
#include <set>
#include <numeric>
#include <queue>
#include <stack>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <cstring>
#include <climits>
#include <cfloat>
#include <ctime>
#include <complex>
#include <cassert>
#include <array>
#include <bitset>
#include <unordered_map>
#include <random>
using namespace std;
typedef long long LL;
typedef pair<int,int> P;
const int L=1e5+2;
LL A[L];
LL B[L];
LL C[L];
int main() {
int N,Q;
cin >> N >> Q;
for(int i=1;i<=N;i++){
cin >> A[i];
}
B[1]=C[1]=A[1];
for(int i=2;i<=N;i++){
B[i]+=A[i]+B[i-2];
C[i]+=A[i]+C[i-1];
}
for(int i=0;i<Q;i++){
int X;
cin >> X;
if(abs(X-A[N-1])>abs(X-A[N])){
//cerr << "a" << endl;
cout << B[N] << endl;
continue;
}
LL low=0,hi=(N+1)/2+1;
LL m;
while(low+1<hi){
m=(low+hi)/2;
//cerr << m << endl;
if(A[N-m+1]<=X){
hi=m;
continue;
}
if(abs(X-A[N-m+1])<abs(X-A[N-2*m+2])){
hi=m;
continue;
}
low=m;
}
m=low;
LL r=C[N]-C[N-m];
if(N-2*m>0){
r+=B[N-2*m];
}
cout << r << endl;
#if 0
if(X==N||X==N-1){
cerr << "a" << endl;
cout << B[N] << endl;
}
else if(X<=N/4)
{
cerr << "b" << endl;
cout << C[N]-C[N/2] << endl;
}
else{
int low=0,hi=N+1;
while(low+1<hi){
int m=((LL)low+hi)/2;
if(X+(m-1)/2<N-m+1){
low=m;
}
else{
hi=m;
}
}
LL r=0;
if(X+(low-1)/2+1<N-low+1){
r+=C[N]-C[X+(low-1)/2];
if(low/2-2>0){
r+=B[low/2-2];
}
cerr << "c" << endl;
}
else{
r+=C[N]-C[X+(low-1)/2];
if(low/2-1>0){
r+=B[low/2-1];
}
cerr << "d" << endl;
}
cout << r << endl;
}
#endif
}
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;
}
vector<int64_t> border(n);
for (auto i : irange(0L, n)) {
if (i == n - 1) {
border[i] = (1L << 40);
continue;
}
auto k = (n - i + 1) / 2;
auto b = (i == 0 ? -(1L << 40) : a[i - 1]);
auto c = a[i];
auto d = a[n - k - 1];
auto e = a[n - k];
// auto xs = max({1, b + 1, (b + d) / 2 + 1});
auto xe = min({e - 1, (c + e) / 2});
border[i] = xe;
}
for (auto _ : irange(0L, q)) {
int64_t x;
cin >> x;
auto it = partition_point(border.begin(), border.end(), [x](int64_t b) {
return b < x;
});
auto i = it - border.begin();
auto k = (n - i + 1) / 2;
// cerr << i << " " << k << endl;
int64_t ans = 0;
ans += sum.back() - sum[n - k - 1];
// cerr << ans << endl;
// cerr << sum[n - k - 1] << endl;
if (n - 2 * k == i) {
if (i > 0) {
ans += psum[i - 1];
}
} else if (i >= 2) {
ans += psum[i - 2];
}
cout << ans << endl;
}
} |
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
#define fst(t) std::get<0>(t)
#define snd(t) std::get<1>(t)
#define thd(t) std::get<2>(t)
#define unless(p) if(!(p))
#define until(p) while(!(p))
using ll = long long;
using P = std::tuple<int,int>;
const int dx[8] = {-1, 1, 0, 0, -1, -1, 1, 1}, dy[8] = {0, 0, -1, 1, -1, 1, -1, 1};
int N, Q;
ll A[100100], B[100100], C[100100];
int X;
int main(){
std::cin.tie(nullptr);
std::ios::sync_with_stdio(false);
std::cin >> N >> Q;
for(int i=0;i<N;++i){
std::cin >> A[i];
}
B[0] = A[0];
B[1] = A[1];
for(int i=2;i<N;++i){
B[i] = A[i] + B[i-2];
}
for(int i=N-1;i>=0;--i){
C[i] = A[i] + C[i+1];
}
for(int i=0;i<Q;++i){
std::cin >> X;
int lb = 0, ub = N + 1;
while(ub - lb > 1){
int m = (lb + ub) / 2;
int a = (m + 1) / 2, b = m - a;
bool can = true;
if(A[N-a] <= X){
if(b > 0){
can = false;
}
}else{
int s = std::lower_bound(A, A+N, X - (A[N-a] - X)) - A;
if((N - a) - s < b){
can = false;
}
}
if(can){
lb = m;
}else{
ub = m;
}
}
int a = (lb + 1) / 2;
ll res = C[N-a];
if(lb % 2 == 0){
if(N - lb - 1 >= 0){
res += B[N - lb - 1];
}
}else{
if(N - lb - 2 >= 0){
res += B[N - lb - 2];
}
}
std::cout << res << std::endl;
}
} |
p03158 | C++ | #include<cstdio>
#include<algorithm>
#include<cstring>
#define ll long long
using namespace std;
int n,a[100005],q;
ll sum1[100005],sum0[100005];
int ask(ll v)
{
int l=1,r=n;
while(l<=r)
{
int mid=l+r>>1;
if(a[mid]<v)l=mid+1;
else r=mid-1;
}
return l;
}
void work(int v)
{
int l=1,r=n+1;
while(l<=r)
{
int mid=l+r>>1;
if(a[mid]<v)l=mid+1;
else if(mid-ask(2*v-a[mid])+1<n-mid)l=mid+1;
else if(mid-ask(2*v-a[mid])+1>n-mid)r=mid-1;
else
{
r=mid;
break;
}
// printf("mid=%d->%d %d\n",mid,l,r);
}
int p=2*r-n+1;
if(p<1)p=1;
if(p>r)p=r;
// printf("l=%d r=%d\n",p,r);
ll ans=sum1[n]+sum0[n]-sum1[r]-sum0[r];
// printf("%lld ",ans);
ans+=((p&1)^(n-p+1&1)?sum0[p-1]:sum1[p-1]);
printf("%lld\n",ans);
}
int main()
{
scanf("%d%d",&n,&q);
for(int i=1;i<=n;i++)
{
scanf("%d",&a[i]);
sum1[i]=sum1[i-1],sum0[i]=sum0[i-1];
if(i&1)sum1[i]+=a[i];
else sum0[i]+=a[i];
}
sum1[n+1]=sum1[n],sum0[n+1]=sum0[n];
while(q--)
{
int v;
scanf("%d",&v);
work(v);
}
return 0;
} |
p03158 | C++ | #include<bits/stdc++.h>
using namespace std;
int main(){
long long N, Q;
scanf("%lld%lld", &N, &Q);
vector<long long> A(N), AS(N + 2), S(N + 1), X((N - 1) / 2), a((N + 1) / 2);
for(int i = 0; i < N; ++i){
scanf("%lld", &A[i]);
AS[i + 2] = A[i] + AS[i];
S[i + 1] = A[i] + S[i];
}
for(int i = 1; i <= N / 2; ++i){
a[i - 1] = S[N] - S[N - i] + AS[N - i * 2 + 1];
}
if(N & 1)*a.rbegin() = S[N] - S[N - (N + 1) / 2];
for(int i = 1; i <= (N - 1) / 2; ++i){
X[i - 1] = A[N - i - 1] + A[N - i * 2 - 1];
}
reverse(a.begin(), a.end());
reverse(X.begin(), X.end());
for(auto i : a) ++i; //It does not work without this line(I do not know why).
for(long long i = 0, x = 0; i < Q; ++i){
scanf("%lld", &x);
auto tmp = min<long long>((N - 1) / 2, lower_bound(X.begin(), X.end(), x * 2) - X.begin());
printf("%lld\n", a[tmp]);
}
return 0;
} |
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double lf;
typedef long double Lf;
typedef pair <int,int> pii;
typedef pair <ll, ll> pll;
#define TRACE(x) cerr << #x << " " << x << endl
#define FOR(i, a, b) for (int i = (a); i < int(b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define _ << " " <<
#define fi first
#define sec second
#define mp make_pair
const int MAXN = 100100;
int n, q;
ll p[MAXN], pref[MAXN], pref1[MAXN][2];
pair <ll, int> X[MAXN];
ll get(int a, int b) {
return pref[b] - pref[a - 1];
}
pii get_int(int k, ll x) {
ll lo = 0, hi = 1e9, mid;
while (lo != hi) {
mid = (lo + hi) / 2;
int vece = upper_bound(p + 1, p + n + 2, x + mid) - p;
int manje = lower_bound(p + 1, p + n + 2, x - mid) - p;
if (vece - manje >= k) hi = mid;
else lo = mid + 1;
}
int R = upper_bound(p + 1, p + n + 2, x + lo) - p;
int L = lower_bound(p + 1, p + n + 2, x - lo) - p;
R--;
if (R - L + 1 > k) R--;
return {L, R};
}
pii pom[MAXN];
int pom1[MAXN];
ll solve(int t) {
if (pom[t].fi == 0) {
return pref1[n][n % 2];
}
int L = pom[t].fi;
int R = pom[t].sec;
int poz = n - pom1[t] + 1;
ll ret = get(poz, n);
if (poz - R > 1) {
ret += p[poz - 1];
if (L - 2 > 0) ret += pref1[L - 2][L % 2];
}
else {
ret += pref1[L - 1][!(L % 2)];
}
return ret;
}
ll ans[MAXN];
int main() {
scanf("%d %d",&n,&q);
REP(i, n) scanf("%lld",&p[i + 1]);
REP(i, q) {
scanf("%lld",&X[i].fi);
X[i].sec = i;
}
sort(X, X + q);
FOR(i, 1, n + 1) {
pref[i] = pref[i - 1] + p[i];
REP(j, 2) pref1[i][j] = pref1[i - 1][j];
pref1[i][i % 2] += p[i];
}
p[n + 1] = 1e9 + 200;
reverse(X, X + q);
int tmp = 0;
REP(i, q) {
if (X[i].fi >= p[n]) continue;
int L, R;
do {
tmp++;
auto T = get_int(tmp, X[i].fi);
L = T.fi;
R = T.sec;
//TRACE(tmp _ X[i].fi _ L _ R _ n -tmp + 1);
} while (R < n - tmp + 1);
tmp--;
//TRACE(X[i].fi _ tmp);
pom[X[i].sec] = get_int(tmp, X[i].fi);
pom1[X[i].sec] = tmp;
}
REP(i, q) ans[i] = solve(i);
REP(i, q) printf("%lld\n",ans[i]);
return 0;
}
|
p03158 | C++ | #include <cstdio>
#include <algorithm>
#include <cmath>
using namespace std;
const int N=200005;
int n,q;
long long a[N],x;
long long p[N],s[N];
long long l,r;
int get(long long x,int k)
{
if (!k)
return n;
int l=1;
int r=n-k+1;
while (l<r)
{
int mid=(l+r+1)>>1;
if (x>=a[mid])
{
if (x-a[mid-1]<=a[mid+k-1]-x)
r=mid-1;
else
l=mid;
}
else
if (a[mid-1]<x&&abs(x-a[mid-1])>abs(a[mid+k-1]-x))
l=mid;
else
r=mid-1;
}
return r+k-1;
}
int main()
{
scanf("%d%d",&n,&q);
for (int i=1;i<=n;i++)
{
scanf("%lld",&a[i]);
s[i]=s[i-1]+a[i];
}
for (int i=1;i<=n;i++)
if ((n^i)&1)
p[i]=p[i-1]+a[i];
else
p[i]=p[i-1];
while (q--)
{
scanf("%lld",&x);
l=0;
r=n/2;
while (l<r)
{
int mid=(l+r+1)>>1;
if (get(x,mid)<n-mid+1)
l=mid;
else
r=mid-1;
}
int c=get(x,r);
printf("%lld\n",s[n]-(s[c]-s[c-r]+p[c-r]));
}
return 0;
} |
p03158 | C++ | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAX=1e6+5;
ll n,m,x;
ll a[MAX];
ll sum[2][MAX];
ll pre[MAX];
int main()
{
while(cin>>n>>m)
{
for(int i=1;i<=n;i++)scanf("%lld",&a[i]);
sort(a+1,a+1+n);
for(int i=1;i<=n;i++)
{
pre[i]=pre[i-1]+a[i];
sum[i%2][i]=a[i];
sum[0][i]+=sum[0][i-1];
sum[1][i]+=sum[1][i-1];
}
while(m--)
{
scanf("%lld",&x);
ll l=1,r=n,mid;
while(l<r)
{
mid=(l+r)>>1;
ll j=mid-(n-mid);//second的最左端
if(j<1||a[mid]-x<x-a[j])l=mid+1;
else r=mid;
}
ll en=r-(n-r);
// cout<<"::: "<<en<<" "<<r<<endl;
ll ans=pre[n]-pre[r-1];
ans+=sum[en%2][en-1];
printf("%lld\n",ans);
}
}
}
|
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
using vi = vector<i64>;
using vvi = vector<vi>;
int main() {
int n, q;
cin >> n >> q;
vi as(n), bs(n + 1);
for (int i = 0; i < n; i++) {
cin >> as[i];
if (i % 2 == 0) {
bs[i + 1] = as[i];
}
}
vi sum(as);
sum.insert(sum.begin(), 0);
for (int i = 1; i <= n; i++) {
sum[i] += sum[i - 1];
bs[i] += bs[i - 1];
}
// [a, b)
auto get_sum = [&](int a, int b) {
return sum[b] - sum[a];
};
while (q--) {
int x;
cin >> x;
int l = 0, r = n / 2 + 1;
while (l < r - 1) {
int m = (l + r) / 2;
int tak = as[n - m];
int aok = as[n - 2 * m];
if (abs(aok - x) <= abs(x - tak)) {
l = m;
} else {
r = m;
}
}
if (2 * l == n) {
cout << get_sum(l, n) << '\n';
continue;
}
i64 s = get_sum(n - l, n);
if (abs(as[n - 2 * l - 1] - x) <= abs(as[n - l - 1] - x)) {
i64 ans = as[n - l - 1];
i64 tmp = 0;
// for (int j = n - 2 * l - 3; j >= 0; j -= 2) {
// tmp += as[j];
// }
if (n - 2 * l - 3 < 0) {
tmp = 0;
} else if ((n - 2 * l - 3) % 2 == 0) {
tmp = bs[n - 2 * l - 3 + 1];
} else {
tmp = get_sum(0, n - 2 * l - 3 + 1) - bs[n - 2 * l - 3];
}
cout << s + ans + tmp << '\n';
} else {
i64 tmp = 0;
// for (int j = n - 2 * l - 1; j >= 0; j -= 2) {
// tmp += as[j];
// }
if (n - 2 * l - 1 < 0) {
tmp = 0;
} else if ((n - 2 * l - 1) % 2 == 0) {
tmp = bs[n - 2 * l - 1 + 1];
} else {
tmp = get_sum(0, n - 2 * l - 1 + 1) - bs[n - 2 * l - 1];
}
cout << s + tmp << '\n';
}
}
} |
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for (ll(i) = (m); (i) < (n); ++(i))
#define REP(i, n) FOR(i, n, 0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll)1e15;
ll N, Q;
ll A[100005];
ll X[100005];
//! でかいほうから交互に取った場合の累積和
ll B[100005];
//! 累積和
ll C[100005];
//! 青木がxを選んだ時の高橋の取得点数
ll calc(ll x)
{
//! 青木が最初にとるindex
int s = 0;
{
int ok = N - 1, ng = -1;
while (abs(ok - ng) > 1)
{
int mid = (ok + ng) / 2;
if (x <= A[mid])
ok = mid;
else
ng = mid;
}
s = ok;
if (ok - 1 >= 0 && abs(A[ok - 1] - x) <= abs(A[ok] - x))
s = ok - 1;
}
if (s == N - 1)
{
//! 青木が最初に取る予定のものが一番大きいなら、どうせ交互になっていく
return B[N];
}
ll sum = 0;
//! 高橋が連続して取れる個数を求める
{
int ok = 1, ng = N / 2 + 1;
if (N % 2 == 1)
ng++;
while (abs(ok - ng) > 1)
{
int mid = (ok + ng) / 2;
//! 高橋が連続して取る最後のindex
int li = N - mid;
if (li - s >= mid)
{
ok = mid;
continue;
}
if (li <= s)
{
ng = mid;
continue;
}
if (abs(A[li - mid + 1] - x) <= abs(A[li] - x))
{
ok = mid;
}
else
{
ng = mid;
}
}
//! 高橋はN-1からliまでとり、青木はli-1からli-okまで連続で取る
//! その後は交互にとっていく
sum = (C[N] - C[N - ok]) + B[std::max(N - ok - ok, (ll)0)];
}
return sum;
}
int main()
{
cin >> N >> Q;
B[0] = C[0] = 0;
REP(i, N)
{
cin >> A[i];
C[i + 1] = A[i];
C[i + 1] += C[i];
if (N % 2 != i % 2)
B[i + 1] = A[i];
B[i + 1] += B[i];
}
REP(i, Q)
{
ll x;
cin >> x;
X[i] = calc(x);
}
REP(i, Q)
{
cout << X[i] << endl;
}
return 0;
} |
p03158 | C++ | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
#define fst first
#define snd second
/* clang-format off */
template <class T, size_t D> struct _vec { using type = vector<typename _vec<T, D - 1>::type>; };
template <class T> struct _vec<T, 0> { using type = T; };
template <class T, size_t D> using vec = typename _vec<T, D>::type;
template <class T> vector<T> make_v(size_t size, const T& init) { return vector<T>(size, init); }
template <class... Ts> auto make_v(size_t size, Ts... rest) { return vector<decltype(make_v(rest...))>(size, make_v(rest...)); }
/* clang-format on */
int main() {
int N, Q;
while (cin >> N >> Q) {
vector<ll> A(N);
for (int i = 0; i < N; i++) cin >> A[i];
sort(A.begin(), A.end());
vector<ll> S(N + 1, 0);
for (int i = 0; i < N; i++) S[i + 1] = S[i] + A[i];
vector<ll> S2(N + 1, 0);
for (int i = 0; i < N; i++) {
S2[i + 1] = A[i] + (i > 0 ? S2[i - 1] : 0);
}
for (int q = 0; q < Q; q++) {
ll x;
cin >> x;
ll ok = 0, ng = 1ll << 35;
while (ng - ok > 1) {
ll d = (ok + ng) / 2;
int a = distance(A.begin(), lower_bound(A.begin(), A.end(), x - d));
int b = distance(A.begin(), upper_bound(A.begin(), A.end(), x + d));
int cnt = b - a;
int c = N - cnt;
if (b <= c) {
ok = d;
} else {
ng = d;
}
}
ll d = ok;
int a = distance(A.begin(), lower_bound(A.begin(), A.end(), x - d));
int b = distance(A.begin(), upper_bound(A.begin(), A.end(), x + d));
int cnt = b - a;
int c = N - cnt;
if (b > c) {
cout << S2[N] << endl;
continue;
}
ll res = S[N] - S[c];
for (;;) {
if (b < c) {
--c;
res += A[c];
} else {
res += S2[a];
break;
}
if (a == 0 && b == c) break;
if (a == 0) {
++b;
continue;
}
if (b == c) {
--a;
continue;
}
if (x - A[a - 1] <= A[b] - x) {
--a;
} else {
++b;
}
}
cout << res << endl;
}
}
return 0;
}
|
p03158 | C++ | #include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
namespace mp = boost::multiprecision;
#define INF 100000000
#define YJ 1145141919
#define INF_INT_MAX 2147483647
#define INF_LL 9223372036854775
#define INF_LL_MAX 9223372036854775807
#define EPS 1e-10
#define MOD 1000000007
#define MOD9 998244353
#define Pi acos(-1)
#define LL long long
#define ULL unsigned long long
#define LD long double
#define int long long
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(a) begin((a)), end((a))
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
const int MAX_N = 100005;
int N, Q;
int A[MAX_N];
int X[MAX_N];
int sumAOdd[MAX_N], sumAEven[MAX_N];
int sumA[MAX_N];
using II = pair<int, int>;
int checkRange(int rr, int xq)
{
int k = A[rr] - xq;
int kk = xq - k;
int ret = lower_bound(A,A+N,kk) - A;
return ret;
}
bool check(int midr, int xq)
{
int ll = checkRange(midr, xq);
// cerr << ll << " " << midr << " " <<xq << endl;
return (midr - ll) >= N-midr-1 && midr > ll;
}
int solve(int xq)
{
int l = -1, r = N;
// cerr << l << " " << r << endl;
while(r-l>1) {
int mid = (l+r)/2;
if(check(mid, xq)) {
// cerr << mid << ", OK" << endl;
r = mid;
} else {
// cerr << mid << ", NG" << endl;
l = mid;
}
}
l = r;
int ret = sumA[N] - sumA[l];
int ll = max(checkRange(l, xq), l - (N-l));
// cerr << l << " " << N-l << " " << l-(N-l) << endl;
// cerr << "*** " << ll << " " << l << " " << ret << endl;
if(ll > 0) {
if((l-ll)%2 == (N-l)%2) { //Aから
// cerr << "A" << endl;
if((ll-1)%2 == 0) {
ret += sumAEven[ll];
} else {
ret += sumAOdd[ll];
}
} else { //Bから
// cerr << "B" << endl;
if((ll-1)%2 == 0) {
ret += sumAOdd[ll];
} else {
ret += sumAEven[ll];
}
}
}
return ret;
}
signed main()
{
cin >> N >> Q;
REP(n,N) {
cin >> A[n];
if(n%2 == 0) {
sumAOdd[n+1] = sumAOdd[n];
sumAEven[n+1] = sumAEven[n] + A[n];
} else {
sumAEven[n+1] = sumAEven[n];
sumAOdd[n+1] = sumAOdd[n] + A[n];
}
sumA[n+1] = sumA[n] + A[n];
}
vector<int> ans;
REP(q,Q) {
cin >> X[q];
ans.push_back(solve(X[q]));
}
for(int a : ans) {
cout << a << endl;
}
return 0;
} |
p03158 | C++ | #include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<algorithm>
#include<math.h>
using namespace std;
const int N=3e5+5;
int n,q,x,a[N];
long long sf[N],sg[N];
void init()
{
int i;
scanf("%d%d",&n,&q);
for(i=1;i<=n;++i) scanf("%d",&a[i]);
for(i=1;i<=n;++i) sf[i]=sf[i-1]+a[i*2-(n&1)];
for(i=1;i<=n;++i) sg[i]=sg[i-1]+a[n+1-i];
}
int fi(int L,int R)
{
int l=1,r=n+1;
while(l<r)
{
int mid=(l+r)>>1;
if(a[mid]>=L) r=mid;
else l=mid+1;
}
int nowl=l;
l=0,r=n;
while(l<r)
{
int mid=(l+r+1)>>1;
if(a[mid]<=R) l=mid;
else r=mid-1;
}
int nowr=l;
return max(nowr-nowl+1,0);
}
int ok(int x,int mid)
{
if(a[mid]<=x) return false;
int tot_x=fi(x*2-a[mid],a[mid]);
int tot_y=n-mid;
return tot_x>tot_y;
}
void work()
{
while(q--)
{
scanf("%d",&x);
int l=1,r=n;
while(l<r)
{
int mid=(l+r+1)>>1;
if(ok(x,mid)) r=mid-1;
else l=mid;
}
int tme=(n+1)>>1;
int now=min(n-l,tme);
printf("%lld\n",sg[now]+sf[tme-now]);
}
}
int main()
{
init();work();
return 0;
} |
p03158 | C++ | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long int lli;
int main(){
int n,q;
cin >> n >> q;
vector<lli> a(n);
for(int i=0; i<n; i++){
cin >> a[i];
}
vector<lli> x(q);
for(int i=0; i<q; i++){
cin >> x[i];
}
vector<lli> sumall(n+1, 0), sumeven(n+1, 0), sumodd(n+1, 0);
for(int i=0; i<n; i++){
sumall[i+1] = sumall[i]+a[i];
if(i%2==0){
if(i==0){
sumeven[i+1] = a[i];
}else{
sumeven[i+1] = sumeven[i-1]+a[i];
}
}else{
sumodd[i+1] = sumodd[i-1]+a[i];
}
}
for(int i=0; i<q; i++){
int lb=1, ub=n; //高橋君が取れる枚数(lb:ok, ub:ng)
//cout << "i=" << i << endl;
while(ub-lb > 1){
int mid = (lb +ub)/2;
//a[n-mid] まで高橋君が取れる
//== 青木君はmid-1手でa[n-mid]が取れない
//== a[n-mid]よりも距離が近いものをすべて取るとmid-1より大きくなる
lli dist = abs(x[i] -a[n-mid]);
lli minimum = x[i]-dist;
auto itr = lower_bound(a.begin(), a.end(), minimum);
lli num = n-mid -(itr -a.begin()) +1;
if(num > mid-1){
//ok
lb = mid;
}else{
//ng
ub = mid;
}
//cout << lb << " " << ub << endl;
//cout << dist << " " << minimum << " " << num << endl;
}
//cout << lb << endl;
lli ans = 0;
ans += sumall[n] -sumall[n-lb];
int rem = n- 2*lb;
if(rem > 0){
if(rem %2 == 0){
ans += sumodd[rem];
}else{
ans += sumeven[rem];
}
}
cout << ans << endl;
}
return 0;
} |
p03158 | C++ | #include <bits/stdc++.h>
#include <iomanip>
#define DEBUG 1
using namespace std;
typedef long long LL;
typedef long double LD;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef pair<LD, LD> PLDLD;
typedef vector<int> VI;
typedef vector<LL> VLL;
typedef vector<char> VB;
#define FOR(i,a,b) for(int i=(a);i<(int)(b);++i)
#define REP(i,n) FOR(i,0,n)
#define CLR(a) memset((a), 0 ,sizeof(a))
#define ALL(a) a.begin(),a.end()
#define UNQ(a) a.erase(std::unique(ALL(a)),a.end());
#define endl "\n"
const LD EPS=1e-5;
const long long INFLL=(LL)(1e9)*(LL)(1e9);
const int INF=1e9+7;
template<class T>
void chmin(T& a, const T b)
{
if(a>b)
a=b;
}
template<class T>
void chmax(T& a, const T b)
{
if(a<b)
a=b;
}
const LL powLL(const LL p, const LL q)
{
LL t=1;
for(int i=0;i<q;i++)
t*=p;
return t;
}
template <typename T>
struct has_iter
{
private:
template <typename U>
static constexpr true_type check(typename U::iterator*);
template <typename U>
static constexpr false_type check(...);
public:
static constexpr bool value = decltype(check<T>(nullptr))::value;
};
template<typename T, typename U = typename T::iterator>
void print(const T& container)
{
auto&& first=begin(container), last=end(container);
auto&& back=prev(last);
for(auto e=first; e!=last; e=next(e))
cout<<*e<<" \n"[e==back];
}
extern void* enabler;
template<typename Head, typename enable_if<!has_iter<Head>::value>::type*& = enabler>
void print(const Head& head)
{
cout<<head<<endl;
}
template<> void print<string>(const string& container)
{
cout<<container<<endl;
}
template<typename Head, typename... Tail>
void print(const Head& head, const Tail&... tail)
{
cout<<head<<" ";
print(tail...);
}
template<typename... Args>
void printd(const Args&... args)
{
#ifdef DEBUG
print(args...);
#endif
}
template<typename Head>
void input(Head& head)
{
cin>>head;
}
template<typename Head, typename... Tail>
void input(Head& head, Tail&... tail)
{
cin>>head;
input(tail...);
}
void io_speedup()
{
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
}
template<typename T>
istream& operator >> (istream& is, vector<T>& vec)
{
for(T& x: vec) is >> x;
return is;
}
template<typename T, typename U>
istream& operator >> (istream& is, pair<T, U>& t)
{
is>>t.first>>t.second;
return is;
}
template<int N, typename... Ts, typename enable_if<N == sizeof...(Ts)-1>::type*& = enabler>
void tuple_in(istream &is, tuple<Ts...> &t)
{
is>>get<N>(t);
}
template<int N, typename... Ts, typename enable_if<N < sizeof...(Ts)-1>::type*& = enabler>
void tuple_in(istream &is, tuple<Ts...> &t)
{
is>>get<N>(t);
tuple_in<N+1, Ts...>(is, t);
}
template<typename... Ts>
istream& operator >> (istream& is, tuple<Ts...>& t)
{
tuple_in<0, Ts...>(is, t);
return is;
}
template<typename T, typename U>
ostream& operator << (ostream& os, const pair<T, U>& t)
{
os<<'('<<t.first<<", "<<t.second<<')';
return os;
}
template<int N, typename... Ts, typename enable_if<N == sizeof...(Ts)-1>::type*& = enabler>
void tuple_out(ostream &os,const tuple<Ts...> &t)
{
os<<get<N>(t);
}
template<int N, typename... Ts, typename enable_if<N < sizeof...(Ts)-1>::type*& = enabler>
void tuple_out(ostream &os,const tuple<Ts...> &t)
{
os<<get<N>(t)<<", ";
tuple_out<N+1, Ts...>(os, t);
}
template<typename... Ts>
ostream& operator << (ostream& os, const tuple<Ts...>& t)
{
os<<'(';
tuple_out<0, Ts...>(os, t);
os<<')';
return os;
}
template<typename T>
vector<T> read(int n)
{
vector<T> t(n);
cin>>t;
return t;
}
template<typename T>
T read()
{
T t;
cin>>t;
return t;
}
template<typename Head, typename... Tail>
struct vector_demensions
{
using type=vector<typename vector_demensions<Tail...>::type>;
};
template<typename Head>
struct vector_demensions<Head> { using type=Head; };
template<typename T>
vector<T> make_vectors(int size, T val)
{
return vector<T>(size, val);
}
template<typename T=int, typename... Args>
auto make_vectors(int size, Args... tail)
-> typename vector_demensions<Args..., T>::type
{
auto val=make_vectors<T>(forward<Args>(tail)...);
return vector<decltype(val)>(size, val);
}
int main()
{
int n,q;
input(n,q);
auto a(read<LL>(n));
VLL ksum(n);
VLL sum(n+1);
REP(i,n)
{
if(i-2>=0)
ksum[i]=ksum[i-2]+a[i];
else
ksum[i]=a[i];
}
FOR(i,0,n)
{
sum[i+1]=sum[i]+a[i];
}
REP(tt,q)
{
LL x=read<LL>();
auto f=[&](int p)
{
int t=n-p-1;
LL d=a[p]-x;
if(d<0) return true;
if(p-t>=0 && abs(x-a[p-t])>d) return true;
if(p<n/2) return true;
return false;
};
int mid, ma=n, mi=-1;
while(ma>mi+1)
{
mid=(ma+mi)/2;
if(f(mid))
mi=mid;
else
ma=mid;
}
//print(x,mi);
LL ans=0;
int t=n-mi-1;
if(mi-t>=0)
ans+=ksum[mi-t];
ans+=sum[n]-sum[mi+1];
print(ans);
}
} |
p03158 | C++ | #include <bits/stdc++.h>
#define fi first
#define se second
#define sz(a) (int)(a).size()
#define all(a) (a).begin(), (a).end()
#define reset(a, v) memset((a), v, sizeof(a))
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
const int N = 100005;
int n, q;
int dat[N];
vi boundaries;
vll answers;
int main() {
scanf("%d %d", &n, &q);
ll t = 0;
for (int i = 1; i <= n; i++) {
scanf("%d", &dat[i]);
if (n % 2 == i % 2) t += dat[i];
}
answers.push_back(t);
int lo = n-2, hi = n-1;
for (int i = 1; i <= (n-1)/2; i++) {
int mid = (dat[lo]+dat[hi]) >> 1;
// printf("mid = %d\n", mid);
boundaries.push_back(mid);
t = t - dat[lo] + dat[hi];
answers.push_back(t);
// printf("mid = %d, answers = %lld\n", mid, t);
lo -= 2;
hi--;
}
reverse(all(boundaries));
reverse(all(answers));
while (q--) {
int x;
scanf("%d", &x);
int idx = lower_bound(all(boundaries), x) - boundaries.begin();
printf("%lld\n", answers[idx]);
}
return 0;
} |
p03158 | C++ | #include <algorithm>
#include <iostream>
#include <vector>
#include <utility>
using namespace std;
int main(){
int N, Q;
cin >> N >> Q;
vector<int> A(N);
for(int i = 0; i < N; ++i) cin >> A[i];
vector< pair<int,int> > X;
for(int i = 0; i < Q; ++i){
int x;
cin >> x;
X.emplace_back(x,i);
}
sort(X.begin(), X.end());
long long s = 0;
for(int i = N/2; i < N; ++i) s += A[i];
vector<long long> ans(Q);
int l = 0, r = N/2;
long long c[] = {0,0};
for(int i = 0; i < Q; ++i){
int x = X[i].first, id = X[i].second;
while(r < N and abs(x-A[l]) > abs(x-A[r])){
c[l%2] += A[l];
s -= A[r];
++l,++r;
}
//cerr << x << " " << A[l] << " " << A[r] << endl;
while(N-r < r-l){
if(abs(A[l]-x) > abs(x-A[r-1])){
c[l%2] += A[l];
++l;
}else{
s += A[r-1];
--r;
}
}
//cerr << N-r << " " << r-l << endl;
//if(N-r > r-l and l > 0) --l, c[l%2] -= A[l];
// cerr << x << " " << A[l] << " " << A[r] << endl;
// cerr << c[0] << " " << c[1] << endl;
ans[id] = s + c[1-N%2];
}
for(int i = 0; i < Q; ++i) cout << ans[i] << endl;
}
|
p03158 | C++ | //----------------------------templates
#pragma GCC optimize ("Ofast")
#pragma GCC target ("tune=native")
#pragma GCC target ("avx")
//----------------------------
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define int ll
#define FOR(i,j,n) for (int i=(int)(j);i<(n);i++)
#define REP(i,n) for (int i=0;i<(int)(n);i++)
#define REPS(i,n) for (int i=1;i<=(int)(n);i++)
#define REPN(i,n) for (int i=(int)(n)-1;i>=0;i--)
#define REPNS(i,n) for (int i=(int)(n);i>0;i--)
#define I(n) scanf("%lld", &(n))
#define LL(n) scanf("%lld", &(n))
#define pb(n) push_back((n))
#define mp(i,j) make_pair((i),(j))
#define eb(i,j) emplace_back((i),(j))
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define uniq(v) v.erase( unique(v.begin(), v.end()), v.end() )
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
typedef vector<int> vi;
typedef pair<int,int> pi;
typedef vector<pi> vpi;
typedef vector<vi> vvi;
typedef vector<vpi> vvpi;
typedef vector<vvi> vvvi;
const int mod = 1000000007;
//--------------------------------------------
int n,q,a[100010],x,ret;
int rui[100010], ev[100010], od[100010];
int aoki_hi;
int aoki_lo;
signed main(){
I(n); I(q);
REP(i,n) I(a[i]);
rui[n-1] = a[n-1];
REPN(i,n-1) rui[i] = rui[i+1] + a[i];
ev[0] = a[0];
ev[1] = a[1];
for(int i = 2; i < n; i += 1){
ev[i] = ev[i-2] + a[i];
}
REP(_,q){
I(x);
if (x <= a[0]){
printf("%lld\n", rui[n-(n+1)/2]);
continue;
}
int lo = 0;
int hi = (n+1)/2;
while(lo+1 < hi){
int mid = (lo+hi)/2;
aoki_hi = a[n-1-mid];
aoki_lo = a[n-mid-mid-1];
if (aoki_hi - x >= x - aoki_lo){
lo = mid;
} else {
hi = mid;
}
}
aoki_hi = a[n-1-lo];
aoki_lo = a[n-lo-lo-1];
cerr << "lo: " << lo << " " << aoki_lo <<" " << aoki_hi << endl;
if (aoki_hi - x >= x - aoki_lo ){
ret = rui[n-lo-1];
if (n-3-lo-lo >= 0){
ret += ev[n-3-lo-lo];
}
} else {
ret = rui[n-lo] + ev[n-1-lo-lo];
}
printf("%lld\n", ret);
}
} |
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
#define x first
#define y second
#define ll long long
#define pi pair<int,int>
#define pl pair<ll,ll>
#define pd pair<double,double>
#define ld long double
#define pld pair<ld,ld>
#define lg length()
#define sz size()
#define vi vector<int>
#define vl vector<ll>
#define vp vector<pi>
#define vpl vector<pl>
#define pb push_back
#define INF 1000000005
#define LINF 1000000000000000005
#define int ll
int n,q,a[100005],x,s[100005],p[100005];
int f(int x, int d){
int A,B,l,r;
l=1,r=n;
while(l!=r){
int mid=(l+r)/2;
if(x-a[mid]<=d+1) r=mid;
else l=mid+1;
}
A=l;
l=1,r=n;
while(l!=r){
int mid=(l+r+1)/2;
if(a[mid]-x<=d) l=mid;
else r=mid-1;
}
B=l;
if(A<=B && a[A]<=x+d && a[B]>=x-d-1) return B-A+1;
else return 0;
}
int32_t main(){
ios_base :: sync_with_stdio(0); cin.tie(); cout.tie();
#ifdef LOCAL_DEFINE
ifstream cin("input.in");
#endif
cin >> n >> q;
for(int i=1;i<=n;i++){
cin >> a[i]; s[i]=a[i];
if(i>2) s[i]+=s[i-2];
}
for(int i=n;i>=1;i--){
p[i]=p[i+1]+a[i];
}
for(int i=1;i<=q;i++){
cin >> x;
if(x>=a[n]){
cout << s[n] << '\n';
continue;
}
int l=1,r=n;
while(l!=r){
int mid=(l+r)/2;
if(a[mid]<=x){
l=mid+1;
continue;
}
int cnt=f(x,a[mid]-x-1);
if(cnt>=n-mid) r=mid;
else l=mid+1;
}
//cout << l << ' ';
cout << p[l]+((2*l-n-2>0)?s[2*l-n-2]:0) << '\n';
}
#ifdef LOCAL_DEFINE
cerr << "\nTime elapsed: " << 1.0*clock()/CLOCKS_PER_SEC << " \n";
#endif
}
|
p03158 | C++ | #define _USE_MATH_DEFINES
#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <complex>
#include <string>
#include <vector>
#include <array>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <limits>
#include <climits>
#include <cfloat>
#include <functional>
#include <iterator>
#include <memory>
#include <regex>
using namespace std;
template <class T>
class cumulativeSum
{
private:
int n;
vector<T> sum;
public:
cumulativeSum(const vector<T>& a)
{
n = a.size();
sum.assign(n+1, 0);
for(int i=0; i<n; ++i)
sum[i+1] = a[i] + sum[i];
}
T getSum(int x1, int x2)
{
x1 = max(x1, 0);
x2 = min(x2, n);
if(x1 >= x2)
return 0;
return sum[x2] - sum[x1];
}
};
const long long INF = LLONG_MAX / 2;
long long tmp(const vector<long long>& a, int x)
{
set<long long> s(a.begin(), a.end());
long long ans = 0;
while(!s.empty()){
ans += *s.rbegin();
s.erase(--s.end());
if(s.empty())
break;
auto it = s.lower_bound(x);
if(it == s.begin()){
s.erase(it);
}
else{
auto it2 = it;
-- it2;
if(it == s.end() || x - *it2 <= *it - x)
s.erase(it2);
else
s.erase(it);
}
}
return ans;
}
int main()
{
int n, q;
cin >> n >> q;
vector<long long> a(n);
for(int i=0; i<n; ++i)
cin >> a[n-1-i];
if(n % 2 != 0){
++ n;
a.push_back(0);
}
a.push_back(-INF);
vector<long long> b(n);
for(int i=0; i<n; i+=2)
b[i] = a[i];
cumulativeSum<long long> cs1(a), cs2(b);
vector<long long> v(n/2+1);
v[0] = INF;
for(int i=1; i<=n/2; ++i)
v[i] = (a[i] + a[2*i]) / 2;
reverse(v.begin(), v.end());
while(--q >= 0){
int x;
cin >> x;
int i = lower_bound(v.begin(), v.end(), x) - v.begin();
i = n / 2 + 1 - i;
long long ans = cs1.getSum(0, i) + cs2.getSum(2*i, n);
cout << ans << endl;
}
return 0;
}
|
p03158 | C++ | #include<bits/stdc++.h>
#define ll long long
using namespace std;
const int MAXN=1e5+10;
struct node{
int x,id;
};
node w[MAXN];
ll a[MAXN],b[MAXN],c[MAXN],ans[MAXN];
int n,q,t;
bool cmp(node x,node y)
{
return x.x<y.x;
}
int s1(int l,int r,int x)
{
if (l>r) return n+1;
int mid=(l+r)/2;
if (a[mid]>=x) return min(mid,s1(l,mid-1,x));
else return s1(mid+1,r,x);
}
bool pan(int now,int x,int y)
{
if (y>1) {
int t1=s1(1,y-1,x-a[n-now]+x);
if (t1==n+1) t1=0; else t1=y-t1;
if (now>=(t1+n-now-y+1)) return 1; else return 0;
}
else return now*2>=n;
}
void s(int x,int y,int l,int r)
{
if (l>r) return;
int mid=(l+r)/2;
if (pan(mid,x,y)) {
t=min(t,mid); s(x,y,l,mid-1);
}
else s(x,y,mid+1,r);
}
int main()
{
scanf("%d",&n);
scanf("%d",&q);
for (int i=1;i<=n;i++) scanf("%lld",&a[i]);
for (int i=1;i<=q;i++) scanf("%d",&w[i].x),w[i].id=i;
for (int i=1;i<=n;i++) b[i]=b[i-2]+a[i];
c[n]=a[n];
for (int i=n-1;i>=1;i--) c[i]=c[i+1]+a[i];
sort(w+1,w+q+1,cmp);
int l=1;
t=n+1;
for (int i=1;i<=q;i++) {
while (l<=n&&w[i].x>a[l]) l++;
if (l<=n) {
t=n+1;
s(w[i].x,l,1,n-l+1);
ans[w[i].id]=c[n-t+1]+(n>2*t?b[n-2*t]:0);
}
else ans[w[i].id]=b[n];
}
for (int i=1;i<=q;i++) printf("%lld\n",ans[i]);
} |
p03158 | C++ | #include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<vector>
#include<map>
#include<set>
#include<string>
#include<queue>
#include<stack>
using namespace std;
#define MOD 1000000007
#define INF (1<<29)
#define EPS (1e-10)
typedef long long Int;
typedef pair<Int, Int> P;
#define max(x, y) ((x)>(y)?(x):(y))
#define min(x, y) ((x)<(y)?(x):(y))
Int n, k, sum[216000];
Int a[216000], alt[216000];
Int q, x;
Int solve(Int x){
if(abs(x - a[n-1]) < abs(x - a[n-2]))return alt[n-1];
Int k = lower_bound(a, a+n, x) - a;
if(k > 0 && abs(x-a[k]) >= abs(x-a[k-1]))k--;
Int bottom = k, top = n-1;
while(top - bottom > 1){
Int mid = (top + bottom) / 2;
Int d = n - mid - 1;
Int l = mid-d;
if(l < 0 || abs(x-a[l]) > abs(x-a[mid]))bottom = mid;
else top = mid;
}
Int d = n - bottom-1;
Int l = bottom - d;
Int res = sum[n-1] - sum[bottom];
// cout << bottom << endl;
if(l >= 0)res += alt[l];
return res;
}
int main(){
cin >> n;
cin >> q;
for(Int i = 0;i < n;i++)cin >> a[i];
sum[0] = a[0];
alt[0] = a[0];
if(n >= 2)alt[1] = a[1];
for(Int i = 1;i < n;i++){
if(i > 0)sum[i] = sum[i-1] + a[i];
if(i > 1)alt[i] = alt[i-2] + a[i];
}
for(Int i = 0;i < q;i++){
cin >> x;
cout << solve(x) << 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;
while (ok + 1 < ng) {
int w = (ok + ng) / 2;
int head = lower_bound(begin(a) + 1, end(a), x - w) - begin(a);
int tail = lower_bound(begin(a) + 1, end(a), x + w) - begin(a);
int second = tail - head, first = n + 1 - tail;
if (second + 1 <= first) {
ok = w;
} else if (second + 1 > first) {
ng = w;
}
}
{
int head = lower_bound(begin(a) + 1, end(a), x - ok) - begin(a);
int tail = lower_bound(begin(a) + 1, end(a), x + ok) - begin(a);
int second = tail - head, first = n + 1 - tail;
if (second + 1 < first) {
tail++;
}
// cerr << ok << " " << ng << endl;
// cerr << head << " " << tail << ": " << s[n] - s[tail - 1] << " " << e[head - 1] << endl;
cout << (s[n] - s[tail - 1]) + e[head - 1] << endl;
}
}
}
|
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i,to) for(li i=0;i<((li)(to));i++)
#define repp(i,start,to) for(li i=(li)(start);i<((li)(to));i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v).end())
#define allof(v) (v).begin(), (v).end()
#define dodp(v,n) memset(v,(li)n,sizeof(v))
#define bit(n) (1ll<<(li)(n))
#define mp(a,b) make_pair(a,b)
#define rin rep(i,n)
#define EPS 1e-12
#define ETOL 1e-8
#define MOD 1000000007
typedef pair<li, li> PI;
#define INF bit(60)
#define DBGP 1
#define idp if(DBGP)
#define F first
#define S second
#define p2(a,b) idp cout<<a<<"\t"<<b<<endl
#define p3(a,b,c) idp cout<<a<<"\t"<<b<<"\t"<<c<<endl
#define p4(a,b,c,d) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<endl
#define p5(a,b,c,d,e) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<endl
#define p6(a,b,c,d,e,f) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<endl
#define p7(a,b,c,d,e,f,g) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<endl
#define p8(a,b,c,d,e,f,g,h) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<endl
#define p9(a,b,c,d,e,f,g,h,i) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<"\t"<<i<<endl
#define p10(a,b,c,d,e,f,g,h,i,j) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<"\t"<<i<<"\t"<<j<<endl
#define foreach(it,v) for(__typeof((v).begin()) it=(v).begin(); it!=(v).end(); ++it)
#define p2p(x) idp p2((x).F, (x).S)
#define dump(x,n) idp{rep(i,n){cout<<x[i]<<" ";}puts("");}
#define dump2(x,n) idp{rep(i,n){cout<<"["<<x[i].F<<" , "<<x[i].S<<"] ";}puts("");}
#define dumpi(x) idp{foreach(it, x){cout<<(*it)<<" ";}puts("");}
#define dumpi2(x) idp{foreach(it, x){cout<<"["<<(it)->F<<" , "<<(it)->S<<"] ";}puts("");}
#define read2d(a,w,h) rep(i,h)rep(j,w)cin>>a[i][j]
#define dump2d(a,w,h) rep(i,h){rep(j,w)cout<<a[i][j]<<" ";puts("");}
typedef pair<li, li> PI;
li n, q;
li a[100100];
li x[100100];
li sum_tkhs[100100];
li sum[100100];
inline li chk(li xx, li pos) {
li num_tkhs = n - pos;
li diff = abs(a[pos] - xx);
li min_pos_aoki = pos - num_tkhs;
// 高橋君が過半数取ってる -> おかしいので本当の境目はもっと->寄り
if (min_pos_aoki < 0)return 1;
if (abs(a[min_pos_aoki + 1] - xx) > diff) {
// min_pos_aoki+1より先にposを取っているはず -> 本当の境目はもっと->より
return 1;
}
// [min_pos_aoki, pos-1] の間よりも先にmin_pos_aoki-1を取ってはダメ -> 本当の境目はもっと<-寄り
if (min_pos_aoki > 0 && abs(a[min_pos_aoki] - xx) >= abs(a[min_pos_aoki - 1] - xx)) {
return -1;
}
// pos-1よりもmin_pos_aoki-1のほうを先に見に行ってしまう -> 本当の境目はもっと<-寄り
if (min_pos_aoki > 0 && abs(a[pos - 1] - xx) >= abs(a[min_pos_aoki - 1] - xx)) {
return -1;
}
return 0;
}
// xxが選ばれた時、上から順に取り合いになるのがどこから始まるか
inline li calc(li xx) {
if (xx >= a[n - 2]) {
return n - 1;
}
// 上から順にみていって、初めて取る人が変わる場所を求める
li l = 0;
li r = n - 1;
while (l + 1 < r) {
li mid = (l + r) / 2;
li val = chk(xx, mid);
//p3(xx, mid, val);
if (val == 0) {
return mid;
} else if (val > 0) {
l = mid;
} else {
r = mid;
}
}
if (chk(xx, l) == 0)return l;
return r;
}
inline li solve(li xx) {
// 左右くっきり分かれるタイプだけ特殊判定
if (abs(a[0] - xx) <= abs(a[(n) / 2] - xx)) {
return sum[n] - sum[n / 2];
}
// get cutting pos
li pos = calc(xx);
li num_tkhs = n - pos;
//p5("pos", pos, pos - num_tkhs - 1, sum_tkhs[pos - num_tkhs - 1], sum[n] - sum[pos]);
return sum_tkhs[pos - num_tkhs - 1] + (sum[n] - sum[pos]);
}
int main() {
cin >> n >> q;
rin{
cin >> a[i];
}
sum_tkhs[0] = a[0];
sum_tkhs[1] = a[1];
repp(i, 2, n) {
sum_tkhs[i] = sum_tkhs[i - 2] + a[i];
}
sum[0] = 0;
rep(i, n) {
sum[i + 1] = sum[i] + a[i];
}
rep(i, q) {
cin >> x[i];
}
rep(i, q) {
cout << solve(x[i]) << endl;
}
return 0;
} |
p03158 | C++ | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define Would
#define you
#define please
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, Q;
cin >> N >> Q;
int A[100000];
rep(i, N) cin >> A[i];
sort(A, A + N);
ll S[100001] = {};
ll S1[100001] = {};
ll S2[100001] = {};
rep(i, N) {
S[i + 1] = S[i] + A[i];
S1[i + 1] = S1[i];
S2[i + 1] = S2[i];
if (i % 2 == 0) S1[i + 1] += A[i];
else S2[i + 1] += A[i];
}
rep(i, Q) {
int X;
cin >> X;
int L = X;
int R = 1e9;
while (L < R) {
int H = (L + R + 1) / 2;
int kari = X - (H - X);
int a = lower_bound(A, A + N, kari) - A;
int b = upper_bound(A, A + N, H) - A;
if (b - a <= N - b) L = H;
else R = H - 1;
}
int b = upper_bound(A, A + N, L) - A;
ll kotae = 0;
kotae += S[N] - S[b];
int kari = N - (N - b) * 2;
if (kari > 0 && N % 2) kotae += S1[kari];
else if (kari > 0 && N % 2 == 0) kotae += S2[kari];
co(kotae);
}
Would you please return 0;
} |
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
int n, q; cin >> n >> q;
vector < long long > a(n), sum(n), sumodd(n, 0), sumeven(n, 0);
for(long long &x : a) cin >> x;
partial_sum(a.begin(), a.end(), sum.begin());
sumeven[0] = a[0];
for(int i = 1; i < n; ++i) {
sumodd[i] = sumodd[i - 1];
sumeven[i] = sumeven[i - 1];
if(i % 2) sumodd[i] += a[i];
else sumeven[i] += a[i];
}
auto f = [&](const int &l, const int &r) {
return sum[r] - (l ? sum[l - 1] : 0);
};
auto inRange = [&](const int &l, const int &r) {
int u = lower_bound(a.begin(), a.end(), l) - a.begin();
int v = upper_bound(a.begin(), a.end(), r) - a.begin();
return v - u;
};
while(q--) {
int x;
cin >> x;
if(x >= a.back()) {
cout << (n % 2 ? sumeven[n - 1] : sumodd[n - 1]) << '\n';
continue;
}
int low = 0, high = 1000000000, ans = -1;
while(low <= high) {
int mid = (low + high) >> 1;
int pos = upper_bound(a.begin(), a.end(), x + mid) - a.begin();
if(inRange(x - mid, x + mid) > n - pos) {
high = mid - 1;
}
else{
ans = mid;
low = mid + 1;
}
}
int got = inRange(x - ans, x + ans);
int u = lower_bound(a.begin(), a.end(), x - ans) - a.begin();
int v = upper_bound(a.begin(), a.end(), x + ans) - a.begin();
if(n - v > v - u) {
if(n - v > v - u + 1) {
u--;
}
cout << f(v, n - 1) + (u ? (u % 2 ? sumodd[u - 1] : sumeven[u - 1]) : 0) << '\n';
}
else{
cout << f(v, n - 1) + (u ? (u % 2 ? sumeven[u - 1] : sumodd[u - 1]) : 0) << '\n';
}
/*long long ansx = f(ans, n - 1);
int v = lower_bound(a.begin(), a.end(), x - abs(x - a[ans])) - a.begin();
long long ansy = f(v, ans - 1);
v--;
if(v > 0)
if(v % 2 == 0) ansy += sumeven[v], ansx += sumodd[v];
else ansy += sumodd[v], ansx += sumeven[v];
cout << ansx << '\n';*/
}
return 0;
} |
p03158 | C++ | /*
god taekyu
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
int n,q;
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() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin>>n>>q;
for(int i=1;i<=n;i++) cin>>A[i];
sort(A+1,A+n+1);
for(int i=0;i<=20;i++) {
//cout<<i<<" : ";
//pro(i);
}
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) {
//cout<<(A[l]+A[r])/2<<'\n';
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; cin>>a;
int idx = lower_bound(dp,dp+cnt,a) - dp;
cout<<X[idx]<<'\n';
}
for(int i=0;i<cnt;i++) {
//cout<<dp[i]<<' ';
}
//cout<<'\n';
return 0;
}
/*
god taekyu
*/
|
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define i_7 (ll)(1E9+7)
#define i_5 (ll)(1E9+5)
ll mod(ll a){
ll c=a%i_7;
if(c>=0)return c;
else return c+i_7;
}
typedef pair<int,int> i_i;
typedef pair<ll,ll> l_l;
ll inf=(ll)1E12;
#define rep(i,l,r) for(ll i=l;i<=r;i++)
#define pb push_back
ll max(ll a,ll b){if(a<b)return b;else return a;}
ll min(ll a,ll b){if(a>b)return b;else return a;}
void Max(ll * pos,ll val){*pos=max(*pos,val);}//Max(&dp[i][j],dp[i-1][j]);
void Min(ll * pos,ll val){*pos=min(*pos,val);}
void Add(ll * pos,ll val){*pos=mod(*pos+val);}
const long double EPS=1E-8;
////////////////////////////////////////
int main(){
ll n,q;cin>>n>>q;
ll a[n+2];rep(i,2,n+1)cin>>a[i];a[0]=-inf;a[1]=-inf;
ll s[n+2],se[n+2];
s[1]=0;se[1]=0;
rep(i,2,n+1){
s[i]=s[i-1]+a[i];
if((n-i)%2==1)se[i]=se[i-1]+a[i];
else se[i]=se[i-1];
}
rep(i,0,q-1){
ll x;cin>>x;
ll l=1,r=(n+1)/2;
while(l<r){
ll m=(l+r)/2;
ll b=abs(x-a[n-2*m+1]);
ll c=abs(a[n-m+1]-x);
if(x<=a[n-2*m+1]){
l=m+1;
}else if(x>=a[n-m+1]){
r=m;
}else if(b<=c){
l=m+1;
}else{
r=m;
}
}
ll ans=s[n+1]-s[n-l+1];
if(n-2*l+1>=1)ans+=se[n-2*l+1];
cout<<ans<<endl;
}
return 0;
}
|
p03158 | C++ | // warm heart, wagging tail,and a smile just for you!
// ███████████
// ███╬╬╬╬╬╬╬╬╬╬███
// ███╬╬╬╬╬████╬╬╬╬╬╬███
// ███████████ ██╬╬╬╬╬████╬╬████╬╬╬╬╬██
// █████████╬╬╬╬╬████████████╬╬╬╬╬██╬╬╬╬╬╬███╬╬╬╬╬██
// ████████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████████╬╬╬╬╬╬██╬╬╬╬╬╬╬██
// ████╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████████╬╬╬╬╬╬╬╬╬╬╬██
// ███╬╬╬█╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬███╬╬╬╬╬╬╬█████
// ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬████████╬╬╬╬╬██
// ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬███╬╬╬╬╬╬╬╬╬███
// ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████╬╬╬╬╬╬╬██
// ████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬████╬╬╬╬╬████
// █████████████╬╬╬╬╬╬╬╬██╬╬╬╬╬████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬███╬╬╬╬██████
// ████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬██████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██████╬╬╬╬╬╬╬███████████╬╬╬╬╬╬╬╬██╬╬╬██╬╬╬██
// ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬████╬╬╬╬╬╬╬╬╬╬╬█╬╬╬╬╬╬╬██╬╬╬╬╬╬╬╬██
// ██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬╬▓▓▓▓▓▓╬╬╬████╬╬████╬╬╬╬╬╬╬▓▓▓▓▓▓▓▓██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬╬╬╬╬███
// ██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██████▓▓▓▓▓▓▓╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬▓▓▓▓▓▓▓██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬╬█████
// ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬███╬╬╬╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬████████
// ███╬╬╬╬╬╬╬╬╬╬╬╬╬█████╬╬╬╬╬╬╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬███╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██
// ██████████████ ████╬╬╬╬╬╬███████████████████████████╬╬╬╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬████
// ███████ █████ ███████████████████
#include "bits/stdc++.h"
using namespace std;
#define MOD 1000000007
#define INF 1LL<<60
#define fs first
#define sc second
#define pb push_back
#define int long long
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define RFOR(i,a,b) for(int i = (b-1);i>=a;i--)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define ITR(itr,mp) for(auto itr = (mp).begin(); itr != (mp).end(); ++itr)
#define RITR(itr,mp) for(auto itr = (mp).rbegin(); itr != (mp).rend(); ++itr)
#define range(i,a,b) (a)<=(i) && (i)<(b)
#define debug(x) cout << #x << " = " << (x) << endl;
#define SP << " " <<
typedef pair<int,int> P;
typedef vector<vector<P> > Graph;
int n,q;
const int NMAX = 1e5;
vector<int> a;
bool check(int t, int x){ // 上から連続ｔ個とれる？
if(t > (n+1)/2) return false;
int tmp = a[n-t]; //これがのこればOK
if(tmp < x) return false;
int dist = max(0LL,n - t -(lower_bound(a.begin(),a.end(),x) - a.begin()));
int dist2 = (lower_bound(a.begin(),a.end(),x) - a.begin()) - (lower_bound(a.begin(),a.end(),x-abs(x-tmp)) - a.begin());
//debug(t);
//cout << dist SP dist2 << endl;
return dist+dist2 >= t-1;
}
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> q;
a.assign(n,0);
REP(i,n) cin >> a[i];
vector<int> x(q);
REP(i,q) cin >> x[i];
vector<int> s(n+1,0);
REP(i,n) s[i+1] = s[i]+a[i];
vector<int> skip(n,0); // index iをとってそこから１つ飛び
skip[0] = a[0],skip[1] = a[1];
FOR(i,2,n) skip[i] = skip[i-2]+a[i];
vector<int> ans(q);
REP(i,q){
int ng = n, ok = 1;
while (abs(ng-ok)>1) {
int mid = (ng+ok)/2;
(check(mid,x[i])?ok:ng) = mid;
}
//debug(ok);
ans[i] = s[n]-s[n-ok];
if(n-2*ok-1 >= 0) ans[i] += skip[n-2*ok-1];
}
REP(i,q) cout << ans[i] << endl;
return 0;
} |
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
#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 pb push_back
#define mp make_pair
#define fi first
#define se second
#define pcnt __builtin_popcount
#define sz(x) (int)(x).size()
#define maxs(x,y) x=max(x,y)
#define mins(x,y) x=min(x,y)
#define show(x) cout<<#x<<" = "<<x<<endl;
#define all(a) (a.begin()),(a.end())
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define perm(c) sort(all(c));for(bool c##p=1;c##p;c##p=next_permutation(all(c)))
#define bit(n) (1LL<<(n))
#define randInt(l,r) (uniform_int_distribution<ll>(l,r)(rnd))
#define randDouble(l,r) (uniform_real_distribution<double>(l,r)(rnd))
typedef long long ll;
typedef __int128_t lll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
template<class T>using V=vector<T>;
template<class T>using VV=V<V<T>>;
template<class T,class Y>ostream& operator<<(ostream& o,const pair<T,Y>& p){return o<<"("<<p.fi<<", "<<p.se<<")";}
template<typename A,size_t N,typename T>void Fill(A (&array)[N],const T&v){fill((T*)array,(T*)(array+N),v);}
lll gcd(lll a,lll b,lll &x,lll &y){if(!b){x=1;y=0;return a;}lll d=gcd(b,a%b,y,x);y-=a/b*x;return d;}
ll gcd(ll a,ll b){lll x=0,y=0;return gcd(a,b,x,y);}
ll modPow(lll a,lll n,ll m){if(!a)return a;lll p=1;for(;n>0;n>>=1,a=a*a%m)if(n&1)p=p*a%m;return(ll)p;}
bool isPrime(ll n){if(n<2||n%2==0)return n==2;lll t=n-1,d=t/(t&-t);for(lll a:{2,325,9375,28178,450775,9780504,1795265022})if(a%n){for(t=d,a=modPow(a,t,n);t!=n-1&&a!=1&&a!=n-1;a=a*a%n,t=t*2%n);if(a!=n-1&&t%2==0)return 0;}return 1;}
void dout(double d){printf("%.12f\n",d);}
const int IINF = 1e9+6;
const ll LINF = 1e18;
const int MOD = 1e9+7;
const double PI = acos(-1);
const double EPS = 1e-10;
static random_device rd;
static mt19937 rnd(rd());
const int N = 1e5;
ll n, q, s[N], sa[N+1];
V<ll> a;
main(){
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n >> q;
FOR(i, 0, n){
ll t;
cin >> t;
a.pb(t*3);
sa[i+1] = sa[i] + a[i];
}
s[0] = a[0];
s[1] = a[1];
FOR(i, 2, n) s[i] = s[i-2] + a[i];
FOR(i, 0, q){
ll x;
cin >> x;
x = x*3-1;
ll l = -1, r = (ll)100*IINF, m;
while(r>l+1){
m=(r+l)/2;
auto it1 = upper_bound(all(a), x+m);
auto it2 = lower_bound(all(a), x-m);
if(a.end() - it1 >= it1 - it2){
l = m;
}else{
r = m;
}
}
auto it1 = upper_bound(all(a), x+l);
auto it2 = lower_bound(all(a), x-l);
ll su = sa[n] - sa[it1-a.begin()];
if(a.end()-it1 == it1-it2){
if(it2 != a.begin()) su += s[(it2-a.begin())-1];
}else{
if(it2-a.begin() > 1) su += s[(it2-a.begin())-2];
}
printf("%lld\n", su/3);
}
} |
p03158 | C++ | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#define jizz ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define pb push_back
#define F first
#define S second
#define MEM(i,j) memset(i,j,sizeof i)
#define ALL(v) v.begin(),v.end()
#define MP make_pair
#define ET cout << "\n"
#define DB(a,s,e) {for(int i=s;i<e;i++) cout << a[i] << " ";ET;}
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll arr[100005],sum[100005],crs[100005];
int main()
{jizz
ll n,q,x,l,r,t,p,ans=0;
cin >> n >> q >> arr[0],sum[0]=arr[0];
for(int i=1;i<n;++i)
cin >> arr[i],sum[i]=sum[i-1]+arr[i];
crs[0]=arr[0],crs[1]=arr[1];
for(int i=2;i<n;++i)
crs[i]=arr[i]+crs[i-2];
while(q--)
{
cin >> x,l=0,r=1000000000;
if(x>=arr[n-1])
{
cout << crs[n-1] << "\n";
continue;
}
while(l<r)
{
ll m=l+r>>1;
p=lower_bound(arr,arr+n,x-m)-arr;
t=upper_bound(arr,arr+n,x+m)-arr;
if(t+1>=n-t+p) r=m;
else l=m+1;
}
p=lower_bound(arr,arr+n,x-l)-arr;
t=upper_bound(arr,arr+n,x+l)-arr;
//cout << l << " " << p << " " << t << "\n";
if(arr[t-1]-x==x-arr[p] && t>=n-t+1+p)
--t;
if(t+1==n-t+p) --p;
//cout << l << " " << p << " " << t << "*\n";
ans=sum[n-1]-sum[t-1];
if(p>0) ans+=crs[p-1];
cout << ans << "\n";
}
} |
p03158 | C++ | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define p_ary(ary,a,b,i) do { cout << "["; for (int i = a;i < b;++i) cout << ary[i] << (b-1 == i ? "]\n" : ", "); } while(0)
#define p_map(map,it) do {cout << "{";for (auto it = map.begin();;++it) {if (it == map.end()) {cout << "}\n";break;}else cout << "" << it->first << "=>" << it->second << ", ";}}while(0)
int main() {
int n,q;
cin >> n >> q;
vector<ll> a(n,0),sums(100010,0),psums(100010,0);
for (int i = 0;i < n;++i) {
cin >> a[i];
sums[i+1] = sums[i]+a[i];
psums[i+1] = a[i];
}
for (int i = 1;i < n;++i) psums[i+1] += psums[i-1];
//p_ary(a,0,n,i);
//p_ary(sums,0,n+1,i);
//p_ary(psums,0,n+1,i);
for (int z = 0;z < q;++z) {
ll x;
cin >> x;
int mx = n,mn = 1;
while (mx-mn > 1) {
int md = mn+(mx-mn)/2;
int it = lower_bound(a.begin(),--a.end(),x-a[n-md]+x)-a.begin();
//cout << n-md-it <<" " << md << endl;
if (n-md-it+1 >= md) mn = md;
else mx = md;
}
//cout << mn << endl << endl;
ll ans = sums[n]-sums[n-mn];
//cout << ans << endl;
if (mn*2 <= n) ans += psums[n-2*mn];
cout << ans << endl;
}
} |
p03158 | C++ | #include<cstdio>
#include<vector>
#include<queue>
#include<string>
#include<algorithm>
#include<functional>
#include<cstring>
using namespace std;
/**** Type Define ****/
typedef long long ll;
typedef pair<ll, ll> P;
/**** Const List ****/
const ll INF = ((ll)1 << 31) - 1;
const ll DINF = (ll)1e20;
const ll UNION_FIND_MAX = 100000;
const ll SEGMENT_TREE_MAX = (1 << 18) - 1;
const ll MAX_FLOW_MAX_V = 10000;
const ll MIN_COST_FLOW_MAX_V = 10000;
const ll BIPARTITE_MATCHING_MAX_V = 10000;
const ll DIJKSTRA_MAX_V = 1000000;
/**** General Functions ****/
template <typename T>
T tmin(T a, T b) { return a > b ? b : a; };
template <typename T>
T tmax(T a, T b) { return a > b ? a : b; };
template <typename T>
T tadd(T a, T b) { return a + b; };
template <typename T>
T tmul(T a, T b) { return a * b; };
template <typename T>
T tpow(T a, T b) { return a * b; };
ll gcd(ll a, ll b) {
if (b == 0) return a;
return gcd(b, a % b);
}
/**** Dijkstra ****/
class Dijkstra { // double は無理!!
public:
struct edge { ll to, cost; };
ll V;
vector<edge> G[DIJKSTRA_MAX_V];
ll d[DIJKSTRA_MAX_V];
priority_queue<P, vector<P>, greater<P> > que;
Dijkstra() {}
Dijkstra(ll v) {
init(v);
}
void init(ll v) {
V = v;
for (ll i = 0; i < v; i++) {
G[i].clear();
}
}
void search(ll from) {
for (ll i = 0; i < V; i++) d[i] = INF;
d[from] = 0;
que.push(P(0, from));
while (!que.empty()) {
P p = que.top(); que.pop();
ll b = p.second;
ll c = p.first;
if (d[b] <= c) continue;
for (ll i = 0; i < G[b].size(); i++) {
edge e = G[b][i];
ll nc = c + e.cost;
ll nt = e.to;
if (d[nt] > nc) que.push(P(nc, nt)), d[nt] = nc;
}
}
}
};
/**** Matrix ****/
template <typename T>
struct Matrix {
typedef vector<T> vec;
typedef vector<vec> mat;
ll x, y; // x: horizon y: vertical
mat d;
Matrix(ll _y, ll _x = -1) {
if (_x == -1) _x = _y;
x = _x, y = _y;
for (int i = 0; i < y; i++) for (int j = 0; j < x; j++) d[i][j] = 0;
}
void unit() {
for (int i = 0; i < y; i++) for (int j = 0; j < x; j++) d[i][j] = i == j ? 1 : 0;
}
Matrix copy() {
Matrix m(y, x);
for (int i = 0; i < y; i++) for (int j = 0; j < x; j++) m.d[i][j] = d[i][j];
return m;
}
Matrix<T> operator + (Matrix<T>& t) { // No error check! Don't forget to check Matrix size!!
Matrix<T> m(y, x);
for (int i = 0; i < y; i++) for (int j = 0; j < x; j++) m.d[i][j] = d[i][j] + t.d[i][j];
return m;
}
Matrix<T> operator - (Matrix<T>& t) {
Matrix<T> m(y, x);
for (int i = 0; i < y; i++) for (int j = 0; j < x; j++) m.d[i][j] = d[i][j] - t.d[i][j];
return m;
}
Matrix<T> operator * (T t) {
Matrix<T> m(y, x);
for (int i = 0; i < y; i++) for (int j = 0; j < x; j++) m.d[i][j] = d[i][j] * t;
return m;
}
Matrix<T> det(Matrix<T>& t) { // x need to correspond to t.y
Matrix<T> m(y, x);
for (int i = 0; i < y; i++)
for (int j = 0; j < x; j++)
for (int k = 0; k < t.x; k++) m.d[i][j] += d[i][k] * t.d[k][j]; ////////////// mod???
return m;
}
};
/**** Zip ****/
template <typename T>
class Zip {
vector<T> d;
bool flag;
public:
Zip() {
flag = false;
}
void add(T x) {
d.push_back(x);
flag = true;
}
ll getNum(T x) { // T need to have operator < !!
if (flag) {
sort(d.begin(), d.end());
d.erase(unique(d.begin(), d.end()), d.end());
flag = false;
}
return lower_bound(d.begin(), d.end(), x) - d.begin();
}
ll size() {
return (ll)d.size();
}
};
/**** Union Find ****/
class UnionFind {
ll par[UNION_FIND_MAX];
ll rank[UNION_FIND_MAX];
public:
void init(ll n) {
for (ll i = 0; i < n; i++) par[i] = i, rank[i] = 0;
}
UnionFind(ll n) {
init(n);
}
ll findRoot(ll x) {
if (par[x] == x) return x;
return par[x] = findRoot(par[x]);
}
void merge(ll x, ll y) {
x = findRoot(x);
y = findRoot(y);
if (x == y) return;
if (rank[x] < rank[y]) {
par[x] = y;
} else {
par[y] = x;
if (rank[x] == rank[y]) rank[x]++;
}
}
bool isSame(ll x, ll y) {
return findRoot(x) == findRoot(y);
}
};
template <typename T>
class UnionFindT {
ll par[UNION_FIND_MAX];
ll rank[UNION_FIND_MAX];
T weight[UNION_FIND_MAX];
public:
void init(ll n, T w) {
for (ll i = 0; i < n; i++) par[i] = i, rank[i] = 0, weight[i] = w;
}
UnionFindT(ll n, T w) {
init(n, w);
}
ll findRoot(ll x) {
if (par[x] == x) return x;
weight[x] += weight[par[x]];
return par[x] = findRoot(par[x]);
}
T getWeight(ll x) {
findRoot(x);
return weight[x];
}
bool merge(ll x, ll y, T w) {
// weight(y) = weight(x) + wにする
w += weight(x);
w -= weight(y);
x = findRoot(x);
y = findRoot(y);
if (x == y) return false;
if (rank[x] < rank[y]) {
par[x] = y;
weight[x] = -w;
} else {
par[y] = x;
weight[y] = w;
if (rank[x] == rank[y]) rank[x]++;
}
return true;
}
T diff(ll x, ll y) { // xが基準でyの重み
return weight(y) - weight(x);
}
bool isSame(ll x, ll y) {
return findRoot(x) == findRoot(y);
}
};
/**** Segment Tree ****/
template <typename T>
struct SegmentTree {
ll n;
T dat[SEGMENT_TREE_MAX];
function<T(T, T)> acc;
T out;
SegmentTree(function<T(T, T)> func, T overNum) {
acc = func;
out = overNum;
}
void init(ll _n) {
n = 1;
while (n < _n) n *= 2;
for (ll i = 0; i < 2 * n - 1; i++) dat[i] = out;
}
void nodeUpdate(ll k, T d) {
// k番目をdに変える
k += n - 1;
dat[k] = d;
while (k > 0) {
k = (k - 1) / 2;
dat[k] = acc(dat[k * 2 + 1], dat[k * 2 + 2]);
}
}
T rangeQuery(ll a, ll b) {
return tempRangeQuery(a, b, 0, 0, n);
}
private:
T tempRangeQuery(const ll& a, const ll& b, ll k, ll l, ll r) {
if (r <= a || b <= l) return out;
if (a <= l && r <= b) return dat[k];
T vl = tempRangeQuery(a, b, k * 2 + 1, l, (l + r) / 2);
T vr = tempRangeQuery(a, b, k * 2 + 2, (l + r) / 2, r);
return acc(vl, vr);
}
};
/**** Network Flow ****/
class MaxFlow {
public:
struct edge { ll to, cap, rev; };
vector<edge> G[MAX_FLOW_MAX_V];
bool used[MAX_FLOW_MAX_V];
ll level[MAX_FLOW_MAX_V];
ll iter[MAX_FLOW_MAX_V];
void init() {
for (ll i = 0; i < MAX_FLOW_MAX_V; i++) {
G[i].clear();
}
}
void add_edge(ll from, ll to, ll cap) {
G[from].push_back((edge){to, cap, (ll)G[to].size()});
G[to].push_back((edge){from, 0, (ll)G[from].size() - 1});
}
void add_undirected_edge(ll e1, ll e2, ll cap) {
G[e1].push_back((edge){e2, cap, (ll)G[e2].size()});
G[e2].push_back((edge){e1, cap, (ll)G[e1].size() - 1});
}
ll dfs(ll v, ll t, ll f) {
if (v == t) return f;
used[v] = true;
for (ll i = 0; i < (ll)G[v].size(); i++) {
edge &e = G[v][i];
if (!used[e.to]&& e.cap > 0) {
ll d = dfs(e.to, t, min(f, e.cap));
if (d > 0) {
e.cap -= d;
G[e.to][e.rev].cap += d;
return d;
}
}
}
return 0;
}
ll max_flow(ll s, ll t) {
ll flow = 0;
while (1) {
memset(used, 0, sizeof(used));
ll f = dfs(s, t, INF);
if (f == 0) return flow;
flow += f;
}
}
void bfs(ll s) {
memset(level, -1, sizeof(level));
queue<ll> que;
level[s] = 0;
que.push(s);
while (!que.empty()) {
ll v = que.front(); que.pop();
for (ll i = 0; i < (ll)G[v].size(); i++) {
edge &e = G[v][i];
if (e.cap > 0 && level[e.to] < 0) {
level[e.to] = level[v] + 1;
que.push(e.to);
}
}
}
}
ll dinic_dfs(ll v, ll t, ll f) {
if (v == t) return f;
for (ll &i= iter[v]; i < (ll)G[v].size(); i++) {
edge &e = G[v][i];
if (e.cap > 0 && level[v] < level[e.to]) {
ll d = dinic_dfs(e.to, t, min(f, e.cap));
if (d > 0) {
e.cap -= d;
G[e.to][e.rev].cap += d;
return d;
}
}
}
return 0;
}
ll dinic(ll s, ll t) {
ll flow = 0;
while (1) {
bfs(s);
if (level[t] < 0) return flow;
memset(iter, 0, sizeof(iter));
ll f;
while ((f = dinic_dfs(s, t, INF)) > 0) {
flow += f;
}
}
}
};
/**** bipartite matching ****/
class BipartiteMatching {
public:
ll V;
vector<ll> G[BIPARTITE_MATCHING_MAX_V];
ll match[BIPARTITE_MATCHING_MAX_V];
bool used[BIPARTITE_MATCHING_MAX_V];
BipartiteMatching(ll v) {
V = v;
}
void init(ll v) {
V = v;
for (ll i = 0; i < BIPARTITE_MATCHING_MAX_V; i++) {
G[i].clear();
}
}
void add_edge(ll u, ll v) {
G[u].push_back(v);
G[v].push_back(u);
}
bool dfs(ll v) {
used[v] = true;
for (ll i = 0; i < (ll)G[v].size(); i++) {
ll u = G[v][i], w = match[u];
if (w < 0 || !used[w] && dfs(w)) {
match[v] = u;
match[u] = v;
return true;
}
}
return false;
}
ll max_matching() {
ll res = 0;
memset(match, -1, sizeof(match));
for (ll v = 0; v < V;v++) {
if (match[v] < 0) {
memset(used, 0, sizeof(used));
if (dfs(v)) {
res++;
}
}
}
return res;
}
};
class MinCostFlow {
public:
struct edge { ll to, cap, cost, rev; };
ll V;
vector<edge> G[MIN_COST_FLOW_MAX_V];
ll dist[MIN_COST_FLOW_MAX_V];
ll prevv[MIN_COST_FLOW_MAX_V];
ll preve[MIN_COST_FLOW_MAX_V];
ll h[MIN_COST_FLOW_MAX_V];
MinCostFlow(ll v) {
V = v;
}
void init() {
for (ll i = 0; i < MAX_FLOW_MAX_V; i++) {
G[i].clear();
}
}
void add_edge(ll from, ll to, ll cap, ll cost) {
G[from].push_back((edge){to, cap, cost, (ll)G[to].size()});
G[to].push_back((edge){from, 0, -cost, (ll)G[from].size() - 1});
}
void add_undirected_edge(ll e1, ll e2, ll cap, ll cost) {
add_edge(e1, e2, cap, cost);
add_edge(e2, e1, cap, cost);
}
ll min_cost_flow(ll s, ll t, ll f) { // minas
ll res = 0;
while (f > 0) {
fill(dist, dist + V, INF);
dist[s] = 0;
bool update = true;
while (update) {
update = false;
for (ll v = 0; v < V; v++) {
if (dist[v] == INF) continue;
for (ll i = 0; i < (ll)G[v].size(); i++) {
edge &e = G[v][i];
if (e.cap > 0 && dist[e.to] > dist[v] + e.cost) {
dist[e.to] = dist[v] + e.cost;
prevv[e.to] = v;
preve[e.to] = i;
update = true;
}
}
}
}
if (dist[t] == INF) {
return -1;
}
ll d = f;
for (ll v = t; v != s; v = prevv[v]) {
d = min(d, G[prevv[v]][preve[v]].cap);
}
f -= d;
res += d * dist[t];
for (ll v = t; v != s; v = prevv[v]) {
edge &e = G[prevv[v]][preve[v]];
e.cap -= d;
G[v][e.rev].cap += d;
}
}
return res;
}
ll min_cost_flow_dijkstra(ll s, ll t, ll f) {
ll res = 0;
fill(h, h + V, 0);
while (f > 0) {
priority_queue<P, vector<P>, greater<P> > que;
fill(dist, dist + V, 0);
dist[s] = 0;
que.push(P(0, s));
while (!que.empty()) {
P p = que.top(); que.pop();
int v = p.second;
if (dist[v] < p.first) continue;
for (int i = 0; i < G[v].size(); i++) {
edge &e = G[v][i];
if (e.cap > 0 && dist[e.to] > dist[v] + e.cost + h[v] - h[e.to]) {
dist[e.to] = dist[v] + e.cost + h[v] - h[e.to];
prevv[e.to] = v;
preve[e.to] = i;
que.push(P(dist[e.to], e.to));
}
}
}
if (dist[t] == INF) {
return -1;
}
for (int v = 0; v < V; v++) h[v] += dist[v];
int d = f;
for (int v = t; v != s; v = prevv[v]) {
d = tmin<ll>(d, G[prevv[v]][preve[v]].cap);
}
f -= d;
res += d * h[t];
for (int v = t; v != s; v = prevv[v]) {
edge &e = G[prevv[v]][preve[v]];
e.cap -= d;
G[v][e.rev].cap += d;
}
return res;
}
return 0;
}
};
/**** main function ****/
ll n, q, a[100000], x[100000], tempA[100000];
ll sum1[100000], sum2[100000];
bool check(ll conflict, ll x) {
if (2 * conflict + 2 >= n) return true;
ll t1 = a[conflict + 1], t2 = a[2 * conflict + 2];
if (t1 - x < x - t2) return true;
return false;
}
ll get(ll x) {
ll lb = -1, ub = n/2 + 2;
while (lb + 1 < ub) {
ll mid = (ub + lb) / 2;
if (check(mid, x)) ub = mid;
else lb = mid;
}
if (2 * ub + 2 >= n) return sum1[ub];
return sum1[ub] + sum2[2 * ub + 2];
}
int main() {
scanf("%lld%lld", &n, &q);
for (ll i = 0; i < n; i++) scanf("%lld", &tempA[i]), a[n - i - 1] = tempA[i];
for (ll i = 0; i < q; i++) scanf("%lld", &x[i]);
sum1[0] = a[0];
for (ll i = 1; i < n; i++) sum1[i] = sum1[i-1] + a[i];
if (n % 2 == 1) {
sum2[n-1] = a[n-1];
for (ll i = n-3; i >= 0; i -= 2) sum2[i] = sum2[i+2] + a[i];
} else {
sum2[n-2] = a[n-2];
for (ll i = n-4; i >= 0; i -= 2) sum2[i] = sum2[i+2] + a[i];
}
for (ll i = 0; i < q; i++) printf("%lld\n", get(x[i]));
}
|
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
int main()
{
int N, Q; cin >> N >> Q;
vector<long long> A(N); for (auto& a : A) cin >> a;
sort(begin(A), end(A));
vector<long long> B(N), C(N);
B[0] = A[0];
for (int i = 1; i < N; i++) B[i] = B[i-1] + A[i];
C[0] = A[0]; C[1] = A[1];
for (int i = 2; i < N; i++) C[i] = C[i-2] + A[i];
for (int i = 0; i < Q; i++) {
int x; cin >> x;
auto it = lower_bound(begin(A), end(A), x);
if (it == end(A)) {
cout << C[N-1] << '\n';
continue;
}
if (it == begin(A)) {
cout << B[N-1] - B[N / 2 - 1] << '\n';
continue;
}
int ng = distance(begin(A), it)-1, ok = N-1;
while (ok - ng > 1) {
int mid = (ng + ok) / 2;
int k = N - (N-mid) - (N-mid) + 1;
if (k >= 0 && abs(A[mid] - x) >= abs(A[k] - x)) {
ok = mid;
} else {
ng = mid;
}
}
int k = N - (N-ok) - (N-ok) + 1 - 2;
cout << B[N-1] - B[ok-1] + (k >= 0 ? C[k] : 0) << '\n';
}
return 0;
} |
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define f first
#define s second
#define all(a) (a).begin(),(a).end()
#define For(i,a,b) for(auto i=(a);i<(b);i++)
#define FOR(i,b) For(i,0,b)
#define Rev(i,a,b) for(auto i=(a);i>(b);i--)
#define REV(i,a) Rev(i,a,-1)
#define FORE(i,a) for(auto&&i:a)
template<class C>constexpr int sz(const C&c){return int(c.size());}
using ll=long long;using ld=long double;using uint=unsigned int;using ull=unsigned long long;
using pii=pair<int,int>;using pll=pair<ll,ll>;using pill=pair<int,ll>;using plli=pair<ll,int>;using pdd=pair<double,double>;using pld=pair<ld,ld>;
constexpr const char nl='\n',sp=' ';constexpr const int INT_INF=0x3f3f3f3f;constexpr const ll LL_INF=0x3f3f3f3f3f3f3f3f;
constexpr const double D_INF=numeric_limits<double>::infinity();constexpr const ld LD_INF=numeric_limits<ld>::infinity();
template<class T>constexpr const T&_min(const T&x,const T&y){return x<y?x:y;}template<class T>constexpr const T&_max(const T&x,const T&y){return x<y?y:x;}
template<class T,class...Ts>constexpr const T&_min(const T&x,const Ts&...xs){return _min(x,_min(xs...));}
template<class T,class...Ts>constexpr const T&_max(const T&x,const Ts&...xs){return _max(x,_max(xs...));}
template<class T,class...Ts>void MIN(T&x,const Ts&...xs){x=_min(x,xs...);}template<class T,class...Ts>void MAX(T&x,const Ts&...xs){x=_max(x,xs...);}
template<class T>constexpr const T&_clamp(const T&v,const T&lo,const T&hi){return v<lo?lo:hi<v?hi:v;}template<class T>void CLAMP(T&v,const T&lo,const T&hi){v=_clamp(v,lo,hi);}
template<class T,class...Args>unique_ptr<T>_make_unique(Args&&...args){return unique_ptr<T>(new T(forward<Args>(args)...));}
template<class T,class...Args>shared_ptr<T>_make_shared(Args&&...args){return shared_ptr<T>(new T(forward<Args>(args)...));}
#define min(...) _min(__VA_ARGS__)
#define max(...) _max(__VA_ARGS__)
#define clamp(...) _clamp(__VA_ARGS__)
#define make_unique _make_unique
#define make_shared _make_shared
template<class...Ts>using uset=unordered_set<Ts...>;template<class...Ts>using umap=unordered_map<Ts...>;
template<class T>using minpq=priority_queue<T,vector<T>,greater<T>>;template<class T>using maxpq=priority_queue<T,vector<T>,less<T>>;
template<class T1,class T2,class H1=hash<T1>,class H2=hash<T2>>struct pair_hash{size_t operator()(const pair<T1,T2>&p)const{return 31*H1{}(p.first)+H2{}(p.second);}};
template<class T>struct is_iterator {
template<class U,typename enable_if<!is_convertible<U,const char*>::value,int>::type=0>constexpr static auto has_indirection(int)->decltype(*declval<U>(),bool()){return true;}
template<class>constexpr static bool has_indirection(long){return false;}constexpr static bool value=has_indirection<T>(0);
};
seed_seq seq {
(uint64_t)chrono::duration_cast<chrono::nanoseconds>(chrono::high_resolution_clock::now().time_since_epoch()).count(),
(uint64_t)__builtin_ia32_rdtsc(),(uint64_t)(uintptr_t)make_unique<char>().get()
};
mt19937 rng(seq);mt19937_64 rng64(seq);
constexpr const int _bufferSize=4096,_maxNumLength=128;
char _inputBuffer[_bufferSize+1],*_inputPtr=_inputBuffer,_outputBuffer[_bufferSize],_c,_sign,*_tempInputBuf=nullptr,_numBuf[_maxNumLength],_tempOutputBuf[_maxNumLength],_fill=' ';
FILE*_input=stdin,*_output=stdout,*_error=stderr;const char*_delimiter=" ";int _cur,_outputPtr=0,_numPtr=0,_precision=6,_width=0,_tempOutputPtr=0,_cnt;ull _precisionBase=1000000;
#define _peekchar() (*_inputPtr?*_inputPtr:(_inputBuffer[fread(_inputPtr=_inputBuffer,1,_bufferSize,_input)]='\0',*_inputPtr))
#define _getchar() (*_inputPtr?*_inputPtr++:(_inputBuffer[fread(_inputPtr=_inputBuffer,1,_bufferSize,_input)]='\0',*_inputPtr++))
#define _hasNext() (*_inputPtr||!feof(_input))
#define _readSignAndNum(x) do{(x)=_getchar();}while((x)<=' ');_sign=(x)=='-';if(_sign)(x)=_getchar();for((x)-='0';(_c=_getchar())>='0';(x)=(x)*10+_c-'0')
#define _readFloatingPoint(x,T) for(T _div=1.0;(_c=_getchar())>='0';(x)+=(_c-'0')/(_div*=10))
#define rc(x) do{do{(x)=_getchar();}while((x)<=' ');}while(0)
#define ri(x) do{_readSignAndNum(x);if(_sign)(x)=-(x);}while(0)
#define rd(x) do{_readSignAndNum(x);if(_c=='.')_readFloatingPoint(x,double);if(_sign)(x)=-(x);}while(0)
#define rld(x) do{_readSignAndNum(x);if(_c=='.')_readFloatingPoint(x,ld);if(_sign)(x)=-(x);}while(0)
#define rcs(x) do{_cur=0;do{_c=_getchar();}while(_c<=' ');do{(x)[_cur++]=_c;}while((_c=_getchar())>' ');(x)[_cur]='\0';}while(0)
#define rs(x) do{if(!_tempInputBuf)assert(0);rcs(_tempInputBuf);(x)=string(_tempInputBuf,_cur);}while(0)
#define rcln(x) do{_cur=0;while((_c=_getchar())!='\n'){if(_c!='\r')(x)[_cur++]=_c;}(x)[_cur]='\0';}while(0)
#define rln(x) do{if(!_tempInputBuf)assert(0);rcln(_tempInputBuf);(x)=string(_tempInputBuf,_cur);}while(0)
void setLength(int x){if(_tempInputBuf)delete[](_tempInputBuf);_tempInputBuf=new char[x+1];}
void read(int&x){ri(x);}void read(uint&x){ri(x);}void read(ll&x){ri(x);}void read(ull&x){ri(x);}void read(double&x){rd(x);}void read(ld&x){rld(x);}
void read(char&x){rc(x);}void read(char*x){rcs(x);}void read(string&x){rs(x);}void readln(char*x){rcln(x);}void readln(string&x){rln(x);}
template<class T1,class T2>void read(pair<T1,T2>&x){read(x.first);read(x.second);}template<class T>void read(complex<T>&x){T _re,_im;read(_re);read(_im);x.real(_re);x.imag(_im);}
template<class T>void read(T&x);template<class T,class...Ts>void read(T&x,Ts&&...xs);
template<class It>typename enable_if<is_iterator<It>::value>::type read(It st,It en){for(It _i=st;_i!=en;_i++)read(*_i);}
template<class It,class...Ts>typename enable_if<is_iterator<It>::value>::type read(It st,It en,Ts&&...xs){read(st,en);read(forward<Ts>(xs)...);}
template<class T>void read(T&x){for(auto&&_i:x)read(_i);}template<class T,class...Ts>void read(T&x,Ts&&...xs){read(x);read(forward<Ts>(xs)...);}
bool hasNext(){while(_hasNext()&&_peekchar()<=' ')_getchar();return _hasNext();}bool hasNextLine(){while(_hasNext()&&_peekchar()=='\r')_getchar();return _hasNext();}
void setInput(FILE*file){*_inputPtr='\0';_input=file;}void setInput(const char*s){*_inputPtr='\0';_input=fopen(s,"r");}void setInput(const string&s){*_inputPtr='\0';_input=fopen(s.c_str(),"r");}
#define _flush() do{_flushBuf();fflush(_output);}while(0)
#define _flushBuf() (fwrite(_outputBuffer,1,_outputPtr,_output),_outputPtr=0)
#define _putchar(x) (_outputBuffer[_outputPtr==_bufferSize?_flushBuf():_outputPtr]=(x),_outputPtr++)
#define _writeTempBuf(x) (_tempOutputBuf[_tempOutputPtr++]=(x))
#define _writeOutput() for(int _i=0;_i<_tempOutputPtr;_putchar(_tempOutputBuf[_i++]));_tempOutputPtr=0
#define _writeNum(x,T,digits) _cnt=0;for(T _y=(x);_y;_y/=10,_cnt++)_numBuf[_numPtr++]='0'+_y%10;for(;_cnt<digits;_cnt++)_numBuf[_numPtr++]='0';_flushNumBuf();
#define _writeFloatingPoint(x,T) ull _I=(ull)(x);ull _F=((x)-_I)*_precisionBase+(T)(0.5);if(_F>=_precisionBase){_I++;_F=0;}_writeNum(_I,ull,1);_writeTempBuf('.');_writeNum(_F,ull,_precision)
#define _checkFinite(x) if(std::isnan(x)){wcs("NaN");}else if(std::isinf(x)){wcs("Inf");}
#define _flushNumBuf() for(;_numPtr;_writeTempBuf(_numBuf[--_numPtr]))
#define _fillBuf(x) for(int _i=0;_i<(x);_i++)_putchar(_fill)
#define _flushTempBuf() int _tempLen=_tempOutputPtr;_fillBuf(_width-_tempLen);_writeOutput();_fillBuf(-_width-_tempLen)
#define wb(x) do{if(x)_writeTempBuf('1');else _writeTempBuf('0');_flushTempBuf();}while(0)
#define wc(x) do{_writeTempBuf(x); _flushTempBuf();}while(0)
#define wi(x) do{if((x)<0){_writeTempBuf('-');_writeNum(-(x),uint,1);}else{_writeNum(x,uint,1);}_flushTempBuf();}while(0)
#define wll(x) do{if((x)<0){_writeTempBuf('-');_writeNum(-(x),ull,1);}else{_writeNum(x,ull,1);}_flushTempBuf();}while(0)
#define wd(x) do{_checkFinite(x)else if((x)<0){_writeTempBuf('-');_writeFloatingPoint(-(x),double);}else{_writeFloatingPoint(x,double);}_flushTempBuf();}while(0)
#define wld(x) do{_checkFinite(x)else if((x)<0){_writeTempBuf('-');_writeFloatingPoint(-(x),ld);}else{_writeFloatingPoint(x,ld);}_flushTempBuf();}while(0)
#define wcs(x) do{int _slen=strlen(x);_fillBuf(_width-_slen);for(const char*_p=(x);*_p;_putchar(*_p++));_fillBuf(-_width-_slen);}while(0)
#define ws(x) do{_fillBuf(_width-int((x).length()));for(int _i=0;_i<int((x).length());_putchar(x[_i++]));_fillBuf(-_width-int((x).length()));}while(0)
void setPrecision(int x){_precision=x;_precisionBase=1;for(int _i=0;_i<x;_i++,_precisionBase*=10);}void setWidth(int x){_width=x;}void setFill(char x){_fill=x;}
void setDelimiter(const char*x){_delimiter=x;}void setDelimiter(const string&x){_delimiter=x.c_str();}
void writeDelimiter(){for(const char*_p=_delimiter;*_p;_putchar(*_p++));}
void write(const bool&x){wb(x);}void write(const int&x){wi(x);}void write(const uint&x){wi(x);}void write(const ll&x){wll(x);}void write(const ull&x){wll(x);}
void write(const double&x){wd(x);}void write(const ld&x){wld(x);}void write(const char&x){wc(x);}void write(const char*x){wcs(x);}void write(const string&x){ws(x);}
template<class T1,class T2>void write(const pair<T1,T2>&x){write(x.first);writeDelimiter();write(x.second);}
template<class T>void write(const complex<T>&x){write(x.real());writeDelimiter();write(x.imag());}
template<class T>void write(const T&x);template<class T,class...Ts>void write(const T&x,Ts&&...xs);
template<class It>typename enable_if<is_iterator<It>::value>::type write(It st,It en){bool _first=1;for(It _i=st;_i!=en;_i++){if(_first)_first=0;else writeDelimiter();write(*_i);}}
template<class It,class...Ts>typename enable_if<is_iterator<It>::value>::type write(It st,It en,Ts&&...xs){write(st,en);writeDelimiter();write(forward<Ts>(xs)...);}
template<class T>void write(const T&x){bool _first=1;for(auto&&_i:x){if(_first)_first=0;else writeDelimiter();write(_i);}}
template<class T,class...Ts>void write(const T&x,Ts&&...xs){write(x);writeDelimiter();write(forward<Ts>(xs)...);}
void writeln(){_putchar('\n');}template<class...Ts>void writeln(Ts&&...xs){write(forward<Ts>(xs)...);_putchar('\n');}
void flush(){_flush();}class IOManager{public:~IOManager(){flush();if(_tempInputBuf)delete[](_tempInputBuf);}};unique_ptr<IOManager>iomanager=make_unique<IOManager>();
void setOutput(FILE*file){flush();_output=file;}void setOutput(const char*s){flush();_output=fopen(s,"w");}void setOutput(const string&s){flush();_output=fopen(s.c_str(),"w");}
template<class...Ts>void debug(const Ts&...xs){FILE*_temp=_output;setOutput(_error);write(xs...);setOutput(_temp);}
template<class...Ts>void debugln(const Ts&...xs){FILE*_temp=_output;setOutput(_error);writeln(xs...);setOutput(_temp);}
void setError(FILE*file){flush();_error=file;}void setError(const char*s){flush();_error=fopen(s,"w");}void setError(const string&s){flush();_error=fopen(s.c_str(),"w");}
const int MAXN = 1e5 + 5;
int N, Q;
ll A[MAXN], pre[MAXN][3];
ll solve(ll X) {
if (X <= A[0]) return pre[N][2] - pre[N / 2][2];
else if (X >= A[N - 1]) return pre[N][(N - 1) % 2];
ll lo = 0, hi = 1e9 + 5;
while (lo < hi) {
ll mid = lo + (hi - lo) / 2;
auto l = lower_bound(A, A + N, X - mid), r = prev(upper_bound(A, A + N, X + mid));
if (l == A + N) l--;
if (r == A + N) r--;
int cnt1 = N - (r - A) - 1, cnt2 = r - l + 1;
if (X - *l == *r - X && (cnt1 + 1 == cnt2 - 1 || cnt1 + 1 == cnt2) && r > A) {
r--;
cnt1++;
cnt2--;
}
if (cnt1 == cnt2 + 1 && l > A) l--;
if (cnt1 == cnt2 || cnt1 == cnt2 + 1) return pre[N][2] - pre[r - A + 1][2] + pre[l - A][1 - (l - A) % 2];
else if (cnt1 < cnt2) hi = mid;
else lo = mid + 1;
}
assert(false);
return -1;
}
int main() {
// setInput("in.txt");
// setOutput("out.txt");
// setError("err.txt");
read(N, Q);
read(A, A + N);
pre[0][0] = pre[0][1] = pre[0][2] = 0;
FOR(i, N) {
pre[i + 1][0] = pre[i][0];
pre[i + 1][1] = pre[i][1];
pre[i + 1][i % 2] += A[i];
pre[i + 1][2] = pre[i][2] + A[i];
}
ll X;
FOR(i, Q) {
read(X);
writeln(solve(X));
flush();
}
return 0;
}
|
p03158 | C++ | #include <iostream>
#include <algorithm>
#include <vector>
#define int long long
#define rep(i, n) for(i = 0; i < n; i++)
using namespace std;
typedef pair<int, int> P;
int INF = 1000000007;
int n, q;
int a[100000];
P query[100000];
int xs[100000];
int imos[100001];
int ans[100000];
int getRx(int i) {
if ((n - i) % 2 == 0) return INF;
int st = a[i], ed = INF, mid; //[st, ed), oooxxx
while (ed - st >= 2) {
mid = (st + ed) / 2;
int dist = mid - a[i];
int id = lower_bound(a, a + n, mid + dist) - a;
if (id - i <= n - id) { st = mid; }
else { ed = mid; }
}
return st;
}
signed main() {
int i;
int sumA = 0;
cin >> n >> q;
rep(i, n) { cin >> a[i]; sumA += a[i]; }
rep(i, q) {
int x; cin >> x;
query[i] = P(x, i);
}
sort(query, query + q);
rep(i, q) xs[i] = query[i].first;
rep(i, n) {
//a[i]をゲットできるxの範囲(左端)
int lx;
int take = n - 1 - i;
int p = i - take;
if (p < 0) lx = 0;
else lx = (a[p] + a[i]) / 2 + 1;
//a[i]をゲットできるxの範囲(右端)
int rx = getRx(i);
//cout << a[i] << " " << lx << " " << rx << endl;
int idL = lower_bound(xs, xs + q, lx) - xs;
int idR = upper_bound(xs, xs + q, rx) - xs;
imos[idL] += a[i];
imos[idR] -= a[i];
}
rep(i, q) imos[i + 1] += imos[i];
rep(i, q) {
ans[query[i].second] = sumA - imos[i];
}
rep(i, q) cout << ans[i] << endl;
return 0;
} |
p03158 | C++ | #include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int n,q;
long a[1<<17],sum[1<<17];
long ans[1<<17];
main()
{
cin>>n>>q;
for(int i=0;i<n;i++)
{
cin>>a[i];
sum[i+1]=sum[i]+a[i];
}
vector<pair<int,int> >query;
for(int i=0;i<q;i++)
{
int x;cin>>x;
query.push_back(make_pair(x,i));
}
sort(query.begin(),query.end());
int L=0,R=0;
long left=0;
for(int i=0;i<q;i++)
{
long x=query[i].first;
while(L<n&&lower_bound(a,a+n,x+(x-a[L]))-lower_bound(a,a+n,a[L])
>a+n-lower_bound(a,a+n,x+(x-a[L])))
{
left=sum[L+1]-left;
L++;
}
while(R<n&&lower_bound(a,a+n,a[R])-lower_bound(a,a+n,x-(a[R]-x))
<a+n-lower_bound(a,a+n,a[R])-1)
{
R++;
}
ans[query[i].second]=(R-L<n-R?sum[L]-left:left)+sum[n]-sum[R];
}
for(int i=0;i<q;i++)cout<<ans[i]<<endl;
}
|
p03158 | C++ | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
ll n,q;cin>>n>>q;
ll niko[n];
ll sum[n];
ll a[n];
for(ll i=0;i<n;i++){
cin>>a[i];
if(i==0)sum[i]=a[i];
else sum[i]=sum[i-1]+a[i];
if(i==0||i==1)niko[i]=a[i];
else niko[i]=niko[i-2]+a[i];
}
vector<ll> kyou;
for(ll i=n/2;i<n-1;i++){
ll t=n-i-1;
kyou.push_back((a[i]+a[i-t])/2+1);
}
kyou.push_back((a[n-1]+a[n-2])/2+1);
//for(ll i=0;i<n;i++)cout<<niko[i];return 0;
for(ll i=0;i<q;i++){
ll x;cin>>x;
ll y=upper_bound(kyou.begin(),kyou.end(),x)-kyou.begin();
//cout<<y<<endl;
if(y==0)cout<<sum[n-1]-sum[n/2-1]<<endl;
else if(y==kyou.size()){
cout<<niko[n-1]<<endl;
}
else{
ll u=n/2+y-1;
ll ans=sum[n-1]-sum[u];
cout<<ans+niko[2*u-n+1]<<endl;
}
}
} |
p03158 | C++ | #include <algorithm>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define FOR(i,k,n) for (int (i)=(k); (i)<(n); ++(i))
#define rep(i,n) FOR(i,0,n)
#define all(v) begin(v), end(v)
#define debug(x) std::cerr<< #x <<": "<<x<<"\n"
#define debug2(x,y) std::cerr<< #x <<": "<< x <<", "<< #y <<": "<< y <<"\n"
typedef long long ll;
typedef std::pair<int, int> pii;
typedef std::vector<int> vi;
typedef std::vector<std::vector<int> > vvi;
typedef std::vector<ll> vll;
typedef std::vector<std::vector<ll> > vvll;
typedef std::deque<bool> db;
template<class T> using vv=std::vector<std::vector< T > >;
// cout vector
template<typename T> std::ostream& operator<<(std::ostream& s, const std::vector<T>& v) {
int len=v.size();s<<"\n";rep(i,len){s<<v[i];if(i<len-1){s << "\t";}}s<<"\n";return s; }
// cout 2-dimentional vector
template<typename T> std::ostream& operator<<(std::ostream& s, const std::vector<std::vector<T> >& vv) {
int len=vv.size();rep(i,len){s<<vv[i];} return s; }
// cout deque
template<typename T> std::ostream& operator<<(std::ostream& s, const std::deque<T>& v) {
int len=v.size();s<<"\n";rep(i,len){s<<v[i];if(i<len-1){s << "\t";}}s<<"\n";return s; }
// cout 2-dimentional deque
template<typename T> std::ostream& operator<<(std::ostream& s, const std::deque<std::deque<T> >& vv) {
int len=vv.size();rep(i,len){s<<vv[i];} return s; }
// cout set<cout-able>
template<typename T> std::ostream& operator<<(std::ostream& s, const std::set<T>& v) {
s<<"\n";for(auto elm : v){s<<elm<<"\t";}s<<"\n";return s; }
inline void scan(int&a){scanf("%d",&a);}
inline void scan(int&a,int&b){scanf("%d%d",&a,&b);}
inline void scan(int&a,int&b,int&c){scanf("%d%d%d",&a,&b,&c);}
inline void scan(int&a,int&b,int&c,int&d){scanf("%d%d%d%d",&a,&b,&c,&d);}
inline void scan(std::vector<int>&v){int sz=v.size();rep(i,sz){scan(v[i]);}}
inline void scan(std::vector<std::vector<int> >&v){int sz=v.size();rep(i,sz){scan(v[i]);}}
inline void scan(ll&a){scanf("%lld",&a);}
inline void scan(ll&a,ll&b){scanf("%lld%lld",&a,&b);}
inline void scan(ll&a,ll&b,ll&c){scanf("%lld%lld%lld",&a,&b,&c);}
inline void scan(ll&a,ll&b,ll&c,ll&d){scanf("%lld%lld%lld%lld",&a,&b,&c,&d);}
inline void scan(std::vector<ll>&v){int sz=v.size();rep(i,sz){scan(v[i]);}}
inline void scan(std::vector<std::vector<ll> >&v){int sz=v.size();rep(i,sz){scan(v[i]);}}
inline void scan(char&a){scanf(" %c",&a);}
inline void scan(std::vector<char>&v){int sz=v.size();rep(i,sz){scan(v[i]);}}
inline void scan(std::vector<std::vector<char> >&v){int sz=v.size();rep(i,sz){scan(v[i]);}}
inline void scan(std::string&s){char BUF[3000000];scanf(" %s",BUF);s=std::string(BUF);}
inline void print(int a){printf("%d\n",a);}
inline void print(int a,int b){printf("%d %d\n",a,b);}
inline void print(ll a){printf("%lld\n",a);}
inline void print(ll a,ll b){printf("%lld %lld\n",a,b);}
inline void print(std::string s){std::cout << s << "\n";}
inline void print_yn(bool flg){if(flg){printf("Yes\n");}else{printf("No\n");}}
using namespace std;
int n, q;
vi a;
vll accum;
vi calc(int x, int width) {
int bottom = x - width;
int top = x + width;
int lb = lower_bound(all(a), bottom) - begin(a);
int ub = upper_bound(all(a), top) - begin(a);
int takahashi = n - ub;
int aoki = ub - lb;
if (ub > 0 && a[ub-1] == top) {
if (takahashi < aoki) {
takahashi += 1;
aoki -= 1;
}
}
if (takahashi == aoki || takahashi - 1 == aoki) {
return {0, takahashi, aoki};
}
if (takahashi < aoki) {
return {-1};
} else {
return {1};
}
}
int main() {
scan(n, q);
a.resize(n);
scan(a);
accum.assign(n+1, 0);
rep (i, n) {
accum[i+1] = accum[i] + a[i];
}
vll accum_sep(n+1, 0);
accum_sep[1] = a[0];
FOR (i, 2, n+1) {
accum_sep[i] = accum_sep[i-2] + a[i-1];
}
vi x(q);
scan(x);
rep (i, q) {
int l = 0;
int r = 1e9;
while (true) {
int mid = (l + r) / 2;
auto res = calc(x[i], mid);
if (res[0] == 0) {
ll sum = accum[n] - accum[n - res[1]];
if (res[1] == res[2]) {
sum += accum_sep[n - res[1] - res[2]];
} else {
sum += accum[n - res[1] - res[2]] - accum_sep[n - res[1] - res[2]];
}
print(sum);
break;
} else if (res[0] == -1) {
r = mid;
} else {
l = mid;
}
}
}
return 0;
}
|
p03158 | C++ | #include <vector>
#include <iostream>
#include <algorithm>
#include <string>
#include <set>
#include <vector>
#include <queue>
#include <numeric>
using namespace std;
int main() {
int n, q;
vector<int64_t> a;
int64_t sum_t = 0;
int64_t sum_a = 0;
int64_t allsum = 0;
cin >> n >> q;
for (int i = 0; i < n; ++i) {
int64_t ai;
cin >> ai;
a.push_back(ai);
if (i % 2 == n%2) sum_a += ai;
else sum_t += ai;
allsum += ai;
}
vector<int64_t> thr;
vector<int64_t> val;
for (int i = 1; i < n; ++i) {
int ind1 = n - 1 - i;
int ind2 = n - 1 - 2 * i;
if (ind2 >= 0) {
int64_t t = (a[ind1] + a[ind2]) / 2;
thr.push_back(t);
val.push_back(sum_a);
sum_a = sum_a - a[ind1] + a[ind2];
}
else {
ind2 = 0;
int64_t t = (a[ind1] + a[ind2]) / 2;
thr.push_back(0);
val.push_back(sum_a);
}
}
reverse(thr.begin(), thr.end());
reverse(val.begin(), val.end());
for (int i = 0; i < q; ++i) {
int64_t xi;
cin >> xi;
auto ite = lower_bound(thr.begin(), thr.end(),xi);
int dis = distance(thr.begin(), ite)-1;
if (dis <= 0) dis = 0;
cout << allsum-val[dis] << endl;
}
return 0;
} |
p03158 | C++ | #include <bits/stdc++.h>
#include <sys/time.h>
using namespace std;
#define rep(i,n) for(long long i = 0; i < (long long)(n); i++)
#define repi(i,a,b) for(long long i = (long long)(a); i < (long long)(b); i++)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define mt make_tuple
#define mp make_pair
template<class T1, class T2> bool chmin(T1 &a, T2 b) { return b < a && (a = b, true); }
template<class T1, class T2> bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
using ll = long long; using vll = vector<ll>; using vvll = vector<vll>; using P = pair<ll, ll>;
ll ugauss(ll a, ll b) { if (!a) return 0; if (a>0^b>0) return a/b; else return (a+(a>0?-1:1))/b+1; }
ll lgauss(ll a, ll b) { if (!a) return 0; if (a>0^b>0) return (a+(a>0?-1:1))/b-1; else return a/b; }
template <typename T, typename U> ostream &operator<<(ostream &o, const pair<T, U> &v) { o << "(" << v.first << ", " << v.second << ")"; return o; }
template<size_t...> struct seq{}; template<size_t N, size_t... Is> struct gen_seq : gen_seq<N-1, N-1, Is...>{}; template<size_t... Is> struct gen_seq<0, Is...> : seq<Is...>{};
template<class Ch, class Tr, class Tuple, size_t... Is>
void print_tuple(basic_ostream<Ch,Tr>& os, Tuple const& t, seq<Is...>){ using s = int[]; (void)s{0, (void(os << (Is == 0? "" : ", ") << get<Is>(t)), 0)...}; }
template<class Ch, class Tr, class... Args>
auto operator<<(basic_ostream<Ch, Tr>& os, tuple<Args...> const& t) -> basic_ostream<Ch, Tr>& { os << "("; print_tuple(os, t, gen_seq<sizeof...(Args)>()); return os << ")"; }
ostream &operator<<(ostream &o, const vvll &v) { rep(i, v.size()) { rep(j, v[i].size()) o << v[i][j] << " "; o << endl; } return o; }
template <typename T> ostream &operator<<(ostream &o, const vector<T> &v) { o << '['; rep(i, v.size()) o << v[i] << (i != v.size()-1 ? ", " : ""); o << "]"; return o; }
template <typename T> ostream &operator<<(ostream &o, const deque<T> &v) { o << '['; rep(i, v.size()) o << v[i] << (i != v.size()-1 ? ", " : ""); o << "]"; return o; }
template <typename T> ostream &operator<<(ostream &o, const set<T> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it << (next(it) != m.end() ? ", " : ""); o << "]"; return o; }
template <typename T> ostream &operator<<(ostream &o, const unordered_set<T> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it << (next(it) != m.end() ? ", " : ""); o << "]"; return o; }
template <typename T, typename U> ostream &operator<<(ostream &o, const map<T, U> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it << (next(it) != m.end() ? ", " : ""); o << "]"; return o; }
template <typename T, typename U, typename V> ostream &operator<<(ostream &o, const unordered_map<T, U, V> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it; o << "]"; return o; }
vector<int> range(const int x, const int y) { vector<int> v(y - x + 1); iota(v.begin(), v.end(), x); return v; }
template <typename T> istream& operator>>(istream& i, vector<T>& o) { rep(j, o.size()) i >> o[j]; return i;}
template <typename T, typename S, typename U> ostream &operator<<(ostream &o, const priority_queue<T, S, U> &v) { auto tmp = v; while (tmp.size()) { auto x = tmp.top(); tmp.pop(); o << x << " ";} return o; }
template <typename T> ostream &operator<<(ostream &o, const queue<T> &v) { auto tmp = v; while (tmp.size()) { auto x = tmp.front(); tmp.pop(); o << x << " ";} return o; }
template <typename T> ostream &operator<<(ostream &o, const stack<T> &v) { auto tmp = v; while (tmp.size()) { auto x = tmp.top(); tmp.pop(); o << x << " ";} return o; }
template <typename T> unordered_map<T, ll> counter(vector<T> vec){unordered_map<T, ll> ret; for (auto&& x : vec) ret[x]++; return ret;};
void vizGraph(vvll& g, int mode = 0, string filename = "out.png") { ofstream ofs("./out.dot"); ofs << "digraph graph_name {" << endl; set<P> memo; rep(i, g.size()) rep(j, g[i].size()) { if (mode && (memo.count(P(i, g[i][j])) || memo.count(P(g[i][j], i)))) continue; memo.insert(P(i, g[i][j])); ofs << " " << i << " -> " << g[i][j] << (mode ? " [arrowhead = none]" : "")<< endl; } ofs << "}" << endl; ofs.close(); system(((string)"dot -T png out.dot >" + filename).c_str()); }
struct timeval start; double sec() { struct timeval tv; gettimeofday(&tv, NULL); return (tv.tv_sec - start.tv_sec) + (tv.tv_usec - start.tv_usec) * 1e-6; }
size_t random_seed; struct init_{init_(){ ios::sync_with_stdio(false); cin.tie(0); gettimeofday(&start, NULL); struct timeval myTime; struct tm *time_st; gettimeofday(&myTime, NULL); time_st = localtime(&myTime.tv_sec); srand(myTime.tv_usec); random_seed = RAND_MAX / 2 + rand() / 2; }} init__;
#define ldout fixed << setprecision(40)
#define EPS (double)1e-14
#define INF (ll)1e18
#define mo (ll)(1e9+7)
uint64_t xor128(void) {
static uint64_t x = 123456789;
static uint64_t y = 362436069;
static uint64_t z = 521288629;
static uint64_t w = 88675123;
uint64_t t;
t = x ^ (x << 11);
x = y; y = z; z = w;
return w = (w ^ (w >> 19)) ^ (t ^ (t >> 8));
}
struct Node {
ll Value;
Node *Lch = NULL, *Rch = NULL;
ll SubTreeSize;
ll Sum, Min, Max;
Node(ll V) : Value(V), SubTreeSize(1), Sum(V), Min(V), Max(V) {};
inline ll size(void) { return SubTreeSize; }
inline ll getSum(void) { return Sum; }
inline ll getMin(void) { return Min; }
inline ll getMax(void) { return Max; }
inline Node *Update(void)
{
SubTreeSize = (Lch?Lch->size():0) + (Rch?Rch->size():0) + 1;
Sum = (Lch?Lch->getSum():0) + (Rch?Rch->getSum():0) + Value;
Min = min((Lch?Lch->getMin():+INF), min((Rch?Rch->getMin():+INF), Value));
Max = max((Lch?Lch->getMax():-INF), max((Rch?Rch->getMax():-INF), Value));
return this;
}
};
inline int size(Node* t) { return t ? t->size() : 0; }
// 機能 1ノードの木を返す
// 引数 value: ノードの値
// 戻り値 木の根
inline Node *MakeRoot(ll value)
{
return new Node(value);
}
// 機能 位置posに新しいノードを挿入(区間反転とかそういうときに使う)
//引数 root: 木の根
//pos: 挿入位置
//value: 挿入ノードの値
//戻り値 新しい木の根
Node *Merge(Node *l, Node *r)
{
if(l == (Node *)NULL) return r;
if(r == (Node *)NULL) return l;
ll Left = l->SubTreeSize;
ll Right = r->SubTreeSize;
if(xor128() % (Left + Right) < Left) {
l->Rch = Merge(l->Rch, r);
return l->Update();
} else {
r->Lch = Merge(l, r->Lch);
return r->Update();
}
}
// pair<Node*, Node*> Split(t, k)
// 機能 木tを [0,k)[k,n)で分割
// 引数 t: 木の根
// k: 分割位置
// 戻り値 分割後の双方の木の根
pair< Node*, Node* > Split(Node *t, ll k) // [0, k), [k, n)
{
if(t == (Node *)NULL) return make_pair((Node *)NULL, (Node *)NULL);
if(k <= size(t->Lch)) {
pair< Node *, Node *> s = Split(t->Lch, k);
t->Lch = s.second;
return make_pair(s.first, t->Update());
} else {
pair< Node *, Node *> s = Split(t->Rch, k - size(t->Lch) - 1);
t->Rch = s.first;
return make_pair(t->Update(), s.second);
}
}
// 機能 位置posに新しいノードを挿入(区間反転とかそういうときに使う)
// 引数 root: 木の根
// pos: 挿入位置
// value: 挿入ノードの値
// 戻り値 新しい木の根
//
// a
//->a[0, root) value a[root, n)
Node *Insert(Node *root, ll pos, ll value)
{
Node *p = MakeRoot(value);
pair< Node *, Node *> s = Split(root, pos);
return Merge(Merge(s.first, p), s.second);
}
// 機能 pos番目のノードを削除
// 引数 root: 木の根
// pos: 削除位置
// 戻り値 新しい木の根
//
// a
//->a[0, pos) a[pos+1, n)
Node *Erase(Node *root, ll pos)
{
pair< Node *, Node *> s = Split(root, pos);
pair< Node *, Node *> t = Split(s.second, 1);
delete t.first;
return Merge(s.first, t.second);
}
// 機能 value 以上の最左位置を返す
// もしそのようなものがなかった場合、rootのサイズを返す
// 引数 root: 木の根
// value: 検索値
// 戻り値 位置
//
// 列が単調になっている必要がある
ll Lower_Bound(Node *root, ll Value)
{
if(root == (Node *)NULL) return 0;
if(Value <= root->Value) return Lower_Bound(root->Lch, Value);
return Lower_Bound(root->Rch, Value) + size(root->Lch) + 1;
}
// 機能 value より大きいものの最左位置を返す
// もしそのようなものがなかった場合、0を返すので、あとで0以上かをチェック
// 引数 root: 木の根
// value: 検索値
// 戻り値 位置
//
// 列が単調になっている必要がある
ll Upper_Bound(Node *root, ll Value)
{
if(root == (Node *)NULL) return 0;
if(Value < root->Value) return Upper_Bound(root->Lch, Value);
return Upper_Bound(root->Rch, Value) + size(root->Lch) + 1;
}
// 機能 value 以下の最右位置を返す
// もしそのようなものがなかった場合、-1を返す
// 引数 root: 木の根
// value: 検索値
// 戻り値 位置
//
// 列が単調になっている必要がある
ll rLower_Bound(Node *root, ll Value)
{
ll ret = Upper_Bound(root, Value) - 1;
return ret;
}
// 機能 value より小さいものの最右位置を返す
// もしそのようなものがなかった場合、-1を返す
// 引数 root: 木の根
// value: 検索値
// 戻り値 位置
//
// 列が単調になっている必要がある
ll rUpper_Bound(Node *root, ll Value)
{
ll ret = Lower_Bound(root, Value) - 1;
return ret;
}
// 機能 木に値 value のノードを挿入(setsetみたいに使いたいときに使う)
// 引数 root: 木の根
// value: 挿入値
// 戻り値 新しい木の根
//
// これのみを使っていると、列が単調になる
Node *Insert(Node *root, ll Value)
{
return Insert(root, Lower_Bound(root, Value), Value);
}
ostream &operator<<(ostream &o, const Node* root) {
if(root == (Node *)NULL) return o;
o << "(";
o << root->Lch;
o << "" << root->Value << "";
o << root->Rch;
o << ")";
return o;
}
// k-th number, sumなど高級な処理ができるset
struct Set {
Node* s = NULL;
bool isMultiset;
Set(bool isMultiset_ = 0) : isMultiset(isMultiset_) { }
// 集合のサイズ
// O(1)
int size(void) {
return s ? s->size() : 0;
}
// vを追加する
// O(log n)
void insert(ll v) {
if (isMultiset == 0 && count(v)) return;
s = Insert(s, v);
}
// vを削除する
// O(log n)
void erase(ll v) {
ll pos = Lower_Bound(s, v);
if (pos == size() || quantile(pos) != v) assert(0); // 無いものは消せない
s = Erase(s, pos);
}
// k番目に小さい値を削除する
// O(log n)
void erasePos(ll k) {
assert(s);
assert(k < size());
s = Erase(s, k);
}
// vが何個setに入っているか？
// O(log n)
int count(ll v) {
if (!s) return 0;
ll pos = Lower_Bound(s, v);
if (pos == size() || quantile(pos) != v) return 0; // vがない
ll pos_next = Lower_Bound(s, v+1);
if (isMultiset) {
return pos_next - pos;
} else {
return 1;
}
}
// 一番小さい値を取得
// O(log n)
ll front(void) {
assert(s);
auto p = Split(s, 1);
ll ret = p.fi->Value;
s = Merge(p.fi, p.se);
return ret;
}
// 一番大きい値を取得
// O(log n)
ll back(void) {
assert(s);
auto p = Split(s, s->size()-1);
ll ret = p.se->Value;
s = Merge(p.fi, p.se);
return ret;
}
// 小さい方からk番目を求める
// 0-indexed
// O(log n)
ll quantile(ll k) {
assert(s);
assert(k < s->size());
if (k == 0) return front();
if (k == s->size() - 1) return back();
auto left = Split(s, k+1);
auto right = Split(left.fi, k);
// right.fi [0, k)
// right.se [k, k+1)
// left.se [k+1, n)
ll ret = right.se->Value;
s = Merge(right.fi, right.se);
s = Merge(s, left.se);
return ret;
}
ll operator[](int k) { return quantile(k); };
// 大きい方からk番目を求める
// 0-indexed
// O(log n)
ll rquantile(ll k) {
assert(s);
assert(k < s->size());
return quantile(s->size() - 1 - k);
}
// 一番小さい要素を削除
// O(log n)
void pop_front(void) {
assert(s);
s = Erase(s, 0);
}
// 一番大きい要素を削除
// O(log n)
void pop_back(void) {
assert(s);
s = Erase(s, s->size()-1);
}
// v以上の最小の値をもつ位置
// O(log n)
ll lower_bound(ll v) {
return Lower_Bound(s, v);
}
// vより大きい最小の値をもつ位置
// O(log n)
ll upper_bound(ll v) {
return Upper_Bound(s, v);
}
// v以下の最大の値をもつ位置
// O(log n)
ll rlower_bound(ll v) {
return rLower_Bound(s, v);
}
// vより小さい最大の値をもつ位置
// O(log n)
ll rupper_bound(ll v) {
return rUpper_Bound(s, v);
}
// a以上b未満の値の個数を求める
// O(log n)
ll rangefreq(ll a, ll b) {
auto l = Lower_Bound(s, a);
auto r = Lower_Bound(s, b);
if (l == r) return 0;
auto x = Split(s, r);
auto y = Split(x.fi, l);
ll ret = ::size(y.se);
s = Merge(y.fi, y.se);
s = Merge(s, x.se);
return ret;
}
// a以上b未満の値の個数を求める
// O(log n)
ll rangesum(ll a, ll b) {
auto l = Lower_Bound(s, a);
auto r = Lower_Bound(s, b);
if (l == r) return 0;
auto x = Split(s, r);
auto y = Split(x.fi, l);
ll ret = y.se->getSum();
s = Merge(y.fi, y.se);
s = Merge(s, x.se);
return ret;
}
// s[l, r)の合計を求める
// （l番目に小さいものからr番目に小さいものまでを、半開区間で足し合わせる）
// O(log n)
ll rangesum_id(ll l, ll r) {
assert(0<=l&&l<=r&&r<size());
if (l == r) return 0;
auto x = Split(s, r);
auto y = Split(x.fi, l);
ll ret = y.se->getSum();
s = Merge(y.fi, y.se);
s = Merge(s, x.se);
return ret;
}
// 全要素を削除する
// O(n log n)
void clear(void) {
while (size()) pop_back();
}
};
Node* node[100010];
ll brutal(ll n, vll& a, ll x) {
vll used(n);
rep(i, n) {
ll turn = i%2;
if (turn == 0) {
rep(jrev, n) {
ll j = n - jrev - 1;
if (used[j] == 0) {
used[j] = 1;
break;
}
}
} else {
ll m = INF;
ll mi = 0;
rep(j, n) if (used[j] == 0) {
if (m > abs(a[j] - x)) {
m = abs(a[j] - x);
mi = j;
}
}
used[mi] = -1;
}
}
ll ret = 0;
rep(i, n) {
if (used[i] == 1) {
ret += a[i];
}
}
return ret;
}
int main(void) {
ll n, q; cin >> n >> q;
vll a(n); cin >> a;
vll aeven(n+1);
rep(i, n) aeven[i+1] = aeven[i] + (i % 2 == 0 ? a[i] : 0ll);
vll aodd(n+1);
rep(i, n) aodd[i+1] = aodd[i] + (i % 2 == 1 ? a[i] : 0ll);
Set s;
rep(i, n) s.insert(a[i]);
rep(_, q) {
ll x; cin >> x;
ll ng = -1, ok = 1.1e9;
ll aoki = -1, takahashi = -1;
while (ok - ng > 1) {
ll mid = (ok + ng) / 2ll;
ll s = lower_bound(all(a), x + mid) - a.begin();
ll t = lower_bound(all(a), x - mid) - a.begin();
aoki = s - t;
takahashi = n - s;
// aoki = s.rangefreq(x - mid, x + mid);
// takahashi = s.rangefreq(x + mid, 2e9);
if (aoki >= takahashi - 1) {
ok = mid;
} else {
ng = mid;
}
}
aoki = s.rangefreq(x - ok, x + ok);
takahashi = s.rangefreq(x + ok, 2e9);
if (aoki > takahashi) {
ll ng = -1, ok = 1.1e9;
while (ok - ng > 1) {
ll mid = (ok + ng) / 2ll;
ll s = lower_bound(all(a), x + mid + 1) - a.begin();
ll t = lower_bound(all(a), x - mid) - a.begin();
aoki = s - t;
takahashi = n - s;
if (aoki >= takahashi - 1) {
ok = mid;
} else {
ng = mid;
}
}
}
/*
rep(i, n) {
if (x - ok <= a[i] && a[i] < x + ok) {
cout << -1 << " ";
} else if (x + ok <= a[i]) {
cout << 1 << " ";
} else {
cout << 0 << " ";
}
}
cout << endl;
*/
ll ret = s.rangesum(x + ok, 2e9);
ll rem = n - takahashi - aoki;
/*
cout << ret << endl;
cout << rem << endl;
*/
if ((rem + (takahashi - aoki)) % 2 == 1) {
ret += aeven[rem];
} else {
ret += aodd[rem];
}
cout << ret << endl;
/*
if (brutal(n, a, x) != ret) {
cout << "##########" << endl;
cout << n << " " << a << endl;
cout << x << endl;
cout << brutal(n, a, x) << " " << ret << endl;
}
*/
}
// ll rangefreq(ll a, ll b) {
return 0;
}
|
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
#define PI acos(-1.0)
#define EPS 1e-8
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
#define fi first
#define se second
#define go(i, a, b) for(int i = a; i <= b; ++i)
#define gorev(i, a, b) for(int i = a; i >= b; --i)
typedef long double ld;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
const ll mod = (ll)1e9 + 7;
template <class L, class R> ostream &operator <<(ostream &os, pair<L, R> P){
return os << "(" << P.fi << "," << P.se << ")";
}
template <class T> ostream &operator <<(ostream &os, vector<T> V){
os << "["; for (auto vv: V) os << vv << ","; return os << "]";
}
template <class L, class R> ostream &operator <<(ostream &os, map<L, R> M){
os << "["; for (auto pr: M) os << pr.fi << "->" << pr.se << ","; return os << "]";
}
template <class L, class R> ostream &operator <<(ostream &os, unordered_map<L, R> M){
os << "["; for (auto pr: M) os << pr.fi << "->" << pr.se << ","; return os << "]";
}
mt19937_64 mt(time(0));
struct Matrix {
vvi data;
int r, c;
Matrix(int row, int col, bool identity = false) : r(row), c(col) {
data.assign(row, vector<int>(col, 0));
if (identity) {
for (int i = 0; i < r; ++i) {
data[i][i] = 1;
}
}
}
Matrix operator * (Matrix& other) {
int m = r, n = c, p = other.c;
Matrix res(m, p);
for (int i = 0; i < m; ++i) {
for (int j = 0; j < p; ++j) {
for (int k = 0; k < n; ++k) {
res.data[i][j] += data[i][k] * other.data[k][j];
}
}
}
return res;
}
};
vector<int> extendGcd(int a, int b) {
if (b == 0) {
return {1, 0, a};
} else {
vector<int> tmp = extendGcd(b, a % b);
return {tmp[1], tmp[0] - (a / b) * tmp[1], tmp[2]};
}
}
Matrix matrix_power(Matrix base, ll exp) {
int n = base.r;
Matrix res(n, n, true);
while (exp) {
if (exp & 1) {
res = res * base;
}
base = base * base;
exp >>= 1;
}
return res;
}
inline int read()
{
int X=0,w=0; char ch=0;
while(!isdigit(ch)) {w|=ch=='-';ch=getchar();}
while(isdigit(ch)) X=(X<<3)+(X<<1)+(ch^48),ch=getchar();
return w?-X:X;
}
inline void write(int x)
{
if(x<0) putchar('-'),x=-x;
if(x>9) write(x/10);
putchar(x%10+'0');
}
inline double dbread()
{
double X=0,Y=1.0; int w=0; char ch=0;
while(!isdigit(ch)) {w|=ch=='-';ch=getchar();}
while(isdigit(ch)) X=X*10+(ch^48),ch=getchar();
ch=getchar();//读入小数点
while(isdigit(ch)) X+=(Y/=10)*(ch^48),ch=getchar();
return w?-X:X;
}
/*************************
******* template ********
************************/
#define N 100010
int n, q;
ll a[N], x[N];
ll foo[N], sum[N];
unordered_map<int, int> cnt;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cout.precision(10);
cout << fixed;
#ifdef ZYC_LOCAL
freopen("input.txt", "rt", stdin);
#endif
cin >> n >> q;
go(i, 1, n) {
cin >> a[i];
cnt[a[i]]++;
}
go(i, 1, q) cin >> x[i];
sort(a + 1, a + n + 1);
go(i, 1, n) {
foo[i] = (i > 1 ? foo[i - 2] : 0) + a[i];
sum[i] = sum[i - 1] + a[i];
}
go(i, 1, q) {
if (x[i] >= a[n]) {
cout << foo[n] << endl;
continue;
}
ll l = 0, r = (ll)1e9;
int last, first, front, back;
while (l < r) {
ll mid = r - (r - l) / 2;
last = lower_bound(a + 1, a + n + 1, x[i] + mid) - a;
first = lower_bound(a + 1, a + n + 1, x[i] - mid) - a;
front = last - first;
back = n + 1 - last;
if (front > back) {
r = mid - 1;
} else {
l = mid;
}
}
first = lower_bound(a + 1, a + n + 1, x[i] - l) - a;
int tot = n + 1 - first;
front = tot / 2;
last = first + front - 1;
back = tot - front;
ll res = sum[n] - sum[last];
if (front == back) {
res += foo[first - 1];
} else if (first > 1) {
res += foo[first - 2];
}
cout << res << endl;
}
#ifdef ZYC_LOCAL
cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
return 0;
}
|
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
#define FORE(i, a) for (auto i = a.begin(); i != a.end(); ++i)
#define REPU(i, a, b) for (int i = (a); i < (b); ++i)
#define REPD(i, a, b) for (int i = (a); i > (b); --i)
#define MEM(a, x) memset(a, x, sizeof(a))
#define ALL(a) a.begin(), a.end()
#define UNIQUE(a) a.erase(unique(ALL(a)), a.end())
vector<string> split(const string &s, char c) {
vector<string> v; stringstream ss(s); string x;
while (getline(ss, x, c)) v.push_back(x);
return v;
}
#define DEBUG(args...) { vector<string> _v = split(#args, ','); err(_v.begin(), args); }
void err(vector<string>::iterator it) {}
template<typename T, typename... Args>
void err(vector<string>::iterator it, T a, Args... args) {
cerr << "[DEBUG] " << it -> substr((*it)[0] == ' ', it -> length()) << " = " << a << '\n';
err(++it, args...);
}
typedef long long ll;
const int MOD = 1000000007;
template<class T, class U> inline T tmin(T a, U b) { return (a < b) ? a : b; }
template<class T, class U> inline T tmax(T a, U b) { return (a > b) ? a : b; }
template<class T, class U> inline void amax(T &a, U b) { if (b > a) a = b; }
template<class T, class U> inline void amin(T &a, U b) { if (b < a) a = b; }
template<class T> T gcd(T a, T b) { while (b != 0) { T c = a; a = b; b = c % b; } return a; }
const int N = 100005;
int a[N];
ll dp[N][2], ac[N];
int main(int argc, char *argv[]) {
ios_base::sync_with_stdio(false);
int n, q; cin >> n >> q;
dp[0][0] = dp[0][1] = 0;
ac[0] = 0;
REPU(i, 0, n) {
cin >> a[i];
dp[i + 1][0] = dp[i][0];
dp[i + 1][1] = dp[i][1];
dp[i + 1][i & 1] += a[i];
ac[i + 1] = ac[i] + a[i];
}
while (q--) {
int x; cin >> x;
int idx = lower_bound(a, a + n, x) - a;
int rem = n - idx;
ll ans = 0;
int lb = 0, rb = rem + 1;
while (rb - lb > 1) {
int m = (lb + rb) >> 1;
// get m cards
int v = a[idx + m - 1];
int u = x - v + x;
int j = lower_bound(a, a + n, u) - a;
if (idx + m - j <= n - (idx + m)) lb = m;
else rb = m;
}
ans = ac[n] - ac[idx + lb];
//DEBUG(idx, lb);
if (lb > 0) {
int v = a[idx + lb - 1];
int u = x - v + x;
int j = lower_bound(a, a + n, u) - a;
--j;
int rev = n - (idx + lb);
amin(j, idx + lb - 1 - rev);
//DEBUG(j);
if (j >= 0) {
if ((n - j + 1) & 1) j--;
if (j >= 0) {
ans += dp[j + 1][j & 1];
}
}
}
else {
int v = idx - (n - idx);
if (v > 0) {
ans += dp[v][(v - 1) & 1];
}
}
printf("%lld\n", ans);
}
return 0;
}
|
p03158 | C++ | #ifndef BZ
#pragma GCC optimize "-O3"
#endif
#include <bits/stdc++.h>
#define FASTIO
#define ALL(v) (v).begin(), (v).end()
#define rep(i, l, r) for (int i = (l); i < (r); ++i)
#ifdef FASTIO
#define scanf abacaba
#define printf abacaba
#endif
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
using namespace std;
/*
ll pw(ll a, ll b) {
ll ans = 1; while (b) {
while (!(b & 1)) b >>= 1, a = (a * a) % MOD;
ans = (ans * a) % MOD, --b;
} return ans;
}
*/
const int MAXN = 120000;
int n, q;
ll a[MAXN];
vector<pair<ll, int>> qq;
ll aans[MAXN];
ll sum[MAXN];
ll sum2[MAXN];
int main() {
#ifdef FASTIO
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#endif
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];
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;
qq.emplace_back(x, i);
}
sort(ALL(qq));
reverse(ALL(qq));
int now = n - 1;
for (int i = 0; i < q; ++i) {
ll x = qq[i].first;
while (now >= 0) {
ll d = abs(x - a[now]);
int y = lower_bound(a, a + n, x - d) - a;
if (now - y + 1 >= n - now)
--now;
else
break;
}
int cnt = n - now - 1;
int go = now - cnt;
ll ans = sum[n] - sum[now + 1];
if (go >= 0)
ans += sum2[go];
aans[qq[i].second] = ans;
}
for (int i = 0; i < q; ++i) {
cout << aans[i] << "\n";
}
return 0;
}
|
p03158 | C++ | #include<bits/stdc++.h>
#define pb push_back
#define x first
#define y second
using namespace std;
const int N = 1e6 + 10, Mod = 1e9 + 7;
int n, q, A[N];
long long P[N], PA[N];
inline int Get(int l, int r)
{
return (int)(upper_bound(A, A + n, r) - lower_bound(A, A + n, l));
}
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++)
{
P[i] = A[i];
PA[i] = A[i];
if (i >= 1)
P[i] += P[i -1];
if (i >= 2)
PA[i] += PA[i - 2];
}
for (; q; q --)
{
int k;
scanf("%d", &k);
int id = lower_bound(A, A + n, k) - A;
if (id >= n - 1)
{
printf("%lld\n", PA[n - 1]);
continue;
}
int le = id - 1, ri = n, md;
while (ri - le > 1)
{
md = (le + ri) >> 1;
int dif = abs(A[md] - k);
if (Get(k - dif, dif + k) <= n - 1 - md)
le = md;
else
ri = md;
}
int lb;
long long sum = P[n - 1] - P[le];
lb = le - (n - 1 - le);
if (lb < 0)
{
printf("%lld\n", sum);
continue;
}
if (n - 1 - le == le - lb)
sum += A[lb], lb --;
if (lb < 0)
{
printf("%lld\n", sum);
continue;
}
if (lb > 0)
sum += PA[lb - 1];
printf("%lld\n", sum);
}
return (0);
} |
p03158 | C++ | #include <iostream>
#include <cassert>
#include <climits>
#include <bitset>
#include <stack>
#include <queue>
#include <iomanip>
#include <limits>
#include <string>
#include <cmath>
#include <set>
#include <map>
#include <math.h>
#include <algorithm>
#include <vector>
#include <string.h>
#include <tuple>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
long long int INF = 1e18;
long long int mod = 1000000007;
double Pi = 3.1415926535897932384626;
vector<ll> G[500005];
vector<P> tree[500010];
priority_queue <ll> pql;
priority_queue <P> pqp;
//big priority queue
priority_queue <ll,vector<ll>,greater<ll> > pqls;
priority_queue <P,vector<P>,greater<P> > pqps;
//small priority queue
//top pop
int dx[8]={1,0,-1,0,1,1,-1,-1};
int dy[8]={0,1,0,-1,1,-1,-1,1};
char dir[] = "RULD";
//↓,→,↑,←
#define p(x) cout<<x<<endl;
#define el cout<<endl;
#define pe(x) cout<<x<<" ";
#define ps(x) cout<<fixed<<setprecision(25)<<x<<endl;
#define pu(x) cout<<x;
#define re(i,n) for(i=0;i<n;i++);
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define deba(x) cout<< #x << " = " << x <<endl
ll rui(ll number1,ll number2){
if(number2 == 0){
return 1;
}else{
ll number3 = rui(number1,number2 / 2);
number3 *= number3;
number3 %= mod;
if(number2%2==1){
number3 *= number1;
number3 %= mod;
}
return number3;
}
}
ll gcd(ll number1,ll number2){
if(number1 > number2){
swap(number1 , number2);
}
if(number1 == 0 || number1 == number2){
return number2;
}else{
return gcd(number2 % number1 , number1);
}
}
ll i,j,k,ii,jj;
ll n,m;
ll a,b,c,d,e,g,h,r,w;
ll l;
ll num;
ll x[500005],y[500005],z[500005];
char s[600][600];
ll dp[600][600];
ll check[600][600];
bool dame,flag;
ll ok,ng;
ll ans[500005];
ll sum[500005],oddsum[500005];
ll num0[800005],num1[800005];
int main(){
cin >> n >> k;
for(i=0;i<n;i++){
cin >> x[i];
}
sort(x,x+n);
a = 0;
for(i=0;i<n;i++){
a += x[i];
if((n - i) % 2 == 1){
b += x[i];
}
oddsum[i] = b;
sum[i] = a;
}
for(i=0;i<n;i++){
//pe(sum[i]);
}
//el;
for(i=0;i<k;i++){
cin >> y[i];
}
for(i=1;i<=(n+1)/2;i++){
//先頭のi個をとる場合
z[i] = (x[n-i] + x[n+1-2*i])/2;
//pe(z[i]);
}
//el;
for(i=1;i<=(n+1)/2;i++){
a = 0;
a += sum[n-1];
a -= sum[n-1-i];
if(n + 1 - 2 * i >= 0)a += oddsum[n-1-2*i];
ans[i] = a;
//pe(ans[i]);
}
//el;
for(i=0;i<k;i++){
ok = 1;
ng = (n+1)/2 + 1;
while(abs(ok - ng) > 1){
ll mid = (ok + ng) / 2;
if(z[mid] >= y[i]){
ok = mid;
}else{
ng = mid;
}
}
p(ans[ok]);
}
return 0;
}
|
p03158 | C++ | /*
ID: espr1t
TASK:
KEYWORDS:
*/
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
#include <string>
using namespace std;
FILE* in = stdin; FILE* out = stdout;
const int MAX = 100001;
int n, q;
int a[MAX];
long long all[MAX];
long long odd[MAX];
long long even[MAX];
long long getSum(long long arr[MAX], int idx1, int idx2) {
if (idx1 <= 0)
return arr[idx2];
return arr[idx2] - arr[idx1 - 1];
}
int findIdx(int val) {
int left = 0, right = n - 1;
while (left <= right) {
int mid = (left + right) / 2;
a[mid] < val ? left = mid + 1 : right = mid - 1;
}
return left;
}
long long eval(int x) {
int where = -1, next = -1;
long long sum0 = 0, sum1 = 0;
int left = 0, right = 1000000000;
while (left <= right) {
int mid = (left + right) / 2;
int idxL = findIdx(x - mid); if (idxL < 0 || a[idxL] < x - mid) idxL++;
int idxR = findIdx(x + mid); if (idxR >= n || a[idxR] > x + mid) idxR--;
int cnt0 = n - idxR - 1;
int cnt1 = idxR - idxL + 1;
if (cnt1 <= 0) {
left = mid + 1;
continue;
}
if (cnt1 == cnt0 + 1 && x - a[idxL] <= a[idxR] - x) {
idxR--;
cnt1--, cnt0++;
}
if (cnt0 == cnt1 || cnt0 == cnt1 + 1) {
// fprintf(stderr, "Here with [%d, %d]\n", idxL, idxR);
sum0 = getSum(all, idxR + 1, n - 1);
sum1 = getSum(all, idxL, idxR);
where = idxL - 1, next = (cnt0 == cnt1 ? 0 : 1);
break;
}
cnt1 > cnt0 ? right = mid - 1 : left = mid + 1;
}
if (next == -1) {
where = n - 1, next = 0;
}
// fprintf(stderr, "where = %d, next = %d, sum0 = %lld, sum1 = %lld\n", where, next, sum0, sum1);
if (where >= 0) {
sum0 += ((next ^ (where % 2)) == 0) ? getSum(even, 0, where) : getSum(odd, 0, where);
sum1 += ((next ^ (where % 2)) == 1) ? getSum(even, 0, where) : getSum(odd, 0, where);
}
return sum0;
}
int main(void) {
// in = fopen("D.in", "rt");
fscanf(in, "%d %d", &n, &q);
for (int i = 0; i < n; i++)
fscanf(in, "%d", &a[i]);
sort(a, a + n);
all[0] = a[0], odd[0] = 0, even[0] = a[0];
for (int i = 1; i < n; i++) {
all[i] = all[i - 1] + a[i];
odd[i] = odd[i - 1] + (i % 2 ? a[i] : 0);
even[i] = even[i - 1] + (i % 2 ? 0 : a[i]);
}
for (int i = 0; i < q; i++) {
int x;
fscanf(in, "%d", &x);
fprintf(out, "%lld\n", eval(x));
}
return 0;
} |
p03158 | C++ | #include<bits/stdc++.h>
#define fo(i, a, b) for (int i = (a); i <= (b); ++i)
#define fd(i, a, b) for (int i = (a); i >= (b); --i)
#define edge(i, u) for (int i = head[u], v = e[i].v; i; i = e[i].nxt, v = e[i].v)
#define mod 1000000007
#define ll long long
#define N 100005
#define pb push_back
ll n, q, x, a[N], s[N], sum[N], l, r, ss;
int main ()
{
scanf("%lld %lld", &n, &q);
fo (i, 1, n)
scanf("%lld", &a[i]);
s[1] = a[1]; s[2] = a[2];
sum[1] = a[1]; sum[2] = a[1] + a[2];
fo (i, 3, n)
{
s[i] = s[i - 2] + a[i];
sum[i] = sum[i - 1] + a[i];
}
ss = sum[n];
fo (i, 1, q)
{
scanf("%lld\n", &x);
if (x <= a[1])
{
printf("%lld\n", ss - sum[n >> 1]);
continue;
}
l = x; r = 1e9;
ll rp, rpos, ans, lp, lpos;
while (l < r)
{
rp = l + r >> 1;
rpos = std::upper_bound(a + 1, a + n, rp) - a - 1;
lp = x * 2 - rp;
lpos = std::lower_bound(a + 1, a + n, lp) - a;
if (n - rpos > rpos - lpos + 1)
l = rp + 1;
else
r = rp;
}
rp = l;
rpos = std::upper_bound(a + 1, a + n, rp) - a - 1;
lp = x * 2 - rp;
lpos = std::lower_bound(a + 1, a + n, lp) - a;
if (n - rpos < rpos - lpos + 1)
--rpos;
ans = sum[rpos] - sum[lpos - 1];
if (n - rpos == rpos - lpos + 1)
{
if (lpos > 2)
ans += s[lpos - 2];
}
else
{
ans += s[lpos - 1];
}
printf("%lld\n", ss - ans);
}
return 0;
} |
p03158 | C++ | #include <bits/stdc++.h>
#define mod 1000000007
#define sp ' '
#define intmax 2147483647
#define llmax 9223372036854775807
#define nyan "(=^･ω･^=)"
#define mkp make_pair
#define lP pair<ll, ll>
#define iP pair<int,int>
typedef long long ll;
using namespace std;
int N, Q, A[100000], X, l, r, hoge;
ll sa[100001], sb[100000];
int main() {
cin >> N >> Q;
for (int i = 0; i != N; ++i)
cin >> A[i];
for (int i = 0; i != N; ++i) {
sa[i + 1] = sa[i] + A[i];
sb[i] = A[i];
}
for (int i = 2; i < N; ++i)
sb[i] += sb[i - 2];
l = A[0];
r = A[N / 2];
while (l + 1 != r) {
int k = (l + r) / 2;
if (k - A[0] <= A[N / 2] - k)
l = k;
else
r = k;
}
hoge = l;
for (int i = 0; i != Q; ++i) {
cin >> X;
if (X <= hoge)
cout << sa[N] - sa[N / 2] << endl;
else {
l = 0;
r = N / 2 + 1;
while (l + 1 != r) {
int k = (l + r) / 2;
if (A[N - k] - X >= X - A[N - k * 2])
l = k;
else
r = k;
}
// cout << nyan << endl;
// cout << l << endl;
if (A[N - l - 1] - X >= X - A[N - l * 2 - 1])
++l;
// cout << l << endl;
cout << sa[N] - sa[N - l] + sb[N - 1 - l - l] << endl;
// cout << nyan << endl;
}
}
return 0;
}
|
p03158 | C++ | #include<cstdio>
#include<cmath>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#define ll long long
#define mod 1000000007
#define maxn 100010
inline ll read()
{
ll x=0; char c=getchar(),f=1;
for(;c<'0'||'9'<c;c=getchar())if(c=='-')f=-1;
for(;'0'<=c&&c<='9';c=getchar())x=x*10+c-'0';
return x*f;
}
inline void write(ll x)
{
static char buff[20],len; len=0;
if(x<0)putchar('-'),x=-x;
for(;x;x/=10)buff[len++]=x%10;
if(!len)putchar('0');
else while(len)putchar(buff[--len]+'0');
}
inline void writeln(ll x)
{
write(x); putchar('\n');
}
inline void writesp(ll x)
{
write(x); putchar(' ');
}
int a[maxn];
ll sum[maxn],sum0[maxn],sum1[maxn];
int n,q;
int find(int x)
{
int l=1,r=n+1;
while(l<r){
int mid=(l+r)>>1;
if(x>a[mid])l=mid+1;
else r=mid;
}
return l;
}
ll work(int x)
{
// printf("%d ***************\n",x);
if(x>=a[n]){
if(n&1)return sum1[n];
else return sum0[n];
}
int l=1,r=n;
while(l<r){
int mid=(l+r+1)>>1,pos=find(x*2-a[mid-1]);
if(mid-pos>n-mid+1)r=mid-1;
else l=mid;
}
int pos=l-(n-l+1);
// writeln(l);
return (sum[n]-sum[l-1])+((pos&1)?sum0[pos-1]:sum1[pos-1]);
}
int main()
{
n=read(); q=read();
for(int i=1;i<=n;i++)
a[i]=read();
std::sort(a+1,a+n+1);
sum[0]=sum0[0]=sum1[0]=0;
for(int i=1;i<=n;i++){
sum[i]=sum[i-1]+a[i];
sum0[i]=sum0[i-1]+((i&1)?0:a[i]);
sum1[i]=sum1[i-1]+((i&1)?a[i]:0);
}
for(int i=1;i<=q;i++){
int x=read();
writeln(work(x));
}
} |
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define Z class
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeof((c).begin())
#define rrep(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
template<Z A>void pr(A a){cout<<a;ln;}
template<Z A,Z B>void pr(A a,B b){cout<<a<<' ';pr(b);}
template<Z A,Z B,Z C>void pr(A a,B b,C c){cout<<a<<' ';pr(b,c);}
template<Z A,Z B,Z C,Z D>void pr(A a,B b,C c,D d){cout<<a<<' ';pr(b,c,d);}
template<Z A>void PR(A a,ll n){rep(i,n){if(i)cout<<' ';cout<<a[i];}ln;}
ll check(ll n,ll m,ll x,ll y){return x>=0&&x<n&&y>=0&&y<m;}
const ll MAX=1e9+7,MAXL=1LL<<61,dx[4]={-1,0,1,0},dy[4]={0,1,0,-1};
typedef pair<int,int> P;
void Main() {
ll n,T;
cin >> n >> T;
ll a[n];
rep(i,n) R a[i];
sort(a,a+n);
vector<ll> b,d;
ll sum=0;
REP(i,n/2,n) sum+=a[i];
b.pb(0);
d.pb(sum);
rep(k,n/2-(n%2==0)) {
ll x=a[k*2+(n%2==0)];
ll y=a[n/2+k];
sum-=y;
sum+=x;
b.pb((y+x)/2+1);
d.pb(sum);
}
while(T--) {
ll x;
R x;
ll k=upper_bound(all(b),x)-b.begin();
pr(d[k-1]);
}
}
int main(){ios::sync_with_stdio(0);cin.tie(0);Main();return 0;}
|
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
int n,q;
vector<int> a;
long long mi[100000],ma[100000];
void solvei(){
int x;
cin >> x;
int l = 1,r = n;
while(r-l > 1){
int m = (r+l)/2;
int ca = a[n-m];
if(n-m-m+1 < 0){
r = m;
continue;
}
int ci = a[n-m-m+1];
if(ca-x >= x-ci) l = m;
else r = m;
}
if(n-l-l < 0) cout << ma[n-l] << endl;
else cout << ma[n-l]+mi[n-l-l] << endl;
}
void solve(){
int i,j;
string str;
cin >> n >> q;
a.resize(n);
for(i = 0;i < n;i++) cin >> a[i];
if(n%2){
mi[0] = a[0];
for(i = 1;i < n;i++){
if(i%2) mi[i] = mi[i-1];
else mi[i] = mi[i-1] + a[i];
}
}
else{
mi[0] = 0;
for(i = 1;i < n;i++){
if(i%2) mi[i] = mi[i-1] + a[i];
else mi[i] = mi[i-1];
}
}
ma[n-1] = a[n-1];
for(i = n-2;i >= 0;i--) ma[i] = a[i] + ma[i+1];
for(i = 0;i < q;i++) solvei();
}
int main(){
solve();
}
|
p03158 | C++ | #include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <string>
#include <cstring>
#include <map>
using namespace std;
int N, Q;
vector<int64_t> A, X, aSum1, aSum2;
bool IsFree(int turn, int64_t x, int aoki_index) {
int t_move = (turn + 1) / 2,
a_move = turn / 2;
int dup = max(0, aoki_index + a_move - (N - t_move));
if (dup == 0) return true;
if (N - t_move <= aoki_index) return false;
if (t_move + a_move > N) return false;
int target = aoki_index - dup;
if (dup < 0) return false;
if (abs(x - A[N - t_move]) >= abs(x - A[target])) return true;
else return false;
}
int64_t ComputeCardSum(int64_t x) {
int index = lower_bound(begin(A), end(A), x) - begin(A);
if (index == N - 1 or (index > 0 and abs(A[index] - x) >= abs(A[index - 1] - x))) {
index--;
}
int lb = 0, ub = N + 1;
while (ub - lb > 1) {
int mid = (lb + ub) / 2;
if (IsFree(mid, x, index)) lb = mid;
else ub = mid;
}
int turn = lb;
int t_move = (turn + 1) / 2,
a_move = turn / 2;
int64_t sum = aSum1[N - t_move];
/*
cerr << "turn " << turn << endl;
ce-rr << "t_move " << t_move << endl;
*/
if (N - 1 - turn >= 0 and turn % 2 == 0) {
sum += aSum2[N - 1 - turn];
return sum;
}
if (N - 1 - (turn + 1) >= 0) {
sum += aSum2[N - 1 - (turn + 1)];
return sum;
}
return sum;
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cin >> N >> Q;
A.resize(N);
X.resize(Q);
aSum1.resize(N);
aSum2.resize(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
aSum2[i] = A[i];
if (i - 2 >= 0) {
aSum2[i] += aSum2[i - 2];
}
}
for (int i = N - 1; i >= 0; i--) {
aSum1[i] = A[i];
if (i + 1 < N) {
aSum1[i] += aSum1[i + 1];
}
}
for (int i = 0; i < Q; i++) {
cin >> X[i];
cout << ComputeCardSum(X[i]) << endl;
}
return 0;
} |
p03158 | C++ | #include<iostream>
#include<vector>
#include<string>
#include<cmath>
#include<algorithm>
#include<functional>
#include<numeric>
#include<queue>
#include<stack>
#include<map>
#include<unordered_map>
#include<set>
#include<bitset>
#include<random>
#pragma region
using namespace std;
#define FOR(i,r,n) for(ll i = (ll)(r); i < (ll)(n); i++)
#define rep(i,n) FOR(i,0LL,n)
#define RFOR(i,r,n) for(ll i=(ll)(n-1);i>=r;i--)
#define rrep(i,n) RFOR(i,0LL,n)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define COUNT(a,y,x) upper_bound(all(a), y) - lower_bound(all(a), x)
#define UNIQUE(a) sort(all(a)); a.erase(unique(all(a)), a.end())
#define pb push_back
#define endl '\n'
typedef long long int ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
typedef vector<string> vs;
typedef map<ll, ll> MAP;
const ll inf = 2222222222222222222LL;
const ll mod = 1000000007LL;
ll n = 0, m = 0, ans = 0, tmp = 0, ma = -inf, mi = inf;
string s;
bool ok;
ll dx[9] = { 0,1,-1,0,0,1,1,-1,-1 }, dy[9] = { 0,0,0,1,-1,1,-1,1,-1 };
#pragma endregion
#define MAX 222222
ll odd[MAX], even[MAX], sum[MAX];
int main(void) {
ios::sync_with_stdio(false); cin.tie(0);
cin >> n >> m;
vll a(n);
MAP mp;
rep(i, n) cin >> a[i];
rep(i, n) mp[a[i]]++;
even[0] = a[0];
sum[0] = a[0];
FOR(i, 1, n) {
even[i] = even[i - 1];
if (!(i % 2)) even[i] += a[i];
odd[i] = odd[i - 1];
if (i % 2) odd[i] += a[i];
sum[i] = sum[i - 1] + a[i];
}
rep(i, m) {
ll x;
ans = 0;
cin >> x;
ll le = COUNT(a,x,0)-1, ri = n - 1, mid;
le = min(le, n - 2);
while (ri - le > 1) {
mid = (le + ri) / 2;
ll F, S, cur = a[mid], dist = abs(a[mid] - x);
S = COUNT(a, x + dist, x - dist);
F = n - mid;
if (F <= S) ri = mid;
else le = mid;
}
ans += sum[n - 1] - sum[max(0LL, ri - 1)];
ll num = (n - ri) * 2;
if (num < n) {
if (n % 2) ans += even[n - num - 1];
else ans += odd[n - num - 1];
}
cout << ans << endl;
}
return 0;
} |
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 (long long &a: A)
cin>>a;
vector<long long> X(Q);
for (long long &x: X)
cin>>x;
sort(A.begin(), A.end());
vector<long long> S1(N);
S1[0] = A[0];
S1[1] = A[1];
for (int i=2; i<N; i++)
S1[i] = S1[i-2] + A[i];
vector<long long> S2(N);
S2[N-1] = A[N-1];
for (int i=N-2; i>=0; i--)
S2[i] = S2[i+1] + A[i];
for (long long x: X)
{
auto check = [&](long long t) -> bool
{
if (2*t > N)
return false;
if (t<=1)
return true;
long long a1 = A[N-t];
long long a2 = A[N-2*t+1];
return abs(a2-x) <= abs(a1-x);
};
if (N%2!=0 && abs(A[0]-x) <= abs(A[N/2]-x))
cout<<S2[N/2]<<endl;
else if (N%2==0 && abs(A[1]-x) <= abs(A[N/2]-x))
cout<<S2[N/2]<<endl;
else
{
long long t = 0;
for (long long b=0x8000; b>0; b/=2)
if (check(t+b))
t += b;
cout<<S1[N-2*t-1] + S2[N-t]<<endl;
}
}
}
|
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
int N;
vector<int> A;
bool f(int x, int n) {
if (x > A[N-n]) return n == 1;
int m = (int)(lower_bound(A.begin(), A.end(), x-(A[N-n]-x)) - A.begin());
//cerr << n << " " << A[N-n] << " " << x-(A[N-n]-x) << " " << x << " " << m << " " << N-n - m << endl;
return N-n - m >= n-1;
}
int main() {
int Q;
cin >> N >> Q;
A.resize(N);
for (auto& x : A) cin >> x;
vector<long long> a(N+1), b(N+2);
for (int i = N-1; i >= 0; -- i) a[i] = a[i+1] + A[i];
for (int i = 0; i < N; ++ i) b[i+2] = b[i] + A[i];
for (int tt = 0; tt < Q; ++ tt) {
int x;
cin >> x;
int ll = 1, rr = N;
while (rr-ll > 1) {
int mm = (ll+rr)/2;
if (f(x, mm)) {
ll = mm;
} else {
rr = mm;
}
}
//cerr << ll << " " << a[N-ll] << " " << N-(2*ll-1) << " " << b[N-(2*ll-1)] << endl;
cout << a[N-ll] + b[N-(2*ll-1)] << endl;
}
}
|
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
using i64 = int_fast64_t;
using ui64 = uint_fast64_t;
using db = long double;
using pii = pair<int, int>;
using pli = pair<int_fast64_t, int>;
using pll = pair<int_fast64_t, int_fast64_t>;
using pdi = pair<double, int>;
template <class T> using vct = vector<T>;
template <class T> using heap = priority_queue<T>;
template <class T> using minheap = priority_queue<T, vector<T>, greater<T>>;
template <class T> constexpr T inf = numeric_limits<T>::max() / 2 - 1;
constexpr int dx[9] = {1, 0, -1, 0, 1, -1, -1, 1, 0};
constexpr int dy[9] = {0, 1, 0, -1, 1, 1, -1, -1, 0};
constexpr long double gold = 1.618033988;
constexpr long double eps = 1e-15;
#define stdout_precision 10
#define stderr_precision 2
#define itr(i,v) for(auto i = begin(v); i != end(v); ++i)
#define ritr(i,v) for(auto i = rbegin(v); i != rend(v); ++i)
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define all(v) begin(v), end(v)
#define rall(v) rbegin(v), rend(v)
#define fir first
#define sec second
#define fro front
#define bac back
#define u_map unordered_map
#define u_set unordered_set
#define l_bnd lower_bound
#define u_bnd upper_bound
#define rsz resize
#define ers erase
#define emp emplace
#define emf emplace_front
#define emb emplace_back
#define pof pop_front
#define pob pop_back
#define mkp make_pair
#define mkt make_tuple
#define popcnt __builtin_popcount
struct setupper {
setupper() {
ios::sync_with_stdio(false);
std::cin.tie(nullptr);
std::cout.tie(nullptr);
std::cerr.tie(nullptr);
std::cout << fixed << setprecision(stdout_precision);
std::cerr << fixed << setprecision(stderr_precision);
#ifdef Local
std::cerr << "\n---stderr---\n";
auto print_atexit = []() {
std::cerr << "Exec time : " << clock() / (double)CLOCKS_PER_SEC * 1000.0 << "ms\n";
std::cerr << "------------\n";
};
atexit((void(*)())print_atexit);
#endif
}
} setupper_;
namespace std {
template <class T> void hash_combine(size_t &seed, T const &key) {
seed ^= hash<T>()(key) + 0x9e3779b9 + (seed << 6) + (seed >> 2);
}
template <class T, class U> struct hash<pair<T,U>> {
size_t operator()(pair<T,U> const &pr) const
{
size_t seed = 0;
hash_combine(seed,pr.first);
hash_combine(seed,pr.second);
return seed;
}
};
template <class Tup, size_t index = tuple_size<Tup>::value - 1> struct hashval_calc {
static void apply(size_t& seed, Tup const& tup) {
hashval_calc<Tup, index - 1>::apply(seed, tup);
hash_combine(seed,get<index>(tup));
}
};
template <class Tup> struct hashval_calc<Tup,0> {
static void apply(size_t& seed, Tup const& tup) {
hash_combine(seed,get<0>(tup));
}
};
template <class ...T> struct hash<tuple<T...>> {
size_t operator()(tuple<T...> const& tup) const
{
size_t seed = 0;
hashval_calc<tuple<T...>>::apply(seed,tup);
return seed;
}
};
}
template <class T, class U> istream &operator>> (istream &s, pair<T,U> &p) { return s >> p.first >> p.second; }
template <class T, class U> ostream &operator<< (ostream &s, const pair<T,U> p) { return s << p.first << " " << p.second; }
template <class T> ostream &operator<< (ostream &s, const vector<T> &v) {
for(size_t i = 0; i < v.size(); ++i) s << (i ? " " : "") << v[i];
return s;
}
#define dump(...) cerr << " [ " << __LINE__ << " : " << __FUNCTION__ << " ] " << #__VA_ARGS__ << " : ";\
dump_func(__VA_ARGS__)
template <class T> void dump_func(T x) { cerr << x << '\n'; }
template <class T,class ...Rest> void dump_func(T x, Rest ... rest) { cerr << x << ","; dump_func(rest...); }
template <class T = int> T read() { T x; return cin >> x, x; }
template <class T> void write(T x) { cout << x << '\n'; }
template <class T, class ...Rest> void write(T x, Rest ... rest) { cout << x << ' '; write(rest...); }
void writeln() {}
template <class T, class ...Rest> void writeln(T x, Rest ... rest) { cout << x << '\n'; writeln(rest...); }
#define esc(...) writeln(__VA_ARGS__), exit(0)
namespace updater {
template <class T> static void add(T &x, const T &y) { x += y; }
template <class T> static void ext_add(T &x, const T &y, size_t w) { x += y * w; }
template <class T> static void mul(T &x, const T &y) { x *= y; }
template <class T> static void ext_mul(T &x, const T &y, size_t w) { x *= (T)pow(y,w); }
template <class T> static bool chmax(T &x, const T &y) { return x < y ? x = y,true : false; }
template <class T> static bool chmin(T &x, const T &y) { return x > y ? x = y,true : false; }
};
using updater::chmax;
using updater::chmin;
template <class T> T minf(const T &x, const T &y) { return min(x,y); }
template <class T> T mixf(const T &x, const T &y) { return max(x,y); }
bool bit(i64 n, uint8_t e) { return (n >> e) & 1; }
i64 mask(i64 n, uint8_t e) { return n & ((1 << e) - 1); }
int ilog(uint64_t x, uint64_t b = 2) { return x ? 1 + ilog(x / b,b) : -1; }
template <class F> i64 binry(i64 ok, i64 ng, const F &fn) {
while (abs(ok - ng) > 1) {
i64 mid = (ok + ng) / 2;
(fn(mid) ? ok : ng) = mid;
}
return ok;
}
template <class A, size_t N, class T> void init(A (&array)[N], const T &val) { fill((T*)array,(T*)(array + N),val); }
template <class A> void cmprs(A ary[], size_t n) {
vector<A> tmp(ary,ary + n);
tmp.erase(unique(begin(tmp),end(tmp)), end(tmp));
for(A *i = ary; i != ary + n; ++i) *i = l_bnd(all(tmp),*i) - begin(tmp);
}
template <class T> void cmprs(vector<T> &v) {
vector<T> tmp = v; sort(begin(tmp),end(tmp));
tmp.erase(unique(begin(tmp),end(tmp)), end(tmp));
for(auto i = begin(v); i != end(v); ++i) *i = l_bnd(all(tmp),*i) - begin(tmp);
}
template <class F> void for_subset(uint_fast64_t s, const F &fn) {
uint_fast64_t tmp = s;
do { fn(tmp); (--tmp) &= s; } while(tmp != s);
}
i64 ss[1<<18];
i64 s[1<<18];
i64 a[1<<18];
i64 n,Q;
signed main() {
cin>>n>>Q;
rep(i,n) cin>>a[i];
rep(i,n) s[i+1]=s[i]+a[i];
rep(i,n) {
ss[i]=a[i];
if(i>1) ss[i]+=ss[i-2];
}
while(Q--) {
int x; cin>>x;
int p=l_bnd(a,a+n,x)-a;
auto fn=[&](int y) {
int pp=l_bnd(a,a+n,2*x-a[y])-a;
if(y+1-pp > n-y-1) return false;
return true;
};
int y=binry(p-1,n,fn);
int pp=l_bnd(a,a+n,2*x-a[y])-a;
i64 ans=0;
ans+=s[n]-s[y+1];
int r=n-y-1;
if(y+1-pp<r) {
//assert(n-2*r-1>=0);
if(n>2*r) ans+=ss[n-2*r-1];
} else {
//assert(n-2*r-1>=0);
if(n>2*r) ans+=ss[n-2*r-1];
}
writeln(ans);
}
}
|
p03158 | C++ | #include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <string>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <stdio.h>
using namespace std;
#define int long long
int MOD = 1000000007;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, Q;
cin >> N >> Q;
vector<int> A(N);
vector<int> res(Q);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
int X;
vector<int> sum(N);
vector<int> sumrev(N);
for (int i = 0; i < N; i++) {
if ((i + N) % 2 == 1) {
sum[i] = A[i];
}
if (i > 0)sum[i] += sum[i - 1];
}
for (int i = N - 1; i >= 0; i--) {
sumrev[i] = A[i];
if (i + 1 < N)sumrev[i] += sumrev[i + 1];
}
for (int i = 0; i < Q; i++) {
cin >> X;
int ok = N - 1;
int ng = -1;
int l;
while (ok - ng > 1) {
int m = (ok + ng) / 2;
int len = A[m] - X;
if (len < 0) {
ng = m;
continue;
}
int c = upper_bound(A.begin(), A.end(), X + len - 1) - lower_bound(A.begin(), A.end(), X - len);
//cerr << X << " " << m << " " << c << endl;
if (c +1 >= N - m) {
ok = m;
}
else {
ng = m;
}
}
int le = 2 * ok - N - 1;
//cerr << X << " " << ok << " " << le << endl;
res[i] = 0;
if (le >= 0)res[i] += sum[le];
res[i] += sumrev[ok];
}
for (int i = 0; i < Q; i++) {
cout << res[i] << endl;
}
} |
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define rep(i,s,e) for(int (i) = (s);(i) <= (e);(i)++)
#define all(x) x.begin(),x.end()
int N , Q;
vector<i64> A;
i64 rs[101010];
int main() {
cin >> N >> Q;
A.resize(N);
rep(i,0,N - 1) cin >> A[i];
vector<i64> sum(101010);
rep(i,0,N - 1) {
if(i < 2) sum[i] = A[i];
else sum[i] = sum[i - 2] + A[i];
}
for(int i = N - 1;i >= 0;i--) {
rs[i] = rs[i + 1] + A[i];
}
auto f = [&](i64 x, i64 i) {
i64 d = A[i] - x;
if(d < 0) return false;
i64 r = A[i];
i64 l = x - d;
auto ite = lower_bound(all(A) , x);
i64 left = ite - lower_bound(all(A) , l);
i64 right = upper_bound(all(A) , r - 1) - ite;
i64 xx = ite - A.begin();
if(right + left >= N - i) return true;
i64 j = N - right - left;
i64 k = xx + right - 1;
if(j - i <= i - k) return true;
return false;
};
rep(i,0,Q - 1) {
i64 x;
cin >> x;
i64 ok = N;
i64 ng = -1;
while(ok - ng > 1) {
i64 mid = (ok + ng) / 2;
if(f(x,mid)) {
ok = mid;
}
else {
ng = mid;
}
}
i64 c = N - ok;
i64 ans = rs[ok];
if(N - 1 - c - c >= 0) ans += sum[N - 1 - c - c];
cout << ans << endl;
}
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.