p_id
stringlengths 6
6
| language
stringclasses 10
values | code
stringlengths 11
983k
|
|---|---|---|
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#ifdef tabr
#include "library/debug.cpp"
#else
#define debug(...) 0
#endif
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, q;
cin >> n >> q;
vector<ll> a(n), s(n), t(n);
rep(i, 0, n) {
cin >> a[i];
s[i] = t[i] = a[i];
if (i) s[i] += s[i - 1];
if (i > 1) t[i] += t[i - 2];
}
while (q--) {
int x;
cin >> x;
int l = 1, r = (n + 1) / 2 + 1;
while (r - l > 1) {
int mid = (r + l) / 2;
if (n - 2 * mid < 0) {
int k = a[n - mid];
if (abs(x - a[0]) <= abs(k - x))
l = mid;
else
r = mid;
continue;
}
int lb = a[n - 2 * mid], rb = a[n - 1 - mid];
int lout = a[n - 2 * mid - 1], rout = a[n - mid];
if (x - lout > rb - x && x - lb <= rout - x) {
l = mid, r = mid + 1;
break;
}
if (x - lb <= rout - x || x - a[n - 2 * mid + 1] <= rout - x)
l = mid;
else
r = mid;
}
ll ans = s[n - 1] - s[n - 1 - l];
if (n - 1 - 2 * l >= 0) ans += t[n - 1 - 2 * l];
debug(l);
cout << ans << endl;
}
return 0;
} |
p03158 | C++ | #include <bits/stdc++.h> // clang-format off
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define each(x,v) for(auto& x : v)
#define all(v) (v).begin(),(v).end()
#define sz(v) ((int)(v).size())
#define ini(...) int __VA_ARGS__; in(__VA_ARGS__)
#define inl(...) long long __VA_ARGS__; in(__VA_ARGS__)
#define ins(...) string __VA_ARGS__; in(__VA_ARGS__)
#ifdef ONLINE_JUDGE
#define rep(i,N) for(int i = 0; i < (int)(N); i++)
#define repr(i,N) for(int i = (int)(N) - 1; i >= 0; i--)
#define rep1(i,N) for(int i = 1; i <= (int)(N) ; i++)
#define repr1(i,N) for(int i = (N) ; (int)(i) > 0 ; i--)
#else
#define rep(i,N) for(long long i = 0; i < (long long)(N); i++)
#define repr(i,N) for(long long i = (long long)(N) - 1; i >= 0; i--)
#define rep1(i,N) for(long long i = 1; i <= (long long)(N) ; i++)
#define repr1(i,N) for(long long i = (N) ; (long long)(i) > 0 ; i--)
#endif
using namespace std; void solve();
using ll = long long; template<class T = ll> using V = vector<T>;
using vi = V<int>; using vl = V<>; using vvi = V< V<int> >;
constexpr int inf = 1001001001; constexpr ll infLL = (1LL << 61) - 1;
struct IoSetupNya {IoSetupNya() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); cerr << fixed << setprecision(7);} } iosetupnya;
template<typename T, typename U> inline bool amin(T &x, U y) { return (y < x) ? (x = y, true) : false; }
template<typename T, typename U> inline bool amax(T &x, U y) { return (x < y) ? (x = y, true) : false; }
template<typename T, typename U> ostream& operator <<(ostream& os, const pair<T, U> &p) { os << p.first << " " << p.second; return os; }
template<typename T, typename U> istream& operator >>(istream& is, pair<T, U> &p) { is >> p.first >> p.second; return is; }
template<typename T> ostream& operator <<(ostream& os, const vector<T> &v) { int s = (int)v.size(); for(int i=0;i<s;i++) os << (i ? " " : "") << v[i]; return os; }
template<typename T> istream& operator >>(istream& is, vector<T> &v) { for(auto &x : v) is >> x; return is; }
void in(){} template <typename T,class... U> void in(T &t,U &...u){ cin >> t; in(u...);}
void out(){cout << "\n";} template <typename T,class... U> void out(const T &t,const U &...u){ cout << t; if(sizeof...(u)) cout << " "; out(u...);}
template<typename T>void die(T x){out(x); exit(0);}
#ifdef NyaanDebug
#include "NyaanDebug.h"
#define trc(...) do { cerr << #__VA_ARGS__ << " = "; dbg_out(__VA_ARGS__);} while(0)
#define trca(v,N) do { cerr << #v << " = "; array_out(v , N);} while(0)
#define trcc(v) do { cerr << "name : " << #v << "\n"; int cnt = 0; each(x , v){cerr << (cnt++) << " : "; trc(x); } } while(0)
#else
#define trc(...)
#define trca(...)
#define trcc(...)
int main(){solve();}
#endif
#define inc(...) char __VA_ARGS__; in(__VA_ARGS__)
#define in2(s,t) rep(i,sz(s)){in(s[i] , t[i]);}
#define in3(s,t,u) rep(i,sz(s)){in(s[i] , t[i] , u[i]);}
using vd = V<double>; using vs = V<string>; using vvl = V< V<> >;
template<typename T,typename U>ll ceil(T a,U b){return (a + b - 1) / b;}
using P = pair<ll,ll>; using vp = V<P>;
constexpr int MOD = /**/ 1000000007; //*/ 998244353;
// clang-format on
///////////////////////////////////////////////////////////
void solve(){
inl(N , Q);
vl A(N); in(A);
vl X(Q); in(X);
if(N % 2 == 0){
N--;
A.erase(A.begin());
}
// 普通の累積和
vl rui(N + 1); rep(i , N) rui[i + 1] = rui[i] + A[i];
// 特殊な累積和((N - 1) % 2 == i % 2なる点だけ使う)
vl sui(N + 1); rep(i , N) sui[i + 1] = sui[i] + (N%2 != i%2 ? A[i] : 0LL);
auto mkord = [&](int n , auto f) -> vector<int>{
vector<int> ord(n);
iota(begin(ord) , end(ord) , 0);
sort(begin(ord) , end(ord) , f);
return ord;
};
vector<int> ord = mkord(Q , [&](int a,int b){return X[a]<X[b];});
trc(rui);
trc(sui);
vl ans(Q);
auto it = ord.begin();
for(int i = N / 2 , j = 0 ; i < N ; i++ , j += 2){
trc(i , j);
ll val = rui[N] - rui[i] + sui[max(0 , j - 1)];
trc(A[i] + A[j]);
auto f = [&](ll x){
return 2 * x <= A[i] + A[j];
};
while(it != end(ord) && (f(X[*it]) || i == N - 1)){
trc(*it);
ans[*it] = val;
it++;
}
}
each(x,ans)out(x);
} |
p03158 | C++ | //#include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <bitset>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <stack>
#include <queue>
#include <deque>
#include <cstring>
#include <string>
#include <utility>
#include <array>
#include <complex>
#include <valarray>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <chrono>
#include <random>
#include <numeric>
#include<memory>
using namespace std;
#define int long long
typedef long long ll;
typedef unsigned long long ull;
//typedef unsigned __int128 HASH;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pullull;
typedef pair<ll,int> plli;
typedef pair<double,int> pdi;
typedef pair<long double, int> pdbi;
typedef pair<int,pii> pipii;
typedef pair<ll,pll> plpll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<pii> vpii;
typedef vector<vector<int>> mat;
#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n);i>0;i--)
#define rrep2(i,a,b) for (int i=(a);i>b;i--)
#define fi first
#define se second
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
template <class T>
using MINPQ = std::priority_queue<T, vector<T>, greater<T>>; //MINPQ<pii> pq;
template <class T>
using MAXPQ = std::priority_queue<T>;
const ll hmod1 = 999999937;
const ll hmod2 = 1000000000 + 9;
const int INF = 1<<30;
const ll INFLL = 1LL<<62;
const long double EPS = 1e-12;
const ll mod = 1000000000 + 7;
//const ll mod = 998244353;
const int dx4[4] = {1, 0, -1, 0};
const int dy4[4] = {0, 1, 0, -1};
const int dx8[8] = {1, 1, 1, 0, 0, -1, -1, -1};
const int dy8[8] = {0, 1, -1, 1, -1, 0, 1, -1};
const long double pi = 3.141592653589793;
#define addm(X, Y) (X) = ((X) + ((Y) % mod) + mod) % mod
#define inside(y, x, h, w) (0 <= (y) && (y) < (h) && 0 <= (x) && (x) < (w)) ? true : false
#define stand(B, i) (((B>>i) & 1) == 1) ? true : false //Bのi番目のbitが1ならtrue, 0ならfalse
//debug
#define DEBUG
#define DUMPOUT cerr
#ifdef DEBUG
#define dump(...) DUMPOUT<<#__VA_ARGS__<<" :["<<__FUNCTION__<<":"<<__LINE__<<"]"<<endl; DUMPOUT<<" "; dump_func(__VA_ARGS__)
#else
#define dump(...)
#endif
void dump_func() {DUMPOUT << endl;};
template <class Head, class... Tail> void dump_func(Head&& head, Tail&&... tail) {
DUMPOUT << head;
if (sizeof...(Tail) == 0) DUMPOUT << " ";
else DUMPOUT << ", ";
dump_func(std::move(tail)...);
}
//ostream
template<typename T> ostream& operator << (ostream& os, vector<T>& vec) {
os << "["; for (int i = 0; i<vec.size(); i++) os << vec[i] << (i + 1 == vec.size() ? "" : ", "); os << "]";
return os;
}
template<typename T, typename U> ostream& operator << (ostream& os, pair<T, U>& pair_var) {
os << "(" << pair_var.first << ", " << pair_var.second << ")";
return os;
}
template<typename T, typename U> ostream& operator << (ostream& os, map<T, U>& map_var) {
os << "[";
for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {
os << "(" << itr->first << ", " << itr->second << ")"; itr++; if(itr != map_var.end()) os << ", "; itr--;
}
os << "]";
return os;
}
template<typename T> ostream& operator << (ostream& os, set<T>& set_var) {
os << "[";
for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {
os << *itr; ++itr; if(itr != set_var.end()) os << ", "; itr--;
}
os << "]";
return os;
}
int n, q;
vector<int> A;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n >> q;
A.resize(n);
rep(i, n) cin >> A[i];
int sum[n] = {};
int sum1[n] = {};
sum[0] = A[0];
sum1[0] = A[0];
sum1[1] = A[1];
rep2(i, 1, n) {
sum[i] = sum[i-1] + A[i];
}
for (int i = 2; i < n; i+=2) {
sum1[i] += sum1[i-2] + A[i];
}
for (int i = 3; i < n; i+=2) {
sum1[i] += sum1[i-2] + A[i];
}
rep(i, q) {
int x;
cin >> x;
int l = -1;
int r = n;
int player = 0; //0:takahashi, 1:aoki
int st = -1;
if (x >= A[n-1]) {
cout << sum1[n-1] << endl;
continue;
}
while (r-l>1) {
int m = (r+l)/2;
//cerr << l << " " << r << " " << m << endl;
if (A[m] <= x) {
l = m;
continue;
}
int r_lw = abs(x - A[m-1]);
int r_up = abs(x - A[m]);
if (r_lw > r_up) {
if (0 == n-m-1) {
r = m;
player = 1;
st = m-1;
break;
}
l = m;
continue;
}
int idx0 = lower_bound(all(A), x - r_lw) - A.begin();
int idx1 = lower_bound(all(A), x - r_up) - A.begin();
int cnt0 = m - idx0;
int cnt1 = m - idx1;
if (cnt0 > n-m) {
r = m;
continue;
}
if (cnt1 < n-m-1) {
l = m;
continue;
}
if (cnt1 == n-m-1) {
r = m;
int nokori = n-m-1 - cnt0;
st = idx0 - nokori - 1;
player = 1;
break;
}
if (cnt1 >= n-m) {
r = m;
int nokori = n-m - cnt0;
st = idx0 - nokori - 1;
player = 0;
break;
}
}
//cerr << r << " " << player << " " << st << endl;
int ans = sum[n-1] - sum[r] + A[r];
if (player == 0 && st >= 0) ans += sum1[st];
else {
if (st >= 1) ans += sum1[st-1];
}
cout << ans << endl;
}
}
|
p03158 | C++ | /*
これを入れて実行
g++ code.cpp
./a.out
*/
#include <iostream>
#include <stdio.h>
#include <vector>
#include <string>
#include <queue>
#include <deque>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <unordered_map>
#include <cmath>
#include <math.h>
#include <tuple>
#include <iomanip>
#include <bitset>
#include <functional>
using namespace std;
typedef long long ll;
typedef long double ld;
int dy4[4] = {-1, 0, +1, 0};
int dx4[4] = {0, +1, 0, -1};
int dy8[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
int dx8[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const long long INF = 1LL << 60;
const ll MOD = 1e9 + 7;
bool greaterSecond(const pair<int, int>& f, const pair<int, int>& s){
return f.second > s.second;
}
ll gcd(ll a, ll b){
if (b == 0)return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b){
return a / gcd(a, b) * b;
}
ll nCr(ll n, ll r){
if(r == 0 || r == n){
return 1;
} else if(r == 1){
return n;
}
return (nCr(n - 1, r) + nCr(n - 1, r - 1));
}
ll nPr(ll n, ll r){
r = n - r;
ll ret = 1;
for (ll i = n; i >= r + 1; i--) ret *= i;
return ret;
}
//-----------------------ここから-----------
ll n, q;
vector<ll> a;
vector<ll> sum;
vector<ll> evensum;
vector<ll> oddsum;
bool check(ll mid, ll x){
ll diff = a[mid] - x;
ll l = lower_bound(a.begin(), a.end(), x - diff) - a.begin();
ll asize = mid - l + 1;
if(n - asize <= mid) return false;
return true;
}
ll solve(ll x){
auto itr = upper_bound(a.begin(), a.end(), x);
ll l = itr - a.begin() - 1;
if(l >= n - 1){
if(n % 2 != 0){
return oddsum[n];
} else {
return evensum[n];
}
}
ll left = l;
ll right = n;
while(abs(left - right) > 1){
ll mid = (left + right) / 2;
if(check(mid, x)){
left = mid;
} else {
right = mid;
}
//cout << "LR " << left << " " << right << endl;
}
left++;
ll res = 0;
ll s = n - left;
ll t = sum[n] - sum[left];
res += t;
if((max(0LL,left - s)) % 2 == 0){
res += evensum[max(0LL,left - s)];
} else {
res += oddsum[max(0LL,left - s)];
}
//cout << left << " " << right <<" " << s << " " << t << endl;
return res;
}
int main(void){
cin >> n >> q;
a.resize(n);
sum.resize(n + 1, 0);
evensum.resize(n + 1, 0);
oddsum.resize(n + 1, 0);
for(int i = 0; i < n; i++) cin >> a[i];
vector<ll> X(q);
for(int i = 0; i < q; i++){
cin >> X[i];
}
for(int i = 0; i < n; i++){
sum[i + 1] = sum[i] + a[i];
}
for(int i = 0; i < n; i++){
if(i % 2 == 1){
evensum[i + 1] = evensum[i] + a[i];
oddsum[i + 1] = oddsum[i];
} else {
evensum[i + 1] = evensum[i];
oddsum[i + 1] = oddsum[i] + a[i];
}
}
// for(int i = 0; i <= n; i++){
// cout << i << " " << evensum[i] << " " << oddsum[i] << endl;
// }
for(int i = 0; i < q; i++){
cout << solve(X[i]) << endl;
}
} |
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using VI = vector<int>;
using VL = vector<ll>;
template<class T> using PQ = priority_queue<T, vector<T>, greater<T>>;
#define FOR(i,a,n) for(int (i)=(a);(i)<(n);++(i))
#define eFOR(i,a,n) for(int (i)=(a);(i)<=(n);++(i))
#define rFOR(i,a,n) for(int (i)=(n)-1;(i)>=(a);--(i))
#define erFOR(i,a,n) for(int (i)=(n);(i)>=(a);--(i))
#define each(i, a) for(auto &i : a)
#define SORT(i) sort((i).begin(),(i).end())
#define rSORT(i,a) sort((i).begin(),(i).end(),(a))
#define all(i) (i).begin(),(i).end()
#define out(y,x) ((y) < 0 || h <= (y) || (x) < 0 || w <= (x))
#define line cout << "------------------------\n"
#define ENDL(i,n) ((i) == (n) - 1 ? "\n" : " ")
#define stop system("pause") //comment out this on AOJ.
constexpr ll INF = 1000000000;
constexpr ll LLINF = 1LL << 60;
constexpr ll mod = 1000000007;
constexpr ll MOD = 998244353;
constexpr ld eps = 1e-10; //1e-9?
constexpr ld pi = 3.1415926535897932;
template<class T>inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; }return false; }
template<class T>inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; }return false; }
inline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }
template<class T>inline istream& operator>>(istream& is, vector<T>& v) { for (auto& elemnt : v)is >> elemnt; return is; }
template<class T, class U>inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
template<class T>inline vector<T> vec(size_t a) { return vector<T>(a); }
template<class T>inline vector<T> defvec(T def, size_t a) { return vector<T>(a, def); }
template<class T, class... Ts>inline auto vec(size_t a, Ts... ts) { return vector<decltype(vec<T>(ts...))>(a, vec<T>(ts...)); }
template<class T, class... Ts>inline auto defvec(T def, size_t a, Ts... ts) { return vector<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...)); }
ll sum(VL& a, int l, int r) {
chmin(r, int(a.size()));
if (r <= 0)return 0;
if (0 < l)return a[r - 1] - a[l - 1];
return a[r - 1];
}
int main() {
init();
int n, q; cin >> n >> q;
VL a(n), odd(n), even(n), acc(n); cin >> a;
FOR(i, 0, n) {
acc[i] = a[i];
if (i&1)odd[i] += a[i];
else even[i] += a[i];
if (0 < i) {
acc[i] += acc[i - 1];
odd[i] += odd[i - 1];
even[i] += even[i - 1];
}
}
function<bool(int, ll)> check = [&](int k, ll x) {
if (n - 2 * k + 1 < 0)return false;
if (abs(x - a[n - k]) < abs(x - a[n - 2 * k + 1]))return false;
return true;
};
while (q--) {
ll x; cin >> x;
int ok = 0, ng = n;
while (ng - ok > 1) {
int mid = (ok + ng) / 2;
if (check(mid, x))ok = mid;
else ng = mid;
}
ll ans = sum(acc, n - ok, n);
if (n & 1)ans += sum(even, 0, n - 2 * ok);
else ans += sum(odd, 0, n - 2 * ok);
cout << ans << "\n";
}
} |
p03158 | C++ | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
#pragma warning(disable : 4996)
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<math.h>
#include<iomanip>
#include<set>
#include<numeric>
#include<cstring>
#include<cstdio>
#include<functional>
#include<bitset>
#include<limits.h>
#include<cassert>
#include<iterator>
#include<complex>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<time.h>
#include<random>
using namespace std;
#define REP(i, n) for(int i = 0;i < n;++i)
#define REPR(i, n) for(int i = n-1;i >= 0;--i)
#define FOR(i, m, n) for(int i = m;i < n;++i)
#define FORR(i, m, n) for(int i = m-1;i >= n;--i)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define REVERSE(v,n) reverse(v,v+n);
#define VREVERSE(v) reverse(v.begin(), v.end())
#define ll long long
#define pb(a) push_back
#define print(x) cout<<(x)<<'\n'
#define pe(x) cout<<(x)<<" "
#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define lb(v,n) lower_bound(v.begin(), v.end(), (n))
#define ub(v,n) upper_bound(v.begin(), v.end(), (n))
#define int long long
#define double long double
#define all(x) (x).begin(), (x).end()
#define print_space(v) REP(i,v.size())cout << v[i] << ((i == v.size() - 1) ? "\n" : " ")
template<typename T1, typename T2> inline void chmin(T1 & a, T2 b) { if (a > b) a = b; }
template<typename T1, typename T2> inline void chmax(T1& a, T2 b) { if (a < b) a = b; }
typedef pair<int, int>P;
const int MOD = 1e9 + 7; const int MAX = 200020;
const double pi = acos(-1); const double EPS = 1e-12;
const ll INF = 1e18;
void solve() {
int N, Q; cin >> N >> Q;
vector<int>A(N);
REP(i, N)cin >> A[i];
vector<int>odd(N + 1), even(N + 1),cum(N+1);
REP(i, N) {
odd[i + 1] += odd[i];
even[i + 1] += even[i];
cum[i + 1] = cum[i] + A[i];
if (i & 1)odd[i + 1] += A[i];
else even[i + 1] += A[i];
}
vector<int>X(Q);
REP(i, Q)cin >> X[i];
REP(_, Q) {
int x = X[_];
int ok = 1, ng = N;
while (abs(ok - ng) > 1) {
int mid = (ok + ng) / 2;
int id = N - 2 * mid + 1;
if (id < 0) {
ng = mid; continue;
}
if (abs(A[N - mid] - x) >= abs(A[id] - x))ok = mid;
else ng = mid;
}
ll sum = cum[N] - cum[N - ok];
if (N - 2 * ok >= 0) {
if ((N - 2 * ok) & 1)sum += even[N - 2 * ok];
else sum += odd[N - 2 * ok];
}
print(sum);
}
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
//int q; cin >> q;
//while (q--)
solve();
} |
p03158 | C++ | #include<bits/stdc++.h>
using namespace std;
#define FOR(a, b, c) for(int a = b; a <= c; ++a)
#define fi first
#define se second
#define pb push_back
#define int long long
typedef pair<int, int> ii;
const int N = 1e5 + 10;
int n, q;
int a[N], psum[N], pref[N];
bool check(int x, int mid) { // check if pos make the right side < the left side
int val = a[mid - 1] - x;
int res = lower_bound(a + 1, a + n + 1, x - val) - a;
return (mid - res) > (n - mid + 1);
}
int solve(int x) {
int pos = lower_bound(a + 1, a + n + 1, x) - a;
int lef = pos + 1, rig = n + 1;
while(rig > lef) {
int mid = (rig + lef) / 2;
if(check(x, mid)) rig = mid;
else lef = mid + 1;
}
// left = right = correct position
lef -= 1;
int val = a[lef - 1] - x;
int pos1 = lower_bound(a + 1, a + n + 1, x - val) - a;
pos1 = pos1 - (n - lef + 1 - (lef - pos1));
int ans = pref[lef - 1] - pref[pos1 - 1];
if(pos1 >= 3) ans += psum[pos1 - 2];
return pref[n] - ans;
}
signed main() {
// freopen("test.inp", "r", stdin);
// freopen("spm.out", "w", stdout);
ios_base::sync_with_stdio(false); cout.tie(0);
cin >> n >> q;
FOR(i, 1, n) {
cin >> a[i];
pref[i] = a[i] + pref[i - 1];
psum[i] = a[i]; if(i >= 2) psum[i] += psum[i - 2];
}
FOR(i, 1, q) {
int x; cin >> x;
if(x < a[1]) x = a[1];
if(x > a[n]) x = a[n];
cout << solve(x) << '\n';
}
/* vector<ii> vt;
FOR(i, 1, q) {
int x; cin >> x;
if(x < a[1]) x = a[1];
if(x > a[n]) x = a[n];
vt.pb(ii(x, i));
}
sort(vt.begin(), vt.end());
int cnt = 1;
for(auto i: vt) {
while(cnt < n && a[cnt] < i.fi) cnt ++;
if(cnt == 1) qans[i.se] = ans[1];
else if(cnt == n && ans[n] < i.fi) qans[i.se] = ans[n];
else qans[i.se] = (a[cnt] - i.fi < i.fi - a[cnt - 1]) ? ans[cnt] : ans[cnt - 1];
}
FOR(i, 1, q) cout << pref[n] - qans[i] << '\n';
return 0;
*/
}
|
p03158 | C++ | #include<bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
using namespace std;
#define rep(i,x) for(ll i = 0; i < (ll)(x); i++)
#define rrep(i,x) for(ll i = (ll)(x)-1;0 <= i; i--)
#define reps(i,x) for(ll i = 1; i < (ll)(x)+1; i++)
#define rreps(i,x) for(ll i = (ll)(x); 1 <= i; i--)
#define debug(x) cerr << #x << ": " << (x) << "\n";
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<ll,ll> Pll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef vector<vector<vector<ll>>> vvvl;
const ll INF = numeric_limits<ll>::max()/4;
const int n_max = 1e5+10;
void print() {
cout << endl;
}
template <class Head, class... Tail>
void print(Head&& head, Tail&&... tail) {
cout << head;
if (sizeof...(tail) != 0) cout << ' ';
print(forward<Tail>(tail)...);
}
template <class T>
void print(vector<T> &vec) {
for (auto& a : vec) {
cout << a;
if (&a != &vec.back()) cout << ' ';
}
cout << endl;
}
template <class T>
void print(vector<vector<T>> &df) {
for (auto& vec : df) {
print(vec);
}
}
template<class T, class U>
void print(pair<T,U> &p){
print(p.first, p.second);
}
int main(){
ll n,q; cin >> n >> q;
vector<ll> a(n);
rep(i,n) cin >> a[i];
vector<ll> x(q);
rep(i,q) cin >> x[i];
auto up = [&](ll x){
ll ok = n, ng = -1;
while(abs(ok - ng) > 1){
ll m = (ok + ng) / 2;
if(a[m] > x)ok = m;
else ng = m;
}
return ok;
};
auto low = [&](ll x){
ll ok = n, ng = -1;
while(abs(ok - ng) > 1){
ll m = (ok + ng) / 2;
if(a[m] >= x)ok = m;
else ng = m;
}
return ok;
};
vector<ll> odd(n+1, 0), even(n+1, 0), sum(n+1,0);
rep(i,n){
if(i & 1){
odd[i+1] = odd[i] + a[i];
even[i+1] = even[i];
}
else{
odd[i+1] = odd[i];
even[i+1] = even[i] + a[i];
}
sum[i+1] = sum[i] + a[i];
}
// print(sum);print(odd);print(even);
rep(i,q){
ll ok = 0, ng = 1e9 + 10;
while(abs(ok - ng) > 1){
ll med = (ok + ng) / 2;
ll r = up(x[i] + med), l = low(x[i] - med);
if(r - l <= n - r)ok = med;
else ng = med;
}
ll r = up(x[i] + ok);
// debug(x[i]);debug(ok);debug(r);
ll ans = sum[n] - sum[r];
if(n & 1){
if(2 * r >= n)ans += even[2*r - n];
}
else{
if(2 * r >= n)ans += odd[2*r-n];
}
cout << ans << "\n";
}
} |
p03158 | C++ | //header
#ifdef LOCAL
#include "cxx-prettyprint-master/prettyprint.hpp"
#define print(x) cout << x << endl
#else
#define print(...) 42
#endif
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
//types
using namespace std;
using ll = long long;
typedef pair < ll , ll >P;
template< typename T >
using Matrix = vector< vector< T > >;
template <std::uint_fast64_t Modulus> class modint {
using u64 = std::uint_fast64_t;
public:
u64 a;
constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {}
constexpr u64 &value() noexcept { return a; }
constexpr const u64 &value() const noexcept { return a; }
constexpr modint operator+(const modint rhs) const noexcept {
return modint(*this) += rhs;
}
constexpr modint operator-(const modint rhs) const noexcept {
return modint(*this) -= rhs;
}
constexpr modint operator*(const modint rhs) const noexcept {
return modint(*this) *= rhs;
}
constexpr modint operator/(const modint rhs) const noexcept {
return modint(*this) /= rhs;
}
constexpr modint &operator+=(const modint rhs) noexcept {
a += rhs.a;
if (a >= Modulus) {
a -= Modulus;
}
return *this;
}
constexpr modint &operator-=(const modint rhs) noexcept {
if (a < rhs.a) {
a += Modulus;
}
a -= rhs.a;
return *this;
}
constexpr modint &operator*=(const modint rhs) noexcept {
a = a * rhs.a % Modulus;
return *this;
}
constexpr modint &operator/=(modint rhs) noexcept {
u64 exp = Modulus - 2;
while (exp) {
if (exp % 2) {
*this *= rhs;
}
rhs *= rhs;
exp /= 2;
}
return *this;
}
};
//abbreviations
#define all(x) (x).begin(), (x).end()
#define reverse(x) (x).rbegin(), (x).rend()
#define rep2(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i,n) for(ll i=0;i<(n);++i)
#define SZ(x) ((ll)(x).size())
#define sum(x) accumulate(begin(x), end(x), 0LL)//?
#define pb(x) push_back(x)
//functions
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template< typename T >
T mod_pow(T x, T n, const T &p) {
T ret = 1;
while(n > 0) {
if(n & 1) (ret *= x) %= p;
(x *= x) %= p;
n >>= 1;
}
return ret;
}
uint64_t my_rand(void) {
static uint64_t x = 88172645463325252ULL;
x = x ^ (x << 13); x = x ^ (x >> 7);
return x = x ^ (x << 17);
}
//constant
#define INF 1'010'000'000'000'000'017LL
#define mod 1000000007LL
#define eps 0.0001
//library
//main
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout<<fixed<<setprecision(20);
ll N, Q; cin >> N >> Q;
vector<ll> A(N), cumsum(N+1), cumsum_taka(N+1);
rep(i, N){
cin >> A[i];
cumsum[i+1] = cumsum[i]+A[i];
cumsum_taka[i+1] = cumsum_taka[i];
if(i%2 != N%2) cumsum_taka[i+1]+=A[i];
}
rep(i, Q){
ll x; cin >> x;
int j = distance(begin(A), upper_bound(all(A), x));
ll ng = (N+1)/2+1, ok = 1;
ll l;
while(ng-ok>1){
ll mid = (ok+ng)/2;
if(x*2-A[N-mid]<=A[N-mid*2+1]) ok = mid;
else ng = mid;
}
ll ans = cumsum[N]-cumsum[N-ok]+cumsum_taka[N-ok*2+1];
cout << ans << endl;
}
}
|
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define ASSERT(C, ...) assert( (C) || (PRINT(__VA_ARGS__), false) )
template <class Head> void PRINT(Head head) {
std::cout << head << "\n";
}
template <class Head, class... Tail> void PRINT(Head head, Tail... tail) {
std::cout << head << " ";
PRINT(tail...);
}
vector<ll> solve(ll N, ll Q, vector<ll>& A, vector<ll>& X) {
vector<ll> sl(N+1), ss2(N+2);
for ( int i = 0; i < N; i++ ) {
sl[i+1] = sl[i] + A[i];
}
for ( int i = N-1; i >= 0; i-- ) {
if ( i % 2 == 0 ) ss2[i] = ss2[i+2] + A[i];
}
// k個の連続した領域を取れるか
auto check = [&](ll x, ll k) {
if ( k == 0 ) return true;
if ( 2*k-2 >= N ) return false;
else {
return abs(A[k-1] - x) >= abs(A[2*k-2] - x);
}
};
vector<ll> ans;
for ( int q = 0; q < Q; q++ ) {
ll x = X[q];
ll l = 0, r = (N+1)/2+1;
while ( r - l > 1 ) {
ll m = (l+r)/2;
if ( check(x, m+1) ) l = m;
else r = m;
}
ll a = sl[l+1];
if ( 2*(l+1) < N ) a += ss2[2*(l+1)];
ans.push_back(a);
}
return ans;
}
vector<ll> solve_naive(ll N, ll Q, vector<ll>& A, vector<ll>& X) {
vector<ll> ans;
using pii = pair<ll,int>;
for ( int q = 0; q < Q; q++ ) {
ll x = X[q];
vector<bool> used(N);
priority_queue<pii> q1, q2;
for ( int i = 0; i < N; i++ ) {
q1.push(pii(A[i], i));
q2.push(pii(-abs(A[i]-x), i));
}
ll a = 0;
for ( int i = 0; i < N; i++ ) {
if ( i % 2 == 0 ) {
while ( used[q1.top().second] ) q1.pop();
auto p = q1.top();
q1.pop();
used[p.second] = true;
a += p.first;
} else {
while ( used[q2.top().second] ) q2.pop();
auto p = q2.top();
q2.pop();
used[p.second] = true;
}
}
ans.push_back(a);
}
return ans;
}
void test() {
mt19937_64 mt64(0);
uniform_int_distribution<ll> rnd(1, 10000);
for ( int t = 0; t < 200; t++ ) {
ll N = t > 100 ? 2 + rnd(mt64) % 4 : 100 + rnd(mt64) % 10;
ll Q = N;
vector<ll> A, X;
set<ll> as;
while ( as.size() < N ) {
as.insert(1+rnd(mt64));
}
for ( auto aa : as ) {
A.push_back(aa);
}
for ( int i = 0; i < Q; i++ ) {
X.push_back(1+rnd(mt64));
}
sort(A.rbegin(), A.rend());
auto v1 = solve(N, Q, A, X);
auto v2 = solve_naive(N, Q, A ,X);
for ( int i = 0; i < Q; i++ ) {
ASSERT(v1[i] == v2[i], t, i, v1[i], v2[i]);
}
}
}
int main() {
ll N, Q;
cin >> N >> Q;
vector<ll> A(N), X(Q);
for ( int i = 0; i < N; i++ ) cin >> A[i];
for ( int i = 0; i < Q; i++ ) cin >> X[i];
sort(A.rbegin(), A.rend());
auto ans = solve(N, Q, A, X);
for ( int i = 0; i < Q; i++ ) {
cout << ans[i] << "\n";
}
return 0;
} |
p03158 | C++ | #include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#include <string>
#include <math.h>
#include <iomanip>
#include <limits>
#include <list>
#include <queue>
#include <tuple>
#include <map>
#include <stack>
#include <set>
#include <bitset>
using namespace std;
#define fast_io ios_base::sync_with_stdio (false) ; cin.tie(0) ; cout.tie(0) ;
#define MOD (long long int)(1e9+7)
#define ll long long int
#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 REP(i,n) for(int i=n-1; i>=0; i--)
#define REPS(i,n) for(int i=n; i>0; i--)
#define INF (int)(1123456789)
#define LINF (long long int)(112345678901234567)
#define chmax(a, b) a = (((a)<(b)) ? (b) : (a))
#define chmin(a, b) a = (((a)>(b)) ? (b) : (a))
#define all(v) v.begin(), v.end()
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
ll mpow(ll a, ll b){
if(b==0) return 1;
else if(b%2==0){ll memo = mpow(a,b/2); return memo*memo%MOD;}
else return mpow(a,b-1) * a % MOD;
}
ll lpow(ll a, ll b){
if(b==0) return 1;
else if(b%2==0){ll memo = lpow(a,b/2); return memo*memo;}
else return lpow(a,b-1) * a;
}
ll gcd(ll a, ll b){
if(b==0) return a;
else return gcd(b, a%b);
}
vector<ll> kaijo_memo;
ll kaijo(ll n){
if(kaijo_memo.size() > n) return kaijo_memo[n];
if(kaijo_memo.size() == 0) kaijo_memo.push_back(1);
while(kaijo_memo.size() <= n) kaijo_memo.push_back(kaijo_memo[kaijo_memo.size()-1] * kaijo_memo.size() % MOD);
return kaijo_memo[n];
}
vector<ll> gyaku_kaijo_memo;
ll gyaku_kaijo(ll n){
if(gyaku_kaijo_memo.size() > n) return gyaku_kaijo_memo[n];
if(gyaku_kaijo_memo.size() == 0) gyaku_kaijo_memo.push_back(1);
while(gyaku_kaijo_memo.size() <= n) gyaku_kaijo_memo.push_back(gyaku_kaijo_memo[gyaku_kaijo_memo.size()-1] * mpow(gyaku_kaijo_memo.size(), MOD-2) % MOD);
return gyaku_kaijo_memo[n];
}
ll nCr(ll n, ll r){
if(n == r) return 1;//0個の丸と-1個の棒みたいな時に時に効く？不安.
if(n < r || r < 0) return 0;
ll ret = 1;
ret *= kaijo(n); ret %= MOD;
ret *= gyaku_kaijo(r); ret %= MOD;
ret *= gyaku_kaijo(n-r); ret %= MOD;
return ret;
}
int main(void){
fast_io
cout<<fixed<<setprecision(15);
ll n,q;cin>>n>>q;
vector<ll> A(n+3),up_sum(n+3),kisu_sum(n+3);
up_sum[0] = 0;
REPS(i,n){
cin>>A[i];
}
reps(i,n){
up_sum[i] = up_sum[i-1] + A[i];
}
kisu_sum[n+1] = 0;
kisu_sum[n+2] = 0;
REPS(i,n){
if(i%2 == 1){
kisu_sum[i] = kisu_sum[i+2] + A[i];
}
}
rep(t_, q){
ll x;cin>>x;
ll ok = n+10;
ll ng = 0;
while(ok-ng >= 2){
ll mid = (ok+ng)/2;
if(2*mid+1 > n || abs(A[mid+1] - x) < abs(A[2*mid+1] - x)){
ok = mid;
}else{
ng = mid;
}
}
cout<<up_sum[ok] + kisu_sum[2*ok + 1]<<endl;
}
return 0;
} |
p03158 | C++ | // template version 1.15
using namespace std;
#include <bits/stdc++.h>
// varibable settings
#define int long long
const int INF=1e18;
// define basic macro {{{
#define _overload3(_1,_2,_3,name,...) name
#define _rep(i,n) repi(i,0,n)
#define repi(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload3(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define _rrep(i,n) rrepi(i,0,n)
#define rrepi(i,a,b) for(int i=(int)((b)-1);i>=(int)(a);--i)
#define rrep(...) _overload3(__VA_ARGS__,rrepi,_rrep,)(__VA_ARGS__)
#define each(i,a) for (auto&& i : a)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define mt(a, b, c) make_tuple(a, b, c)
#define ub upper_bound
#define lb lower_bound
#define posl(A, x) (lower_bound(all(A), x)-A.begin())
#define posu(A, x) (upper_bound(all(A),x)-A.begin())
template<class T> inline void chmax(T &a, const T &b) { if((a) < (b)) (a) = (b); }
template<class T> inline void chmin(T &a, const T &b) { if((a) > (b)) (a) = (b); }
#define divceil(a,b) ((a)+(b)-1)/(b)
#define is_in(x, a, b) ((a)<=(x) && (x)<(b))
#define uni(x) sort(all(x));x.erase(unique(all(x)),x.end())
#define slice(l, r) substr(l, r-l)
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long double ld;
typedef pair<int,int> pii;
typedef tuple<int,int,int> iii;
template<typename T> using PQ = priority_queue<T, vector<T>, greater<T>>;
struct Fast { Fast(){ std::cin.tie(0); ios::sync_with_stdio(false); } } fast;
#if defined(PCM) || defined(LOCAL)
#include "lib/dump.hpp"
#else
#define dump(...) 42
#define dump_1d(...) 42
#define dump_2d(...) 42
#define cerrendl 42
#endif
//}}}
signed main() {
int n,q;cin>>n>>q;
vector<int> a(n), o(n), e(n);
rep(i, n) {
cin>>a[i];
if (i%2==0) e[i]=a[i];
else o[i]=a[i];
}
vi aa(a);
rep(i, 1, n) {
e[i] += e[i-1];
o[i] += o[i-1];
aa[i] += aa[i-1];
}
dump(a);
dump(e);
dump(o);
dump(aa);
rep(i, q){
cerrendl;
int x;cin>>x;
int left = 0;
int right = n-1;
auto isright = [&](int i) {
if (x>=a[i]) return false;
int d = a[i]-x;
int c1 = ub(all(a), x+d) - lb(all(a), x-d);
int c2 = n-i;
bool ans = (c1>=c2 ? true : false);
dump(i, x, d, c1, c2, ans);
return ans;
};
while (right-left>1){
int mid = (right+left)/2;
if (isright(mid)) { right = mid;}
else{ left = mid; }
}
dump(i, x, right);
int ans = 0;
ans += aa[n-1];
ans -= aa[right-1];
dump(ans);
int j = right - (n-right+1);
if (j>=0){
ans += (j%2==0 ? e[j] : o[j]);
}
cout << ans << endl;
}
return 0;
}
|
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i = (m); i <= (n); i++)
#define zep(i,m,n) for(ll i = (m); i < (n); i++)
#define rrep(i,m,n) for(ll i = (m); i >= (n); i--)
#define print(x) cout << (x) << endl;
#define printa(x,m,n) for(ll i = (m); i <= n; i++){cout << (x[i]) << " ";} cout<<endl;
int main(){
cin.tie(0); ios::sync_with_stdio(false);
ll n, q;
cin >> n >> q;
ll a[n], x[q];
zep(i, 0, n){cin >> a[i];}
zep(i, 0, q){cin >> x[i];}
ll r = 0;
zep(i, n/2, n){
r += a[i];
}
map<ll, ll> mp;
mp[0] = r;
if(n%2 == 0){
rep(i, 1, n/2-1){
r -= a[n/2+i-1];
r += a[2*i-1];
ll mid = (a[n/2+i-1]+a[2*i-1])/2+1;
mp[-mid] = r;
}
}
else{
rep(i, 1, n/2){
r -= a[n/2+i-1];
r += a[2*i-2];
ll mid = (a[n/2+i-1]+a[2*i-2])/2+1;
mp[-mid] = r;
}
}
zep(i, 0, q){
print((*mp.lower_bound(-x[i])).second)
}
/*for(auto it = mp.begin(); it != mp.end(); it++){
cout << (*it).first << " " << (*it).second << endl;
}*/
return 0;
} |
p03158 | C++ | #include<bits/stdc++.h>
using namespace std;
using ll=long long;
const ll MOD=1e9+7;
const int INF=1e9;
const ll LINF=(ll)1e18;
int main(){
int n,q;
cin>>n>>q;
ll a[n];
for(int i=0;i<n;i++){
cin>>a[i];
}
ll sum[n];
ll tsum[n];
sum[n-1]=a[n-1];
tsum[0]=((n-1)%2==0)?a[0]:0;
for(int i=n-2;i>=0;i--){
sum[i]=a[i]+sum[i+1];
}
for(int i=1;i<n;i++){
if((n-1-i)%2==0){
tsum[i]=a[i]+tsum[i-1];
}
else{
tsum[i]=tsum[i-1];
}
}
for(int i=0;i<q;i++){
ll x;
cin>>x;
int ok=0,ng=n+1;
while(ng-ok>1){
int y=(ok+ng)/2;
ll l=abs(a[n-y]-x);
ll r=abs(a[n-(y+1)/2]-x);
if(l>r)ng=y;
else ok=y;
}
ll ans=sum[n-(ok+1)/2];
if(ok!=n)ans+=tsum[n-ok-1];
cout<<ans<<endl;
}
}
|
p03158 | C++ | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define INF (1e9)
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) x.begin(),x.end()
const long double PI = acos(-1.0L);
const long long MOD = 1000000007LL;
// const long long MOD = 998244353LL;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
template<class T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return true;} return false; }
template<class T> inline bool chmin(T &a, T b) { if (a > b) { a = b; return true;} return false; }
////////////////////////////////////////////////////////////////////////////////////////////////////////
int main() {
ios::sync_with_stdio(false); cin.tie(nullptr);
int N,Q; cin >> N >> Q;
vector<ll> A(N);
rep(i,N) cin >> A[i];
vector<pii> X(Q);
rep(i,Q) {
cin >> X[i].first;
X[i].second = i;
}
int L = N/2;
vector<ll> S(N+1),B(L+1);
rep(i,N) S[i+1] = S[i]+A[i];
reverse(all(A));
A.emplace_back(0);
reverse(all(A));
for (int i = 1; i <= L; i++) {
B[i] = A[N-2*i];
}
for (int i = L; i > 1; i--) {
B[i-1] += B[i];
}
sort(all(X)); reverse(all(X));
int cur = 0;
vector<ll> ans(Q);
for (int i = 1; i <= L; i++) {
while (cur < Q && abs(A[N-i] - X[cur].first) < abs(X[cur].first - A[N-2*i])) {
ans[X[cur].second] += S[N] - S[N-i] + B[i];
cur++;
};
}
while (cur < Q) {
ans[X[cur].second] += S[N] - S[L];
cur++;
}
rep(i,Q) cout << ans[i] << endl;
} |
p03158 | C++ | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int N, Q; cin >> N >> Q;
vector<long long> A(N);
for (int i = 0; i < N; ++i) cin >> A[i];
reverse(A.begin(), A.end()); // 考えやすいように左右反転
vector<long long> sum(N+1), evensum(N+1); // 累積和、偶数番目累積和
for (int i = 0; i < N; ++i) {
sum[i+1] = sum[i] + A[i];
evensum[i+1] = evensum[i] + (i % 2 == 0 ? A[i] : 0);
}
vector<long long> ths, vals; // ths: L の値が変化する x の境目、vals: またそのときの先手のスコア
for (int i = 0; i < (N-1)/2; ++i) {
// 先手が i + 1 個の領域を取ったときは
// 後手も i + 1 個の領域を取る
long long th = (A[i+1] + A[i*2+2])/2 + 1; // 後手が取る数値の真ん中
long long val = (sum[i+1] - sum[0]) + (evensum[N] - evensum[i*2+2]);
// (sum[i+1] - sum[0]) は先手が予め取ったスコア これに 青が取った領域の右から交互に取る
// 青の取る領域は i+1からi+1個なのでええええ
ths.push_back(th); vals.push_back(val);
}
reverse(ths.begin(), ths.end()); reverse(vals.begin(), vals.end());
for (int _ = 0; _ < Q; ++_) {
long long x; cin >> x;
int it = upper_bound(ths.begin(), ths.end(), x) - ths.begin(); // L の値が何かを求める
if (it == 0) cout << sum[(N+1)/2] - sum[0] << endl;
else cout << vals[it-1] << endl;
}
} |
p03158 | C++ | #include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<n;i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define INF 1000000000
#define mod 1000000007
using ll=long long;
const ll LINF = 1001002003004005006ll;
int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1};
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
signed main(){
cin.tie(0);
ios::sync_with_stdio(0);
int n,q;cin>>n>>q;
vector<ll> a(n);
rep(i,n) cin>>a[i];
vector<ll> lim,ans;
if(n%2==0){
vector<ll> sume(n+1,0),sum(n+1,0);
rep(i,n){
if(i%2) sume[i+1]=sume[i]+a[i];
else sume[i+1]=sume[i];
sum[i+1]=sum[i]+a[i];
}
for(int k=1;k<n/2;k++){
//後ろからk個を高橋君がとる
ll num=(a[n-k-1]+a[n-2*k-1])/2;
lim.push_back(num);
ans.push_back(sum[n]-sum[n-k]+sume[n-2*k]);
}
reverse(ALL(lim));
lim.push_back(LINF);
ans.push_back(sum[n]-sum[n/2]);
reverse(ALL(ans));
// debug(lim);debug(ans);
while(q--){
ll x;cin>>x;
int idx=lower_bound(ALL(lim),x)-lim.begin();
cout<<ans[idx]<<endl;
}
return 0;
}
else{
vector<ll> sumo(n+1,0),sum(n+1,0);
rep(i,n){
if(i%2==0) sumo[i+1]=sumo[i]+a[i];
else sumo[i+1]=sumo[i];
sum[i+1]=sum[i]+a[i];
}
for(int k=1;k<=n/2;k++){
ll num=(a[n-k-1]+a[n-2*k-1])/2;
lim.push_back(num);
ans.push_back(sum[n]-sum[n-k]+sumo[n-2*k]);
}
reverse(ALL(lim));
lim.push_back(LINF);
ans.push_back(sum[n]-sum[n/2]);
reverse(ALL(ans));
// debug(lim);debug(ans);
while(q--){
ll x;cin>>x;
int idx=lower_bound(ALL(lim),x)-lim.begin();
cout<<ans[idx]<<endl;
}
}
return 0;
}
|
p03158 | C++ | #include<bits/stdc++.h>
#define inf 0x3f3f3f3f
using namespace std;
typedef long long ll;
const int N=1e5+5;
int n,q,a[N];
ll sum[N],s[N];
int main()
{
scanf("%d%d",&n,&q);
for(int i=1;i<=n;i++) scanf("%d",&a[i]);
sum[1]=s[1]=a[1];
a[0]=a[n+1]=inf;
for(int i=2;i<=n;i++) sum[i]=sum[i-2]+a[i],s[i]=s[i-1]+a[i];
while(q--)
{
int x;scanf("%d",&x);
int l=0,r=1e9;
while(l<=r)
{
int m=l+r>>1;
int fl=lower_bound(a+1,a+1+n,x-m)-a;
int fr=upper_bound(a+1,a+1+n,x+m)-a-1;
if(fr-fl+1<n-fr) l=m+1;
else if(fr-fl+1>n-fr) r=m-1;
else break;
}
int m=l+r>>1;
int fl=lower_bound(a+1,a+1+n,x-m)-a;
int fr=upper_bound(a+1,a+1+n,x+m)-a-1;
while(fr-fl+1>n-fr)
if(abs(x-a[fr])<=abs(x-a[fl])) fr--;
else fl++;
while(fr-fl+1<n-fr-1)
if(abs(x-a[fl-1])<=abs(x-a[fr+1])) fl--;
else fr++;
if(fr-fl+1==n-fr) printf("%lld\n",s[n]-s[fr]+sum[fl-1]);
else printf("%lld\n",s[n]-s[fr]+sum[max(0,fl-2)]);
}
}
|
p03158 | C++ | #include <iostream>
using namespace std;long long i=0,n,q,x,r,l,m,a[100000],t[100001],s[100001];main(){cin>>n>>q;for(;i<n;i++){cin>>a[i];s[i+1]=s[i]+a[i];t[i+1]=(i?t[i-1]:0)+a[i];}while(q--){cin>>x;l=0;r=n+1;while(r-l>1){m=(r+l)/2;(abs(a[n-m]-x)>abs(a[n-(m+1)/2]-x)?r:l)=m;}cout<<s[n]-s[n-(l+1)/2]+t[max(n-l-(l&1),0LL)]<<endl;}}
|
p03158 | C++ | #include <iostream>
using namespace std;long long i=0,n,q,x,r,l,m,a[100000],t[100001],s[100001];int main(){cin>>n>>q;for(;i<n;i++){cin>>a[i];s[i+1]=s[i]+a[i];t[i+1]=(i?t[i-1]:0)+a[i];}while(q--){cin>>x;l=0;r=n+1;while(r-l>1){m=(r+l)/2;(abs(a[n-m]-x)>abs(a[n-(m+1)/2]-x)?r:l)=m;}cout<<s[n]-s[n-(l+1)/2]+t[max(n-l-(l&1),0LL)]<<endl;}}
|
p03158 | C++ | #include <iostream>
using namespace std;typedef long long ll;ll n,q,x,r,l,m,a[100000],t[100001],s[100001];int main(){cin>>n>>q;for(int i=0;i<n;i++){cin>>a[i];s[i+1]=s[i]+a[i];t[i+1]=(i?t[i-1]:0)+a[i];}while(q--){cin>>x;l=0;r=n+1;while(r-l>1){m=(r+l)/2;(abs(a[n-m]-x)>abs(a[n-(m+1)/2]-x)?r:l)=m;}cout<<s[n]-s[n-(l+1)/2]+t[max(n-l-(l&1),0LL)]<<endl;}}
|
p03158 | C++ | #include<bits/stdc++.h>
using namespace std;
int main(){
unsigned long N, Q;
cin >> N >> Q;
vector<unsigned long> A(N), S(N), X, a;
for(auto& i : A)cin >> i;
partial_sum(A.rbegin(), A.rend(), S.begin());
for(unsigned long i{(N + 1) / 2}, s{0}; i--; s += A[N - i * 2 - 1])a.push_back(S[i] + s);
for(unsigned long i{(N + 1) / 2}; --i;)X.push_back(A[N - i - 1] + A[N - i * 2 - 1]);
for(unsigned long i{0}, x; i < Q; ++i){
cin >> x;
cout << a[lower_bound(begin(X), end(X), x * 2) - begin(X)] << endl;
}
return 0;
} |
p03158 | C++ | #include<bits/stdc++.h>
using namespace std;
main(){
unsigned long N, Q;
cin >> N >> Q;
vector<unsigned long> A(N), S(N), X, a;
for(auto& i : A)cin >> i;
partial_sum(A.rbegin(), A.rend(), S.begin());
for(unsigned long i{(N + 1) / 2}, AS{0}; i--; AS += A[N - i * 2 - 1])a.push_back(S[i] + AS);
for(unsigned long i{(N + 1) / 2}; --i;)X.push_back(A[N - i - 1] + A[N - i * 2 - 1]);
auto beg = begin(X), edn = end(X);
for(unsigned long i{0}, x; i < Q; ++i){
cin >> x;
cout << a[lower_bound(beg, edn, x * 2) - beg] << endl;
}
return 0;
} |
p03158 | C++ | #include<bits/stdc++.h>
using namespace std;
main(){
unsigned long N,Q;
cin>>N>>Q;
vector<unsigned long> A(N),S(N),X,a;
for(auto&i:A)cin>>i;
partial_sum(rbegin(A),rend(A),begin(S));
for(unsigned long i{(N+1)/2},s{0};i--;s+=A[N-i*2-1])a.push_back(S[i]+s);
for(unsigned long i{(N+1)/2};--i;)X.push_back(A[N-i-1]+A[N-i*2-1]);
for(unsigned long i{0},x;i<Q;++i){
cin>>x;
cout<<a[lower_bound(begin(X),end(X),x*2)-begin(X)]<<endl;
}
} |
p03158 | C++ | #include<bits/stdc++.h>
using namespace std;
int main(){
unsigned long N, Q;
cin >> N >> Q;
vector<unsigned long> A(N), S(N), X, a;
for(auto& i : A)cin >> i;
partial_sum(A.rbegin(), A.rend(), S.begin());
for(unsigned long i{(N + 1) / 2}, AS{0}; i--; AS += A[N - i * 2 - 1])a.push_back(S[i] + AS);
for(unsigned long i{(N + 1) / 2}; --i;)X.push_back(A[N - i - 1] + A[N - i * 2 - 1]);
auto beg = begin(X), edn = end(X);
for(long long i{0}, x; i < Q; ++i){
cin >> x;
cout << a[lower_bound(beg, edn, x * 2) - beg] << endl;
}
return 0;
} |
p03158 | C++ | #include<bits/stdc++.h>
using namespace std;
int main(){
unsigned long N, Q;
cin >> N >> Q;
vector<unsigned long> A(N), AS(N + 2), S(N), X, a;
for(auto& i : A)cin >> i;
partial_sum(A.rbegin(), A.rend(), S.begin());
for(unsigned long i{0}; i < N; ++i)AS[i + 2] = A[i] + AS[i];
for(unsigned long i{(N + 1) / 2}; i--;)a.push_back(S[i] + AS[N - i * 2 - 1]);
for(unsigned long i{(N + 1) / 2}; --i;)X.push_back(A[N - i - 1] + A[N - i * 2 - 1]);
auto beg = begin(X), edn = end(X);
for(long long i{0}, x; i < Q; ++i){
cin >> x;
cout << a[lower_bound(beg, edn, x * 2) - beg] << endl;
}
return 0;
} |
p03158 | C++ | #include<bits/stdc++.h>
using namespace std;
int main(){
unsigned long N, Q;
cin >> N >> Q;
vector<unsigned long> A(N), AS(N + 2), S(N), X, a;
for(auto& i : A)cin >> i;
partial_sum(A.rbegin(), A.rend(), S.begin());
for(unsigned long i{0}; i < N; ++i)AS[i + 2] = A[i] + AS[i];
for(unsigned long i{0}; i * 2 < N; ++i)a.push_back(S[i] + AS[N - i * 2 - 1]);
for(unsigned long i{1}; i * 2 < N; ++i)X.push_back(A[N - i - 1] + A[N - i * 2 - 1]);
reverse(a.begin(), a.end());
reverse(X.begin(), X.end());
auto beg = begin(X), edn = end(X);
for(long long i{0}, x; i < Q; ++i){
cin >> x;
cout << a[lower_bound(beg, edn, x * 2) - beg] << endl;
}
return 0;
} |
p03158 | C++ | #include<bits/stdc++.h>
using namespace std;
namespace fast {
// fast I/O by rsk0315 (update: 2019-10-14 16:56:15).
// This version supports only integer inputs/outputs, single character
// outputs, and string literal outputs.
static size_t constexpr buf_size = 1 << 17;
static size_t constexpr margin = 1;
static char inbuf[buf_size + margin] = {};
static char outbuf[buf_size + margin] = {};
static __attribute__((aligned(8))) char minibuf[32];
static size_t constexpr int_digits = 20; // 18446744073709551615
static uintmax_t constexpr digit_mask = 0x3030303030303030;
static uintmax_t constexpr first_mask = 0x00FF00FF00FF00FF;
static uintmax_t constexpr second_mask = 0x0000FFFF0000FFFF;
static uintmax_t constexpr third_mask = 0x00000000FFFFFFFF;
static uintmax_t constexpr tenpow[] = {
1, 10, 100, 1000, 10000, 100000, 1000000, 10000000, 100000000
};
template <typename Tp>
using enable_if_integral = std::enable_if<std::is_integral<Tp>::value, Tp>;
class scanner {
char* pos = inbuf;
char* endpos = inbuf + buf_size;
void M_read_from_stdin() {
endpos = inbuf + fread(pos, 1, buf_size, stdin);
}
void M_reread_from_stdin() {
ptrdiff_t len = endpos - pos;
if (!(inbuf + len <= pos)) return;
memcpy(inbuf, pos, len);
char* tmp = inbuf + len;
endpos = tmp + fread(tmp, 1, buf_size-len, stdin);
*endpos = 0;
pos = inbuf;
}
public:
scanner() { M_read_from_stdin(); }
template <typename Integral,
typename enable_if_integral<Integral>::type* = nullptr>
void scan_parallel(Integral& x) {
// See https://qiita.com/rsk0315_h4x/items/17a9cb12e0de5fd918f4
if (__builtin_expect(endpos <= pos + int_digits, 0))
M_reread_from_stdin();
bool ends = false;
typename std::make_unsigned<Integral>::type y = 0;
bool neg = false;
if (std::is_signed<Integral>::value && *pos == '-') {
neg = true;
++pos;
}
do {
memcpy(minibuf, pos, 8);
long c = *(long*)minibuf;
long d = (c & digit_mask) ^ digit_mask;
int skip = 8;
int shift = 8;
if (d) {
int ctz = __builtin_ctzl(d);
if (ctz == 4) break;
c &= (1L << (ctz-5)) - 1;
int discarded = (68-ctz) / 8;
shift -= discarded;
c <<= discarded * 8;
skip -= discarded;
ends = true;
}
c |= digit_mask;
c ^= digit_mask;
c = ((c >> 8) + c*10) & first_mask;
c = ((c >> 16) + c*100) & second_mask;
c = ((c >> 32) + c*10000) & third_mask;
y = y*tenpow[shift] + c;
pos += skip;
} while (!ends);
x = (neg? -y: y);
++pos;
}
template <typename Integral,
typename enable_if_integral<Integral>::type* = nullptr>
void scan_serial(Integral& x) {
if (__builtin_expect(endpos <= pos + int_digits, 0))
M_reread_from_stdin();
bool neg = false;
if (std::is_signed<Integral>::value && *pos == '-') {
neg = true;
++pos;
}
typename std::make_unsigned<Integral>::type y = *pos-'0';
while (*++pos >= '0') y = 10*y + *pos-'0';
x = (neg? -y: y);
++pos;
}
template <typename Integral,
typename enable_if_integral<Integral>::type* = nullptr>
// Use scan_parallel(x) only when x may be too large (about 10^12).
// Otherwise, even when x <= 10^9, scan_serial(x) may be faster.
void scan(Integral& x) { scan_serial(x); }
void scan_serial(std::string& s) {
// until first whitespace
s = "";
do {
char* startpos = pos;
while (*pos > ' ') ++pos;
s += std::string(startpos, pos);
if (*pos != 0) {
++pos; // skip the space
break;
}
M_reread_from_stdin();
} while (true);
}
void scan(std::string& s) { scan_serial(s); }
};
class printer {
char* pos = outbuf;
void M_flush_stdout() {
fwrite(outbuf, 1, pos-outbuf, stdout);
pos = outbuf;
}
public:
printer() = default;
~printer() { M_flush_stdout(); }
void print(char c) {
if (__builtin_expect(pos + 1 >= outbuf + buf_size, 0)) M_flush_stdout();
*pos++ = c;
}
template <size_t N>
void print(char const(&s)[N]) {
if (__builtin_expect(pos + N >= outbuf + buf_size, 0)) M_flush_stdout();
memcpy(pos, s, N-1);
pos += N-1;
}
void print(char const* s) {
while (*s != 0) {
*pos++ = *s++;
if (pos == outbuf + buf_size) M_flush_stdout();
}
}
template <typename Integral,
typename enable_if_integral<Integral>::type* = nullptr>
void print(Integral x) {
if (__builtin_expect(pos + int_digits >= outbuf + buf_size, 0))
M_flush_stdout();
if (x == 0) {
*pos++ = '0';
return;
}
if (x < 0) {
*pos++ = '-';
if (__builtin_expect(x == std::numeric_limits<Integral>::min(), 0)) {
switch (sizeof x) {
case 2: print("32768"); return;
case 4: print("2147483648"); return;
case 8: print("9223372036854775808"); return;
}
}
x = -x;
}
char* mp = minibuf + sizeof minibuf;
*--mp = x % 10 + '0';
size_t len = 1;
typename std::make_unsigned<Integral>::type y = x / 10;
while (y > 0) {
*--mp = y % 10 + '0';
y /= 10;
++len;
}
memcpy(pos, mp, len);
pos += len;
}
template <typename Tp>
void println(Tp const& x) { print(x), print('\n'); }
};
} // fast::
// thank you ebi-chan!
fast::scanner ebin;
fast::printer ebout;
int main(){
unsigned long N, Q;
ebin.scan(N);
ebin.scan(Q);
vector<unsigned long> A(N), AS(N + 2), S(N + 1), X((N - 1) / 2), a((N + 1) / 2);
for(auto& i : A)ebin.scan(i);
partial_sum(A.begin(), A.end(), S.begin() + 1);
for(unsigned long i{0}; i < N; ++i)AS[i + 2] = A[i] + AS[i];
for(unsigned long i{1}; i <= (N + 1) / 2; ++i)a[i - 1] = S[N] - S[N - i] + AS[N - i * 2 + 1];
for(unsigned long 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());
auto beg = begin(X), edn = end(X);
for(long long i{0}, x; i < Q; ++i){
ebin.scan(x);
ebout.println(a[lower_bound(beg, edn, x * 2) - beg]);
}
return 0;
} |
p03158 | C++ | #include<bits/stdc++.h>
using namespace std;
int main(){
unsigned long N, Q;
cin >> N >> Q;
vector<unsigned long> A(N), AS(N + 2), S(N + 1), X((N - 1) / 2), a((N + 1) / 2);
for(auto& i : A)cin >> i;
partial_sum(A.begin(), A.end(), S.begin() + 1);
for(unsigned long i{0}; i < N; ++i)AS[i + 2] = A[i] + AS[i];
for(unsigned long i{1}; i <= (N + 1) / 2; ++i)a[i - 1] = S[N] - S[N - i] + AS[N - i * 2 + 1];
for(unsigned long 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());
auto beg = begin(X), edn = end(X);
for(long long i{0}, x; i < Q; ++i){
cin >> x;
cout << a[lower_bound(beg, edn, x * 2) - beg] << endl;
}
return 0;
} |
p03158 | C++ | #include <algorithm>
#include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(X, S, E) for (int(X) = (S); (X) < (E); ++(X))
#define rrep(X, S, E) for (int(X) = (E)-1; (X) >= (S); --(X))
#define arep(X, Y) for (auto(X) : Y)
#define all(X) (X).begin(), (X).end()
#define pb push_back
#define mp make_pair
#define fi first
#define sc second
#define print(x) cout << x << endl
#define printDouble(x) cout << fixed << setprecision(13) << x << endl
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using decendingQueue = priority_queue<ll, vl>; //降順
using ascendingQueue = priority_queue<ll, vl, greater<ll>>; //昇順
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const ll INT_INF = 1e9;
const ll LL_INF = 1e18;
const int mod = 1000000007;
template <class T> void mySort(vector<T> &X, bool isAscending) {
// 昇順
if (isAscending) {
sort(all(X));
} else {
// 降順
sort(all(X), greater<T>());
}
}
long long gcd(long long m, long long n) {
if (m < n)
return gcd(n, m);
if (n == 0)
return m;
return gcd(n, m % n);
}
long long lcm(long long m, long long n) {
// m * nでlong型のオーバフローを発生させないため、先に割り算から行う
return m * (n / gcd(m, n));
}
// auto mod int
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize
// https://youtu.be/8uowVvQ_-Mo?t=1329 : division
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
// combination mod prime
// https://www.youtube.com/watch?v=8uowVvQ_-Mo&feature=youtu.be&t=1619
struct combination {
vector<mint> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
assert(n < mod);
fact[0] = 1;
for (int i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * i;
}
mint operator()(int n, int k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
};
vector<long long> SieveOfEratosthenes(int max) {
vector<long long> sieve;
vector<long long> primes;
for (int i = 1; i < max + 1; ++i) {
sieve.push_back(i);
}
sieve[0] = 0;
for (int i = 2; i < max + 1; ++i) {
if (sieve[i - 1] != 0) {
primes.push_back(sieve[i - 1]);
for (int j = 2 * sieve[i - 1]; j < max + 1; j += sieve[i - 1]) {
sieve[j - 1] = 0;
}
}
}
return primes;
}
class UnionFindTree {
private:
vector<int> par;
vector<int> rnk;
vector<int> siz;
public:
UnionFindTree(int n) {
par.assign(n, -1);
rnk.assign(n, -1);
siz.assign(n, -1);
for (int i = 0; i < n; ++i) {
par[i] = i;
rnk[i] = 0;
siz[i] = 1;
}
}
int find(int x) {
if (par[x] == x)
return x;
else
return par[x] = find(par[x]);
}
bool same(int x, int y) { return find(x) == find(y); }
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y)
return;
if (rnk[x] < rnk[y]) {
par[x] = y;
siz[y] += siz[x];
} else {
par[y] = x;
siz[x] += siz[y];
if (rnk[x] == rnk[y])
++rnk[x];
}
}
int size(int x) {
x = find(x);
return siz[x];
}
};
class Edge {
public:
ll from;
ll to;
ll cost;
Edge() {}
Edge(ll from, ll to, ll cost) {
this->from = from;
this->to = to;
this->cost = cost;
}
bool operator<(const Edge &edge) const {
return cost < edge.cost; //昇順
}
};
class Graph {
public:
ll nodes; // ノード数
vector<Edge> edges;
Graph() {}
Graph(ll nodes) { this->nodes = nodes; }
void addEdge(ll from, ll to, ll cost) {
this->edges.push_back(Edge(from, to, cost));
}
};
// クラスカル法
// 連結グラフの最小全域木を求める
class Kruskal {
private:
Graph graph;
vector<Edge> MinimumSpanningTree;
ll minimumCost;
void searchMinimumSpanningTree() {
UnionFindTree uf(graph.nodes);
sort(all(graph.edges));
for (auto edge : graph.edges) {
if (!uf.same(edge.from, edge.to)) {
uf.unite(edge.from, edge.to);
MinimumSpanningTree.push_back(edge);
}
}
}
public:
Kruskal(Graph graph) { this->graph = graph; }
ll getMinimumSpanningTreeCost() {
searchMinimumSpanningTree();
ll cost = 0;
for (auto tr : MinimumSpanningTree) {
cost += tr.cost;
}
return cost;
}
};
// ダイクストラ法 O((E+V)logV)
// 最小経路問題を解くためのアルゴリズム。辺の重みに負数を含む場合は利用不可
// 無向グラフの場合はコメントアウト箇所をコメントイン
class Dijkstra {
private:
Graph graph;
map<ll, vector<Edge>> fromPaths;
vl distances;
vl srcs;
public:
Dijkstra(Graph graph) {
this->graph = graph;
for (auto edge : graph.edges) {
fromPaths[edge.from].push_back(edge);
// fromPaths[edge->to].push_back(Edge(edge->to, edge->from, edge->cost));
}
}
void searchMinimumPathFrom(ll src) {
// 複数回呼ばれる度に計算する
distances = vl(graph.nodes + 1, LL_INF);
srcs = vl(graph.nodes + 1, LL_INF);
// 距離が近い順番に捜査していく
priority_queue<pll, vector<pll>, greater<pll>> pq;
distances[src] = 0;
srcs[src] = -1;
pq.push(mp(0ll, src));
while (!pq.empty()) {
int u = pq.top().second;
double uw = pq.top().first;
pq.pop();
if (distances[u] < uw) {
continue;
};
for (auto edge : fromPaths[u]) {
int v = edge.to;
ll w = edge.cost;
if (distances[v] > distances[u] + w) {
distances[v] = distances[u] + w;
srcs[v] = u;
pq.push(mp(distances[v], v));
}
}
}
};
ll getDistance(ll n) { return distances[n]; }
ll getFrom(ll n) { return srcs[n]; }
};
// ベルマンフォード O(|V||E|)
// 負コストが含まれていても最短経路問題を解くためのアルゴリズム。閉路の検出も可能
// 有向グラフ
class BellmanFord {
private:
Graph graph;
// 閉路が含まれるかは個々のノードごとに管理する必要あり
vector<bool> hasNegativeCycles;
vector<ll> distances;
vl srcs;
public:
BellmanFord(Graph graph) {
ll nodes = graph.nodes + 1;
this->graph = graph;
distances = vector<ll>(nodes, LL_INF);
hasNegativeCycles = vector<bool>(nodes, false);
}
void searchMinimumPathFrom(ll src) {
distances[src] = 0;
for (ll i = 0; i < graph.nodes - 1; i++) {
for (auto edge : graph.edges) {
ll u = edge.from;
ll v = edge.to;
ll w = edge.cost;
if (distances[u] != LL_INF) {
chmin(distances[v], distances[u] + w);
}
}
}
for (auto edge : graph.edges) {
ll u = edge.from;
ll v = edge.to;
ll w = edge.cost;
if (distances[u] == LL_INF) {
continue;
}
if (distances[u] + w < distances[v]) {
hasNegativeCycles[v] = true;
}
}
for (ll i = 0; i < graph.nodes; i++) {
for (auto edge : graph.edges) {
ll u = edge.from;
ll v = edge.to;
ll w = edge.cost;
if (distances[u] == LL_INF) {
continue;
}
chmin(distances[v], distances[u] + w);
if (hasNegativeCycles[u] == true) {
hasNegativeCycles[v] = true;
}
}
}
}
ll getDistance(ll n) { return distances[n]; }
bool hasNegativeCycle(ll n) { return hasNegativeCycles[n]; }
ll getFrom(ll n) { return srcs[n]; }
};
// O(V^3) 有向グラフ
class WarshallFloyd {
private:
Graph graph;
int nodes = this->graph.nodes + 1;
vector<vector<ll>> distances;
public:
WarshallFloyd(Graph graph) {
this->graph = graph;
nodes = this->graph.nodes + 1;
this->distances = vector<vector<ll>>(nodes, vector<ll>(nodes, LL_INF));
for (auto edge : graph.edges) {
int from = edge.from;
int to = edge.to;
int cost = edge.cost;
distances[from][to] = cost;
}
}
void searchMinimumPath() {
for (int k = 0; k < nodes; k++) {
for (int i = 0; i < nodes; i++) {
for (int j = 0; j < nodes; j++) {
if (distances[i][k] == LL_INF || distances[k][j] == LL_INF) {
continue;
}
if (distances[i][k] + distances[k][j] < distances[i][j]) {
distances[i][j] = distances[i][k] + distances[k][j];
}
}
}
}
}
ll getDistance(int from, int to) { return distances[from][to]; }
};
void solve(long long N, long long Q, std::vector<long long> A,
std::vector<long long> X) {
vl acc(N + 1);
rep(i, 0, N) { acc[i + 1] = A[i] + acc[i]; }
vl div(N);
div[0] = A[0];
div[1] = A[1];
rep(i, 2, N) { div[i] = div[i - 2] + A[i]; }
rep(i, 0, Q) {
int ng = 0;
int ok = N;
while (ok - ng > 1) {
int mid = (ng + ok) / 2;
int t = N - mid;
int a = mid -
(lower_bound(all(A), max(1ll, 2 * X[i] - A[mid])) - A.begin()) +
1;
(t <= a ? ok : ng) = mid;
}
ll ans = acc[N] - acc[ok];
if (N - 2 * (N - ok) - 1 >= 0) {
ans += div[N - 2 * (N - ok) - 1];
}
print(ans);
}
}
int main() {
long long N;
scanf("%lld", &N);
long long Q;
scanf("%lld", &Q);
std::vector<long long> A(N);
for (int i = 0; i < N; i++) {
scanf("%lld", &A[i]);
}
std::vector<long long> X(Q);
for (int i = 0; i < Q; i++) {
scanf("%lld", &X[i]);
}
solve(N, Q, std::move(A), std::move(X));
return 0;
}
|
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
inline void prep ()
{
cin.tie (0);
cin.sync_with_stdio (0);
};
const double pi = acos(-1.);
//printf(%.12lf\n,mid);
// __builtin_popcount(int) count 1's in binary
// get decimal part of number
/*
double intpart;
double thiss = modf((double)(n*m)/(double)k, &intpart);
*/
// round = (int)(num+.5)
long long mod = 1000000007;
// 32 mil = ~1 sec
long long mymod(long long num){
if (num< 0 && !(num%mod == 0)){
if (mod == 1){
return 0;
}
return mod-abs(num)%mod;
}else{
return num%mod;
}
}
/*string sentence = And I feel fine...;
istringstream iss(sentence);
*/
double eps = .000000001;
int main ()
{
prep();
int n, q;
cin >> n >> q;
int arr[n];
long long evens[n] = {0};
long long sum[n] = {0};
for (int i=0; i<n; i++){
cin >> arr[i];
sum[i] = arr[i];
if (i%2== 0){
evens[i] = (i-1 >= 0 ? arr[i]+evens[i-1] : arr[i]);
}else{
evens[i] = evens[i-1];
}
sum[i] = (i-1 >= 0 ? arr[i]+sum[i-1] : arr[i]);
}
for (int i=0; i<q; i++){
int xx;
cin >> xx;
int l = 1;
int r = n/2+n%2;
int lastgood = 0;
while (l <= r){
int mid = (l+r)/2;
int below = -1000000001;
if (n-mid*2-1 >= 0){
below = arr[n-mid*2-1];
}
if (max(xx-below, 0) <= max(arr[n-mid-1]-xx, 0)){
l = mid+1;
}else{
r = mid-1;
lastgood = mid;
}
}
//cout << lastgood << endl;
long long res = sum[n-1]-sum[n-1-lastgood];
if (n%2 == 0 && n-lastgood*2-1 >= 0){
res += sum[n-lastgood*2-1]-evens[n-lastgood*2-1];
}else if (n-lastgood*2-1 >= 0){
res += evens[n-lastgood*2-1];
}
cout << res << '\n';
}
return 0;
}
|
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
inline void prep ()
{
cin.tie (0);
cin.sync_with_stdio (0);
};
const double pi = acos(-1.);
//printf(%.12lf\n,mid);
// __builtin_popcount(int) count 1's in binary
// get decimal part of number
/*
double intpart;
double thiss = modf((double)(n*m)/(double)k, &intpart);
*/
// round = (int)(num+.5)
long long mod = 1000000007;
// 32 mil = ~1 sec
long long mymod(long long num){
if (num< 0 && !(num%mod == 0)){
if (mod == 1){
return 0;
}
return mod-abs(num)%mod;
}else{
return num%mod;
}
}
/*string sentence = And I feel fine...;
istringstream iss(sentence);
*/
double eps = .000000001;
int main ()
{
prep();
int n, q;
cin >> n >> q;
int arr[n];
long long evens[n] = {0};
long long odds[n] = {0};
long long sum[n] = {0};
for (int i=0; i<n; i++){
cin >> arr[i];
sum[i] = arr[i];
if (i%2== 0){
evens[i] = arr[i];
}else{
odds[i] = arr[i];
}
}
for (int i=1; i<n; i++){
sum[i] += sum[i-1];
evens[i] += evens[i-1];
odds[i] += odds[i-1];
}
for (int i=0; i<q; i++){
int xx;
cin >> xx;
int l = 1;
int r = n/2+n%2;
int lastgood = 0;
while (l <= r){
int mid = (l+r)/2;
int bottom = max(0, n-mid*2);
int top = n-mid-1;
int topdiff = max(arr[top]-xx, 0);
int bottomdiff;
if (bottom == 0){
bottomdiff = 2000000001;
}else{
bottomdiff = max(xx-arr[bottom-1], 0);
}
if (bottomdiff <= topdiff){
l = mid+1;
}else{
r = mid-1;
lastgood = mid;
}
}
//cout << lastgood << endl;
long long res = sum[n-1]-sum[n-1-lastgood];
if (n%2 == 0 && n-lastgood*2-1 >= 0){
res += odds[n-lastgood*2-1];
}else if (n-lastgood*2-1 >= 0){
res += evens[n-lastgood*2-1];
}
cout << res << '\n';
}
return 0;
}
|
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
inline void prep ()
{
cin.tie (0);
cin.sync_with_stdio (0);
};
const double pi = acos(-1.);
//printf(%.12lf\n,mid);
// __builtin_popcount(int) count 1's in binary
// get decimal part of number
/*
double intpart;
double thiss = modf((double)(n*m)/(double)k, &intpart);
*/
// round = (int)(num+.5)
long long mod = 1000000007;
// 32 mil = ~1 sec
long long mymod(long long num){
if (num< 0 && !(num%mod == 0)){
if (mod == 1){
return 0;
}
return mod-abs(num)%mod;
}else{
return num%mod;
}
}
/*string sentence = And I feel fine...;
istringstream iss(sentence);
*/
double eps = .000000001;
int main ()
{
prep();
int n, q;
cin >> n >> q;
int arr[n];
long long evens[n] = {0};
long long odds[n] = {0};
long long sum[n] = {0};
for (int i=0; i<n; i++){
cin >> arr[i];
sum[i] = arr[i];
if (i%2== 0){
evens[i] = arr[i];
}else{
odds[i] = arr[i];
}
}
for (int i=1; i<n; i++){
sum[i] += sum[i-1];
evens[i] += evens[i-1];
odds[i] += odds[i-1];
}
vector<pair<int, int> > intervals;
vector<long long> sums;
for (int i=1; i<=n/2+n%2; i++){
int other = i;
// binary search left
int bottom = max(n-i-other, 0);
int top = n-i-1;
int l, r;
int l2, r2;
int lastl = 0;
int lastr = 0;
long long firstel, lastel;
if (bottom == 0){
firstel = -10000000000000;
l = 0;
}else{
firstel = arr[bottom-1];
l = arr[bottom-1]+1;
}
if (i == 1){
lastel = 10000000000000;
r = 1000000001;
}else{
lastel = arr[top+1];
r = arr[top+1]-1;
}
// search for l
while (l <= r){
int mid = (l+r)/2;
int diffbot = max(mid-arr[bottom], 0);
int difftop = max(arr[top]-mid, 0);
long long othertop = lastel-mid;
long long otherbot = mid-firstel;
if (difftop >= otherbot){
l = mid+1;
}else{
lastl = mid;
r = mid-1;
}
}
//cout << lastl << endl;
intervals.push_back({lastl, i-1});
long long tot = sum[n-1]-sum[n-i-1];
if (bottom > 0){
if (n%2 == 0){
tot += odds[bottom-1];
}else{
tot += evens[bottom-1];
}
}
sums.push_back(tot);
}
reverse(intervals.begin(), intervals.end());
for (int i=0; i<q; i++){
int xx;
cin >> xx;
vector<pair<int, int> >::iterator it = upper_bound(intervals.begin(), intervals.end(), make_pair(xx, 1000000001));
it--;
cout << sums[(*it).second] << '\n';
}
return 0;
}
|
p03158 | C++ | #include<bits/stdc++.h>
#define fr(i,n) for(int i=0;i<(n);++i)
#define foor(i,a,b) for(int i=(a);i<=(b);++i)
#define rf(i,n) for(int i=(n);i-->0;)
#define roof(i,b,a) for(int i=(b);i>=(a);--i)
#define elsif else if
#define all(x) x.begin(),x.end()
#define Sort(x) sort(all(x))
#define Reverse(x) reverse(all(x))
#define PQ priority_queue
#define NP(x) next_permutation(all(x))
#define M_PI 3.14159265358979323846
#define popcount __builtin_popcountll
using namespace std; typedef vector<bool> vb; typedef vector<vb> vvb;
typedef vector<int> vi; typedef vector<vi> vvi;
typedef long long ll; typedef vector< ll> vl; typedef vector<vl> vvl;
typedef unsigned long long ull; typedef vector<ull> vu; typedef vector<vu> vvu;
typedef double dbl; typedef vector<dbl> vd; typedef vector<vd> vvd;
typedef string str; typedef vector<str> vs; typedef vector<vs> vvs;
typedef pair<int,int>pii; typedef vector<pii>vpii; typedef map<int,int>mii;
typedef pair< ll, ll>pll; typedef vector<pll>vpll; typedef map< ll, ll>mll;
typedef pair<dbl,dbl>pdd; typedef vector<pdd>vpdd; typedef map<dbl,dbl>mdd;
typedef pair<str,str>pss; typedef vector<pss>vpss; typedef map<str,str>mss;
typedef pair<int, ll>pil; typedef vector<pil>vpil; typedef map<int, ll>mil;
typedef pair< ll,int>pli; typedef vector<pli>vpli; typedef map< ll,int>mli;
typedef pair<dbl,int>pdi; typedef vector<pdi>vpdi; typedef map<dbl,int>mdi;
template<typename T>vector<T>&operator<<(vector<T>&v,const T t){v.push_back(t);return v;}
template<typename T>multiset<T>&operator<<(multiset<T>&m,const T t){m.insert(t);return m;}
template<typename T>set<T>&operator<<(set<T>&s,const T t){s.insert(t);return s;}
template<typename T>stack<T>&operator<<(stack<T>&s,const T t){s.push(t);return s;}
template<typename T>stack<T>&operator>>(stack<T>&s,T&t){t=s.top();s.pop();return s;}
template<typename T>queue<T>&operator<<(queue<T>&q,const T t){q.push(t);return q;}
template<typename T>queue<T>&operator>>(queue<T>&q,T&t){t=q.front();q.pop();return q;}
template<typename T,typename U>PQ<T,vector<T>,U>&operator<<(PQ<T,vector<T>,U>&q,const T t){q.push(t);return q;}
template<typename T,typename U>PQ<T,vector<T>,U>&operator>>(PQ<T,vector<T>,U>&q,T&t){t=q.top();q.pop();return q;}
template<typename T,typename U>istream&operator>>(istream&s,pair<T,U>&p){return s>>p.first>>p.second;}
istream&operator>>(istream&s,_Bit_reference b){int a;s>>a;assert(a==0||a==1);b=a;return s;}
template<typename T>istream&operator>>(istream&s,vector<T>&v){fr(i,v.size()){s>>v[i];}return s;}
template<typename T,typename U>ostream&operator<<(ostream&s,const pair<T,U>p){return s<<p.first<<" "<<p.second;}
//template<typename T>ostream&operator<<(ostream&s,const vector<T>v){for(auto a:v){s<<a<<"\n";}return s;}
template<typename T>ostream&operator<<(ostream&s,const vector<T>v){fr(i,v.size()){i?s<<" "<<v[i]:s<<v[i];}return s;}
template<typename T>ostream&operator<<(ostream&s,const deque<T>d){fr(i,d.size()){i?s<<" "<<d[i]:s<<d[i];}return s;}
template<typename T>_Bit_reference operator&=(_Bit_reference b,T t){return b=b&t;}
template<typename T>_Bit_reference operator^=(_Bit_reference b,T t){return b=b^t;}
template<typename T>_Bit_reference operator|=(_Bit_reference b,T t){return b=b|t;}
template<typename T,typename U>pair<T,U>operator+(pair<T,U>a,pair<T,U>b){return {a.first+b.first,a.second+b.second};}
template<typename T,typename U>pair<T,U>operator-(pair<T,U>a,pair<T,U>b){return {a.first-b.first,a.second-b.second};}
template<typename T,typename U>pair<T,U>&operator+=(pair<T,U>&a,pair<T,U>b){return a=a+b;}
template<typename T,typename U>pair<T,U>&operator-=(pair<T,U>&a,pair<T,U>b){return a=a-b;}
void print(void){cout<<"\n";}
void Print(void){cout<<endl;}
template<typename T>void print(T t){cout<<t<<"\n";}
template<typename T>void Print(T t){cout<<t<<endl;}
template<typename T,typename...U>void print(T&&t,U&&...u){cout<<t<<" ";print(forward<U>(u)...);}
template<typename T,typename...U>void Print(T&&t,U&&...u){cout<<t<<" ";Print(forward<U>(u)...);}
bool YN(bool b){print(b?"YES":"NO");return b;}bool PI(bool b){print(b?"POSSIBLE":"IMPOSSIBLE");return b;}
bool Yn(bool b){print(b?"Yes":"No");return b;}bool Pi(bool b){print(b?"Possible":"Impossible");return b;}
bool yn(bool b){print(b?"yes":"no");return b;}bool pi(bool b){print(b?"possible":"impossible");return b;}
const int e5=1e5;
const int e9=1e9;
const int MD=1e9+7;
const int md=998244353;
const ll e18=1e18;
template<typename T>str to_string(const T&n){ostringstream s;s<<n;return s.str();}
template<typename T>T&chmax(T&a,T b){return a=max(a,b);}
template<typename T>T&chmin(T&a,T b){return a=min(a,b);}
template<typename T,typename U>vector<pair<T,U>>dijkstra(const vector<vector<pair<T,U>>>&E,const U s,const T inf){using P=pair<T,U>;vector<P>d;fr(i,E.size()){d<<P{inf,i};}PQ<P,vector<P>,greater<P>>pq;pq<<(d[s]=P{0,s});while(pq.size()){P a=pq.top();pq.pop();U v=a.second;if(d[v].first>=a.first){for(P e:E[v]){if(d[v].first+e.first<d[e.second].first){d[e.second]=P{d[v].first+e.first,v};pq<<P{d[v].first+e.first,e.second};}}}}return d;}
template<typename T,typename U>map<U,pair<T,U>>dijkstra(map<U,vector<pair<T,U>>>E,const U s,const T inf){using P=pair<T,U>;map<U,P>d;for(pair<U,vector<P>>e:E){d[e.first]=P{inf,e.first};}PQ<P,vector<P>,greater<P>>pq;pq<<(d[s]=P{0,s});while(pq.size()){P a=pq.top();pq.pop();U v=a.second;if(d[v].first>=a.first){for(P e:E[v]){if(d[v].first+e.first<d[e.second].first){d[e.second]=P{d[v].first+e.first,v};pq<<P{d[v].first+e.first,e.second};}}}}return d;}
ll maxflow(vector<mil>&E,int s,int t){ll z=0;vi b(E.size(),-1);for(int i=0;;++i){static auto dfs=[&](int v,ll f,auto&dfs)->ll{if(v==t)return f;b[v]=i;for(auto&p:E[v]){if(b[p.first]<i&&p.second){if(ll r=dfs(p.first,min(f,p.second),dfs)){p.second-=r;E[p.first][v]+=r;return r;}}}return 0;};ll x=dfs(s,ll(1e18),dfs);z+=x;if(x==0)return z;}}
template<typename T>T distsq(pair<T,T>a,pair<T,T>b){return (a.first-b.first)*(a.first-b.first)+(a.second-b.second)*(a.second-b.second);}
template<typename T>T max(const vector<T>a){assert(a.size());T m=a[0];for(T e:a){m=max(m,e);}return m;}
template<typename T>T min(const vector<T>a){assert(a.size());T m=a[0];for(T e:a){m=min(m,e);}return m;}
template<typename T>T gcd(const T a,const T b){return a?gcd(b%a,a):b;}
template<typename T>T gcd(const vector<T>a){T g=a[0];for(T e:a){g=gcd(g,e);}return g;}
template<typename T>vector<T>LCS(vector<T>A,vector<T>B){int N=A.size(),M=B.size();vector<vector<pair<int,pii>>>d(N+1,vector<pair<int,pii>>(M+1));fr(i,N){fr(j,M){if(A[i]==B[j]){d[i+1][j+1]={d[i][j].first+1,{i,j}};}else{d[i+1][j+1]=max(d[i][j+1],d[i+1][j]);}}}vector<T>r;for(pii p={N,M};d[p.first][p.second].first;p=d[p.first][p.second].second){r<<A[d[p.first][p.second].second.first];}Reverse(r);return r;}
str LCS(str S,str T){vector<char>s=LCS(vector<char>(S.begin(),S.end()),vector<char>(T.begin(),T.end()));return str(s.begin(),s.end());}
template<typename T>vector<pair<T,T>>ConvexHull(vector<pair<T,T>>V){if(V.size()<=3){return V;}Sort(V);rf(i,V.size()-1)V<<V[i];vector<pair<T,T>>r;for(pair<T,T>p:V){int s=r.size();while(s>=2&&(p.second-r[s-1].second)*(p.first-r[s-2].first)<(p.second-r[s-2].second)*(p.first-r[s-1].first)){r.pop_back();--s;}r<<p;}r.pop_back();return r;}
class UnionFind{vi p,s;void extend(int N){foor(i,p.size(),N){p<<i;s<<1;}}public:UnionFind(void){}UnionFind(int N){extend(N-1);}int find(int i){extend(i);return p[i]=p[i]==i?i:find(p[i]);}void unite(int a,int b){extend(a);extend(b);if((a=find(a))!=(b=find(b))){if(s[a]>s[b]){swap(a,b);}s[b]+=s[a];p[a]=b;}}void unite(pii p){return unite(p.first,p.second);}bool same(int a,int b){extend(a);extend(b);return find(a)==find(b);}bool same(pii p){return same(p.first,p.second);}int size(int x){extend(x);return s[find(x)];}};
ll MST(vector<pair<ll,pii>>&E){Sort(E);UnionFind uf;ll z=0;for(auto&e:E){if(!uf.same(e.second)){z+=e.first;uf.unite(e.second);}}return z;}
ll strmod(const str&s,const int m){ll x=0;fr(i,s.size()){x=(x*10+s[i]-48)%m;}return x;}
vvl mul(const vvl&A,const vvl&B,const int m){vvl C;fr(y,A.size()){C<<vl(B[y].size());}fr(y,C.size()){fr(x,C[y].size()){fr(i,A[0].size()){(C[y][x]+=A[y][i]*B[i][x])%=m;}}}return C;}
vvl pow(const vvl&A,const ll n,const int m){vvl B;fr(y,A.size()){B<<vl(A.size());}if(n==0){fr(i,B.size()){B[i][i]=1;}}elsif(n%2){B=mul(A,pow(A,n-1,m),m);}else{vvl C=pow(A,n/2,m);B=mul(C,C,m);}return B;}
ll pow(const ll a,const ll n,const int m){ll t;return n?(n&1?a>=0?a%m:(m-(-a%m))%m:1)*(t=pow(a,n>>1,m),t*t%m)%m:!!a;}
ll inv(const ll x,const int p){assert(x!=0);return pow(x,p-2,p);}
ll inv(const ll x){return inv(x,MD);}
vpll fact(const int n,const int p){assert(n<p);vpll v(n+1);v[0].first=1;foor(i,1,n){v[i].first=v[i-1].first*i%p;}v[n].second=inv(v[n].first,p);roof(i,n,1){v[i-1].second=v[i].second*i%p;}return v;}
class Combination{const vpll f;const int M;public:Combination(int n,int m):f(fact(n,m)),M(m){}Combination(int n):Combination(n,MD){}ll P(int n,int k){return n<0||k<0||n<k?0ll:f[n].first*f[n-k].second%M;}ll C(int n,int k){return k<0?0:P(n,k)*f[k].second%M;}ll H(int n,int k){return n==0&&k==0?1ll:C(n+k-1,k);}ll F(int n){return n<0?0:f[n].first;}};
ll C2(const int n){return(ll)n*~-n/2;}
ll sum(const vi a){ll s=0;for(int e:a){s+=e;}return s;}
ll sum(const vl a){ll s=0;for(ll e:a){s+=e;}return s;}
template<typename T>int MSB(T N){int r=-1;for(;N>0;N/=2){++r;}return r;}
template<typename T>class SegmentTree{vector<T>S;T(*const op)(T a,T b);const T zero;const int B;public:SegmentTree(int N,T(*f)(T a,T b),const T zero):S(1<<MSB(N-1)+2,zero),op(f),zero(zero),B(1<<MSB(N-1)+1){}SegmentTree(vector<T>v,T(*f)(T a,T b),const T zero):SegmentTree(v.size(),f,zero){fr(i,v.size()){S[S.size()/2+i]=v[i];}roof(i,S.size()/2-1,1){S[i]=op(S[i*2],S[i*2+1]);}}T calc(int l,int r){l+=B;r+=B;if(l>r){return zero;}if(l==r){return S[l];}T L=S[l],R=S[r];for(;l/2<r/2;l/=2,r/=2){if(l%2==0){L=op(L,S[l+1]);}if(r%2==1){R=op(S[r-1],R);}}return op(L,R);}void replace(int i,T x){for(S[i+=B]=x;i!=1;i/=2){if(i%2){S[i/2]=op(S[i-1],S[i]);}else{S[i/2]=op(S[i],S[i+1]);}}}void add(int i,T x){replace(i,op(S[B+i],x));}T top(){return S[1];}T get(int i){return S[i+B];}};
ll BITsum(vl&B,int i){ll z=0;while(i>0){z+=B[i];i-=i&-i;}return z;}
void BITadd(vl&B,int i,ll x){while(i<B.size()){B[i]+=x;i+=i&-i;}}
ll fib(const ll n,const int m){ll a,b,c,d,A,B,C,D;a=1;b=0;c=0;d=1;rf(i,63){A=a*a+b*c;B=a*b+b*d;C=c*a+d*c;D=c*b+d*d;if(n>>i&1){a=A;b=B;c=C;d=D;A=a+b;B=a;C=c+d;D=c;}a=A%m;b=B%m;c=C%m;d=D%m;}return b;}
vi primes(int n){vb b(n+1);vi p;foor(i,2,n){if(!b[i]){p<<i;for(int j=2*i;j<=n;j+=i){b[j]=true;}}}return p;}
vb isprime(const int n){vb v(n+1,true);v[0]=v[1]=false;foor(i,2,n){if(v[i]){for(int j=2*i;j<=n;j+=i){v[j]=false;}}}return v;}
class LCA{vvi par;vi dep;public:LCA(vvi&E,int root):par(MSB(E.size())+1,vi(E.size())),dep(E.size()){function<void(int,int)>dfs=[&](int i,int p){for(int j:E[i])if(j!=p){par[0][j]=i;dep[j]=dep[i]+1;dfs(j,i);}};par[0][root]=root;dfs(root,root);fr(i,par.size()-1){fr(j,par[0].size()){par[i+1][j]=par[i][par[i][j]];}}}int operator()(int a,int b){if(dep[a]>dep[b])swap(a,b);for(int t=dep[b]-dep[a],i=0;t;t>>=1,++i){if(t&1){b=par[i][b];}}if(a==b)return a;rf(i,par.size()){if(par[i][a]!=par[i][b]){a=par[i][a];b=par[i][b];}}return par[0][a];}};
vpli factor(ll N){vpli r;for(ll i=2;i*i<=N;++i){if(N%i==0){r<<pli{i,0};while(N%i==0){N/=i;++r.back().second;}}}if(N>1){r<<pli{N,1};}return r;}
vl divisors(ll n){vl r;ll m=sqrt(n);foor(i,1,m)if(n%i==0)r<<ll(i);rf(i,r.size()-(m*m==n))r<<n/r[i];return r;}
vi SuffixArray(str S){int N=S.size();vi rank(N+1),tmp(N+1),sa(N+1);fr(i,N){sa[i]=i;rank[i]=S[i];}sa[N]=N;rank[N]=-1;int k;auto cmp=[&](int&a,int&b)->bool{if(rank[a]!=rank[b])return rank[a]<rank[b];return (a+k<=N?rank[a+k]:-1)<(b+k<=N?rank[b+k]:-1);};for(k=1;k<=N;k*=2){sort(all(sa),cmp);tmp[sa[0]]=0;foor(i,1,N){tmp[sa[i]]=tmp[sa[i-1]]+cmp(sa[i-1],sa[i]);}rank=tmp;}return sa;};
int main(){cin.tie(0);ios::sync_with_stdio(false);
int N,Q;cin>>N>>Q;
vi A(N);cin>>A;
vl S(N+1),s(N+1);
fr(i,N){
S[i+1]=S[i]+A[i];
s[i+1]=s[i]+(i%2==N%2?0:A[i]);
}
fr(_,Q){
int X;cin>>X;
int c=lower_bound(all(A),X)-A.begin();
if(c>0&&abs(A[c-1]-X)<=abs(A[c]-X))--c;
if(c==N-1){
print(s[N]);
}else{
int ok=(N-c+1)/2,ng=min(N-c,(N+1)/2+1);
while(ng-ok>1){
int k=ok+ng>>1;
(abs(A[N-2*k+1]-X)<=abs(A[N-k]-X)?ok:ng)=k;
}
print(s[max(0,N-2*ok)]+S[N]-S[N-ok]);
}
}
return 0;
}
|
p03158 | C++ | #include<bits/stdc++.h>
#define fr(i,n) for(int i=0;i<(n);++i)
#define foor(i,a,b) for(int i=(a);i<=(b);++i)
#define rf(i,n) for(int i=(n);i-->0;)
#define roof(i,b,a) for(int i=(b);i>=(a);--i)
#define elsif else if
#define all(x) x.begin(),x.end()
#define Sort(x) sort(all(x))
#define Reverse(x) reverse(all(x))
#define PQ priority_queue
#define NP(x) next_permutation(all(x))
#define M_PI 3.14159265358979323846
#define popcount __builtin_popcountll
using namespace std; typedef vector<bool> vb; typedef vector<vb> vvb;
typedef vector<int> vi; typedef vector<vi> vvi;
typedef long long ll; typedef vector< ll> vl; typedef vector<vl> vvl;
typedef unsigned long long ull; typedef vector<ull> vu; typedef vector<vu> vvu;
typedef double dbl; typedef vector<dbl> vd; typedef vector<vd> vvd;
typedef string str; typedef vector<str> vs; typedef vector<vs> vvs;
typedef pair<int,int>pii; typedef vector<pii>vpii; typedef map<int,int>mii;
typedef pair< ll, ll>pll; typedef vector<pll>vpll; typedef map< ll, ll>mll;
typedef pair<dbl,dbl>pdd; typedef vector<pdd>vpdd; typedef map<dbl,dbl>mdd;
typedef pair<str,str>pss; typedef vector<pss>vpss; typedef map<str,str>mss;
typedef pair<int, ll>pil; typedef vector<pil>vpil; typedef map<int, ll>mil;
typedef pair< ll,int>pli; typedef vector<pli>vpli; typedef map< ll,int>mli;
typedef pair<dbl,int>pdi; typedef vector<pdi>vpdi; typedef map<dbl,int>mdi;
template<typename T>vector<T>&operator<<(vector<T>&v,const T t){v.push_back(t);return v;}
template<typename T>multiset<T>&operator<<(multiset<T>&m,const T t){m.insert(t);return m;}
template<typename T>set<T>&operator<<(set<T>&s,const T t){s.insert(t);return s;}
template<typename T>stack<T>&operator<<(stack<T>&s,const T t){s.push(t);return s;}
template<typename T>stack<T>&operator>>(stack<T>&s,T&t){t=s.top();s.pop();return s;}
template<typename T>queue<T>&operator<<(queue<T>&q,const T t){q.push(t);return q;}
template<typename T>queue<T>&operator>>(queue<T>&q,T&t){t=q.front();q.pop();return q;}
template<typename T,typename U>PQ<T,vector<T>,U>&operator<<(PQ<T,vector<T>,U>&q,const T t){q.push(t);return q;}
template<typename T,typename U>PQ<T,vector<T>,U>&operator>>(PQ<T,vector<T>,U>&q,T&t){t=q.top();q.pop();return q;}
template<typename T,typename U>istream&operator>>(istream&s,pair<T,U>&p){return s>>p.first>>p.second;}
istream&operator>>(istream&s,_Bit_reference b){int a;s>>a;assert(a==0||a==1);b=a;return s;}
template<typename T>istream&operator>>(istream&s,vector<T>&v){fr(i,v.size()){s>>v[i];}return s;}
template<typename T,typename U>ostream&operator<<(ostream&s,const pair<T,U>p){return s<<p.first<<" "<<p.second;}
//template<typename T>ostream&operator<<(ostream&s,const vector<T>v){for(auto a:v){s<<a<<"\n";}return s;}
template<typename T>ostream&operator<<(ostream&s,const vector<T>v){fr(i,v.size()){i?s<<" "<<v[i]:s<<v[i];}return s;}
template<typename T>ostream&operator<<(ostream&s,const deque<T>d){fr(i,d.size()){i?s<<" "<<d[i]:s<<d[i];}return s;}
template<typename T>_Bit_reference operator&=(_Bit_reference b,T t){return b=b&t;}
template<typename T>_Bit_reference operator^=(_Bit_reference b,T t){return b=b^t;}
template<typename T>_Bit_reference operator|=(_Bit_reference b,T t){return b=b|t;}
template<typename T,typename U>pair<T,U>operator+(pair<T,U>a,pair<T,U>b){return {a.first+b.first,a.second+b.second};}
template<typename T,typename U>pair<T,U>operator-(pair<T,U>a,pair<T,U>b){return {a.first-b.first,a.second-b.second};}
template<typename T,typename U>pair<T,U>&operator+=(pair<T,U>&a,pair<T,U>b){return a=a+b;}
template<typename T,typename U>pair<T,U>&operator-=(pair<T,U>&a,pair<T,U>b){return a=a-b;}
void print(void){cout<<"\n";}
void Print(void){cout<<endl;}
template<typename T>void print(T t){cout<<t<<"\n";}
template<typename T>void Print(T t){cout<<t<<endl;}
template<typename T,typename...U>void print(T&&t,U&&...u){cout<<t<<" ";print(forward<U>(u)...);}
template<typename T,typename...U>void Print(T&&t,U&&...u){cout<<t<<" ";Print(forward<U>(u)...);}
bool YN(bool b){print(b?"YES":"NO");return b;}bool PI(bool b){print(b?"POSSIBLE":"IMPOSSIBLE");return b;}
bool Yn(bool b){print(b?"Yes":"No");return b;}bool Pi(bool b){print(b?"Possible":"Impossible");return b;}
bool yn(bool b){print(b?"yes":"no");return b;}bool pi(bool b){print(b?"possible":"impossible");return b;}
const int e5=1e5;
const int e9=1e9;
const int MD=1e9+7;
const int md=998244353;
const ll e18=1e18;
template<typename T>str to_string(const T&n){ostringstream s;s<<n;return s.str();}
template<typename T>T&chmax(T&a,T b){return a=max(a,b);}
template<typename T>T&chmin(T&a,T b){return a=min(a,b);}
template<typename T,typename U>vector<pair<T,U>>dijkstra(const vector<vector<pair<T,U>>>&E,const U s,const T inf){using P=pair<T,U>;vector<P>d;fr(i,E.size()){d<<P{inf,i};}PQ<P,vector<P>,greater<P>>pq;pq<<(d[s]=P{0,s});while(pq.size()){P a=pq.top();pq.pop();U v=a.second;if(d[v].first>=a.first){for(P e:E[v]){if(d[v].first+e.first<d[e.second].first){d[e.second]=P{d[v].first+e.first,v};pq<<P{d[v].first+e.first,e.second};}}}}return d;}
template<typename T,typename U>map<U,pair<T,U>>dijkstra(map<U,vector<pair<T,U>>>E,const U s,const T inf){using P=pair<T,U>;map<U,P>d;for(pair<U,vector<P>>e:E){d[e.first]=P{inf,e.first};}PQ<P,vector<P>,greater<P>>pq;pq<<(d[s]=P{0,s});while(pq.size()){P a=pq.top();pq.pop();U v=a.second;if(d[v].first>=a.first){for(P e:E[v]){if(d[v].first+e.first<d[e.second].first){d[e.second]=P{d[v].first+e.first,v};pq<<P{d[v].first+e.first,e.second};}}}}return d;}
ll maxflow(vector<mil>&E,int s,int t){ll z=0;vi b(E.size(),-1);for(int i=0;;++i){static auto dfs=[&](int v,ll f,auto&dfs)->ll{if(v==t)return f;b[v]=i;for(auto&p:E[v]){if(b[p.first]<i&&p.second){if(ll r=dfs(p.first,min(f,p.second),dfs)){p.second-=r;E[p.first][v]+=r;return r;}}}return 0;};ll x=dfs(s,ll(1e18),dfs);z+=x;if(x==0)return z;}}
template<typename T>T distsq(pair<T,T>a,pair<T,T>b){return (a.first-b.first)*(a.first-b.first)+(a.second-b.second)*(a.second-b.second);}
template<typename T>T max(const vector<T>a){assert(a.size());T m=a[0];for(T e:a){m=max(m,e);}return m;}
template<typename T>T min(const vector<T>a){assert(a.size());T m=a[0];for(T e:a){m=min(m,e);}return m;}
template<typename T>T gcd(const T a,const T b){return a?gcd(b%a,a):b;}
template<typename T>T gcd(const vector<T>a){T g=a[0];for(T e:a){g=gcd(g,e);}return g;}
template<typename T>vector<T>LCS(vector<T>A,vector<T>B){int N=A.size(),M=B.size();vector<vector<pair<int,pii>>>d(N+1,vector<pair<int,pii>>(M+1));fr(i,N){fr(j,M){if(A[i]==B[j]){d[i+1][j+1]={d[i][j].first+1,{i,j}};}else{d[i+1][j+1]=max(d[i][j+1],d[i+1][j]);}}}vector<T>r;for(pii p={N,M};d[p.first][p.second].first;p=d[p.first][p.second].second){r<<A[d[p.first][p.second].second.first];}Reverse(r);return r;}
str LCS(str S,str T){vector<char>s=LCS(vector<char>(S.begin(),S.end()),vector<char>(T.begin(),T.end()));return str(s.begin(),s.end());}
template<typename T>vector<pair<T,T>>ConvexHull(vector<pair<T,T>>V){if(V.size()<=3){return V;}Sort(V);rf(i,V.size()-1)V<<V[i];vector<pair<T,T>>r;for(pair<T,T>p:V){int s=r.size();while(s>=2&&(p.second-r[s-1].second)*(p.first-r[s-2].first)<(p.second-r[s-2].second)*(p.first-r[s-1].first)){r.pop_back();--s;}r<<p;}r.pop_back();return r;}
class UnionFind{vi p,s;void extend(int N){foor(i,p.size(),N){p<<i;s<<1;}}public:UnionFind(void){}UnionFind(int N){extend(N-1);}int find(int i){extend(i);return p[i]=p[i]==i?i:find(p[i]);}void unite(int a,int b){extend(a);extend(b);if((a=find(a))!=(b=find(b))){if(s[a]>s[b]){swap(a,b);}s[b]+=s[a];p[a]=b;}}void unite(pii p){return unite(p.first,p.second);}bool same(int a,int b){extend(a);extend(b);return find(a)==find(b);}bool same(pii p){return same(p.first,p.second);}int size(int x){extend(x);return s[find(x)];}};
ll MST(vector<pair<ll,pii>>&E){Sort(E);UnionFind uf;ll z=0;for(auto&e:E){if(!uf.same(e.second)){z+=e.first;uf.unite(e.second);}}return z;}
ll strmod(const str&s,const int m){ll x=0;fr(i,s.size()){x=(x*10+s[i]-48)%m;}return x;}
vvl mul(const vvl&A,const vvl&B,const int m){vvl C;fr(y,A.size()){C<<vl(B[y].size());}fr(y,C.size()){fr(x,C[y].size()){fr(i,A[0].size()){(C[y][x]+=A[y][i]*B[i][x])%=m;}}}return C;}
vvl pow(const vvl&A,const ll n,const int m){vvl B;fr(y,A.size()){B<<vl(A.size());}if(n==0){fr(i,B.size()){B[i][i]=1;}}elsif(n%2){B=mul(A,pow(A,n-1,m),m);}else{vvl C=pow(A,n/2,m);B=mul(C,C,m);}return B;}
ll pow(const ll a,const ll n,const int m){ll t;return n?(n&1?a>=0?a%m:(m-(-a%m))%m:1)*(t=pow(a,n>>1,m),t*t%m)%m:!!a;}
ll inv(const ll x,const int p){assert(x!=0);return pow(x,p-2,p);}
ll inv(const ll x){return inv(x,MD);}
vpll fact(const int n,const int p){assert(n<p);vpll v(n+1);v[0].first=1;foor(i,1,n){v[i].first=v[i-1].first*i%p;}v[n].second=inv(v[n].first,p);roof(i,n,1){v[i-1].second=v[i].second*i%p;}return v;}
class Combination{const vpll f;const int M;public:Combination(int n,int m):f(fact(n,m)),M(m){}Combination(int n):Combination(n,MD){}ll P(int n,int k){return n<0||k<0||n<k?0ll:f[n].first*f[n-k].second%M;}ll C(int n,int k){return k<0?0:P(n,k)*f[k].second%M;}ll H(int n,int k){return n==0&&k==0?1ll:C(n+k-1,k);}ll F(int n){return n<0?0:f[n].first;}};
ll C2(const int n){return(ll)n*~-n/2;}
ll sum(const vi a){ll s=0;for(int e:a){s+=e;}return s;}
ll sum(const vl a){ll s=0;for(ll e:a){s+=e;}return s;}
template<typename T>int MSB(T N){int r=-1;for(;N>0;N/=2){++r;}return r;}
template<typename T>class SegmentTree{vector<T>S;T(*const op)(T a,T b);const T zero;const int B;public:SegmentTree(int N,T(*f)(T a,T b),const T zero):S(1<<MSB(N-1)+2,zero),op(f),zero(zero),B(1<<MSB(N-1)+1){}SegmentTree(vector<T>v,T(*f)(T a,T b),const T zero):SegmentTree(v.size(),f,zero){fr(i,v.size()){S[S.size()/2+i]=v[i];}roof(i,S.size()/2-1,1){S[i]=op(S[i*2],S[i*2+1]);}}T calc(int l,int r){l+=B;r+=B;if(l>r){return zero;}if(l==r){return S[l];}T L=S[l],R=S[r];for(;l/2<r/2;l/=2,r/=2){if(l%2==0){L=op(L,S[l+1]);}if(r%2==1){R=op(S[r-1],R);}}return op(L,R);}void replace(int i,T x){for(S[i+=B]=x;i!=1;i/=2){if(i%2){S[i/2]=op(S[i-1],S[i]);}else{S[i/2]=op(S[i],S[i+1]);}}}void add(int i,T x){replace(i,op(S[B+i],x));}T top(){return S[1];}T get(int i){return S[i+B];}};
ll BITsum(vl&B,int i){ll z=0;while(i>0){z+=B[i];i-=i&-i;}return z;}
void BITadd(vl&B,int i,ll x){while(i<B.size()){B[i]+=x;i+=i&-i;}}
ll fib(const ll n,const int m){ll a,b,c,d,A,B,C,D;a=1;b=0;c=0;d=1;rf(i,63){A=a*a+b*c;B=a*b+b*d;C=c*a+d*c;D=c*b+d*d;if(n>>i&1){a=A;b=B;c=C;d=D;A=a+b;B=a;C=c+d;D=c;}a=A%m;b=B%m;c=C%m;d=D%m;}return b;}
vi primes(int n){vb b(n+1);vi p;foor(i,2,n){if(!b[i]){p<<i;for(int j=2*i;j<=n;j+=i){b[j]=true;}}}return p;}
vb isprime(const int n){vb v(n+1,true);v[0]=v[1]=false;foor(i,2,n){if(v[i]){for(int j=2*i;j<=n;j+=i){v[j]=false;}}}return v;}
class LCA{vvi par;vi dep;public:LCA(vvi&E,int root):par(MSB(E.size())+1,vi(E.size())),dep(E.size()){function<void(int,int)>dfs=[&](int i,int p){for(int j:E[i])if(j!=p){par[0][j]=i;dep[j]=dep[i]+1;dfs(j,i);}};par[0][root]=root;dfs(root,root);fr(i,par.size()-1){fr(j,par[0].size()){par[i+1][j]=par[i][par[i][j]];}}}int operator()(int a,int b){if(dep[a]>dep[b])swap(a,b);for(int t=dep[b]-dep[a],i=0;t;t>>=1,++i){if(t&1){b=par[i][b];}}if(a==b)return a;rf(i,par.size()){if(par[i][a]!=par[i][b]){a=par[i][a];b=par[i][b];}}return par[0][a];}};
vpli factor(ll N){vpli r;for(ll i=2;i*i<=N;++i){if(N%i==0){r<<pli{i,0};while(N%i==0){N/=i;++r.back().second;}}}if(N>1){r<<pli{N,1};}return r;}
vl divisors(ll n){vl r;ll m=sqrt(n);foor(i,1,m)if(n%i==0)r<<ll(i);rf(i,r.size()-(m*m==n))r<<n/r[i];return r;}
vi SuffixArray(str S){int N=S.size();vi rank(N+1),tmp(N+1),sa(N+1);fr(i,N){sa[i]=i;rank[i]=S[i];}sa[N]=N;rank[N]=-1;int k;auto cmp=[&](int&a,int&b)->bool{if(rank[a]!=rank[b])return rank[a]<rank[b];return (a+k<=N?rank[a+k]:-1)<(b+k<=N?rank[b+k]:-1);};for(k=1;k<=N;k*=2){sort(all(sa),cmp);tmp[sa[0]]=0;foor(i,1,N){tmp[sa[i]]=tmp[sa[i-1]]+cmp(sa[i-1],sa[i]);}rank=tmp;}return sa;};
int main(){cin.tie(0);ios::sync_with_stdio(false);
int N,Q;cin>>N>>Q;
vi A(N);cin>>A;
vl S(N+1),s(N+1);
fr(i,N){
S[i+1]=S[i]+A[i];
s[i+1]=s[i]+(i%2==N%2?0:A[i]);
}
fr(_,Q){
int X;cin>>X;
int c=lower_bound(all(A),X)-A.begin();
if(c>0&&abs(A[c-1]-X)<=abs(A[c]-X))--c;
if(c==N-1){
print(s[N]);
}else{
int ok=(N-c+1)/2,ng=min(N-c,(N+1)/2+1);
while(ng-ok>1){
int k=ok+ng>>1;
assert(k>=2);
(abs(A[N-2*k+1]-X)<=abs(A[N-k]-X)?ok:ng)=k;
}
print(s[max(0,N-2*ok)]+S[N]-S[N-ok]);
}
}
return 0;
}
|
p03158 | C++ | #include<bits/stdc++.h>
#define fr(i,n) for(int i=0;i<(n);++i)
#define foor(i,a,b) for(int i=(a);i<=(b);++i)
#define rf(i,n) for(int i=(n);i-->0;)
#define roof(i,b,a) for(int i=(b);i>=(a);--i)
#define elsif else if
#define all(x) x.begin(),x.end()
#define Sort(x) sort(all(x))
#define Reverse(x) reverse(all(x))
#define PQ priority_queue
#define NP(x) next_permutation(all(x))
#define M_PI 3.14159265358979323846
#define popcount __builtin_popcountll
using namespace std; typedef vector<bool> vb; typedef vector<vb> vvb;
typedef vector<int> vi; typedef vector<vi> vvi;
typedef long long ll; typedef vector< ll> vl; typedef vector<vl> vvl;
typedef unsigned long long ull; typedef vector<ull> vu; typedef vector<vu> vvu;
typedef double dbl; typedef vector<dbl> vd; typedef vector<vd> vvd;
typedef string str; typedef vector<str> vs; typedef vector<vs> vvs;
typedef pair<int,int>pii; typedef vector<pii>vpii; typedef map<int,int>mii;
typedef pair< ll, ll>pll; typedef vector<pll>vpll; typedef map< ll, ll>mll;
typedef pair<dbl,dbl>pdd; typedef vector<pdd>vpdd; typedef map<dbl,dbl>mdd;
typedef pair<str,str>pss; typedef vector<pss>vpss; typedef map<str,str>mss;
typedef pair<int, ll>pil; typedef vector<pil>vpil; typedef map<int, ll>mil;
typedef pair< ll,int>pli; typedef vector<pli>vpli; typedef map< ll,int>mli;
typedef pair<dbl,int>pdi; typedef vector<pdi>vpdi; typedef map<dbl,int>mdi;
template<typename T>vector<T>&operator<<(vector<T>&v,const T t){v.push_back(t);return v;}
template<typename T>multiset<T>&operator<<(multiset<T>&m,const T t){m.insert(t);return m;}
template<typename T>set<T>&operator<<(set<T>&s,const T t){s.insert(t);return s;}
template<typename T>stack<T>&operator<<(stack<T>&s,const T t){s.push(t);return s;}
template<typename T>stack<T>&operator>>(stack<T>&s,T&t){t=s.top();s.pop();return s;}
template<typename T>queue<T>&operator<<(queue<T>&q,const T t){q.push(t);return q;}
template<typename T>queue<T>&operator>>(queue<T>&q,T&t){t=q.front();q.pop();return q;}
template<typename T,typename U>PQ<T,vector<T>,U>&operator<<(PQ<T,vector<T>,U>&q,const T t){q.push(t);return q;}
template<typename T,typename U>PQ<T,vector<T>,U>&operator>>(PQ<T,vector<T>,U>&q,T&t){t=q.top();q.pop();return q;}
template<typename T,typename U>istream&operator>>(istream&s,pair<T,U>&p){return s>>p.first>>p.second;}
istream&operator>>(istream&s,_Bit_reference b){int a;s>>a;assert(a==0||a==1);b=a;return s;}
template<typename T>istream&operator>>(istream&s,vector<T>&v){fr(i,v.size()){s>>v[i];}return s;}
template<typename T,typename U>ostream&operator<<(ostream&s,const pair<T,U>p){return s<<p.first<<" "<<p.second;}
//template<typename T>ostream&operator<<(ostream&s,const vector<T>v){for(auto a:v){s<<a<<"\n";}return s;}
template<typename T>ostream&operator<<(ostream&s,const vector<T>v){fr(i,v.size()){i?s<<" "<<v[i]:s<<v[i];}return s;}
template<typename T>ostream&operator<<(ostream&s,const deque<T>d){fr(i,d.size()){i?s<<" "<<d[i]:s<<d[i];}return s;}
template<typename T>_Bit_reference operator&=(_Bit_reference b,T t){return b=b&t;}
template<typename T>_Bit_reference operator^=(_Bit_reference b,T t){return b=b^t;}
template<typename T>_Bit_reference operator|=(_Bit_reference b,T t){return b=b|t;}
template<typename T,typename U>pair<T,U>operator+(pair<T,U>a,pair<T,U>b){return {a.first+b.first,a.second+b.second};}
template<typename T,typename U>pair<T,U>operator-(pair<T,U>a,pair<T,U>b){return {a.first-b.first,a.second-b.second};}
template<typename T,typename U>pair<T,U>&operator+=(pair<T,U>&a,pair<T,U>b){return a=a+b;}
template<typename T,typename U>pair<T,U>&operator-=(pair<T,U>&a,pair<T,U>b){return a=a-b;}
void print(void){cout<<"\n";}
void Print(void){cout<<endl;}
template<typename T>void print(T t){cout<<t<<"\n";}
template<typename T>void Print(T t){cout<<t<<endl;}
template<typename T,typename...U>void print(T&&t,U&&...u){cout<<t<<" ";print(forward<U>(u)...);}
template<typename T,typename...U>void Print(T&&t,U&&...u){cout<<t<<" ";Print(forward<U>(u)...);}
bool YN(bool b){print(b?"YES":"NO");return b;}bool PI(bool b){print(b?"POSSIBLE":"IMPOSSIBLE");return b;}
bool Yn(bool b){print(b?"Yes":"No");return b;}bool Pi(bool b){print(b?"Possible":"Impossible");return b;}
bool yn(bool b){print(b?"yes":"no");return b;}bool pi(bool b){print(b?"possible":"impossible");return b;}
const int e5=1e5;
const int e9=1e9;
const int MD=1e9+7;
const int md=998244353;
const ll e18=1e18;
template<typename T>str to_string(const T&n){ostringstream s;s<<n;return s.str();}
template<typename T>T&chmax(T&a,T b){return a=max(a,b);}
template<typename T>T&chmin(T&a,T b){return a=min(a,b);}
template<typename T,typename U>vector<pair<T,U>>dijkstra(const vector<vector<pair<T,U>>>&E,const U s,const T inf){using P=pair<T,U>;vector<P>d;fr(i,E.size()){d<<P{inf,i};}PQ<P,vector<P>,greater<P>>pq;pq<<(d[s]=P{0,s});while(pq.size()){P a=pq.top();pq.pop();U v=a.second;if(d[v].first>=a.first){for(P e:E[v]){if(d[v].first+e.first<d[e.second].first){d[e.second]=P{d[v].first+e.first,v};pq<<P{d[v].first+e.first,e.second};}}}}return d;}
template<typename T,typename U>map<U,pair<T,U>>dijkstra(map<U,vector<pair<T,U>>>E,const U s,const T inf){using P=pair<T,U>;map<U,P>d;for(pair<U,vector<P>>e:E){d[e.first]=P{inf,e.first};}PQ<P,vector<P>,greater<P>>pq;pq<<(d[s]=P{0,s});while(pq.size()){P a=pq.top();pq.pop();U v=a.second;if(d[v].first>=a.first){for(P e:E[v]){if(d[v].first+e.first<d[e.second].first){d[e.second]=P{d[v].first+e.first,v};pq<<P{d[v].first+e.first,e.second};}}}}return d;}
ll maxflow(vector<mil>&E,int s,int t){ll z=0;vi b(E.size(),-1);for(int i=0;;++i){static auto dfs=[&](int v,ll f,auto&dfs)->ll{if(v==t)return f;b[v]=i;for(auto&p:E[v]){if(b[p.first]<i&&p.second){if(ll r=dfs(p.first,min(f,p.second),dfs)){p.second-=r;E[p.first][v]+=r;return r;}}}return 0;};ll x=dfs(s,ll(1e18),dfs);z+=x;if(x==0)return z;}}
template<typename T>T distsq(pair<T,T>a,pair<T,T>b){return (a.first-b.first)*(a.first-b.first)+(a.second-b.second)*(a.second-b.second);}
template<typename T>T max(const vector<T>a){assert(a.size());T m=a[0];for(T e:a){m=max(m,e);}return m;}
template<typename T>T min(const vector<T>a){assert(a.size());T m=a[0];for(T e:a){m=min(m,e);}return m;}
template<typename T>T gcd(const T a,const T b){return a?gcd(b%a,a):b;}
template<typename T>T gcd(const vector<T>a){T g=a[0];for(T e:a){g=gcd(g,e);}return g;}
template<typename T>vector<T>LCS(vector<T>A,vector<T>B){int N=A.size(),M=B.size();vector<vector<pair<int,pii>>>d(N+1,vector<pair<int,pii>>(M+1));fr(i,N){fr(j,M){if(A[i]==B[j]){d[i+1][j+1]={d[i][j].first+1,{i,j}};}else{d[i+1][j+1]=max(d[i][j+1],d[i+1][j]);}}}vector<T>r;for(pii p={N,M};d[p.first][p.second].first;p=d[p.first][p.second].second){r<<A[d[p.first][p.second].second.first];}Reverse(r);return r;}
str LCS(str S,str T){vector<char>s=LCS(vector<char>(S.begin(),S.end()),vector<char>(T.begin(),T.end()));return str(s.begin(),s.end());}
template<typename T>vector<pair<T,T>>ConvexHull(vector<pair<T,T>>V){if(V.size()<=3){return V;}Sort(V);rf(i,V.size()-1)V<<V[i];vector<pair<T,T>>r;for(pair<T,T>p:V){int s=r.size();while(s>=2&&(p.second-r[s-1].second)*(p.first-r[s-2].first)<(p.second-r[s-2].second)*(p.first-r[s-1].first)){r.pop_back();--s;}r<<p;}r.pop_back();return r;}
class UnionFind{vi p,s;void extend(int N){foor(i,p.size(),N){p<<i;s<<1;}}public:UnionFind(void){}UnionFind(int N){extend(N-1);}int find(int i){extend(i);return p[i]=p[i]==i?i:find(p[i]);}void unite(int a,int b){extend(a);extend(b);if((a=find(a))!=(b=find(b))){if(s[a]>s[b]){swap(a,b);}s[b]+=s[a];p[a]=b;}}void unite(pii p){return unite(p.first,p.second);}bool same(int a,int b){extend(a);extend(b);return find(a)==find(b);}bool same(pii p){return same(p.first,p.second);}int size(int x){extend(x);return s[find(x)];}};
ll MST(vector<pair<ll,pii>>&E){Sort(E);UnionFind uf;ll z=0;for(auto&e:E){if(!uf.same(e.second)){z+=e.first;uf.unite(e.second);}}return z;}
ll strmod(const str&s,const int m){ll x=0;fr(i,s.size()){x=(x*10+s[i]-48)%m;}return x;}
vvl mul(const vvl&A,const vvl&B,const int m){vvl C;fr(y,A.size()){C<<vl(B[y].size());}fr(y,C.size()){fr(x,C[y].size()){fr(i,A[0].size()){(C[y][x]+=A[y][i]*B[i][x])%=m;}}}return C;}
vvl pow(const vvl&A,const ll n,const int m){vvl B;fr(y,A.size()){B<<vl(A.size());}if(n==0){fr(i,B.size()){B[i][i]=1;}}elsif(n%2){B=mul(A,pow(A,n-1,m),m);}else{vvl C=pow(A,n/2,m);B=mul(C,C,m);}return B;}
ll pow(const ll a,const ll n,const int m){ll t;return n?(n&1?a>=0?a%m:(m-(-a%m))%m:1)*(t=pow(a,n>>1,m),t*t%m)%m:!!a;}
ll inv(const ll x,const int p){assert(x!=0);return pow(x,p-2,p);}
ll inv(const ll x){return inv(x,MD);}
vpll fact(const int n,const int p){assert(n<p);vpll v(n+1);v[0].first=1;foor(i,1,n){v[i].first=v[i-1].first*i%p;}v[n].second=inv(v[n].first,p);roof(i,n,1){v[i-1].second=v[i].second*i%p;}return v;}
class Combination{const vpll f;const int M;public:Combination(int n,int m):f(fact(n,m)),M(m){}Combination(int n):Combination(n,MD){}ll P(int n,int k){return n<0||k<0||n<k?0ll:f[n].first*f[n-k].second%M;}ll C(int n,int k){return k<0?0:P(n,k)*f[k].second%M;}ll H(int n,int k){return n==0&&k==0?1ll:C(n+k-1,k);}ll F(int n){return n<0?0:f[n].first;}};
ll C2(const int n){return(ll)n*~-n/2;}
ll sum(const vi a){ll s=0;for(int e:a){s+=e;}return s;}
ll sum(const vl a){ll s=0;for(ll e:a){s+=e;}return s;}
template<typename T>int MSB(T N){int r=-1;for(;N>0;N/=2){++r;}return r;}
template<typename T>class SegmentTree{vector<T>S;T(*const op)(T a,T b);const T zero;const int B;public:SegmentTree(int N,T(*f)(T a,T b),const T zero):S(1<<MSB(N-1)+2,zero),op(f),zero(zero),B(1<<MSB(N-1)+1){}SegmentTree(vector<T>v,T(*f)(T a,T b),const T zero):SegmentTree(v.size(),f,zero){fr(i,v.size()){S[S.size()/2+i]=v[i];}roof(i,S.size()/2-1,1){S[i]=op(S[i*2],S[i*2+1]);}}T calc(int l,int r){l+=B;r+=B;if(l>r){return zero;}if(l==r){return S[l];}T L=S[l],R=S[r];for(;l/2<r/2;l/=2,r/=2){if(l%2==0){L=op(L,S[l+1]);}if(r%2==1){R=op(S[r-1],R);}}return op(L,R);}void replace(int i,T x){for(S[i+=B]=x;i!=1;i/=2){if(i%2){S[i/2]=op(S[i-1],S[i]);}else{S[i/2]=op(S[i],S[i+1]);}}}void add(int i,T x){replace(i,op(S[B+i],x));}T top(){return S[1];}T get(int i){return S[i+B];}};
ll BITsum(vl&B,int i){ll z=0;while(i>0){z+=B[i];i-=i&-i;}return z;}
void BITadd(vl&B,int i,ll x){while(i<B.size()){B[i]+=x;i+=i&-i;}}
ll fib(const ll n,const int m){ll a,b,c,d,A,B,C,D;a=1;b=0;c=0;d=1;rf(i,63){A=a*a+b*c;B=a*b+b*d;C=c*a+d*c;D=c*b+d*d;if(n>>i&1){a=A;b=B;c=C;d=D;A=a+b;B=a;C=c+d;D=c;}a=A%m;b=B%m;c=C%m;d=D%m;}return b;}
vi primes(int n){vb b(n+1);vi p;foor(i,2,n){if(!b[i]){p<<i;for(int j=2*i;j<=n;j+=i){b[j]=true;}}}return p;}
vb isprime(const int n){vb v(n+1,true);v[0]=v[1]=false;foor(i,2,n){if(v[i]){for(int j=2*i;j<=n;j+=i){v[j]=false;}}}return v;}
class LCA{vvi par;vi dep;public:LCA(vvi&E,int root):par(MSB(E.size())+1,vi(E.size())),dep(E.size()){function<void(int,int)>dfs=[&](int i,int p){for(int j:E[i])if(j!=p){par[0][j]=i;dep[j]=dep[i]+1;dfs(j,i);}};par[0][root]=root;dfs(root,root);fr(i,par.size()-1){fr(j,par[0].size()){par[i+1][j]=par[i][par[i][j]];}}}int operator()(int a,int b){if(dep[a]>dep[b])swap(a,b);for(int t=dep[b]-dep[a],i=0;t;t>>=1,++i){if(t&1){b=par[i][b];}}if(a==b)return a;rf(i,par.size()){if(par[i][a]!=par[i][b]){a=par[i][a];b=par[i][b];}}return par[0][a];}};
vpli factor(ll N){vpli r;for(ll i=2;i*i<=N;++i){if(N%i==0){r<<pli{i,0};while(N%i==0){N/=i;++r.back().second;}}}if(N>1){r<<pli{N,1};}return r;}
vl divisors(ll n){vl r;ll m=sqrt(n);foor(i,1,m)if(n%i==0)r<<ll(i);rf(i,r.size()-(m*m==n))r<<n/r[i];return r;}
vi SuffixArray(str S){int N=S.size();vi rank(N+1),tmp(N+1),sa(N+1);fr(i,N){sa[i]=i;rank[i]=S[i];}sa[N]=N;rank[N]=-1;int k;auto cmp=[&](int&a,int&b)->bool{if(rank[a]!=rank[b])return rank[a]<rank[b];return (a+k<=N?rank[a+k]:-1)<(b+k<=N?rank[b+k]:-1);};for(k=1;k<=N;k*=2){sort(all(sa),cmp);tmp[sa[0]]=0;foor(i,1,N){tmp[sa[i]]=tmp[sa[i-1]]+cmp(sa[i-1],sa[i]);}rank=tmp;}return sa;};
int main(){cin.tie(0);ios::sync_with_stdio(false);
int N,Q;cin>>N>>Q;
vi A(N);cin>>A;
vl S(N+1),s(N+1);
fr(i,N){
S[i+1]=S[i]+A[i];
s[i+1]=s[i]+(i%2==N%2?0:A[i]);
}
fr(_,Q){
int X;cin>>X;
int c=lower_bound(all(A),X)-A.begin();
if(c>0&&abs(A[c-1]-X)<=abs(A[c]-X))--c;
if(c==N-1){
print(s[N]);
}else{
int ok=1,ng=min(N-c,(N+1)/2+1);
while(ng-ok>1){
int k=ok+ng>>1;
assert(k>=2);
if(N-k-c+1>=k){
ok=k;
}else{
(abs(A[N-2*k+1]-X)<=abs(A[N-k]-X)?ok:ng)=k;
}
}
print(s[max(0,N-2*ok)]+S[N]-S[N-ok]);
}
}
return 0;
}
|
p03158 | C++ | #include<bits/stdc++.h>
#define fr(i,n) for(int i=0;i<(n);++i)
#define foor(i,a,b) for(int i=(a);i<=(b);++i)
#define rf(i,n) for(int i=(n);i-->0;)
#define roof(i,b,a) for(int i=(b);i>=(a);--i)
#define elsif else if
#define all(x) x.begin(),x.end()
#define Sort(x) sort(all(x))
#define Reverse(x) reverse(all(x))
#define PQ priority_queue
#define NP(x) next_permutation(all(x))
#define M_PI 3.14159265358979323846
#define popcount __builtin_popcountll
using namespace std; typedef vector<bool> vb; typedef vector<vb> vvb;
typedef vector<int> vi; typedef vector<vi> vvi;
typedef long long ll; typedef vector< ll> vl; typedef vector<vl> vvl;
typedef unsigned long long ull; typedef vector<ull> vu; typedef vector<vu> vvu;
typedef double dbl; typedef vector<dbl> vd; typedef vector<vd> vvd;
typedef string str; typedef vector<str> vs; typedef vector<vs> vvs;
typedef pair<int,int>pii; typedef vector<pii>vpii; typedef map<int,int>mii;
typedef pair< ll, ll>pll; typedef vector<pll>vpll; typedef map< ll, ll>mll;
typedef pair<dbl,dbl>pdd; typedef vector<pdd>vpdd; typedef map<dbl,dbl>mdd;
typedef pair<str,str>pss; typedef vector<pss>vpss; typedef map<str,str>mss;
typedef pair<int, ll>pil; typedef vector<pil>vpil; typedef map<int, ll>mil;
typedef pair< ll,int>pli; typedef vector<pli>vpli; typedef map< ll,int>mli;
typedef pair<dbl,int>pdi; typedef vector<pdi>vpdi; typedef map<dbl,int>mdi;
template<typename T>vector<T>&operator<<(vector<T>&v,const T t){v.push_back(t);return v;}
template<typename T>multiset<T>&operator<<(multiset<T>&m,const T t){m.insert(t);return m;}
template<typename T>set<T>&operator<<(set<T>&s,const T t){s.insert(t);return s;}
template<typename T>stack<T>&operator<<(stack<T>&s,const T t){s.push(t);return s;}
template<typename T>stack<T>&operator>>(stack<T>&s,T&t){t=s.top();s.pop();return s;}
template<typename T>queue<T>&operator<<(queue<T>&q,const T t){q.push(t);return q;}
template<typename T>queue<T>&operator>>(queue<T>&q,T&t){t=q.front();q.pop();return q;}
template<typename T,typename U>PQ<T,vector<T>,U>&operator<<(PQ<T,vector<T>,U>&q,const T t){q.push(t);return q;}
template<typename T,typename U>PQ<T,vector<T>,U>&operator>>(PQ<T,vector<T>,U>&q,T&t){t=q.top();q.pop();return q;}
template<typename T,typename U>istream&operator>>(istream&s,pair<T,U>&p){return s>>p.first>>p.second;}
istream&operator>>(istream&s,_Bit_reference b){int a;s>>a;assert(a==0||a==1);b=a;return s;}
template<typename T>istream&operator>>(istream&s,vector<T>&v){fr(i,v.size()){s>>v[i];}return s;}
template<typename T,typename U>ostream&operator<<(ostream&s,const pair<T,U>p){return s<<p.first<<" "<<p.second;}
//template<typename T>ostream&operator<<(ostream&s,const vector<T>v){for(auto a:v){s<<a<<"\n";}return s;}
template<typename T>ostream&operator<<(ostream&s,const vector<T>v){fr(i,v.size()){i?s<<" "<<v[i]:s<<v[i];}return s;}
template<typename T>ostream&operator<<(ostream&s,const deque<T>d){fr(i,d.size()){i?s<<" "<<d[i]:s<<d[i];}return s;}
template<typename T>_Bit_reference operator&=(_Bit_reference b,T t){return b=b&t;}
template<typename T>_Bit_reference operator^=(_Bit_reference b,T t){return b=b^t;}
template<typename T>_Bit_reference operator|=(_Bit_reference b,T t){return b=b|t;}
template<typename T,typename U>pair<T,U>operator+(pair<T,U>a,pair<T,U>b){return {a.first+b.first,a.second+b.second};}
template<typename T,typename U>pair<T,U>operator-(pair<T,U>a,pair<T,U>b){return {a.first-b.first,a.second-b.second};}
template<typename T,typename U>pair<T,U>&operator+=(pair<T,U>&a,pair<T,U>b){return a=a+b;}
template<typename T,typename U>pair<T,U>&operator-=(pair<T,U>&a,pair<T,U>b){return a=a-b;}
void print(void){cout<<"\n";}
void Print(void){cout<<endl;}
template<typename T>void print(T t){cout<<t<<"\n";}
template<typename T>void Print(T t){cout<<t<<endl;}
template<typename T,typename...U>void print(T&&t,U&&...u){cout<<t<<" ";print(forward<U>(u)...);}
template<typename T,typename...U>void Print(T&&t,U&&...u){cout<<t<<" ";Print(forward<U>(u)...);}
bool YN(bool b){print(b?"YES":"NO");return b;}bool PI(bool b){print(b?"POSSIBLE":"IMPOSSIBLE");return b;}
bool Yn(bool b){print(b?"Yes":"No");return b;}bool Pi(bool b){print(b?"Possible":"Impossible");return b;}
bool yn(bool b){print(b?"yes":"no");return b;}bool pi(bool b){print(b?"possible":"impossible");return b;}
const int e5=1e5;
const int e9=1e9;
const int MD=1e9+7;
const int md=998244353;
const ll e18=1e18;
template<typename T>str to_string(const T&n){ostringstream s;s<<n;return s.str();}
template<typename T>T&chmax(T&a,T b){return a=max(a,b);}
template<typename T>T&chmin(T&a,T b){return a=min(a,b);}
template<typename T,typename U>vector<pair<T,U>>dijkstra(const vector<vector<pair<T,U>>>&E,const U s,const T inf){using P=pair<T,U>;vector<P>d;fr(i,E.size()){d<<P{inf,i};}PQ<P,vector<P>,greater<P>>pq;pq<<(d[s]=P{0,s});while(pq.size()){P a=pq.top();pq.pop();U v=a.second;if(d[v].first>=a.first){for(P e:E[v]){if(d[v].first+e.first<d[e.second].first){d[e.second]=P{d[v].first+e.first,v};pq<<P{d[v].first+e.first,e.second};}}}}return d;}
template<typename T,typename U>map<U,pair<T,U>>dijkstra(map<U,vector<pair<T,U>>>E,const U s,const T inf){using P=pair<T,U>;map<U,P>d;for(pair<U,vector<P>>e:E){d[e.first]=P{inf,e.first};}PQ<P,vector<P>,greater<P>>pq;pq<<(d[s]=P{0,s});while(pq.size()){P a=pq.top();pq.pop();U v=a.second;if(d[v].first>=a.first){for(P e:E[v]){if(d[v].first+e.first<d[e.second].first){d[e.second]=P{d[v].first+e.first,v};pq<<P{d[v].first+e.first,e.second};}}}}return d;}
ll maxflow(vector<mil>&E,int s,int t){ll z=0;vi b(E.size(),-1);for(int i=0;;++i){static auto dfs=[&](int v,ll f,auto&dfs)->ll{if(v==t)return f;b[v]=i;for(auto&p:E[v]){if(b[p.first]<i&&p.second){if(ll r=dfs(p.first,min(f,p.second),dfs)){p.second-=r;E[p.first][v]+=r;return r;}}}return 0;};ll x=dfs(s,ll(1e18),dfs);z+=x;if(x==0)return z;}}
template<typename T>T distsq(pair<T,T>a,pair<T,T>b){return (a.first-b.first)*(a.first-b.first)+(a.second-b.second)*(a.second-b.second);}
template<typename T>T max(const vector<T>a){assert(a.size());T m=a[0];for(T e:a){m=max(m,e);}return m;}
template<typename T>T min(const vector<T>a){assert(a.size());T m=a[0];for(T e:a){m=min(m,e);}return m;}
template<typename T>T gcd(const T a,const T b){return a?gcd(b%a,a):b;}
template<typename T>T gcd(const vector<T>a){T g=a[0];for(T e:a){g=gcd(g,e);}return g;}
template<typename T>vector<T>LCS(vector<T>A,vector<T>B){int N=A.size(),M=B.size();vector<vector<pair<int,pii>>>d(N+1,vector<pair<int,pii>>(M+1));fr(i,N){fr(j,M){if(A[i]==B[j]){d[i+1][j+1]={d[i][j].first+1,{i,j}};}else{d[i+1][j+1]=max(d[i][j+1],d[i+1][j]);}}}vector<T>r;for(pii p={N,M};d[p.first][p.second].first;p=d[p.first][p.second].second){r<<A[d[p.first][p.second].second.first];}Reverse(r);return r;}
str LCS(str S,str T){vector<char>s=LCS(vector<char>(S.begin(),S.end()),vector<char>(T.begin(),T.end()));return str(s.begin(),s.end());}
template<typename T>vector<pair<T,T>>ConvexHull(vector<pair<T,T>>V){if(V.size()<=3){return V;}Sort(V);rf(i,V.size()-1)V<<V[i];vector<pair<T,T>>r;for(pair<T,T>p:V){int s=r.size();while(s>=2&&(p.second-r[s-1].second)*(p.first-r[s-2].first)<(p.second-r[s-2].second)*(p.first-r[s-1].first)){r.pop_back();--s;}r<<p;}r.pop_back();return r;}
class UnionFind{vi p,s;void extend(int N){foor(i,p.size(),N){p<<i;s<<1;}}public:UnionFind(void){}UnionFind(int N){extend(N-1);}int find(int i){extend(i);return p[i]=p[i]==i?i:find(p[i]);}void unite(int a,int b){extend(a);extend(b);if((a=find(a))!=(b=find(b))){if(s[a]>s[b]){swap(a,b);}s[b]+=s[a];p[a]=b;}}void unite(pii p){return unite(p.first,p.second);}bool same(int a,int b){extend(a);extend(b);return find(a)==find(b);}bool same(pii p){return same(p.first,p.second);}int size(int x){extend(x);return s[find(x)];}};
ll MST(vector<pair<ll,pii>>&E){Sort(E);UnionFind uf;ll z=0;for(auto&e:E){if(!uf.same(e.second)){z+=e.first;uf.unite(e.second);}}return z;}
ll strmod(const str&s,const int m){ll x=0;fr(i,s.size()){x=(x*10+s[i]-48)%m;}return x;}
vvl mul(const vvl&A,const vvl&B,const int m){vvl C;fr(y,A.size()){C<<vl(B[y].size());}fr(y,C.size()){fr(x,C[y].size()){fr(i,A[0].size()){(C[y][x]+=A[y][i]*B[i][x])%=m;}}}return C;}
vvl pow(const vvl&A,const ll n,const int m){vvl B;fr(y,A.size()){B<<vl(A.size());}if(n==0){fr(i,B.size()){B[i][i]=1;}}elsif(n%2){B=mul(A,pow(A,n-1,m),m);}else{vvl C=pow(A,n/2,m);B=mul(C,C,m);}return B;}
ll pow(const ll a,const ll n,const int m){ll t;return n?(n&1?a>=0?a%m:(m-(-a%m))%m:1)*(t=pow(a,n>>1,m),t*t%m)%m:!!a;}
ll inv(const ll x,const int p){assert(x!=0);return pow(x,p-2,p);}
ll inv(const ll x){return inv(x,MD);}
vpll fact(const int n,const int p){assert(n<p);vpll v(n+1);v[0].first=1;foor(i,1,n){v[i].first=v[i-1].first*i%p;}v[n].second=inv(v[n].first,p);roof(i,n,1){v[i-1].second=v[i].second*i%p;}return v;}
class Combination{const vpll f;const int M;public:Combination(int n,int m):f(fact(n,m)),M(m){}Combination(int n):Combination(n,MD){}ll P(int n,int k){return n<0||k<0||n<k?0ll:f[n].first*f[n-k].second%M;}ll C(int n,int k){return k<0?0:P(n,k)*f[k].second%M;}ll H(int n,int k){return n==0&&k==0?1ll:C(n+k-1,k);}ll F(int n){return n<0?0:f[n].first;}};
ll C2(const int n){return(ll)n*~-n/2;}
ll sum(const vi a){ll s=0;for(int e:a){s+=e;}return s;}
ll sum(const vl a){ll s=0;for(ll e:a){s+=e;}return s;}
template<typename T>int MSB(T N){int r=-1;for(;N>0;N/=2){++r;}return r;}
template<typename T>class SegmentTree{vector<T>S;T(*const op)(T a,T b);const T zero;const int B;public:SegmentTree(int N,T(*f)(T a,T b),const T zero):S(1<<MSB(N-1)+2,zero),op(f),zero(zero),B(1<<MSB(N-1)+1){}SegmentTree(vector<T>v,T(*f)(T a,T b),const T zero):SegmentTree(v.size(),f,zero){fr(i,v.size()){S[S.size()/2+i]=v[i];}roof(i,S.size()/2-1,1){S[i]=op(S[i*2],S[i*2+1]);}}T calc(int l,int r){l+=B;r+=B;if(l>r){return zero;}if(l==r){return S[l];}T L=S[l],R=S[r];for(;l/2<r/2;l/=2,r/=2){if(l%2==0){L=op(L,S[l+1]);}if(r%2==1){R=op(S[r-1],R);}}return op(L,R);}void replace(int i,T x){for(S[i+=B]=x;i!=1;i/=2){if(i%2){S[i/2]=op(S[i-1],S[i]);}else{S[i/2]=op(S[i],S[i+1]);}}}void add(int i,T x){replace(i,op(S[B+i],x));}T top(){return S[1];}T get(int i){return S[i+B];}};
ll BITsum(vl&B,int i){ll z=0;while(i>0){z+=B[i];i-=i&-i;}return z;}
void BITadd(vl&B,int i,ll x){while(i<B.size()){B[i]+=x;i+=i&-i;}}
ll fib(const ll n,const int m){ll a,b,c,d,A,B,C,D;a=1;b=0;c=0;d=1;rf(i,63){A=a*a+b*c;B=a*b+b*d;C=c*a+d*c;D=c*b+d*d;if(n>>i&1){a=A;b=B;c=C;d=D;A=a+b;B=a;C=c+d;D=c;}a=A%m;b=B%m;c=C%m;d=D%m;}return b;}
vi primes(int n){vb b(n+1);vi p;foor(i,2,n){if(!b[i]){p<<i;for(int j=2*i;j<=n;j+=i){b[j]=true;}}}return p;}
vb isprime(const int n){vb v(n+1,true);v[0]=v[1]=false;foor(i,2,n){if(v[i]){for(int j=2*i;j<=n;j+=i){v[j]=false;}}}return v;}
class LCA{vvi par;vi dep;public:LCA(vvi&E,int root):par(MSB(E.size())+1,vi(E.size())),dep(E.size()){function<void(int,int)>dfs=[&](int i,int p){for(int j:E[i])if(j!=p){par[0][j]=i;dep[j]=dep[i]+1;dfs(j,i);}};par[0][root]=root;dfs(root,root);fr(i,par.size()-1){fr(j,par[0].size()){par[i+1][j]=par[i][par[i][j]];}}}int operator()(int a,int b){if(dep[a]>dep[b])swap(a,b);for(int t=dep[b]-dep[a],i=0;t;t>>=1,++i){if(t&1){b=par[i][b];}}if(a==b)return a;rf(i,par.size()){if(par[i][a]!=par[i][b]){a=par[i][a];b=par[i][b];}}return par[0][a];}};
vpli factor(ll N){vpli r;for(ll i=2;i*i<=N;++i){if(N%i==0){r<<pli{i,0};while(N%i==0){N/=i;++r.back().second;}}}if(N>1){r<<pli{N,1};}return r;}
vl divisors(ll n){vl r;ll m=sqrt(n);foor(i,1,m)if(n%i==0)r<<ll(i);rf(i,r.size()-(m*m==n))r<<n/r[i];return r;}
vi SuffixArray(str S){int N=S.size();vi rank(N+1),tmp(N+1),sa(N+1);fr(i,N){sa[i]=i;rank[i]=S[i];}sa[N]=N;rank[N]=-1;int k;auto cmp=[&](int&a,int&b)->bool{if(rank[a]!=rank[b])return rank[a]<rank[b];return (a+k<=N?rank[a+k]:-1)<(b+k<=N?rank[b+k]:-1);};for(k=1;k<=N;k*=2){sort(all(sa),cmp);tmp[sa[0]]=0;foor(i,1,N){tmp[sa[i]]=tmp[sa[i-1]]+cmp(sa[i-1],sa[i]);}rank=tmp;}return sa;};
int main(){cin.tie(0);ios::sync_with_stdio(false);
int N,Q;cin>>N>>Q;
vi A(N);cin>>A;
vl S(N+1),s(N+1);
fr(i,N){
S[i+1]=S[i]+A[i];
s[i+1]=s[i]+(i%2==N%2?0:A[i]);
}
fr(_,Q){
int X;cin>>X;
int c=lower_bound(all(A),X)-A.begin();
if(c>0&&abs(A[c-1]-X)<=abs(A[c]-X))--c;
if(c==N-1){
print(s[N]);
}else{
int ok=1,ng=N-c;
while(ng-ok>1){
int k=ok+ng>>1;
assert(k>=2);
if(k>(N+1)/2){
ng=k;
}elsif(N-k-c+1>=k){
ok=k;
}else{
(abs(A[N-2*k+1]-X)<=abs(A[N-k]-X)?ok:ng)=k;
}
}
print(s[max(0,N-2*ok)]+S[N]-S[N-ok]);
}
}
return 0;
}
|
p03158 | C++ | #pragma GCC optimize("Ofast")
#include <cstdio>
#include <cstdlib>
#include <string>
#include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
#include <bitset>
#include <cmath>
#include <limits>
#include <iostream>
#include <map>
#include <set>
#include <tuple>
using namespace std;
#define INF 1LL << 61
#define MAX 1LL << 30
#define MOD 1000000007
typedef long long ll;
typedef pair<ll,ll> P;
//typedef pair<pair<int,int>,int> p;
#define bit(n, k) ((n >> k) & 1) /*nのk bit目*/
#define rad_to_deg(rad) (((rad) / 2 / M_PI) * 360)
struct edge{ll to,cost,val;};
template<class T,class U>bool chmin(T&a,const U&b){if(a<=b)return false;a=b;return true;}
template<class T,class U>bool chmax(T&a,const U&b){if(a>=b)return false;a=b;return true;}
//__builtin_popcount(S);
//C.erase(unique(C.begin(),C.end()),C.end());
//#define int ll
int dx[]={1,-1,0,0},dy[]={0,0,-1,1};
vector<ll> A;
int N;
ll X;
bool check(int x){
//cout<<abs(A[N-x+1]-X)<<" "<<abs(A[N-x+1-x+1]-X)<<endl;
if(x==0) return true;
else if(x>(N+1)/2) return false;
if(abs(A[N-x+1]-X)>=abs(A[N-x+1-x+1]-X)) return true;
else return false;
}
signed main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
int Q;
cin>>N>>Q;
A.resize(N+1,0);
for(int i=1;i<=N;i++) cin>>A[i];
vector<ll> T(N+1,0),S(N+1,0);
if(N%2==0){
for(int i=2;i<=N;i++){
if(i%2==0) T[i]=A[i]+T[i-1];
else T[i]=T[i-1];
}
}else{
for(int i=1;i<=N;i++){
if(i%2==1) T[i]=A[i]+T[i-1];
else T[i]=T[i-1];
}
}
for(int i=1;i<=N;i++){
S[i]=S[i-1]+A[i];
}
while(Q--){
cin>>X;
int ng=55000,ok=0;
while(ng-ok!=1){
int mid=(ng+ok)/2;
if(check(mid)) ok=mid;
else ng=mid;
}
//cout<<X<<" "<<ok<<endl;
ll ans=0;
ans=S[N]-S[N-ok];
ans+=T[max(N-2*ok,0)];
cout<<ans<<endl;
}
} |
p03158 | C++ | #include <stdio.h>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <queue>
#include <stack>
#include <cmath>
#include <ctime>
#include <cstdio>
#include <vector>
#include <string>
#include <bitset>
#include <cctype>
#include <cstdlib>
#include <cstring>
#include <utility>
#include <numeric>
#include <complex>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <cassert>
#include <iostream>
#include <iterator>
#include <algorithm>
#include <functional>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef vector<vector<int>> v2int;
typedef vector<ll> vll;
typedef vector<vector<ll>> v2ll;
typedef list<int> liint;
typedef pair<int, int> pint;
const int INF = int(2e9);
const ll LINF = ll(2e9) * ll(2e9);
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for(int i = x; i < n; i++)
template<class T, class C> void chmax(T& a, C b) { a > b ? : a = b; }
template<class T, class C> void chmin(T& a, C b) { a < b ? : a = b; }
//A[N - M]を青木がとれるか
bool is_aoki_get(vll& A, ll x, int N, int M) {
ll y = A[M];
if (A[N - 1] <= x) return false;
if (y < x) return true;
//lower_bound(A.begin(), A.end(), x);
auto it = lower_bound(A.begin(), A.end(), x - abs(x - y));
auto t = distance(A.begin(), it);
if (abs(M - t) + 1 < N - M ) return true;
return false;
}
//aokiがとれる最大位置
int binsearch(vll& A, int N, ll x) {
int l = -1, r = N;
while (r - l > 1) {
int m = (l + r) / 2;
if (is_aoki_get(A, x, N, m) == true)
l = m;
else
r = m;
}
return l;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll N, Q;
cin >> N >> Q;
vll A(N);
rep(i, N) cin >> A[i];
sort(A.begin(), A.end());
vll X(Q);
rep(i, Q) cin >> X[i];
vll S(N + 1);
vll S_even(N + 1);
vll S_odd(N + 1);
rep(i, N) {
S[i + 1] = S[i] + A[i];
if ((i + 1) % 2 == 0) {
S_even[(i + 1) / 2] = S_even[(i + 1) / 2 - 1] + A[i];
}
else {
S_odd[(i + 1) / 2 + 1] = S_odd[(i + 1) / 2] + A[i];
}
}
rep(i, Q) {
int M = binsearch(A, N, X[i]);
ll ans;
if (M < 0) {
if (N % 2 == 0) {
ans = S_even[N / 2];
}
else {
ans = S_odd[N / 2 + 1];
}
}
else {
ans = S[N] - S[M + 1];
int alt_start = max(0LL, M - (N - 1 - M) + 1);
if (alt_start % 2 == 0) {
ans += S_even[alt_start / 2];
}
else {
ans += S_odd[alt_start / 2 + 1];
}
}
cout << ans << endl;
}
return 0;
} |
p03158 | C++ | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<ll, P>IP;
typedef vector<ll> V;
typedef vector<V> V2;
typedef vector<vector<P> > G;
void g_dir(G &graph, ll a, ll b, ll w = 1){graph[a].push_back(P(b, w));}
void g_undir(G &graph, ll a, ll b, ll w = 1){g_dir(graph, a, b, w);g_dir(graph, b, a, w);}
#define rep(i, n) for(ll (i) = 0; (i) < (n); (i)++)
#define rep1(i, n) for(ll (i) = 1; (i) <= (n); (i)++)
#define rrep(i, n) for(ll (i) = (n) - 1; (i) >= 0; (i)--)
#define rrep1(i, n) for(ll (i) = (n); (i) >= 1; (i)--)
template<class T> void chmax(T &a, const T &b){if(a < b){a = b;}}
template<class T> void chmin(T &a, const T &b){if(a > b){a = b;}}
const ll INF = 1145141919;
const ll MOD = 1000000007;
const ll NUM = 101010;
//A以上B以下を数える
class ABCount{
public:
vector<ll>v;
set<pair<ll, ll> >S;
ll makeFlg;
ll Inf;
ABCount(ll inf = 1145141919){
Inf = inf;
makeFlg = 0;
}
void push(ll a){
v.push_back(a);
}
void make(){
makeFlg = 1;
S.clear();
sort(v.begin(), v.end());
for(ll i = 0; i < v.size(); i++){
S.insert(pair<ll, ll>(v[i], i));
}
S.insert(pair<ll,ll>(Inf, v.size()));
}
ll count(ll a, ll b){
if(a > b)return 0;
if(makeFlg == 0)make();
return (*S.upper_bound(pair<ll,ll>(b, Inf))).second - (*S.lower_bound(pair<ll,ll>(a, 0))).second;
}
};
ll a[101010], b[101010], c[101010];
ll wa(ll l, ll r){
if(l > r)return 0;
return b[r] - b[l - 1];
}
ll jump(ll idx){
if(idx <= 0)return 0;
return c[idx];
}
int main(){
ll N, Q;
cin >> N >> Q;
ABCount abc;
rep1(i, N)cin >> a[i];
rep1(i, N)abc.push(a[i]);
rep1(i, N)b[i] = b[i - 1] + a[i];
c[1] = a[1];
for(ll i = 2; i <= N; i++)c[i] = c[i - 2] + a[i];
rep(i, Q){
ll x;
cin >> x;
ll ng = 1, ok = N;
while(ng + 1 < ok){
ll mid = (ng + ok) / 2;
if(a[mid] <= x){
ng = mid;
continue;
}
ll l = x - (a[mid] - x);
ll r = x + (a[mid] - x);
if(abc.count(l, r) < N - mid + 1)ng = mid;
else ok = mid;
}
cout << wa(ok, N) + jump(N - 2 * (N - ok + 1)) << endl;
}
return 0;
} |
p03158 | C++ | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
signed main() {
ios::sync_with_stdio(false); cin.tie(0);
int n, q;
cin >> n >> q;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<long long> sum1(n + 1), sum2(n + 1);
for (int i = 0; i < n; i++) {
sum1[i + 1] = sum1[i] + a[i];
sum2[i + 1] = (i - 1 >= 0 ? sum2[i - 1] : 0LL) + a[i];
}
while (q--) {
long long x;
cin >> x;
int lo = 0, hi = n;
while (hi - lo > 1) {
int mid = (lo + hi) >> 1;
if (n - mid - mid + 1 >= 0 && a[n - mid] - x >= x - a[n - mid - mid + 1]) lo = mid;
else hi = mid;
}
cout << sum1[n] - sum1[n - lo] + (n - lo - lo >= 0 ? sum2[n - lo - lo] : 0LL) << '\n';
}
return 0;
} |
p03158 | C++ | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <utility>
using namespace std;
typedef long long ll;
ll MOD = 1e9+7;
ll a[100000];
ll rui[100001];
ll ruieven[100001];
int main()
{
int n,q;
int ans=0;
cin>>n>>q;
for(int i=0;i<n;i++)
cin>>a[i];
rui[0]=0;ruieven[0]=0;
sort(a,a+n);
for(int i=0;i<n;i++)
{
rui[i+1]=rui[i]+a[i];
ruieven[i+1]=ruieven[i];
if(i&1)
ruieven[i+1]+=a[i];
}
ll x,tak;
for(int i=0;i<q;i++)
{
cin>>x;
//連続で取るゾーンの合計の長さは？
int ok=0;
int ng=n+1;
while(ng-ok>1)
{
int mid=(ok+ng)/2;//青木くんと高橋くんが取る枚数
int rs=mid/2+(mid&1);//高橋くんが取る枚数
int r=n-rs;//高橋くんが取る先頭
int l=n-mid;//青木くんが取る先頭
if((!(mid&1) && abs(a[l+1]-x)>abs(a[r]-x)) || ((mid&1) && abs(a[l]-x)>abs(a[r]-x)))
ng=mid;
else
ok=mid;
}
//cerr<<" "<<ok<<endl;
int rs=ok/2+(ok&1);
int r=n-rs;
int l=n-ok;
tak=rui[n]-rui[r];
if((n-ok)&1)
tak+=rui[l]-ruieven[l];
else
tak+=ruieven[l];
cout<<tak<<endl;
}
return 0;
} |
p03158 | C++ | # include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const double PI = acos(-1);
template<class T>constexpr T INF() { return ::std::numeric_limits<T>::max(); }
template<class T>constexpr T HINF() { return INF<T>() / 2; }
template <typename T_char>T_char TL(T_char cX) { return tolower(cX); };
template <typename T_char>T_char TU(T_char cX) { return toupper(cX); };
const int vy[] = { -1, -1, -1, 0, 1, 1, 1, 0 }, vx[] = { -1, 0, 1, 1, 1, 0, -1, -1 };
const int dx[4] = { 0,1,0,-1 }, dy[4] = { 1,0,-1,0 };
int popcnt(unsigned long long n) { int cnt = 0; for (int i = 0; i < 64; i++)if ((n >> i) & 1)cnt++; return cnt; }
int d_sum(LL n) { int ret = 0; while (n > 0) { ret += n % 10; n /= 10; }return ret; }
int d_cnt(LL n) { int ret = 0; while (n > 0) { ret++; n /= 10; }return ret; }
LL gcd(LL a, LL b) { if (b == 0)return a; return gcd(b, a%b); };
LL lcm(LL a, LL b) { LL g = gcd(a, b); return a / g*b; };
# define ALL(qpqpq) (qpqpq).begin(),(qpqpq).end()
# define UNIQUE(wpwpw) sort(ALL((wpwpw)));(wpwpw).erase(unique(ALL((wpwpw))),(wpwpw).end())
# define LOWER(epepe) transform(ALL((epepe)),(epepe).begin(),TL<char>)
# define UPPER(rprpr) transform(ALL((rprpr)),(rprpr).begin(),TU<char>)
# define FOR(i,tptpt,ypypy) for(LL i=(tptpt);i<(ypypy);i++)
# define REP(i,upupu) FOR(i,0,upupu)
struct INIT{
INIT(){
std::ios::sync_with_stdio(false);
std::cin.tie(0);
cout << fixed << setprecision(13);
}
}INIT;
int n, q;
LL a[101010];
LL rui[101010], rui2[101010];
LL x;
void solve(){
cin >> x;
int l = 0, r = n;
while(r - l > 1){
int mid = (l + r)/2;
int lpos = lower_bound(a, a + n, x - (a[mid] - x)) - a;
int aoki = mid - lpos + 1;
int taka = n - mid - 1;
if(aoki <= taka){
l = mid;
}else{
r = mid;
}
}
LL ans = rui[n] - rui[r];
int len = n - l - 1;
int t_first = n - len*2;
if(t_first > 0)ans += rui2[t_first];
cout << ans << endl;
return;
}
int main(){
cin >> n >> q;
REP(i, n)cin >> a[i];
REP(i, n){
rui[i + 1] = rui[i] + a[i];
}
rui2[1] = a[0];
rui2[2] = a[1];
for(int i = 2;i < n;i++){
rui2[i + 1] += rui2[i - 1];
rui2[i + 1] += a[i];
}
REP(qqq, q)solve();
} |
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
#ifndef ONLINE_JUDGE
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
using bll = boost::multiprecision::cpp_int;
using bdouble = boost::multiprecision::cpp_dec_float_100;
#endif
#ifdef LOCAL_DEV
void debug_impl() { std::cerr << std::endl; }
template<typename Head, typename... Tail> void debug_impl(Head head, Tail... tail) { std::cerr << " " << head << (sizeof...(tail) ? "," : ""); debug_impl(tail...); }
#define debug(...) { std::cerr << std::boolalpha << "(" << #__VA_ARGS__ << ") ="; debug_impl(__VA_ARGS__); std::cerr << std::noboolalpha; }
#else
#define debug(...) {}
#endif
#ifdef LOCAL_TEST
#define BOOST_STACKTRACE_USE_ADDR2LINE
#define BOOST_STACKTRACE_ADDR2LINE_LOCATION /usr/local/opt/binutils/bin/addr2line
#define _GNU_SOURCE
#include <boost/stacktrace.hpp>
template<typename T> class dvector : public std::vector<T> {
public:
dvector() : std::vector<T>() {}
explicit dvector(size_t n, const T& value = T()) : std::vector<T>(n, value) {}
dvector(const std::vector<T>& v) : std::vector<T>(v) {}
dvector(const std::initializer_list<T> il) : std::vector<T>(il) {}
dvector(const typename std::vector<T>::iterator first, const typename std::vector<T>::iterator last) : std::vector<T>(first, last) {}
dvector(const std::string::iterator first, const std::string::iterator last) : std::vector<T>(first, last) {}
T& operator[](size_t n) {
try { return this->at(n); } catch (const std::exception& e) {
std::cerr << boost::stacktrace::stacktrace() << std::endl; return this->at(n);
}
}
const T& operator[](size_t n) const {
try { return this->at(n); } catch (const std::exception& e) {
std::cerr << boost::stacktrace::stacktrace() << std::endl; return this->at(n);
}
}
};
class dbool {
private:
bool boolvalue;
public:
dbool() : boolvalue(false) {}
dbool(bool b) : boolvalue(b) {}
dbool(const dbool &b) : boolvalue(b.boolvalue) {}
operator bool&() { return boolvalue; }
operator const bool&() const { return boolvalue; }
};
template<typename T> std::ostream& operator<<(std::ostream& s, const dvector<T>& v) {
for (int i = 0, len = v.size(); i < len; ++i){ s << v[i]; if (i < len - 1) s << "\t"; } return s; }
template<typename T> std::ostream& operator<<(std::ostream& s, const dvector< dvector<T> >& vv) {
for (int i = 0, len = vv.size(); i < len; ++i){ s << vv[i] << std::endl; } return s; }
template<typename T> std::ostream& operator<<(std::ostream& s, const std::set<T>& se) {
s << "{ "; for (auto itr = se.begin(); itr != se.end(); ++itr){ s << (*itr) << "\t"; } s << "}"; return s; }
template<typename T> std::ostream& operator<<(std::ostream& s, const std::multiset<T>& se) {
s << "{ "; for (auto itr = se.begin(); itr != se.end(); ++itr){ s << (*itr) << "\t"; } s << "}"; return s; }
template<typename T1, typename T2> std::ostream& operator<<(std::ostream& s, const std::map<T1, T2>& m) {
s << "{" << std::endl; for (auto itr = m.begin(); itr != m.end(); ++itr){ s << "\t" << (*itr).first << " : " << (*itr).second << std::endl; } s << "}"; return s; }
template<typename T1, typename T2> std::ostream& operator<<(std::ostream& s, const std::pair<T1, T2>& p) {
return s << "(" << p.first << ", " << p.second << ")"; }
#define vector dvector
#define bool dbool
class SIGFPE_exception : std::exception {};
class SIGSEGV_exception : std::exception {};
void catch_SIGFPE(int e) { std::cerr << boost::stacktrace::stacktrace() << std::endl; throw SIGFPE_exception(); }
void catch_SIGSEGV(int e) { std::cerr << boost::stacktrace::stacktrace() << std::endl; throw SIGSEGV_exception(); }
signed convertedmain();
signed main() { signal(SIGFPE, catch_SIGFPE); signal(SIGSEGV, catch_SIGSEGV); return convertedmain(); }
#define main() convertedmain()
#endif
//#define int long long
using ll = long long;
//constexpr int INF = 1e9;//INT_MAX=(1<<31)-1=2147483647
constexpr ll INF = (ll)1e18;//(1LL<<63)-1=9223372036854775807
constexpr ll MOD = (ll)1e9 + 7;
constexpr double EPS = 1e-9;
constexpr int dx[4] = {1, 0, -1, 0};
constexpr int dy[4] = {0, 1, 0, -1};
constexpr int dx8[8] = {1, 0, -1, 0, 1, 1, -1, -1};
constexpr int dy8[8] = {0, 1, 0, -1, 1, -1, 1, -1};
#define rep(i, n) for(ll i=0, i##_length=(n); i< i##_length; ++i)
#define repeq(i, n) for(ll i=1, i##_length=(n); i<=i##_length; ++i)
#define rrep(i, n) for(ll i=(n)-1; i>=0; --i)
#define rrepeq(i, n) for(ll i=(n) ; i>=1; --i)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
void p() { std::cout << '\n'; }
template<typename Head, typename... Tail> void p(Head head, Tail... tail) { std::cout << head << (sizeof...(tail) ? " " : ""); p(tail...); }
template<typename T> inline void pv(vector<T> &v) { for(ll i=0, N=v.size(); i<N; i++) std::cout << v[i] << " \n"[i==N-1]; }
template<typename T> inline T gcd(T a, T b) { return b ? gcd(b,a%b) : a; }
template<typename T> inline T lcm(T a, T b) { return a / gcd(a, b) * b; }
template<typename T> inline bool chmax(T &a, T b) { return a < b && (a = b, true); }
template<typename T> inline bool chmin(T &a, T b) { return a > b && (a = b, true); }
template<typename T> inline void uniq(vector<T> &v) { v.erase(unique(v.begin(), v.end()), v.end()); }
/*-----8<-----template-----8<-----*/
/*-----8<-----library-----8<-----*/
void solve() {
ll N,Q;
cin>>N>>Q;
vector<ll> A(N,0);
rep(i,N)cin>>A[i];
vector<ll> X(Q,0);
rep(i,Q)cin>>X[i];
vector<ll> kisu(N+1,0),gusu(N+1,0);
vector<ll> rui(N+1, 0), ruicount(N+1,0);
rep(i,N) {
rui[i+1] = rui[i] + A[i];
ruicount[i+1] = rui[i] + 1;
kisu[i+1] = kisu[i] + (i%2==1 ? A[i] : 0);
gusu[i+1] = gusu[i] + (i%2==0 ? A[i] : 0);
}
vector<ll> ans(Q,0);
rep(q,Q){
//最初から交互に取る
if(abs(A[N-1]-X[q]) < abs(A[N-2]-X[q])){
ll t;
if(N%2)t=gusu[N];
else t=kisu[N];
ans[q]=t;
continue;
}
//青木君はX-left<= <=X+leftの範囲のカードを取れる
//初期は left->OK / right->NG になっています
ll left = 0;
ll right = INF;
auto isOK = [&](ll val) -> bool {
auto it1=lower_bound(all(A),X[q]-val);
auto it2=upper_bound(all(A),X[q]+val);
ll aokicount=it2-it1;
if(aokicount>=N)return false;
if(aokicount==0)return true;
ll takahashival=A[N-aokicount];
if(it2==A.end() || *it2>X[q]+left)it2--;
ll aokival=*it2;
if(aokival>=takahashival)return false;
return true;
};
while((ll)abs(right - left) > 1) {
ll mid = left + (right - left) / 2;
if(isOK(mid)) left = mid;
else right = mid;
}
auto it1=lower_bound(all(A),X[q]-left);
auto it2=upper_bound(all(A),X[q]+left);
ll aokicount=it2-it1;
ll takahashicount=A.end()-it2;
if(abs(aokicount-takahashicount)>1){
it1--;
}
ll sum=rui[N]-rui[N-takahashicount];
ll index=it1-A.begin();
if(index>0){
index--;
if(aokicount==takahashicount){
if(index%2)sum+=kisu[index+1];
else sum+=gusu[index+1];
}else{
if(index%2==0)sum+=kisu[index+1];
else sum+=gusu[index+1];
}
}
ans[q]=sum;
}
rep(i,Q)p(ans[i]);
}
signed main() {
solve();
return 0;
}
|
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
#ifndef ONLINE_JUDGE
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
using bll = boost::multiprecision::cpp_int;
using bdouble = boost::multiprecision::cpp_dec_float_100;
#endif
#ifdef LOCAL_DEV
void debug_impl() { std::cerr << std::endl; }
template<typename Head, typename... Tail> void debug_impl(Head head, Tail... tail) { std::cerr << " " << head << (sizeof...(tail) ? "," : ""); debug_impl(tail...); }
#define debug(...) { std::cerr << std::boolalpha << "(" << #__VA_ARGS__ << ") ="; debug_impl(__VA_ARGS__); std::cerr << std::noboolalpha; }
#else
#define debug(...) {}
#endif
#ifdef LOCAL_TEST
#define BOOST_STACKTRACE_USE_ADDR2LINE
#define BOOST_STACKTRACE_ADDR2LINE_LOCATION /usr/local/opt/binutils/bin/addr2line
#define _GNU_SOURCE
#include <boost/stacktrace.hpp>
template<typename T> class dvector : public std::vector<T> {
public:
dvector() : std::vector<T>() {}
explicit dvector(size_t n, const T& value = T()) : std::vector<T>(n, value) {}
dvector(const std::vector<T>& v) : std::vector<T>(v) {}
dvector(const std::initializer_list<T> il) : std::vector<T>(il) {}
dvector(const typename std::vector<T>::iterator first, const typename std::vector<T>::iterator last) : std::vector<T>(first, last) {}
dvector(const std::string::iterator first, const std::string::iterator last) : std::vector<T>(first, last) {}
T& operator[](size_t n) {
try { return this->at(n); } catch (const std::exception& e) {
std::cerr << boost::stacktrace::stacktrace() << std::endl; return this->at(n);
}
}
const T& operator[](size_t n) const {
try { return this->at(n); } catch (const std::exception& e) {
std::cerr << boost::stacktrace::stacktrace() << std::endl; return this->at(n);
}
}
};
class dbool {
private:
bool boolvalue;
public:
dbool() : boolvalue(false) {}
dbool(bool b) : boolvalue(b) {}
dbool(const dbool &b) : boolvalue(b.boolvalue) {}
operator bool&() { return boolvalue; }
operator const bool&() const { return boolvalue; }
};
template<typename T> std::ostream& operator<<(std::ostream& s, const dvector<T>& v) {
for (int i = 0, len = v.size(); i < len; ++i){ s << v[i]; if (i < len - 1) s << "\t"; } return s; }
template<typename T> std::ostream& operator<<(std::ostream& s, const dvector< dvector<T> >& vv) {
for (int i = 0, len = vv.size(); i < len; ++i){ s << vv[i] << std::endl; } return s; }
template<typename T> std::ostream& operator<<(std::ostream& s, const std::set<T>& se) {
s << "{ "; for (auto itr = se.begin(); itr != se.end(); ++itr){ s << (*itr) << "\t"; } s << "}"; return s; }
template<typename T> std::ostream& operator<<(std::ostream& s, const std::multiset<T>& se) {
s << "{ "; for (auto itr = se.begin(); itr != se.end(); ++itr){ s << (*itr) << "\t"; } s << "}"; return s; }
template<typename T1, typename T2> std::ostream& operator<<(std::ostream& s, const std::map<T1, T2>& m) {
s << "{" << std::endl; for (auto itr = m.begin(); itr != m.end(); ++itr){ s << "\t" << (*itr).first << " : " << (*itr).second << std::endl; } s << "}"; return s; }
template<typename T1, typename T2> std::ostream& operator<<(std::ostream& s, const std::pair<T1, T2>& p) {
return s << "(" << p.first << ", " << p.second << ")"; }
#define vector dvector
#define bool dbool
class SIGFPE_exception : std::exception {};
class SIGSEGV_exception : std::exception {};
void catch_SIGFPE(int e) { std::cerr << boost::stacktrace::stacktrace() << std::endl; throw SIGFPE_exception(); }
void catch_SIGSEGV(int e) { std::cerr << boost::stacktrace::stacktrace() << std::endl; throw SIGSEGV_exception(); }
signed convertedmain();
signed main() { signal(SIGFPE, catch_SIGFPE); signal(SIGSEGV, catch_SIGSEGV); return convertedmain(); }
#define main() convertedmain()
#endif
//#define int long long
using ll = long long;
//constexpr int INF = 1e9;//INT_MAX=(1<<31)-1=2147483647
constexpr ll INF = (ll)1e18;//(1LL<<63)-1=9223372036854775807
constexpr ll MOD = (ll)1e9 + 7;
constexpr double EPS = 1e-9;
constexpr int dx[4] = {1, 0, -1, 0};
constexpr int dy[4] = {0, 1, 0, -1};
constexpr int dx8[8] = {1, 0, -1, 0, 1, 1, -1, -1};
constexpr int dy8[8] = {0, 1, 0, -1, 1, -1, 1, -1};
#define rep(i, n) for(ll i=0, i##_length=(n); i< i##_length; ++i)
#define repeq(i, n) for(ll i=1, i##_length=(n); i<=i##_length; ++i)
#define rrep(i, n) for(ll i=(n)-1; i>=0; --i)
#define rrepeq(i, n) for(ll i=(n) ; i>=1; --i)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
void p() { std::cout << '\n'; }
template<typename Head, typename... Tail> void p(Head head, Tail... tail) { std::cout << head << (sizeof...(tail) ? " " : ""); p(tail...); }
template<typename T> inline void pv(vector<T> &v) { for(ll i=0, N=v.size(); i<N; i++) std::cout << v[i] << " \n"[i==N-1]; }
template<typename T> inline T gcd(T a, T b) { return b ? gcd(b,a%b) : a; }
template<typename T> inline T lcm(T a, T b) { return a / gcd(a, b) * b; }
template<typename T> inline bool chmax(T &a, T b) { return a < b && (a = b, true); }
template<typename T> inline bool chmin(T &a, T b) { return a > b && (a = b, true); }
template<typename T> inline void uniq(vector<T> &v) { v.erase(unique(v.begin(), v.end()), v.end()); }
/*-----8<-----template-----8<-----*/
/*-----8<-----library-----8<-----*/
void solve() {
ll N,Q;
cin>>N>>Q;
vector<ll> A(N,0);
rep(i,N)cin>>A[i];
vector<ll> X(Q,0);
rep(i,Q)cin>>X[i];
vector<ll> kisu(N+1,0),gusu(N+1,0);
vector<ll> rui(N+1, 0), ruicount(N+1,0);
rep(i,N) {
rui[i+1] = rui[i] + A[i];
ruicount[i+1] = rui[i] + 1;
kisu[i+1] = kisu[i] + (i%2==1 ? A[i] : 0);
gusu[i+1] = gusu[i] + (i%2==0 ? A[i] : 0);
}
vector<ll> ans(Q,0);
rep(q,Q){
if(abs(A[N-1]-X[q]) < abs(A[N-2]-X[q])){
ll t;
if(N%2)t=gusu[N];
else t=kisu[N];
ans[q]=t;
continue;
}
//auto ita=upper_bound(all(A),X[q]);
//auto itb=prev(ita);
//if(abs(*ita-X[q])==abs(*itb-X[q]))X[q]--;
//debug(X[q]);
//青木君はX-left<= <=X+leftの範囲のカードを取れる
//初期は left->OK / right->NG になっています
ll left = 0;
ll right = INF;
auto isOK = [&](ll val) -> bool {
auto it1=lower_bound(all(A),X[q]-val);
auto it2=upper_bound(all(A),X[q]+val);
ll aokicount=it2-it1;
if(aokicount>=N)return false;
debug(val,aokicount);
if(aokicount==0)return true;
ll takahashival=A[N-aokicount];
if(it2==A.end() || *it2>X[q]+left)it2--;
ll aokival=*it2;
debug(val,aokicount,takahashival,aokival);
if(aokival>=takahashival)return false;
return true;
};
while((ll)abs(right - left) > 1) {
ll mid = left + (right - left) / 2;
if(isOK(mid)) left = mid;
else right = mid;
}
auto it1=lower_bound(all(A),X[q]-left);
auto it2=upper_bound(all(A),X[q]+left);
ll aokicount=it2-it1;
ll takahashicount=A.end()-it2;
if(abs(aokicount-takahashicount)>1){
it1--;
}
ll sum=rui[N]-rui[N-takahashicount];
debug(left,aokicount,takahashicount,sum);
ll index=it1-A.begin();
if(index>0){
index--;
debug(index);
if(aokicount==takahashicount){
if(index%2)sum+=kisu[index+1];
else sum+=gusu[index+1];
}else{
if(index%2==0)sum+=kisu[index+1];
else sum+=gusu[index+1];
}
}
debug(q,sum);
ans[q]=sum;
}
rep(i,Q)p(ans[i]);
}
signed main() {
solve();
return 0;
}
|
p03158 | C++ | #define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <complex>
#include <chrono>
#include <random>
#include <numeric>
#include <queue>
#include <map>
#include <list>
#include <vector>
#include <string>
#include <stack>
#include <limits>
#include <climits>
#include <cassert>
#include <fstream>
#include <cstring>
#include <cmath>
#include <bitset>
#include <iomanip>
#include <algorithm>
#include <functional>
#include <cstdio>
#include <ciso646>
#include <set>
#include <array>
#include <unordered_map>
#include <unordered_set>
#include <type_traits>
using namespace std;
#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 (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define inf 0x3f3f3f3f3f3f3f3f
#define ALL(a) (a).begin(), (a).end()
#define DEBUG(x) // cerr<<#x<<": "<<x<<endl
#define ll long long
#define ull unsigned long long
using pii = pair<ll, ll>;
#define eps 1e-14
#define SETUP cin.tie(0), ios::sync_with_stdio(false), cout << setprecision(15) << std::fixed;
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
template <class T>
using vec2 = std::vector<vector<T>>;
//// bit ////
#ifdef _MSC_VER
#ifdef _WIN32
inline unsigned int __builtin_ctz(unsigned int x) { unsigned long r; _BitScanForward(&r, x); return r; }
inline unsigned int __builtin_clz(unsigned int x) { unsigned long r; _BitScanReverse(&r, x); return 31 - r; }
inline unsigned int __builtin_ffs(unsigned int x) { unsigned long r; return _BitScanForward(&r, x) ? r + 1 : 0; }
// inline unsigned int __builtin_popcount(unsigned int x){ return __popcnt(x); }
#ifdef _WIN64
inline unsigned long long __builtin_ctzll(unsigned long long x) { unsigned long r; _BitScanForward64(&r, x); return r; }
inline unsigned long long __builtin_clzll(unsigned long long x) { unsigned long r; _BitScanReverse64(&r, x); return 63 - r; }
inline unsigned long long __builtin_ffsll(unsigned long long x) { unsigned long r; return _BitScanForward64(&r, x) ? r + 1 : 0; }
inline unsigned long long __builtin_popcountll(unsigned long long x) { return __popcnt64(x); }
#else
inline unsigned int hidword(unsigned long long x) { return static_cast<unsigned int>(x >> 32); }
inline unsigned int lodword(unsigned long long x) { return static_cast<unsigned int>(x & 0xFFFFFFFF); }
inline unsigned long long __builtin_ctzll(unsigned long long x) { return lodword(x) ? __builtin_ctz(lodword(x)) : __builtin_ctz(hidword(x)) + 32; }
inline unsigned long long __builtin_clzll(unsigned long long x) { return hidword(x) ? __builtin_clz(hidword(x)) : __builtin_clz(lodword(x)) + 32; }
inline unsigned long long __builtin_ffsll(unsigned long long x) { return lodword(x) ? __builtin_ffs(lodword(x)) : hidword(x) ? __builtin_ffs(hidword(x)) + 32 : 0; }
// inline unsigned long long __builtin_popcountll(unsigned long long x) { return __builtin_popcount(lodword(x)) + __builtin_popcount(hidword(x)); }
#endif // _WIN64
#endif // _WIN32
#endif // _MSC_VER
namespace
{
struct input_returnner
{
ll N;
input_returnner(ll N_ = 0) : N(N_) {}
template <typename T>
operator vector<T>() const
{
vector<T> res(N);
for (auto& a : res)
cin >> a;
return std::move(res);
}
template <typename T>
operator T() const
{
T res;
cin >> res;
return res;
}
template <typename T>
T operator-(T right) { return T(input_returnner()) - right; }
template <typename T>
T operator+(T right) { return T(input_returnner()) + right; }
template <typename T>
T operator*(T right) { return T(input_returnner()) * right; }
template <typename T>
T operator/(T right) { return T(input_returnner()) / right; }
template <typename T>
T operator<<(T right) { return T(input_returnner()) << right; }
template <typename T>
T operator>>(T right) { return T(input_returnner()) >> right; }
};
template <typename T>
input_returnner in() { return in<T>(); }
input_returnner in() { return input_returnner(); }
input_returnner in(ll N) { return std::move(input_returnner(N)); }
} // namespace
template <typename T>
istream& operator>>(istream& is, vector<T>& vec)
{
for (T& x : vec)
is >> x;
return is;
}
template <typename T>
struct is_vector : std::false_type
{
};
template <typename T>
struct is_vector<std::vector<T>> : std::true_type
{
};
template <typename T>
constexpr bool is_vector_v = is_vector<T>::value;
template <typename T>
std::ostream& operator<<(std::ostream& out, const std::vector<T>& v)
{
if (!v.empty())
{
for (int i = 0; i < v.size(); ++i)
{
out << v[i] << (i == v.size() - 1 ? "\n" : (is_vector_v<T> ? "" : ", "));
}
}
return out;
}
namespace std
{
// ref: https://stackoverflow.com/questions/7110301/generic-hash-for-tuples-in-unordered-map-unordered-set
template <class T>
inline void hash_combine(std::size_t& seed, T const& v)
{
seed ^= std::hash<T>()(v) + 0x9e3779b9 + (seed << 6) + (seed >> 2);
}
// Recursive template code derived from Matthieu M.
template <class Tuple, size_t Index = std::tuple_size<Tuple>::value - 1>
struct HashValueImpl
{
static void apply(size_t& seed, Tuple const& tuple)
{
HashValueImpl<Tuple, Index - 1>::apply(seed, tuple);
hash_combine(seed, std::get<Index>(tuple));
}
};
template <class Tuple>
struct HashValueImpl<Tuple, 0>
{
static void apply(size_t& seed, Tuple const& tuple)
{
hash_combine(seed, std::get<0>(tuple));
}
};
template <typename... TT>
struct hash<std::tuple<TT...>>
{
size_t operator()(std::tuple<TT...> const& tt) const
{
size_t seed = 0;
HashValueImpl<std::tuple<TT...>>::apply(seed, tt);
return seed;
}
};
template <class T, class U>
class hash<std::pair<T, U>>
{
public:
size_t operator()(const std::pair<T, U>& x) const
{
return hash<std::tuple<T, U>>()(std::tie(x.first, x.second));
}
};
} // namespace std
// ref: https://stackoverflow.com/questions/6245735/pretty-print-stdtuple
namespace aux
{
template <std::size_t...>
struct seq
{
};
template <std::size_t N, std::size_t... Is>
struct gen_seq : gen_seq<N - 1, N - 1, Is...>
{
};
template <std::size_t... Is>
struct gen_seq<0, Is...> : seq<Is...>
{
};
template <class Ch, class Tr, class Tuple, std::size_t... Is>
void print_tuple(std::basic_ostream<Ch, Tr>& os, Tuple const& t, seq<Is...>)
{
using swallow = int[];
(void)swallow {
0, (void(os << (Is == 0 ? "" : ", ") << std::get<Is>(t)), 0)...
};
}
} // namespace aux
template <class Ch, class Tr, class... Args>
auto operator<<(std::basic_ostream<Ch, Tr>& os, std::tuple<Args...> const& t)
-> std::basic_ostream<Ch, Tr> &
{
os << "(";
aux::print_tuple(os, t, aux::gen_seq<sizeof...(Args)>());
return os << ")";
}
template <class S, class T>
std::ostream& operator<<(std::ostream& os, const std::pair<S, T>& p)
{
return os << "(" << p.first << ", " << p.second << ")";
}
// ref: https://stackoverflow.com/questions/8542591/c11-reverse-range-based-for-loo�Fp
template <typename T>
struct reversion_wrapper
{
T& iterable;
};
template <typename T>
auto begin(reversion_wrapper<T> w) { return std::rbegin(w.iterable); }
template <typename T>
auto end(reversion_wrapper<T> w) { return std::rend(w.iterable); }
template <typename T>
reversion_wrapper<T> REV(T&& iterable) { return { iterable }; }
template <class T>
bool inside(T left, T val, T right)
{
return left <= val and val < right;
}
template <class T>
T bitCount(T num)
{
T res = 0;
while (num > 0)
{
if (num & 1)
++res;
num >>= 1;
}
return res;
}
ll MOD = 1e9 + 7;
//ll MOD = 998244353;
void solve();
signed main()
{
SETUP;
#ifdef _DEBUG
while (true)
{
#endif
solve();
#ifdef _DEBUG
cout << "-------" << endl;
}
#endif
#ifdef _DEBUG
system("pause");
#endif
return 0;
}
#define int ll
struct mint {
int64_t value;
mint() :value(0) {}
mint(int64_t value_) : value(value_% MOD) {}
inline mint& operator += (const mint& rhs) {
value += rhs.value;
if (value >= MOD) { value -= MOD; }
return *this;
}
inline mint& operator -= (const mint& rhs) {
value -= rhs.value;
if (value < 0) {
value += MOD;
}
return *this;
}
inline mint& operator *= (const mint& rhs) {
value *= rhs.value;
value %= MOD;
return *this;
}
inline mint& operator %= (const mint& rhs) {
return *this;
}
};
// x^n % mod
// O(log n)
mint mod_pow(mint x, uint64_t n) {
mint res = 1;
while (n > 0) {
if (n & 1) res *= x;
x *= x;
n >>= 1;
}
return res;
}
string bin(int x) {
string res = "";
RREP(i, 32) {
res += ((x >> i) & 1) ? "1" : "0";
}
return res;
}
inline mint operator + (const mint& lhs, const mint& rhs) { mint res = lhs; res += rhs; return res; }
inline mint operator - (const mint& lhs, const mint& rhs) { mint res = lhs; res -= rhs; return res; }
inline mint operator * (const mint& lhs, const mint& rhs) { mint res = lhs; res *= rhs; return res; }
inline mint operator % (const mint& lhs, const uint64_t& rhs) { return lhs; }
ostream& operator << (ostream& out, mint n) { return out << n.value; }
class prime {
private:
public:
std::vector<int> primes;
std::vector<bool> isPrime;
prime(int num = 0) {
if (num == 0) return;
isPrime.resize(num + 1);
fill(isPrime.begin(), isPrime.end(), true);
int ma = sqrt(num) + 1;
isPrime[0] = isPrime[1] = false;
int cnt = 0;
for (int i = 2; i <= ma; ++i) if (isPrime[i]) {
for (int j = 2; i * j <= num; ++j) {
isPrime[i * j] = false;
cnt++;
}
}
primes.reserve(cnt);
for (int i = 0; i < isPrime.size(); ++i) if (isPrime[i]) {
primes.push_back(i);
}
}
bool IsPrime(int num) {
if (num < isPrime.size()) return isPrime[num];
for (auto p : primes) {
if (num % p == 0) return false;
}
int ma = sqrt(num) + 1;
for (int i = primes.back(); i <= ma; i += 2) {
if (num % i == 0) return false;
}
return true;
}
std::map<int, int> GetFactor(int num) {
std::map<int, int> res;
int a = 2;
auto it = primes.begin();
while (num >= a * a) {
if (num % a == 0) {
res[a]++;
num /= a;
}
else {
++it;
if (it == primes.end()) {
break;
}
a = *it;
}
}
res[num]++;
return res;
}
};
int gcd(int a, int b) {
return b != 0 ? gcd(b, a % b) : a;
}
int lcm(int a, int b) {
return a * b / gcd(a, b);
}
// a x + b y = gcd(a, b)
int extgcd(int a, int b, int& x, int& y) {
int g = a; x = 1; y = 0;
if (b != 0) g = extgcd(b, a % b, y, x), y -= (a / b) * x;
return g;
}
inline long long mod(long long a, long long m) {
return (a % m + m) % m;
}
// condition: gcd(a,m) == 1
long long modinv(long long a, long long m) {
long long x, y;
extgcd(a, m, x, y);
return mod(x, m);
}
int get_cnt(const vector<int>& A, int X, int right_index) {
if (right_index < 0) return 0;
if (A[right_index] < X) return 0;
if (A[right_index] == X) return 1;
int diff = A[right_index] - X;
int left_index = lower_bound(ALL(A), X - diff) - A.begin();
return right_index - left_index + 1;
}
int solve(const vector<int>& A, int X, const vector<int>& suodd, const vector<int>& su) {
int x_pos = lower_bound(ALL(A), X) - A.begin();
int ok = x_pos - 1;
int ng = A.size();
while (abs(ok - ng) > 1) {
int mid = abs(ok + ng) / 2;
int aok_cnt = get_cnt(A, X, mid);
int tak_cnt = A.size() - mid;
if (aok_cnt < tak_cnt) {
ok = mid;
}
else {
ng = mid;
}
}
int tak_cnt = A.size() - ok - 1;
int temp1 = 0;
if(tak_cnt -1 >= 0) temp1 = su[tak_cnt - 1];
int index = A.size() - tak_cnt * 2 - 1;
int temp2 = 0;
if (index >= 0) temp2 = suodd[index];
return temp1 + temp2;
}
void solve() {
int N, Q; cin >> N >> Q;
vector<int> A(N); for (auto& a : A) cin >> a;
vector<int> suodd = A;
for (int i = 2; i < A.size(); i += 2) {
suodd[i] += suodd[i - 2];
}
for (int i = 3; i < A.size(); i += 2) {
suodd[i] += suodd[i - 2];
}
vector<int> su = A;
RFOR(i, 0, A.size() - 1) su[i] += su[i + 1];
reverse(ALL(su));
REP(i, Q) {
int X; cin >> X;
cout << solve(A, X, suodd, su) << endl;
}
}
|
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
#define int long long
// #define double long double
#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 REP(i, n) for(int i = 0; i < (n); ++i)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOREACH(x, a) for(auto &(x) : (a))
#define VECCIN(x) \
for(auto &youso_ : (x)) cin >> youso_
#define bitcnt(x) __builtin_popcount(x)
#define lbit(x) __builtin_ffsll(x)
#define rbit(x) (64 - __builtin_clzll(x))
#define fi first
#define se second
#define All(a) (a).begin(), (a).end()
#define rAll(a) (a).rbegin(), (a).rend()
#define cinfast() cin.tie(0), ios::sync_with_stdio(false)
#define PERM(c) \
sort(All(c)); \
for(bool cp = true; cp; cp = next_permutation(All(c)))
#define MKORDER(n) \
vector<int> od(n); \
iota(All(od), 0LL);
template <typename T = long long> inline T IN() {
T x;
cin >> x;
return (x);
}
inline void CIN() {}
template <class Head, class... Tail>
inline void CIN(Head &&head, Tail &&... tail) {
cin >> head;
CIN(move(tail)...);
}
template <class Head> inline void COUT(Head &&head) { cout << head << "\n"; }
template <class Head, class... Tail>
inline void COUT(Head &&head, Tail &&... tail) {
cout << head << " ";
COUT(forward<Tail>(tail)...);
}
#define CCIN(...) \
char __VA_ARGS__; \
CIN(__VA_ARGS__)
#define DCIN(...) \
double __VA_ARGS__; \
CIN(__VA_ARGS__)
#define LCIN(...) \
long long __VA_ARGS__; \
CIN(__VA_ARGS__)
#define SCIN(...) \
string __VA_ARGS__; \
CIN(__VA_ARGS__)
#define Printv(v) \
{ \
FOREACH(x, v) { cout << x << " "; } \
cout << "\n"; \
}
template <typename T = string> inline void eputs(T s) {
cout << s << "\n";
exit(0);
}
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
// generic lambdas
template <typename F>
#if defined(__has_cpp_attribute) && __has_cpp_attribute(nodiscard)
[[nodiscard]]
#elif defined(__GNUC__) && \
(__GNUC__ > 3 || __GNUC__ == 3 && __GNUC_MINOR__ >= 4)
__attribute__((warn_unused_result))
#endif // defined(__has_cpp_attribute) && __has_cpp_attribute(nodiscard)
static inline constexpr decltype(auto)
fix(F &&f) noexcept {
return [f = std::forward<F>(f)](auto &&... args) {
return f(f, std::forward<decltype(args)>(args)...);
};
}
template <typename T> using PQG = priority_queue<T, vector<T>, greater<T>>;
template <typename T> using PQ = priority_queue<T>;
typedef long long ll;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<ll, ll> PL;
typedef vector<PL> VPL;
typedef vector<bool> VB;
typedef vector<double> VD;
typedef vector<string> VS;
const int INF = 1e9;
const int MOD = 1e9 + 7;
// const int MOD = 998244353;
const ll LINF = 1e18;
const ll dw[] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll dh[] = {0, 1, 1, 1, 0, -1, -1, -1};
#define PI 3.141592653589793238
signed main() {
cinfast();
LCIN(N, Q);
VL A(N);
VECCIN(A);
reverse(All(A));
VL even(N + 1), sum(N + 1);
REP(i, N) {
sum[i + 1] += sum[i] + A[i];
even[i + 1] += even[i] + (i % 2 ? 0 : A[i]);
}
VL bo;
REP(i, (N - 1) / 2) { bo.emplace_back((A[i + 1] + A[2 * i + 2]) / 2 + 1); }
REP(i, Q) {
LCIN(X);
ll idx = bo.rend() - upper_bound(rAll(bo), X);
ll ans = sum[idx + 1];
if(2 * idx + 2 < N) ans += even[N] - even[2 * idx + 2];
cout << ans << "\n";
}
} |
p03158 | C++ | #include <vector>
#include <map>
#include <set>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <queue>
#include <iomanip>
#include <list>
#include <string>
typedef char SINT8;
typedef short SINT16;
typedef int SINT32;
typedef long long SINT64;
typedef double DOUBLE;
#define MAX(a,b) ((a)>(b)?(a):(b))
#define MIN(a,b) ((a)<(b)?(a):(b))
#define ABS(a) ((a)>(0)?(a):-(a))
#define rep(i,a,b) for(SINT64 (i)=SINT64(a);(i)<SINT64(b);(i)++)
#define rrep(i,a,b) for(SINT64 (i)=SINT64(a);(i)>=SINT64(b);(i)--)
#define put(a) cout << (a) << endl
#define puts(a) cout << (a) << " "
#define INF 1000000001
#define MOD 1000000007
#define INF64 1000000000000000001
#define F first
#define S second
#define Pii pair<SINT32,SINT32>
#define Pll pair<SINT64,SINT64>
#define Piii pair<SINT32,pair<SINT32,SINT32>>
#define Plll pair<SINT64,pair<SINT64,SINT64>>
#define Vll(a,b,c) vector<vector<SINT64>> (a)((b),vector<SINT64>((c))
#define Vlll(a,b,c,d) vector<vector<vector<SINT64>>> (a)((b),vector<vector<SINT64>>((c),vector<SINT64>((d)))
using namespace std;
SINT64 N;
vector<SINT64> data;
SINT64 ok (SINT64 x,SINT64 cnt) {
if (cnt == 1) {
return 1;
}
if (cnt*2 == N+1) {
if (ABS(data[N-cnt] - x) >= ABS(data[0] - x)) {
return 1;
} else {
return 0;
}
}
if (cnt*2 > N) {
return 0;
}
if (ABS(data[N-cnt] - x) >= ABS(data[N-(cnt*2)+1] - x)) {
return 1;
}
return 0;
}
int main() {
cin >> N;
SINT64 M; cin >> M;
data.resize(N);
vector<SINT64> rui(N+1);
vector<SINT64> ruig(N+1);
vector<SINT64> ruik(N+1);
rep(i,0,N) {
cin >> data[i];
}
rep(i,0,N) {
rui[i+1] = rui[i]+data[i];
if ((i % 2) == 1) {
ruik[i+1] = ruik[i]+data[i];
ruig[i+1] = ruig[i];
} else {
ruik[i+1] = ruik[i];
ruig[i+1] = ruig[i]+data[i];
}
}
rep(i,0,M) {
SINT64 a;
cin >> a;
SINT64 l = 1;
SINT64 r = N+1;
SINT64 mid;
while(1) {
mid = (r-l)/2 + l;
if (ok(a,mid) == 0) {
r = mid;
} else {
l = mid;
}
if ((r-l) <= 1) {
break;
}
}
SINT64 ans = 0;
if (l*2 <= N) {
if ((N%2) == 1) {
ans += ruig[N-l-l];
} else {
ans += ruik[N-l-l];
}
}
ans += rui[N]-rui[N-l];
put(ans);
}
return 0;
}
// vector<vector<SINT64>> data(N,vector<SINT64>(N)); //2次元配列
// vector<vector<vector<SINT64>>> data(N,vector<vector<SINT64>>(N,vector<SINT64>(N))); //3次元配列
// Vll(data,N,N); //2次元配列
// Vlll(data,N,N,N); //3次元配列
// sort(data.begin(),data.end());
// sort(data.begin(),data.end(),std::greater<SINT64>());
// __gcd(A,B);
// reverse(data.begin(),data.end());
//関数へのvectorポインタ渡し
//void dfs(SINT64 poi, SINT64 d, vector<vector<Pll>>& data) {
//}
/* 複数条件ソート
bool sortcompare(Pll A, Pll B) {
if(A.F == B.F){
return A.S > B.S;
} else {
return A.F < B.F;
}
}
sort(data.begin(),data.end(),sortcompare);
*/
// タプル
//vector<tuple<SINT64,SINT64,SINT64>> edges;
//edges.emplace_back(a,b,c);
//cout << get<0>(edges[i]);
//cout << get<1>(edges[i]);
//cout << get<2>(edges[i]);
//sort(begin(edges), end(edges)); //ソート
// data.emplace_back(BUF); //後ろに追加
// data.erase(std::unique(data.begin(), data.end()), data.end()); //ソート後に使用 同じ値を消す
// data.insert(data.begin() + X, 0); //X番目の要素に0を挿入
// 隣接リスト
// vector<vector<SINT64>> data(N);
// data[ A ].emplace_back( B );
// 両端キュー
//deque<SINT64> data;
//data.emplace_front(buf); //先頭挿入
// lower_boundは値がなければ最大値(.size())を返す
// posi = lower_bound(data.begin(),data.end(), X) - data.begin(); // X以上を探す
// posi = lower_bound(data.begin(),data.end(),make_pair(X,0)) - data.begin(); //pair
/* 文字列回転
string N;
cin >> N;
N = N[N.length()-1] + N.substr(0,N.length()-1);
s = to_string(i); //ストリング変換
*/
/* 文字列合成
string N,M;
cin >> N >> M;
SINT64 ans = 0;
ans = stoi(N+M);
*/
/* 文字列変更
string s; cin >> s;
rep(i,0,s.length()) {
s[i] = (((s[i]-'A' + N) % 26) + 'A');
}
put(s);
*/
/*
//ワーシャルフロイド
vector<vector<SINT64>> dist(N,vector<SINT64>(N,INF64));
rep(i,0,N) {
dist[i][i] = 0;
}
rep(k,0,N) {
rep(i,0,N) {
rep(j,0,N) {
dist[i][j] = MIN(dist[i][j], dist[i][k]+dist[k][j]);
}
}
}
*/
/* 優先度付きキュー
priority_queue<SINT64, vector<SINT64>, greater<SINT64>> bufq; //小さいほうから取り出せる
priority_queue<SINT64, vector<SINT64>> bufq; //大きいほうから取り出せる
bufq.push(X); //X を挿入
bufq.top(); //先頭データ読み
bufq.pop(); //先頭データ削除
*/
/* キュー
queue<SINT64> bufq; //宣言
bufq.push(0); //挿入
bufq.front(); //先頭データ読み
bufq.pop(); //先頭データ削除
*/
/* SET コンテナ
set<SINT64> data;
data.insert(X); //X を挿入
data.erase(data.begin()); //先頭を削除
data.erase(--data.end()); //末尾を削除
*data.begin(); //先頭要素にアクセス
*data.rbegin(); //末尾要素にアクセス
//全表示
set<SINT64>::iterator it; //イテレータを用意
for(it = data.begin(); it != data.end(); it++) {
cout << *it << " ";
}
cout << endl;
//N番目を一部表示
set<SINT64>::iterator it; // イテレータを用意
it = data.begin();
rep (i,0,N) {
it++;
}
cout << *it << endl;
*/
/* map
map<string,SINT32> mp;
SINT32 N = 0;
SINT32 mx = 0;
cin >> N;
for (SINT32 i = 0; i < N; i++) {
string s;
cin >> s;
mp[s]++;
}
for(auto it=mp.begin();it!=mp.end();it++) {
mx=max(mx,it->second);
}
//abc146E
map<SINT64,SINT64> mp;
rep(i,0,N+1) {
ans += mp[rui[i]];
mp[rui[i]]++;
bufq.push(rui[i]);
if (bufq.size() == M) {
mp[bufq.front()]--;
bufq.pop();
}
}
*/
/*
//順列全表示
//sortしてからでないと全列挙にならない
sort(data.begin(),data.end());
do {
cout << buf << endl;
rep(i,0,R) {
cout << data[i] << " ";
}
cout << endl;
} while (next_permutation(data.begin(),data.end()));
*/
/* bit数数え上げ
SINT64 bits64(SINT64 bits)
{
bits = (bits & 0x55555555) + (bits >> 1 & 0x55555555);
bits = (bits & 0x33333333) + (bits >> 2 & 0x33333333);
bits = (bits & 0x0f0f0f0f) + (bits >> 4 & 0x0f0f0f0f);
bits = (bits & 0x00ff00ff) + (bits >> 8 & 0x00ff00ff);
return (bits & 0x0000ffff) + (bits >>16 & 0x0000ffff);
}
*/
//bitシフトのLONG対応
// ans += (1L<<50);
// 桁指定表示
// ans = ans * M_PI;
// cout << setprecision(15) << ans << endl;
// 桁数0埋め
// cout << std::setfill('0') << std::right << std::setw(2) << 5; //05
//2次元累積和
/*
vector<vector<SINT64>> data(H,vector<SINT64>(W));
vector<vector<SINT64>> rui(H+1,vector<SINT64>(W+1));
rep(i,0,H) {
rep(j,0,W) {
cin >> data[i][j];
}
}
rep(i,1,H+1) {
rep(j,1,W+1) {
rui[i][j] = data[i-1][j-1] + rui[i][j-1];
}
}
rep(i,1,H+1) {
rep(j,1,W+1) {
rui[i][j] += rui[i-1][j];
}
}
*/
// 逆元 コンビネーション
/*
SINT64 modpow(SINT64 a, SINT64 p) {
if (p == 0) return 1;
if (p % 2 == 0) {
//pが偶数の時
SINT64 halfP = p / 2;
SINT64 half = modpow(a, halfP);
//a^(p/2) をhalfとして、half*halfを計算
return half * half % MOD;
} else {
//pが奇数の時は、偶数にするために1減らす
return a * modpow(a, p - 1) % MOD;
}
}
SINT64 calcComb(SINT64 a, SINT64 b) {
SINT64 Mul = 1;
SINT64 Div = 1;
SINT64 ans = 0;
if (b > a - b) {
return calcComb(a, a - b);
}
rep(i,0,b) {
Mul *= (a - i);
Div *= (i + 1);
Mul %= MOD;
Div %= MOD;
}
ans = Mul * modpow(Div, MOD - 2) % MOD;
return ans;
}
*/
/* UNION FIND
class UnionFind {
public:
vector<SINT64> parent;
UnionFind(SINT64 N) {
parent = vector<SINT64>(N+10, -1); //少し多めに
}
SINT64 root(SINT64 A) {
if (parent[A] < 0) {
return A;
} else {
parent[A] = root(parent[A]);
return parent[A];
}
}
SINT64 size(SINT64 A) {
return parent[root(A)] * (-1);
}
bool judge(SINT64 A, SINT64 B) {
A = root(A);
B = root(B);
if (A == B) {
return true; //同じグループ
} else {
return false; //違うグループ
}
}
void connect(SINT64 A, SINT64 B) {
A = root(A);
B = root(B);
if (A != B) {
if (size(A) < size(B)) {
swap(A, B);
}
parent[A] += parent[B];
parent[B] = A;
}
}
};
UnionFind uni(N);
*/
/*
class SegTree {
private:
SINT64 size;
vector<SINT64> node;
SINT64 jugdement(SINT64 a, SINT64 b) {
SINT64 ans = 0;
ans = a+b;
return ans;
}
public:
//コンストラクタ
SegTree(vector<SINT64> data) {
SINT64 ori_size;
ori_size = data.size();
size = 1;
while (size < ori_size) {
size *= 2;
}
node.resize(2*size-1, 0);
rep(i,0,ori_size) {
node[size-1+i] = data[i];
}
rrep(i,size-2,0) {
node[i] = jugdement(node[2*i+1], node[2*i+2]);
}
}
//データ更新
void update(SINT64 x, SINT64 val) {
x += (size - 1);
node[x] = val+node[x];
while(x > 0) {
x = (x - 1) / 2;
node[x] = jugdement(node[2*x+1], node[2*x+2]);
}
}
//データ取得 [a,b)
SINT64 getdata(SINT64 a, SINT64 b, SINT64 k = 0, SINT64 l = 0, SINT64 r = -1) {
if (r < 0) {
r = size;
}
//要求範囲外
if ((r <= a) || (b <= l)) {
return 0;
}
//完全要求区間内
if ((a <= l) && (r <= b)) {
return node[k];
}
SINT64 vl = getdata(a, b, 2*k+1, l, (l+r)/2);
SINT64 vr = getdata(a, b, 2*k+2, (l+r)/2, r);
return jugdement(vl, vr);
}
//表示
void disp() {
rep(i,0,size) {
puts(node[size-1+i]);
} cout << endl;
}
void alldisp() {
SINT64 cnt = 0;
SINT64 end = 2;
while (1) {
puts(node[cnt]);
if (cnt == end-2) {
end *= 2;
cout << endl;
}
cnt++;
if (cnt == size*2-1) {
break;
}
}
}
};
SegTree seg(N);
*/ |
p03158 | C++ | #include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#define vv(a, b, c, d) vector<vector<d> >(a, vector<d>(b, c))
#define vvi vector<vector<int> >
#define vvl vector<vector<ll> >
#define vll vector<ll>
#define lb(a, b) lower_bound(a.begin(), a.end(), b)
#define ub(a, b) upper_bound(a.begin(), a.end(), b)
#define rep(c, a, b) for(ll c=a;c<b;c++)
#define re(c, b) for(ll c=0;c<b;c++)
typedef long long int ll;
typedef long double ld;
using namespace std;
int main(int argc, char const *argv[]) {
ll n, m, q;std::cin >> n >> m;
vll v(n), S(n, 0), S_back(n+1, 0);
re(i, n) {std::cin >> v[i];v[i] *= 2;}
re(i, n){
S_back[i+1] = S_back[i] + v[n-1-i];
if(i%2==n%2) S[i] = (i==0?0:S[i-1]);
else S[i] = (i==0?0:S[i-1]) + v[i];
}
re(i, m){
std::cin >> q;
ll l = -1, r = v[n-1];
ll left, right, mid, t;
while(r-l>1){
mid = (l+r)/2;
left = lb(v, 2*q-mid) - v.begin();
right = ub(v, 2*q+mid-1) - v.begin();
t = right - left;
if((n-t)-(right-1)>2) l = mid;
else r = mid;
}
left = lb(v, 2*q-r) - v.begin();
right = ub(v, 2*q+r-1) - v.begin();
t = right - left;
if((n-t)-(right-1)==2) t++;
ll ans = S_back[t];
if(n-2*t-1>=0) ans += S[n-1-2*t];
std::cout << ans/2 << '\n';
}
return 0;
}
|
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
int main()
{
int n, m, a;
vector <long long> V;
cin >> n >> m;
long long x, S=0, S1[n+3], S2[n+3];
for (int i = 0; i < n; i++)
{
cin >> a;
V.push_back(a);
}
if (n % 2 == 1)
{
V.push_back(-1100000000);
}
sort(V.begin(),V.end());
n = V.size();
S1[0] = 0;
S2[0] = 0;
for (int i = 1; i <= n; i++)
{
S1[i] = S1[i-1] + max(V[i-1], 0ll);
S2[i] = S2[i-1];
if (i % 2 == 0)
{
S2[i] += max(V[i-1], 0ll);
}
}
for (int i = 0; i < m; i++)
{
cin >> x;
int L=0, R=n/2+1, t, l, r;
while (R - L > 1)
{
t = (L + R) / 2;
l = n-2*t;
r = n-t-1;
if (l > 0 && abs(x-V[l-1]) <= abs(V[r]-x))
{
L = t;
}
else
{
R = t;
}
}
S = S1[n] - S1[n-R];
if (n-2*R > 0)
{
S += S2[n-2*R];
}
cout << S << "\n";
}
return 0;
}
|
p03158 | C++ | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
#define pp pair<pair<ll, ll>,pair<ll, ll>>
#define pll pair<ll,ll>
#define pdd pair<double,double>
#define vii vector<int>
#define vll vector<ll>
#define mat vector<vector<ll>>
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define fi first
#define sc second
#define rep(i,n) for(ll i=0;i<n;i++)
#define rep2(i,a,b) for(ll i=a;i<b;i++)
#define repr(i,n) for(ll i=n-1;i>=0;i--)
#define all(x) x.begin(),x.end()
#define sz (ll) (x).size()
#define pq priority_queue<ll>
#define pqg priority_queue<ll,vector<ll>,greater<ll>>
#define LB(v,x) (lower_bound(v.begin(),v.end(),x)-v.begin())
#define UB(v,x) (upper_bound(v.begin(),v.end(),x)-v.begin())
#define ERASE(v) sort(v.begin(),v.end());v.erase(unique(v.begin(),v.end()),v.end())
// #define int ll
using namespace std;
const ll INF = (1 << 30 ) - 1;
const ll LLINF = (1LL << 60LL);
const ll MOD = 1000000007;
const ll mod = 998244353;
const ll MAX = 1100000;
const double pi = acos(-1);
const double eps = 1e-10;
ll dx[4] ={1,0,-1,0} , dy[4] ={0,1,0,-1};
template<class T>
inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>
inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
struct Timer{
chrono::system_clock::time_point start, end;
Timer(){ start = chrono::system_clock::now(); }
~Timer(){
end = chrono::system_clock::now();
auto msec = chrono::duration_cast<chrono::milliseconds>(end - start).count();
cerr<<"time : "<<msec<<" ms"<<endl;
}
};
signed main(){
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
Timer TM;
ll n,q;
cin>>n>>q;
ll a[100010];
ll sum[100010]={},evensum[100010]={};
rep(i,n){
cin>>a[i];
}
reverse(a,a+n);
rep(i,n){
sum[i+1]=sum[i]+a[i];
evensum[i+1]=evensum[i];
if(i%2==0) evensum[i+1]+=a[i];
}
vll ths,vals;
rep(i,(n-1)/2){
ll th=(a[i+1]+a[i*2+2])/2+1;
ll val=(sum[i+1]-sum[0])+(evensum[n]-evensum[i*2+2]);
ths.pb(th),vals.pb(val);
}
reverse(all(ths)),reverse(all(vals));
/*
rep(i,ths.size()){
cout<<ths[i]<<" ";
}
cout<<endl;
rep(i,vals.size()){
cout<<vals[i]<<" ";
}
cout<<endl;
*/
rep(_,q){
ll x;
cin>>x;
ll it=UB(ths,x);
if(it==0){
cout<<sum[(n+1)/2]-sum[0]<<endl;
}
else cout<<vals[it-1]<<endl;
}
return 0;
} |
p03158 | C++ | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,a,b) for(int i=(a);i<(b);i++)
#define pb push_back
#define eb emplace_back
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
using vint=vector<int>;
using pint=pair<int,int>;
using vpint=vector<pint>;
template<typename A,typename B>inline void chmin(A &a,B b){if(a>b)a=b;}
template<typename A,typename B>inline void chmax(A &a,B b){if(a<b)a=b;}
template<class A,class B>
ostream& operator<<(ostream& ost,const pair<A,B>&p){
ost<<"{"<<p.first<<","<<p.second<<"}";
return ost;
}
template<class T>
ostream& operator<<(ostream& ost,const vector<T>&v){
ost<<"{";
for(int i=0;i<v.size();i++){
if(i)ost<<",";
ost<<v[i];
}
ost<<"}";
return ost;
}
int N,Q;
int A[111111];
int sufsum[111111];
int presum[111111];
void solve(){
int X;cin>>X;
int lb=0,ub=N;
while(ub-lb>1){
int mid=(ub+lb)/2;
bool ok=true;
if(X>=A[mid])ok=false;
else{
int d=A[mid]-X;
int num=mid-(lower_bound(A,A+N,X-d)-A);
if(num<=N-1-mid)ok=false;
}
if(ok)ub=mid;
else lb=mid;
}
int ans=sufsum[ub];
if((N-ub)*2>=N){
cout<<ans<<endl;
return;
}
int d=A[lb]-X;
int num=lb-(lower_bound(A,A+N,X-d)-A);
if(num==N-1-lb){
ans+=A[lb];
ans+=presum[max(N-(N-lb)*2,0ll)];
}
else{
ans+=presum[N-(N-ub)*2];
}
cout<<ans<<endl;
}
signed main(){
cin>>N>>Q;
rep(i,N)cin>>A[i];
for(int i=0;i<N;i++){
if((N-i)&1)presum[i+1]+=A[i];
presum[i+1]+=presum[i];
}
for(int i=N-1;i>=0;i--)sufsum[i]=sufsum[i+1]+A[i];
while(Q--)solve();
return 0;
} |
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
int N, Q;
cin >> N >> Q;
vector<ll> A(N);
for (int i = 0; i < N; i++) cin >> A[i];
vector<ll> evensum(N+1, 0), oddsum(N+1, 0), sum(N+1, 0);
oddsum[1] = A[0];
sum[1] = A[0];
for (int i = 2; i <= N; i++) {
if (i%2 == 1) {
evensum[i] = evensum[i-1];
oddsum[i] = oddsum[i-1]+A[i-1];
sum[i] = sum[i-1]+A[i-1];
}
if (i%2 == 0) {
evensum[i] = evensum[i-1]+A[i-1];
oddsum[i] = oddsum[i-1];
sum[i] = sum[i-1]+A[i-1];
}
}
for (int z = 0; z < Q; z++) {
ll X;
cin >> X;
int l = N/2-1, r = N-1;
int c = (l+r)/2;
int d = c-1-(N-c);
while (r-l > 1) {
c = (l+r)/2;
d = c-(N-1-c);
if (abs(X-A[d]) <= abs(X-A[c])) r = c;
else l = c;
}
d = r-(N-1-r);
//cout << r << " " << d << " ";
ll ans = 0;
ans += sum[N]-sum[r];
//cout << ans << " ";
if (N%2 == 1 && d > 0) ans += oddsum[d];
else if (N%2 == 0 && d > 0) ans += evensum[d];
cout << ans << endl;
}
return 0;
}
|
p03158 | C++ | #include <type_traits>
#include <cstdint>
#include <iostream>
#include <fstream>
#include <iomanip>
#include <vector>
#include <queue>
#include <functional>
#include <numeric>
#include <cassert>
#include <thread>
using namespace std;
// tourist's modular-arithmetic class
template<typename T>
T inverse(T a, T m) {
T u = 0, v = 1;
while (a != 0) {
T t = m / a;
m -= t * a;
swap(a, m);
u -= t * v;
swap(u, v);
}
assert(m == 1);
return u;
}
template<typename T>
class Modular {
public:
using Type = typename decay<decltype(T::value)>::type;
constexpr Modular() : value() {}
template<typename U>
Modular(const U &x) {
value = normalize(x);
}
template<typename U>
static Type normalize(const U &x) {
Type v;
if (-mod() <= x && x < mod()) v = static_cast<Type>(x);
else v = static_cast<Type>(x % mod());
if (v < 0) v += mod();
return v;
}
const Type &operator()() const { return value; }
template<typename U>
explicit operator U() const { return static_cast<U>(value); }
constexpr static Type mod() { return T::value; }
Modular &operator+=(const Modular &other) {
if ((value += other.value) >= mod()) value -= mod();
return *this;
}
Modular &operator-=(const Modular &other) {
if ((value -= other.value) < 0) value += mod();
return *this;
}
template<typename U>
Modular &operator+=(const U &other) { return *this += Modular(other); }
template<typename U>
Modular &operator-=(const U &other) { return *this -= Modular(other); }
Modular &operator++() { return *this += 1; }
Modular &operator--() { return *this -= 1; }
Modular operator++(int) {
Modular result(*this);
*this += 1;
return result;
}
Modular operator--(int) {
Modular result(*this);
*this -= 1;
return result;
}
Modular operator-() const { return Modular(-value); }
template<typename U = T>
typename enable_if<is_same<typename Modular<U>::Type, int>::value, Modular>::type &operator*=(const Modular &rhs) {
#ifdef _WIN32
uint64_t x = static_cast<int64_t>(value) * static_cast<int64_t>(rhs.value);
uint32_t xh = static_cast<uint32_t>(x >> 32), xl = static_cast<uint32_t>(x), d, m;
asm(
"divl %4; \n\t"
: "=a" (d), "=d" (m)
: "d" (xh), "a" (xl), "r" (mod())
);
value = m;
#else
value = normalize(static_cast<int64_t>(value) * static_cast<int64_t>(rhs.value));
#endif
return *this;
}
template<typename U = T>
typename enable_if<is_same<typename Modular<U>::Type, int64_t>::value, Modular>::type &
operator*=(const Modular &rhs) {
int64_t q = static_cast<int64_t>(static_cast<long double>(value) * rhs.value / mod());
value = normalize(value * rhs.value - q * mod());
return *this;
}
template<typename U = T>
typename enable_if<!is_integral<typename Modular<U>::Type>::value, Modular>::type &operator*=(const Modular &rhs) {
value = normalize(value * rhs.value);
return *this;
}
Modular &operator/=(const Modular &other) { return *this *= Modular(inverse(other.value, mod())); }
template<typename U>
friend const Modular<U> &abs(const Modular<U> &v) { return v; }
template<typename U>
friend bool operator==(const Modular<U> &lhs, const Modular<U> &rhs);
template<typename U>
friend bool operator<(const Modular<U> &lhs, const Modular<U> &rhs);
template<typename U>
friend std::istream &operator>>(std::istream &stream, Modular<U> &number);
private:
Type value;
};
template<typename T>
bool operator==(const Modular<T> &lhs, const Modular<T> &rhs) { return lhs.value == rhs.value; }
template<typename T, typename U>
bool operator==(const Modular<T> &lhs, U rhs) { return lhs == Modular<T>(rhs); }
template<typename T, typename U>
bool operator==(U lhs, const Modular<T> &rhs) { return Modular<T>(lhs) == rhs; }
template<typename T>
bool operator!=(const Modular<T> &lhs, const Modular<T> &rhs) { return !(lhs == rhs); }
template<typename T, typename U>
bool operator!=(const Modular<T> &lhs, U rhs) { return !(lhs == rhs); }
template<typename T, typename U>
bool operator!=(U lhs, const Modular<T> &rhs) { return !(lhs == rhs); }
template<typename T>
bool operator<(const Modular<T> &lhs, const Modular<T> &rhs) { return lhs.value < rhs.value; }
template<typename T>
Modular<T> operator+(const Modular<T> &lhs, const Modular<T> &rhs) { return Modular<T>(lhs) += rhs; }
template<typename T, typename U>
Modular<T> operator+(const Modular<T> &lhs, U rhs) { return Modular<T>(lhs) += rhs; }
template<typename T, typename U>
Modular<T> operator+(U lhs, const Modular<T> &rhs) { return Modular<T>(lhs) += rhs; }
template<typename T>
Modular<T> operator-(const Modular<T> &lhs, const Modular<T> &rhs) { return Modular<T>(lhs) -= rhs; }
template<typename T, typename U>
Modular<T> operator-(const Modular<T> &lhs, U rhs) { return Modular<T>(lhs) -= rhs; }
template<typename T, typename U>
Modular<T> operator-(U lhs, const Modular<T> &rhs) { return Modular<T>(lhs) -= rhs; }
template<typename T>
Modular<T> operator*(const Modular<T> &lhs, const Modular<T> &rhs) { return Modular<T>(lhs) *= rhs; }
template<typename T, typename U>
Modular<T> operator*(const Modular<T> &lhs, U rhs) { return Modular<T>(lhs) *= rhs; }
template<typename T, typename U>
Modular<T> operator*(U lhs, const Modular<T> &rhs) { return Modular<T>(lhs) *= rhs; }
template<typename T>
Modular<T> operator/(const Modular<T> &lhs, const Modular<T> &rhs) { return Modular<T>(lhs) /= rhs; }
template<typename T, typename U>
Modular<T> operator/(const Modular<T> &lhs, U rhs) { return Modular<T>(lhs) /= rhs; }
template<typename T, typename U>
Modular<T> operator/(U lhs, const Modular<T> &rhs) { return Modular<T>(lhs) /= rhs; }
template<typename T, typename U>
Modular<T> power(const Modular<T> &a, const U &b) {
assert(b >= 0);
Modular<T> x = a, res = 1;
U p = b;
while (p > 0) {
if (p & 1) res *= x;
x *= x;
p >>= 1;
}
return res;
}
template<typename T>
bool IsZero(const Modular<T> &number) {
return number() == 0;
}
template<typename T>
string to_string(const Modular<T> &number) {
return to_string(number());
}
template<typename T>
std::ostream &operator<<(std::ostream &stream, const Modular<T> &number) {
return stream << number();
}
template<typename T>
std::istream &operator>>(std::istream &stream, Modular<T> &number) {
typename common_type<typename Modular<T>::Type, int64_t>::type x;
stream >> x;
number.value = Modular<T>::normalize(x);
return stream;
}
struct fast_ios {
fast_ios() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
};
} fast_ios_;
#define LSON(x) ((x) * 2)
#define RSON(x) ((x) * 2 + 1)
template<typename A, typename B>
bool chkmin(A &a, const B &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
template<typename A, typename B>
bool chkmax(A &a, const B &b) {
if (b > a) {
a = b;
return true;
}
return false;
}
int cas;
ostream &kase() {
return cout << "Case #" << ++cas << ": ";
}
#if __cplusplus < 201402L
template<class Iterator>
std::reverse_iterator<Iterator> make_reverse_iterator(Iterator it) {
return std::reverse_iterator<Iterator>(it);
}
#endif
template<typename iter_t>
struct iter_pair {
iter_t _beg, _end;
iter_t begin() { return _beg; }
iter_t end() { return _end; }
};
template<class cont>
iter_pair<reverse_iterator<decltype(begin(declval<cont>()))>>
reverse(cont &&r) {
return {make_reverse_iterator(end(r)), make_reverse_iterator(begin(r))};
}
template<typename T>
void dprintln(const T &t) { cout << t << endl; } // for debug use
template<typename T, typename ...Args>
void dprintln(const T &t, const Args &...rest) {
cout << t << ' ';
dprintln(rest...);
}
template<typename T>
ostream &operator<<(ostream &stream, const vector<T> &vec) {
if (!vec.empty()) {
stream << vec[0];
for (size_t i = 1; i != vec.size(); ++i)
stream << ' ' << vec[i];
}
return stream;
}
template<typename T>
void print(const vector<T> &t) { cout << t << '\n'; }
template <typename T>
void print(const vector<vector<T>> &t) {
for (const auto& row : t) {
print(row);
}
}
template<typename T>
void print(const T &t) { cout << t << ' '; }
template<typename T, typename ...Args>
void print(const T &t, const Args &...rest) {
print(t);
print(rest...);
}
template<typename T>
void println(const T &t) { cout << t << '\n'; }
template<typename T, typename ...Args>
void println(const T &t, const Args &...rest) {
print(t);
println(rest...);
}
// this overload is chosen when there's only one argument
template<class T>
void scan(T &t) {cin >> t;}
template<class T, class ...Args>
void scan(T &a, Args &...rest) {
cin >> a;
scan(rest...);
}
template<typename T>
istream &operator>>(istream &stream, vector<T> &vec) {
for (auto &x : vec) stream >> x;
return stream;
}
using ull = unsigned long long;
using ll = long long;
using ul = unsigned long;
using vl = vector<ll>;
using vi = vector<int>;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pip = pair<int, pii>;
using pll = pair<ll, ll>;
using vb = vector<bool>;
using vpii = vector<pii>;
using ldb = long double;
template<typename int_t>
inline int_t lowbit(int_t x) { return x & -x; }
#define rng(i, a, b) for(int i = (int)(a); i < (int)(b); ++i)
#define up(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define down(i, b, a) for (int i = int(b); i >= int(a); i--)
#define rep(n) for(int _iter_##n = 0, _num_##n = (int)n; _iter_##n < _num_##n; ++_iter_##n)
#define FOR(x, cont) for (const auto &x: cont)
#define For(x, cont) for (auto &x: cont)
#define all(x) begin(x), end(x)
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ep emplace
#define SZ(x) (int)(x).size()
template<typename T, typename Comp = less<T>>
using pq = priority_queue<T, vector<T>, Comp>;
#define popcnt(x) __builtin_popcountll((x))
#define UNIQ(vec) (vec).erase(unique(all(vec)), end(vec))
#define LB(cont, x) int(lower_bound(all(cont), x) - begin(cont))
#define UB(cont, x) int(upper_bound(all(cont), x) - begin(cont))
const int dx[] = {0, 0, -1, 1}, dy[] = {-1, 1, 0, 0};
const int dx8[] = {-1, -1, -1, 0, 0, 1, 1, 1}, dy8[] = {-1, 0, 1, -1, 1, -1, 0, 1};
auto bet = [](const ll x, const ll y, const ll i) {
return x <= i && i <= y;
};
template<typename T1, typename T2>
T1 ceil(T1 x, T2 y) { // y >= 1，是整数。需要注意 x + y - 1 是否会溢出
return (x + y - 1) / y;
}
#ifdef _MSC_VER
#include <intrin.h>
static inline int __builtin_clzll(unsigned long long x) {
return (int)__lzcnt64(x);
}
#endif
inline int h_bit(unsigned long long x) {
return (int) sizeof(unsigned long long) * 8 - 1 - __builtin_clzll(x);
}
unsigned long long pow2(unsigned long long x) { // round up to power of 2
return 1ULL << (h_bit((ull)x) + (x != lowbit(x)));
}
template<typename T>
struct BIT {
vector<T> a;
function<T(T, T)> bin_op;
const T init;
explicit BIT(int n, function<T(T, T)> bin_op, T init = T()) : bin_op(bin_op), init(init) {
a.assign(n + 1, init);
}
T prefix(int x) {
auto res = init;
while (x) {
res = bin_op(a[x], res);
x -= x & -x;
}
return res;
}
void modify(int x, T v) {
while (x < (int) a.size()) {
a[x] = bin_op(a[x], v);
x += x & -x;
}
}
void clear() {
fill(a.begin(), a.end(), init);
}
};
vi get_prime(int n) {
vi minp((ul) n + 1), p;
for (int i = 2; i <= n; i++) {
if (!minp[i]) {
minp[i] = i;
p.pb(i);
}
FOR(x, p) {
if (x <= minp[i] && x * i <= n)
minp[x * i] = x;
else break;
}
}
return p;
}
// alias templates
template<typename T> using vv = vector<vector<T>>;
template<typename T1, typename T2 = T1> using vp = vector<pair<T1, T2>>;
template<typename T, int n> using va = vector<array<T, n>>;
//order_of_key (k) : Number of items strictly smaller than k .
//find_by_order(k) : K-th element in a set (counting from zero).
#ifdef __GNUC__
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
template<typename T, typename comp = less<T>>
using rank_tree = __gnu_pbds::tree<
T,
__gnu_pbds::null_type,
comp,
__gnu_pbds::rb_tree_tag,
__gnu_pbds::tree_order_statistics_node_update>;
#include <ext/pb_ds/trie_policy.hpp>
using trie = __gnu_pbds::trie<string,__gnu_pbds::null_type>;
#endif
//并查集
struct UnionFind {
vi par, sz;
int n_tree;
explicit UnionFind(int n) : sz(n, 1), n_tree(n) { //0-indexed
sz.resize(n);
iota(par.begin(), par.end(), 0);
}
int n_cluster() const {
return n_tree;
}
int size(int x) {
return sz[root(x)];
}
int root(int x) {
return x == par[x] ? x : par[x] = root(par[x]);
}
bool unite(int x, int y) {
int rx = root(x), ry = root(y);
if (rx != ry) {
par[rx] = ry;
--n_tree;
sz[ry] += sz[rx];
return true;
}
return false;
}
bool is_root(int x) const {
return par[x] == x;
}
};
template<typename T, typename Compare = std::less<T>>
struct SparseTable {
size_t n{}; // 0-indexed
vv<T> a;
template<typename ptr_t>
SparseTable(ptr_t beg, ptr_t end):n(end - beg) {
a.resize((size_t) h_bit(n) + 1); // 注意：不能写成 h_bit(n)
a[0].assign(beg, end);
rng (i, 0, SZ(a) - 1) {
a[i + 1].resize(n);
rng(j, 0, n - (1u << i)) {
a[i + 1][j] = min(a[i][j], a[i][j + (1u << i)], Compare());
}
rng(j, n - (1u << i), n) {
a[i + 1][j] = a[i][j];
}
}
}
using idx_t = long;
T query(idx_t l, idx_t r) { // l <= r
int i = h_bit(r - l + 1ul);
return min(a[i][l], a[i][r + 1 - (1u << i)], Compare());
}
};
// debug code by tourist
string to_string(const string &s) {
return '"' + s + '"';
}
string to_string(const char *s) {
return to_string((string) s);
}
string to_string(bool b) {
return (b ? "true" : "false");
}
template<typename A, typename B>
string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template<typename A>
string to_string(A v) {
bool first = true;
string res = "{";
for (const auto &x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
void debug_out() { cerr << endl; }
template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
// end DEBUG
template<typename T>
struct Binom {
vector<T> fact, inv_fact;
explicit Binom(int n) : fact(n + 1), inv_fact(n + 1) {
fact[0] = 1;
up (i, 1, n) fact[i] = fact[i - 1] * i;
inv_fact[n] = 1 / fact[n];
down (i, n, 1) {
inv_fact[i - 1] = inv_fact[i] * i;
}
}
T get_binom(int x, int y) const {
assert(x <= SZ(fact) - 1);
assert(x >= 0 && y >= 0);
if (x < y) return 0;
return fact[x] * inv_fact[y] * inv_fact[x - y];
}
T get_fact(int n) const {
assert(n < SZ(fact));
return fact[n];
}
};
template<typename T>
T get_mid(T l, T r) {
assert(l <= r);
return l + (r - l) / 2;
}
template<typename T>
int get_bit(T a, int i) {
return a >> i & 1;
}
/*using ModType = int;
struct VarMod {
static ModType value;
};
ModType VarMod::value;
ModType &md = VarMod::value;
using Mint = Modular<VarMod>;*/
constexpr int md = 1000000007;
using Mint = Modular<std::integral_constant<decay<decltype(md)>::type, md>>;
//////////////////^"^///////////////////////////////////
int main() {
#if defined LOCAL && !defined DUIPAI
ifstream in("main.in");
cin.rdbuf(in.rdbuf());
// ofstream out("main.out");
// cout.rdbuf(out.rdbuf());
#endif
int n, q;
scan(n, q);
vi a(n);
scan(a);
vl sum(n);
sum[0] = a[0];
rng (i, 1, n) {
sum[i] = a[i] + sum[i - 1];
}
vl parity_sum(n);
parity_sum[0] = a[0];
parity_sum[1] = a[1];
rng (i, 2, n) {
parity_sum[i] = a[i] + parity_sum[i - 2];
}
rep (q) {
int x;
scan(x);
// 二分查找Aoki拿走的最大的数
// 设Aoki拿走的最大的数是y且y>X且y是第i大的，那么这个数是Aoki拿的第i-1个数，换言之[2X-y,y]之间共有i-1个数。
// max i s.t. num[2x-a[i],a[i]] <= n - i - 1
int l = 0, r = n - 1;
while (l + 1 < r) {
bool flag = false;
int mid = get_mid(l, r);
int at_most = n - 1 - mid;
auto t = LB(a, x - abs(x - a[mid]));
int taken = mid - t + 1;
if (taken <= at_most) {
l = mid;
} else {
r = mid;
}
}
ll ans = sum[n - 1] - sum[l];
int num = n - 1 - l;
if (n - 2 * num - 1 >= 0) {
ans += parity_sum[n - 2 * num - 1];
}
println(ans);
}
#if defined LOCAL && !defined DUIPAI
cout << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
return 0;
}
|
p03158 | C++ | #include <type_traits>
#include <cstdint>
#include <iostream>
#include <fstream>
#include <iomanip>
#include <vector>
#include <queue>
#include <functional>
#include <numeric>
#include <cassert>
#include <thread>
using namespace std;
// tourist's modular-arithmetic class
template<typename T>
T inverse(T a, T m) {
T u = 0, v = 1;
while (a != 0) {
T t = m / a;
m -= t * a;
swap(a, m);
u -= t * v;
swap(u, v);
}
assert(m == 1);
return u;
}
template<typename T>
class Modular {
public:
using Type = typename decay<decltype(T::value)>::type;
constexpr Modular() : value() {}
template<typename U>
Modular(const U &x) {
value = normalize(x);
}
template<typename U>
static Type normalize(const U &x) {
Type v;
if (-mod() <= x && x < mod()) v = static_cast<Type>(x);
else v = static_cast<Type>(x % mod());
if (v < 0) v += mod();
return v;
}
const Type &operator()() const { return value; }
template<typename U>
explicit operator U() const { return static_cast<U>(value); }
constexpr static Type mod() { return T::value; }
Modular &operator+=(const Modular &other) {
if ((value += other.value) >= mod()) value -= mod();
return *this;
}
Modular &operator-=(const Modular &other) {
if ((value -= other.value) < 0) value += mod();
return *this;
}
template<typename U>
Modular &operator+=(const U &other) { return *this += Modular(other); }
template<typename U>
Modular &operator-=(const U &other) { return *this -= Modular(other); }
Modular &operator++() { return *this += 1; }
Modular &operator--() { return *this -= 1; }
Modular operator++(int) {
Modular result(*this);
*this += 1;
return result;
}
Modular operator--(int) {
Modular result(*this);
*this -= 1;
return result;
}
Modular operator-() const { return Modular(-value); }
template<typename U = T>
typename enable_if<is_same<typename Modular<U>::Type, int>::value, Modular>::type &operator*=(const Modular &rhs) {
#ifdef _WIN32
uint64_t x = static_cast<int64_t>(value) * static_cast<int64_t>(rhs.value);
uint32_t xh = static_cast<uint32_t>(x >> 32), xl = static_cast<uint32_t>(x), d, m;
asm(
"divl %4; \n\t"
: "=a" (d), "=d" (m)
: "d" (xh), "a" (xl), "r" (mod())
);
value = m;
#else
value = normalize(static_cast<int64_t>(value) * static_cast<int64_t>(rhs.value));
#endif
return *this;
}
template<typename U = T>
typename enable_if<is_same<typename Modular<U>::Type, int64_t>::value, Modular>::type &
operator*=(const Modular &rhs) {
int64_t q = static_cast<int64_t>(static_cast<long double>(value) * rhs.value / mod());
value = normalize(value * rhs.value - q * mod());
return *this;
}
template<typename U = T>
typename enable_if<!is_integral<typename Modular<U>::Type>::value, Modular>::type &operator*=(const Modular &rhs) {
value = normalize(value * rhs.value);
return *this;
}
Modular &operator/=(const Modular &other) { return *this *= Modular(inverse(other.value, mod())); }
template<typename U>
friend const Modular<U> &abs(const Modular<U> &v) { return v; }
template<typename U>
friend bool operator==(const Modular<U> &lhs, const Modular<U> &rhs);
template<typename U>
friend bool operator<(const Modular<U> &lhs, const Modular<U> &rhs);
template<typename U>
friend std::istream &operator>>(std::istream &stream, Modular<U> &number);
private:
Type value;
};
template<typename T>
bool operator==(const Modular<T> &lhs, const Modular<T> &rhs) { return lhs.value == rhs.value; }
template<typename T, typename U>
bool operator==(const Modular<T> &lhs, U rhs) { return lhs == Modular<T>(rhs); }
template<typename T, typename U>
bool operator==(U lhs, const Modular<T> &rhs) { return Modular<T>(lhs) == rhs; }
template<typename T>
bool operator!=(const Modular<T> &lhs, const Modular<T> &rhs) { return !(lhs == rhs); }
template<typename T, typename U>
bool operator!=(const Modular<T> &lhs, U rhs) { return !(lhs == rhs); }
template<typename T, typename U>
bool operator!=(U lhs, const Modular<T> &rhs) { return !(lhs == rhs); }
template<typename T>
bool operator<(const Modular<T> &lhs, const Modular<T> &rhs) { return lhs.value < rhs.value; }
template<typename T>
Modular<T> operator+(const Modular<T> &lhs, const Modular<T> &rhs) { return Modular<T>(lhs) += rhs; }
template<typename T, typename U>
Modular<T> operator+(const Modular<T> &lhs, U rhs) { return Modular<T>(lhs) += rhs; }
template<typename T, typename U>
Modular<T> operator+(U lhs, const Modular<T> &rhs) { return Modular<T>(lhs) += rhs; }
template<typename T>
Modular<T> operator-(const Modular<T> &lhs, const Modular<T> &rhs) { return Modular<T>(lhs) -= rhs; }
template<typename T, typename U>
Modular<T> operator-(const Modular<T> &lhs, U rhs) { return Modular<T>(lhs) -= rhs; }
template<typename T, typename U>
Modular<T> operator-(U lhs, const Modular<T> &rhs) { return Modular<T>(lhs) -= rhs; }
template<typename T>
Modular<T> operator*(const Modular<T> &lhs, const Modular<T> &rhs) { return Modular<T>(lhs) *= rhs; }
template<typename T, typename U>
Modular<T> operator*(const Modular<T> &lhs, U rhs) { return Modular<T>(lhs) *= rhs; }
template<typename T, typename U>
Modular<T> operator*(U lhs, const Modular<T> &rhs) { return Modular<T>(lhs) *= rhs; }
template<typename T>
Modular<T> operator/(const Modular<T> &lhs, const Modular<T> &rhs) { return Modular<T>(lhs) /= rhs; }
template<typename T, typename U>
Modular<T> operator/(const Modular<T> &lhs, U rhs) { return Modular<T>(lhs) /= rhs; }
template<typename T, typename U>
Modular<T> operator/(U lhs, const Modular<T> &rhs) { return Modular<T>(lhs) /= rhs; }
template<typename T, typename U>
Modular<T> power(const Modular<T> &a, const U &b) {
assert(b >= 0);
Modular<T> x = a, res = 1;
U p = b;
while (p > 0) {
if (p & 1) res *= x;
x *= x;
p >>= 1;
}
return res;
}
template<typename T>
bool IsZero(const Modular<T> &number) {
return number() == 0;
}
template<typename T>
string to_string(const Modular<T> &number) {
return to_string(number());
}
template<typename T>
std::ostream &operator<<(std::ostream &stream, const Modular<T> &number) {
return stream << number();
}
template<typename T>
std::istream &operator>>(std::istream &stream, Modular<T> &number) {
typename common_type<typename Modular<T>::Type, int64_t>::type x;
stream >> x;
number.value = Modular<T>::normalize(x);
return stream;
}
struct fast_ios {
fast_ios() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
};
} fast_ios_;
#define LSON(x) ((x) * 2)
#define RSON(x) ((x) * 2 + 1)
template<typename A, typename B>
bool chkmin(A &a, const B &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
template<typename A, typename B>
bool chkmax(A &a, const B &b) {
if (b > a) {
a = b;
return true;
}
return false;
}
int cas;
ostream &kase() {
return cout << "Case #" << ++cas << ": ";
}
#if __cplusplus < 201402L
template<class Iterator>
std::reverse_iterator<Iterator> make_reverse_iterator(Iterator it) {
return std::reverse_iterator<Iterator>(it);
}
#endif
template<typename iter_t>
struct iter_pair {
iter_t _beg, _end;
iter_t begin() { return _beg; }
iter_t end() { return _end; }
};
template<class cont>
iter_pair<reverse_iterator<decltype(begin(declval<cont>()))>>
reverse(cont &&r) {
return {make_reverse_iterator(end(r)), make_reverse_iterator(begin(r))};
}
template<typename T>
void dprintln(const T &t) { cout << t << endl; } // for debug use
template<typename T, typename ...Args>
void dprintln(const T &t, const Args &...rest) {
cout << t << ' ';
dprintln(rest...);
}
template<typename T>
ostream &operator<<(ostream &stream, const vector<T> &vec) {
if (!vec.empty()) {
stream << vec[0];
for (size_t i = 1; i != vec.size(); ++i)
stream << ' ' << vec[i];
}
return stream;
}
template<typename T>
void print(const vector<T> &t) { cout << t << '\n'; }
template <typename T>
void print(const vector<vector<T>> &t) {
for (const auto& row : t) {
print(row);
}
}
template<typename T>
void print(const T &t) { cout << t << ' '; }
template<typename T, typename ...Args>
void print(const T &t, const Args &...rest) {
print(t);
print(rest...);
}
template<typename T>
void println(const T &t) { cout << t << '\n'; }
template<typename T, typename ...Args>
void println(const T &t, const Args &...rest) {
print(t);
println(rest...);
}
// this overload is chosen when there's only one argument
template<class T>
void scan(T &t) {cin >> t;}
template<class T, class ...Args>
void scan(T &a, Args &...rest) {
cin >> a;
scan(rest...);
}
template<typename T>
istream &operator>>(istream &stream, vector<T> &vec) {
for (auto &x : vec) stream >> x;
return stream;
}
using ull = unsigned long long;
using ll = long long;
using ul = unsigned long;
using vl = vector<ll>;
using vi = vector<int>;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pip = pair<int, pii>;
using pll = pair<ll, ll>;
using vb = vector<bool>;
using vpii = vector<pii>;
using ldb = long double;
template<typename int_t>
inline int_t lowbit(int_t x) { return x & -x; }
#define rng(i, a, b) for(int i = (int)(a); i < (int)(b); ++i)
#define up(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define down(i, b, a) for (int i = int(b); i >= int(a); i--)
#define rep(n) for(int _iter_##n = 0, _num_##n = (int)n; _iter_##n < _num_##n; ++_iter_##n)
#define FOR(x, cont) for (const auto &x: cont)
#define For(x, cont) for (auto &x: cont)
#define all(x) begin(x), end(x)
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ep emplace
#define SZ(x) (int)(x).size()
template<typename T, typename Comp = less<T>>
using pq = priority_queue<T, vector<T>, Comp>;
#define popcnt(x) __builtin_popcountll((x))
#define UNIQ(vec) (vec).erase(unique(all(vec)), end(vec))
#define LB(cont, x) int(lower_bound(all(cont), x) - begin(cont))
#define UB(cont, x) int(upper_bound(all(cont), x) - begin(cont))
const int dx[] = {0, 0, -1, 1}, dy[] = {-1, 1, 0, 0};
const int dx8[] = {-1, -1, -1, 0, 0, 1, 1, 1}, dy8[] = {-1, 0, 1, -1, 1, -1, 0, 1};
auto bet = [](const ll x, const ll y, const ll i) {
return x <= i && i <= y;
};
template<typename T1, typename T2>
T1 ceil(T1 x, T2 y) { // y >= 1，是整数。需要注意 x + y - 1 是否会溢出
return (x + y - 1) / y;
}
#ifdef _MSC_VER
#include <intrin.h>
static inline int __builtin_clzll(unsigned long long x) {
return (int)__lzcnt64(x);
}
#endif
inline int h_bit(unsigned long long x) {
return (int) sizeof(unsigned long long) * 8 - 1 - __builtin_clzll(x);
}
unsigned long long pow2(unsigned long long x) { // round up to power of 2
return 1ULL << (h_bit((ull)x) + (x != lowbit(x)));
}
template<typename T>
struct BIT {
vector<T> a;
function<T(T, T)> bin_op;
const T init;
explicit BIT(int n, function<T(T, T)> bin_op, T init = T()) : bin_op(bin_op), init(init) {
a.assign(n + 1, init);
}
T prefix(int x) {
auto res = init;
while (x) {
res = bin_op(a[x], res);
x -= x & -x;
}
return res;
}
void modify(int x, T v) {
while (x < (int) a.size()) {
a[x] = bin_op(a[x], v);
x += x & -x;
}
}
void clear() {
fill(a.begin(), a.end(), init);
}
};
vi get_prime(int n) {
vi minp((ul) n + 1), p;
for (int i = 2; i <= n; i++) {
if (!minp[i]) {
minp[i] = i;
p.pb(i);
}
FOR(x, p) {
if (x <= minp[i] && x * i <= n)
minp[x * i] = x;
else break;
}
}
return p;
}
// alias templates
template<typename T> using vv = vector<vector<T>>;
template<typename T1, typename T2 = T1> using vp = vector<pair<T1, T2>>;
template<typename T, int n> using va = vector<array<T, n>>;
//order_of_key (k) : Number of items strictly smaller than k .
//find_by_order(k) : K-th element in a set (counting from zero).
#ifdef __GNUC__
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
template<typename T, typename comp = less<T>>
using rank_tree = __gnu_pbds::tree<
T,
__gnu_pbds::null_type,
comp,
__gnu_pbds::rb_tree_tag,
__gnu_pbds::tree_order_statistics_node_update>;
#include <ext/pb_ds/trie_policy.hpp>
using trie = __gnu_pbds::trie<string,__gnu_pbds::null_type>;
#endif
//并查集
struct UnionFind {
vi par, sz;
int n_tree;
explicit UnionFind(int n) : sz(n, 1), n_tree(n) { //0-indexed
sz.resize(n);
iota(par.begin(), par.end(), 0);
}
int n_cluster() const {
return n_tree;
}
int size(int x) {
return sz[root(x)];
}
int root(int x) {
return x == par[x] ? x : par[x] = root(par[x]);
}
bool unite(int x, int y) {
int rx = root(x), ry = root(y);
if (rx != ry) {
par[rx] = ry;
--n_tree;
sz[ry] += sz[rx];
return true;
}
return false;
}
bool is_root(int x) const {
return par[x] == x;
}
};
template<typename T, typename Compare = std::less<T>>
struct SparseTable {
size_t n{}; // 0-indexed
vv<T> a;
template<typename ptr_t>
SparseTable(ptr_t beg, ptr_t end):n(end - beg) {
a.resize((size_t) h_bit(n) + 1); // 注意：不能写成 h_bit(n)
a[0].assign(beg, end);
rng (i, 0, SZ(a) - 1) {
a[i + 1].resize(n);
rng(j, 0, n - (1u << i)) {
a[i + 1][j] = min(a[i][j], a[i][j + (1u << i)], Compare());
}
rng(j, n - (1u << i), n) {
a[i + 1][j] = a[i][j];
}
}
}
using idx_t = long;
T query(idx_t l, idx_t r) { // l <= r
int i = h_bit(r - l + 1ul);
return min(a[i][l], a[i][r + 1 - (1u << i)], Compare());
}
};
// debug code by tourist
string to_string(const string &s) {
return '"' + s + '"';
}
string to_string(const char *s) {
return to_string((string) s);
}
string to_string(bool b) {
return (b ? "true" : "false");
}
template<typename A, typename B>
string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template<typename A>
string to_string(A v) {
bool first = true;
string res = "{";
for (const auto &x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
void debug_out() { cerr << endl; }
template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
// end DEBUG
template<typename T>
struct Binom {
vector<T> fact, inv_fact;
explicit Binom(int n) : fact(n + 1), inv_fact(n + 1) {
fact[0] = 1;
up (i, 1, n) fact[i] = fact[i - 1] * i;
inv_fact[n] = 1 / fact[n];
down (i, n, 1) {
inv_fact[i - 1] = inv_fact[i] * i;
}
}
T get_binom(int x, int y) const {
assert(x <= SZ(fact) - 1);
assert(x >= 0 && y >= 0);
if (x < y) return 0;
return fact[x] * inv_fact[y] * inv_fact[x - y];
}
T get_fact(int n) const {
assert(n < SZ(fact));
return fact[n];
}
};
template<typename T>
T get_mid(T l, T r) {
assert(l <= r);
return l + (r - l) / 2;
}
template<typename T>
int get_bit(T a, int i) {
return a >> i & 1;
}
/*using ModType = int;
struct VarMod {
static ModType value;
};
ModType VarMod::value;
ModType &md = VarMod::value;
using Mint = Modular<VarMod>;*/
constexpr int md = 1000000007;
using Mint = Modular<std::integral_constant<decay<decltype(md)>::type, md>>;
//////////////////^"^///////////////////////////////////
int main() {
#if defined LOCAL && !defined DUIPAI
ifstream in("main.in");
cin.rdbuf(in.rdbuf());
// ofstream out("main.out");
// cout.rdbuf(out.rdbuf());
#endif
int n, q;
scan(n, q);
vi a(n);
scan(a);
vl sum(n);
sum[0] = a[0];
rng (i, 1, n) {
sum[i] = a[i] + sum[i - 1];
}
vl parity_sum(n);
parity_sum[0] = a[0];
parity_sum[1] = a[1];
rng (i, 2, n) {
parity_sum[i] = a[i] + parity_sum[i - 2];
}
rep (q) {
int x;
scan(x);
if (a.back() <= x) {
println(parity_sum[n - 1]);
} else if (a.front() >= x) {
println(sum[n - 1] - sum[n/2 - 1]);
} else {
// A[1] < X < A[n]
// 设Aoki拿走的最大的数是y且y>X且y是第i大的，那么这个数是Aoki拿的第i-1个数，换言之[2X-y,y]之间共有i-1个数。
auto index = UB(a, x);
// max i s.t. num[2x-a[i],a[i]] <= n - i - 1
int l = index - 1, r = n - 1;
while (l + 1 < r) {
int mid = get_mid(l, r);
int at_most = n - 1 - mid;
auto t = LB(a, 2 * x - a[mid]);
int taken = mid - t + 1;
if (taken <= at_most) {
l = mid;
} else {
r = mid;
}
}
ll ans = sum[n - 1] - sum[l];
int num = n - 1 - l;
if (n - 2 * num - 1 >= 0) {
ans += parity_sum[n - 2 * num - 1];
}
println(ans);
}
}
#if defined LOCAL && !defined DUIPAI
cout << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
return 0;
}
|
p03158 | C++ | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
ll num[100005]={0};
ll rsum[100005]={0},gsum[100005]={0};
int main(){
ll n,q;
cin>>n>>q;
for(int i=n-1;i>=0;i--) cin>>num[i];
for(int i=0;i<n;i++){
if(i==0) rsum[i]=num[i];
else rsum[i]=rsum[i-1]+num[i];
}
for(int i=0;i<n;i+=2){
if(i==0) gsum[i]=num[i];
else gsum[i]=gsum[i-2]+num[i];
}
for(int i=1;i<n;i+=2){
gsum[i]=gsum[i-1];
}
// for(int i=0;i<n;i++) cout<<rsum[i]<<" "<<gsum[i]<<endl;
vector<ll> border,ans;
if(n%2==1){
ans.push_back(rsum[n/2]);
border.push_back(0);
}
for(int i=n/2;i>0;i--){
border.push_back((num[i]+num[2*i])/2+1);
ans.push_back(rsum[i-1]+gsum[n-1]-gsum[2*i-1]);
}
// for(int i=0;i<ans.size();i++) cout<<border[i]<<" "<<ans[i]<<endl;
for(int i=0;i<q;i++){
ll kn;
cin>>kn;
ll pos=upper_bound(border.begin(),border.end(),kn)-border.begin();
if(pos==0) cout<<rsum[(n-1)/2]<<endl;
else cout<<ans[pos-1]<<endl;
}
}
|
p03158 | C++ | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define MOD 1000000007
#define MOD2 998244353
#define int long long
//#define PI 3.14159265358979
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
template < typename T >
ostream &operator<<(ostream &os, const vector< T > &A) {
for (int i = 0; i < A.size(); i++)
os << A[i] << " ";
os << endl;
return os;
}
template <>
ostream &operator<<(ostream &os, const vector< vector< int > > &A) {
int N = A.size();
int M;
if (N > 0)
M = A[0].size();
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++)
os << A[i][j] << " ";
os << endl;
}
return os;
}
typedef pair< int, int > pii;
typedef long long ll;
struct edge {
int from, to, d, c;
edge(int _from = 0, int _to = 0, int _d = 0, int _c = 0) {
from = _from;
to = _to;
d = _d;
c = _c;
}
bool operator<(const edge &rhs) const {
return (d == rhs.d) ? (c < rhs.c) : (d < rhs.d);
}
};
struct aabb {
int x1, y1, x2, y2;
aabb(int x1, int y1, int x2, int y2) : x1(x1), y1(y1), x2(x2), y2(y2) {}
};
typedef vector< edge > edges;
typedef vector< edges > graph;
struct flow {
int to, cap, rev, cost;
flow(int to = 0, int cap = 0, int rev = 0, int cost = 0) : to(to), cap(cap), rev(rev), cost(cost) {}
};
typedef vector< vector< flow > > flows;
const int di[4] = {0, -1, 0, 1};
const int dj[4] = {-1, 0, 1, 0};
const int ci[5] = {0, 0, -1, 0, 1};
const int cj[5] = {0, -1, 0, 1, 0};
const ll LINF = LLONG_MAX / 2;
const int INF = INT_MAX / 2;
const double PI = acos(-1);
int pow2(int n) { return 1 << n; }
template < typename T, typename U >
bool chmin(T &x, const U &y) {
if (x > y) {
x = y;
return true;
}
return false;
}
template < typename T, typename U >
bool chmax(T &x, const U &y) {
if (x < y) {
x = y;
return true;
}
return false;
}
struct initializer {
initializer() {
cout << fixed << setprecision(11);
}
};
initializer _____;
int N, M, K, T, Q;
signed main() {
cin >> N >> Q;
vector< int > A(N);
rep(i, N) cin >> A[i];
vector< int > sum(N + 1, 0), sum2(N + 1, 0);
rep(i, N) sum[i + 1] = sum[i] + A[i];
rep(i, N) sum2[i + 1] = (i > 0 ? sum2[i - 1] : 0) + A[i];
while (Q--) {
int x;
cin >> x;
int l = 0, r = N;
while (r - l > 1) {
int m = (l + r) / 2;
int b = (lower_bound(A.begin(), A.end(), x * 2 - A[m]) - A.begin());
if (m - b + 1 >= N - m) {
r = m;
} else {
l = m;
}
}
//cout << r << endl;
//cout << sum[N] << " " << sum[r] << endl;
int ans = sum[N] - sum[r] + ((r * 2 - N >= 0) ? sum2[r * 2 - N] : 0);
cout << ans << endl;
}
return 0;
} |
p03158 | C++ | #include <bits/stdc++.h>
#define SORT(x) sort((x).begin(), (x).end())
#define ALL(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < n; i++)
#define reps(i, m, n) for (ll i = m; i < n; i++)
#define repr(i, m, n) for (ll i = m; i >= n; i--)
#define de(x) cout << #x << "=" << x << endl;
template <class T> bool maxi(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool mini(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
#define INF2 1000000000000000037
#define INF 1000000007
#define MOD 1000000007
#define PI (acos(-1))
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll,ll>;
//--GLOBAL---------------------------------
//--MAIN-----------------------------------
void Main() {
ll N,Q; cin>>N>>Q;
vector<ll> A(N);
rep(i,N) cin>>A[i];
if(N%2) A.emplace_back(-INF),++N;
sort(ALL(A),greater<ll>());
ll mae[N/2+1]={};
ll usiro[N/2+1]={};
ll kei[N/2+1]={};
reps(i,1,N/2+1){
mae[i]=mae[i-1]+A[i-1];
usiro[i]=usiro[i-1]+A[N-2*i];
}
rep(i,N/2+1){
kei[i]=mae[i]+usiro[N/2-i];
}
rep(i,Q){
ll x; cin>>x;
/*bis*/ ll low= 0 , high= N/2+1 ; // min-1, max+1
while( abs(high-low)>1 ){ ll mid=(high+low)/2;
bool ok=true;
ll r=A[mid-1];
if(r<=x) ok=false;
r=x+x-r;
if(A[2*mid-2]<r) ok=false;
( ok ? low : high ) = mid;
}// if ok, okdir = mid
cout<< kei[low] <<"\n";
}
}
//--START----------------------------------
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(15);
Main();
}
//-----------------------------------------
|
p03158 | C++ | #pragma target("avx")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef unordered_map<ll, ll> U_MAP;
typedef priority_queue<ll> pq;
typedef priority_queue<ll, vector<ll>, greater<ll>> rpq;
const int INF = 1e9, MOD = 1e9 + 7, ohara = 1e6 + 10;
const ll LINF = 1e18;
#define rep(i, n) for (ll(i) = 0; (i) < (int)(n); (i)++)
#define rrep(i, a, b) for (ll i = (a); i < (b); i++)
#define rrrep(i, a, b) for (ll i = (a); i >= (b); i--)
#define all(v) (v).begin(), (v).end()
#define Size(n) (n).size()
#define Cout(x) cout << (x) << endl
#define doublecout(a) cout << fixed << setprecision(15) << a << endl;
#define fi first
#define se second
#define m_p make_pair
#define p_b push_back
//------ Believe yourself as a genius!!!!!! ------
int dy[] = {1, 0, -1, 0};
int dx[] = {0, 1, 0, -1};
// int dy[]={-1,0,1,-1,1,-1,0,1};int dx[]={-1,-1,-1,0,0,1,1,1};
string alph("abcdefghijklmnopqrstuvwxyz"), s;
ll n, cnt, ans, a[ohara], b, c, d, tmp, m, h, w, x, y, sum, k, q;
ll sumrev[ohara], odd[ohara], even[ohara];
bool check(ll ind, ll x) {
ll takahasi = n - 1 - ind, aoki;
ll le = 0, ri = ind, mid;
ll kage = x - (a[ind] - x);
while (ri - le > 1) {
mid = (le + ri) / 2;
if (a[mid] < kage)
le = mid;
else
ri = mid;
}
rrep(i, max(le - 2, 0LL), min(ri + 3, n)) {
if (a[i] >= kage) {
aoki = ind - i + 1;
tmp = ind - takahasi + 1;
break;
}
}
// if (a[ind] == 11) Cout(aoki);
// Cout(a[ind]);
if (aoki > takahasi)
return false;
else
return true;
}
int main(void) {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
cin >> n >> q;
rep(i, n) cin >> a[i];
rep(i, n) {
sumrev[i] = a[i];
if (i % 2 == 0)
even[i] = a[i];
else
odd[i] = a[i];
}
rrrep(i, n - 2, 0) sumrev[i] += sumrev[i + 1];
rrep(i, 1, n) even[i] += even[i - 1], odd[i] += odd[i - 1];
rep(i, q) {
cin >> x;
ll le = 0, ri = n - 1, mid;
while (ri - le > 1) {
mid = (le + ri) / 2;
if (a[mid] > x)
ri = mid;
else
le = mid;
}
tmp = n - 1;
rrep(j, max(le - 2, 0LL), min(ri + 3, n)) {
if (a[j] > x) {
tmp = j;
break;
}
}
if (tmp == n - 1) {
if (tmp % 2 == 0)
Cout(even[tmp]);
else
Cout(odd[tmp]);
} else {
le = tmp, ri = n - 1, mid;
while (ri - le > 1) {
mid = (le + ri) / 2;
if (check(mid, x))
le = mid;
else
ri = mid;
}
rrrep(j, min(ri + 2, n - 1), max(le - 2, 0LL)) {
if (check(j, x)) {
ans = sumrev[j + 1];
// Cout(j);
tmp--;
if (tmp >= 0) {
if (tmp % 2 == 0)
ans += even[tmp];
else
ans += odd[tmp];
}
break;
}
}
Cout(ans);
}
}
return 0;
} |
p03158 | C++ | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
int main()
{
int n, q;
cin >> n >> q;
ll a[100002];
for(int i = 0; i < n; i++){
cin >> a[i];
a[i] *= 2;
}
reverse(a, a + n);
if(n % 2){
a[n] = 0;
n++;
}
ll ans[100002];
for(int i = 0; i < n; i += 2) ans[0] += a[i];
for(int i = 1; i < n / 2; i++) ans[i] = ans[i - 1] + a[i] - a[i * 2];
ll d[100002];
for(int i = 1; i < n / 2; i++) d[i - 1] = -(a[i] + a[i * 2]) / 2;
for(int i = 0; i < q; i++){
ll x;
cin >> x;
x *= 2;
cout << ans[upper_bound(d, d + n / 2, -x) - d] / 2 << endl;
}
} |
p03158 | C++ | #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll pre[100005];
ll even[100005];
ll A[100005];
ll N, Q;
ll ask;
int main() {
// freopen("inp", "r", stdin);
cin >> N >> Q;
A[0] = -1000000000000000LL;
for(ll i = 1; i <= N; i++){
cin >> A[i];
}
for(ll i = 1; i <= N; i++){
pre[i] = pre[i-1] + A[i];
if(i&1)even[i] = even[i-1];
else even[i] = even[i-1] + A[i];
}
while(Q--){
cin >> ask;
if(ask >= A[N-1]){
if(N&1)cout << pre[N] - even[N] << "\n";
else cout << even[N] << "\n";
continue;
}
ll pos = lower_bound(A+1, A+N+1, ask) - A;
ll l = pos-1, r = N;
while(r-l>1){
ll mid = (l+r)>>1;
ll Taka = N-mid+1;
ll Aoki = mid - (lower_bound(A, A+N+1, (ask<<1)-A[mid]) - A);
if(Taka - Aoki <= 1)r = mid;
else l = mid;
}
ll ans = pre[N] - pre[r-1];
pos = N-((N-r+1)<<1);
ans += (pos&1 ? pre[pos] - even[pos] : even[pos]);
cout << ans << "\n";
}
} |
p03158 | C++ | #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll pre[100005];
ll even[100005];
ll A[100005];
ll N, Q;
ll ask;
int main() {
// freopen("inp", "r", stdin);
cin >> N >> Q;
A[0] = -1000000000000000LL;
for(ll i = 1; i <= N; i++){
cin >> A[i];
}
for(ll i = 1; i <= N; i++){
pre[i] = pre[i-1] + A[i];
if(i&1)even[i] = even[i-1];
else even[i] = even[i-1] + A[i];
}
while(Q--){
cin >> ask;
if(ask >= A[N-1]){
if(N&1)cout << pre[N] - even[N] << "\n";
else cout << even[N] << "\n";
continue;
}
ll pos = lower_bound(A+1, A+N+1, ask) - A;
ll l = pos-1, r = N;
while(r-l>1){
ll mid = (l+r)>>1;
ll Taka = N-mid+1;
ll Aoki = mid - (lower_bound(A, A+N+1, (ask<<1)-A[mid]) - A);
if(Taka - Aoki <= 1)r = mid;
else l = mid;
}
ll ans = pre[N] - pre[r-1];
pos = N-((N-r+1)<<1);
ans += (pos&1 ? pre[pos] - even[pos] : even[pos]);
cout << ans << "\n";
}
} |
p03158 | C++ | #include <iostream>
using namespace std;
using lint = long long;
int main() {
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
int N, Q;
static lint A[100005] = {}, SUM[2][100005] = {}, diff[100005];
cin >> N >> Q;
for (int i = 0; i < N; i++) {
cin >> A[i];
SUM[i % 2][i] = A[i];
}
A[N] = 1e16;
for (int i = 1; i < N; i++) {
SUM[0][i] += SUM[0][i - 1];
SUM[1][i] += SUM[1][i - 1];
}
for (int i = 0; i < Q; i++) {
lint X;
cin >> X;
lint le = 0, ri = N;
lint len = 0;
while (le <= ri) {
lint mid = (le + ri) / 2;
if (abs(A[N - mid] - X) > abs(A[N - (mid + 1) / 2] - X)) {
ri = mid - 1;
} else {
len = mid;
le = mid + 1;
}
}
lint ans = SUM[0][N - 1] + SUM[1][N - 1];
if (N - (len + 1) / 2 > 0) {
ans -= SUM[0][N - (len + 1) / 2 - 1] + SUM[1][N - (len + 1) / 2 - 1];
}
lint take = (N - (len + 1) / 2) - (N - len);
if (take < (N - (N - (len + 1) / 2))) {
if (N - len - 1 >= 0) {
ans += SUM[(N - len) % 2][N - len - 1];
}
} else {
if (N - len - 1 >= 0) {
ans += SUM[(N - len + 1) % 2][N - len - 1];
}
}
cout << ans << "\n";
}
return 0;
}
|
p03158 | C++ | #include <iostream>
using namespace std;
using lint = long long;
int main() {
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
int N, Q;
static lint A[100005] = {}, SUM[2][100005] = {}, diff[100005];
cin >> N >> Q;
for (int i = 0; i < N; i++) {
cin >> A[i];
SUM[i % 2][i] = A[i];
}
A[N] = 1e16;
for (int i = 1; i < N; i++) {
SUM[0][i] += SUM[0][i - 1];
SUM[1][i] += SUM[1][i - 1];
}
for (int i = 0; i < Q; i++) {
lint X;
cin >> X;
lint le = 0, ri = N;
lint len = 0;
while (le <= ri) {
lint mid = (le + ri) / 2;
if (abs(A[N - mid] - X) > abs(A[N - (mid + 1) / 2] - X)) {
ri = mid - 1;
// len = mid;
} else {
len = mid;
le = mid + 1;
}
}
lint ans = SUM[0][N - 1] + SUM[1][N - 1];
if (N - (len + 1) / 2 > 0) {
ans -= SUM[0][N - (len + 1) / 2 - 1] + SUM[1][N - (len + 1) / 2 - 1];
}
lint take = (N - (len + 1) / 2) - (N - len);
if (take < (N - (N - (len + 1) / 2))) {
if (N - len - 2 >= 0) {
ans += SUM[(N - len) % 2][N - len - 1];
}
} else {
if (N - len - 1 >= 0) {
ans += SUM[(N - len + 1) % 2][N - len - 1];
}
}
cout << ans << "\n";
}
return 0;
}
|
p03158 | C++ | #include<bits/stdc++.h>
using namespace std;
#define ll long long
vector<ll>v, sum, odd;
int n, q;
void init(){
v.resize(n+1);
sum.resize(n+1);
odd.resize(n+1);
sum[0]=0ll; odd[0]=0ll;
}
int main(){
scanf("%d %d", &n, &q);
init();
for(int i=0; i<n; i++){
scanf("%lld", &v[i]);
sum[i+1]=sum[i]+v[i];
odd[i+1]=odd[i]+(i%2==1? v[i]:0ll);
}
v[n]=1e9+1;
for(int qq=0; qq<q; qq++){
int x; scanf("%d", &x);
int l=0, r=n, md;
while(l+1<r){
int md=(l+r)/2;
if(n<=2*md || x-v[n-2*md-1]>v[n-md-1]-x)
r=md;
else l=md;
}
if(n<=2*l || x-v[n-2*l-1]>v[n-l-1]-x) r=0;
else{
r=1; l++;
}
ll ans=sum[n]-sum[n-l];
if(n%2==1){
ans+=sum[n-2*l+r]-odd[n-2*l+r];
}else{
ans+=odd[n-2*l+r];
}
printf("%lld\n", ans);
}
return 0;
} |
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
#define Rep(i,n) for(int i=0;i<(int)(n);i++)
#define For(i,n1,n2) for(int i=(int)(n1);i<(int)(n2);i++)
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define RREP(i,n) for(ll i=((ll)(n)-1);i>=0;i--)
#define FOR(i,n1,n2) for(ll i=(ll)(n1);i<(ll)(n2);i++)
#define RFOR(i,n1,n2) for(ll i=((ll)(n1)-1);i>=(ll)(n2);i--)
#define all(a) (a).begin(),(a).end()
#define SORT(a) sort((a).begin(),(a).end())
#define oorret 0
#define oor(x) [&](){try{x;} catch(const out_of_range& oor){return oorret;} return x;}()
#define IOS cin.tie(0),ios::sync_with_stdio(false)
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
template<typename T1, typename T2> inline bool chmin(T1& a, T2 b) { if (a > b) { a = b; return 1; }return 0; }
template<typename T1, typename T2> inline bool chmax(T1& a, T2 b) { if (a < b) { a = b; return 1; }return 0; }
template<class Type>struct is_vector : std::false_type {};
template<class ValueType, class Alloc>struct is_vector<std::vector<ValueType, Alloc>> : std::true_type {};
template <typename T> inline ostream& operator << (ostream& out, const vector<T>& v) {
if (v.empty())return out;
constexpr bool is_vector_v = is_vector<T>::value;
if (is_vector_v)for (auto itr = v.begin(); itr != v.end();)out << (*itr), out << ((++itr != v.end()) ? "\n" : "");
else for (auto itr = v.begin(); itr != v.end();)out << (*itr), out << ((++itr != v.end()) ? " " : "");
return out;
}
inline void put() {}
template<class T> inline void put(const T& first) { std::cout << first << "\n"; }
template<class T, class... N> inline void put(const T& first, const N& ... rest) { std::cout << first << " "; put(rest...); }
inline void putn() {}
template<class T, class... N> inline void putn(const T& first, const N& ... rest) { std::cout << first << "\n"; putn(rest...); }
int main() {
IOS;
int n, q;
cin >> n >> q;
vector<int> a(n),b(n,0);
vector<ll> se((n + 1) / 2 + 1, 0), so(n / 2 + 1, 0), s(n + 1, 0), res(q, 0);
REP(i, n) {
cin >> a[i];
b[i] = a[i];
if (i % 2 == 0) {
se[i / 2 + 1] = se[i / 2] + a[i];
} else {
so[i / 2 + 1] = so[i / 2] + a[i];
}
s[i + 1] = s[i] + a[i];
}
reverse(all(b));
REP(i, n) {
b.push_back(0);
}
REP(i, q) {
int x;
cin >> x;
int lb = -1, ub = n-1;
while (ub - lb > 1) {
int mid = (lb + ub) / 2;
if (b[mid] + b[mid * 2] < 2 * x) {
ub = mid;
} else {
lb = mid;
}
}
int l = ub;
ll temp = 0;
if (l * 2 >= n) {
temp += s[n / 2];
} else {
temp += s[n - l] - s[n - l * 2];
if (n % 2 == 0) {
temp += se[(n - l * 2) / 2];
} else {
temp += so[(n - l * 2) / 2];
}
}
res[i] = s[n] - temp;
}
REP(i, q) {
put(res[i]);
}
return 0;
}
|
p03158 | C++ | #include "bits/stdc++.h"
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
const int INF = 1e9;
int main() {
int N, Q;
cin >> N >> Q;
vector<ll> A(N + N % 2, 0);
rep(i, N) cin >> A[N % 2 + i];
N += N % 2;
vector<ll> s1(N + 1, 0), s2(N + 2, 0);
rep(i, N) {
s1[i + 1] = s1[i] + A[i];
s2[i + 2] = s2[i] + A[i];
}
vector<ll> ans1(0), ans2(0);
rep(i, N / 2) {
ans1.push_back(A[i * 2 + 1] + A[N / 2 + i]);
ans2.push_back(s1[N] - s1[N / 2 + i] + s2[i * 2 + 1]);
}
ans1.push_back(2e9);
ans2.push_back(s2[N + 1]);
vector<ll> X(Q);
rep(i, Q) cin >> X[i];
rep(i, Q) {
int j = lower_bound(ans1.begin(), ans1.end(), X[i] * 2) - ans1.begin();
cout << ans2[j] << endl;
}
/*
rep(i, N / 2) cout << ans1[i] << " ";
cout << endl;
rep(i, N / 2) cout << ans2[i] << " ";
cout << endl;
*/
} |
p03158 | C++ | #include <iostream> // cin, cout, cerr
#include <algorithm> // minmax, sort, swap
#include <numeric> // iota
#include <cstdio> // printf, scanf
#include <string> // string, stoi, to_string
#include <vector> // vector
#include <queue> // queue, priority_queue
#include <deque> // deque
#include <map> // key-value pairs sorted by keys
#include <set> // set
#include <iomanip> // cout<<setprecision(n)
#include <functional> // function<void(int)>
#ifdef DEBUG
#include "debug.hpp"
#else
#define debug(...)
#endif
#define int long long // at least int64 > 9*10^18
#define ENDL '\n'
#define rep(i,n) for(int i = 0; i < (n); i++)
#define print(i) std::cout << (i) << '\n'
#define all(v) (v).begin(), (v).end()
/* libraries */
signed main() {
int n,q;
std::cin >> n >> q;
std::vector<int> a(n);
rep(i,n) std::cin >> a[i];
std::vector<int> alternate(n+1,0);
std::vector<int> ac(n+1,0);
rep(i,n) {
ac[i+1] = ac[i] + a[i];
alternate[i+1] = alternate[i] + ((i+n)%2?a[i]:0);
}
debug(ac,alternate);
rep(xxx,q) {
int x;
std::cin >> x;
int l=0;int r=n;
while(r-l>1) {
int mid = (l+r)/2;
if(n-mid*2-1<0 || std::abs(x-a[n-mid-1])<std::abs(x-a[n-2*mid-1])) r=mid;
else l=mid;
}
print(alternate[std::max(0ll,n-2*r)]+ac[n]-ac[n-r]);
}
return 0;
}
|
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N, Q; cin >> N >> Q;
vector<int> v(N);
for (int i = 0; i < N; i++) cin >> v[i];
vector<ll> sum(N+1), sum2(N+1);
sum[1] = sum2[1] = v[0];
for (int i = 2; i < N+1; i++) {
sum[i] = sum[i-1] + v[i-1];
sum2[i] = sum2[i-2] + v[i-1];
}
map<int, ll> m;
m[0] = sum[N/2];
int l = 0, r = N/2;
for (; l < r;) {
if (r - l > N - 1 - r) {
l++; continue;
}
int thr = (v[r] + v[l]) / 2 + 1;
ll s = sum[r+1] - sum[l+1];
s += sum2[l];
m[thr] = s;
r++;
}
while (Q--) {
int x; cin >> x;
cout << sum[N] - (--m.upper_bound(x))->second << endl;
}
} |
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N, Q; cin >> N >> Q;
vector<int> v(N);
for (int i = 0; i < N; i++) cin >> v[i];
vector<ll> sum(N+1), sum2(N+1);
sum[1] = sum2[1] = v[0];
for (int i = 2; i < N+1; i++) {
sum[i] = sum[i-1] + v[i-1];
sum2[i] = sum2[i-2] + v[i-1];
}
map<int, ll> m;
m[0] = sum[N/2];
int l = 0, r = N/2;
for (; l < r;) {
if (r - l > N - 1 - r) {
l++; continue;
}
int thr = (v[r] + v[l]) / 2 + 1;
ll s = sum[r+1] - sum[l+1];
s += sum2[l];
// cout << l << " " << r << " " << thr << " " << s << endl;
m[thr-1] = s;
r++;
}
for (auto p : m) {
// cout << p.first << " " << p.second << endl;
}
while (Q--) {
int x; cin >> x;
cout << sum[N] - (--m.lower_bound(x))->second << endl;
}
} |
p03158 | C++ | #include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define Task ""
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 5;
int a[maxn], N, Q;
int x;
ll sum[maxn], hsum[maxn];
int pos;
bool check(int posr)
{
int numr = N - posr + 1;
int numl = posr - (lower_bound(a+1, a+1+N, 2*x-a[posr]) - a);
if (numr - numl <= 1) return true;
return false;
}
void solve(void)
{
cin >> x;
pos = lower_bound(a+1, a+1+N, x) - a;
int l = pos-1, r=N, mid;
while (l <= r){
mid = (l + r) / 2;
if (check(mid)) r = mid - 1;
else l = mid + 1;
}
ll res = sum[N] - sum[l-1];
int len = N - l + 1;
int posl = l-1 - len;
res += hsum[posl];
cout << res;
}
signed main(void)
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
if (fopen("A.INP", "r")){
freopen("A.INP", "r", stdin);
freopen("A.OUT", "w", stdout);
}
if (fopen(Task".INP", "r")){
freopen(Task".INP", "r", stdin);
freopen(Task".OUT", "w", stdout);
}
cin >> N >> Q;
for (int i=1; i<=N; ++i){
cin >> a[i];
}
sort(a+1, a+1+N);
for (int i=1; i<=N; ++i){
sum[i] = sum[i-1] + a[i];
hsum[i] = a[i];
if (i >= 2) hsum[i] += hsum[i-2];
}
while (Q--){
solve();
cout << '\n';
}
}
|
p03158 | C++ | #include "bits/stdc++.h"
using namespace std;
int main() {
long long N, Q;
static long long A[100000], SUM[2][100010] = {};
cin >> N >> Q;
for (int i = 0; i < N; i++) cin >> A[i];
for (int i = 0; i < N; i++) {
SUM[i % 2][i + 1] = SUM[i % 2][i] + A[i];
SUM[(i + 1) % 2][i + 1] = SUM[(i + 1) % 2][i];
}
for (int i = 0; i < Q; i++) {
long long X;
cin >> X;
long long L = 1, R = N + 1;
while (R - L > 1) {
long long MID = (L + R) / 2;
if (abs(A[N - (MID + 1) / 2] - X) < abs(A[N - MID] - X)) R = MID;
else L = MID;
}
long long B1 = N - L, B2 = N - (L + 1) / 2;
long long ANS = (SUM[0][N] + SUM[1][N]) - (SUM[0][B2] + SUM[1][B2]);
ANS += SUM[(N + 1) % 2][B1];
cout << ANS << endl;
}
} |
p03158 | C++ | #include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <vector>
using namespace std;
#define l first
#define r second
#define int long long
int n, m;
int a[500000];
long long ss[500000];
long long kek[500000];
vector<pair<int, int> > sigma;
signed main()
{
cin >> n >> m;
if (n % 2 == 1)
{
for (int i = 1; i <= n; i++) cin >> a[i], a[i] *= 2;
n++;
}
else
{
for (int i = 0; i < n; i++) cin >> a[i], a[i] *= 2;
}
for (int i = n - 1; i >= 0; i--)
{
ss[i] = ss[i + 1];
ss[i] += a[i];
}
for (int i = 0; i < n; i++)
{
kek[i] = kek[i - 2] + a[i];
}
sigma.push_back({2000000000, 2});
int p1 = n - 3, p2 = n - 2, id = 4;
while (p1 > 0)
{
sigma.push_back({a[p1] / 2 + a[p2] / 2, id});
p1 -= 2, p2 -= 1, id += 2;
}
reverse(sigma.begin(), sigma.end());
for (int i = 0; i < sigma.size(); i++)
{
;//cout << sigma[i].first << " " << sigma[i].second << endl;
}
for (int i = 0; i < m; i++)
{
int k;
cin >> k, k *= 2;
int l = -1, r = sigma.size() - 1;
while (l + 1 < r)
{
int mid = (l + r) / 2;
if (k <= sigma[mid].first) r = mid;
else l = mid;
}
cout << kek[n - sigma[r].second - 1] / 2 + ss[n - sigma[r].second / 2] / 2 << "\n";
}
}
|
p03158 | C++ | //Thanks to kmjp
#include <bits/stdc++.h>
// #include <iostream> // cout, endl, cin
// #include <string> // string, to_string, stoi
// #include <vector> // vector
// #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
// #include <utility> // pair, make_pair
// #include <tuple> // tuple, make_tuple
// #include <cstdint> // int64_t, int*_t
// #include <cstdio> // printf
// #include <map> // map
// #include <queue> // queue, priority_queue
// #include <set> // set
// #include <stack> // stack
// #include <deque> // deque
// #include <unordered_map> // unordered_map
// #include <unordered_set> // unordered_set
// #include <bitset> // bitset
// #include <climits>
// #include <cmath>
// #include <iomanip>
// #include <functional>
// #include <numeric>
// #include <random>
using namespace std;
#define int long long
#define pb push_back
// #define F first
// #define S second
#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()
#define rall(a) (a).rbegin(),(a).rend()
#define ve vector
#define vi vector<int>
#define vp vector<pair<int,int>>
#define vvi vector<vector<int>>
template<typename T> using pq = priority_queue<T,vector<T>,greater<T>>;
using ll = long long;
ll INF = LLONG_MAX / 4000 - 100;
ll mod = 1e9 + 7;
int dx[] = {-1,0,1,0}, dy[] = {0,1,0,-1};
vector<ll> prime;
double pi = 3.141592653689793238;
class fact {
public:
int fmod = 1e9+7;
vector<int> fac, finv, inv;
fact (int n, int Mod = 1e9+7) {
fmod = Mod;
fac = vector<int>(n + 1, 0);
finv = vector<int>(n + 1, 0);
inv = vector<int>(n + 1, 0);
fac[0] = 1; for (int i = 1; i < n + 1; i++) fac[i] = fac[i-1] * i % fmod;
for (int i = 0;i < n + 1;i++) finv[i] = fact::POW(fac[i], fmod-2);
for (int i = 0;i < n + 1;i++) inv[i] = POW(i, fmod-2);
}
ll nCr(ll n, ll r) {if(n < r) return 0; return (fac[n] * finv[r] % fmod) * finv[n-r] % fmod;}
ll POW(ll a, ll b) {ll c = 1; while (b > 0) {if (b & 1) {c = a * c%fmod;}a = a * a%fmod; b >>= 1;}return c;}
inline int operator [] (int i) {return fac[i];}
};
void DEBUG(vector<int> a) {for(int i=0;i<a.size();i++)cout<<a[i]<<" ";cout<<endl;}
void EMP(int x) {cout<<"!!!"<<x<<"!!!"<<endl;}
ll GCD(ll a, ll b) {ll c; while (b != 0) {c = a % b; a = b; b = c;}return a;}
ll LCM(ll a, ll b) {return (a / GCD(a, b)) * (b / GCD(a, b)) * GCD(a, b);}
ll POW(ll a, ll b) {ll c = 1; while (b > 0) {if (b & 1) {c = a * c%mod;}a = a * a%mod; b >>= 1;}return c;}
void PRI(ll n) {bool a[n + 1LL]; for (int i = 0; i < n + 1LL; i++) {a[i] = 1LL;}for (int i = 2; i < n + 1LL; i++) {if (a[i]) {prime.pb(i); ll b = i; while (b <= n) {a[b] = 0; b += i;}}}}
template <typename T> T chmin(T& a, T b) {if(a>b)a=b;return a;}
template <typename T> T chmax(T& a, T b) {if(a<b)a=b;return b;}
bool isSqrt(ll a) {return pow(sqrt(a),2) == a ? 1 : 0;}
void YesNo(bool a) {if (a) cout << "Yes"; else cout << "No"; cout << endl;}
void yesno(bool a) {if (a) cout << "yes"; else cout << "no"; cout << endl;}
void YESNO(bool a) {if (a) cout << "YES"; else cout << "NO"; cout << endl;}
double dis(int x1, int x2, int y1, int y2) {
return sqrt((double)abs(x1-x2)*(double)abs(x1-x2)+(double)abs(y1-y2)*(double)abs(y1-y2));
}
int ceili(int x, int y) {
if (x % y == 0) return x / y;
else return x / y + 1;
}
long long extGCD(long long a, long long b, long long &x, long long &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
long long d = extGCD(b, a % b, y, x);
y -= a / b * x;
return d;
}
int A[100005];
int S[100005];
int T[100005];
int N, Q, X;
bool ok(int v) {
if (v > N) return false;
int fmv = (v + 1) / 2;
int idx = N - fmv;
int x = lower_bound(A, A+N, X - (A[idx] - X)) - A;
return (x + v <= N);
}
void solve() {
cin >> N >> Q;
rep (i, N) {
cin >> A[i];
S[i + 1] = S[i] + A[i];
T[i + 1] = (i?T[i - 1]:0) + A[i];
}
while (Q--) {
cin >> X;
int l = 1, r = 100007;
while (r - l > 1) {
int m = (r + l) / 2;
if (ok(m)) l = m;
else r = m;
}
l += (l & 1);
int ans = S[N] - S[N - l / 2];
if (l <= N) ans += T[N - l];
cout << ans << endl;
}
return;
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
} |
p03158 | C++ | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cfloat>
#include <complex>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <string.h>
#include <time.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<=n;i++)
#define int long long
#define ll long long
#define eps LDBL_EPSILON
#define mod (int)1000000007
#define INF LLONG_MAX/10
#define P pair<int,int>
#define prique priority_queue
using namespace std;
int gcd(int a, int b) {
if (!b)return a;
return gcd(b, a % b);
}
int lcm(int a, int b) {
return a / gcd(a, b) * b;
}
bool isprime(int n) {
if (n == 1)return false;
for (int i = 2; i * i <= n; i++) {
if (n % i == 0)return false;
}
return true;
}
int mypow(int a, int b) {
if (!b)return 1;
if (b % 2)return mypow(a, b - 1) * a;
int memo = mypow(a, b / 2);
return memo * memo;
}
int modpow(int a, int b, int m = mod) {
if (!b)return 1;
if (b % 2)return modpow(a, b - 1, m) * a % m;
int memo = modpow(a, b / 2, m);
return memo * memo % m;
}
class modInt {
int value, modulo;
public:
template<typename T>
constexpr modInt(T value = 0, int modulo = mod) : value(value), modulo(modulo) { value %= T(modulo); }
inline constexpr operator int()const { return value; }
inline constexpr modInt& operator+=(modInt x) {
value += x.value;
if (value >= modulo)value -= modulo;
return *this;
}
inline constexpr modInt& operator++() {
if (value == modulo - 1)value = 0;
else value++;
return *this;
}
inline constexpr modInt& operator-()const {
return modInt(0) -= *this;
}
inline constexpr modInt& operator-=(modInt x) {
value -= x.value;
if (value < 0)value += modulo;
return *this;
}
inline constexpr modInt& operator--() {
if (value == 0)value = modulo - 1;
else value--;
return *this;
}
inline constexpr modInt& operator*=(modInt x) {
value = value * x.value % mod;
return *this;
}
inline modInt& operator/=(modInt x) {
return operator*=(x.inv());
}
modInt pow(modInt x, int y) {
if (!y)return 1;
if (y & 1)return pow(x, y - 1);
modInt memo = pow(x, y / 2);
return memo * memo;
}
inline modInt inv() {
return pow(*this, modulo - 2);
}
template<typename T> modInt operator+(T x) { return modInt(*this) += x; }
template<typename T> modInt& operator+=(T x) { return modInt(*this) += modInt(x); }
template<typename T> modInt operator-(T x) { return modInt(*this) -= x; }
template<typename T> modInt& operator-=(T x) { return modInt(*this) -= modInt(x); }
template<typename T> modInt operator*(T x) { return modInt(*this) *= x; }
template<typename T> modInt& operator*=(T x) { return modInt(*this) *= modInt(x); }
template<typename T> modInt operator/(T x) { return modInt(*this) /= x; }
template<typename T> modInt& operator/=(T x) { return modInt(*this) /= modInt(x); }
};
istream& operator>>(istream ist, modInt& x) {
int a;
ist >> a;
x = a;
return ist;
}
class UnionFind {
int* par, * rank;
P* notparent;
vector<P>* size;
int opcount = 0;
public:
UnionFind(unsigned int size) {
par = new int[size + 1];
rank = new int[size + 1];
this->size = new vector<P>[size + 1];
notparent = new P[size + 1];
rep(i, size + 1) {
par[i] = i;
rank[i] = 0;
this->size[i].push_back(make_pair(-1, 1));
notparent[i] = make_pair(INF, i);
}
}
int find(int n, int t = INF) {
if (opcount <= t) {
if (par[n] == n)return n;
return par[n] = find(par[n]);
}
if (notparent[n].first <= t)return find(notparent[n].second, t);
return n;
}
void unite(int n, int m) {
n = find(n);
m = find(m);
if (n == m) {
opcount++;
return;
}
if (rank[n] < rank[m]) {
par[n] = m;
notparent[n] = make_pair(opcount, m);
size[m].push_back(make_pair(opcount, size[m].back().second + size[n].back().second));
}
else {
par[m] = n;
notparent[m] = make_pair(opcount, n);
size[n].push_back(make_pair(opcount, size[n].back().second + size[m].back().second));
if (rank[n] == rank[m])rank[n]++;
}
opcount++;
}
bool same(int n, int m, int t = INF) {
return find(n, t) == find(m, t);
}
int getsize(int n, int t = INF) {
n = find(n, t);
auto ite = lower_bound(size[n].begin(), size[n].end(), make_pair(t, (int)0));
if (ite == size[n].end())ite--;
if (t < (*ite).first)ite--;
return (*ite).second;
}
};
class RollingHash {
string s;
int n, m, base;
deque<int> has;
public:
RollingHash(string s, int m, int b) : n(s.size()), m(m), base(b) { init(s, m, b); }
void init(string s, int m, int b) {
n = s.size();
has.resize(n);
base = b;
this->s = s;
this->m = m;
rep(i, n) {
has[i] = (int)s[i];
if (i)has[i] += base * has[i - 1] % m;
has[i] %= m;
}
}
operator int() const {
return has.back();
}
void cut(int a, int b) {
assert(!(a >= b || a < 0 || n < b));
rep(i, a)has.pop_front();
rep(i, n - b)has.pop_back();
s = s.substr(a, b);
int memo = modpow(modpow(base, n - b, m), m - 2, m);
rep(i, b - a) {
has[i] *= memo;
has[i] %= mod;
}
n = b - a;
}
int query(int a, int b) {
assert(!(a >= b || a < 0 || n < b));
return (has[b - 1] - modpow(base, b - a, m) * (!a ? 0 : has[a - 1]) % m + m) % m;
}
int operator+(RollingHash t) {
assert(m == t.m && base == t.base);
return (has[n - 1] * modpow(base, t.n, m) % m + t.has[t.n - 1]) % m;
}
RollingHash& operator+=(string t) {
s += t;
has.resize(n + t.size());
for (int i = n; i < n + t.size(); i++) {
has[i] = (int)t[i] * base % m;
has[i] += base * has[i - 1] % m;
has[i] %= m;
}
n += t.size();
return *this;
}
};
template<typename T, typename U>
class SegTree {
int n = 1;
T* node = NULL;
U* lazy = NULL;
bool* lazyflag = NULL;
T nodee;
U lazye;
function<T(T, T)> nodef;
function<U(U, U)> lazyf;
function<T(int, T, U)> updf;
void eval(int k, int l, int r) {
if (lazyflag[k]) {
node[k] = updf(r - l, node[k], lazy[k]);
if (r - l > 1) {
lazyflag[2 * k + 1] = lazyflag[2 * k + 2] = true;
lazy[2 * k + 1] = lazyf(lazy[2 * k + 1], lazy[k]);
lazy[2 * k + 2] = lazyf(lazy[2 * k + 2], lazy[k]);
}
lazyflag[k] = false;
lazy[k] = lazye;
}
}
public:
SegTree(int m, int init, T nodee, U lazye, function<T(T, T)> nodef, function<U(U, U)> lazyf, function<T(int, T, U)> updf) :nodee(nodee), lazye(lazye), nodef(nodef), lazyf(lazyf), updf(updf) {
delete[] node;
delete[] lazy;
while (n < m)n *= 2;
node = new T[2 * n], lazy = new U[2 * n], lazyflag = new bool[2 * n];
rep(i, 2 * n) {
node[i] = init;
lazy[i] = lazye;
lazyflag[i] = false;
}
}
~SegTree() {
delete[] node;
delete[] lazy;
}
void update(int a, int b, U x, int k = 0, int l = 0, int r = -1) {
if (r == -1)r = n;
eval(k, l, r);
if (b <= l || r <= a)return;
if (a <= l && r <= b) {
lazyflag[k] = true;
lazy[k] = x;
eval(k, l, r);
}
else {
update(a, b, x, 2 * k + 1, l, (l + r) / 2);
update(a, b, x, 2 * k + 2, (l + r) / 2, r);
node[k] = nodef(node[2 * k + 1], node[2 * k + 2]);
}
}
T query(int a, int b, int k = 0, int l = 0, int r = -1) {
if (r == -1)r = n;
eval(k, l, r);
if (b <= l || r <= a)return nodee;
if (a <= l && r <= b)return node[k];
T vl = query(a, b, 2 * k + 1, l, (l + r) / 2);
T vr = query(a, b, 2 * k + 2, (l + r) / 2, r);
return nodef(vl, vr);
}
};
class Matrix {
int n;
vector<vector<int>> vec;
void Measure() {
rep(i, n) {
rep(j, n) {
if (i != j)vec[i][j] = 0;
else vec[i][j] = 1;
}
}
}
public:
Matrix(int n) {
this->n = n;
vec.resize(n, vector<int>(n));
}
Matrix(int n, vector<int> vec) {
if (vec.size() != n * n) {
cerr << "Invalid construct of matrix" << endl;
exit(1);
}
this->n = n;
this->vec.resize(n, vector<int>(n));
rep(i, n) {
rep(j, n)this->vec[i][j] = vec[i * n + j];
}
}
int operator[](int a) {
return vec[a / n][a % n];
}
unsigned int size() { return n; }
Matrix operator*(const Matrix a) {
if (this->n != a.n) {
cerr << "Invalid maltiply of matrix" << endl;
exit(1);
}
vector<int> memo(n);
rep(i, n) {
rep(j, n) {
rep(k, n) {
memo[j] += vec[i][k] * a.vec[k][j];
}
}
vec[i] = memo;
memo.clear();
memo.resize(n);
}
return *this;
}
Matrix letmod(int m = mod) {
rep(i, n) {
rep(j, n)vec[i][j] %= m;
}
return *this;
}
static Matrix measure(int n) {
Matrix res(n);
res.Measure();
return res;
}
static Matrix mypow(Matrix a, int b, int m = mod) {
a.letmod(m);
if (!b)return Matrix::measure(a.size());
if (b % 2)return (mypow(a, b - 1, m) * a).letmod(m);
Matrix memo = mypow(a, b / 2, m);
return (memo * memo).letmod(m);
}
};
class mycomplex {
double realvalue, imagvalue;
public:
mycomplex() :realvalue(0), imagvalue(0) {}
mycomplex(double realvalue, double imagvalue) : realvalue(realvalue), imagvalue(imagvalue) {}
mycomplex(double realvalue) : realvalue(realvalue), imagvalue(0) {}
mycomplex(complex<double> c) :realvalue(c.real()), imagvalue(c.imag()) {}
mycomplex(const mycomplex& rhs) :realvalue(rhs.realvalue), imagvalue(rhs.imagvalue) {}
double real()const { return this->realvalue; }
double imag()const { return this->imagvalue; }
double abs() { return hypot(realvalue, imagvalue); }
mycomplex& operator=(const mycomplex& obj) {
if (this != &obj) {
this->realvalue = obj.realvalue;
this->imagvalue = obj.imagvalue;
}
return *this;
}
mycomplex& operator=(mycomplex&& obj)noexcept {
if (this != &obj) {
this->realvalue = exchange(obj.realvalue, 0);
this->imagvalue = exchange(obj.imagvalue, 0);
}
return *this;
}
mycomplex& operator+=(const mycomplex& rhs) {
this->realvalue += rhs.realvalue;
this->imagvalue += rhs.imagvalue;
return *this;
}
friend mycomplex operator+(mycomplex lhs, const mycomplex& rhs) {
lhs += rhs;
return lhs;
}
mycomplex& operator-=(const mycomplex& rhs) {
this->realvalue -= rhs.realvalue;
this->imagvalue -= rhs.imagvalue;
return *this;
}
mycomplex& operator-=(const double& rhs) {
this->realvalue -= rhs;
return *this;
}
friend mycomplex operator-(mycomplex lhs, const mycomplex& rhs) {
lhs -= rhs;
return lhs;
}
mycomplex& operator*=(const mycomplex& rhs) {
double pastreal = this->realvalue;
this->realvalue = this->realvalue * rhs.realvalue - this->imagvalue * rhs.imagvalue;
this->imagvalue = pastreal * rhs.imagvalue + rhs.realvalue * this->imagvalue;
return *this;
}
friend mycomplex operator*(mycomplex lhs, const mycomplex& rhs) {
lhs *= rhs;
return lhs;
}
mycomplex& operator/=(const mycomplex& rhs) {
*this *= mycomplex(rhs.real(), -rhs.imag());
double dnm = rhs.real() * rhs.real() - rhs.imag() * rhs.imag();
this->realvalue /= dnm;
this->imagvalue /= dnm;
return *this;
}
friend mycomplex operator/(mycomplex lhs, const mycomplex& rhs) {
lhs /= rhs;
return lhs;
}
};
class FastFourierTransform {
private:
static void dft(vector<mycomplex>& func, int inverse) {
int sz = func.size();
if (sz == 1)return;
vector<mycomplex> veca, vecb;
rep(i, sz / 2) {
veca.push_back(func[2 * i]);
vecb.push_back(func[2 * i + 1]);
}
dft(veca, inverse); dft(vecb, inverse);
mycomplex now = 1, zeta = polar(1.0, inverse * 2.0 * acos(-1) / sz);
rep(i, sz) {
func[i] = veca[i % (sz / 2)] + now * vecb[i % (sz / 2)];
now *= zeta;
}
}
public:
template<typename T>
static vector<double> multiply(vector<T> f, vector<T> g) {
vector<mycomplex> nf, ng;
int sz = 1;
while (sz < f.size() + g.size())sz *= 2;
nf.resize(sz); ng.resize(sz);
rep(i, f.size()) {
nf[i] = f[i];
ng[i] = g[i];
}
dft(nf, 1);
dft(ng, 1);
rep(i, sz)nf[i] *= ng[i];
dft(nf, -1);
vector<double> res;
rep(i, sz)res.push_back(nf[i].real() / sz);
return res;
}
};
int n, q, a[100010], b[100010], c[100010], x;
signed main() {
cin >> n >> q;
rep(i, n) {
cin >> a[i];
c[i] = b[i] = a[i];
}
for (int i = 2; i < n; i++)b[i] += b[i - 2];
for (int i = n - 2; i >= 0; i--)c[i] += c[i + 1];
rep(i, q) {
cin >> x;
int ok = -2, ng = 1000000000;
while (ok + 1 < ng) {
int md = (ok + ng) / 2;
int l = lower_bound(a, a + n, x - md) - a, r = upper_bound(a, a + n, x + md) - a;
if (r - l <= n - r)ok = md;
else ng = md;
}
int l = lower_bound(a, a + n, x - ok) - a, r = upper_bound(a, a + n, x + ok) - a;
int nl = lower_bound(a, a + n, x - ng) - a, nr = upper_bound(a, a + n, x + ng) - a;
if (r - l + 1 < nr - nl && r - l + 1 <= n - r)l--;
if ((n - l) % 2 == 0 && l)cout << c[r] + b[l - 1] << endl;
else if ((n - l) % 2 && l >= 2)cout << c[r] + b[l - 2] << endl;
else cout << c[r] << endl;
}
return 0;
} |
p03158 | C++ | #include <iostream>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;
typedef long long ll;
ll n,q;
ll a[100005];
ll x[100005];
ll sum[100005];
ll ta[100005];
map<ll,ll> ans;
int main() {
cin >> n >> q;
int j = 0;
if(n & 1) {
j++;
n++;
}
for(; j < n; j++) cin >> a[j];
for(int i = 0; i < q; i++) cin >> x[i];
if(n == 2) {
for(int i = 0; i < q; i++) {
cout << a[1] << endl;
}
return 0;
}
sum[0] = a[0];
for(int i = 1; i < n; i++) sum[i] = sum[i-1] + a[i];
ta[1] = a[1];
for(int i = 3; i < n; i+=2) ta[i] = ta[i-2] + a[i];
//for(int i = 0; i < n; i++) cout << sum[i]<<" ";
//cout << endl;
// for(int i = 0; i < n; i++) cout << ta[i] <<" ";
//cout << endl;
for(int i = n - 2; i >= n/2; i--) {
int tmp = (a[i] + a[2*i-n+1]) / 2;
tmp++;
ll T = sum[n-1] - sum[i] + ta[2*i-n+1];
ans[tmp] = T;
}
ans[0] = sum[n-1] - sum[(n-1)/2];
/* for(auto itr = ans.begin(); itr != ans.end(); ++itr) {
cout << itr->first <<" "<<itr->second << endl;
}*/
for(int i = 0; i < q; i++) {
auto itr = ans.upper_bound(x[i]);
itr--;
cout << itr->second << endl;
}
}
|
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
// solve
int main(){
int N, Q;
scanf("%d %d", &N, &Q);
int A[100000] = {}, judge[50000] = {};
long long odd[100001] = {}, even[100001] = {};
for(size_t i = 0; i < N; ++i){
scanf("%d", &A[i]);
odd[i + 1] += odd[i];
even[i + 1] += even[i];
if(i & 1)odd[i + 1] += A[i];
else even[i + 1] += A[i];
}
int sz = (N + 1) / 2;
judge[sz - 1] = 1 << 30;
for(size_t i = 1; i < sz; ++i){
judge[sz - i - 1] = (A[N - i - 1] + A[N - i - i - 1]) >> 1;
}
while(Q--){
int X;
scanf("%d", &X);
int pos = (judge + sz) - lower_bound(judge, judge + sz, X);
long long ans = even[N] - even[N - pos] + odd[N] - odd[N - pos];
if(N & 1)ans += even[N - pos - pos + 1] - even[0];
else ans += odd[N - pos - pos + 1] - odd[0];
printf("%lld\n", ans);
}
}
|
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
// macros
#define overload_rep(va_0, va_1, va_2, name, ...) name
#define rep_0(i, n) for(int i = 0; i < (n); ++i)
#define rep_1(i, x, y) for(int i = (x); i <= (y); ++i)
#define rep(...) overload_rep(__VA_ARGS__, rep_1, rep_0)(__VA_ARGS__)
#define all(a) a.begin(), a.end()
#ifndef STOP_DEBUG
#define debug(...)\
do { cerr << boolalpha << "[" << #__VA_ARGS__ << "]:";\
debug_cerr(__VA_ARGS__); cerr << noboolalpha; } while (0)
#else
#define debug(...)
#endif
// functions
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
void debug_cerr(){ cerr << '\n'; }
template<class Head, class... Tail>
void debug_cerr(Head head, Tail... tail){
cerr << ' ' << head;
debug_cerr(tail...);
}
// cin/cout setup
struct IoSetup{
IoSetup(){
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} iosetup;
// libraries
// declarations
typedef long long lint;
constexpr int inf = 1 << 30;
// solve
int main(){
int N, Q;
cin >> N >> Q;
vector<lint> A(N);
rep(i, N)cin >> A[i];
vector<lint> even(N + 1, 0), odd(N + 1, 0);
rep(i, N){
even[i + 1] += even[i];
odd[i + 1] += odd[i];
if(i & 1)even[i + 1] += A[i];
else odd[i + 1] += A[i];
}
int sz = (N + 1) / 2;
vector<int> judge(sz);
judge[sz - 1] = inf;
rep(i, 1, sz - 1){
judge[sz - i - 1] = (A[N - i - 1] + A[N - i - i - 1]) / 2;
}
while(Q--){
int X;
cin >> X;
int pos = judge.end() - lower_bound(all(judge), X);
lint ans = even[N] - even[N - pos] + odd[N] - odd[N - pos];
if(N & 1)ans += odd[N - pos - pos + 1] - odd[0];
else ans += even[N - pos - pos + 1] - even[0];
cout << ans << '\n';
}
}
|
p03158 | C++ | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ll long long int
#define vl vector<ll>
#define vi vector<int>
const int INF = 2147483647;
const ll MOD = 1000000007;
using namespace std;
int main() {
int n, q;
cin >> n >> q;
vl a(n), x(q);
REP(i, n) { cin >> a[i]; }
REP(i, q) { cin >> x[i]; }
vl cum(n + 1), cumtobi(n + 1);
cum[0] = 0;
cumtobi[0] = 0;
cum[1] = a[0];
cumtobi[1] = a[0];
FOR(i, 2, n + 1) {
cum[i] = cum[i - 1] + a[i - 1];
cumtobi[i] = cumtobi[i - 2] + a[i - 1];
}
vector<pair<ll, ll>> map;
for (int i = 1; i <= (n + 1) / 2; i++) {
if (n - 2 * i - 1 < 0) {
ll tx = 0;
ll v = cum[n] - cum[n / 2];
map.push_back(make_pair(tx, v));
} else {
ll tx = (a[n - i - 1] + a[n - 2 * i - 1]) / 2;
ll v = cum[n] - cum[n - i] + cumtobi[n - 2 * i];
map.push_back(make_pair(tx, v));
}
}
sort(map.begin(), map.end());
REP(i, q) {
int idx = (upper_bound(map.begin(), map.end(), make_pair(x[i], 0LL)) -
map.begin()) -
1;
cout << map[idx].second << endl;
}
}
|
p03158 | C++ | #include <assert.h>
#include <limits.h>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#include <random>
#define rep(i, a, b) for (long long (i) = (a); i < (b); i++)
#define all(i) i.begin(), i.end()
#define debug(i) std::cerr << "debug " << #i <<" "<< i << std::endl
template <typename T1, typename T2>
std::ostream& operator<<(std::ostream& os, std::pair<T1, T2> pa) {
return os << pa.first << " " << pa.second;
}
template <typename T>
std::ostream& operator<<(std::ostream& os, std::vector<T> vec) {
for (int i = 0; i < vec.size(); i++)os << vec[i] << (i + 1 == vec.size() ? "" : " ");
return os;
}
template<typename T1,typename T2>
inline bool chmax(T1& a,T2 b){return a<b && (a=b,true);}
template<typename T1,typename T2>
inline bool chmin(T1& a,T2 b){return a>b && (a=b,true);}
long long pow_mod(long long a, long long b, long long mod=-1) {
if ((a == 0)||(mod!=-1&&a%mod==0)) {
return 0;
}
long long x = 1;
while (b > 0) {
if (b & 1) {
x = (mod!=-1)?(x * a) % mod:x*a;
}
a = (mod!=-1)?(a * a) % mod:a*a;
b >>= 1;
}
return x;
}
// const long long MOD = 998244353;
const long long MOD = 1e9 + 7;
using ll = long long;
using P = std::pair<ll, ll>;
int main() {
std::cin.tie(0);
std::ios::sync_with_stdio(false);
ll n,q;
std::cin>>n>>q;
std::vector<ll> a(n);
rep(i,0,n)std::cin>>a[i];
std::vector<ll> sum(n+1,0),oddsum(n+1,0);
rep(i,1,n+1)sum[i]=sum[i-1]+a[i-1];
oddsum[1]=a[0];oddsum[2]=a[1];
rep(i,3,n+1)oddsum[i]=oddsum[i-2]+a[i-1];
rep(_,0,q){
ll x;
std::cin>>x;
ll left=n/2+2,right=0;
while(left-right>1){
ll mid=right+(left-right)/2;
if(2*mid+1>n)left=mid;
else {
ll leftnum=a[n-2*mid-1],rightnum=a[n-mid-1];
if(std::abs(rightnum-x)>=std::abs(leftnum-x))right=mid;
else left=mid;
}
}
std::cout<<sum[n]-sum[n-left]+oddsum[std::max(0ll,n-2*left)]<<"\n";
}
return 0;
} |
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
//#define MOD 998244353
//#define INF 1145141919810893364
#define INF 810114514
#define PI 3.141592653589
typedef pair<int,int> PP;
typedef long long ll;
#define int ll
#define setdouble setprecision
#define REP(i,n) for(int i=0;i<(n);++i)
#define OREP(i,n) for(int i=1;i<=(n);++i)
#define RREP(i,n) for(int i=(n)-1;i>=0;--i)
#define GOODBYE do { cout << "No" << endl; return 0; } while (false)
#define MM <<" "<<
#define Endl endl
signed main(void){
int N,Q;
vector<int> A;int a;
int X[114514];
cin >> N >> Q;
REP(i,N){
cin >> a;
A.push_back(a);
}
reverse(A.begin(),A.end());
int sum[114514]={},evsum[114514]={};
REP(i,N){
sum[i+1]=sum[i]+A[i];
evsum[i+1]=evsum[i]+(i%2==0?A[i]:0);
}
vector<int> T,V;
REP(i,(N-1)/2){//高橋君は後ろからi個を取る //青木君はその後ろからi個を取る
//残りはよしなに分ける
int t=0,v=0;
t=(A[i+1]+A[2*i+2])/2 + 1;
v+=sum[i+1];
v+=evsum[N]-evsum[2*i+2];
T.push_back(t);
V.push_back(v);
//cout <<t MM v << endl;
}
REP(i,Q){
cin >> X[i];
}
reverse(T.begin(),T.end());
reverse(V.begin(),V.end());
REP(j,Q){
decltype(T)::iterator it = std::upper_bound(T.begin(), T.end(), X[j]);
int y=it-T.begin();
if(y==0){
cout << sum[(N+1)/2] << endl;
}else{
cout << V[y-1] << 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 < (int)N; i++)
const ll MOD = pow(10,9)+7;
const ll LLINF = pow(2,61)-1;
const int INF = pow(2,30)-1;
int main() {
int N, Q; cin >> N >> Q;
ll A[N]; rep(i,N) cin >> A[i];
ll tk[(N+1)/2] = {}, pos[(N-1)/2] = {};
for (int i=N-1; i>=N/2; i--) tk[0] += A[i];
rep(i,(N-1)/2) {
tk[i+1] = tk[i] - A[N/2+i] + A[i*2+(N+1)%2];
pos[i] = (A[i*2+(N+1)%2]+A[N/2+i])/2;
}
// for (auto x: tk) cout << x << " "; cout << endl;
// for (auto x: pos) cout << x << " "; cout << endl;
rep(i,Q) {
ll x; cin >> x;
int p = lower_bound(pos,pos+(N-1)/2,x) - pos;
cout << tk[p] << endl;
// cout << x << "->" << p << ":" << tk[p] << endl;
}
return 0;
} |
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int n,q;
cin>>n>>q;
int a[n];
for(int i=0;i<n;i++)cin>>a[i];
if(n==2){
int x;
for(int i=0;i<q;i++){
cin>>x;
cout<<a[1]<<endl;
}
return 0;
}
int t[(n-1)/2],ans[(n-1)/2+1]={};
for(int i=0;n-1-2*i>=0;i++)ans[0]+=a[n-1-2*i];
for(int i=1;i<(n-1)/2+1;i++)ans[i]=ans[i-1]+a[n-1-i]-a[n-1-2*i];
for(int i=1;i<=(n-1)/2;i++){
t[i-1]=a[n-1-i]+a[n-1-2*i];
}
int x,ok,ng,mid;
for(int i=0;i<q;i++){
cin>>x;
ok=(n-1)/2;ng=-1;
while(abs(ok-ng)>1){
mid=(ok+ng)/2;
if(t[mid]<2*x){
ok=mid;
}else ng=mid;
}
cout<<ans[ok]<<endl;
}
return 0;
}
|
p03158 | C++ | #include <bits/stdc++.h>
#define int long long
#define mod (int)(1e9+7)
#define inf (int)(3e18)
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,n) for(int i=1;i<n;i++)
#define P std::pair<int,int>
#define PiP std::pair<int,std::pair<int,int>>
#define all(v) v.begin(),v.end()
#define mkp std::make_pair
#define prique(T) std::priority_queue<T,vector<T>,greater<T>>
using namespace std;
template<class T> inline void chmax(T& a, T b) { a = std::max(a, b); }
template<class T> inline void chmin(T& a, T b) { a = std::min(a, b); }
bool prime(int x) {
for (int i = 2; i * i <= x; i++) {
if (x % i == 0)return false;
}
return x != 1;
}
int gcd(int x, int y) {
if (y == 0)return x;
return gcd(y, x % y);
}
int lcm(int x, int y) {
return x / gcd(x, y) * y;
}
int kai(int x, int y) {
int res = 1;
for (int i = x - y + 1; i <= x; i++) {
res *= i; res %= mod;
}
return res;
}
int mod_pow(int x, int y, int m) {
int res = 1;
while (y > 0) {
if (y & 1) {
res = res * x % m;
}
x = x * x % m;
y >>= 1;
}
return res;
}
int comb(int x, int y) {
if (y > x)return 0;
return kai(x, y) * mod_pow(kai(y, y), mod - 2, mod) % mod;
}
int get_rand(int MIN, int MAX) {
std::random_device rnd;
std::mt19937 mt32(rnd());
std::uniform_int_distribution<int>engine(MIN, MAX);
return engine(mt32);
}
/*--------Library Zone!--------*/
int n, q;
int a[114514];
int sum[114514], sum2[114514];
signed main() {
cin >> n >> q;
rep(i, n)cin >> a[i];
sort(a, a + n);
rep(i, n) {
sum[i] += a[i]; sum2[i] += a[i];
sum[i + 1] += sum[i]; sum2[i + 2] += sum2[i];
}
while (q--) {
int x; cin >> x;
//中心からの距離
int ok = -1, ng = mod;
int l_, r_;
while (ng - ok > 1) {
int mid = (ok + ng) / 2;
int l = lower_bound(a, a + n, x - mid) - a;
int r = upper_bound(a, a + n, x + mid) - a;
if (n - (r - l) >= r) {
ok = mid; l_ = l, r_ = r;
}
else {
if (n - (r - l - 1) >= r - 1 && x - a[l] == a[r - 1] - x) {
ok = mid; l_ = l, r_ = r - 1;
}
ng = mid;
}
}
if (ok == -1) {
cout << sum2[n - 1] << endl;
}
else if (n - (r_ - l_) > r_) {
cout << sum[n] - sum[r_ - 1] + (l_ > 1 ? sum2[l_ - 2] : 0) << endl;
}
else {
cout << sum[n] - sum[r_ - 1] + (l_ ? sum2[l_ - 1] : 0) << endl;
}
}
}
|
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0,i##_max=(N);i<i##_max;++i)
#define repp(i,l,r) for(int i=(l),i##_max=(r);i<i##_max;++i)
#define per(i,N) for(int i=(N)-1;i>=0;--i)
#define perr(i,l,r) for(int i=r-1,i##_min(l);i>=i##_min;--i)
#define all(arr) (arr).begin(), (arr).end()
#define SP << " " <<
#define SPF << " "
#define SPEEDUP cin.tie(0);ios::sync_with_stdio(false);
#define MAX_I INT_MAX //1e9
#define MIN_I INT_MIN //-1e9
#define MAX_UI UINT_MAX //1e9
#define MAX_LL LLONG_MAX //1e18
#define MIN_LL LLONG_MIN //-1e18
#define MAX_ULL ULLONG_MAX //1e19
typedef long long ll;
typedef pair<int,int> PII;
typedef pair<char,char> PCC;
typedef pair<ll,ll> PLL;
typedef pair<char,int> PCI;
typedef pair<int,char> PIC;
typedef pair<ll,int> PLI;
typedef pair<int,ll> PIL;
typedef pair<ll,char> PLC;
typedef pair<char,ll> PCL;
inline void YesNo(bool b){ cout << (b?"Yes" : "No") << endl;}
inline void YESNO(bool b){ cout << (b?"YES" : "NO") << endl;}
inline void Yay(bool b){ cout << (b?"Yay!" : ":(") << endl;}
int main(void){
SPEEDUP
cout << setprecision(15);
int N,Q;cin >> N >> Q;
vector<ll> A(N+1,0);
vector<ll> acc(N+1,0);
vector<ll> cross(N+1,0);
acc[0] = cross[0] = 0;
vector<ll> X(Q,0);
map<ll,ll> mp;
rep(i,N)cin >> A[i+1];
rep(j,Q) cin >> X[j];
rep(i,N){
acc[i+1] = acc[i] + A[i+1];
cross[i+1] = cross[i];
if((i+N)&1) cross[i+1] += A[i+1];
}
rep(i,N){
//前からi枚は交互にとる．
ll ans = cross[i];
int j = i+(N-i)/2;
ans += acc[N] - acc[j];
ll x = (A[i+1]+A[j+1])/2;
mp[x] = ans;
}
rep(j,Q){
auto it = mp.lower_bound(X[j]);
if(it==mp.end()) cout << cross[N] << endl;
else cout << it->second << endl;
}
return 0;
}
|
p03158 | C++ | /*** author: yuji9511 ***/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using lpair = pair<ll, ll>;
const ll MOD = 1e9+7;
const ll INF = 1e18;
#define rep(i,m,n) for(ll i=(m);i<(n);i++)
#define rrep(i,m,n) for(ll i=(m);i>=(n);i--)
#define printa(x,n) for(ll i=0;i<n;i++){cout<<(x[i])<<" \n"[i==n-1];};
void print() {}
template <class H,class... T>
void print(H&& h, T&&... t){cout<<h<<" \n"[sizeof...(t)==0];print(forward<T>(t)...);}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
ll N,Q;
cin >> N >> Q;
ll A[100010];
rep(i,0,N) cin >> A[i];
ll X[100010];
rep(i,0,Q) cin >> X[i];
vector<ll> pos;
ll sum[100010] = {};
rep(i,0,N) sum[i+1] = sum[i] + A[i];
ll sum_odd[100010] = {}, sum_even[100010] = {};
rep(i,0,N){
if(i % 2 == 0){
sum_even[i+1] += sum_even[i] + A[i];
sum_odd[i+1] += sum_odd[i];
}else{
sum_even[i+1] += sum_even[i];
sum_odd[i+1] += sum_odd[i] + A[i];
}
}
rrep(i,N-2,0){
ll diff = N - i - 1;
ll p1 = i, p2 = p1 - diff;
if(p2 < 0) break;
ll v = (A[p2] + A[p1])/2 + 1;
pos.push_back(v);
}
reverse(pos.begin(), pos.end());
// printa(pos, pos.size());
ll sz = pos.size();
rep(i,0,Q){
ll p = upper_bound(pos.begin(), pos.end(), X[i]) - pos.begin();
ll num = sz - p + 1;
ll taka = sum[N] - sum[N-num];
ll s = N - num*2 - 1;
// print(taka);
if(s < 0){
print(taka);
}else{
if(s % 2 == 0){
taka += sum_even[s+1];
}else{
taka += sum_odd[s+1];
}
print(taka);
}
}
} |
p03158 | C++ | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n) for (int i = 1; i <= (n); i++)
#define all(x) (x).begin(), (x).end()
#define uniq(x) (x).erase(unique(all(x)), (x).end())
#define bit(n) (1LL << (n))
#define dump(x) cerr << #x " = " << (x) << endl
using vint=vector<int>;
using vvint=vector<vint>;
using pint=pair<int, int>;
using vpint=vector<pint>;
template<typename T> using priority_queue_rev=priority_queue<T, vector<T>, greater<T>>;
constexpr double pi = 3.1415926535897932384626433832795028;
constexpr int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
constexpr int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int gcd(int a, int b) {
while (b) { swap(a %= b, b); }
return a;
}
int lcm(int a, int b) { return a / gcd(a, b) * b; }
template<typename T1, typename T2> bool chmax(T1 &a, const T2 &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template<typename T1, typename T2> bool chmin(T1 &a, const T2 &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &rhs) {
os << "(" << rhs.first << ", " << rhs.second << ")";
return os;
}
template<typename T> ostream &operator<<(ostream &os, const vector<T> &rhs) {
os << "{";
for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {
os << *itr << (next(itr) != rhs.end() ? ", " : "");
}
os << "}";
return os;
}
struct setup {
static constexpr int PREC = 20;
setup() {
cout << fixed << setprecision(PREC);
cerr << fixed << setprecision(PREC);
};
} setup;
template<typename T>
struct cumulative_sum {
int n;
T ZERO;
std::vector<T> data;
template<typename I> cumulative_sum(I begin, I end, T ZERO = T())
: n(end - begin), ZERO(ZERO), data(n + 1) {
std::copy(begin, end, data.begin() + 1);
for (int i = 0; i < n; i++) { data[i + 1] += data[i]; }
}
T get_sum(int l, int r) const {
if (l >= r || l > n || r < 0) { return ZERO; }
if (l < 0) { l = 0; }
if (r > n) { r = n; }
return data[r] - data[l];
}
};
long long discrete_binary_search(long long ok, long long ng, const std::function<bool(long long)> &check) {
while (abs(ok - ng) > 1) {
long long mid = (ok + ng) / 2;
(check(mid) ? ok : ng) = mid;
}
return ok;
}
int N, Q;
signed main() {
cin >> N >> Q;
vint A(N), X(Q);
rep(i, N) { cin >> A[i]; }
rep(i, Q) { cin >> X[i]; }
vint Ac(A);
rep(i, N) {
if (N % 2 == i % 2) { Ac[i] = 0; }
}
cumulative_sum<int> cs0(all(A)), cs1(all(Ac));
rep(i, Q) {
int k = discrete_binary_search(0, N / 2 + 1 + N % 2, [&](int x) {
return A[N - x] - X[i] >= X[i] - A[N - 2 * x + 1];
});
cout << cs0.get_sum(N - k, N) + cs1.get_sum(0, N - 2 * k) << endl;
}
} |
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
using P = pair<long, long>;
typedef long long int ll;
#define EPS (1e-7)
#define INF (1e18)
#define PI (acos(-1))
#define sortv(xs) sort(xs.begin(), xs.end())
#define sortvinv(xs) sort(xs.begin(), xs.end(), greater<long>())
#define lbv(xs, x) lower_bound(xs.begin(), xs.end(), x) - xs.begin()
#define ubv(xs, x) upper_bound(xs.begin(), xs.end(), x) - xs.begin()
#define bs(xs, x) binary_search(xs.begin(), xs.end(), x)
#define index_of(as, x) \
distance(as.begin(), lower_bound(as.begin(), as.end(), x))
#define rad_to_deg(rad) (((rad)/2/M_PI)*360)
#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)
#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define per(i,b) gnr(i,0,b)
#define concat(xs, ys) (xs).insert((xs).end(), (ys).begin(), (ys).end())
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int n, q;
cin >> n >> q;
vector<long> a(n);
rep(i, n) {
cin >> a[i];
}
vector<long> sumAll(n+1);
vector<long> sumEven(n+1);
vector<long> sumOdd(n+1);
per(i, n) {
sumAll[i] = sumAll[i+1] + a[i];
if ((n-i+1)%2) {
sumOdd[i] = sumOdd[i+1] + a[i];
sumEven[i] = sumEven[i+1];
} else {
sumOdd[i] = sumOdd[i+1];
sumEven[i] = sumEven[i+1] + a[i];
}
}
rep(i, q) {
long x;
cin >> x;
int fst = lbv(a, x);
if (fst != 0 && x-a[fst-1] <= a[fst]-x) {
fst--;
}
int ub = n+1;
int lb = 1;
while(ub - lb > 1) {
int next = (lb+ub)/2;
int target = n-next;
int left = fst-next+1+(target-fst);
if (target == fst) {
ub = next;
} else if (left >= 0 && x-a[left] <= a[target]-x) {
lb = next;
} else {
ub = next;
}
}
// int next = lb;
// int target = n-next;
// int left = fst-next+1+(target-fst);
// cout << target << " " << left << endl;
// if (left < 0 || x-a[left] <= a[target]-x) {
// lb = next;
// }
long res = 0;
res += sumAll[n-lb];
res += sumEven[0];
res -= sumEven[max(0, n-lb*2)];
cout << res << endl;
}
}
|
p03158 | C++ | //#include "bits/stdc++.h"
#define _USE_MATH_DEFINES
#include<cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <algorithm>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <iterator>
using namespace std;
#define rep(i,a,b) for(int i=(a), i##_len=(b);i<i##_len;i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(c) begin(c),end(c)
#define int ll
#define SZ(x) ((int)(x).size())
#define pb push_back
#define mp make_pair
//typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ll, int> pli;
typedef pair<double, double> pdd;
typedef vector< vector<int> > mat;
template<class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; }
template<class T> bool chmin(T &a, const T &b) { if (b < a) { a = b; return true; } return false; }
const int INF = sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
struct P
{
int q, i, ans;
P() :P(0,0,0) {}
P(int q, int i, int ans) :q(q), i(i), ans(ans) {}
};
int A[100010];
P Q[100010];
signed main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int N, M,q;
int s = 0;
cin >> N >> M;
rep(i, 0, N)
{
cin >> A[i];
if (N / 2 <= i)
{
s += A[i];
}
}
rep(i, 0, M)
{
cin >> q;
Q[i] = P(q, i, 0);
}
sort(Q, Q + M, [](const P& a, const P& b) {return a.q < b.q; });
int l, r;
if (N % 2 == 1)
{
l = 0;
r = N / 2;
}
else
{
l = 1;
r = N / 2;
}
int qi = 0;
while (l < r)
{
int x = (A[r] + A[l]) / 2;
while (qi < M&&Q[qi].q <= x)
{
Q[qi].ans = s;
qi++;
}
s -= A[r] - A[l];
l += 2;
r++;
}
while (qi < M)
{
Q[qi].ans = s;
qi++;
}
sort(Q, Q + M, [](const P& a, const P& b) {return a.i < b.i; });
rep(i,0,M)
{
cout << Q[i].ans << endl;
}
return 0;
} |
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
int main()
{
ll n , q ;
cin >> n >> q ;
vector<ll> a(n);
vector<ll> sum;
sum.push_back(0);
vector<ll> half;
half.push_back(0);
rep(i, n){
cin >> a[i];
sum.push_back(a[i] + sum[i]);
half.push_back((i%2?0:a[i]) + half[i]);
}
vector<ll> x(q);
rep(i, q){
cin >> x[i];
}
rep(i,q){
auto judge = [&](ll val) {
if(val==1)return true;
//cout << x[i]-a[n-2*val+2] <<" " << a[n-val+1]-x[i] << endl;
if(x[i]-a[n-2*val+1]>a[n-val]-x[i])return false;
else return true;
};
auto binarysearch = [&](ll lowerbound, ll upperbound) {
if (!judge(lowerbound)) return -1LL;
ll lower = lowerbound, upper = upperbound;
while (1){
if (judge((lower + upper) / 2)) lower = (lower + upper) / 2;
else upper = (lower + upper) / 2;
if (abs(upper - lower) <= 1){
if (judge(upper)) return upper;
else return lower;
}
}
};
ll ind=binarysearch(1,(n+1)/2);
ll ans;
if(n%2)ans=sum[n]-sum[n-ind]+half[n-2*ind+1];
else ans=sum[n]-sum[n-ind]+sum[n-2*ind+1]-half[n-2*ind+1];
cout << ans << endl;
}
return 0;
} |
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)n; i++)
using ll = long long;
int main(){
int n, q;
cin >> n >> q;
ll a[n];
vector<ll> sum(n+1,0);
vector<ll> odd(n+1,0);
vector<ll> even(n+1,0);
rep(i,n) {
cin >> a[i];
sum[i+1] = sum[i] + a[i];
if(i % 2) {
odd[i+1] = odd[i];
even[i+1] = even[i] + a[i];
} else {
odd[i+1] = odd[i] + a[i];
even[i+1] = even[i];
}
}
vector<ll> v((n+1)/2,0);
for(int i = 1; i <= (n+1)/2; i++) {
v[i-1] = a[n-i] + a[n-2*i+1];
}
reverse(v.begin(),v.end());
vector<ll> ans(q,0);
rep(i,q) {
ll x;
cin >> x;
int c = lower_bound(v.begin(),v.end(),2*x) - v.begin();
c = (n+1)/2 - c;
ans[i] += sum[n] - sum[n-c];
if(n % 2 && n-2*c >= 0) ans[i] += odd[n-2*c];
else if(n % 2 == 0) ans[i] += even[n-2*c];
}
for(auto k : ans) cout << k << endl;
return 0;
} |
p03158 | C++ | #include "bits/stdc++.h"
#define _overload3(_1,_2,_3,name,...)name
#define _rep(i,n)repi(i,0,n)
#define repi(i,a,b)for(int i=int(a),i##_len=(b);i<i##_len;++i)
#define MSVC_UNKO(x)x
#define rep(...)MSVC_UNKO(_overload3(__VA_ARGS__,repi,_rep,_rep)(__VA_ARGS__))
#define all(c)c.begin(),c.end()
#define write(x)cout<<(x)<<'\n'
using namespace std; typedef long long ll; template<class T>using vv = vector<vector<T>>;
template<class T>auto vvec(int n, int m, T v) { return vv<T>(n, vector<T>(m, v)); }
template<class T, class U>bool chmax(T& a, U&& b) { return a < b ? a = b, 1 : 0; }
template<class T, class U>bool chmin(T& a, U&& b) { return b < a ? a = b, 1 : 0; }
constexpr int INF = 1 << 29, MOD = int(1e9) + 7; constexpr ll LINF = 1LL << 60;
struct aaa { aaa() { cin.tie(0); ios::sync_with_stdio(0); cout << fixed << setprecision(10); }; }aaaa;
int main() {
int N, Q;
cin >> N >> Q;
vector<ll> A(N);
rep(i, N) cin >> A[i];
vector<int> X(Q);
rep(i, Q) cin >> X[i];
vector<ll> sumA(N + 1);
rep(i, N) sumA[i + 1] = sumA[i] + A[i];
vector<ll> sumAeo(N + 1);
sumAeo[1] = A[0];
rep(i, 1, N) sumAeo[i + 1] = sumAeo[i - 1] + A[i];
rep(i, Q) {
int l = 0, h = 1e9;
while (h - l > 1) {
int mid = (l + h) / 2;
int tak = A.end() - lower_bound(all(A), X[i] + mid);
int aok = lower_bound(all(A), X[i] + mid) - upper_bound(all(A), X[i] - mid);
if (aok > tak) h = mid;
else l = mid;
}
auto iab = upper_bound(all(A), X[i] - l);
auto iatb = lower_bound(all(A), X[i] + l);
int tak = A.end() - iatb;
int aok = iatb - iab;
int atb = iatb - A.begin();
int ab = iab - A.begin();
if (tak - aok == 0) {
write(sumA[N] - sumA[atb] + sumAeo[ab]);
}
else if (tak - aok == 1) {
write(sumA[N] - sumA[atb] + (ab > 0 ? sumAeo[ab - 1] : 0));
}
else {
write(sumA[N] - sumA[atb] + (ab > 1 ? sumAeo[ab - 2] : 0));
}
}
} |
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
int main(){
int n, q;
vector<int> a;
cin >> n >> q;
a.resize(n);
for(int i=0;i<n;++i) cin >> a[i];
int64_t s[100001], s2[100000];
s[n] = 0;
for(int i=n-1;i>=0;--i) s[i] = a[i] + s[i+1];
s2[0] = a[0]; s2[1] = a[1];
for(int i=2;i<n;++i) s2[i] = s2[i-2] + a[i];
for(int i=0;i<q;++i){
int x;
cin >> x;
int al = 0, ar = n;
while(ar-al > 1){
int m = (ar+al) / 2;
if(a[m] <= x) al = m;
else ar = m;
}
if(ar < n && x - a[al] > a[ar] - x) ++al;
if(al == n-1) --al;
int t = n-1;
while(t-al > 1){
int m = (t+al) / 2;
int l = -1, r = m;
while(r-l > 1){
int mm = (l+r) / 2;
if(x-a[mm] <= a[m]-x) r = mm;
else l = mm;
}
if(m-r+1 < n-m) al = m;
else t = m;
}
int l = t - (n-t) - 1;
int64_t ans = s[t];
if(l >= 0) ans += s2[l];
cout << ans << endl;
}
return 0;
} |
p03158 | C++ | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
#define fi first
#define se second
#define mp make_pair
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
ll N,M,H,W,K,Q,A,B,L,R;
string S, T;
const ll MOD = 998244353;
const ll INF = 1LL << 60;
typedef pair<ll,ll> P;
typedef vector<P> vp;
typedef vector<vp> matP;
int main() {
cin>>N>>Q;
vec a(0);
rep(i,N) cin>>A, a.push_back(A);
vec tak((N+1)/2,0);
ll id = 0;
Rrep(i,N){
if((N - 1 - i)%2 == 0){
tak[id] = a[i] + (id == 0 ? 0 : tak[id - 1]);
++id;
}
}
vec sum(N);
rep(i,N) sum[i] = a[N - 1 - i] + (i == 0 ? 0 : sum[i-1]);
ll X;
rep(i,Q){
cin>>X;
ll lb = 0, ub = 3e+9;
while(ub - lb > 1){
ll cen = (ub + lb)/2;
auto left = lower_bound(ALL(a), X - (cen + 1)/2), right = upper_bound(ALL(a), X + cen/2);
ll range = right - left, moreR = a.end() - right;
if(range == moreR || range + 1 == moreR) {
K = moreR;
break;
}
(moreR > range ? lb : ub) = cen;
}
if(K != 0 && X < a[N - 2]) cout<<sum[K - 1] + tak[(N-1)/2] - tak[K - 1]<<endl;
else cout<<tak[(N - 1)/2]<<endl;
//cout<<K<<endl;
}
/*rep(i,N) cout<<sum[i]<<' ';
cout<<endl;
rep(i,(N+1)/2) cout<<tak[i]<<' ';
cout<<endl;*/
} |
p03158 | C++ | #if 1
//#define _CRT_SECURE_NO_WARNINGS //scanf
#include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <climits>
#include <algorithm>
#include <unordered_set>
#include <unordered_map>
#include <functional>
#include <set>
#include <map>
#include <numeric>
#include <cassert>
#include <iomanip>
#include <queue>
#include <chrono>
#define _SCL_SECURE_NO_WARNINGS
#include "boost/multiprecision/cpp_int.hpp"
#pragma warning (disable:4244)
using namespace std;
using int128 = boost::multiprecision::int128_t;
using int256 = boost::multiprecision::int256_t;
#if 0
#define int boost::multiprecision::int128_t
#else
#define int long long
#endif
#if 0
constexpr long long MOD = 1000000007LL;
#else
constexpr long long MOD = 998244353LL;
#endif
constexpr long long INF = 1145141919810893LL;
//
#if 1
struct Val {
int x = 0;
int r = 0;
};
int count111 = 0;
//ダイクストラ法を使うときはTとしてこれを継承したものを使う
struct Dijk {
static constexpr auto MAXVAL = std::numeric_limits<int>::max();
int prev = -1; //最短経路をたどる際の前の頂点
int dis = MAXVAL;
};
struct Bellman {
int dis = std::numeric_limits<int>::max() / 2; //緩和の初期値(何かが足されてもオーバーフローしないように)
int predecessor = -1; //直前の頂点？
};
struct Edge {
int next;
int w = 1;
};
template<class T>
struct Vertex {
std::vector<Edge>edges;
T val;
};
template<class T>
struct Graph {
std::vector<Vertex<T>> vertex;
public:
Graph(size_t nVertex = 0) :vertex(nVertex) {
}
void setArray(int u, int v, int w = 1) {
vertex[u].edges.push_back(Edge{ v ,w });
}
void setConnect(int u, int v, int w = 1) {
setArray(u, v, w);
setArray(v, u, w);
}
T& val(int u) {
return vertex[u].val;
}
void dfsImpl(int pos, int prev, std::function<bool(int now, int next, int w)> func) {
count111 += val(pos).x;
val(pos).r = count111;
for (auto& e : vertex[pos].edges) {
if (e.next == prev) continue;
if (func(pos, e.next, e.w)) {
dfsImpl(e.next, pos, func);
}
//ここに追加する場合も
}
count111 -= vertex[pos].val.x;
}
void dfsCustom(int pos, int prev);
//深さ優先探索
void dfs(int pos, std::function<bool(int now, int next, int w)> func) {
dfsImpl(pos, -1, func);
}
//幅優先探索
void bfs(int pos, std::function<bool(int now, int next, int w)> func) {
std::unordered_set<int> set;
set.insert(pos);
while (!set.empty()) {
std::unordered_set<int> setNew;
for (auto& one : set) {
for (auto& e : vertex[one].edges) {
if (func(one, e.next, e.w)) {
setNew.insert(e.next);
}
}
}
set = setNew;
}
}
//posStartを始点とするダイクストラ法
//木 :O(V) ※動作確認済
//有向非巡回グラフ(DAG) :O(V^2)
//ループ有 :O(V^2) ※未検証
//ループ有(負の閉路) :ダイクストラは適用外
void dijkstraOLD(int posStart) {
val(posStart).dis = 0;
//
bfs(posStart, [&](int now, int next, int w) {
if (val(next).dis > val(now).dis + w) {
val(next).dis = val(now).dis + w;
return true;
}
return false;
});
}
//木 :O(V) ※負の重みがあっても多分平気(未検証)
//有向非巡回グラフ(DAG) :O(E+VlogV) ※負の重みがあるとO(V^2)(未検証)
//ループ有 :O(E+VlogV)
//ループ有(負の閉路) :ダイクストラは適用外
struct VertexTmp {
int ver;
int prev; //直前の頂点
};
void dijkstra(int posStart) {
val(posStart).dis = 0;
std::multimap<int, VertexTmp>q; //累計距離->頂点
const int N = vertex.size();
for (auto& edge : vertex[posStart].edges) {
q.insert({ edge.w + val(posStart).dis ,VertexTmp{edge.next,posStart} });
}
val(posStart).dis = INF; //始点までの距離はループして初めに戻ってくるのにする
while (!q.empty()) {
auto itr = q.begin();
if (val(itr->second.ver).dis > itr->first) {
val(itr->second.ver).dis = itr->first;
val(itr->second.ver).prev = itr->second.prev;
for (auto& edge : vertex[itr->second.ver].edges) {
q.insert({ edge.w + val(itr->second.ver).dis ,VertexTmp{edge.next,itr->second.ver} });
}
}
q.erase(itr);
}
}
//posStartを始点とするベルマン-フォード法
//負の閉路に対応するがO(VE)
//負の経路を検出したらfalseを返す(この場合、結果が正しいとは限らない)
//posEndを指定した場合、posStart -> posEnd の最短経路間でのみ負経路検出を行う、-1なら全体
bool bellmanFord(int posStart, int posEnd = -1) {
// この実装では、グラフを頂点のリストと辺のリストで表す。
// そして、各頂点の distance と predecessor 属性が
// 最短経路を格納するよう変更していく。
// Step 1: グラフの初期化
val(posStart).dis = 0;
// Step 2: 辺の緩和を反復
for (int jj = 0; jj < vertex.size() * 2; ++jj) {
for (int i = 0; i < vertex.size(); ++i) {
for (auto& edge : vertex[i].edges) {
auto tmp = val(i).dis + edge.w;
if (val(edge.next).dis > tmp) {
val(edge.next).dis = tmp;
val(edge.next).predecessor = i;
}
}
}
}
// Step 3: 負の重みの閉路がないかチェック
if (0 > posEnd) {
for (int i = 0; i < vertex.size(); ++i) {
for (auto& edge : vertex[i].edges) {
if (val(edge.next).dis > val(i).dis + edge.w) {
return false;
}
}
}
}
else {
assert(false); //なんかうまくできてないっぽい
int v = posEnd;
do {
auto prev = val(v).predecessor;
assert(prev != -1);
int weight = std::numeric_limits<int>::min();
for (auto& edge : vertex[prev].edges) {
if (edge.next == v) {
weight = edge.w;
break;
}
}
assert(weight != std::numeric_limits<int>::min());
if (val(v).dis > val(prev).dis + weight) {
return false;
}
v = prev;
} while (v != posStart);
}
return true;
}
//DAGに対してトポロジカルソートを行う(O(V+E))
//DAGではない場合は例外を投げる
std::vector<int> topologicalSort() const {
const int N = vertex.size();
std::vector<int>ref(N); //各ノードに向いている入力辺の数
for (int i = 0; i < N; ++i) {
for (auto& edge : vertex[i].edges) {
ref[edge.next]++;
}
}
//
unordered_set<int> S; //入力辺を持たないすべてのノードの集合
std::vector<int>L; //トポロジカルソートした結果を蓄積する空リスト
L.reserve(N);
for (int i = 0; i < N; ++i) {
if (ref[i] == 0)S.insert(i);
}
while (!S.empty()) {
auto itr = S.begin();
int n = *itr;
S.erase(itr);
L.push_back(n);
for (auto& edge : vertex[n].edges) {
ref[edge.next]--;
if (ref[edge.next] == 0) {
S.insert(edge.next);
}
}
}
for (int i = 0; i < N; ++i) {
if (ref[i] != 0) {
throw "DAGではない";
}
}
return L;
}
//
pair<int, int> radiusImpl(int pos) {
int farestID = -1;
int far = -1;
val(pos) = 0;
//dfsで正しい？？
dfs(pos, [&](int now, int next, int w) ->bool {
val(next) = 1 + val(now);
if (val(next) > far) {
far = val(next);
farestID = next;
}
return true;
});
return { farestID, far };
}
//木の直径(O(V+E))
//ループがある(木ではない)ときは間違った答えを返す(そもそも、O(V^3)未満で近似なしで解く方法が見つかってない)
int radius() {
if (vertex.size() <= 1)return 0;
auto res = radiusImpl(0);
res = radiusImpl(res.first);
return res.second;
}
//隣接表現を行列表現に変換したうえでwfを行う(O(V^3))
//有向グラフであっても動作
std::vector<std::vector<int>> warshallFloyd() {
const int N = vertex.size();
std::vector<std::vector<int>> res(vertex.size());
for (int i = 0; i < N; ++i) {
res[i].resize(N);
for (int j = 0; j < N; ++j) {
res[i][j] = INF;
}
}
for (int i = 0; i < N; ++i) {
for (auto& e : vertex[i].edges) {
res[i][e.next] = e.w;
}
}
for (int k = 0; k < N; k++) { // 経由する頂点
for (int i = 0; i < N; i++) { // 始点
for (int j = 0; j < N; j++) { // 終点
res[i][j] = min(res[i][j], res[i][k] + res[k][j]);
}
}
}
return res;
}
//二部グラフであるかの判定(O(V+E)？)
//二部グラフの場合は白い頂点のid配列を返す
//二部グラフじゃない場合は空
std::vector<int> bipartiteGraph() {
std::vector<int>res;
const int N = vertex.size();
std::vector<int> color(N, -1);
function<bool(int, int, int)> dfs = [&](int u, int prev, int c) {
color[u] = c;
if (c == 1) {
res.push_back(u);
}
for (auto& edge : vertex[u].edges) {
int v = edge.next;
if (v == prev)continue;
if (color[v] == -1) {
if (!dfs(v, u, 1 - c)) return false;
}
else if (color[v] != 1 - c) {
return false;
}
}
return true;
};
if (!dfs(0, -1, 0)) return {};
return res;
}
};
#endif
//////////////////////////////////
int gcd(int x, int y) { return y ? gcd(y, x % y) : x; }
int lcm(int x, int y) { return x / gcd(x, y) * y; }
int sign(int x) {
if (x > 0)return 1;
if (x < 0)return -1;
return 0;
}
//マイナスでも動作するmod(いちいち手で書くとunsignedの引き算オーバーフローで死にやすい)
int mod(int n, int m = MOD) {
assert(0 < m); //さすがに割る数は正でないといけない
return (n % m + m) % m;
}
unsigned int mod(unsigned int n, unsigned int m = MOD) {
assert(0 < m); //さすがに割る数は正でないといけない
return (n % m + m) % m;
}
//約数
std::vector<int> divisor(int n) {
std::vector<int> ret;
for (int i = 1; i * i <= n; ++i) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n) {
ret.push_back(n / i);
}
}
}
return ret;
}
//素数判定
bool isPrime(int n) {
if (n <= 1)return false;
if (n == 2)return true;
if (n % 2 == 0)return false;
for (int i = 3; i * i <= n; i += 2) {
if (n % i == 0)return false;
}
return true;
}
//素因数分解
std::map<int, int> primeFactorization(int n) {
std::map<int, int> res;
int k = 2;
while (k * k <= n) {
while (n % k == 0) {
res[k]++;
n /= k;
}
++k;
}
if (n != 1) {
res[n]++;
}
return res;
}
//二項係数(N<=10^6,O(NlogN))、int128は使わなく64で十分
class Combination {
std::vector<long long>fac, finv, inv;
long long M; //剰余
public:
Combination(long long N, long long M_ = MOD)
:fac(N + 1), finv(N + 1), inv(N + 1), M(M_) {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (long long i = 2; i < N + 1; i++) {
fac[i] = fac[i - 1] * i % M;
inv[i] = M - inv[M % i] * (M / i) % M;
finv[i] = finv[i - 1] * inv[i] % M;
}
}
long long get(long long n, long long k) {
if (n < k) return 0;
if (n < 0 || k < 0) return 0;
return fac[n] * (finv[k] * finv[n - k] % M) % M;
}
long long factrial(int n) {
return fac[n];
}
};
//二項係数(N<=50,O(N^2))、剰余を取らないパターンはこっちで計算必須
class CombinationSmall {
std::vector<std::vector<int>>com;
CombinationSmall() :com(51) {
for (int i = 0; i < com.size(); ++i) {
com[i].resize(i + 1);
for (int j = 0; j < i + 1; ++j) {
if (j == 0 || i == j) {
com[i][j] = 1;
}
else {
com[i][j] = com[i - 1][j] + com[i - 1][j - 1];
}
}
}
}
public:
long long get(int n, int k) {
return com[n][k];
}
};//CombinationSmall
#if 1
//Mを法とする逆数、計算量:？
int modInv(int a, int M = MOD) {
int b = M, u = 1, v = 0;
while (b) {
int t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= M;
if (u < 0) u += M;
return u;
}
template <class T>
void modify(T& n, T mod = MOD) {
if (n < 0) {
n %= mod;
n += mod;
}
n %= mod;
}
void chmax(int& val, int max) {
val = std::max({ val,max });
}
void chmin(int& val, int min) {
val = std::min({ val,min });
}
#endif
//文字列の置き換え(遅い？)
int replace(std::string* str, const std::string& old_, const std::string& new_) {
std::string& String1 = *str;
//String1.reserve(str->size() * new_.size() / old_.size() + 1);
std::string::size_type Pos(String1.find(old_));
int result = 0;
while (Pos != std::string::npos) {
result++;
String1.replace(Pos, old_.length(), new_);
Pos = String1.find(old_, Pos + new_.length());
}
return result;
}
#define ALL(t) t.begin(), t.end()
//LIS(最長増加部分列)
//eq = falseで狭義増加(1,3,7,9...)
//eq = trueで広義増加(1,1,3,7,7,7,7,9...)
std::vector<int> lis(const std::vector<int>& ary, bool eq = false) {
std::vector<int>dp(ary.size());
constexpr int intMax = std::numeric_limits<int>::max();
fill(ALL(dp), intMax);
for (int i = 0; i < ary.size(); ++i) {
auto itr = std::lower_bound(ALL(dp), ary[i] + (eq ? 1 : 0));
*itr = ary[i];
}
auto itr = std::lower_bound(ALL(dp), intMax);
dp.resize(itr - dp.begin());
return dp;
}
//座標圧縮:O(NlogN)
struct Compressor {
std::set<int> buf;
std::unordered_map<int, int>res;
public:
template <class... Args>
void insert(Args... args) {
buf.insert(args...);
}
void calc() {
res.clear();
int i = 0;
for (auto& one : buf) {
res[one] = i;
++i;
}
}
int get(int n) const {
return res.at(n);
}
std::vector<int> get(const std::vector<int>& v) const {
std::vector<int> res(v.size());
for (int i = 0; i < v.size(); ++i) {
res[i] = get(v[i]);
}
return res;
}
};
//MODで割ったあまりの演算
struct Rational {
int r;
Rational(int rr) :r(rr) {
}
Rational() = default; //vectorに入れたりするときに必要
operator int() {
return r;
}
Rational operator+(const Rational& other)const {
Rational res(0);
res.r = r + other.r;
modify(res.r);
return res;
}
Rational operator-(const Rational& other)const {
Rational res(0);
res.r = r - other.r;
modify(res.r);
return res;
}
Rational operator*(const Rational& other) const {
Rational res(0);
res.r = r * other.r;
modify(res.r);
return res;
}
Rational operator/(const Rational& other)const {
Rational res(0), res1(0);
res = *this;
res1.r = modInv(other.r);
res = (*this) * res1;
modify(res.r);
return res;
}
void operator+=(const Rational& other) {
*this = *this + other;
}
void operator-=(const Rational& other) {
*this = *this - other;
}
void operator*=(const Rational& other) {
*this = *this * other;
}
void operator/=(const Rational& other) {
*this = *this / other;
}
};
Rational pow(Rational r, int N) {
if (N == 0)return Rational(1);
if (N % 2 == 1)return r * pow(r, N - 1);
Rational tmp = pow(r, N / 2);
return tmp * tmp;
}
Rational operator"" _r(unsigned long long val) {
return Rational(val);
}
/////////////////////
//KMP文字列検索
//計算量:O(|S|+|W|)
//ボイヤームーアは実務では良くても競プロでは使ってはいけない(最悪ケースで二乗オーダ)
struct KMP {
std::string W; //検索する文字列
std::vector<int> T; //テーブル
public:
//計算量:O(|W|)
KMP(const std::string& W_) :W(W_) {
T.resize(W.size() + 1);
int i = 2; //T の中で現在計算している位置
int j = 0; //現在見ているサブ文字列の次の文字のインデックス。0から始まる
//先頭ふたつの値は固定。ただしアルゴリズムの実装によっては具体的値は異なる
T[0] = -1;
if (2 <= W.size()) {
T[1] = 0;
}
while (i <= W.size()) {
if (W[i - 1] == W[j]) {
T[i] = j + 1;
i = i + 1;
j = j + 1;
}
else if (j > 0) {
j = T[j];
}
else {
T[i] = 0;
i = i + 1;
}
}
}
//return: W が見つかった際の S 内の位置を全列挙(先端が0番目)
//全列挙でも一個探す場合と計算量的に変わらない
//(むしろ一個探す実装を繰り返して全列挙するとTLEする)
//Sを変えて複数回呼べる
//計算量:O(|S|)
std::vector<int> searchAll(const std::string& S)const {
std::vector<int>res;
//S 内の現在照合中の開始位置
int m = 0;
//W 内の現在位置
int i = 0;
while (m + i < S.size()) {
if (W[i] == S[m + i]) {
++i;
if (i == W.size()) {
res.push_back(m);
}
else {
continue;
}
}
m = m + i - T[i];
if (i > 0) {
i = T[i];
}
}
return res;
}
};
//Z-Algorithm(「SとSの後半」の接頭辞の長さ)
std::vector<int> Zalgorithm(const std::string& S) {
std::vector<int> res(S.size());
int c = 0;
for (int i = 1; i < S.size(); i++) {
if (i + res[i - c] < c + res[c]) {
res[i] = res[i - c];
}
else {
int j = std::max({ 0LL, c + res[c] - i });
while (i + j < S.size() && S[j] == S[i + j]) ++j;
res[i] = j;
c = i;
}
}
res[0] = S.size();
return res;
}
//
namespace rollingHashConfig {
//複数の素数を試し衝突を回避
static constexpr int N = 3;
static const std::array<std::uint64_t, N>Ms = { 2147483647 , 4444444447, 1234567891 }; //素数
static const std::array<std::uint64_t, N> B = { 8127,8128,114514 };
} //namespace rollingHashConfig
struct RollingHashResult {
std::array<std::uint64_t, rollingHashConfig::N>hashes;
bool operator==(const RollingHashResult& other)const {
for (int i = 0; i < rollingHashConfig::N; ++i) {
if (hashes[i] != other.hashes[i])return false;
}
return true;
}
bool operator<(const RollingHashResult& other)const {
for (int i = 0; i < rollingHashConfig::N; ++i) {
if (hashes[i] < other.hashes[i])return true;
if (hashes[i] > other.hashes[i])return false;
}
return false;
}
};
//hash合成
size_t hashCombine(size_t seed0, size_t seed1) {
return seed0 ^ (seed1 + 0x9e3779b9 + (seed0 << 6) + (seed0 >> 2));
}
namespace std {
//unordered_set用
template<>
struct hash<RollingHashResult> {
public:
size_t operator()(const RollingHashResult& data)const {
std::size_t seed = 0;
for (int i = 0; i < rollingHashConfig::N; ++i) {
seed = hashCombine(seed, data.hashes[i]);
}
return seed;
}
};
}
struct RollingHash {
std::array < std::vector<std::uint64_t>, rollingHashConfig::N> hashed, power;
RollingHash(const std::string& s) {
int sz = (int)s.size();
for (int i = 0; i < rollingHashConfig::N; ++i) {
hashed[i].assign(sz + 1, 0);
power[i].assign(sz + 1, 0);
power[i][0] = 1;
for (int j = 0; j < sz; ++j) {
std::uint64_t base = rollingHashConfig::B[i];
std::uint64_t mod = rollingHashConfig::Ms[i];
power[i][j + 1] = (power[i][j] * base) % mod;
hashed[i][j + 1] = ((hashed[i][j] * base) % mod + (std::uint64_t)s[j]) % mod;
}
}
}
RollingHashResult get(int offset, int size) {
int l = offset;
int r = offset + size;
RollingHashResult res;
for (int i = 0; i < rollingHashConfig::N; ++i) {
std::uint64_t mod_ = rollingHashConfig::Ms[i];
//符号なしなので負になったりオーバーフローしないように細心の注意が必要
res.hashes[i] = (hashed[i][r] + mod_ - (hashed[i][l] * power[i][r - l]) % mod_) % mod_;
}
return res;
}
};
//Manacher:回文アルゴリズム(未実装)
//累積和
std::vector<int> MAKESUM(const std::vector<int>& A) {
std::vector<int>res(A.size() + 1);
res[0] = 0;
for (int i = 1; i < A.size() + 1; ++i) {
res[i] = res[i - 1] + A[i - 1];
}
return res;
}
//セグメント木
struct SegmentTree {
std::vector<int>val;
size_t size;
public:
SegmentTree(size_t sz) {
//2の累乗でないといけない
assert((sz & (sz - 1)) == 0);
//
val.resize(sz * 2 - 1);
size = sz;
}
void fill(int v) {
std::fill(val.begin(), val.end(), v);
}
//TODO 全部に初期値を入れてからやるばあいはまとめて更新するとO(N)でできる
// setをN回呼ぶとNlogNかかる
//群の演算
static int operate(int a, int b) {
return a + b;
}
//群の単位元
static int unit() {
return 0;
}
void set(int idx, int v) {
assert(0 <= idx && idx < size);
int offset = size;
val[offset - 1 + idx] = v;
int segSize = 1;
while (offset > 1) {
val[offset / 2 - 1 + idx / segSize / 2]
= SegmentTree::operate(val[offset - 1 + idx / segSize / 2 * 2 + 0], val[offset - 1 + idx / segSize / 2 * 2 + 1]);
offset /= 2;
segSize *= 2;
}
}
int query(int a, int b, int k, int l, int r) {
// https://www.slideshare.net/iwiwi/ss-3578491 を参考にした
if (r <= a || b <= l) return unit();
// 交差しない？
if (a <= l && r <= b) return val[k];
// 完全に含む？
else {
int vl = query(a, b, k * 2 + 1, l, (l + r) / 2);
int vr = query(a, b, k * 2 + 2, (l + r) / 2, r);
return operate(vl, vr);
}
}
//[a,b)のoperateの結果を得る
//max,gcdなど逆演算ができないものを考慮すると[0,a)が取得できるだけでは不十分
int get(int a, int b) {
return query(a, b, 0, 0, size);
}
};
int TLE() {
volatile int res = 0;
for (int i = 0; i < INF; ++i) {
res += i;
}
return res;
}
void MLE() {
//なぜかvolatile auto *p =new char[N]ではMLEにならない(多分gcc O2の最適化)
constexpr int N = 1024 * 1024 * 1024;
std::vector<char>v(N);
v.back() = 0; //最適化防止？
}
//ジャッジが遅い
void OLE() {
for (int i = 0; i < INF; ++i) {
//endlを出力するとWAになる？
//数字を出力した方がいい？
//ストリーム版だとTLEになる？
printf("8127\n");
}
}
void RE() {
throw 1000000007;
}
template <class T>
int SZ(const T& x) {
return (int)x.size();
}
template <class T>
void PRINT(const T& con) {
cout << "(";
for (auto& one : con) {
cout << one << ",";
}
cout << ")" << endl;
}
//a以上の整数でmで割ってk余る最小の数
//(b以下の最大の数が欲しい場合は適宜帰着して使う)
int minimumMod(int a, int m, int k) {
int res = (a - k) / m * m + k;
if (a <= res - m)return res - m;
if (a <= res)return res;
return res + m;
}
constexpr double pi = 3.141592653589793238462;
//////////////////
#define LOADVEC(type,name,N) std::vector<type>name(N); \
for (int nnn = 0; nnn < N; ++nnn) { \
cin >> name[nnn]; \
}
#define LOADVEC2(type,name0,name1,N) std::vector<type>name0(N),name1(N); \
for (int nnn = 0; nnn < N; ++nnn) { \
cin >> name0[nnn];cin >> name1[nnn]; \
}
#define LOADVEC3(type,name0,name1,name2,N) std::vector<type>name0(N),name1(N),name2(N); \
for (int nnn = 0; nnn < N; ++nnn) { \
cin >> name0[nnn];cin >> name1[nnn];cin >> name2[nnn]; \
}
#define LOAD(type,name) type name; \
cin >> name;
void makeInput() {
int N = 100;
int M = 120;
cout << N << " " << M << endl;
for (int i = 1; i <= N; ++i) {
cout << N * M - rand() % i - i + 1;
if (i != N)cout << " ";
}
cout << endl;
for (int i = 1; i <= M; ++i) {
cout << N * M - rand() % i - i + 1;
if (i != M)cout << " ";
}
cout << endl;
}
void proc();
signed main() {
ios::sync_with_stdio(false);
std::cout << std::setprecision(30);
proc();
//makeInput();
return 0;
}
/*
--------------------------------------------------------
--------------------------------------------------------
--------------- template ----------------------
--------------------------------------------------------
--------------------------------------------------------
*/
#if 0
struct S {
int dis = -1;
};
template<class T>
void Graph<T>::dfsCustom(int pos, int prev) {
int nEdge = 0;
for (auto& e : vertex[pos].edges) {
const int next = e.next;
if (next == prev) continue;
if (val(next).dis == -1) {
val(next).dis = val(pos).dis + 1;
dfsCustom(next, pos);
++nEdge;
}
else if (val(next).dis < val(pos).dis) {
//ここに来たなら木ではない(後退辺の処理)
assert(false);
}
}
//
int rat = K - 1;
if (val(pos).dis == 0) {
for (int i = 0; i < nEdge; ++i) {
res *= rat;
modify(res);
--rat;
}
}
else {
--rat;
for (int i = 0; i < nEdge; ++i) {
res *= rat;
modify(res);
--rat;
}
}
}
#endif
void proc() {
LOAD(int, N);
LOAD(int, Q);
LOADVEC(int, A, N);
LOADVEC(int, X, Q);
if (N % 2 == 1) {
A.insert(A.begin(), -INF);
++N;
}
std::vector<int>odd, even;
for (int i = 0; i < N; ++i) {
if (i % 2 == 0) {
even.push_back(A[i]);
}
else {
odd.push_back(A[i]);
}
}
auto sumOdd = MAKESUM(odd);
auto sum = MAKESUM(A);
//
for (auto& x : X) {
auto ok = [&](int n) ->bool {
if (abs(x - A[N - 1 - 2 * n]) > abs(x - A[N - 1 - n]))return true;
return false;
};
int L = 0;
int R = N / 2;
while (L + 1 < R) {
int C = (L + R) / 2;
if (ok(C)) {
R = C;
}
else {
L = C;
}
}
int res = 0;
int nn = (N - 2 * R) / 2;
res += sumOdd[nn] - sumOdd[0];
res += sum[N] - sum[N - R];
cout << res << endl;
}
}
#endif
|
p03158 | C++ | #include<bits/stdc++.h>
#define ll long long
#define fornum(A,B,C) for(A=B;A<C;A++)
using namespace std;
/////////////////////////////////////////////////////
#define pii pair<int,int>
#define pll pair<ll,ll>
#define piii pair<int,pii>
#define mp make_pair
ll N,Q;
ll A[101010],X[101010];
ll sm[101010], esm[101010];
ll i, j, k, ans;
int main(){
scanf("%lld%lld", &N, &Q);
if(N%2){
A[0] = 0;
j = 1;
N++;
}
fornum(i,j,N){
scanf("%lld", &A[i]);
}
fornum(i,0,Q){
scanf("%lld", &X[i]);
}
fornum(i,0,N){
sm[i + 1] = sm[i] + A[i];
}
for (i = 2; i <= N;i+=2){
esm[i] = esm[i + 1] = esm[i - 1] + A[i - 1];
}
fornum(i,0,Q){
if(N==2||abs(X[i]-A[N-3])>abs(X[i]-A[N-2])){
printf("%lld\n", esm[N]);
continue;
}
ll l = 2, r = N / 2;
while(l<r){
ll c = (l + r + 1) / 2;
//printf("%lld:%lld,%lld:%lld\n", l, r,c, cc);
if (abs(X[i]-A[N - c * 2 + 1]) > abs(X[i]-A[N - c]))
{
r = c-1;
}else{
l = c;
}
}
ll a = l;
printf("%lld\n", sm[N] - sm[N - a] + esm[N - a * 2]);
/*
l = 2;
r = N / 2;
while(l<r){
ll c = (l + r) / 2;
ll cc = ck(X[i], c);
if (c>0&&abs(X[i]-A[N - c * 2]) <= abs(X[i]-A[N - c]-1))
{
l = c+1;
}else{
l = c;
}
}
printf("%lld\n", sm[N] - sm[N - r] + esm[N - r * 2]);
*/
}
return 0;
} |
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
#define int long long
int N,Q;
vector<int> v;
bool f(int a,int x){//青木ゾーンは長さがa以上か
int A=v[N-a]-x;//高橋が伸ばした長さ
if(A<0)return false;
//高橋くんはa手かけてるわけで、青木くんがv[N-a-1]をa-1手以内にとるならfalse
//値がx-A以上x+A未満の個数がa-2以下ならfalse
if(v.begin()+N-a-lower_bound(v.begin(),v.end(),x-A)<a-1)return false;
return true;
}
int w[123456],kougo[123456];
int g(int l){
return w[l]+kougo[N-2*l+1];
}
signed main(){
cin>>N>>Q;
vector<int>q(Q);
v.resize(N);
for(int i=0;i<N;i++)cin>>v[i];
for(int i=0;i<Q;i++)cin>>q[i];
//各q[i]に対してのそれは 交互、高橋、青木 になるはずなので青木ゾーンがどこまでか求められればいい
//これはにぶたんで求められる気がする
for(int i=0;i<N;i++)w[i+1]=w[i]+v[N-i-1];
for(int i=0;i<N;i++)kougo[i+2]=kougo[i]+v[i];
//for(int i=0;i<10;i++)cout<<w[i]<<" ";cout<<endl;
//for(int i=0;i<10;i++)cout<<kougo[i]<<" ";cout<<endl;
for(int i=0;i<Q;i++){
int l=0,r=N/2+2;//青木ゾーンの長さ
while(r-l>1){
int m=(r+l)>>1;
if(f(m,q[i]))l=m;
else r=m;
}
//cout<<i<<" "<<l<<endl;
cout<<g(l)<<endl;
}
}
|
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vs = vector<string>;
using pll = pair<ll, ll>;
using vp = vector<pll>;
template<class T> using V = vector<T>;
template<class T> using VV = vector<vector<T> >;
#define rep(i, n) for(ll i = 0; i < (n); i++)
#define repb(i, n) for(ll i = (n)-1; i >= 0; i--)
#define repr(i, a, b) for(ll i = (a); i < (b); i++)
#define reprb(i, a, b) for(ll i = (a)-1; i >= (b); i--)
#define ALL(a) (a).begin(), (a).end()
#define SZ(x) ((ll)(x).size())
const ll MOD = 1000000007;
const ll INF = 100000000000000000LL;
inline ll GCD(ll a, ll b){ return b?GCD(b, a % b):a; }
inline ll LCM(ll a, ll b){ return a/GCD(a, b)*b; }
inline ll powint(unsigned long long x, ll y){ ll r=1; while(y){ if(y&1) r*=x; x*=x; y>>=1; } return r; }
inline ll powmod(ll x, ll y, ll m = MOD){ ll r=1; while(y){ if(y&1) r*=x; x*=x; r%=m; x%=m; y>>=1; } return r; }
template<class S, class T>inline bool chmax(S &a, const T &b){ if(a<b) { a=b; return 1; } return 0; }
template<class S, class T>inline bool chmin(S &a, const T &b){ if(b<a) { a=b; return 1; } return 0; }
#ifdef OJ_LOCAL
#include "dump.hpp"
#else
#define dump(...) ((void)0)
#endif
int main(){
cin.tie(0); ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
ll n, q;
cin >> n >> q;
vll a(n);
rep(i, n){
cin >> a[i];
}
vll x(q);
rep(i, q){
cin >> x[i];
}
// cond[i].f <= x < cond[i+1].f -> ans = cond[i].s
vp cond;
ll s = 0;
for(ll i = n-1; i >= 0; i -= 2){
s += a[i];
}
for(ll i = n-2; 2*i+1-n >= 0; i--){
cond.emplace_back((a[2*i+1-n]+a[i])>>1, s);
s -= a[2*i+1-n];
s += a[i];
}
cond.emplace_back(0, accumulate(ALL(a), 0ll)-accumulate(a.begin(), a.begin()+n/2, 0ll));
reverse(ALL(cond));
rep(i, q){
auto itr = lower_bound(ALL(cond), pll(x[i], 0));
itr--;
cout << itr->second << endl;
}
return 0;
} |
p03158 | C++ | #include<bits/stdc++.h>
#include<boost/variant.hpp>
using namespace std;
typedef long long ll;
typedef vector<boost::variant<bool, ll, int, string, double, char*, const char*>> any;
template<typename T> inline void pr(const vector<T> &xs){
for(int i=0; i<xs.size()-1; i++) cout<<xs[i]<<" ";
(xs.empty()?cout:(cout<<xs[xs.size()-1]))<<endl;
}
#ifdef DEBUG
#define debug(...) pr(any{__VA_ARGS__})
#define debugv(x) pr((x))
#else
#define debug(...)
#define debugv(x)
#endif
int N, Q;
vector<ll> A;
vector<ll> cumsum, esum;
void solve(){
int x;
cin >> x;
int lb = 0, ub = (N+1)/2;
while(ub-lb>1){
int k = (ub+lb)/2;
int l = max(0, N-1-2*k);
//debug(x, k, lb, ub, l, abs(x-A[N-1-k]), abs(x-A[l]));
if(abs(x-A[N-1-k])<abs(x-A[l])){
ub = k;
} else {
lb = k;
}
//debug(lb, ub);
}
debug(x, ub);
ll ans = cumsum[N-1]-cumsum[N-1-ub];
if(N%2){
if(N-1-2*ub>=0) ans += esum[N-1-2*ub];
} else {
if(N-1-2*ub>=1) ans += cumsum[N-1-2*ub]-esum[N-2-2*ub];
}
cout << ans << endl;
}
int main(){
cin >> N >> Q;
A.assign(N, 0);
for(int i=0; i<N; i++) cin >> A[i];
cumsum.assign(N, 0);
esum.assign(N, 0);
cumsum[0] = A[0];
esum[0] = A[0];
for(int i=1; i<N; i++){
cumsum[i] = cumsum[i-1]+A[i];
esum[i] = esum[i-1] + (i%2?0:A[i]);
}
for(int q=0; q<Q; q++) solve();
return 0;
}
|
p03158 | C++ | #include <bits/stdc++.h>
#include <boost/format.hpp>
#include <boost/integer/common_factor_rt.hpp>
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/optional.hpp>
#ifdef DEBUG
#include "libs/debug.cpp"
#define DEBUG 1
#else
#define DEBUG 0
#endif
#define rep(i, n) repr((i), 0, (n))
#define repr(i, a, t) reps((i), (a), (t), 1)
#define reps(i, a, t, s) for (long long (i) = (a); (i) < (long long)(t); (i) += (s))
#define rrep(i, n) rrepr((i), (n) - 1, 0)
#define rrepr(i, a, t) rreps((i), (a), (t), 1)
#define rreps(i, a, t, s) for (long long (i) = (a); (i) >= (long long)(t); (i) -= (s))
#define each(v, c) for (auto &&(v) : (c))
#define all(c) (c).begin(), (c).end()
using namespace std;
namespace mp = boost::multiprecision;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using ml = mp::cpp_int;
template<typename T>
using optional = boost::optional<T>;
const auto none = boost::none;
const long long MOD = 1e9 + 7;
const long long INF = 1e18;
ll tleft(function<ll(ll)> fn, ll lo, ll hi) {
ll left = lo;
ll right = hi;
while (abs(right - left) >= 3) {
ll r1 = (left * 2 + right) / 3;
ll r2 = (left + right * 2) / 3;
if (fn(r1) <= fn(r2)) {
right = r2;
} else {
left = r1;
}
}
if (left + 1 >= hi || fn(left) <= fn(left + 1)) {
return left;
}
if (left + 2 >= hi || fn(left + 1) <= fn(left + 2)) {
return left + 1;
}
return left + 2;
}
pair<ll, ll> lr(ll x, ll cnt, const vector<ll> &A) {
ll l = tleft([&](ll l) { return max(abs(A[l + cnt - 1] - x), abs(A[l] - x)); }, 0, A.size() - cnt);
return make_pair(l, l + cnt);
}
ll solve(ll x, const vector<ll> &A, const vector<ll> >_sum, const vector<ll> <_sum) {
ll N = A.size();
if (x > A[N - 2]) return lt_sum[N - 1];
ll ok = 1;
ll ng = N / 2 + 1;
while (abs(ok - ng) > 1) {
ll cnt = (ok + ng) / 2;
ll l, r;
tie(l, r) = lr(x, cnt, A);
if (r <= N - cnt) {
ok = cnt;
} else {
ng = cnt;
}
}
ll cnt = ok;
ll l, r;
tie(l, r) = lr(x, cnt, A);
if (r < N - cnt) {
cnt++;
}
ll ans = 0;
if (0 <= N - cnt && N - cnt < N) {
ans += gt_sum[N - cnt];
}
if (0 <= N - cnt * 2 - 1 && N - cnt * 2 - 1 < N) {
ans += lt_sum[N - cnt * 2 - 1];
}
return ans;
}
int main() {
cout << fixed << setprecision(10);
cin.tie(nullptr);
ios::sync_with_stdio(false);
ifstream ifs;
if (DEBUG) {
ifs.open("src/_in.txt");
cin.rdbuf(ifs.rdbuf());
}
ll N, Q;
cin >> N >> Q;
vector<ll> A;
rep (i, N) {
ll v0;
cin >> v0;
A.push_back(v0);
}
vector<ll> X;
rep (i, Q) {
ll v0;
cin >> v0;
X.push_back(v0);
}
vector<ll> gt_sum(N);
ll s = 0;
rrep (i, N) {
s += A[i];
gt_sum[i] = s;
}
vector<ll> lt_sum(N);
s = 0;
reps (i, 0, A.size(), 2) {
s += A[i];
lt_sum[i] = s;
}
s = 0;
reps (i, 1, A.size(), 2) {
s += A[i];
lt_sum[i] = s;
}
each (x, X) {
cout << solve(x, A, gt_sum, lt_sum) << "\n";
}
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.