p_id
stringlengths 6
6
| language
stringclasses 10
values | code
stringlengths 11
983k
|
|---|---|---|
p03158 | C++ | #include <iostream>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using namespace std;
template<class T>
constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208;
int main() {
int n, q;
cin >> n >> q;
vector<ll> v(n), s(n+1, 0), s2(n+1, 0);
for (auto &&i : v) scanf("%lld", &i);
for (int i = 0; i < n; ++i) {
if(i == 0) s2[1] = v[i];
else s2[i+1] = s2[i-1] + v[i];
s[i+1] = s[i]+v[i];
}
for (int i = 0; i < q; ++i) {
int X;
scanf("%d", &X);
int low = 0, high = n;
while(high-low > 1){
int mid = (low+high)/2;
if(v[mid-1] < X) low = mid;
else {
int tak = n-mid;
int ao = mid - (lower_bound(v.begin(), v.end(), max(1LL, 2*X-v[mid-1]))- v.begin());
(tak < ao ? high : low) = mid;
}
}
ll ans = s[n]-s[low];
if(2*low >= n) ans += s2[2*low-n];
printf("%lld\n", ans);
}
return 0;
}
|
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,a) for(int i=0;i<(a);i++)
const ll MOD=1000000007;
int N,Q;
ll A[101010],sum[101010],sumE[101010],sumO[101010];
int main(){
cin>>N>>Q;
for(int i=1;i<=N;i++){
cin>>A[i];
sum[i]=sum[i-1]+A[i];
sumE[i]=sumE[i-1]+(i%2==0?A[i]:0);
sumO[i]=sumO[i-1]+(i%2?A[i]:0);
}
while(Q--){
int X; cin>>X;
ll res=0;
int ok=0,ng=N+1;
while(abs(ng-ok)>1){
int mid=(ok+ng)/2;
int l=N-mid+1,r=N-mid/2+(mid%2==0);
if(abs(A[l]-X)<=(abs(A[r]-X))) ok=mid;
else ng=mid;
}
// 上からok個まで、あとは偶奇
int r=N-ok/2+(ok%2==0),l=N-ok+1;
if(r==l){
if(N%2) cout<<sumO[N]<<endl;
else cout<<sumE[N]<<endl;
continue;
}
res=sum[N]-sum[r-1];
if((l-1)%2){
if(ok%2) res+=sumE[l-1];
else res+=sumO[l-1];
}else{
if(ok%2) res+=sumO[l-1];
else res+=sumE[l-1];
}
cout<<res<<endl;
}
return 0;
}
|
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,a) for(int i=0;i<(a);i++)
const ll MOD=1000000007;
int N,Q;
ll A[101010],sum[101010],sumE[101010],sumO[101010];
int main(){
cin>>N>>Q;
for(int i=1;i<=N;i++){
cin>>A[i];
sum[i]=sum[i-1]+A[i];
sumE[i]=sumE[i-1]+(i%2==0?A[i]:0);
sumO[i]=sumO[i-1]+(i%2?A[i]:0);
}
while(Q--){
int X; cin>>X;
ll res=0;
int ok=0,ng=N+1;
while(abs(ng-ok)>1){
int mid=(ok+ng)/2;
int l=N-mid+1,r=N-mid/2+(mid%2==0);
if(abs(A[l]-X)<=(abs(A[r]-X))) ok=mid;
else ng=mid;
}
int r=N-ok/2+(ok%2==0),l=N-ok+1;
if(r==l){
if(N%2) cout<<sumO[N]<<endl;
else cout<<sumE[N]<<endl;
continue;
}
res=sum[N]-sum[r-1];
if((l-1)%2){
if(ok%2) res+=sumE[l-1];
else res+=sumO[l-1];
}else{
if(ok%2) res+=sumO[l-1];
else res+=sumE[l-1];
}
cout<<res<<endl;
}
return 0;
}
|
p03158 | C++ | #include "bits/stdc++.h"
#define in std::cin
#define out std::cout
#define rep(i,N) for(LL i=0;i<N;++i)
typedef long long int LL;
int main()
{
LL N, Q;
in >> N >> Q;
std::vector<LL>A(N), X(Q);
rep(i, N) in >> A[i];
rep(i, Q) in >> X[i];
std::vector<LL>imos1(N + 1), imos2(N + 1);
rep(i, N)
{
imos1[i + 1] = imos1[i] + A[i];
imos2[i + 1] += imos2[i];
if (N % 2 != i % 2) imos2[i + 1] += A[i];
}
rep(i, Q)
{
LL it1 = std::upper_bound(A.begin(), A.end(), X[i]) - A.begin();
LL left = it1 - 1, right = N;
if (left >= N - 1)
{
out << imos2[N] << std::endl;
continue;
}
while (right - left > 1)
{
LL mid = (left + right) / 2;
LL dis = A[mid] - X[i];
LL it2 = std::lower_bound(A.begin(), A.end(), X[i] - dis) - A.begin();
LL cnt = mid - it2 + 1;
if (N - cnt <= mid) right = mid;
else left = mid;
}
++left;
LL cnt = N - left;
out << (imos1[N] - imos1[left]) + imos2[std::max(left - cnt, 0LL)] << std::endl;
}
}
|
p03158 | C++ | #include "bits/stdc++.h"
#define in std::cin
#define out std::cout
#define rep(i,N) for(LL i=0;i<N;++i)
typedef long long int LL;
int main()
{
LL N, Q;
in >> N >> Q;
std::vector<LL>A(N), X(Q);
rep(i, N) in >> A[i];
rep(i, Q) in >> X[i];
std::vector<LL>imos1(N + 1), imos2(N + 1);
rep(i, N)
{
imos1[i + 1] = imos1[i] + A[i];
imos2[i + 1] += imos2[i];
if (N % 2 != i % 2) imos2[i + 1] += A[i];
}
rep(i, Q)
{
LL it1 = std::upper_bound(A.begin(), A.end(), X[i]) - A.begin();
LL left = it1 - 1, right = N;
if (left == N - 1)
{
out << imos2[N] << std::endl;
continue;
}
while (right - left > 1)
{
LL mid = (left + right) / 2;
LL dis = std::abs(A[mid] - X[i]);
LL it2 = std::lower_bound(A.begin(), A.end(), X[i] - dis) - A.begin();
LL cnt = mid - it2 + 1;
if (N - cnt <= mid) right = mid;
else left = mid;
}
++left;
LL cnt = N - left;
out << (imos1[N] - imos1[left]) + imos2[std::max(left - cnt, 0LL)] << std::endl;
}
}
|
p03158 | C++ | #include <iostream>
#include <utility>
#include <cmath>
#include <algorithm>
#include <string>
#include <set>
#include <queue>
#define MAX_N 100005
#define PRINT_NAME(Variable) cout<<(#Variable)<<": "<<(Variable)<<endl;
using namespace std;
typedef long long ll;
int N,Q;
vector<ll> A;
vector<ll> sum,esum; //i*2番目までの偶数番目の和
ll X;
int main(){
int N,Q;
cin >> N >> Q;
A.resize(N);
sum.resize(N);
esum.resize((N+1)/2);
for(int i = 0;i < N;i++){
cin>>A[i];
}
sum[0]=A[0];
esum[0]=A[0];
for(int i = 1;i < N;i++){
sum[i]=sum[i-1]+A[i];
}
for(int i = 1;i < (N+1)/2;i++){
esum[i]=esum[i-1]+A[i*2];
}
// for(int i = 0;i < N;i++){
// cout<<sum[i]<<" "<<esum[i]<<endl;
// }
for(int fjsa=0;fjsa<Q;fjsa++){
cin>>X;
ll ans = 0;
int I,J;
int left = 0,right = N;
int Acount,Tcount;
while(right-left>1){
int mid = (left+right)/2;
ll range = A[mid]-X;
if(range<0){
left = mid;
continue;
}
Acount = mid+1-(lower_bound(A.begin(),A.end(),X-range)-A.begin());
Tcount = N-mid-1;
if(Acount>Tcount){
right = mid;
}else{
left = mid;
}
}
J=left;
Tcount = N-J-1;
I=J-Tcount;
// cout<<"I: "<<I<<" J: "<<J<<endl;
ans += sum[N-1]-sum[J];
if(I>=0){
if(I%2==1){
ans += sum[I] - esum[I/2];
}else{
ans += esum[I/2];
}
}
cout<<ans<<endl;
}
}
|
p03158 | C++ | // includes
#include <cstdio>
#include <cstdint>
#include <iostream>
#include <iomanip>
#include <string>
#include <queue>
#include <stack>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <utility>
#include <functional>
#include <cmath>
#include <climits>
#include <bitset>
// macros
#define ll long long int
#define pb push_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using namespace std;
// types
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
typedef pair<double, double> Pd;
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1e9 + 7;
// solve
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(a > b){a = b; return 1;} return 0;}
int main(int argc, char const* argv[])
{
int n, q;
cin >> n >> q;
vector<ll> a(n+1);
vector<ll> sum(n+1), even(n+1);
rep(i, n){
cin >> a[i];
sum[i] = a[i];
if(i > 0)sum[i] += sum[i-1];
even[i] = a[i];
if(i > 1)even[i] += even[i-2];
}
if(n % 2 == 1){
for(int i = n - 1; i >= 0; i--)a[i+1] = a[i];
for(int i = n - 1; i >= 0; i--)sum[i+1] = sum[i];
for(int i = n - 1; i >= 0; i--)even[i+1] = even[i];
a[0] = sum[0] = even[0] = 0;
n++;
}
rep(i, q){
ll x;
cin >> x;
int ld = 0;
int rd = n / 2;
while(rd - ld > 1){
int p = (rd + ld) / 2;
if(x < a[n-2*p] && n-2*p>0 && abs(x-a[n-2*p])>abs(x-a[n-2*p-1])){
ld = p;
}else if(x > a[n-p-1] && abs(x-a[n-p-1]) > abs(x-a[n-p])){
rd = p - 1;
}else{
if(abs(x-a[n-2*p+1]) > abs(x-a[n-p])){
rd = p - 1;
}else if(n-2*p-1>=0 && abs(x-a[n-2*p-1]) <= abs(x-a[n-p-1])){
ld = p;
}else{
rd = p;
break;
}
}
}
ll res = 0;
res = sum[n - 1] - sum[n - rd - 1];
if(n-2*rd-1>=0)res += even[n-2*rd-1];
cout << res << endl;
}
return 0;
}
|
p03158 | C++ | #define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <unordered_map>
#include <functional>
#include <utility>
#include <tuple>
#include <cctype>
#include <bitset>
#include <complex>
#include <cmath>
#include <array>
#include <numeric>
using namespace std;
#define INF 0x3f3f3f3f
#define INFLL 0x3f3f3f3f3f3f3f3fLL
//#define mod 998244353
#define MOD 1000000007
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pint;
typedef pair<ll,ll> pll;
typedef tuple<int,int,int> tint;
typedef vector<int> vint;
typedef vector<ll> vll;
typedef vector<ull> vull;
typedef vector<pint> vpint;
int dx[8]={0,0,-1,1,1,1,-1,-1};
int dy[8]={-1,1,0,0,1,-1,1,-1};
const int SIZE=200050;
//templete
int main() {
ll N,Q;
cin>>N>>Q;
vll A;
for(int i=0;i<N;i++){
ll a;
cin>>a;
A.pb(a);
}
ll tes[SIZE]={},ket[SIZE]={}; //累積和、右から偶数番目の累積和
for(int i=0;i<N;i++){
if((N-i)%2)
ket[i]+=A[i];
tes[i]+=A[i];
}
for(int i=1;i<N;i++){
tes[i]+=tes[i-1];
ket[i]+=ket[i-1];
}
while(Q--){
ll x;
cin>>x;
ll ans=0;
//青木くんが最初にとるカードより右のカードで、青木くんが取るものと高橋くんが取るものの境界を求める
int aoki=0,takahashi=N;
while(takahashi-aoki>1){
ll idx=(aoki+takahashi)/2;
if(A[idx]<x){
aoki=idx;
continue;
}
//高橋くんは、idx番目のカードをN-idx番目に取る
//青木くんは、idx番目のカードをord番目に取る
ll ord=upper_bound(A.begin(),A.end(),A[idx])-lower_bound(A.begin(),A.end(),x-(A[idx]-x));
if(ord<N-idx)
aoki=idx;
else
takahashi=idx;
}
ans+=tes[N-1]-tes[aoki];
//aokiくんはaoki-(N-takahashi)番目まで取る
ll und=aoki-(N-takahashi);
if(und>=0)
ans+=ket[und];
cout<<ans<<endl;
}
return 0;
} |
p03158 | C++ | #define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <unordered_map>
#include <functional>
#include <utility>
#include <tuple>
#include <cctype>
#include <bitset>
#include <complex>
#include <cmath>
#include <array>
#include <numeric>
using namespace std;
#define INF 0x3f3f3f3f
#define INFLL 0x3f3f3f3f3f3f3f3fLL
//#define mod 998244353
#define MOD 1000000007
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pint;
typedef pair<ll,ll> pll;
typedef tuple<int,int,int> tint;
typedef vector<int> vint;
typedef vector<ll> vll;
typedef vector<ull> vull;
typedef vector<pint> vpint;
int dx[8]={0,0,-1,1,1,1,-1,-1};
int dy[8]={-1,1,0,0,1,-1,1,-1};
const int SIZE=200050;
//templete
int main() {
ll N,Q;
cin>>N>>Q;
vll A;
for(int i=0;i<N;i++){
ll a;
cin>>a;
A.pb(a);
}
ll tes[SIZE]={},ket[SIZE]={}; //累積和、右から偶数番目の累積和
for(int i=0;i<N;i++){
if((N-i)%2)
ket[i]+=A[i];
tes[i]+=A[i];
}
for(int i=1;i<N;i++){
tes[i]+=tes[i-1];
ket[i]+=ket[i-1];
}
while(Q--){
ll x;
cin>>x;
ll ans=0;
//青木くんが最初にとるカードより右のカードで、青木くんが取るものと高橋くんが取るものの境界を求める
int aoki=0,takahashi=N;
while(takahashi-aoki>1){
ll idx=(aoki+takahashi)/2;
if(A[idx]<x){
aoki=idx;
continue;
}
//高橋くんは、idx番目のカードをN-idx番目に取る
//青木くんは、idx番目のカードをord番目に取る
ll ord=upper_bound(A.begin(),A.end(),A[idx])-lower_bound(A.begin(),A.end(),x-(A[idx]-x));
if(ord<N-idx)
aoki=idx;
else
takahashi=idx;
}
ans+=tes[N-1]-tes[aoki];
//aokiくんはaoki-(N-takahashi)番目まで取る
ll und=aoki-(N-takahashi);
if(und>=0)
ans+=ket[und];
//cout<<aoki<<" "<<takahashi<<" "<<und<<endl;
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;
using P = pair<ll, ll>;
using namespace std;
template<class T> void vin(vector<T>& v, int n) {
v.resize(n);
for (int i = 0; i < n; ++i) {
cin >> v[i];
}
}
ll sum[101010], kogo[101010];
int main() {
ll N, Q;
cin >> N >> Q;
vector<ll> A(N);
rep(i, N) cin >> A[i];
for (int i=1; i<=N; ++i) {
sum[i] = sum[i-1] + A[i-1];
kogo[i] = A[i-1];
if (i>=2) kogo[i] += kogo[i-2];
}
vector<ll> X, S;
for (int p=N/2; p>=1; --p) {
ll x = (A[N-p-1] + A[N-2*p-1])/2 + 1;
ll sc = (sum[N] - sum[N-p]) + kogo[N-2*p];
X.push_back(x);
S.push_back(sc);
}
//rep(i, S.size()) cout << S[i] << " \n"[i == S.size()-1];
X.push_back(1e10);
rep(i, Q) {
ll x;
cin >> x;
int cur = upper_bound(X.begin(), X.end(), x) - X.begin();
if (cur == 0) {
cout << sum[N] - sum[N-N/2-bool(N%2)] << endl;
}
else {
cout << S[cur-1] << endl;
}
}
return 0;
}
|
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
#define REP(var, n) for (decltype(n) var = 0; var < (n); var++)
#define RREP(var, n) for (auto var = n - 1; var != static_cast<decltype(var)>(-1); var--)
#define FOR(var, a, b) for (auto var = (a); var < (b); var++)
#define RFOR(var, a, b) for (auto var = b - 1; var != a; var--)
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;
#define all(c) begin(c),end(c)
template<typename T>
std::ostream &operator<<(std::ostream &out, const std::vector<T> &v) {
if (!v.empty()) {
out << '[';
std::copy(v.begin(), v.end(), std::ostream_iterator<T>(out, ", "));
out << "\b\b]";
}
return out;
}
template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
return os << '(' << p.first << ',' << p.second << ')';
}
auto solve() {
int N, Q;
cin >> N >> Q;
vi A(N);
for (auto &&e:A) cin >> e;
vi left(N);
left[N - 1] = N - 1;
for (int j = N - 2; j >= 0; --j) {
left[j] = max(0, left[j + 1] - 2);
}
vll acc(N, 0);
acc[N - 1] = A[N - 1];
for (int j = N - 2; j >= 0; --j) {
acc[j] = acc[j + 1] + A[j];
}
vll even(N, 0), odd(N, 0);
even[0] = A[0];
FOR(i, 1, N) {
even[i] = even[i - 1];
odd[i] = odd[i - 1];
if (i % 2 == 0) even[i] += A[i];
else odd[i] += A[i];
}
while (Q--) {
int X;
cin >> X;
auto it = lower_bound(all(A), X);
int i = distance(begin(A), it);
int l = i - 1;
int r = N - 1;
while (r - l > 1) {
int med = ((ll) l + r) / 2;
int L = N - med - 1;
if (med - i + 1 > L) {
r = med;
} else if (med < L) {
l = med;
} else {
if (abs(A[left[med]] - X) > abs(X - A[med])) {
l = med;
} else {
r = med;
}
}
}
ll res = acc[r];
int L = N - r;
int s = r - L - 1;
if (s >= 0) {
if (s % 2 == 0) res += even[s];
else res += odd[s];
}
cout << res << endl;
}
}
int main() {
cout.precision(10);
cin.tie(0);
ios::sync_with_stdio(false);
// cout << solve() << endl;
solve();
return 0;
}
|
p03158 | C++ | #include<cstdio>
#include<cstdlib>
#include<cmath>
#include<vector>
#include<algorithm>
#include<iostream>
#include <iterator>
using namespace std;
long A[100000];
long sumO[100000],sumE[100000],sum[100000];
//TODO two way search
int solve(long X, int N){
int ub = N+1,lb = 1,t;
t = (ub + lb)/2;
while(ub - lb >1){
if(abs(A[N-t]-X) > abs(A[N-(t+1)/2]-X)){
ub = t;
}else{
lb = t;
}
t = (ub+lb)/2;
}
// for(int i=1;i<N+1;i++){
// if(abs(A[N-i]-X) > abs(A[N-(i+1)/2]-X)) return i-1;
// }
return t;
}
void calcSum(int N){
sumE[0] = A[0];
sumO[0] = 0;
sum[0] = A[0];
for(int i=1;i<N;i++){
sum[i] = sum[i-1]+A[i];
sumE[i] = sumE[i-1] + (i%2 == 0 ? A[i] : 0);
sumO[i] = sumO[i-1] + (i%2 == 1 ? A[i] : 0);
}
}
int main(void){
int N,Q;
long X[100000];
cin >> N >> Q;
for(int i=0;i < N;i++){
cin >> A[i];
}
calcSum(N);
for(int i=0;i < Q;i++){
cin >> X[i];
}
for(int i=0;i < Q;i++){
int a = solve(X[i],N);
long sum1 = sum[N-1] - sum[N -(a+1)/2 -1];
long sum2;
if(N!=a){
if(N%2 == 0)sum2 = sumO[N - a - 1];
else sum2 = sumE[N - a - 1];
}else{
sum2 = 0;
}
// for(int j=N -((a+1)/2)*2 -1;j>=0;j-=2){
// sum2 += A[j];
// }
cout << sum1 + sum2 << endl;
}
return 0;
} |
p03158 | C++ | #include<cstdio>
#include<cstdlib>
#include<cmath>
#include<vector>
#include<algorithm>
#include<iostream>
#include <iterator>
using namespace std;
long A[100000];
long sumO[100000],sumE[100000],sum[100000];
//TODO two way search
int solve(long X, int N){
int ub = N+1,lb = 1,t;
t = (ub + lb)/2;
while(ub - lb >1){
if(abs(A[N-t]-X) > abs(A[N-(t+1)/2]-X)){
ub = t;
}else{
lb = t;
}
t = (ub+lb)/2;
}
// for(int i=1;i<N+1;i++){
// if(abs(A[N-i]-X) > abs(A[N-(i+1)/2]-X)) return i-1;
// }
return t;
}
void calcSum(int N){
sumE[0] = A[0];
sumO[0] = long(0);
sum[0] = A[0];
for(int i=1;i<N;i++){
sum[i] = sum[i-1]+A[i];
sumE[i] = sumE[i-1] + (i%2 == 0 ? A[i] : long(0));
sumO[i] = sumO[i-1] + (i%2 == 1 ? A[i] : long(0));
}
}
int main(void){
int N,Q;
long X[100000];
cin >> N >> Q;
for(int i=0;i < N;i++){
cin >> A[i];
}
calcSum(N);
for(int i=0;i < Q;i++){
cin >> X[i];
}
for(int i=0;i < Q;i++){
int a = solve(X[i],N);
long sum1 = sum[N-1] - sum[N -(a+1)/2 -1];
long sum2;
if(N!=a){
if(N%2 == 0)sum2 = sumO[N - a - 1];
else sum2 = sumE[N - a - 1];
}else{
sum2 = long(0);
}
// for(int j=N -((a+1)/2)*2 -1;j>=0;j-=2){
// sum2 += A[j];
// }
cout << sum1 + sum2 << endl;
}
return 0;
} |
p03158 | C++ |
#include <bits/stdc++.h>
#define null ""
#define all(dat) dat.begin(), dat.end()
#define over(msg) cout << msg << endl, exit(0);
#define loop(i, to) for (int i = 0; i < to; ++i)
#define cont(i, to) for (int i = 1; i <= to; ++i)
#define foreach(i, dat) for (__typeof(dat.begin()) i = dat.begin(); i != dat.end(); ++i)
typedef long long num;
using namespace std;
int n, q;
num a[100005], pre[100005], pres[2][100005], ans;
int main() {
ios_base::sync_with_stdio(0);
cin >> n >> q;
loop (i, n) {
cin >> a[i];
pre[i + 1] = pre[i] + a[i];
pres[i % 2][i + 1] = pres[i % 2][i] + a[i];
pres[(i % 2) ^ 1][i + 1] = pres[(i % 2) ^ 1][i];
}
cont (cas, q) {
num x, l = 0, r = n, mid;
cin >> x;
while (l < r) {
mid = (l + r) >> 1;
int pos = (int) (lower_bound(a, a + n, x - (a[mid] - x)) - a);
if (mid - pos < n - mid - 1) {
l = mid + 1;
} else {
r = mid;
}
}
ans = pre[n] - pre[l] + pres[(n % 2) ^ 1][l - (n - l)];
cout << ans << '\n';
}
}
// 大概的选取方法:
// T A T A T A T A ... T | A A A ... A A A | T T T ... T T T
// ^ 二分该端点
// 时间复杂度:
// O(n log^2 n)
|
p03158 | C++ |
#include <bits/stdc++.h>
#define null ""
#define all(dat) dat.begin(), dat.end()
#define over(msg) cout << msg << endl, exit(0);
#define loop(i, to) for (int i = 0; i < to; ++i)
#define cont(i, to) for (int i = 1; i <= to; ++i)
#define foreach(i, dat) for (__typeof(dat.begin()) i = dat.begin(); i != dat.end(); ++i)
typedef long long num;
using namespace std;
int n, q;
num a[100005], pre[100005], pres[2][100005], ans;
int main() {
ios_base::sync_with_stdio(0);
cin >> n >> q;
loop (i, n) {
cin >> a[i];
pre[i + 1] = pre[i] + a[i];
pres[i % 2][i + 1] = pres[i % 2][i] + a[i];
pres[(i % 2) ^ 1][i + 1] = pres[(i % 2) ^ 1][i];
}
cont (cas, q) {
num x, l = 0, r = n, mid;
cin >> x;
while (l < r) {
mid = (l + r) >> 1;
int pos = (int) (lower_bound(a, a + n, x - (a[mid] - x)) - a);
if (mid - pos < n - mid - 1) {
l = mid + 1;
} else {
r = mid;
}
}
ans = pre[n] - pre[l] + pres[(n % 2) ^ 1][l - (n - l)];
cout << ans << '\n';
}
}
|
p03158 | C++ | //MLEが動かない
//セグフォは関数内で要素のでかい配列を定義しているから
//todo idef DEBUGで、境界チェック付きのvectorを作りたい
//http://marycore.jp/prog/cpp/class-extension-methods/
//現状ifdef DEBUG が何故か動かないので出来ない
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define double long double
struct initon {
initon() {
cin.tie(0);
ios::sync_with_stdio(false);
cout.setf(ios::fixed);
cout.precision(16);
};
} hoee;
namespace std {
template<>
class hash<std::pair<signed, signed>> {
public:
size_t operator()(const std::pair<signed, signed> &x) const {
return hash<ll>()(((ll) x.first << 32) + x.second);
}
};
template<>
class hash<std::pair<ll, ll>> {
public:
size_t operator()(const std::pair<ll, ll> &x) const {
return hash<ll>()(((ll) x.first << 32) + x.second);
}
};
}
struct Tri {
int f, s, t;
Tri() {
f = -1, s = -1, t = -1;
}
Tri(int f, int s, int t) : f(f), s(s), t(t) {}
bool operator<(const Tri &r) const {
return f != r.f ? f < r.f : s != r.s ? s < r.s : t < r.t;
//return f != r.f ? f > r.f : s != r.s ? s > r.s : t > r.t; 大きい順
}
bool operator>(const Tri &r) const {
return f != r.f ? f > r.f : s != r.s ? s > r.s : t > r.t;
//return f != r.f ? f > r.f : s != r.s ? s > r.s : t > r.t; 小さい順
}
int operator[](int i) {
assert(i < 3);
switch (i) {
case 0:
return f;
break;
case 1:
return s;
break;
default:
return t;
break;
}
}
};
//別名
#define ull unsigned long long
#define vec vector
#define con continue
#define bre break
#define brk break
#define is ==
#define eq ==
#define no !=
#define ne !=
#define dif !=
#define df !=
#define rs resize
#define PQ priority_queue<ll, vector<ll>, greater<ll> >
using vi = vector<int>;
#define vvi(a, b, c) vec<vi> a(b,vi(c))
using vb = vector<bool>;
#define vvb(a, b, c) vec<vb> a(b,vb(c))
using vs = vector<string>;
#define vvs(a, b, c) vec<vs> a(b,vs(c))
using vl = vector<ll>;
#define vvl(a, b, c) vec<vl> a(b,vl(c))
using vd = vector<double>;
#define vvd(a, b, c) vec<vd> a(b,vd(c))
#define v3i(a, b, c, d) vector<vector<vi>> a(b, vector<vi>(c, vi(d)))
#define v3d(a, b, c, d) vector<vector<vd>> a(b, vector<vd>(c, vd(d)))
#define v3m(a, b, c, d) vector<vector<vm>> a(b, vector<vm>(c, vm(d)))
using vc=vector<char>;
#define vvc(a, b, c) vec<vc> a(b,vc(c))
using P = pair<int, int>;
//using T = tuple<int, int, int>;
using vp = vector<P>;
#define vvp(a, b, c) vec<vp> a(b,vp(c))
using vt = vector<Tri>;
#define vvt(a, b, c) vec<vt> a(b,vt(c))
using dou = double;
using itn = int;
using str = string;
using bo= bool;
#define uset unordered_set
#define mset multiset
#define umap unordered_map
#define mmap multimap
#define F first
#define S second
//定数
#define k4 10101
#define k5 101010
#define k6 1010101
#define k7 10101010
const int INF = (int) 1e9 + 100;
const ll LINF = (ll) 1e18 + 100;
const double EPS = 1e-9;
const int y4[] = {-1, 1, 0, 0};
const int x4[] = {0, 0, -1, 1};
const int y8[] = {0, 1, 0, -1, -1, 1, 1, -1};
const int x8[] = {1, 0, -1, 0, 1, -1, 1, -1};
//配列
#define sz(a) (sizeof(a)/sizeof(a[0]))
//コンテナ
#define mp make_pair
#define pb push_back
#define pf push_front
#define eb emplace_back
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
template<class T>
T pop(set<T> &set) {
T res = *set.begin();
set.erase(set.find(res));
return res;
}
template<class T>
T pop(mset<T> &set) {
T res = *set.begin();
set.erase(set.find(res));
return res;
}
template<class T>
T popBack(set<T> &set) {
T res = *set.rbegin();
set.erase(set.find(res));
return res;
}
template<class T>
T popBack(mset<T> &set) {
T res = *set.rbegin();
set.erase(set.find(res));
return res;
}
template<class T>
inline void sort(vector<T> &a) { sort(a.begin(), a.end()); };
template<class T>
inline void rsort(vector<T> &a) { sort(a.begin(), a.end(), greater<T>()); };
template<class T>
inline void sort(vector<T> &a, int len) { sort(a.begin(), a.begin() + len); };
template<class T>
inline void rsort(vector<T> &a, int len) { sort(a.begin(), a.begin() + len, greater<T>()); };
//繰り返し
#define _overloadrep(_1, _2, _3, name, ...) name
# define _rep(i, n) for(int i = 0; i < n ; i++)
#define repi(i, m, n) for(int i = m; i < n ; i++)
#define rep(...) _overloadrep(__VA_ARGS__,repi,_rep,)(__VA_ARGS__)
#define _rer(i, n) for(int i = n; i >= 0 ; i--)
#define reri(i, m, n) for(int i = m; i >= n ; i--)
#define rer(...) _overloadrep(__VA_ARGS__,reri,_rer,)(__VA_ARGS__)
#define fora(a, b) for(auto&& a : b)
#define forr(a, b) for_each(map.rbegin(),map.rend(),[](auto&& a)
#define rea(a, b) for(auto&& a : b)
#define repa(a, b) for(auto&& a : b)
template<typename A, size_t N, typename T>
void fill(A (&a)[N], const T &v) {
rep(i, N)a[i] = v;
}
template<typename A, size_t N, size_t O, typename T>
void fill(A (&a)[N][O], const T &v) {
rep(i, N)rep(j, O)a[i][j] = v;
}
template<typename A, size_t N, size_t O, size_t P, typename T>
void fill(A (&a)[N][O][P], const T &v) {
rep(i, N)rep(j, O)rep(k, P)a[i][j][k] = v;
}
template<typename A, size_t N, size_t O, size_t P, size_t Q, typename T>
void fill(A (&a)[N][O][P][Q], const T &v) {
rep(i, N)rep(j, O)rep(k, P)rep(l, Q)a[i][j][k][l] = v;
}
template<typename A, size_t N, size_t O, size_t P, size_t Q, size_t R, typename T>
void fill(A (&a)[N][O][P][Q][R], const T &v) {
rep(i, N)rep(j, O)rep(k, P)rep(l, Q)rep(m, R)a[i][j][k][l][m] = v;
}
template<typename A, size_t N, size_t O, size_t P, size_t Q, size_t R, size_t S, typename T>
void fill(A (&a)[N][O][P][Q][R][S], const T &v) {
rep(i, N)rep(j, O)rep(k, P)rep(l, Q)rep(m, R)rep(n, S)a[i][j][k][l][m][n] = v;
}
template<class T, class U>
void fill(vector<T> &a, U v) {
rep(i, a.size())a[i] = v;
}
template<class T, class U>
void fill(vector<vector<T>> &a, U v) {
rep(i, a.size())rep(j, a[0].size())a[i][j] = v;
}
template<class T, class U>
void fill(vector<vector<vector<T>>> &a, U v) {
rep(i, a.size())rep(j, a[0].size())rep(k, a[0][0].size())a[i][j][k] = v;
}
#define arcpy(a, b) memcpy(a,b,sizeof(b))
//入力
template<typename T = int>
T in() {
T x;
cin >> x;
return (x);
}
string sin() { return in<string>(); }
double din() { return in<double>(); }
ll lin() { return in<ll>(); }
#define na(a, n) rep(i,n) cin >> a[i];
#define nad(a, n) rep(i,n) cin >> a[i], a[i]--;
#define na3(a, b, c, n) rep(i, n)cin >> a[i] >> b[i] >> c[i];
#define add2(a, b, n) rep(i, n)a.pb(in()),b.pb(in());
#define add2d(a, b, n) rep(i, n)a.pb(in()-1),b.pb(in()-1);
#define add3(a, b, c, n) rep(i, n)a.pb(in()),b.pb(in()),c.pb(in());
#define add3d(a, b, c, n) rep(i, n)a.pb(in()-1),b.pb(in()-1),c.pb(in());
#define na2(a, b, n) rep(i, n)cin >> a[i] >> b[i];
#define nt(a, h, w) rep(hi,h)rep(wi,w) cin >> a[hi][wi];
#define ntd(a, h, w) rep(hi,h)rep(wi,w) cin >> a[hi][wi], a[hi][wi]--;
#define ntp(a, h, w) fill(a,'#');rep(hi,1,h+1)rep(wi,1,w+1) cin >> a[hi][wi];
#define addn(a, n) a.resize(n);na(a,n);
#define addnd(a, n) a.resize(n);na(a,n);rep(i,n)a[i]--;
//出力
template<class T>
void out(vector<T> x) {
for (auto &&v : x) cout << v << " ";
cout << "" << endl;
}
template<class T>
void out(T x) {
if (typeid(x) == typeid(double))cout << fixed << setprecision(10) << x << endl;
else cout << x << endl;
}
//デバッグ
#define debug(x) cerr << x << " " << "(L:" << __LINE__ << ")" << '\n';
// 境界チェック付きvector
namespace std_vector_bounds_checking {
using namespace std;
template<class T, class A = std::allocator<T>>
struct vector : std::vector<T, A> {
using std::vector<T, A>::vector;
typename std::vector<T>::reference operator[](typename std::vector<T>::size_type n) {
return this->at(n);
}
};
}
//よく使うクラス、構造体
class UnionFind {
public:
vi par, rank, sizes;
int n, trees;
UnionFind(int n) : n(n), trees(n) {
par.resize(n), rank.resize(n), sizes.resize(n);
rep(i, n)par[i] = i, sizes[i] = 1;
}
int root(int x) {
if (par[x] == x)return x;
else return par[x] = root(par[x]);
}
void unite(int x, int y) {
x = root(x);
y = root(y);
if (x == y)return;
if (rank[x] < rank[y])swap(x, y);
trees--;
par[y] = x;
sizes[x] += sizes[y];
if (rank[x] == rank[y])rank[x]++;
}
bool same(int x, int y) { return root(x) == root(y); }
int size(int x) { return sizes[root(x)]; }
//順不同 umapなので
vec<vi> sets() {
vec<vi> res(trees);
umap<int, vi> map;
rep(i, n) map[root(i)].push_back(i);
int i = 0;
for (auto &&p:map) {
int r = p.F;
res[i].push_back(r);
for (auto &&v:p.S) {
if (r == v)continue;
res[i].push_back(v);
}
i++;
}
return res;
}
};
//MOD関連
ll MOD = (int) 1e9 + 7;
int mpow(int v, ll a) {
ll x = v, n = a, res = 1;
while (n) {
if (n & 1)res = (res * x) % MOD;
x = (x * x) % MOD;
n >>= 1;
}
return res;
}
class mint {
private:
ll v;
public:
static ll mod(ll a) { return (a % MOD + MOD) % MOD; }
mint(ll a = 0) { this->v = mod(a); };
mint(const mint &a) { v = a.v; }
mint operator+(const mint &a) { return mint(v + a.v); }
mint operator+(const ll a) { return mint(v + a % MOD); }
mint operator+(const signed a) { return mint(v + a % MOD); }
friend mint operator+(const ll a, const mint &b) { return mint(a % MOD + b.v); }
void operator+=(const mint &a) { v = (v + a.v) % MOD; }
void operator+=(const ll a) { v = mod(v + a % MOD); }
void operator+=(const signed a) { v = mod(v + a % MOD); }
friend void operator+=(ll &a, const mint &b) { a = mod(a % MOD + b.v); }
mint operator-(const mint &a) { return mint(v - a.v); }
mint operator-(const ll a) { return mint(v - a % MOD); }
mint operator-(const signed a) { return mint(v - a % MOD); }
friend mint operator-(const ll a, const mint &b) { return mint(a % MOD - b.v); }
void operator-=(const mint &a) { v = mod(v - a.v); }
void operator-=(const ll a) { v = mod(v - a % MOD); }
void operator-=(const signed a) { v = mod(v - a % MOD); }
friend void operator-=(ll &a, const mint &b) { a = mod(a % MOD - b.v); }
mint operator*(const mint &a) { return mint(v * a.v); }
mint operator*(const ll a) { return mint(v * (a % MOD)); }
mint operator*(const signed a) { return mint(v * (a % MOD)); }
friend mint operator*(const ll a, const mint &b) { return mint(a % MOD * b.v); }
void operator*=(const mint &a) { v = (v * a.v) % MOD; }
void operator*=(const ll a) { v = mod(v * (a % MOD)); }
void operator*=(const signed a) { v = mod(v * (a % MOD)); }
friend void operator*=(ll &a, const mint &b) { a = mod(a % MOD * b.v); }
mint operator/(const mint &a);
mint operator/(const ll a);
mint operator/(const signed a);
friend mint operator/(const ll a, const mint &b);
void operator/=(const mint &a);
void operator/=(const ll a);
void operator/=(const signed a);
friend void operator/=(ll &a, const mint &b);
mint operator^(const mint &a) { return mpow(v, a.v); };
mint operator^(const ll a) { return mpow(v, a); };
mint operator^(const signed a) { return mpow(v, a); };
friend mint operator^(const ll a, const mint &b) { return mpow(a, b.v); };
void operator^=(const mint &a) { v = mpow(v, a.v); }
void operator^=(const ll a) { v = mpow(v, a); }
void operator^=(const signed a) { v = mpow(v, a); }
//単項演算子
mint operator+() { return *this; }
mint operator++() {
v++;
return *this;
}
mint operator++(signed d) {
mint res = *this;
v++;
return res;
}
mint operator-() { return operator*(-1); }
mint operator--() {
v++;
return *this;
}
void operator--(signed d) {
mint res = *this;
v++;
}
bool operator==(mint &a) {
return v == a.v;
}
bool operator==(signed a) {
return v == a;
}
friend bool operator==(signed a, mint &b) {
return a == b.v;
}
bool operator!=(mint &a) {
return v != a.v;
}
bool operator!=(signed a) {
return v != a;
}
friend bool operator!=(signed a, mint &b) {
return a != b.v;
}
operator int() { return v; }
};
const int setModMax = 510000;
mint fac[setModMax], finv[setModMax], inv[setModMax];
void setMod() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < setModMax; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
mint minv(ll a) {
if (fac[0] == 0)setMod();
if (a < setModMax) return inv[a];
a %= MOD;
ll b = MOD, x = 1, y = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
x -= t * y;
swap(x, y);
}
return (x % MOD + MOD) % MOD;
}
mint mint::operator/(const mint &a) { return mint(v * minv(a.v)); }
mint mint::operator/(const ll a) { return mint(v * minv(a)); }
mint mint::operator/(const signed a) { return mint(v * minv(a)); }
mint operator/(const ll a, const mint &b) { return mint(a % MOD * minv(b.v)); }
void mint::operator/=(const mint &a) { v = (v * minv(a.v)) % MOD; }
void mint::operator/=(const ll a) { v = mod(v * minv(a)); }
void mint::operator/=(const signed a) { v = mod(v * minv(a)); }
void operator/=(ll &a, const mint &b) { a = mint::mod(a % MOD * minv(b.v)); }
using vm=vector<mint>;
#define vvm(a, b, c) vec<vm> a(b,vm(c))
bool isPrime[4010101];
vi primes;
void setPrime() {
fill(isPrime, true);
isPrime[0] = isPrime[1] = false;
for (int i = 2; i <= sqrt(sz(isPrime)) + 5; ++i) {
if (!isPrime[i])continue;
for (int j = 2; i * j < sz(isPrime); ++j) {
isPrime[i * j] = false;
}
}
rep(i, sz(isPrime))if (isPrime[i])primes.pb(i);
}
mint com(ll n, ll r) {
if (n < r || n < 0 || r < 0)return 0;
if (fac[0] == 0)setMod();
return fac[n] * (finv[r] * finv[n - r] % MOD) % MOD;
}
//便利関数
void OLE() {
string a = "a";
rep(i, 30)a += a;
rep(i, 1 << 17)cout << a << endl;
cout << "OLE 出力長制限超過" << endl;
exit(0);
}
void TLE() {
int a = 1;
while (a)cout << a << endl;
}
void RE() {
int a = 1 / (x4[0] / MOD);
cout << a << endl;
}
ll gcd(ll a, ll b) {
return b ? gcd(b, a % b) : a;
}
ll lcm(ll a, ll b) {
return a / gcd(a, b) * b;
}
bool equal(double a, double b) {
return fabs(a - b) < EPS;
}
ll reverse(ll a) {
ll res = 0;
while (a) {
res *= 10;
res += a % 10;
a /= 10;
}
return res;
}
ll ceil(ll a, ll b) {
if (b == 0) {
OLE();
return -1;
} else return (a + b - 1) / b;
}
ll sqrt(ll a) {
if (a < 0)OLE();
ll res = (ll) std::sqrt(a);
while (res * res < a)res++;
return res;
}
double log(double e, double x) {
return log(x) / log(e);
}
ll sig(ll t) { return (1 + t) * t / 2; }
ll sig(ll s, ll t) { return (s + t) * (t - s + 1) / 2; }
vi divisors(int v) {
vi res;
for (int i = 1; i <= sqrt(v); ++i) {
if (v % i == 0) {
res.pb(i);
if (i != v / i)res.pb(v / i);
}
}
return res;
}
vi factorization(int v) {
int tv = v;
vi res;
if (!isPrime[2])setPrime();
for (auto &&p :primes) {
if (v % p == 0)res.push_back(p);
while (v % p == 0) {
v /= p;
}
if (v == 1 || p * p > tv)break;
}
if (v > 1)res.pb(v);
return res;
}
unordered_map<int, int> factorizationMap(int v) {
int tv = v;
unordered_map<int, int> res;
if (!isPrime[2])setPrime();
for (auto &&p :primes) {
while (v % p == 0) {
res[p]++;
v /= p;
}
if (v == 1 || p * p > tv)break;
}
if (v > 1)res[v]++;
return res;
}
int get(int a, int keta) {
a /= (int) pow(10, keta);
return a % 10;
}
int keta(int v) {
int cou = 0;
while (v) {
cou++;
v %= 10;
}
return cou;
}
template<class T>
void imo(vector<T> &v) {
int n = v.size();
rep(i, n - 1)v[i + 1] += v[i];
}
//変換系
template<class T, class U>
vector<U> keys(map<T, U> a) {
vector<U> res;
for (auto &&k :a)res.pb(k.F);
return res;
}
template<class T, class U>
vector<U> keys(umap<T, U> a) {
vector<U> res;
for (auto &&k :a)res.pb(k.F);
return res;
}
template<class T, class U>
vector<T> values(map<T, U> a) {
vector<T> res;
for (auto &&k :a)res.pb(k.S);
return res;
}
template<class T, class U>
vector<T> values(umap<T, U> a) {
vector<T> res;
for (auto &&k :a)res.pb(k.S);
return res;
}
vi list(int a) {
vi res;
while (a) {
res.insert(res.begin(), a % 10);
a /= 10;
}
return res;
}
template<class T, class U>
bool chmax(T &a, const U &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template<class T, class U>
bool chmin(T &a, const U &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
template<class T>
T min(T a, signed b) {
return a < b ? a : b;
}
template<class T>
T max(T a, signed b) {
return a < b ? b : a;
}
template<class T>
T min(vector<T> a) {
return *min_element(all(a));
}
template<class T>
T max(vector<T> a) {
return *max_element(all(a));
}
template<class T>
T min(T a[]) {
T res = a[0];
rep(i, sz(a))chmin(res, a[i]);
return res;
}
template<class T>
T max(T a[]) {
T res = a[0];
rep(i, sz(a))chmax(res, a[i]);
return res;
}
template<class T>
T sum(vector<T> &v, int len = -1) {
if (len == -1)len = v.size();
T res = 0;
rep(i, min((int) len, (int) v.size()))res += v[i];
return res;
}
///要素が0の時、返り値は0か1か
template<class T>
T mul(vector<T> &v, int len = -1) {
if (len == -1)len = v.size();
T res = 1;
rep(i, min((int) len, (int) v.size()))res *= v[i];
return res;
}
void clear(PQ &q) {
while (q.size())q.pop();
}
template<class T>
void clear(queue<T> &q) {
while (q.size())q.pop();
}
template<class T>
vector<T> ruiv(vector<T> &a) {
vector<T> res(a.size() + 1);
rep(i, a.size())res[i + 1] = res[i] + a[i];
return res;
}
template<class T>
void plus(vector<T> &a, T v = 1) {
for (auto &&u :a)u += v;
}
template<class T>
void minu(vector<T> &a, T v = 1) {
for (auto &&u :a)u -= v;
}
template<class T>
void minus(vector<T> &a, T v = 1) {
for (auto &&u :a)u -= v;
}
inline bool inside(int y, int x, int H, int W) { return y >= 0 && x >= 0 && y < H && x < W; }
ll u(ll a) { return a < 0 ? 0 : a; }
#define MIN(a) numeric_limits<a>::min()
#define MAX(a) numeric_limits<a>::max()
template<class T>
T min(vector<vector<T>> &a) {
T res = MAX(T);
rep(i, a.size())chmin(res, *min_element(all(a[i])));
return res;
}
template<class T>
T max(vector<vector<T>> &a) {
T res = MIN(T);
rep(i, a.size())chmax(res, *max_element(all(a[i])));
return res;
}
bool bget(ll m, int keta) {
return (m >> keta) & 1;
}
int bget(ll m, int keta, int sinsuu) {
m /= (ll) pow(sinsuu, keta);
return m % sinsuu;
}
inline ll bit(int n) {
return (1LL << (n));
}
inline ll bit(int n, int sinsuu) {
return (ll) pow(sinsuu, n);
}
int bcou(ll m) {
return __builtin_popcount(m & 0xFFFFFFFF) + __builtin_popcount(m >> 32);
}
//初期化は0を渡す
ll nextComb(ll &mask, int n, int r) {
if (!mask)return mask = (1LL << r) - 1;
ll x = mask & -mask; //最下位の1
ll y = mask + x; //連続した下の1を繰り上がらせる
ll res = ((mask & ~y) / x >> 1) | y;
if (bget(res, n))return mask = 0;
else return mask = res;
}
//n桁以下でビットがr個立っているもののvectorを返す
vl bitCombList(int n, int r) {
vl res;
int m = 0;
while (nextComb(m, n, r)) {
res.pb(m);
}
return res;
}
int altoi(char c) {
if ('A' <= c && c <= 'Z')return c - 'A';
return c - 'a' + 26;
}
char itoal(int i) {
if (i < 26)return 'A' + i;
return 'a' + i - 26;
}
int ctoi(char c) {
return c - '0';
}
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
void compress(vi &a) {
vi b;
int len = a.size();
for (int i = 0; i < len; ++i) {
b.push_back(a[i]);
}
sort(b);
UNIQUE(b);
for (int i = 0; i < len; ++i) {
a[i] = lower_bound(all(b), a[i]) - b.begin();
}
}
void compress(int a[], int len) {
vi b;
for (int i = 0; i < len; ++i) {
b.push_back(a[i]);
}
sort(b);
UNIQUE(b);
for (int i = 0; i < len; ++i) {
a[i] = lower_bound(all(b), a[i]) - b.begin();
}
}
//要素が見つからなかったときに困る
#define lowerIndex(a, v) (lower_bound(all(a),v)-a.begin())
#define lowerBound(a, v) (*lower_bound(all(a),v))
#define upperIndex(a, v) (upper_bound(all(a),v)-a.begin())
#define upperBound(a, v) (*upper_bound(all(a),v))
#define ans(a) cout<<a<<endl;continue;
#define poll(a) q.front();q.pop()
#define dpoll(a) q.front();q.pop_front()
#define pollLast(a) q.back();q.pop_back()
#define pollBack(a) q.back();q.pop_back()
template<class T>
inline void fin(T s) { cout << s << endl, exit(0); }
template<class T>
struct edge {
int from, to;
T cost;
int id;
int type;
edge(int f, int t, T c = 1, int id = -1, int ty = -1) : from(f), to(t), cost(c), id(id), type(ty) {}
bool operator<(const edge &b) const {
return cost < b.cost;
}
bool operator>(const edge &b) const {
return cost > b.cost;
}
};
template<typename T>
class graph {
protected:
vector<bool> _used;
public :
vector<vector<edge<T>>> g;
vector<edge<T>> edges;
int n, root = -1;
graph(int n) : n(n) {
g.resize(n);
_used.resize(n);
}
void clear() {
g.clear();
edges.clear();
}
void resize(int n) {
this->n = n;
g.resize(n);
_used.resize(n);
}
int size() {
return g.size();
}
bool isleaf(int v) {
assert(root != -1);
return g[v].size() == 1 && g[v][0].from != root;
}
vector<edge<T> > operator[](int i) {
return g[i];
}
virtual void add(int from, int to, T cost, int ty) = 0;
virtual bool used(edge<T> &e) = 0;
virtual bool used(int id) = 0;
virtual void del(edge<T> &e) = 0;
virtual void del(int id) = 0;
};
template<class T=int>
class undigraph : public graph<T> {
public:
using graph<T>::g;
using graph<T>::n;
using graph<T>::edges;
using graph<T>::_used;
undigraph(int n) : graph<T>(n) {
}
void add(int f, int t, T cost = 1, int ty = -1) {
if (!(0 <= f && f < n && 0 <= t && t < n))OLE();
int id = edges.size();
g[f].emplace_back(f, t, cost, id, ty);
g[t].emplace_back(t, f, cost, id + 1, ty);
edges.emplace_back(f, t, cost, id, ty);
edges.emplace_back(t, f, cost, id + 1, ty);
}
void add(edge<T> &e) {
int f = e.from, t = e.to, ty = e.type;
T cost = e.cost;
add(f, t, cost, ty);
}
bool used(edge<T> &e) {
return _used[e.id];
}
bool used(int id) {
return _used[id];
}
void del(edge<T> &e) {
_used[e.id] = _used[e.id ^ 1] = 1;
}
void del(int id) {
_used[id] = _used[id ^ 1] = 1;
}
};
template<typename T =ll>
class digraph : public graph<T> {
public:
using graph<T>::g;
using graph<T>::n;
using graph<T>::edges;
using graph<T>::_used;
digraph(int n) : graph<T>(n) {
}
void add(int f, int t, T cost = 1, int ty = -1) {
if (!(0 <= f && f < n && 0 <= t && t < n))OLE();
int id = edges.size();
g[f].emplace_back(f, t, cost, ty, id);
edges.emplace_back(f, t, cost, ty, id);
}
bool used(edge<T> &e) {
return _used[e.id];
}
bool used(int id) {
return _used[id];
}
void del(edge<T> &e) {
_used[e.id] = _used[e.id ^ 1] = 1;
}
void del(int id) {
_used[id] = _used[id ^ 1] = 1;
}
};
template<class T>
bool nibu(const graph<T> &g) {
UnionFind uf(g.n * 2);
for (auto &&e :g.edges)uf.unite(e.f, e.t + g.n), uf.unite(e.f + g.n, e.t);
return !uf.same(0, g.n);
}
template<class T>
vector<T> dijkstra(const graph<T> &g, int s) {
if (!(0 <= s && s < g.n))OLE();
T initValue = MAX(T);
vector<T> dis(g.n, initValue);
priority_queue<pair<T, int>, vector<pair<T, int>>, greater<pair<T, int>>> q;
dis[s] = 0;
q.emplace(0, s);
while (q.size()) {
T nowc = q.top().F;
int i = q.top().S;
q.pop();
if (dis[i] != nowc)continue;
for (auto &&e : g.g[i]) {
int to = e.to;
T cost = nowc + e.cost;
if (dis[to] > cost) {
dis[to] = cost;
q.emplace(dis[to], to);
}
}
}
//たどり着かないなら-1
for (auto &&d :dis) if (d == initValue)d = -1;
return dis;
}
//機能拡張
template<typename T>
void remove(vector<T> &v, unsigned int i) { v.erase(v.begin() + i); }
template<typename T>
void remove(vector<T> &v, unsigned int s, unsigned int e) {
v.erase(v.begin() + s, v.begin() + e);
}
template<typename T>
void removen(vector<T> &v, unsigned int s, unsigned int n) {
v.erase(v.begin() + s, v.begin() + s + n);
}
template<typename T>
void erase(vector<T> &v, unsigned int i) { v.erase(v.begin() + i); }
template<typename T>
void erase(vector<T> &v, unsigned int s, unsigned int e) {
v.erase(v.begin() + s, v.begin() + e);
}
template<typename T>
void erasen(vector<T> &v, unsigned int s, unsigned int n) {
v.erase(v.begin() + s, v.begin() + s + n);
}
template<typename T>
void insert(vector<T> &v, unsigned int i, T t) { v.insert(v.begin() + i, t); }
template<typename T>
void insert(vector<T> &v, unsigned int i, vector<T> list) {
for (auto &&va :list)v.insert(v.begin() + i++, va);
}
template<typename T>
void insert(vector<T> &v, unsigned int i, initializer_list<T> list) {
for (auto &&va :list)v.insert(v.begin() + i++, va);
}
int mod(int a, int m) {
return (a % m + m) % m;
}
ll ma = numeric_limits<ll>::min();
ll mi = numeric_limits<ll>::max();
//閉路がなければtrue
bool topo(vi &res, digraph<int> g) {
int n = g.g.size();
vi nyu(n);
rep(i, n)for (auto &&e :g[i])nyu[e.to]++;
queue<int> st;
rep(i, n)if (nyu[i] == 0)st.push(i);
while (st.size()) {
int v = st.front();
st.pop();
res.pb(v);
fora(e, g[v]) if (--nyu[e.to] == 0)st.push(e.to);
}
return res.size() == n;
}
//辞書順最小 トポロジカルソート
bool topos(vi &res, digraph<int> g) {
int n = g.g.size();
vi nyu(n);
rep(i, n)for (auto &&e :g[i])nyu[e.to]++;
set<int> st;
rep(i, n)if (nyu[i] == 0)st.insert(i);
while (st.size()) {
int i = *st.begin();
st.erase(st.begin());
res.pb(i);
fora(e, g[i])if (--nyu[e.to] == 0)st.insert(e.to);
}
return res.size() == n;
}
vector<string> split(const string a, const char deli) {
string b = a + deli;
int l = 0, r = 0, n = b.size();
vector<string> res;
rep(i, n) {
if (b[i] == deli) {
r = i;
if (l < r)res.push_back(b.substr(l, r - l));
l = i + 1;
}
}
return res;
}
vector<string> split(const string a, const string deli) {
string b = a + deli;
int l = 0, r = 0, n = b.size(), dn = deli.size();
vector<string> res;
rep(i, n) {
if (i + dn <= n && b.substr(i, i + dn) == deli) {
r = i;
if (l < r)res.push_back(b.substr(l, r - l));
i += dn - 1;
l = i + 1;
}
}
return res;
}
int n, k, m, h, w, x, y, q, r;
vi a, b, c;
bo calc(int v) {
int rb = n - v;
int last = a[rb];
int lim = last - x;
if (lim <= 0)return 0;
int lb = lowerIndex(a, x - lim);
int amai = rb - lb;
return v <= amai;
}
signed main() {
cin >> n >> q;
addn(a, n);
auto &&rui = ruiv(a);
vi roe(n + 10);
rep(i, n) {
roe[i + 2] = a[i] + roe[i];
}
rep(i, q) {
//交差せずに何ターンとれるか
cin >> x;
int ok = 0, ng = n;
while (abs(ok - ng) > 1) {
int mid = (ok + ng) / 2;
if (calc(mid))ok = mid;
else ng = mid;
}
int turn = ok;
//隙間は01
//0と仮定
int rb = n - ok;
int lb = rb - ok;
int res = 0;
if (lb && x - a[lb - 1] <= a[rb - 1] - x) {
lb -= 2;
res += a[rb - 1];
}
res += rui[n] - rui[rb];
res += roe[(lb - 1) + 2];
cout << res << endl;
}
return 0;
}
|
p03158 | C++ | #include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include <utility>
#include <vector>
#define MAX_N (100000)
#define MAX_Q (100000)
#define INF (1000000000)
using namespace std;
int main(int argc, char *argv[]) {
// read inputs
long N, Q, as[MAX_N], xs[MAX_Q];
scanf("%ld %ld", &N, &Q);
for (long i = 0; i < N; i++) {
scanf("%ld", &as[i]);
}
for (long q = 0; q < Q; q++) {
scanf("%ld", &xs[q]);
}
// calculate accumulated sums
long acc_as[MAX_N] = {}, acc_oe_as[MAX_N] = {};
acc_as[0] = as[0];
acc_as[1] = as[0] + as[1];
acc_oe_as[0] = as[0];
acc_oe_as[1] = as[1];
for (long i = 2; i < N; i++) {
acc_as[i] = acc_as[i - 1] + as[i];
acc_oe_as[i] = acc_oe_as[i - 2] + as[i];
}
// solve
for (long q = 0; q < Q; q++) {
const long x = xs[q];
// find ab and ae where
// aoki-kun takes [ab, ae) and takahashi-kun takes [ae, N)
long ab, ae;
// find w where [x +- w] is the range of values of the block [b, e)
long le = -1, ri = INF;
while (ri - le > 1) {
const long m = (le + ri) / 2;
const long b = lower_bound(as, as + N, x - m) - as;
const long e = upper_bound(as, as + N, x + m) - as;
// printf("le = %ld, ri = %ld, m = %ld, e - b = %ld, N - e = %ld\n", le, ri,
// m, e - b, N - e);
if (e - b == N - e - 1 || e - b == N - e) {
ri = m;
le = m - 1;
ab = b;
ae = e;
} else if (e - b < N - e - 1) {
le = m;
} else if (e - b > N - e + 1) {
ri = m;
} else {
// the hard case (e - b == N - e + 1)
if (e > 0 && abs(as[b] - x) == abs(as[e - 1] - x)) {
ri = m;
le = m - 1;
ab = b;
ae = e - 1;
} else {
ri = m;
}
}
}
// printf("q = %ld, ab = %ld, ae = %ld, x = %ld, ri = %ld\n", q, ab, ae, x,
// ri);
long ans;
if (ae - ab == 0) {
ans = acc_oe_as[N - 1];
} else {
ans = acc_as[N - 1] - acc_as[ae - 1];
if (ae - ab == N - ae && ab - 1 >= 0) {
ans += acc_oe_as[ab - 1];
} else if (ae - ab == N - ae - 1 && ab - 2 >= 0) {
ans += acc_oe_as[ab - 2];
}
}
printf("%ld\n", ans);
}
return 0;
} |
p03158 | C++ | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <sstream>
#include <set>
#include <map>
#include <iostream>
#include <utility>
#include <cctype>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <unordered_set>
#include <unordered_map>
#include <limits.h>
#include <cstring>
#include <tuple>
#include <cassert>
#include <numeric>
#include <iomanip>
using namespace std;
// type alias
typedef long long LL;
typedef pair< int , int > II;
typedef tuple< int, int, int > III;
typedef vector<int> VI;
typedef vector<string> VS;
typedef vector<vector<int>> VVI;
typedef unordered_map<int,int> MAPII;
typedef unordered_set<int> SETI;
template<class T> using VV=vector<vector<T>>;
// minmax
template<class T> inline T SMIN(T& a, const T b) { return a=(a>b)?b:a; }
template<class T> inline T SMAX(T& a, const T b) { return a=(a<b)?b:a; }
// repetition
#define FORE(i,a,b) for(int i=(a);i<=(b);++i)
#define REPE(i,n) for(int i=0;i<=(n);++i)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) for(int i=0;i<(n);++i)
#define FORR(x,arr) for(auto& x:arr)
#define SZ(a) int((a).size())
// collection
#define ALL(c) (c).begin(),(c).end()
// DP
#define MINUS(dp) memset(dp, -1, sizeof(dp))
#define ZERO(dp) memset(dp, 0, sizeof(dp))
// stdout
#define println(args...) fprintf(stdout, ##args),putchar('\n');
// debug cerr
#define TRACE true
#define dump(x) if(TRACE) { cerr << #x << " = " << (x) << endl; }
#define dump2(x,y) if(TRACE) { cerr << #x << " = " << (x) << ", " << #y << " = " << (y) << endl; }
#define dump3(x,y,z) if(TRACE) { cerr << #x << " = " << (x) << ", " << #y << " = " << (y) << ", " << #z << " = " << (z) << endl; }
#define dump4(x,y,z,a) if(TRACE) { cerr << #x << " = " << (x) << ", " << #y << " = " << (y) << ", " << #z << " = " << (z) << ", " << #a << " = " << (a) << endl; }
#define dumpf(args...) if(TRACE) { fprintf(stderr, ##args); putchar('\n'); }
#define dumpAR(ar) if(TRACE) { FORR(x,(ar)) { cerr << x << ','; } cerr << endl; }
template<class Iter> void dumpc(Iter begin, Iter end) { if (TRACE) { for(; begin!=end; ++begin) { cerr<<*begin<<','; } cerr<<endl; } }
// $ cp-batch NearestCardGame | diff NearestCardGame.out -
// $ g++ -std=c++14 -Wall -O2 -D_GLIBCXX_DEBUG -fsanitize=address NearestCardGame.cpp && ./a.out
/*
1/17/2019
16:54-18:16 WA
18:30 give up
22:10-24:20 read submit solutions and got AC
It's confusing to resolve tie of distance with `x`.
It's possible to binary search by # of elements that Takahashi takes.
Aoki should take the same number. We can check validity.
Condition of the validity is complex. I couldn't clearly define it.
https://atcoder.jp/contests/aising2019/submissions/3987556
- Solution with radius binary search by @sugim48
- Coordinate expansion is used
https://atcoder.jp/contests/aising2019/submissions/3987618
- Clean solution by @natsugiri
Summary:
- My original binary search was broken because decision problem was not defined by inequality... How many times are you writing binary search? 😡😡😡😡😡😡😡😡😡😡
- Try different way to make clean math model. In this problem, drop left edge of Aoki's card.
- ✅ |TATATAT| A |AAAA|TTTTT
- ❌ |TATATAT| A AAAA|TTTTT <- this is hard to connect with radius because left most T of contiguous T's card may have same distance to `x` as second left A in A's contiguous cards.
- If there is nusty model, try to modify it by slightly changing original model.
*/
const int MAX_N=1e6+10;
LL A[MAX_N];
int N,Q;
LL cum[MAX_N];
LL cum2[MAX_N];
void prep() {
cum[0]=0,cum2[0]=cum2[1]=0;
REP(i,N) {
cum[i+1]=cum[i]+A[i];
cum2[i+2]=cum2[i]+A[i];
}
}
LL solve__(int x) {
LL good=0,bad=N+1;
while(abs(good-bad)>1) {
LL mid=(good+bad)/2;
if(N-(2*mid-1)<0) bad=mid; else {
LL d1=x-A[N-(2*mid-1)],d2=A[N-mid]-x;
// dump2(mid,d1<=d2);
(d1<=d2?good:bad)=mid;
}
}
int r=N-good,l=N-(2*good-1);
LL res=cum[N]-cum[r];
// dump4(x,good,l,r);
// dump(N-(2*good-1));
assert(l>=0);
res+=cum2[l];
return res;
}
II f(LL rad, int x) {
int l=lower_bound(A,A+N,x-rad)-A;
int r=lower_bound(A,A+N,x+rad)-A;
// dump3(rad,l,r);
int tcnt=N-r,acnt=r-l;
if(acnt<=tcnt) return {l,r};
return {-10,-10};
}
LL solve(int x) {
LL good=0,bad=1e10;
LL l=-1,r=-1;
while(abs(good-bad)>1) {
LL m=(good+bad)/2;
II p=f(m,x);
// dump3(m,p.first,p.second);
if(p.first<-1) bad=m;
else good=m,l=p.first,r=p.second;
}
auto p=f(good,x);
l=p.first,r=p.second;
int tcnt=N-r,acnt=r-l;
// dump4(l,r,tcnt,acnt);
assert(tcnt-acnt<=2);
if(tcnt-acnt==0) l++;
if(tcnt-acnt==2) ++r,++l;
LL res=cum[N]-cum[r];
if(l>=0)res+=cum2[l];
return res;
}
// inspired by @sugim48
void prep2() {
REP(i,N) A[i]*=4LL;
prep();
}
LL solve(LL x) {
x=x*4LL-1;
LL good=-1,bad=1e10;
LL l=-1,r=-1;
while(abs(good-bad)>1) {
LL rad=(good+bad)/2;
int ll=lower_bound(A,A+N,x-rad)-A;
int rr=upper_bound(A,A+N,x+rad)-A;
int tcnt=N-rr,acnt=rr-ll;
if(tcnt>=acnt) {
good=rad;
l=ll,r=rr;
} else bad=rad;
}
int tcnt=N-r,acnt=r-l;
// dump4(l,r,tcnt,acnt);
assert(tcnt-acnt<=1);
// if(tcnt-acnt==2) l++,r++;
LL res=cum[N]-cum[r];
if(acnt-tcnt==0) ++l;
if(l>=0)res+=cum2[l];
return res/4;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout<<setprecision(12)<<fixed;
cin>>N>>Q;
REP(i,N) cin>>A[i];
prep();
REP(i,Q) {
int x; cin>>x;
cout<<solve(x)<<endl;
}
return 0;
}
|
p03158 | C++ | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <sstream>
#include <set>
#include <map>
#include <iostream>
#include <utility>
#include <cctype>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <unordered_set>
#include <unordered_map>
#include <limits.h>
#include <cstring>
#include <tuple>
#include <cassert>
#include <numeric>
#include <iomanip>
using namespace std;
// type alias
typedef long long LL;
typedef pair< int , int > II;
typedef tuple< int, int, int > III;
typedef vector<int> VI;
typedef vector<string> VS;
typedef vector<vector<int>> VVI;
typedef unordered_map<int,int> MAPII;
typedef unordered_set<int> SETI;
template<class T> using VV=vector<vector<T>>;
// minmax
template<class T> inline T SMIN(T& a, const T b) { return a=(a>b)?b:a; }
template<class T> inline T SMAX(T& a, const T b) { return a=(a<b)?b:a; }
// repetition
#define FORE(i,a,b) for(int i=(a);i<=(b);++i)
#define REPE(i,n) for(int i=0;i<=(n);++i)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) for(int i=0;i<(n);++i)
#define FORR(x,arr) for(auto& x:arr)
#define SZ(a) int((a).size())
// collection
#define ALL(c) (c).begin(),(c).end()
// DP
#define MINUS(dp) memset(dp, -1, sizeof(dp))
#define ZERO(dp) memset(dp, 0, sizeof(dp))
// stdout
#define println(args...) fprintf(stdout, ##args),putchar('\n');
// debug cerr
#define TRACE true
#define dump(x) if(TRACE) { cerr << #x << " = " << (x) << endl; }
#define dump2(x,y) if(TRACE) { cerr << #x << " = " << (x) << ", " << #y << " = " << (y) << endl; }
#define dump3(x,y,z) if(TRACE) { cerr << #x << " = " << (x) << ", " << #y << " = " << (y) << ", " << #z << " = " << (z) << endl; }
#define dump4(x,y,z,a) if(TRACE) { cerr << #x << " = " << (x) << ", " << #y << " = " << (y) << ", " << #z << " = " << (z) << ", " << #a << " = " << (a) << endl; }
#define dumpf(args...) if(TRACE) { fprintf(stderr, ##args); putchar('\n'); }
#define dumpAR(ar) if(TRACE) { FORR(x,(ar)) { cerr << x << ','; } cerr << endl; }
template<class Iter> void dumpc(Iter begin, Iter end) { if (TRACE) { for(; begin!=end; ++begin) { cerr<<*begin<<','; } cerr<<endl; } }
// $ cp-batch NearestCardGame | diff NearestCardGame.out -
// $ g++ -std=c++14 -Wall -O2 -D_GLIBCXX_DEBUG -fsanitize=address NearestCardGame.cpp && ./a.out
/*
1/17/2019
16:54-18:16 WA
18:30 give up
22:10-24:20 read submit solutions and got AC
It's confusing to resolve tie of distance with `x`.
It's possible to binary search by # of elements that Takahashi takes.
Aoki should take the same number. We can check validity.
Condition of the validity is complex. I couldn't clearly define it.
https://atcoder.jp/contests/aising2019/submissions/3987556
- Solution with radius binary search by @sugim48
- Coordinate expansion is used
https://atcoder.jp/contests/aising2019/submissions/3987618
- Clean solution by @natsugiri
Summary:
- My original binary search was broken because decision problem was not defined by inequality... How many times are you writing binary search? 😡😡😡😡😡😡😡😡😡😡
- Try different way to make clean math model. In this problem, drop left edge of Aoki's card.
- ✅ |TATATAT| A |AAAA|TTTTT
- ❌ |TATATAT| A AAAA|TTTTT <- this is hard to connect with radius because left most T of contiguous T's card may have same distance to `x` as second left A in A's contiguous cards.
- If there is nusty model, try to modify it by slightly changing original model.
*/
const int MAX_N=1e6+10;
LL A[MAX_N];
int N,Q;
LL cum[MAX_N];
LL cum2[MAX_N];
void prep() {
cum[0]=0,cum2[0]=cum2[1]=0;
REP(i,N) {
cum[i+1]=cum[i]+A[i];
cum2[i+2]=cum2[i]+A[i];
}
}
LL solve__(int x) {
LL good=0,bad=N+1;
while(abs(good-bad)>1) {
LL mid=(good+bad)/2;
if(N-(2*mid-1)<0) bad=mid; else {
LL d1=x-A[N-(2*mid-1)],d2=A[N-mid]-x;
// dump2(mid,d1<=d2);
(d1<=d2?good:bad)=mid;
}
}
int r=N-good,l=N-(2*good-1);
LL res=cum[N]-cum[r];
// dump4(x,good,l,r);
// dump(N-(2*good-1));
assert(l>=0);
res+=cum2[l];
return res;
}
II f(LL rad, int x) {
int l=lower_bound(A,A+N,x-rad)-A;
int r=lower_bound(A,A+N,x+rad)-A;
// dump3(rad,l,r);
int tcnt=N-r,acnt=r-l;
if(acnt+1<=tcnt) return {l,r};
return {-10,-10};
}
LL solve_wrong(int x) {
LL good=0,bad=1e10;
LL l=-1,r=-1;
while(abs(good-bad)>1) {
LL m=(good+bad)/2;
II p=f(m,x);
// dump3(m,p.first,p.second);
if(p.first<-1) bad=m;
else good=m,l=p.first,r=p.second;
}
auto p=f(good,x);
l=p.first,r=p.second;
int tcnt=N-r,acnt=r-l;
// dump4(l,r,tcnt,acnt);
// assert(tcnt-acnt<=2);
if(tcnt-acnt==2) l++,r++;
LL res=cum[N]-cum[r];
if(l>=0)res+=cum2[l];
return res;
}
void prep2() {
REP(i,N) A[i]*=4LL;
prep();
}
LL solve(LL x) {
x=x*4LL-1;
LL good=-1,bad=1e10;
LL l=-1,r=-1;
while(abs(good-bad)>1) {
LL rad=(good+bad)/2;
int ll=lower_bound(A,A+N,x-rad)-A;
int rr=upper_bound(A,A+N,x+rad)-A;
int tcnt=N-rr,acnt=rr-ll;
if(tcnt>=acnt) {
good=rad;
l=ll,r=rr;
} else bad=rad;
}
int tcnt=N-r,acnt=r-l;
// dump4(l,r,tcnt,acnt);
assert(tcnt-acnt<=1);
// if(tcnt-acnt==2) l++,r++;
LL res=cum[N]-cum[r];
if(acnt-tcnt==0) ++l;
if(l>=0)res+=cum2[l];
return res/4;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout<<setprecision(12)<<fixed;
cin>>N>>Q;
REP(i,N) cin>>A[i];
prep2();
REP(i,Q) {
int x; cin>>x;
cout<<solve(x)<<endl;
}
return 0;
}
|
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef unsigned int uint;
typedef long double ld;
//#define ll __int128
#define int ll
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pld;
typedef vector<int> vi;
typedef vector< vi > vvi;
typedef vector< vvi > vvvi;
typedef vector<pii> vpi;
typedef vector<ll> vl;
typedef vector<string> vs;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<ld> vld;
typedef vector<vld> vvld;
#define inmin(a, b) a = min(a, (b))
#define inmax(a, b) a = max(a, (b))
#define mp(a,b) make_pair(a,b)
#define modsum(a, b) ((a) + (b) >= M ? (a) + (b) - M : (a) + (b))
#define modsubtract(a, b) ((a) - (b) < 0 ? (a) - (b) + M : (a) - (b))
#define modmultiply(a, b) (((a) * (b)) % M)
#define ALL(a) a.begin(),a.end()
#define RALL(a) a.rbegin(),a.rend()
#define sqr(x) ((x) * (x))
#define fori(i, n) for(int i = 0; i < int(n); ++i)
#define cint const int &
#define SZ(a) ((int)(a.size()))
#define watch(x) cout << (#x) << " = " << x << endl;
const double PI = atan2(1, 0) * 2;
const string DIGITS = "0123456789";
const string ALPH = "abcdefghijklmnopqrstuvwxyz";
template<class T>
ostream & operator << (ostream &out, vector<T> &a) {
out << "{";
for (auto x : a) out << x << " ";
return out << "}";
}
void smain();
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifdef ART_HOME
freopen("input.txt", "r", stdin);
clock_t start = clock();
#endif
cout << setprecision(12) << fixed;
smain();
#ifdef ART_HOME
cout << "\n\n\n";
cout << "TOTAL EXECUTION TIME: " << float(clock() - start) / CLOCKS_PER_SEC << endl;
#endif
}
vi values;
vi cnt;
vi with, out;
int stupid1()
{
int n = SZ(values);
if (n == 1)
return cnt.back();
else
return cnt.back() - cnt[n / 2 - 1];
}
int stupid2()
{
return with[SZ(values) - 1];
}
int count(int d, int u)
{
int l = -1, r = SZ(values);
while (r - l > 1)
{
int m = (l + r) >> 1;
if (values[m] > u)
r = m;
else
l = m;
}
int up = l;
l = -1, r = SZ(values);
while (r - l > 1)
{
int m = (l + r) >> 1;
if (values[m] >= d)
r = m;
else
l = m;
}
int dow = r;
return up - dow + 1;
}
bool check(int m, int v)
{
int n = SZ(values);
int up = values[m - 1];
int down = v - abs(v - values[m - 1]);
return count(down, up) <= SZ(values) - m;
}
int more(int v)
{
int l = -1, r = SZ(values);
while (r - l > 1)
{
int m = (l + r) >> 1;
if (values[m] >= v)
r = m;
else
l = m;
}
return r;
}
int solution(int v)
{
if (v <= values[0])
return stupid1();
if (v >= values.back())
return stupid2();
int n = SZ(values);
int l = more(v), r = n;
while (r - l > 1)
{
int m = (l + r) >> 1;
if (check(m, v))
l = m;
else
r = m;
}
int ans = cnt.back() - cnt[l - 1];
int left = l - (n - l);
if (left <= 0)
return ans;
if (n - l > l - left)
return ans + out[left - 1];
else
return ans + with[left - 1];
}
void smain() {
int n, q;
cin >> n >> q;
values.resize(n);
cnt.resize(n);
with.resize(n);
out.resize(n);
for (int i = 0; i < n; ++i)
cin >> values[i];
cnt[0] = values[0];
for (int i = 1; i < n; ++i)
cnt[i] += values[i] + cnt[i - 1];
with[0] = values[0];
for (int i = 1; i < n; ++i)
{
with[i] = out[i - 1] + values[i];
out[i] = with[i - 1];
}
for (int i = 0; i < q; ++i)
{
int v;
cin >> v;
cout << solution(v) << '\n';
}
} |
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
long long a[100100],gs[100100],ks[100100],s[100100];
int main()
{
int i,n,q;
long long x,ans;
scanf("%d%d",&n,&q);
for(i=0;i<n;i++)
scanf("%lld",&a[i]);
for(i=0;i<n;i++)
{
gs[i+1]=gs[i];
ks[i+1]=ks[i];
s[i+1]=s[i]+a[i];
if(i%2==0)
gs[i+1]+=a[i];
else
ks[i+1]+=a[i];
}
for(i=0;i<q;i++)
{
scanf("%lld",&x);
int l=0,r=n,mid,tmp;
while(l<r)
{
mid=(l+r)/2;
tmp=lower_bound(a,a+n,x*2-a[mid])-a;
if(mid-tmp<n-mid-1)
l=mid+1;
else
r=mid;
}
ans=s[n]-s[l];
if(n%2==0)
ans+=ks[l*2-n];
else
ans+=gs[l*2-n];
printf("%lld\n",ans);
}
return 0;
} |
p03158 | C++ | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <sstream>
#include <set>
#include <map>
#include <iostream>
#include <utility>
#include <cctype>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <unordered_set>
#include <unordered_map>
#include <limits.h>
#include <cstring>
#include <tuple>
#include <cassert>
#include <numeric>
#include <iomanip>
using namespace std;
// type alias
typedef long long LL;
typedef pair< int , int > II;
typedef tuple< int, int, int > III;
typedef vector<int> VI;
typedef vector<string> VS;
typedef vector<vector<int>> VVI;
typedef unordered_map<int,int> MAPII;
typedef unordered_set<int> SETI;
template<class T> using VV=vector<vector<T>>;
// minmax
template<class T> inline T SMIN(T& a, const T b) { return a=(a>b)?b:a; }
template<class T> inline T SMAX(T& a, const T b) { return a=(a<b)?b:a; }
// repetition
#define FORE(i,a,b) for(int i=(a);i<=(b);++i)
#define REPE(i,n) for(int i=0;i<=(n);++i)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) for(int i=0;i<(n);++i)
#define FORR(x,arr) for(auto& x:arr)
#define SZ(a) int((a).size())
// collection
#define ALL(c) (c).begin(),(c).end()
// DP
#define MINUS(dp) memset(dp, -1, sizeof(dp))
#define ZERO(dp) memset(dp, 0, sizeof(dp))
// stdout
#define println(args...) fprintf(stdout, ##args),putchar('\n');
// debug cerr
#define TRACE true
#define dump(x) if(TRACE) { cerr << #x << " = " << (x) << endl; }
#define dump2(x,y) if(TRACE) { cerr << #x << " = " << (x) << ", " << #y << " = " << (y) << endl; }
#define dump3(x,y,z) if(TRACE) { cerr << #x << " = " << (x) << ", " << #y << " = " << (y) << ", " << #z << " = " << (z) << endl; }
#define dump4(x,y,z,a) if(TRACE) { cerr << #x << " = " << (x) << ", " << #y << " = " << (y) << ", " << #z << " = " << (z) << ", " << #a << " = " << (a) << endl; }
#define dumpf(args...) if(TRACE) { fprintf(stderr, ##args); putchar('\n'); }
#define dumpAR(ar) if(TRACE) { FORR(x,(ar)) { cerr << x << ','; } cerr << endl; }
template<class Iter> void dumpc(Iter begin, Iter end) { if (TRACE) { for(; begin!=end; ++begin) { cerr<<*begin<<','; } cerr<<endl; } }
// $ cp-batch NearestCardGame | diff NearestCardGame.out -
// $ g++ -std=c++14 -Wall -O2 -D_GLIBCXX_DEBUG -fsanitize=address NearestCardGame.cpp && ./a.out
/*
1/17/2019
16:54-18:16 WA
18:30 give up
22:10- read submit solutions
DO NOT binary search by `radius`.
It's confusing to resolve tie of distance with `x`.
It's possible to binary search by # of elements that Takahashi takes.
Aoki should take the same number. We can check validity.
Condition of the validity is complex. I couldn't clearly define it.
Solution with radius binary search by @sugim48
- https://atcoder.jp/contests/aising2019/submissions/3987556
*/
const int MAX_N=1e6+10;
LL A[MAX_N];
int N,Q;
LL cum[MAX_N];
LL cum2[MAX_N];
void prep() {
cum[0]=0,cum2[0]=cum2[1]=0;
REP(i,N) {
cum[i+1]=cum[i]+A[i];
cum2[i+2]=cum2[i]+A[i];
}
}
LL solve(int x) {
LL good=0,bad=N+1;
while(abs(good-bad)>1) {
LL mid=(good+bad)/2;
if(N-(2*mid-1)<0) bad=mid; else {
LL d1=x-A[N-(2*mid-1)],d2=A[N-mid]-x;
// dump2(mid,d1<=d2);
(d1<=d2?good:bad)=mid;
}
}
int r=N-good,l=N-(2*good-1);
LL res=cum[N]-cum[r];
// dump4(x,good,l,r);
// dump(N-(2*good-1));
assert(l>=0);
res+=cum2[l];
return res;
}
II f(LL rad, int x) {
int l=lower_bound(A,A+N,x-rad)-A;
int r=upper_bound(A,A+N,x+rad)-A;
/*
int tcnt=N-(r+1),acnt=r-l+1;
// if(rad==2) dump4(l,r,tcnt,acnt);
if(tcnt>=acnt) return {l,r};
if(acnt==tcnt+1) return {l-1,r-1};
return {-10,-10};
*/
int d=r-l;
if(r<=N-d) return {l,r};
return {-10,-10};
}
LL solve_wrong(int x) {
LL good=0,bad=1e10;
LL l=N,r=N;
while(abs(good-bad)>1) {
LL m=(good+bad)/2;
II p=f(m,x);
// dump3(m,p.first,p.second);
if(p.first<-1) bad=m;
else good=m,l=p.first,r=p.second;
}
dump2(l,r);
// LL res=cum[N];
// if(r+1>=0&&r+1<=N)res-=cum[r];
// if(l+1>=0)res+=cum2[l-1+2];
LL res=cum[N]-cum[r];
if((N-l)%2) --l;
if(l>=0) res+=cum2[l];
return res;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout<<setprecision(12)<<fixed;
cin>>N>>Q;
REP(i,N) cin>>A[i];
prep();
REP(i,Q) {
int x; cin>>x;
cout<<solve(x)<<endl;
}
return 0;
}
|
p03158 | C++ | #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <sstream>
#include <set>
#include <map>
#include <iostream>
#include <utility>
#include <cctype>
#include <queue>
#include <stack>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <unordered_set>
#include <unordered_map>
#include <limits.h>
#include <cstring>
#include <tuple>
#include <cassert>
#include <numeric>
#include <iomanip>
using namespace std;
// type alias
typedef long long LL;
typedef pair< int , int > II;
typedef tuple< int, int, int > III;
typedef vector<int> VI;
typedef vector<string> VS;
typedef vector<vector<int>> VVI;
typedef unordered_map<int,int> MAPII;
typedef unordered_set<int> SETI;
template<class T> using VV=vector<vector<T>>;
// minmax
template<class T> inline T SMIN(T& a, const T b) { return a=(a>b)?b:a; }
template<class T> inline T SMAX(T& a, const T b) { return a=(a<b)?b:a; }
// repetition
#define FORE(i,a,b) for(int i=(a);i<=(b);++i)
#define REPE(i,n) for(int i=0;i<=(n);++i)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) for(int i=0;i<(n);++i)
#define FORR(x,arr) for(auto& x:arr)
#define SZ(a) int((a).size())
// collection
#define ALL(c) (c).begin(),(c).end()
// DP
#define MINUS(dp) memset(dp, -1, sizeof(dp))
#define ZERO(dp) memset(dp, 0, sizeof(dp))
// stdout
#define println(args...) fprintf(stdout, ##args),putchar('\n');
// debug cerr
#define TRACE true
#define dump(x) if(TRACE) { cerr << #x << " = " << (x) << endl; }
#define dump2(x,y) if(TRACE) { cerr << #x << " = " << (x) << ", " << #y << " = " << (y) << endl; }
#define dump3(x,y,z) if(TRACE) { cerr << #x << " = " << (x) << ", " << #y << " = " << (y) << ", " << #z << " = " << (z) << endl; }
#define dump4(x,y,z,a) if(TRACE) { cerr << #x << " = " << (x) << ", " << #y << " = " << (y) << ", " << #z << " = " << (z) << ", " << #a << " = " << (a) << endl; }
#define dumpf(args...) if(TRACE) { fprintf(stderr, ##args); putchar('\n'); }
#define dumpAR(ar) if(TRACE) { FORR(x,(ar)) { cerr << x << ','; } cerr << endl; }
template<class Iter> void dumpc(Iter begin, Iter end) { if (TRACE) { for(; begin!=end; ++begin) { cerr<<*begin<<','; } cerr<<endl; } }
// $ cp-batch NearestCardGame | diff NearestCardGame.out -
// $ g++ -std=c++14 -Wall -O2 -D_GLIBCXX_DEBUG -fsanitize=address NearestCardGame.cpp && ./a.out
/*
1/17/2019
16:54-18:16 WA
18:30 give up
22:10- read submit solutions
DO NOT binary search by `radius`.
It's confusing to resolve tie of distance with `x`.
It's possible to binary search by # of elements that Takahashi takes.
Aoki should take the same number. We can check validity.
Condition of the validity is complex. I couldn't clearly define it.
Solution with radius binary search by @sugim48
- https://atcoder.jp/contests/aising2019/submissions/3987556
*/
const int MAX_N=1e6+10;
LL A[MAX_N];
int N,Q;
LL cum[MAX_N];
LL cum2[MAX_N];
void prep() {
cum[0]=0,cum2[0]=cum2[1]=0;
REP(i,N) {
cum[i+1]=cum[i]+A[i];
cum2[i+2]=cum2[i]+A[i];
}
}
LL solve(int x) {
LL good=0,bad=N+1;
while(abs(good-bad)>1) {
LL mid=(good+bad)/2;
if(N-(2*mid-1)<0) bad=mid; else {
LL d1=x-A[N-(2*mid-1)],d2=A[N-mid]-x;
// dump2(mid,d1<=d2);
(d1<=d2?good:bad)=mid;
}
}
int r=N-good,l=N-(2*good-1);
LL res=cum[N]-cum[r];
// dump4(x,good,l,r);
// dump(N-(2*good-1));
assert(l>=0);
res+=cum2[l];
return res;
}
II f(LL rad, int x) {
int l=lower_bound(A,A+N,x-rad)-A;
int r=upper_bound(A,A+N,x+rad)-A;
/*
int tcnt=N-(r+1),acnt=r-l+1;
// if(rad==2) dump4(l,r,tcnt,acnt);
if(tcnt>=acnt) return {l,r};
if(acnt==tcnt+1) return {l-1,r-1};
return {-10,-10};
*/
int d=r-l;
if(r<=N-d) return {l,r};
return {-10,-10};
}
LL solve_wrong(int x) {
LL good=0,bad=1e10;
LL l=N,r=N;
while(abs(good-bad)>1) {
LL m=(good+bad)/2;
II p=f(m,x);
// dump3(m,p.first,p.second);
if(p.first<-1) bad=m;
else good=m,l=p.first,r=p.second;
}
dump2(l,r);
// LL res=cum[N];
// if(r+1>=0&&r+1<=N)res-=cum[r];
// if(l+1>=0)res+=cum2[l-1+2];
LL res=cum[N]-cum[r];
if((N-l)%2) --l;
if(l>=0) res+=cum2[l];
return res;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout<<setprecision(12)<<fixed;
cin>>N>>Q;
REP(i,N) cin>>A[i];
prep();
REP(i,Q) {
int x; cin>>x;
cout<<solve(x)<<endl;
}
return 0;
}
|
p03158 | C++ | #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int N, Q; cin >> N >> Q;
vector<long long> A(N);
for (int i = 0; i < N; ++i) cin >> A[i];
reverse(A.begin(), A.end()); // 考えやすいように左右反転
vector<long long> sum(N+1), evensum(N+1); // 累積和、偶数番目累積和
for (int i = 0; i < N; ++i) {
sum[i+1] = sum[i] + A[i];
evensum[i+1] = evensum[i] + (i % 2 == 0 ? A[i] : 0);
}
vector<long long> ths, vals; // ths: L の値が変化する x の境目、vals: またそのときの先手のスコア
for (int i = 0; i < (N-1)/2; ++i) {
long long th = (A[i+1] + A[i*2+2])/2 + 1;
long long val = (sum[i+1] - sum[0]) + (evensum[N] - evensum[i*2+2]);
ths.push_back(th); vals.push_back(val);
}
reverse(ths.begin(), ths.end()); reverse(vals.begin(), vals.end());
for (int _ = 0; _ < Q; ++_) {
long long x; cin >> x;
int it = upper_bound(ths.begin(), ths.end(), x) - ths.begin(); // L の値が何かを求める
if (it == 0) cout << sum[(N+1)/2] - sum[0] << endl;
else cout << vals[it-1] << endl;
}
}
|
p03158 | C++ | #include<bits/stdc++.h>
#define ll long long
using namespace std;
int n,q,a[100005],k[100005];
ll sa[100005],sb[100005];
int main()
{
scanf("%d%d",&n,&q);
for(int i=1+n%2,j=0;j<n;i++,j++) scanf("%d",&a[i]);
n+=n%2;
for(int i=1;i<=n/2;i++) k[i]=(a[i*2]+a[n/2+i])/2;
for(int i=1;i<=n;i++) sa[i]=sa[i-1]+a[i];
for(int i=1;i<=n;i++) sb[i]=sb[i-1]+(i%2?0:a[i]);
while(q--)
{
int x;
scanf("%d",&x);
int t=lower_bound(k,k+n/2,x)-k;
t=n/2-t+1;
printf("%lld\n",sa[n]-sa[n-t]+sb[n-t*2]);
}
}
|
p03158 | C++ | #include <iostream>
#include <cstdio>
#define N 100005
using namespace std;
typedef long long ll;
ll n, q, a[N], k[N], sa[N], sb[N];
int main() {
ll i, j, x, t;
scanf("%lld%lld", &n, &q);
for(i=1+n%2, j=0; j<n; i++, j++) scanf("%lld", &a[i]);
n += n%2;
for(i=1; i<=n/2; i++) k[i] = (a[i*2] + a[n/2+i])/2;
for(i=1; i<=n; i++) sa[i] = sa[i-1] + a[i];
for(i=1; i<=n; i++) sb[i] = sb[i-1] + (i%2 ? 0:a[i]);
while(q--)
{
scanf("%lld", &x);
t = lower_bound(k, k+n/2, x) - k;
t = n/2 - t + 1;
printf("%lld\n", sa[n] - sa[n-t] + sb[n-t*2]);
}
return 0;
}
|
p03158 | C++ | #include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<algorithm>
using namespace std;
#define ll long long
#define N 100010
int read()
{
int x=0,f=1;char c=getchar();
while (c<'0'||c>'9') {if (c=='-') f=-1;c=getchar();}
while (c>='0'&&c<='9') x=(x<<1)+(x<<3)+(c^48),c=getchar();
return x*f;
}
int n,m,a[N];
ll s[N],f[N];
int findmax(int x,int k)
{
int l=1,r=n;
while (l+1<r)
{
int mid=l+r>>1;
if (mid+k-1>n) r=mid;
else if (x-a[mid]>a[mid+k-1]-x) l=mid;
else r=mid;
}
int ans=l;
for (int i=l+1;i<=r;i++)
if (r+k-1<=n&&max(x-a[i],a[i+k-1]-x)<max(x-a[ans],a[ans+k-1]-x)) ans=i;
return a[ans+k-1];
}//和x最接近的数中取k个后最大的
bool check(int k,int x)
{
if (k*2-1>n) return 0;
return findmax(x,k-1)<a[n-k+1];
}
int main()
{
n=read(),m=read();
for (int i=1;i<=n;i++) a[i]=read();
sort(a+1,a+n+1);
s[1]=a[1];
for (int i=2;i<=n;i++) s[i]=s[i-2]+a[i];
for (int i=n;i>=1;i--) f[i]=f[i+1]+a[i];
for (int i=1;i<=m;i++)
{
int x=read();
int l=1,r=n,t=0;
while (l<=r)
{
int mid=l+r>>1;
if (check(mid,x)) t=mid,l=mid+1;
else r=mid-1;
}
ll ans=f[n-t+1];int y=n-t*2;
if (y>0) ans+=s[y];
printf("%lld\n",ans);
}
}
|
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define REP(i,n) for(int i=0;i<n;++i)
#define SORT(name) sort(name.begin(), name.end())
#define ZERO(p) memset(p, 0, sizeof(p))
#define MINUS(p) memset(p, -1, sizeof(p))
const ll LLINF = (1LL<<60);
const int INF = (1LL<<30);
const double DINF = std::numeric_limits<double>::infinity();
const int MOD = 1000000007;
#define MAX_N 100010
template< typename T >
class CumulativeSum
{
public:
CumulativeSum() {}
CumulativeSum(int sz) : m_Data(sz, T(0)) {};
void Init(int sz) { m_Data.assign(sz, T(0)); }
// k に x を加える O(1)
void Add(int k, T x) {
assert(static_cast<int>(m_Data.size()) >= k);
if(static_cast<int>(m_Data.size()) <= k) { m_Data.push_back(x); }
else { m_Data[k] = (m_Data[k] + x); }
}
// 累積和の構築 O(m_Data.size())
void Build() {
for(int i = 1; i < static_cast<int>(m_Data.size()); i++) {
m_Data[i] = (m_Data[i] + m_Data[i - 1]);
}
}
// 区間 [0, k] の和を返す O(1)
// 閉区間なので k が含まれることに注意
T Query(int k) {
if(k < 0) { return T(0); }
return (m_Data[min(k, static_cast<int>(m_Data.size()) - 1)]);
}
// 区間 [l, h] の和を返す O(1)
// 閉区間なので k が含まれることに注意
T Query(int l, int h) {
return (this->Query(h) - this->Query(l-1));
}
private:
vector< T > m_Data;
};
// v の [lb, ub) の範囲に val があるか探す
// あるならそのインデックスを返す。なければ -1 を返す
// 同じ数が複数ある場合どのインデックスを返すかは不定
// ほかの bin_search を使って範囲を絞ること
static inline ll bin_search1(const vector<ll>& v, ll lb, ll ub, ll val) {
while(lb < ub) {
ll mid = (lb + ub) / 2;
if(v[mid] == val) { return mid; }
else if(val < v[mid]) { ub = mid; }
else { lb = mid + 1; }
}
return -1;
}
// v の [lb, ub) の範囲で val 以上の要素が初めて出てくるインデックスを返す
// なければ -1 を返す
// -1 を返すとこ以外 std::lower_bound と同じ
// 同じ数が複数ある場合は一番小さいインデックスを返す
static inline ll bin_search2(const vector<ll>& v, ll lb, ll ub, ll val) {
lb--; ub--;
while(ub - lb > 1) {
ll mid = (lb + ub) / 2;
if(v[mid] >= val) { ub = mid; }
else { lb = mid; }
}
// この時点で lb + 1 = ub
return (v[ub] >= val) ? ub : -1;
}
// [lb, ub) の範囲で val 以下の要素で最大のもののインデックスを返す
// なければ -1 を返す
// 同じ数が複数ある場合は一番小さいインデックスを返す
static inline ll bin_search4(const vector<ll>& v, ll lb, ll ub, ll val) {
lb--; ub--;
while(ub - lb > 1) {
ll mid = (lb + ub) / 2;
if(v[mid] >= val) { ub = mid; }
else { lb = mid; }
}
// この時点で lb + 1 = ub
if(v[ub] <= val) { return ub; }
if(lb < 0 || v[lb] > val) { return -1; }
return lb;
}
ll N, Q;
vector<ll> A, X;
CumulativeSum<ll> cs_all, cs_odd, cs_even;
enum Player { Alice = 0, Bob = 1}; // Alice = Takahashi
// i 以降のカードが余っていて、次は player の手番の場合の
// Alice の取り分の合計
ll post(ll i, ll player) {
if(i < 0) { return 0; }
if(i % 2 == 0) {
if(player == Alice) { return cs_even.Query(i); }
else { return cs_odd.Query(i); }
}
else {
if(player == Alice) { return cs_odd.Query(i); }
else { return cs_even.Query(i); }
}
}
// [lb, rb] の範囲でとれるカードの枚数を返す
static inline ll get_cnt(ll lb, ll rb) {
ll ind_l = bin_search2(A, 0, A.size(), lb);
ll ind_r = bin_search4(A, 0, A.size(), rb);
if(ind_l == -1 || ind_r == -1) { return 0; }
return ind_r - ind_l + 1;
}
// X = x で半径 r の時に Alice と Bob が取れるカードの枚数を返す
static inline pair<ll, ll> get_card(ll x, ll r) {
ll b_card = get_cnt(x - r, x + r);
ll a_card = get_cnt(x + r + 1, LLINF);
// Bob の半径の両端にカードがあり、かつ、
// Alice の左端もそのカードの場合は、 Alice に一枚渡す
bool cond1 = (bin_search1(A, 0, A.size(), x - r) != -1);
bool cond2 = (bin_search1(A, 0, A.size(), x + r) == N - a_card - 1);
if(cond1 && cond2 && b_card == a_card + 1) {
b_card--;
a_card++;
}
// 取れるカードが最大のもの 1 枚の場合も Alice に渡す
if(b_card == 1 && a_card == 0) { swap(a_card, b_card); }
return make_pair(a_card, b_card);
}
// X = x の時に Bob が 半径 r 内のカードを取った場合に、
// Alice と Bob が取れるカードの枚数が同じにできるか
// Alice が 1 つ多く取れるなら Ok
// Alice が 2 つ以上多く取ってしまっているなら BigAlice
// Bob が多く取ってしまっているなら BigBob を返す
enum Result { Ok = 0, BigAlice = 1, BigBob = 2};
static inline ll check(ll x, ll r) {
pair<ll, ll> tmp = get_card(x, r);
ll a_card = tmp.first;
ll b_card = tmp.second;
if(a_card == b_card || a_card == b_card + 1) { return Ok; }
else if(a_card > b_card + 1) { return BigAlice; }
return BigBob;
}
// x の時に Alice がとるカードの数を返す
ll bin_search(ll x) {
ll lb = 0, ub = 1000000000;
while(ub - lb > 1) {
// Bob がとる範囲
ll mid = (lb + ub) / 2;
ll result = check(x, mid);
if(result == Ok) { return get_card(x, mid).first; }
else if(result == BigBob) { ub = mid; }
else { lb = mid; }
}
if(check(x, lb) == Ok) { return get_card(x, lb).first; }
if(check(x, ub) == Ok) { return get_card(x, ub).first; }
assert(false);
return 0;
}
ll solve(ll x) {
// Bob が 左右のどれくらいの範囲から取ったところで Alice の取る領域とぶつかるかを求める
ll a_card = bin_search(x);
// Alice がとる範囲のカードの合計を累積和で求める
ll ret = cs_all.Query(N - a_card, N - 1);
ret += post(N - (a_card * 2) - 1, Alice);
return ret;
}
signed main()
{
cin >> N >> Q;
A.assign(N, 0);
X.assign(Q, 0);
cs_all.Init(N);
cs_even.Init(N);
cs_odd.Init(N);
REP(i, N) {
cin >> A[i];
cs_all.Add(i, A[i]);
if(i % 2 == 0) { cs_even.Add(i, A[i]); }
else { cs_odd.Add(i, A[i]); }
}
REP(i, Q) { cin >> X[i]; }
cs_all.Build();
cs_even.Build();
cs_odd.Build();
REP(i, Q) {
ll ans = solve(X[i]);
printf("%lld\n", ans);
}
return 0;
}
|
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define REP(i,n) for(int i=0;i<n;++i)
#define SORT(name) sort(name.begin(), name.end())
#define ZERO(p) memset(p, 0, sizeof(p))
#define MINUS(p) memset(p, -1, sizeof(p))
#if 0
# define DBG(fmt, ...) printf(fmt, ##__VA_ARGS__)
#else
# define DBG(fmt, ...)
#endif
const ll LLINF = (1LL<<60);
const int INF = (1LL<<30);
const double DINF = std::numeric_limits<double>::infinity();
const int MOD = 1000000007;
#define MAX_N 100010
#if 1
# define SUBMIT
#endif
template< typename T >
class CumulativeSum
{
public:
CumulativeSum() {}
CumulativeSum(int sz) : m_Data(sz, T(0)) {};
void Init(int sz) { m_Data.assign(sz, T(0)); }
// k に x を加える O(1)
void Add(int k, T x) {
assert(static_cast<int>(m_Data.size()) >= k);
if(static_cast<int>(m_Data.size()) <= k) { m_Data.push_back(x); }
else { m_Data[k] = (m_Data[k] + x); }
}
// 累積和の構築 O(m_Data.size())
void Build() {
for(int i = 1; i < static_cast<int>(m_Data.size()); i++) {
m_Data[i] = (m_Data[i] + m_Data[i - 1]);
}
}
// 区間 [0, k] の和を返す O(1)
// 閉区間なので k が含まれることに注意
T Query(int k) {
if(k < 0) { return T(0); }
return (m_Data[min(k, static_cast<int>(m_Data.size()) - 1)]);
}
// 区間 [l, h] の和を返す O(1)
// 閉区間なので k が含まれることに注意
T Query(int l, int h) {
return (this->Query(h) - this->Query(l-1));
}
private:
vector< T > m_Data;
};
// v の [lb, ub) の範囲に val があるか探す
// あるならそのインデックスを返す。なければ -1 を返す
// 同じ数が複数ある場合どのインデックスを返すかは不定
// ほかの bin_search を使って範囲を絞ること
static inline ll bin_search1(const vector<ll>& v, ll lb, ll ub, ll val) {
while(lb < ub) {
ll mid = (lb + ub) / 2;
if(v[mid] == val) { return mid; }
else if(val < v[mid]) { ub = mid; }
else { lb = mid + 1; }
}
return -1;
}
// v の [lb, ub) の範囲で val 以上の要素が初めて出てくるインデックスを返す
// なければ -1 を返す
// -1 を返すとこ以外 std::lower_bound と同じ
// 同じ数が複数ある場合は一番小さいインデックスを返す
static inline ll bin_search2(const vector<ll>& v, ll lb, ll ub, ll val) {
lb--; ub--;
while(ub - lb > 1) {
ll mid = (lb + ub) / 2;
if(v[mid] >= val) { ub = mid; }
else { lb = mid; }
}
// この時点で lb + 1 = ub
return (v[ub] >= val) ? ub : -1;
}
// [lb, ub) の範囲で val 以下の要素で最大のもののインデックスを返す
// なければ -1 を返す
// 同じ数が複数ある場合は一番小さいインデックスを返す
static inline ll bin_search4(const vector<ll>& v, ll lb, ll ub, ll val) {
lb--; ub--;
while(ub - lb > 1) {
ll mid = (lb + ub) / 2;
if(v[mid] >= val) { ub = mid; }
else { lb = mid; }
}
// この時点で lb + 1 = ub
if(v[ub] <= val) { return ub; }
if(lb < 0 || v[lb] > val) { return -1; }
return lb;
}
ll N, Q;
vector<ll> A, X;
CumulativeSum<ll> cs_all, cs_odd, cs_even;
enum Player { Alice = 0, Bob = 1}; // Alice = Takahashi
// i 以降のカードが余っていて、次は player の手番の場合の
// Alice の取り分の合計
ll post(ll i, ll player) {
if(i < 0) { return 0; }
if(i % 2 == 0) {
if(player == Alice) { return cs_even.Query(i); }
else { return cs_odd.Query(i); }
}
else {
if(player == Alice) { return cs_odd.Query(i); }
else { return cs_even.Query(i); }
}
}
enum Result { Ok = 0, BigAlice = 1, BigBob = 2};
// [lb, rb] の範囲でとれるカードの枚数を返す
ll get_cnt(ll lb, ll rb) {
ll ind_l = bin_search2(A, 0, A.size(), lb);
ll ind_r = bin_search4(A, 0, A.size(), rb);
if(ind_l == -1 || ind_r == -1) { return 0; }
return ind_r - ind_l + 1;
}
// X = x で半径 r の時に Alice と Bob が取れるカードの枚数を返す
pair<ll, ll> get_card(ll x, ll r) {
ll b_card = get_cnt(x - r, x + r);
ll a_card = get_cnt(x + r + 1, LLINF);
// Bob の半径の両端にカードがあり、かつ、
// Alice の左端もそのカードの場合は、 Alice に一枚渡す
bool cond1 = (bin_search1(A, 0, A.size(), x - r) != -1);
bool cond2 = (bin_search1(A, 0, A.size(), x + r) == N - a_card - 1);
if(cond1 && cond2 && b_card == a_card + 1) {
b_card--;
a_card++;
}
// 取れるカードが最大のもの 1 枚の場合も Alice に渡す
if(b_card == 1 && a_card == 0) {
swap(a_card, b_card);
}
return make_pair(a_card, b_card);
}
// X = x の時に Bob が 半径 r 内のカードを取った場合に、
// Alice と Bob が取れるカードの枚数が同じにできるか
// Alice が 1 つ多く取れるなら Ok
// Alice が 2 つ以上多く取ってしまっているなら BigAlice
// Bob が多く取ってしまっているなら BigBob を返す
ll check(ll x, ll r) {
pair<ll, ll> tmp = get_card(x, r);
ll a_card = tmp.first;
ll b_card = tmp.second;
DBG(" r: %lld a_card: %lld b_card: %lld\n", r, a_card, b_card);
if(a_card == b_card || a_card == b_card + 1) { return Ok; }
else if(a_card > b_card + 1) { return BigAlice; }
return BigBob;
}
// x の時に Alice がとるカードの数を返す
ll bin_search(ll x) {
ll lb = 0, ub = 1000000000;
while(ub - lb > 1) {
// Bob がとる範囲
ll mid = (lb + ub) / 2;
ll result = check(x, mid);
if(result == Ok) {
return get_card(x, mid).first;
}
else if(result == BigBob) {
DBG(" BigBob\n");
ub = mid;
}
else {
DBG(" BigAlice\n");
lb = mid;
}
}
DBG("lb: %lld\n", lb);
if(check(x, lb) == Ok) {
return get_card(x, lb).first;
}
DBG("ub: %lld\n", ub);
if(check(x, ub) == Ok) {
return get_card(x, ub).first;
}
#ifndef SUBMIT
printf("A: ");
for(auto& a : A) { printf("%lld ", a); }
printf("\n");
printf("X: %lld\n", x);
#endif
assert(false);
return 0;
}
ll solve(ll x) {
ll ret = 0;
DBG("x: %lld\n", x);
// Alice が右端からいくつ取ったところで Bob の取る領域とぶつかるかを求める
ll a_card = bin_search(x);
ret += cs_all.Query(N - a_card, N - 1);
ret += post(N - (a_card * 2) - 1, Alice);
return ret;
}
signed main()
{
#ifdef SUBMIT
cin >> N >> Q;
A.assign(N, 0);
X.assign(Q, 0);
cs_all.Init(N);
cs_even.Init(N);
cs_odd.Init(N);
REP(i, N) {
cin >> A[i];
cs_all.Add(i, A[i]);
if(i % 2 == 0) { cs_even.Add(i, A[i]); }
else { cs_odd.Add(i, A[i]); }
}
REP(i, Q) { cin >> X[i]; }
cs_all.Build();
cs_even.Build();
cs_odd.Build();
REP(i, Q) {
ll ans = solve(X[i]);
printf("%lld\n", ans);
}
#else
N = 5;
random_device r;
mt19937 mt(r());
uniform_int_distribution<> dist(1, 9);
REP(loop, 100) {
A.assign(N, 0);
cs_all.Init(N);
cs_even.Init(N);
cs_odd.Init(N);
REP(i, N) {
if(i == 0) {
A[i] = dist(mt);
}
else {
A[i] = A[i-1] + dist(mt);
}
cs_all.Add(i, A[i]);
if(i % 2 == 0) { cs_even.Add(i, A[i]); }
else { cs_odd.Add(i, A[i]); }
}
cs_all.Build();
cs_even.Build();
cs_odd.Build();
for(ll x = 1; x < 50; ++x) {
solve(x);
}
}
#endif
return 0;
}
|
p03158 | C++ | #include<bits/stdc++.h>
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--)
typedef long long LL;
int N,Q;
LL A[100001];
LL X[100001];
LL S[100001];
LL T[100001];
LL SS[100001];
LL biparate(LL x){
int lb=-1;
int ub=N;
while(ub-lb>1){
int mid=(ub+lb)/2;
if(x<=A[mid]){
ub=mid;
}else{
lb=mid;
}
}
return ub;
}
bool check(LL x,LL a){
if(A[x]<a)return true;
LL now=A[x];
LL y=a-(now-a);
int b=biparate(y);
int c=x-b+1;
int d=N-1-x;
//cout<<x<<" xx "<<b<<"bb "<<c<<" cc"<<d<<" dd"<<endl;
if(c<=d){
return true;
}
return false;
}
int main(){
cin>>N>>Q;
REP(i,N){
cin>>A[i];
if(i==0){
S[0]=A[0];
SS[0]=A[0];
T[0]=0;
}else if(i%2==1){
S[i]=S[i-1];
SS[i]=SS[i-1]+A[i];
if(i==1){
T[1]=A[1];
}else{
T[i]=T[i-1]+A[i];
}
}else{
S[i]=A[i]+S[i-1];
SS[i]=SS[i-1]+A[i];
T[i]=T[i-1];
}
}
REP(i,Q){
cin>>X[i];
}
/*
REP(i,N){
cout<<S[i]<<" "<<SS[i]<<endl;
}*/
REP(i,Q){
int ub=N-1;
int lb=-1;
while(ub-lb>1){
int mid=(ub+lb)/2;
if(check(mid,X[i])){
lb=mid;
}else{
ub=mid;
}
}
//cout<<"lb"<<lb<<endl;
int c=N-1-lb;
//cout<<c<<endl;
LL ans=0;
if(c<=lb){
ans=SS[N-1]-SS[lb];
//ans=SS[lb]-SS[lb-c];
if((lb-c)%2==1){
ans+=T[lb-c];
}else{
ans+=S[lb-c];
}
}else{
ans=SS[N-1]-SS[lb];
//ans=SS[lb];
}
cout<<ans<<endl;
}
} |
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
long long N;
long long Q;
long long A[100000];
long long X[100000];
bool lt(int x, int a, int b){
if(b < 0 || b >= N) return true;
if(a < 0 || a >= N) return false;
long long d1 = abs(x - A[a]);
long long d2 = abs(x - A[b]);
if(d1 < d2) return true;
if(d1 == d2) return a < b;
return false;
}
int main(){
scanf("%lld",&N);
scanf("%lld",&Q);
for(int i = 0 ; i <= N-1 ; i++){
scanf("%lld",&A[i]);
}
for(int i = 0 ; i <= Q-1 ; i++){
scanf("%lld",&X[i]);
}
long long sumN[N+1], sum[N+1];
sumN[0] = 0;
sumN[1] = A[0];
for (int i = 2; i <= N; i++) {
sumN[i] = sumN[i-2] + A[i-1];
}
sum[0] = 0;
for (int i = 1; i <= N; i++) sum[i] = sum[i-1]+A[i-1];
for (int q = 0; q < Q; q++) {
long long ok = 1, ng = N+1;
long long mid;
while (ng - ok > 1) {
mid = (ng + ok) / 2;
long long midDivTwo = mid / 2;
if (midDivTwo*2 < mid) midDivTwo++;
if ((abs(A[N-midDivTwo]-X[q])>abs(A[N-mid]-X[q])) || (abs(A[N-midDivTwo]-X[q])==abs(A[N-mid]-X[q]) && N-midDivTwo > N-mid)) {
ok = mid;
} else {
ng = mid;
}
}
long long res = 0;
long long okDivTwo = ok / 2;
if (okDivTwo*2 < ok) okDivTwo++;
res += sum[N]-sum[N-okDivTwo];
if (ok % 2 == 0 && N-ok >= 0) {
res += sumN[N-ok];
} else if (N-ok-1 >= 0) {
res += sumN[N-ok-1];
}
printf("%lld\n",res);
}
return 0;
}
|
p03158 | C++ | #include<vector>
#include<cmath>
#include<map>
#include<cstdlib>
#include<iostream>
#include<sstream>
#include<fstream>
#include<string>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<set>
#include<stack>
#include<bitset>
#include<functional>
#include<ctime>
#include<queue>
#include<deque>
#include<complex>
#include<cassert>
using namespace std;
#define pb push_back
#define pf push_front
typedef long long lint;
typedef complex<double> P;
#define mp make_pair
#define fi first
#define se second
typedef pair<int,int> pint;
#define All(s) s.begin(),s.end()
#define rAll(s) s.rbegin(),s.rend()
#define REP(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
lint a[100100];
lint gs[100100],ks[100100],s[100100];
int main()
{
int n,q;lint x;
cin>>n>>q;
rep(i,n) cin>>a[i];
gs[0]=ks[0]=s[0]=0;
rep(i,n){
gs[i+1]=gs[i];
ks[i+1]=ks[i];
s[i+1]=s[i]+a[i];
if(i%2==0) gs[i+1]+=a[i];else ks[i+1]+=a[i];
}
rep(i,q){
cin>>x;
int lo=0,hi=n;
while(hi>lo){
int mi=(hi+lo)/2;
int it=lower_bound(a,a+n,x*2-a[mi])-a;
if(mi-it<n-mi-1) lo=mi+1;else hi=mi;
}
lint ret=s[n]-s[lo];
if(n%2==0) ret+=ks[lo*2-n];else ret+=gs[lo*2-n];
cout<<ret<<endl;
}
}
|
p03158 | C++ | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; (i) < (int)(n); ++ (i))
#define ALL(x) begin(x), end(x)
using ll = long long;
using namespace std;
vector<ll> solve(int n, int q, vector<ll> const & a, vector<ll> const & x) {
vector<ll> acc(n + 1);
partial_sum(ALL(a), acc.begin() + 1);
vector<ll> acc_even(n + 1);
REP (i, n) {
acc_even[i + 1] = acc_even[i] + (i % 2 == 0 ? a[i] : 0);
}
vector<int> order(q);
iota(ALL(order), 0);
sort(ALL(order), [&](int i, int j) { return x[i] > x[j]; });
auto get_l_r = [&](int k) {
int l = max(0, n - 2 * k);
int r = n - k;
return make_pair(l, r);
};
auto pred = [&](ll x, int k) {
int l, r; tie(l, r) = get_l_r(k);
ll d = max(abs(a[l] - x), abs(a[r - 1] - x));
return not (l - 1 >= 0 and abs(a[l - 1] - x) <= d);
};
vector<ll> answer(q);
int k = 1;
for (int i : order) {
while (k < (n + 1) / 2 and not pred(x[i], k)) ++ k;
int l, r; tie(l, r) = get_l_r(k);
answer[i] = (acc[n] - acc[r]) + (n % 2 == 0 ? acc[l] - acc_even[l] : acc_even[l]);
}
return answer;
}
int main() {
int 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];
for (ll y_i : solve(n, q, a, x)) {
cout << y_i << endl;
}
return 0;
}
|
p03158 | C++ | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; (i) < (int)(n); ++ (i))
#define REP3(i, m, n) for (int i = (m); (i) < (int)(n); ++ (i))
#define REP_R(i, n) for (int i = int(n) - 1; (i) >= 0; -- (i))
#define REP3R(i, m, n) for (int i = int(n) - 1; (i) >= (int)(m); -- (i))
#define ALL(x) begin(x), end(x)
#define dump(x) cerr << #x " = " << x << endl
#define unittest_name_helper(counter) unittest_ ## counter
#define unittest_name(counter) unittest_name_helper(counter)
#define unittest __attribute__((constructor)) void unittest_name(__COUNTER__) ()
using ll = long long;
using namespace std;
template <class T> using reversed_priority_queue = priority_queue<T, vector<T>, greater<T> >;
template <class T, class U> inline void chmax(T & a, U const & b) { a = max<T>(a, b); }
template <class T, class U> inline void chmin(T & a, U const & b) { a = min<T>(a, b); }
template <typename X, typename T> auto vectors(X x, T a) { return vector<T>(x, a); }
template <typename X, typename Y, typename Z, typename... Zs> auto vectors(X x, Y y, Z z, Zs... zs) { auto cont = vectors(y, z, zs...); return vector<decltype(cont)>(x, cont); }
template <typename T> ostream & operator << (ostream & out, vector<T> const & xs) { REP (i, int(xs.size()) - 1) out << xs[i] << ' '; if (not xs.empty()) out << xs.back(); return out; }
template <typename UnaryPredicate>
int64_t binsearch(int64_t l, int64_t r, UnaryPredicate p) {
assert (l <= r);
-- l;
while (r - l > 1) {
int64_t m = l + (r - l) / 2;
(p(m) ? r : l) = m;
}
return r;
}
vector<ll> solve(int n, int q, vector<ll> const & a, vector<ll> const & x) {
vector<ll> acc(n + 1);
partial_sum(ALL(a), acc.begin() + 1);
vector<ll> acc_even(n + 1);
REP (i, n) {
acc_even[i + 1] = acc_even[i] + (i % 2 == 0 ? a[i] : 0);
}
vector<int> order(q);
iota(ALL(order), 0);
sort(ALL(order), [&](int i, int j) { return x[i] > x[j]; });
auto get_l_r = [&](int k) {
int l = max(0, n - 2 * k);
int r = n - k;
return make_pair(l, r);
};
auto pred = [&](ll x, int k) {
int l, r; tie(l, r) = get_l_r(k);
ll d = max(abs(a[l] - x), abs(a[r - 1] - x));
if (l - 1 >= 0 and abs(a[l - 1] - x) <= d) return false;
// if (r < n and abs(a[r] - x) < d) return false;
return true;
};
vector<ll> answer(q);
int k = 1;
// dump(n);
// dump(a);
for (int i : order) {
while (k < (n + 1) / 2 and not pred(x[i], k)) ++ k;
int l, r; tie(l, r) = get_l_r(k);
answer[i] = (acc[n] - acc[r]) + (n % 2 == 0 ? acc[l] - acc_even[l] : acc_even[l]);
// cerr << endl;
// dump(i);
// dump(x[i]);
// dump(k);
// dump(l);
// dump(r);
}
return answer;
}
int main() {
int 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];
for (ll y_i : solve(n, q, a, x)) {
cout << y_i << endl;
}
return 0;
}
|
p03158 | C++ | #include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define rep(i,n) FOR(i,0,n)
#define RFOR(i,a,b) for(int i=(a)-1;i>=(b);i--)
#define rrep(i,n) RFOR(i,n,0)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
// 参考
// http://drken1215.hatenablog.com/entry/2019/01/13/033500
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int N, Q;
cin >> N >> Q;
vector<ll> A(N);
rep(i, N) cin >> A[i];
reverse(A.begin(), A.end());
vector<ll> sum(N+1), evensum(N+1);
rep(i, N){
sum[i+1] = sum[i] + A[i];
evensum[i+1] = evensum[i] + (i % 2 == 0 ? A[i] : 0);
}
vector<ll> ths, vals;
for(int i = 0; i < (N-1) / 2; i++){
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.push_back(th);
vals.push_back(val);
}
reverse(ths.begin(), ths.end());
reverse(vals.begin(), vals.end());
rep(i, Q){
ll x;
cin >> x;
int it = upper_bound(ths.begin(), ths.end(), x) - ths.begin();
if(it == 0) cout << sum[(N+1) / 2] - sum[0] << endl;
else cout << vals[it-1] << endl;
}
}
|
p03158 | C++ | #include <iostream>
#include <fstream>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <algorithm>
#include <numeric>
#include <functional>
#include <string>
#include <vector>
#include <bitset>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
using namespace std;
using ll = long long;
#define REP(i,n) for(long long i = 0; i < (n); i++)
#define FOR(i, m, n) for(long long i = (m);i < (n); ++i)
#define ALL(obj) (obj).begin(),(obj).end()
template<class T> using V = vector<T>;
template<class T, class U> using P = pair<T, U>;
const ll MOD = (ll)1e9 + 7;
const ll MOD2 = 998244353;
const ll LLINF = (ll)1e18;
const ll INTINF = (ll)1e9;
const long double PI = 3.1415926535897932384626433;
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
template <template <class tmp> class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max<T>(a,b);}
template <class T> void chmin(T& a, const T b){a=min<T>(a,b);}
void YN(bool flg) {cout << ((flg) ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << ((flg) ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << ((flg) ? "yes" : "no") << endl;}
int main() {
int N,Q; cin >> N >> Q;
V<ll> a(N+1,0),sum(N+1,0),evn(N+1,0),odd(N+1,0),ans;
FOR(i,1,N+1) cin >> a[i];
FOR(i,1,N+1) sum[i] += sum[i-1] + a[i];
FOR(i,1,N+1) evn[i] += evn[i-1] + (i%2?a[i]:0);
FOR(i,1,N+1) odd[i] += odd[i-1] + (i%2?0:a[i]);
while(Q--){
ll X,dx; cin >> X;
int ng = 0,ok = N,md;
while(ok-ng>1){
md = (ok+ng)/2;
if(a[md] < X) {
ng = md;
continue;
}
int ta = N - md + 1;
int ao = md - (lower_bound(ALL(a),max(1LL,2*X-a[md])) - a.begin()) + 1;
(ta>ao?ng:ok)=md;
}
ll cnt = sum[N]-sum[ok-1];
cnt += (N%2?evn[max(N-2*(N-ok+1),0)]:odd[max(N-2*(N-ok+1),0)]);
ans.push_back(cnt);
}
for(auto e:ans) cout << e << endl;
return 0;
}
|
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int N, Q; cin >> N >> Q;
vector<ll> A(N), X(Q);
for(int i=0; i<N; i++) cin >> A[i];
for(int i=0; i<Q; i++) cin >> X[i];
vector<ll> S(N), evenS(N);
S[0] = A[0]; evenS[0] = A[0];
for(int i=1; i<N; i++){
S[i] = S[i-1] + A[i];
evenS[i] = evenS[i-1];
if(i%2==0) evenS[i]+=A[i];
}
int P = N/2+1;
vector<ll> B(P+1);
B[1] = 1e18;
if(N%2==1) B[P] = A[N-P] + A[N-2*P+1];
else B[P] = 0;
for(int p=2; p<P; p++){
B[p] = A[N-p] + A[N-2*p+1];
}
for(int i=0; i<Q; i++){
ll x = X[i];
if(2*x <= B[P]){
cout << S[N-1] - S[P-2] << endl;
}else{
int l = 1, r = P-1;
int p = l + (r-l)/2;
while(!(B[p+1] < 2*x && 2*x <= B[p])){
if(B[p+1] >= 2*x) l = p + 1;
else r = p;
p = l + (r-l)/2;
}
if(N%2==0){
cout << S[N-1] - S[N-p-1] + S[N-2*p-1] - evenS[N-2*p-1] << endl;
}else{
cout << S[N-1] - S[N-p-1] + evenS[N-2*p-1] << endl;
}
}
}
}
|
p03158 | C++ | #include <cstring>
#include <map>
#include <unordered_map>
#include <string>
#include <list>
#include <vector>
#include <algorithm>
#include <queue>
#include <stack>
#include <cstdio>
#include <iostream>
#include <set>
#include <unordered_set>
using namespace std;
#define MAX(a,b) (a>b?a:b)
#define MIN(a,b) (a<b?a:b)
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int ui;
typedef pair<int, int> pii;
int gi() {
int a;
scanf("%d", &a);
return a;
}
ll gli() {
ll a;
scanf("%lld", &a);
return a;
}
#define N 100000
int a[N];
ll s[N+1];
ll s2[N/2+1];
int n;
ll odds(int m) {
return (m%2 ? s[m] - s2[m/2] : s2[m/2]);
}
int solve2(int x, int t) {
int l = t-1, r = n-1;
while (1) {
int i2 = (l+r)/2;
int i1 = i2-t+1;
if (i2 < n-1 && abs(x-a[i2+1]) < abs(x-a[i1])) {
l = i2+1;
continue;
}
if (i1 > 0 && abs(x-a[i1-1]) <= abs(x-a[i2])) {
r = i2-1;
continue;
}
return i2;
}
return 0;
}
ll solve(int x) {
if (x >= a[n-2])
return odds(n);
int l = 1, r = n;
while (1) {
int m = (l+r)/2;
int i2 = solve2(x, m);
int th = n-m;
if (i2 > th-1)
r = m-1;
else if (i2 == th-1)
return s[n] - s[n-m] + odds(n-2*m);
else if (i2 == th-2)
return s[n] - s[n-m-1] + s[n-2*m-1] - odds(n-2*m-1);
else
l = m+1;
}
return 0;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
n = gi();
int q = gi();
s[0] = 0;
s2[0] = 0;
for (int i = 0; i < n; i++) {
int x = gi();
a[i] = x;
s[i+1] = s[i] + x;
if (i%2)
s2[i/2+1] = s2[i/2] + x;
}
for (int i = 0; i < q; i++)
cout << solve(gi()) << endl;
return 0;
}
|
p03158 | C++ | #include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <typeinfo>
#include <numeric>
#include <functional>
#include <unordered_map>
#include <bitset>
#include <stack>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const ll INF = 1e16;
const ll MOD = 1e9 + 7;
#define REP(i, n) for(ll i = 0; i < n; i++)
int main() {
ll n, q;
cin >> n >> q;
vector<ll> a(n + 1), r1(n + 1), r2(n + 1);
REP(i, n){
cin >> a[i + 1];
r1[i + 1] = r1[i] + a[i + 1];
r2[i + 1] = a[i + 1];
if(i > 0) r2[i + 1] += r2[i - 1];
}
REP(_, q){
ll x;
cin >> x;
ll le = 0, ri = n;
while(ri - le > 1){
ll ce = (le + ri) / 2;
if(a[ce] < x){
le = ce;
}
else{
ll takahashi = n - ce;
ll aoki = ce - (lower_bound(a.begin(), a.end(), max(1LL, 2 * x - a[ce])) - a.begin()) + 1;
if(takahashi >= aoki){
le = ce;
}
else{
ri = ce;
}
}
}
ll ans = r1[n] - r1[ri - 1];
ll p = n - (n - ri + 1) * 2;
if(p > 0) ans += r2[p];
cout << ans << endl;
}
} |
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int (i)=(0);(i)<(long long)(n);++(i))
using ll = long long;
using P = pair<int, int>;
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
vector<ll> A(N);
rep(i, N) cin >> A[i];
reverse(A.begin(), A.end());
vector<ll> sum(N+1), evensum(N+1);
rep(i, N) {
sum[i+1] = sum[i]+A[i];
evensum[i+1] = evensum[i] + (i%2 == 0 ? A[i] : 0);
}
vector<ll> ths, vals;
for (int k=0; k<(N-1)/2; ++k) {
ll th = (A[k+1]+A[k*2+2])/2 + 1;
ll val = sum[k+1] + evensum[N] - evensum[k*2+2];
ths.push_back(th);
vals.push_back(val);
}
reverse(ths.begin(), ths.end());
reverse(vals.begin(), vals.end());
rep(i, Q) {
ll X;
cin >> X;
int index = upper_bound(ths.begin(), ths.end(), X) - ths.begin();
if (index == 0) cout << sum[(N+1)/2] << endl;
else cout << vals[index-1] << endl;
}
return 0;
}
|
p03158 | C++ | #include<iostream>
#include<algorithm>
using namespace std;
#define i64 long long int
int n;
i64 a[100100], sum[100100], sum2[100100];
int main(){
int q;i64 X;
ios::sync_with_stdio(false);
cin >> n >> q;
for(int i=1; i<=n; i++)cin >> a[i];
if(n % 2 == 1){
for(int i=n; i>=1; i--)a[i+1] = a[i];
a[1] = (i64)(-2e9);
++n;
}
a[0] = (i64)(-2e10);
for(int i=1; i<=n; i++){
sum[i] = a[i] + sum[i-1];
sum2[i] = a[i] + (i<=2?0:sum2[i-2]);
}
while(q--){
cin >> X;
int hi = (a+n+1) - (lower_bound(a+1, a+n+1, X)), lo = (hi + 1) / 2;
while(lo != hi){
int mi = (lo + hi)/2;
if(n - mi * 2 >= 0 && X - a[n - mi * 2] <= a[n - mi] - X)
lo = mi + 1;
else
hi = mi;
}
cout << sum[n] - sum[n - lo] + sum2[n - lo * 2] << endl;
}
return 0;
}
|
p03158 | C++ | #include<iostream>
#include<vector>
#include<algorithm>
#include<cmath>
using namespace std;
int main(){
int n, q;
cin >> n >> q;
vector<long long> a(n), sum1(n), sum2(n);
for(int i = 0; i < n; i++){
cin >> a[i];
sum1[i] = a[i];
if(i % 2 == (n - 1) % 2) sum2[i] = a[i];
}
for(int i = 1; i < n; i++){
sum1[i] += sum1[i - 1];
sum2[i] += sum2[i - 1];
}
for(int i = 0; i < q; i++){
int x;
cin >> x;
int l = 0, r = n + 1;
while(r - l > 1){
int mid = (l + r) / 2;
int al = a[n - mid], ar = a[n - (mid + 1) / 2];
if(abs(x - al) <= abs(x - ar)){
l = mid;
}else{
r = mid;
}
}
long long ans = sum1[n - 1] - sum1[n - (l + 1) / 2 - 1];
if(n > l) ans += sum2[n - l - 1];
cout << ans << endl;
}
return 0;
}
|
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int N, Q; cin >> N >> Q;
vector<ll> A(N), X(Q);
for(int i=0; i<N; i++) cin >> A[i];
for(int i=0; i<Q; i++) cin >> X[i];
vector<ll> sumA(N), evenSumA(N);
sumA[0] = A[0]; evenSumA[0] = A[0];
for(int i=1; i<N; i++){
sumA[i] = sumA[i-1] + A[i];
evenSumA[i] = evenSumA[i-1];
if(i%2==0) evenSumA[i]+=A[i];
}
int P = N/2+1;
vector<ll> B(P+1);
if(N%2==1) B[P] = A[N-P] + A[N-2*P+1];
else B[P] = 0;
for(int p=1; p<P; p++){
B[p] = A[N-p] + A[N-2*p+1];
}
for(int i=0; i<Q; i++){
ll x = X[i];
if(2*x > B[1]){
if(N%2==0) cout << sumA[N-1] - evenSumA[N-1] << endl;
else cout << evenSumA[N-1] << endl;
}else if(2*x <= B[P]){
cout << sumA[N-1] - sumA[P-2] << endl;
}else{
int l = 1, r = P-1;
int p = l + (r-l)/2;
while(!(B[p+1] < 2*x && 2*x <= B[p])){
if(B[p+1] >= 2*x) l = p + 1;
else r = p;
p = l + (r-l)/2;
}
if(N%2==0){
cout << sumA[N-1] - sumA[N-p-1] + sumA[N-2*p-1] - evenSumA[N-2*p-1] << endl;
}else{
cout << sumA[N-1] - sumA[N-p-1] + evenSumA[N-2*p-1] << endl;
}
}
}
}
|
p03158 | C++ | #include <bits/stdc++.h>
#define fi first
#define se second
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define space putchar(' ')
#define enter putchar('\n')
#define MAXN 100005
#define eps 1e-10
//#define ivorysi
using namespace std;
typedef long long int64;
typedef unsigned int u32;
typedef double db;
template<class T>
void read(T &res) {
res = 0;T f = 1;char c = getchar();
while(c < '0' || c > '9') {
if(c == '-') f = -1;
c = getchar();
}
while(c >= '0' && c <= '9') {
res = res * 10 + c - '0';
c = getchar();
}
res *= f;
}
template<class T>
void out(T x) {
if(x < 0) {x = -x;putchar('-');}
if(x >= 10) {
out(x / 10);
}
putchar('0' + x % 10);
}
int N,Q;
int64 A[MAXN],sum[MAXN],b[MAXN];
pii Calc(int64 l,int64 r) {
int a = lower_bound(A + 1,A + N + 1,l) - A;
int b = upper_bound(A + 1,A + N + 1,r) - A - 1;
return mp(a,b);
}
int64 Process(int64 x) {
if(x >= A[N]) return sum[N];
int64 L = 0,R = A[N];
int p = lower_bound(A + 1,A + N + 1,x) - A;
while(L < R) {
int64 mid = (L + R + 1) >> 1;
pii t = Calc(x - mid,x + mid);
int rem = N - p + 1 - (t.se - p + 1);
if(rem >= t.se - t.fi + 1) L = mid;
else R = mid - 1;
}
pii t = Calc(x - L,x + L);
int len = t.se - t.fi + 1;
int64 res = b[N] - b[N - len];
int q = N - len,h0 = t.fi - 1,h1 = t.se + 1;
while(q >= h1) {
res += A[q];--q;
if(h1 > q && h0 < 1) break;
int now;
if(h1 > q) now = h0;
else if(h0 < 1) now = h1;
else {
if(x - A[h0] <= A[h1] - x) now = h0;
else now = h1;
}
if(now == h1) ++h1;
if(now == h0) --h0;
}
res += sum[h0];
return res;
}
void Solve() {
read(N);read(Q);
for(int i = 1 ; i <= N ; ++i) read(A[i]);
for(int i = 1 ; i <= N ; ++i) {
sum[i] = A[i];
if(i >= 2) sum[i] += sum[i - 2];
b[i] = A[i] + b[i - 1];
}
int64 x;
for(int i = 1 ; i <= Q ; ++i) {
read(x);
out(Process(x));enter;
}
}
int main() {
#ifdef ivorysi
freopen("f1.in","r",stdin);
#endif
Solve();
}
|
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
#define int ll
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector< vi > vvi;
typedef vector< vvi > vvvi;
typedef vector<short> vs;
typedef vector<vs> vvs;
typedef vector<vvs> vvvs;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<ld> vld;
typedef vector<vld> vvld;
typedef vector<vvld> vvvld;
typedef vector<string> vst;
typedef vector<vst> vvst;
typedef pair<ld, ld> pld;
typedef complex<double> base;
typedef complex<int> point;
#define inmin(a, b) a = min(a, (b))
#define inmax(a, b) a = max(a, (b))
#define ALL(a) a.begin(),a.end()
#define RALL(a) a.rbegin(),a.rend()
#define sqr(x) ((x) * (x))
#define fori(i, n) for(int i = 0; i < int(n); ++i)
#define SZ(a) ((int)((a).size()))
#define triple(T) tuple<T, T, T>
#define quad(T) tuple<T, T, T, T>
#ifdef MAX_HOME
#define cerr cout
#else
#define cerr if (false) cerr
#endif
#define watch(x) cerr << (#x) << " = " << (x) << endl
const double PI = 2 * acos(0.0);
const string DIGITS = "0123456789";
const string ALPH = "abcdefghijklmnopqrstuvwxyz";
template <class T0, class T1>
inline ostream & operator << (ostream &out, pair<T0, T1> &a) {
return out << "{" << a.first << ", " << a.second << "}";
}
template <class T0, class T1, class T2>
inline ostream & operator << (ostream &out, tuple<T0, T1, T2> &a) {
return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << "}";
}
template <class T0, class T1, class T2, class T3>
inline ostream & operator << (ostream &out, tuple<T0, T1, T2, T3> &a) {
return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << ", " << get<3>(a) << "}";
}
template<class T>
inline ostream & operator << (ostream &out, vector<T> &a) {
out << "[";
fori (i, a.size())
out << a[i] << vector<string>{", ", "] "}[i + 1 == a.size()];
return out;
}
void smain();
signed main() {
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
#ifdef MAX_HOME
freopen("input.txt", "r", stdin);
clock_t start = clock();
#endif
cout << setprecision(12) << fixed;
smain();
#ifdef MAX_HOME
cout << "\n\n\n\nTOTAL EXECUTION TIME: " << float( clock () - start ) / CLOCKS_PER_SEC << endl;
#endif
}
const int N = 1e5 + 9;
int n, q;
ll a[N];
ll pref[N], pref2[N];
ll get_pref(int l, int r) {
if (!l--) return pref[r];
return pref[r] - pref[l];
}
bool check(int bound, ll x, int pos) {
int cnt = n - bound;
int cnt2 = bound - pos;
int cnt3 = cnt - cnt2;
if (cnt3 < 0) return false;
int lf = pos - cnt3 - 1;
int rf = bound - 1;
if (min(lf, rf) < 0) return true;
return x - a[lf] > a[rf] - x;
}
void smain() {
cin >> n >> q;
fori (i, n) cin >> a[i];
pref[0] = a[0];
for (int i = 1; i < n; ++i) pref[i] = pref[i - 1] + a[i];
pref2[0] = a[0];
pref2[1] = a[1];
for (int i = 2; i < n; ++i) pref2[i] = pref2[i - 2] + a[i];
fori (iter, q) {
ll x;
cin >> x;
int pos = lower_bound(a, a + n, x) - a;
if (pos == n) {
cout << pref2[n - 1] << '\n';
continue;
}
#ifdef MAX_HOME
check(5, x, pos);
#endif
int l = pos, r = n;
while (r > l + 1) {
int mid = r + l >> 1;
(check(mid, x, pos) ? l : r) = mid;
}
ll ans = get_pref(l, n - 1);
int cnt = n - l;
if (l - cnt - 1 >= 0) ans += pref2[l - cnt - 1];
cout << ans << '\n';
}
} |
p03158 | C++ | #include <iostream>
#include <cstdio>
#define N 100005
using namespace std;
typedef long long ll;
ll n, q, a[N], k[N], sa[N], sb[N];
int main() {
ll i, j, x, t;
scanf("%lld%lld", &n, &q);
for(i=1+n%2, j=0; j<n; i++, j++) scanf("%lld", &a[i]);
n += n%2;
for(i=1; i<=n/2; i++) k[i] = (a[i*2] + a[n/2+i])/2;
for(i=1; i<=n; i++) sa[i] = sa[i-1] + a[i];
for(i=1; i<=n; i++) sb[i] = sb[i-1] + (i%2 ? 0:a[i]);
while(q--) {
scanf("%lld", &x);
t = lower_bound(k, k+n/2, x) - k;
t = n/2 - t + 1;
printf("%lld\n", sa[n] - sa[n-t] + sb[n-t*2]);
}
return 0;
} |
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
long long sum[2][100005], a[100005], n, q;
pair <long long, int> qu[100005];
long long ans[100005];
int valid(int l, int r, long long x) {
if (l > r) return 1;
if (l - 1 >= 0 && abs(x - a[l - 1]) <= abs(x - a[r])) return 0;
if (r + 1 < n && abs(x - a[r + 1]) < abs(x - a[l])) return 2;
return 1;
}
int main() {
scanf("%d%d", &n, &q);
for (int i = 0; i < n; i++) {
scanf("%lld", &a[i]);
}
for (int i = 0; i < q; i++) {
scanf("%lld", &qu[i].first);
qu[i].second = i;
}
sort(qu, qu + q);
for (int i = 0; i < n; i++) {
sum[i & 1][i] = a[i];
if (i - 1 >= 0) {
sum[0][i] += sum[0][i - 1];
sum[1][i] += sum[1][i - 1];
}
}
int p = q - 1;
long long tot = 0;
for (int i = n - 1; i >= 0; i--) {
//A take last ith number
tot += a[i];
int l = 2 * i - n;
int r = i - 1;
if (l < -1) break;
while (p >= 0) {
long long x = qu[p].first;
int id = qu[p].second;
if (l == -1) {
if (valid(l + 1, r, x) == 1) {
ans[id] = tot;
}
else break;
}
else {
if (valid(l, r, x) == 1) {
ans[id] = tot;
long long add = 0;
if (l - 1 >= 0) add = sum[(l - 1) & 1][l - 1];
ans[id] += add;
}
else if (valid(l, r, x) == 2 && valid(l + 1, r, x) == 1) {
ans[id] = tot;
long long add = 0;
if (l - 1 >= 0) add = sum[(l - 1) & 1][l - 1];
ans[id] += add;
}
else break;
}
p--;
}
}
for (int i = 0; i < q; i++) printf("%lld\n", ans[i]);
}
|
p03158 | C++ | #include <algorithm>
#include <bitset>
#include <cctype>
#include <chrono>
#include <cmath>
#include <cstdio>
#include <ctime>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3fLL;
/*----------------------------------------*/
// https://betrue12.hateblo.jp/entry/2019/01/13/030527
int main() {
cin.tie(0); ios::sync_with_stdio(false);
// freopen("input.txt", "r", stdin);
int n, q; cin >> n >> q;
vector<int> a(n); REP(i, n) cin >> a[i];
vector<long long> accum(n+1, 0), even_odd(n, 0);
REP(i, n) accum[i+1] = accum[i] + a[i];
even_odd[0] = a[0];
even_odd[1] = a[1];
FOR(i, 2, n) even_odd[i] = even_odd[i-2] + a[i];
REP(repeat, q) {
int x; cin >> x;
int left = -1, right = n-1; // (left, right]
while (right - left > 1) {
// a[mid] と書かれたカードをそれぞれ何枚目に取るか?
// tmp = 青木くんが連続して取るカードにおける最も左の index
int mid = (left + right) / 2, tmp = distance(a.begin(), lower_bound(ALL(a), x-(a[mid]-x)));
// lhs = a[mid] と書かれたカードを取るまでに (それ自身を含む)
// 青木くんが連続して取るカードの枚数
// rhs = 高橋
(mid-tmp+1 < n-mid? left : right) = mid;
}
long long ans = accum[n] - accum[right];
// tmp = 2人の取るカードが数の大きいものから交互になるときの始点
int tmp = n - 1 - (n - right) * 2;
if (tmp >= 0) ans += even_odd[tmp];
cout << ans << '\n';
}
return 0;
}
|
p03158 | C++ | #include "bits/stdc++.h"
using namespace std;
#ifdef _DEBUG
#define _GLIBCXX_DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif
#define int long long
#define ll long long
#define ll1 1ll
#define ONE 1ll
#define DBG 1
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define loop(n) rep(loop, (0), (n))
#define all(c) begin(c), (c)
const int INF =
sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;
const int MOD = (int)(1e9) + 7;
const double PI = acos(-1);
const double EPS = 1e-9;
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
using pii = pair<int, int>;
// template<class T> ostream &operator<<(ostream &os,T &t){dump(t);return os;}
template <typename T, typename S>
istream &operator>>(istream &is, pair<T, S> &p) {
is >> p.first >> p.second;
return is;
}
template <typename T, typename S>
ostream &operator<<(ostream &os, pair<T, S> &p) {
os << p.first << " " << p.second;
return os;
}
template <typename T> void printvv(const vector<vector<T>> &v) {
cerr << endl;
rep(i, 0, v.size()) rep(j, 0, v[i].size()) {
if (typeid(v[i][j]).name() == typeid(INF).name() and v[i][j] == INF) {
cerr << "INF";
}
else
cerr << v[i][j];
cerr << (j == v[i].size() - 1 ? '\n' : ' ');
}
cerr << endl;
}
/*
typedef __int128_t Int;
std::ostream &operator<<(std::ostream &dest, __int128_t value) {
std::ostream::sentry s(dest);
if (s) {
__uint128_t tmp = value < 0 ? -value : value;
char buffer[128];
char *d = std::(buffer);
do {
--d;
*d = "0123456789"[tmp % 10];
tmp /= 10;
} while (tmp != 0);
if (value < 0) {
--d;
*d = '-';
}
int len = std::(buffer) - d;
if (dest.rdbuf()->sputn(d, len) != len) {
dest.setstate(std::ios_base::badbit);
}
}
return dest;
}
__int128 parse(string &s) {
__int128 ret = 0;
for (int i = 0; i < s.length(); i++)
if ('0' <= s[i] && s[i] <= '9')
ret = 10 * ret + s[i] - '0';
return ret;
}
*/
#ifndef _DEBUG
#define printvv(...)
#endif
void YES(bool f) { cout << (f ? "YES" : "NO") << endl; }
void Yes(bool f) { cout << (f ? "Yes" : "No") << endl; }
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 (a > b) {
a = b;
return true;
}
return false;
}
signed main(signed argc, char *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(12);
int N, Q; cin >> N >> Q;
vector<int>A(N + 1); rep(i, 1, N + 1) { cin >> A[i]; }
vector<int>X(Q); rep(i, 0, Q) { cin >> X[i]; }
vector<int>sum(N + 1); rep(i, 1, N + 1)sum[i] = sum[i - 1] + A[i];
vector<int>oddsum(N + 1);
rep(i, 1, N + 1) {
if (i & 1)oddsum[i] = oddsum[i - 1];
else oddsum[i] = oddsum[i - 2] + A[i];
}
dump(sum);
dump(oddsum);
rep(i, 0, Q) {
int x = X[i];
auto f = [&](int m) {return abs(x - A[N - m]) <= abs(x - A[N - m / 2]); };
int l = 0, r = N;
while (r - l > 1) {
int m = (l + r) / 2;
if (f(m)) {
l = m;
}
else {
r = m;
}
}
dump(l, r);
int y = 0;
if (l % 2 == 1) {
if (N % 2 == 0)y = oddsum[N - l - 1];
else y = sum[N - l - 1] - oddsum[N - l - 1];
}
else {
if (N % 2 == 1)y = sum[N - l - 1] - oddsum[N - l - 1];
else y = oddsum[N - l - 1];
}
dump(y);
cout << sum[N] - sum[N - l / 2 - 1] +y << endl;
}
return 0;
}
|
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define X first
#define Y second
#define ws asdnasdkns
#define LL long long
#define PI acos(-1.0)
const LL mod = 1000 * 1000 * 1000 + 7;
const LL MAX = 200005;
int a[100005];
int b[100005];
int N , Q;
LL pref[100005];
LL pref2[100005];
LL sum(int l , int r)
{
return pref2[r] - (l ? pref2[l - 1] : 0);
}
int f(int l , int r)
{
if(l > r)
return 0;
return upper_bound(a , a + N , r) - lower_bound(a , a + N , l);
}
bool good(int l , int r)
{
int suma = f(l , r);
int de = upper_bound(a , a + N , r) - a;
int cnt = N - de;
return suma <= cnt;
}
int main()
{
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
// freopen("In.txt" , "r" , stdin);
srand(time(NULL));
cin >> N >> Q;
for(int i = 0; i < N; i++)
{
cin >> a[i];
pref[i] = a[i] + ((i > 1) ? pref[i - 2] : 0);
pref2[i] = a[i] + (i ? pref2[i - 1] : 0);
}
//reverse(b , b + N);
while(Q--)
{
int x;
cin >> x;
int suma = -1;
for(int j = 29; j >= 0; j--)
{
if(good(x - suma - (1 << j) , x + suma + (1 << j)))
suma += 1 << j;
}
int cnt = f(x - suma , x + suma);
int posR = upper_bound(a , a + N , x + suma) - a - 1;
int posL = lower_bound(a , a + N , x - suma) - a;
int cntZliva = (posR - posL + 1);
int cntSprava = N - (posR + 1);
assert(cntSprava - cntZliva >= 0 && cntSprava - cntZliva <= 2);
if(cntSprava - cntZliva == 2)
{
LL ans = sum(N - cntSprava , N - 1);
if(posL - 3 >= 0)
ans += pref[posL - 3];
cout << ans << endl;
}
else if(cntSprava - cntZliva == 1)
{
LL ans = sum(N - cntSprava , N - 1);
if(posL - 2 >= 0)
ans += pref[posL - 2];
cout << ans << endl;
}
else
{
LL ans = sum(N - cntSprava , N - 1);
if(posL - 1 >= 0)
ans += pref[posL - 1];
cout << ans << endl;
}
}
} |
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int n;
ll a[100001];
ll s[100001],s1[100001];
int f1(ll x, int st, int end){
if(st > end) return -1;
int mid=(st+end)/2;
if(a[mid] >= x){
int lans=f1(x,st,mid-1);
if(lans==-1) return mid;
return lans;
}
return f1(x,mid+1,end);
}
int f2(ll x, int st, int end){
if(st > end) return -1;
int mid=(st+end)/2;
if(a[mid] <= x){
int rans=f2(x,mid+1,end);
if(rans==-1) return mid;
return rans;
}
return f2(x,st,mid-1);
}
int f3(ll x, ll diff, int st, int end){
if(st > end) return -1;
int mid=(st+end)/2;
ll d=x-a[mid];
if( d <= diff){
int lans=f3(x,diff,st, mid-1);
if(lans==-1) return mid;
return lans;
}
return f3(x,diff,mid+1,end);
}
int f(ll x, int st, int end, int in2, int in1){
// cout<<st<<" "<<end<<"\n";
if(st > end) return -1;
int mid=(st+end)/2;
ll d1=a[mid]-x;
ll d2=1e14;
if(mid < n-1) d2=a[mid+1]-x;
int in31=f3(x,d1,0,in2);
int in32=f3(x,d2,0,in2);
int c1=n-1-mid;
int a1=mid-in1+1;
if(in31!=-1){
a1+=in2-in31+1;
}
int a2=mid-in1+1;
if(in32!=-1){
a2+=in2-in32+1;
}
// cout<<a1<<" "<<a2<<"\n";
if( (c1>=a1 && c1<=a2) || (c1-1>=a1 && c1-1<=a2) ) return mid;
if(a2 < c1) return f(x,mid+1,end,in2,in1);
else return f(x,st,mid-1,in2,in1);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
int q;
cin>>n>>q;
for(int i=0;i<n;i++) cin>>a[i];
for(int i=0;i<n;i++){
s[i]=a[i];
if(i!=0) s[i]+=s[i-1];
}
for(int i=0;i<n;i++){
if(i%2==0) s1[i]=a[i];
if(i>0) s1[i]+=s1[i-1];
}
while(q--){
ll x;
cin>>x;
int in1=f1(x,0,n-1);
if(in1==-1){
if(n%2==0) cout<<s[n-1]-s1[n-1]<<"\n";
else cout<<s1[n-1]<<"\n";
continue;
}
//cout<<in1<<"\n";
int in2=f2(x,0,n-1);
// cout<<in2<<"\n";
if(in1==in2) in2--;
int in3=f(x,in1,n-1,in2,in1);
//cout<<in3<<"\n";
if(in3==-1){
int c1=n-in1;
int r=in2+1-c1;
ll g=s[n-1];
ll h=0;
if(in1>=1) h=s[in1-1];
if(r<=0){
// cout<<"oewiehfwef";
cout<<g-h<<"\n";
}
else{
int num=n-2*c1;
if(num%2==0) cout<<s[num-1]-s1[num-1]+g-h<<"\n";
else cout<<s1[num-1]+g-h<<"\n";
}
continue;
}
else{
ll g=s[n-1];
ll h=0;
if(in3+1>=1) h=s[in3+1-1];
ll c1=n-in3-1;
ll r=in3-c1+1;
if(r<=0){
// cout<<"ewehf";
cout<<g-h<<"\n";
}
else{
int num=n-2*c1;
if(num%2==0) cout<<s[num-1]-s1[num-1]+g-h<<"\n";
else cout<<s1[num-1]+g-h<<"\n";
}
continue;
}
}
}
|
p03158 | C++ |
#include <limits.h>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define int long long
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPS(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define FOR(i, a, b) for (int i = (a), i##_len = (b); i <= i##_len; ++i)
#define REV(i, a, b) for (int i = (a); i >= (b); --i)
#define CLR(a, b) memset((a), (b), sizeof(a))
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define INF 1001001001001001001ll
#define fcout cout << fixed << setprecision(10)
using namespace std;
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int N, Q;
cin >> N >> Q;
vector<int> A(N), X(Q), sum(N + 1), sum2(N + 1);
REP(i, N) cin >> A[i];
REP(i, Q) cin >> X[i];
sum2[0] = A[0];
sum2[1] = A[1];
REP(i, N) {
sum[i + 1] = sum[i] + A[i];
if (i - 2 >= 0) {
sum2[i] = sum2[i - 2] + A[i];
}
}
REP(q, Q) {
int x = X[q];
int ok = N - 1;
int ng = 0;
while (ok - ng > 1) {
int mid = (ok + ng) / 2;
int upper = N - 1 - mid + 1;
int lower = mid - static_cast<int>(lower_bound(A.begin(), A.end(), x - (A[mid] - x)) - A.begin()) + 1;
if (upper <= lower) {
ok = mid;
} else {
ng = mid;
}
}
int res = sum[N] - sum[ok];
int next = N - 1 - (N - ok) * 2;
if (next >= 0) res += sum2[next];
cout << res << endl;
}
return 0;
}
|
p03158 | C++ | #include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <limits.h>
#include <queue>
#include <cmath>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for(int i=0; i<n; i++)
ll A[100100];
ll X[100100];
int main(){
int N, Q;
cin >> N >> Q;
vector<ll> sum(N);
bool even = (N%2 == 0);
vector<ll> skip(N);
REP(i,N){
ll a;
cin >> a;
A[i] = a;
if(i == 0) sum[i] = a;
else sum[i] = a + sum[i-1];
}
REP(i,Q){
ll x;
cin >> x;
X[i] = x;
}
int start = even;
int k;
for(int i = start, k = 0; i < N; i+=2, k++){
if(k == 0) skip[k] = A[i];
else skip[k] = A[i] + skip[k-1];
}
//sort(X, X+Q);
for(int i = 0; i < Q; i++){
ll x = X[i];
int left = 0;
int right = N;
//while(right - left > 0){
while(right - left > 1){
int mid = (left + right)/2;
ll m = A[mid];
if(m < x){
left = mid;
continue;
}
ll diff = abs(x - m);
int t = N - mid;
int a;
a = lower_bound(A, A+N, x+diff) - lower_bound(A, A+N, x-diff) + 1;
if(t > a){
left = mid;
}
else if(t <= a){
right = mid;
}
}
//printf("right:%d\n", right);
ll ans = 0;
ans += sum[N-1] - sum[right-1];
int num = N - right;
int rem = N - 2*num;
if(rem > 0){
ans += skip[(rem-1)/2];
}
cout << ans << endl;
}
return 0;
}
|
p03158 | C++ | #include<iostream>
#include<string>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<algorithm>
#include<functional>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cassert>
#include<ctime>
using namespace std;
#define mind(a,b) (a>b?b:a)
#define maxd(a,b) (a>b?a:b)
#define absd(x) (x<0?-(x):x)
#define pow2(x) ((x)*(x))
#define rep(i,n) for(int i=0; i<n; ++i)
#define repr(i,n) for(int i=n-1; i>=0; --i)
#define repl(i,s,n) for(int i=s; i<=n; ++i)
#define replr(i,s,n) for(int i=n; i>=s; --i)
#define repf(i,s,n,j) for(int i=s; i<=n; i+=j)
#define repe(e,obj) for(auto e : obj)
#define SP << " " <<
#define COL << " : " <<
#define COM << ", " <<
#define ARR << " -> " <<
#define PNT(STR) cout << STR << endl
#define POS(X,Y) "(" << X << ", " << Y << ")"
#define DEB(A) " (" << #A << ") " << A
#define DEBREP(i,n,val) for(int i=0; i<n; ++i) cout << val << " "; cout << endl
#define ALL(V) (V).begin(), (V).end()
#define INF 1000000007
#define INFLL 1000000000000000007LL
#define EPS 1e-9
typedef unsigned int uint;
typedef unsigned long ulong;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
#define P_TYPE int
typedef pair<P_TYPE, P_TYPE> P;
typedef pair<P, P_TYPE> PI;
typedef pair<P_TYPE, P> IP;
typedef pair<P, P> PP;
typedef priority_queue<P, vector<P>, greater<P> > pvqueue;
#define N 100007
int n, q;
ll a[N], s[N], t[N];
ll solve(ll x) {
ll le = 0, ri = 2000000007LL;
while(le + 1 < ri) {
ll mid = (le + ri) >> 1;
int p = x-mid > 0 ? lower_bound(a, a+n, x-mid) - a : 0;
int q = x+mid <= a[n-1] ? lower_bound(a, a+n, x+mid) - a : n;
if(q-p <= n-q) {
le = mid;
} else {
ri = mid;
}
}
int p = x-le > a[0] ? lower_bound(a, a+n, x-le) - a : 0;
int q = x+le <= a[n-1] ? lower_bound(a, a+n, x+le) - a : n;
int c1 = q-p, c2 = n-q;
ll res = t[n] - t[q];
if(c1 == c2) {
res += s[p];
} else if(c1+1 == c2) {
if(p >= 1) {
res += s[p-1];
}
}
return res;
}
int main() {
cin >> n >> q;
rep(i, n) {
cin >> a[i];
a[i] <<= 1;
//cout << i SP a[i] << endl;
t[i+1] = t[i] + a[i];
}
rep(i, n) {
s[i+1] = i >= 1 ? s[i-1] + a[i] : a[i];
}
rep(i, q) {
ll x; cin >> x;
cout << (solve(x << 1)>>1) << endl;
}
return 0;
} |
p03158 | C++ | #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#define MOD 1000000007
typedef long long ll;
using namespace std;
int main(){
int N,Q;
cin>>N>>Q;
ll A[N+1]={},sum[N+1]={},evenSum[N+1]={};
for(int i=1;i<=N;i++){
cin>>A[i];
sum[i]=sum[i-1]+A[i];
evenSum[i]=evenSum[i-1];
if(i%2==N%2) evenSum[i]+=A[i];
}
ll X[Q+1]={};
for(int i=0;i<Q;i++) cin>>X[i];
ll ans[Q+1]={};
for(int k=0;k<Q;k++){
int ng=0,ok=N;
while(ok-ng>1){
int mid=(ng+ok)/2;
if(A[mid]<X[k]) ng=mid;
else{
int taka=N-mid+1;
int z=lower_bound(A,A+N+1,max(1ll,X[k]-(A[mid]-X[k])))-A;
int ao=mid-z+1;
if(taka>ao) ng=mid;
else ok=mid;
}
}
ll res=sum[N]-sum[ok-1];
int front=N-(N-ok+1)*2;
if(front>0) res+=evenSum[front];
ans[k]=res;
}
for(int i=0;i<Q;i++) cout<<ans[i]<<endl;
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--;)
#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
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>istream&operator>>(istream&s,pair<T,U>&p){return s>>p.first>>p.second;}
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<<endl;}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,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};}
void print(void){cout<<endl;}
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)...);}
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 MD=1e9+7;
template<typename T>str to_string(const T&n){ostringstream s;s<<n;return s.str();}
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;}
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){T m=a[0];for(T e:a){m=max(m,e);}return m;}
template<typename T>T min(const vector<T>a){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>LIS(const vector<T>A){vector<T>B;for(T a:A){auto it=lower_bound(all(B),a);if(it==B.end()){B<<a;}else{*it=a;}}return B;}
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,r,s;public:UnionFind(int N){p=r=vi(N);s=vi(N,1);fr(i,N){p[i]=i;}}int find(int i){return p[i]=p[i]==i?i:find(p[i]);}void unite(int a,int b){if(r[a=find(a)]>r[b=find(b)]){swap(a,b);}s[b]+=s[a];r[p[a]=b]+=r[a]==r[b];}bool same(int a,int b){return find(a)==find(b);}int size(int x){return s[find(x)];}};
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){return pow(x,p-2,p);}
ll inv(const ll x){return inv(x,MD);}
vpll fact(const int n,const int 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 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 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){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];}};
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;}
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),SS(N+1);
fr(i,N){
S[i+1]=S[i]+A[i];
SS[i+1]=SS[max(0,i-1)]+A[i];
}
fr(i,Q){
int X;cin>>X;
auto f=[&](int i){return i<0?int(2e9):abs(A[i]-X);};
int j=lower_bound(all(A)-1,X)-A.begin();
if(j==N-1){
print(SS[N]);
}else{
if(j>0&&f(j-1)<=f(j)){
--j;
}
int ok=0,ng=(N-j+1)/2;
while(ng-ok>1){
int k=ok+ng>>1;
if(f(N-(N-(j+k)-1)*2-1)>f(j+k)){
ok=k;
}else{
ng=k;
}
}
print(S[N]-S[j+ok+1]+SS[max(0,N-2*(N-(j+ok)-1))]);
}
}
return 0;
}
|
p03158 | C++ | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <cstring>
#include <vector>
#include <iostream>
#include <queue>
#include <unordered_map>
#include <cmath>
#include <queue>
#include <string>
#include <random>
using namespace std;
typedef long long ll;
const int maxn = 100005;
int n, m, a[maxn];
ll f[3][maxn];
int l1, r1;
void bs2(int x, int xpos, int limit) {
l1 = r1 = -1;
int l = 0, r = xpos;
while (l <= r) {
int m = (l + r) >> 1;
if (x - a[m] <= limit) {
l1 = m;
r = m - 1;
} else l = m + 1;
}
l = xpos + 1, r = n - 1;
while (l <= r) {
int m = (l + r) >> 1;
if (a[m] - x <= limit) {
r1 = m;
l = m + 1;
} else r = m - 1;
}
if (l1 == -1) {
if (r1 != -1)l1 = xpos + 1;
} else {
if (r1 == -1)r1 = xpos;
}
if(l1==-1)l1=r1=xpos;
}
void bs(int x) {
int l = 0, r = n - 1, xpos = 0;
while (l <= r) {
int m = (l + r) >> 1;
if (a[m] <= x) {
xpos = m;
l = m + 1;
} else {
r = m - 1;
}
}
int limit = -1;
l = 0, r = max(x - a[0], a[n - 1] - x);
while (l <= r) {
int m = (l + r) >> 1;
bs2(x, xpos, m);
//cout<<"find lr:"<<m<<","<<l1<<","<<r1<<endl;
if (l1 == -1 || (r1 - l1 + 1 > n - 1 - r1)) {
r = m - 1;
} else {
limit = m;
l = m + 1;
}
}
if (limit != -1)
bs2(x, xpos, limit);
else l1 = r1 = xpos;
}
bool g[maxn];
ll bf(int x) {
memset(g, 0, sizeof(g));
ll ret = 0;
while (1) {
int tmp = -1;
for (int i = n - 1; i >= 0; i--) {
if (!g[i]) {
tmp = a[i];
g[i] = 1;
// cout<<"debug: "<<a[i]<<endl;
break;
}
}
if (tmp == -1)break;
ret += tmp;
int mi = -1, idx;
for (int i = 0; i < n; i++) {
if (g[i])continue;
if (mi == -1 || abs(x - a[i]) < mi) {
mi = abs(x - a[i]);
idx = i;
}
}
if (idx != -1) {
g[idx] = 1;
}
}
return ret;
}
void gen(){
std::random_device rd; //Will be used to obtain a seed for the random number engine
std::mt19937 gen(rd()); //Standard mersenne_twister_engine seeded with rd()
std::uniform_int_distribution<> dis(1, 100000);
int n = 1000, m = 1000;
cout<<n<<" "<<m<<endl;
for(int i=0;i<n;i++){
while(1) {
a[i] = dis(gen);
bool flag = 0;
for(int j=0;j<i;j++)
if(a[j]==a[i]){
flag=1;
break;
}
if(!flag)break;
}
}
sort(a, a + n);
for(int i=0;i<n;i++)
cout<<a[i]<<endl;
for(int i=0;i<m;i++){
int x=dis(gen);
cout<<x<<endl;
}
}
int main() {
#ifdef suiyuan2009
freopen("/Users/suiyuan2009/CLionProjects/icpc/input.txt", "r", stdin);
/*freopen("/Users/suiyuan2009/CLionProjects/icpc/input.txt", "w", stdout);
gen();
return 0;*/
#endif
cin >> n >> m;
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
f[2][i] = a[i] + (i - 1 < 0 ? 0 : f[2][i - 1]);
if (i & 1) {
f[1][i] = a[i] + (i - 2 < 0 ? 0 : f[1][i - 2]);
if (i)f[0][i] = f[0][i - 1];
} else {
f[0][i] = a[i] + (i - 2 < 0 ? 0 : f[0][i - 2]);
if (i)f[1][i] = f[1][i - 1];
}
}
while (m--) {
int x;
ll ret;
scanf("%d", &x);
if (x <= a[0]) {
ret = f[2][n - 1] - f[2][(n >> 1) - 1];
} else if (x >= a[n - 1]) {
if ((n - 1) & 1)ret = f[1][n - 1];
else ret = f[0][n - 1];
} else {
bs(x);
//cout<<"range:"<<l1<<" "<<r1<<endl;
int rightcount = n - 1 - r1;
int count = r1 - l1 + 1;
if (rightcount > count) {
l1 = max(0, l1 - (rightcount - count));
count = r1 - l1 + 1;
}
if (n - count == r1 + 1) {
ret = f[2][n - 1] - f[2][r1];
if (l1 > 0) {
if ((l1 - 1) & 1)ret += f[1][l1 - 1];
else ret += f[0][l1 - 1];
}
} else {
ret = f[2][n - 1] - f[2][r1];
if (l1 - 1 > 0) {
if ((l1 - 2) & 1)ret += f[1][l1 - 2];
else ret += f[0][l1 - 2];
}
}
}
//printf("%lld %d ",bf(x) - ret, x);
printf("%lld\n", ret);
}
return 0;
} |
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll v[100100],rs[100100],alt[100100];
int n,q;
inline ll sm(int a, int b) {
return rs[b+1]-rs[a];
}
inline ll gid(int val, int id) {
return id-(lower_bound(v,v+n,val-abs(val-v[id]))-v);
}
ll pr(int val) {
int id = lower_bound(v,v+n,val)-v;
if(id > 0 && abs(v[id-1]-val) <= abs(v[id]-val)) {id--;}
int vl = upper_bound(v,v+n,2*val-v[0])-v-1;
int il = gid(val,n/2);
if(il == n/2) {return sm(n/2,n-1);}
int s = id,e = n-1;
int ls=e;
while(s <= e) {
//printf("se %d %d\n",s,e);
int md = (s+e)/2;
int g = gid(val,md);
//printf("g %d %d %d\n",val,md,g);
if(g >= n-md-1) {e = md-1;ls = min(ls,md);} else {
s = md+1;
}
}
int ns = ls-(n-ls)-1;
//printf("li %d %d\n",ls,ns);
return sm(ls,n-1) + alt[ns+2];
}
int main() {
scanf("%d %d ",&n,&q);
rs[0] = alt[0] = 0;
alt[1] = 0;
for(int i=0;i<n;i++) {
ll t;
scanf("%lld ",&t);
v[i] = t;
rs[i+1] = rs[i]+t;
alt[i+2] = alt[i]+t;
}
while(q--) {
int t;
scanf("%d ",&t);
printf("%lld\n",pr(t));
}
}
|
p03158 | C++ | #include <cmath>
#include <iostream>
#include <vector>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <bitset>
#include <algorithm>
#include <functional>
#include <utility>
#include <iomanip>
#define int long long int
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() )
using namespace std;
typedef pair<int, int> P;
const int INF = 1e15;
const int MOD = 1e9+7;
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
int n, q;
cin >> n >> q;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> s(n + 1);
rep(i, n) s[i+1] = s[i] + a[i];
vector<int> ss((n + 1) / 2 + 1);
int x = (n + 1) % 2;
rep(i, (n + 1) / 2){
ss[i+1] = ss[i] + a[x+2*i];
}
vector<P> query(q);
rep(i, q){
int x;
cin >> x;
query[i] = {x, i};
}
sort(ALL(query));
vector<int> ans(q);
int y = 1;
rep(i, q){
int x = query[i].first;
while(y < n && a[y-1] < x){
y++;
}
while(y < n){
int limit = max(1LL, 2 * x - a[y-1]);
int lo = -1;
int hi = n - 1;
while(hi - lo > 1){
int mid = (lo + hi) / 2;
if(a[mid] >= limit){
hi = mid;
}else{
lo = mid;
}
}
int upper = n - y + 1;
int lower = y - hi;
if(upper > lower){
y++;
}else{
break;
}
}
int result = s[n] - s[y-1];
int remain = n - (n - y + 1) * 2;
if(remain > 0){
result += ss[(remain+1)/2];
}
ans[query[i].second] = result;
}
rep(i, q){
cout << ans[i] << endl;
}
return 0;
} |
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
using i64=int64_t;
#define rep(i,x,y) for(i64 i=i64(x),i##_max_for_repmacro=i64(y); i<i##_max_for_repmacro; ++i)
#define debug(x) #x << "=" << (x)
#ifdef DEBUG
#define _GLIBCXX_DEBUG
#define print(x) std::cerr << debug(x) << " (L:" << __LINE__ << ")" << std::endl
#else
#define print(x)
#endif
const int inf=1.01e9;
const i64 inf64=4.01e18;
const double eps=1e-9;
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec){
os << "[";
for (const auto &v : vec) {
os << v << ",";
}
os << "]";
return os;
}
void solve(){
i64 N,Q;
cin >> N >> Q;
vector<i64> A(N);
rep(i,0,N) cin >> A[i];
vector<i64> s(N),t(N);
s[0]=A[0];
t[0]=A[0];
rep(i,1,N){
s[i]=s[i-1]+A[i];
if(i%2==0) t[i]=t[i-1]+A[i];
else t[i]=t[i-1];
}
rep(i,0,N) A[i]*=4;
function<i64(i64,i64)> f=[&](i64 n, i64 turn){
if(n<0) return i64(0);
if(turn==1) return f(n-1,(turn+1)%2);
return n%2==0?t[n]:s[n]-t[n];
};
auto bsearch=[&](i64 r){
return lower_bound(begin(A),end(A),r)-begin(A);
};
rep(_,0,Q) {
i64 X;
cin >> X;
X=4*X-1;
i64 lb=0,ub=inf64;
while(ub-lb>1){
auto mid=(lb+ub)/2;
i64 l=bsearch(X-mid);
i64 r=bsearch(X+mid+1);
if(r-l>(N-1)-r+1) ub=mid;
else lb=mid;
}
i64 l=bsearch(X-lb);
i64 r=bsearch(X+lb+1);
cout << s[N-1]-s[r-1]+((N-l)%2==1?f(l-1,1):f(l-1,0)) << endl;
}
}
int main(){
//std::cin.tie(0);
//std::ios::sync_with_stdio(false);
cout.setf(ios::fixed);
cout.precision(16);
solve();
return 0;
}
|
p03158 | C++ | #include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string>
#include<string.h>
#include<math.h>
#include<stdlib.h>
#include<vector>
#include<queue>
#include<map>
#include<iomanip>
#define rep(index,num) for(int index=0;index<num;index++)
#define rep1(index,num) for(int index=1;index<=num;index++)
#define scan(argument) cin>>argument
#define prin(argument) cout<<argument<<endl
#define kaigyo cout<<endl
#define eps 1e-7
#define mp(a1,a2) make_pair(a1,a2)
typedef long long ll;
using namespace std;
typedef pair<ll,ll> pll;
typedef pair<int,int> pint;
typedef vector<int> vint;
typedef vector<ll> vll;
typedef vector<pint> vpint;
typedef vector<pll> vpll;
ll INFl=1e+18+1;
int INF=1e+9+1;
int N,Q;
ll A[100001];
ll Asum[100001]={};
ll Aksum[100001]={},Agsum[100001]={};
ll Tbigans[100001]={};
int nibutan(int low,int up,int X){
int mid=(low+up)/2;
if(low+1==up){
return mid;
}
if(abs(A[N-mid]-X)>abs(A[N-(mid/2+mid%2)]-X)) return nibutan(low,mid,X);
else return nibutan(mid,up,X);
}
int main(){
scan(N);scan(Q);
rep(i,N){
scan(A[i]);
Asum[i+1]=Asum[i]+A[i];
Agsum[i+1]=Agsum[i];
Aksum[i+1]=Aksum[i];
if(i%2==0) Agsum[i+1]+=A[i];
else Aksum[i+1]+=A[i];
}
rep1(i,N/2+N%2){
Tbigans[i]=Asum[N]-Asum[N-i];
if(N%2){
Tbigans[i]+=Agsum[N-2*i];
}
else{
Tbigans[i]+=Aksum[N-2*i];
}
}
rep(q,Q){
int X;
scan(X);
int correcti;
if(N==2) prin(A[1]);
else{
correcti=(nibutan(1,N+1,X)+1)/2;
prin(Tbigans[correcti]);
}
}
return 0;
}
|
p03158 | C++ | #include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define all(c) (c).begin(),(c).end()
#define pb push_back
#define dbg(...) do{cerr<<__LINE__<<": ";dbgprint(#__VA_ARGS__, __VA_ARGS__);}while(0);
using namespace std;
namespace std{template<class S,class T>struct hash<pair<S,T>>{size_t operator()(const pair<S,T>&p)const{return ((size_t)1e9+7)*hash<S>()(p.first)+hash<T>()(p.second);}};template<class T>struct hash<vector<T>>{size_t operator()(const vector<T> &v)const{size_t h=0;for(auto i : v)h=h*((size_t)1e9+7)+hash<T>()(i)+1;return h;}};}
template<class T>ostream& operator<<(ostream &os, const vector<T> &v){os<<"[ ";rep(i,v.size())os<<v[i]<<(i==v.size()-1?" ]":", ");return os;}template<class T>ostream& operator<<(ostream &os,const set<T> &v){os<<"{ "; for(const auto &i:v)os<<i<<", ";return os<<"}";}
template<class T,class U>ostream& operator<<(ostream &os,const map<T,U> &v){os<<"{";for(const auto &i:v)os<<" "<<i.first<<": "<<i.second<<",";return os<<"}";}template<class T,class U>ostream& operator<<(ostream &os,const pair<T,U> &p){return os<<"("<<p.first<<", "<<p.second<<")";}
void dbgprint(const string &fmt){cerr<<endl;}template<class H,class... T>void dbgprint(const string &fmt,const H &h,const T&... r){cerr<<fmt.substr(0,fmt.find(","))<<"= "<<h<<" ";dbgprint(fmt.substr(fmt.find(",")+1),r...);}
typedef long long ll;typedef vector<int> vi;typedef pair<int,int> pi;const int inf = (int)1e9;const double INF = 1e12, EPS = 1e-9;
int n, q;
ll sum[100010], sum2[100010], a[100000];
int main(){
cin.tie(0); cin.sync_with_stdio(0);
cin >> n >> q;
rep(i, n){
cin >> a[i]; a[i] *= 2;
sum[i + 1] = sum[i] + a[i];
sum2[i + 1] = sum2[i] + (i % 2 ? 0 : a[i]);
}
while(q--){
ll x; cin >> x; x *= 2;
ll lo = 0, hi = 2e9, mid;
while(lo + 1 < hi){
mid = (lo + hi) / 2;
int l = lower_bound(a, a + n, x - mid) - a;
int r = lower_bound(a, a + n, x + mid) - a;
if(r - l > n - r) hi = mid;
else lo = mid;
}
int l = lower_bound(a, a + n, x - lo) - a;
int r = lower_bound(a, a + n, x + lo) - a;
ll ans = sum[n] - sum[r];
int res = l - (r - l != n - r);
if(res % 2) ans += sum2[res];
else ans += sum[res] - sum2[res];
cout << ans / 2 << endl;
}
return 0;
} |
p03158 | C++ | #include<iostream>
#include<cstdio>
#include<queue>
#include<cstring>
#include<cmath>
#include<stack>
#include<algorithm>
#define rg register
#define ll long long
#define LDB long double
#define ull unsigned long long
#define view(i,x) for(rg int i=hd[x];i!=-1;i=e[i].nt)
#define go(i,x,a) for(rg int i=a;i<x;i++)
#define inf 0x3f3f3f3f
#define INF 0x7fffffff
using namespace std;
const int maxn=1e5+5;
int n,m;
ll a[maxn],ans=0,p[maxn],ss=0;
ll pre[maxn];
inline int rd(){
int ret=0,af=1; char gc=getchar();
while(gc < '0' || gc > '9'){ if(gc=='-') af=-af; gc=getchar(); }
while(gc >= '0' && gc <= '9') ret=ret*10+gc-'0',gc=getchar();
return ret*af;
}
int main(){
//freopen("data.in","r",stdin);
//freopen("1.out","w",stdout);
n=rd(); m=rd();
go(i,n+1,1) a[i]=rd(),ss+=a[i];
sort(a+1,a+n+1);
go(i,n+1,1){
p[i]=p[i-1]+a[i];
pre[i]= i>=2?pre[i-2]+a[i]:a[i];
}
go(i,m+1,1){
ans=0;
ll x=rd(); int pos=lower_bound(a+1,a+n+1,x)-a-1;
if(x >= a[n]){
printf("%lld\n",pre[n]); continue;
}
int l=pos+1,r=n,p1,p2,mid=l,res=l;
while(l <= r){
mid=(l+r)/2;
p1=lower_bound(a+1,a+n+1,x-(a[mid]-x))-a;
p2=lower_bound(a+1,a+n+1,x-(a[mid-1]-x))-a;
if(mid-p2 <= n-mid+1 && n-mid+1 <= mid-p1){
res=mid; break;
}
if(mid-p2 > n-mid+1) r=mid-1;
else l=mid+1,res=mid;
}
while(n-res+1 > res-p2 && p2 > 1) p2--;
ans=p[n]-p[res-1]+pre[p2-1];
printf("%lld\n",ans);
}
return 0;
}//Faze
|
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
int main(){
int N, Q;
cin >> N >> Q;
long long int A[114514] = {};
long long int S[114514] = {}; //累積和
long long int E[114514] = {}; //偶数番目のみ
long long int O[114514] = {}; //奇数番目のみ
for(int i = 1; i <= N; i++){
cin >> A[i];
S[i] = S[i-1] + A[i];
if(i % 2 == 0){
E[i] = E[i-1] + A[i], O[i] = O[i-1];
}
if(i % 2 == 1){
E[i] = E[i-1], O[i] = O[i-1] + A[i];
}
}
int B[60000] = {};
for(int i = 0; i < (N+1)/2; i++){
B[i] = A[N - 2 * ((N-1)/2 -i)] + A[N - ((N-1)/2 -i)];
}
for(int q = 0; q < Q; q++){
long long int X;
cin >> X;
if(N % 2 == 1){
int m = lower_bound(B, B + (N+1)/2, X * 2) - B;
if(m == (N+1)/2){cout << O[N] << endl;}
else if(m == 0){cout << S[N] - S[N/2] << endl;}
else{cout << S[N] - S[N/2+m] + O[m*2-1] << endl;}
}
else if(N % 2 == 0){
int m = lower_bound(B, B + (N+1)/2, X * 2) - B;
if(m == N/2){cout << E[N] << endl;}
else{cout << S[N] - S[N/2+m] + E[m*2] << endl;}
}
}
} |
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0,_n=(int)(n);i<_n;++i)
#define ALL(v) (v).begin(),(v).end()
#define CLR(t,v) memset(t,(v),sizeof(t))
template<class T1,class T2>ostream& operator<<(ostream& os,const pair<T1,T2>&a){return os<<"("<<a.first<<","<<a.second<< ")";}
template<class T>void pv(T a,T b){for(T i=a;i!=b;++i)cout<<(*i)<<" ";cout<<endl;}
template<class T>void chmin(T&a,const T&b){if(a>b)a=b;}
template<class T>void chmax(T&a,const T&b){if(a<b)a=b;}
int nextInt() { int x; scanf("%d", &x); return x;}
const ll INF = 1LL << 61;
const int MAX_N = 112345;
ll a[MAX_N];
ll b[MAX_N];
ll odd[MAX_N];
int check(int N, ll X, int K) {
if (K*2 > N) return 0;
ll d = abs(X - a[N-K]);
int pos1 = distance(a, lower_bound(a, a+N, X-d));
int pos2 = N-K;
return pos2 - pos1 >= K-1;
}
ll query(int N, ll X) {
// for (int K = 1; K < N; K++) {
// cout << N << " " << X << " " << K << " -> " << check(N, X, K) << endl;
// }
int hi = N/2+1;
int lo = 1;
while ((hi - lo) > 1) {
int K = (hi + lo) / 2;
if (check(N, X, K) > 0) lo = K;
else hi = K;
}
int K = lo;
// cout << "X=" << X << " " << K << endl;
ll ans = b[N] - b[N-K];
ans += odd[N - 2*K];
return ans;
}
int main2() {
int N = nextInt();
int Q = nextInt();
// Nが奇数のときは -INF を先頭に追加し、常にNが偶数とする
if (N % 2 == 1) {
a[0] = -INF;
REP(i, N) a[i+1] = nextInt();
N++;
} else {
REP(i, N) a[i] = nextInt();
}
b[0] = 0;
REP(i, N) b[i+1] = b[i] + a[i];
odd[0] = 0;
REP(i, N) {
if (i % 2 == 1) odd[i+1] = odd[i] + a[i];
else odd[i+1] = odd[i] + 0;
}
// pv(a, a+N);
// pv(odd, odd + N);
// for (int X = 1; X <= a[N-1]; X++)
// query(N, X);
REP(qqq, Q) {
ll X = nextInt();
ll ans = query(N, X);
printf("%lld\n", ans);
}
return 0;
}
int main() {
for (;!cin.eof();cin>>ws)
main2();
return 0;
}
|
p03158 | C++ | #include <iostream>
#include <stdio.h>
#include <cstring>
#include <cstdio>
#include <math.h>
#include <algorithm>
#include <vector>
#include <string>
#include <stdlib.h>
#include <queue>
#include <stack>
#include <utility>
#include <fstream>
#include <random>
#include <map>
#include <unordered_map>
#include <cstdlib>
#include <functional>
#include <random>
#include <time.h>
#include <chrono>
#include <sstream>
#include <iomanip>
#define rep(i,n) for(int i=0;i<n;i++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define ll long long
#define INF 1000000001
#define mod 1000000007
#define sort(s) sort(s.begin(), s.end());
#define reverse(s) reverse(s.begin(), s.end());
int dx[4] = { 0,1,0,-1 };
int dy[4] = { 1,0,-1,0 };
using namespace std;
int POW(int x, int y) { return int(pow(double(x), double(y))); }
double log(double a, double b) { return log(b) / log(a); }
unsigned int randxor()
{
static unsigned int x = 123456789, y = 362436069, z = 521288629, w = 88675123;
unsigned int t;
t = (x ^ (x << 11)); x = y; y = z; z = w; return(w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)));
}
int main() {
int n, m;
cin >> n >> m;
vector<ll > a(n), q(m);
rep(i, n) {
cin >> a[i];
}
rep(i, m) {
cin >> q[i];
}
vector<int> t(n);
FOR(i,n/2, n) {
int b = a[i + i - n + 1];
int c = a[i] - b;
t[i] = b + c / 2;
}
vector<ll> sum(n), odd(n), even(n);
rep(i, n) {
if (i == 0) {
sum[i] = a[i];
}
else {
sum[i] = sum[i - 1] + a[i];
}
}
rep(i, n) {
if (i == 1) {
odd[i] = a[i];
}
else if (i % 2 == 1) {
odd[i] = odd[i - 2] + a[i];
}
}
rep(i, n) {
if (i == 0) {
even[i] = a[i];
}
else if (i % 2 == 0) {
even[i] = even[i - 2] + a[i];
}
}
rep(i, m) {
int x = lower_bound(t.begin(), t.end(), q[i]) - t.begin();
ll t0 = sum[n - 1] - sum[x-1];
if (2 * x - n - 1 < 0) {
cout << t0 << endl;
}
else if ((2 * x - n - 1) % 2 == 0) {
cout << even[2 * x - n - 1] + t0 << endl;
}
else {
cout << odd[2 * x - n - 1] + t0 << endl;
}
}
}
|
p03158 | C++ | #include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <stack>
#include <set>
#include <map>
typedef long long ll;
typedef unsigned int uint;
using namespace std;
int N, Q, A[100001];
ll S[100001], Sdiv[100001];
pair<int, int> X[100000];
ll ans[100000];
int main() {
cin >> N >> Q;
for (int i = 1; i <= N; i++) {
cin >> A[i];
S[i] = S[i - 1] + A[i];
Sdiv[i] = A[i];
if (i - 2 > 0) Sdiv[i] += Sdiv[i - 2];
}
for (int i = 0; i < Q; i++) {
int x;
cin >> x;
X[i] = {x, i};
}
sort(X, X + Q);
int y = 1;
for (int q = 0; q < Q; q++) {
int x = X[q].first;
while (y <= N && A[y] < x) y++;
while (y <= N) {
// 高橋
int upper = N - y + 1;
// 青木
int lower = y - (lower_bound(A, A + N + 1, max(1, 2 * x - A[y])) - A) + 1;
if (upper > lower) {
y++;
} else {
break;
}
}
ll result = S[N] - S[y - 1];
int t_first = N - (N - y + 1) * 2;
if (t_first > 0) result += Sdiv[t_first];
ans[X[q].second] = result;
}
for (int i = 0; i < Q; i++) {
cout << ans[i] << endl;
}
return 0;
} |
p03158 | C++ | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0, max_i = (n); i < max_i; i++)
#define REPI(i, a, b) for (int i = (a), max_i = (b); i < max_i; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define RALL(obj) (obj).rbegin(), (obj).rend()
#define fi first
#define se second
#define int long long
using namespace std;
using ll = long long;
using II = pair<int, int>; using VII = vector<II>; using VVII = vector<VII>;
using VI = vector<int>; using VVI = vector<VI>; using VVVI = vector<VVI>;
template <class T = int> inline bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; }
template <class T = int> inline bool chmin(T &a, const T &b) { if (a > b) { a = b; return true; } return false; }
template <class T> ostream& operator<<(ostream &s, const vector<T>& d) { REP (i, d.size()) s << d[i] << (i == d.size() - 1 ? "" : " "); return s; }
template <class T> ostream& operator<<(ostream &s, const vector<vector<T>>& d) { REP (i, d.size()) s << d[i] << (i == d.size() - 1 ? "" : "\n"); return s; }
template <class T, class S> ostream& operator<<(ostream &s, const pair<T, S>& p) { s << "{" << p.first << ", " << p.second << "}"; return s; }
template <class T, class S> ostream& operator<<(ostream& s, const map<T, S> m) { for (auto it = m.begin(); it != m.end(); it++) { s << *it << (next(it) == m.end() ? "" : "\n"); } return s; }
#ifdef _MY_DEBUG
#define dump(...) cerr << "/* " << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << endl, dump_func(__VA_ARGS__), cerr << "*/\n\n";
#else
#define dump(...)
#endif
void dump_func() { cerr << endl; }
template <class Head, class... Tail> void dump_func(Head&& h, Tail&&... t) { cerr << h << (sizeof...(Tail) == 0 ? "" : ", "), dump_func(forward<Tail>(t)...); }
struct Fast { Fast() { cin.tie(0); ios::sync_with_stdio(false); } } fast;
constexpr int MOD = 1e9 + 7;
signed main() {
int N, Q; cin >> N >> Q;
VI A(N);
REP (i, N) cin >> A[i];
VI X(Q);
REP (q, Q) cin >> X[q];
VI odd(N), even(N), acc(N);
REP (i, N) {
acc[i] += (i == 0 ? 0 : acc[i - 1]) + A[i];
odd[i] = (i == 0 ? 0 : odd[i - 1]);
even[i] = (i == 0 ? 0 : even[i - 1]);
(i % 2 ? odd[i] : even[i]) += A[i];
}
for (int x: X) {
dump(x);
int left = upper_bound(ALL(A), x) - A.begin();
int l = left, r = N;
while (r - l > 1) {
int m = (l + r) / 2;
int tmp = 2 * x - A[m - 1];
int first = lower_bound(ALL(A), tmp) - A.begin();
dump(m, first);
if (N - m == m - first) {
l = m; break;
}
bool f = N - m > m - first;
(f ? l : r) = m;
}
int p = 2 * l - N;
dump(p, l);
int ans = acc[N - 1] - (l <= 0 ? 0 : acc[l - 1]);
dump(ans);
if (p >= 1) {
if ((p - 1) % 2) {
ans += odd[p - 1];
} else {
ans += even[p - 1];
}
}
cout << ans << endl;
}
}
|
p03158 | C++ | #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <deque>
#define REP(i, a, b) for (int i = int(a); i < int(b); i++)
#define dump(val) cerr << __LINE__ << ":\t" << #val << " = " << (val) << endl
using namespace std;
typedef long long int ll;
template<typename T>
vector<T> make_v(size_t a, T b) {
return vector<T>(a, b);
}
template<typename... Ts>
auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v(ts...))>(a, make_v(ts...));
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int N, Q;
cin >> N >> Q;
vector<ll> A(N);
REP(i, 0, N) {
cin >> A[i];
}
vector<ll> skipsum(N + 2, 0), sum(N + 1, 0);
REP(i, 0, N) {
sum[i + 1] += sum[i] + A[i];
}
for (int i = !(N % 2); i < N; i += 2) {
skipsum[i + 2] += skipsum[i] + A[i];
}
REP(i, 0, Q) {
int q;
cin >> q;
int lb = 1, ub = N;
int ans = 0;
while (lb <= ub) {
int mid = (lb + ub) / 2;
int aoki = N - mid;
int taka = N - (mid + 1) / 2;
if (abs(A[aoki] - q) <= abs(A[taka] - q)) {
ans = mid;
lb = mid + 1;
} else {
ub = mid - 1;
}
}
// 0 ~ N - 1
ans = N - ans;
if (N % 2 == 0) {
ans = max(ans - 1, 0);
}
int j = (ans + 1) / 2;
int k = (ans + 1) / 2 * 2 + !(N % 2);
/*
dump(ans);
dump(j);
dump(k);
dump(skipsum[k]);
//*/
cout << skipsum[k] + sum[N] - sum[N / 2 + j] << endl;
}
return 0;
}
|
p03158 | C++ | #include <iostream>
using namespace std;
typedef long long ll;
ll n,q,t[100001],u[100001],a[100000],x;
int main(void){
cin>>n>>q;
for(int i=0;i<n;i++){
cin>>a[i];
t[i+1]=t[i]+a[i];
u[i+1]=(i?u[i-1]:0)+a[i];
}
while(q--){
cin>>x;
ll ub=0,lb=n+1,m;
while(ub+1<lb){
m=(lb+ub)/2;
if(abs(a[n-m]-x)>abs(a[n-(m+1)/2]-x))lb=m;
else ub=m;
}
cout<<t[n]-t[n-(ub+1)/2]+u[max(n-ub-(ub&1),0LL)]<<endl;
}
} |
p03158 | C++ | #include<bits/stdc++.h>
using namespace std;
template<typename F, typename S>
ostream &operator<<(ostream &os, const pair<F, S> &p) {
return os << "(" << p.first << ", " << p.second << ")";
}
template<typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
os << "{";
typename vector<T>::const_iterator it;
for (it = v.begin(); it != v.end(); it++) {
if (it != v.begin()) os << ", ";
os << *it;
}
return os << "}";
}
template<typename T>
ostream &operator<<(ostream &os, const set<T> &v) {
os << "[";
typename set<T>::const_iterator it;
for (it = v.begin(); it != v.end(); it++) {
if (it != v.begin()) os << ", ";
os << *it;
}
return os << "]";
}
template<typename F, typename S>
ostream &operator<<(ostream &os, const map<F, S> &v) {
os << "[";
typename map<F, S>::const_iterator it;
for (it = v.begin(); it != v.end(); it++) {
if (it != v.begin()) os << ", ";
os << it->first << " = " << it->second;
}
return os << "]";
}
#define debug(x) cout << #x << " = " << x << endl;
typedef long long int ll;
typedef long double ld;
#define endl "\n";
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define pb push_back
#define mp make_pair
#define all(c) (c).begin(),(c).end()
#define tr(cont, it) for(decltype((cont).begin()) it = (cont).begin(); it != (cont).end(); it++)
#define present(c, x) ((c).find(x) != (c).end())
#define cpresent(c, x) (find(all(c),x) != (c).end())
#define F first
#define S second
const ll mod = 1000000007;
const ll inf = (ll) 1e15;
ll power(ll a, ll b, ll m = mod) {if (b == 0) return 1; if (b == 1) return (a % m); ll x = power(a, b / 2, m); x = (x * x) % m; if (b % 2) x = (x * a) % m;return x;}
ll max(ll a, ll b) { return (a > b ? a : b); }
ll min(ll a, ll b) { return (a < b ? a : b); }
const int N=1e5+5;
int n,a[N],q;
ll sum[N],even[N];
ll query(int x)
{
if(x>=a[n])
{
if(!(n%2))
return even[n];
else
return sum[n]-even[n];
}
int low=1,high=n;
//debug(low);
int ans=-1;
while(low<=high)
{
int mid=(low+high)/2;
int numa=n-mid+1;
int numb=mid-1-(lower_bound(a+1,a+n+1,x-(a[mid]-x))-a)+1;
if(numa-numb<=1)
{
ans=mid;
high=mid-1;
} else
{
low=mid+1;
}
}
assert(ans!=-1);
ll ret=sum[n]-sum[ans-1];
int rem=n-2*(n-ans+1);
if(!(rem%2))
ret+=even[rem];
else
ret+=sum[rem]-even[rem];
return ret;
}
void solve() {
cin >> n >>q;
a[0]=-10000;
for(int i=1;i<=n;i++)
{
cin >> a[i];
sum[i]=sum[i-1]+a[i];
even[i]=even[i-1]+(!(i%2)?a[i]:0);
}
while(q--)
{
int x;
cin >> x;
ll ans=query(x);
cout << ans << endl;
}
}
int main() {
IOS;
int t = 1, num = 1; ///// change this t for number of testcase globally
while (t--) {
solve();
}
return 0;
}
|
p03158 | C++ | #include<bits/stdc++.h>
using namespace std;
int main(){
long long N, Q;
scanf("%lld%lld", &N, &Q);
vector<long long> A(N), AS(N + 2), S(N + 1), X, a;
for(int i = 0; i < N; ++i){
scanf("%lld", &A[i]);
AS[i + 2] = A[i] + AS[i];
S[i + 1] = A[i] + S[i];
}
reverse(A.begin(), A.end());
reverse(S.begin(), S.end());
reverse(AS.begin(), AS.end());
for(int i = 1; i <= (N + 1) / 2; ++i){
a.push_back(S[0] - S[i] + AS[i * 2]);
}
for(int i = 1; i <= (N - 1) / 2; ++i){
X.push_back(A[i] + A[i * 2]);
}
reverse(a.begin(), a.end());
reverse(X.begin(), X.end());
for(long long i = 0, x = 0; i < Q; ++i){
scanf("%lld", &x);
printf("%lld\n", a[lower_bound(X.begin(), X.end(), x * 2) - X.begin()]);
}
return 0;
} |
p03158 | C++ | #include<bits/stdc++.h>
using namespace std;
int main(){
long long N, Q;
scanf("%lld%lld", &N, &Q);
vector<long long> A(N), AS(N + 2), S(N + 1), X((N - 1) / 2), a((N + 1) / 2);
for(int i = 0; i < N; ++i){
scanf("%lld", &A[i]);
AS[i + 2] = A[i] + AS[i];
S[i + 1] = A[i] + S[i];
}
reverse(A.begin(), A.end());
reverse(S.begin(), S.end());
reverse(AS.begin(), AS.end());
for(int i = 1; i <= (N + 1) / 2; ++i){
a[i - 1] = S[0] - S[i] + AS[i * 2];
}
for(int i = 1; i <= (N - 1) / 2; ++i){
X[i - 1] = A[i] + A[i * 2];
}
reverse(a.begin(), a.end());
reverse(X.begin(), X.end());
for(long long i = 0, x = 0; i < Q; ++i){
scanf("%lld", &x);
printf("%lld\n", a[lower_bound(X.begin(), X.end(), x * 2) - X.begin()]);
}
return 0;
} |
p03158 | C++ | #include<bits/stdc++.h>
using namespace std;
int main(){
long long N, Q;
scanf("%lld%lld", &N, &Q);
vector<long long> A(N), AS(N + 2), S(N + 1), X((N - 1) / 2), a((N + 1) / 2);
for(int i = 0; i < N; ++i){
scanf("%lld", &A[i]);
AS[i + 2] = A[i] + AS[i];
S[i + 1] = A[i] + S[i];
}
for(int i = 1; i <= (N + 1) / 2; ++i){
a[i - 1] = *S.rbegin() - *(S.rbegin() + i) + *(AS.rbegin() + i * 2);
}
for(int i = 1; i <= (N - 1) / 2; ++i){
X[i - 1] = *(A.rbegin() + i) + *(A.rbegin() + i * 2);
}
reverse(a.begin(), a.end());
reverse(X.begin(), X.end());
for(long long i = 0, x = 0; i < Q; ++i){
scanf("%lld", &x);
printf("%lld\n", a[lower_bound(X.begin(), X.end(), x * 2) - X.begin()]);
}
return 0;
} |
p03158 | C++ | /*#include<bits/stdc++.h>
using namespace std;
constexpr size_t maxM = 1000000, days = 100;
int_fast64_t dp[1010101], sum[1010101], ans[days], Day;
void dfs(int l, int r, int n){
//cout << l << ", " << r << ", " << n << " : " << ((r - l) & ((2 << n) - 1)) << endl;
if(l >= r - 1)return;
if(r - l == 2){
dp[l] += 1;
dp[l + 1] -= 1;
sum[l] += 1;
sum[r] -= 1;
return;
}
int m = l, k = l;
for(int i = 0; i + 1 < 2 << n; ++i){
k = m;
m += ((r - l) / 2 >> n) + (i < ((r - l) & ((2 << n) - 1)));
dp[k] += 1;
dp[m] += -1;
sum[k] += 1;
sum[r] += -1;
dfs(k, m, n + 1);
}
dfs(m, r, n + 1);
}
int main(){
//dfs(0, 1000000);
dfs(0, maxM, 0);
partial_sum(dp, dp + 1010101, dp);
partial_sum(sum, sum + 1010101, sum);
for(int i = 0; i < 30; ++i)cout << dp[i] << " ";
cout << endl;
for(int i = 0; i < 30; ++i)cout << sum[i] << " ";
cout << endl;
for(int i = 0; i < maxM; ++i){
if(dp[i] < 6){
++ans[sum[i]];
Day += sum[i];
}
else ++ans[0];
}
for(int i = 0; i < days; ++i){
printf("%d : %.12Lf\n%lld\n", i, ans[i] / static_cast<long double>(1000000), Day);
}
}*/
/*#include<bits/stdc++.h>
using namespace std;
long long n;
int main() {
while(cin >> n, n){
cout << n << "\t: " << bitset<27>(n) << endl;
}
}*/
#include<bits/stdc++.h>
using namespace std;
int main(){
long long N, Q;
scanf("%lld%lld", &N, &Q);
vector<long long> A(N), AS(N + 2), S(N + 1), X((N - 1) / 2), a((N + 1) / 2);
for(int i = 0; i < N; ++i){
scanf("%lld", &A[i]);
AS[i + 2] = A[i] + AS[i];
S[i + 1] = A[i] + S[i];
}
for(int i = 1; i <= (N + 1) / 2; ++i){
a[i - 1] = *S.rbegin() - *(S.rbegin() + i) + *(AS.rbegin() + i * 2);
}
for(int i = 1; i <= (N - 1) / 2; ++i){
X[i - 1] = *(A.rbegin() + i) + *(A.rbegin() + i * 2);
}
reverse(a.begin(), a.end());
reverse(X.begin(), X.end());
for(long long i = 0, x = 0; i < Q; ++i){
scanf("%lld", &x);
printf("%lld\n", a[lower_bound(X.begin(), X.end(), x * 2) - X.begin()]);
}
return 0;
} |
p03158 | C++ | #include<cstdio>
#include<cmath>
#include<vector>
#include<algorithm>
#include<numeric>
int main() {
using i64 = long long int;
i64 n, q;
scanf("%lld%lld", &n, &q);
std::vector<i64> a(n), x(q), ans(q),index(q);
i64 sum = 0;
for (i64 i = n;i--;) {
scanf("%lld", &a[i]);
}
for (i64 i = 0;i < n;i += 2) {
sum += a[i];
}
for (auto &e : x) {
scanf("%lld", &e);
}
std::iota(index.begin(), index.end(), 0);
std::sort(index.begin(), index.end(),
[&x](i64 l, i64 r) {return x[l] > x[r];});
i64 l = 0, r = 0;
for (const auto i : index) {
while (r < n&&std::abs(a[l] - x[i]) >= std::abs(a[r] - x[i])) {
sum -= a[r];
sum += a[l];
l += 1;
r += 2;
}
ans[i] = sum;
}
for (const auto &e : ans) {
printf("%lld\n", e);
}
return 0;
}
|
p03158 | C++ | #include<cstdio>
#include<cmath>
#include<vector>
#include<algorithm>
#include<numeric>
int main() {
using i64 = long long int;
i64 n, q;
scanf("%lld%lld", &n, &q);
std::vector<i64> a(n), x(q), ans(q),index(q);
i64 sum = 0;
for (i64 i = n;i--;) {
scanf("%lld", &a[i]);
if (i % 2 == 0) {
sum += a[i];
}
}
for (auto &e : x) {
scanf("%lld", &e);
}
std::iota(index.begin(), index.end(), 0);
std::sort(index.begin(), index.end(),
[&x](i64 l, i64 r) {return x[l] > x[r];});
i64 l = 0, r = 0;
for (const auto i : index) {
while (r < n&&std::abs(a[l] - x[i]) >= std::abs(a[r] - x[i])) {
sum -= a[r];
sum += a[l];
l += 1;
r += 2;
}
ans[i] = sum;
}
for (const auto &e : ans) {
printf("%lld\n", e);
}
return 0;
}
|
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
#define NDEBUG
#include <cassert>
typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<llll> vllll;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<long double> vD;
#define sz(a) int((a).size())
#define pb push_back
#define eb emplace_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n) for(int var=0;var<(n);++var)
#define rep1(var,n) for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n) for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define repC3(vari,varj,vark,n) for(int vari=0;vari<(n)-2;++vari)for(int varj=vari+1;varj<(n)-1;++varj)for(int vark=varj+1;vark<(n);++vark)
#define ALL(c) (c).begin(),(c).end()
#define RALL(c) (c).rbegin(),(c).rend()
#define tr(i,c) for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e) ((s).find(e)!=(s).end())
#define mset(arr,val) memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))
#define cons make_pair
template<class T> inline void amin(T & a, T const & b) { a = min(a, b); }
template<class T> inline void amax(T & a, T const & b) { a = max(a, b); }
template<typename X, typename T> auto vectors(X x, T a) { return vector<T>(x, a); }
template<typename X, typename Y, typename Z, typename... Zs> auto vectors(X x, Y y, Z z, Zs... zs) { auto cont = vectors(y, z, zs...); return vector<decltype(cont)>(x, cont); }
ll gcd(ll a, ll b) { while(a) swap(a, b%=a); return b; }
const ll MOD=1000000007LL;
ll ADD(ll x, ll y) { return (x+y) % MOD; }
ll SUB(ll x, ll y) { return (x-y+MOD) % MOD; }
ll MUL(ll x, ll y) { return x*y % MOD; }
ll POW(ll x, ll e) { ll v=1; for(; e; x=MUL(x,x), e>>=1) if (e&1) v = MUL(v,x); return v; }
ll DIV(ll x, ll y) { /*assert(y%MOD!=0);*/ return MUL(x, POW(y, MOD-2)); }
#define INTSPACE 12
char _buf[INTSPACE*1000000 + 3];
int loadint() {
if (fgets(_buf, INTSPACE+3, stdin)==NULL) return 0;
return atoi(_buf);
}
int loadvec(vector<int>& v, int N=-1) {
if (N == 0) {
v.clear();
return 0;
}
if (N == -1) {
N = loadint();
if (N==0) return 0;
}
int bufsize = INTSPACE*N + 3;
if (fgets(_buf, bufsize, stdin)==NULL) return 0;
v.resize(N);
int i=0;
bool last = false;
for (char *p=&_buf[0]; ;) {
char *q = p;
while (*q > ' ') ++q;
if (*q == 0x0D || *q == 0x0A) last = true;
*q = 0;
v[i++] = atoi(p);
if (last || i == N) break;
p = q+1;
}
return i;
}
void read_cr() {
fgets(_buf, 256, stdin);
}
int N, Q;
vi a;
vll acc, racc;
unordered_map<int,int> am;
int ca1=0, ca2=0, ca3=0;
void prepare(){
rep(i,N){
am[ a[i] ] = i;
}
acc.resize(N+1);
racc.resize(N+1);
acc[0] = 0;
rep(i,N) acc[i+1] = acc[i] + a[i];
racc[0] = 0;
if (N % 2) {
for (int i=0,j=0; i<N; i+=2,j++) {
racc[j+1] = racc[j] + a[i];
}
} else {
for (int i=1,j=0; i<N; i+=2,j++) {
racc[j+1] = racc[j] + a[i];
}
}
}
inline ll f(int n){
++ca1;
int r = (N - 2*n), h = (r+1)/2;
ll pre = acc[N] - acc[N-n];
if (h > 0)
pre += racc[h] - racc[0];
return pre;
}
bool nth_available(int x, int n){
assert(IN(n,1,N));
int t_nth_at = a[N-n];
if (x >= t_nth_at) return false;
assert(x < t_nth_at);
int d = t_nth_at - x;
int opp = x - d, opp_ix;
if (found(am, opp)) {
opp_ix = am[opp];
} else {
opp_ix = upper_bound(ALL(a), opp) - a.begin();
}
int a_rank = (N-n) - opp_ix + 1;
bool res = (a_rank >= n);
return res;
}
inline int find_n(int x) {
if (x >= a[N-1]) return 0;
int h = (N+1)/2;
if (x <= a[0]) return h;
int ok=1, ng=N;
int a_lo, a_hi;
while (abs(ok-ng) > 1) {
int n = mid(ng, ok);
if (nth_available(x, n)) {
ok = n;
} else {
ng = n;
}
}
return ok;
}
int main() {
scanf("%d%d", &N, &Q); read_cr();
a.resize(N);
loadvec(a, N);
prepare();
rep(i,Q) {
int xi;
scanf("%d", &xi);
int n = find_n(xi);
ll ans = f(n);
printf("%lld\n", ans);
}
return 0;
}
|
p03158 | C++ | #include<iostream>
#include<cmath>
#include<vector>
#include<algorithm>
#include<numeric>
int main() {
using usize = unsigned int;
using i64 = long long int;
usize n, q;
std::cin >> n >> q;
std::vector<i64> a(n), x(q), ans(q);
std::vector<usize> index(q);
i64 sum = 0;
for (usize i = n;i--;) {
std::cin >> a[i];
if (i % 2 == 0) {
sum += a[i];
}
}
for (auto &e : x) {
std::cin >> e;
}
std::iota(index.begin(), index.end(), 0);
std::sort(index.begin(), index.end(),
[&x](usize l, usize r) {return x[l] > x[r];});
usize l = 0, r = 0;
for (const auto i : index) {
while (r < n&&std::abs(a[l] - x[i]) >= std::abs(a[r] - x[i])) {
sum -= a[r];
sum += a[l];
l += 1;
r += 2;
}
ans[i] = sum;
}
for (const auto e : ans) {
std::cout << e << std::endl;
}
return 0;
}
|
p03158 | C++ | #include<iostream>
#include<cmath>
#include<vector>
#include<algorithm>
#include<numeric>
int main() {
using usize = unsigned int;
using i64 = long long int;
usize n, q;
std::cin >> n >> q;
std::vector<i64> a(n), x(q), ans(q);
std::vector<usize> index(q);
i64 sum = 0;
for (usize i = n;i--;) {
std::cin >> a[i];
if (i % 2 == 0) {
sum += a[i];
}
}
for (auto &e : x) {
std::cin >> e;
}
std::iota(index.begin(), index.end(), 0);
std::sort(index.begin(), index.end(),
[&x](usize l, usize r) {return x[l] > x[r];});
usize l = 0, r = 0;
for (const auto i : index) {
while (r < n&&std::abs(a[l] - x[i]) >= std::abs(a[r] - x[i])) {
sum -= a[r + r % 2];
sum += a[l];
l += 1;
r += 2;
}
ans[i] = sum;
}
for (const auto e : ans) {
std::cout << e << std::endl;
}
return 0;
}
|
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
#ifdef ENABLE_DEBUG
#define DEBUG(a) cerr<<#a<<":"<<a<<endl;
#else
#define DEBUG(a)
#endif
vector<long long> sumA,sumoddA,sumevenA;
void solve(long long N, long long Q, vector<long long> A, vector<long long> X){
sumA.push_back(0);
sumoddA.push_back(0);
sumevenA.push_back(0);
for(size_t i=0;i<A.size();i++){
sumA.push_back(sumA.back()+A[i]);
if(i%2==0){
sumevenA.push_back(sumevenA.back()+A[i]);
}else{
sumoddA.push_back(sumoddA.back()+A[i]);
}
}
for(auto q:X){
long long l=0,r=A.size();
while(l+1<r){
long long mid=(l+r)/2;
long long d1=A.size()-mid,d2=A.size()-mid*2+1;
DEBUG(d1);
DEBUG(d2);
if(mid*2-1>(long long)A.size()){
r=mid;
}else if(A[d1]<=q){
r=mid;
}else if(A[d1]-q>=q-A[d2]){
l=mid;
}else{
r=mid;
}
}
long long ans=0;
DEBUG(l);
ans+=sumA.back()-sumA[A.size()-l];
long long all=l*2-1;
long long tmp;
if(all>=(long long)A.size()){
DEBUG(all);
}
else if((tmp=(A.size()-1-2*l))%2==0){
DEBUG(tmp);
ans+=sumevenA[tmp/2+1];
}else{
DEBUG(tmp);
ans+=sumoddA[(tmp+1)/2];
}
cout<<ans<<endl;
}
}
int main(){
long long N;
scanf("%lld",&N);
long long Q;
scanf("%lld",&Q);
vector<long long> A(N);
for(int i = 0 ; i < N ; i++){
scanf("%lld",&A[i]);
}
vector<long long> X(Q);
for(int i = 0 ; i < Q ; i++){
scanf("%lld",&X[i]);
}
solve(N, Q, A, X);
return 0;
}
|
p03158 | C++ | // need
#include <iostream>
#include <algorithm>
// data structure
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <complex>
//#include <deque>
#include <valarray>
#include <unordered_map>
#include <unordered_set>
#include <array>
// stream
//#include <istream>
#include <sstream>
//#include <ostream>
#include <fstream>
// etc
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
//#include <chrono>
#include <random>
#include <numeric>
// input
#define INIT std::ios::sync_with_stdio(false);std::cin.tie(0);
#define VAR(type, ...)type __VA_ARGS__;MACRO_VAR_Scan(__VA_ARGS__);
template<typename T> void MACRO_VAR_Scan(T& t) { std::cin >> t; }
template<typename First, typename...Rest>void MACRO_VAR_Scan(First& first, Rest&...rest) { std::cin >> first; MACRO_VAR_Scan(rest...); }
#define VEC_ROW(type, n, ...)std::vector<type> __VA_ARGS__;MACRO_VEC_ROW_Init(n, __VA_ARGS__); for(int w_=0; w_<n; ++w_){MACRO_VEC_ROW_Scan(w_, __VA_ARGS__);}
template<typename T> void MACRO_VEC_ROW_Init(int n, T& t) { t.resize(n); }
template<typename First, typename...Rest>void MACRO_VEC_ROW_Init(int n, First& first, Rest&...rest) { first.resize(n); MACRO_VEC_ROW_Init(n, rest...); }
template<typename T> void MACRO_VEC_ROW_Scan(int p, T& t) { std::cin >> t[p]; }
template<typename First, typename...Rest>void MACRO_VEC_ROW_Scan(int p, First& first, Rest&...rest) { std::cin >> first[p]; MACRO_VEC_ROW_Scan(p, rest...); }
#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;
#define MAT(type, c, m, n) std::vector<std::vector<type>> c(m, std::vector<type>(n));for(auto& R:c)for(auto& w:R)std::cin>>w;
// output
#define OUT(dist) std::cout<<(dist);
#define FOUT(n, dist) std::cout<<std::fixed<<std::setprecision(n)<<(dist);
#define SOUT(n, c, dist) std::cout<<std::setw(n)<<std::setfill(c)<<(dist);
#define SP std::cout<<" ";
#define TAB std::cout<<"\t";
#define BR std::cout<<"\n";
#define SPBR(w, n) std::cout<<(w + 1 == n ? '\n' : ' ');
#define ENDL std::cout<<std::endl;
#define FLUSH std::cout<<std::flush;
#define SHOW(dist) {std::cerr << #dist << "\t:" << (dist) << "\n";}
#define SHOWVECTOR(v) {std::cerr << #v << "\t:";for(const auto& xxx : v){std::cerr << xxx << " ";}std::cerr << "\n";}
#define SHOWVECTOR2(v) {std::cerr << #v << "\t:\n";for(const auto& xxx : v){for(const auto& yyy : xxx){std::cerr << yyy << " ";}std::cerr << "\n";}}
#define SHOWQUEUE(a) {auto tmp(a);std::cerr << #a << "\t:";while(!tmp.empty()){std::cerr << tmp.front() << " ";tmp.pop();}std::cerr << "\n";}
// utility
#define ALL(a) (a).begin(),(a).end()
#define FOR(w, a, n) for(int w=(a);w<(n);++w)
#define RFOR(w, a, n) for(int w=(n)-1;w>=(a);--w)
#define REP(w, n) for(int w=0;w<int(n);++w)
#define RREP(w, n) for(int w=int(n)-1;w>=0;--w)
#define FORLL(w, a, n) for(ll w=ll(a);w<ll(n);++w)
#define RFORLL(w, a, n) for(ll w=ll(n)-1;w>=ll(a);--w)
#define REPLL(w, n) for(ll w=0;w<ll(n);++w)
#define RREPLL(w, n) for(ll w=ll(n)-1;w>=0;--w)
#define IN(a, x, b) (a<=x && x<b)
template<class T> inline T CHMAX(T& a, const T b) { return a = (a < b) ? b : a; }
template<class T> inline T CHMIN(T& a, const T b) { return a = (a > b) ? b : a; }
#define EXCEPTION(msg) throw std::string("Exception : " msg " [ in ") + __func__ + " : " + std::to_string(__LINE__) + " lines ]"
#define TRY(cond, msg) try {if (cond) EXCEPTION(msg);}catch (std::string s) {std::cerr << s << std::endl;}
//void CHECKTIME(std::function<void()> f) { auto start = std::chrono::system_clock::now(); f(); auto end = std::chrono::system_clock::now(); auto res = std::chrono::duration_cast<std::chrono::nanoseconds>((end - start)).count(); std::cerr << "[Time:" << res << "ns (" << res / (1.0e9) << "s)]\n"; }
// test
template<class T> std::vector<std::vector<T>> VV(int n, int m, T init = T()) {
return std::vector<std::vector<T>>(n, std::vector<T>(m, init));
}
template<typename S, typename T>
std::ostream& operator<<(std::ostream& os, std::pair<S, T> p) {
os << "(" << p.first << ", " << p.second << ")"; return os;
}
// type/const
#define int ll
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using PAIR = std::pair<int, int>;
using PAIRLL = std::pair<ll, ll>;
constexpr int INFINT = 1 << 30; // 1.07x10^ 9
constexpr int INFINT_LIM = (1LL << 31) - 1; // 2.15x10^ 9
constexpr ll INFLL = 1LL << 60; // 1.15x10^18
constexpr ll INFLL_LIM = (1LL << 62) - 1 + (1LL << 62); // 9.22x10^18
constexpr double EPS = 1e-10;
constexpr int MOD = 1000000007;
constexpr double PI = 3.141592653589793238462643383279;
template<class T, size_t N> void FILL(T(&a)[N], const T& val) { for (auto& x : a) x = val; }
template<class ARY, size_t N, size_t M, class T> void FILL(ARY(&a)[N][M], const T& val) { for (auto& b : a) FILL(b, val); }
template<class T> void FILL(std::vector<T>& a, const T& val) { for (auto& x : a) x = val; }
template<class ARY, class T> void FILL(std::vector<std::vector<ARY>>& a, const T& val) { for (auto& b : a) FILL(b, val); }
// ------------>8------------------------------------->8------------
signed main() {
INIT;
VAR(int, n, Q);
VEC(int, a, n);
std::vector<int> c(n + 1, 0);
REP(i, n) c[i + 1] = c[i] + a[i];
std::vector<int> e(n + 1, 0);
e[1] = a[0];
e[2] = a[1];
FOR(i, 3, n) e[i] = e[i - 2] + a[i - 1];
REP(_, Q) {
VAR(int, x);
auto check = [&](int d) {
int pos = std::lower_bound(ALL(a), x - std::abs(a[n - d] - x)) - a.begin();
return d <= (n - d) - pos + 1;
};
int ok = 0, ng = n;
while (ng - ok > 1) {
int me = (ok + ng) / 2;
if (check(me)) ok = me;
else ng = me;
}
int ans = c[n] - c[n - ok];
if (n - 2 * ok >= 0) ans += e[n - 2 * ok];
OUT(ans)BR;
}
return 0;
} |
p03158 | C++ | #include <iostream>
using namespace std;
typedef long long ll;
ll n,q,t[100001],u[100001],a[100000],x;
int main(void){
cin>>n>>q;
for(int i=0;i<n;i++){
cin>>a[i];
t[i+1]=t[i]+a[i];
u[i+1]=(i?u[i-1]:0)+a[i];
}
while(q--){
cin>>x;
ll ub=0,lb=n+1,m;
while(ub+1<lb){
m=(lb+ub)/2;
if(abs(a[n-m]-x)>abs(a[n-(m+1)/2]-x))lb=m;
else ub=m;
}
cout<<t[n]-t[n-(ub+1)/2]+u[max(n-ub-(ub&1),0LL)]<<endl;
}
}
|
p03158 | C++ | #include <vector>
#include <cstdio>
#include <algorithm>
using namespace std;
using ll = long long int;
int main() {
ll N, Q; scanf("%lld%lld", &N, &Q);
vector<ll> A(N), sum(N+2), part(N+2);
for(int i=0; i<N; i++) {
scanf("%lld", &A[i]);
sum[i+1] = sum[i] + A[i];
part[i+2] = part[i] + A[i];
}
int M1 = (N + 1) / 2, M2 = (N - 1) / 2;
vector<ll> point(M1), X(M2);
for(int i=1; i<=M1; i++) {
point[i-1] = sum[N] - sum[N-i] + part[N - 2*i + 1];
}
for(int i=1; i<=M2; i++) {
X[i-1] = A[N-i-1] + A[N-i*2-1];
}
reverse(point.begin(), point.end());
reverse(X.begin(), X.end());
for(int i=0; i<Q; i++) {
ll val; scanf("%lld", &val);
printf("%lld\n", point[lower_bound(X.begin(), X.end(), 2*val) - X.begin()]);
}
return 0;
}
|
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
#define int long long // aaaaaaaaaaaaaaaaaa
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define allr(x) (x).rbegin(),(x).rend()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
#define SIZE(buff) (sizeof(buff)/sizeof(buff[0]))
typedef vector<int> VI;
typedef vector<vector<int> > VVI;
typedef long long ll;
typedef pair<int,int> PII;
const ll mod=1000000007;
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
template <class T>ostream &operator<<(ostream &o,const vector<T>&v)
{o<<"{";for(int i=0;i<(int)v.size();i++)o<<(i>0?", ":"")<<v[i];o<<"}";return o;}
template<typename T, typename U>ostream& operator << (ostream& os, pair<T, U>& pair_var)
{os << "(" << pair_var.first << ", " << pair_var.second << ")";return os;}
// head
int q,m,n,k,res,tmp,tmp2;
VI a;
int b[200010] = {};
vector<pair<int,int>> v[305];
deque<PII> que;
//int dp[305][305][305] = {};
string s;
int rui[100002] = {};
int grui[100002] = {};
int migi,hidari,mid;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
std::cin >>n>>q;
rep(i,0,n){
cin>>k;
a.pb(k);
}
rep(i,0,q){
cin>>b[i];
}
rep(i,0,n){
rui[i+1] = rui[i]+a[i];
if(i%2==1)grui[i/2+1] = grui[i/2]+a[i];
}
rep(i,0,q){
int x = b[i];
int ue = (int)pow(10,9);
int sita = -1;
if(x*2>a[n-1]+a[n-2]){
if (n%2==1){
cout<<rui[n]-grui[(n)/2]<<endl;
}
else{
cout<<grui[(n)/2]<<endl;
}
continue;
}
int flag = -1;
int mae = -1;
while(ue-sita>1){
mid = (ue+sita)/2;
hidari = lower_bound(a.begin(), a.end(), x-mid)-a.begin();
migi = lower_bound(a.begin(), a.end(), x+mid)-a.begin();
if (migi==n) migi-=1;
if (x+mid < a[migi])migi-=1;
int taka = n-1-migi;
int ao = migi-hidari+1;
if (taka == ao) {flag = 1; break;}
else if(taka-ao == 1){ flag = 0; break;}
else if (ao-1 == taka && (x-a[hidari] == a[migi]-x)){
migi-=1;
flag = 0;
break;
}
if (taka>ao){
sita = mid; mae=0;
}
else{
ue = mid; mae=1;
}
}
res = 0;
res += rui[n] - rui[migi+1];
if (flag){
if (hidari){
int kon = hidari;
if (kon%2==1){
res += rui[kon]-grui[(kon)/2];
}
else{
res +=grui[(kon)/2];
}
}
}
else{
if (hidari){
int kon = hidari;
if (kon%2==0){
res += rui[kon]-grui[(kon)/2];
}
else{
res +=grui[(kon)/2];
}
}
}
cout<<res<<endl;
}
}
|
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
int N, Q, A[100001];
int64_t S[100001], Sdiv[100001];
int X[100000];
int64_t ans[100000];
int main(){
cin >> N >> Q;
for(int i=1; i<=N; i++){
cin >> A[i];
S[i] = S[i-1] + A[i];
Sdiv[i] = A[i];
if(i-2 > 0) Sdiv[i] += Sdiv[i-2];
}
for(int i=0; i<Q; i++) cin >> X[i];
for(int q=0; q<Q; q++){
int ng = 0;
int ok = N;
while(ok-ng>1){
int mid = (ng+ok)/2;
if(A[mid] < X[q]){
ng = mid;
}else{
int upper = N - mid + 1;
int lower = mid - (lower_bound(A, A+N+1, max(1, 2*X[q]-A[mid])) - A) + 1;
(upper > lower ? ng : ok) = mid;
}
}
int64_t result = S[N] - S[ok-1];
int t_first = N - (N-ok+1)*2;
if(t_first > 0) result += Sdiv[t_first];
ans[q] = result;
}
for(int i=0; i<Q; i++) cout << ans[i] << endl;
return 0;
} |
p03158 | C++ | /*
Life before Death
Strength before Weakness
Journey before Destination
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define rep(i,a,n) for(ll i=a;i<n;i++)
#define per(i,n,a) for (ll i=n;i>a;i--)
#define te ll t; std::cin >> t; while(t--)
#define SZ 100011
//#define M_PI 3.141592653589793238462643383279502884L
/*------Just DO IT--------------------------------------*/
ll a[SZ], sum[SZ], even[SZ];
int solve(){
ll n,q;
cin >> n >> q;
a[0]-=1000000000000000000LL;
rep(i, 1, n + 1) {
cin >> a[i];
sum[i] = sum[i-1] + a[i];
even[i] = even[i-1] + a[i]*(i&1 ? 0:1);
}
while(q--){
ll x;
cin >> x;
if(x >= a[n]) { cout << (n&1 ? sum[n]-even[n] : even[n]) << endl; continue; }
ll pos = lower_bound(a+1, a+n+1, x) - a;
ll l = pos - 1, r = n;
while(l+1<r){
ll mid = (l+r)/2;
ll numr = n - mid + 1;
ll numl = mid - ( lower_bound(a, a+n+1, 2*x - a[mid]) - a );
numr - numl <= 1 ? r = mid : l = mid;
}
ll qq = n- 2*(n - r + 1);
ll ans = sum[n] - sum[r-1];
qq&1 ? ans+=sum[qq]-even[qq] : ans+=even[qq];
cout << ans << endl;
}
}
int main() {
fastio
solve();
}
/*
1 2 3 5 7 9 12 14 16 17 18 21 25 29 34 35 48 59
*/ |
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
#define int long long
//#define uint __int128_t
#define pb push_back
#define fi first
#define se second
#define rep(i,s,n) for(int i = s;i<n;i++)
#define repe(i,s,n) for(int i = s;i<=n;i++)
#define rrep(i,s,n) for(int i = (n)-1;i>=(s);i--)
#define all(v) (v).begin(),(v).end()
#define chmin(a,b) a=min((a),(b))
#define chmax(a,b) a=max((a),(b))
#define low(a,b) lower_bound(all(a),(b))-(a).begin()
#define upp(a,b) upper_bound(all(a),(b))-(a).begin()
#define endl '\n'
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0)
typedef long long ll;
typedef pair<int,int>pint;
typedef vector<int>vint;
typedef vector<vint> vvint;
typedef vector<pint>vpint;
typedef pair<pint,int> P1;
typedef pair<int,pint> P2;
typedef pair<pint,pint> PP;
static const ll maxLL = (ll)1 << 62;
const ll MOD=1000000007;
const ll INF=1e18;
int N,Q;
int s[100010];
int s1[100010];
int oddS[100010],evenS[100010];
vint v;
int X;
bool f(int c){
if(c>N)return false;
int a=(c+1)/2;
int aa=N-a;
int x=low(v,X-(v[aa]-X));
return (x+c<=N);
}
signed main() {
IOS();
//(1ll<<N)シフト演算のオーバーフローに気をつける
//MOD同士の引き算に注意
cin>>N>>Q;
v.resize(N);
rep(i,0,N){
cin>>v[i];
s[i+1]=v[i]+s[i];
if(N%2==0)s1[i+1]=s1[i]+(i%2)*v[i];
else s1[i+1]=s1[i]+(i%2==0)*v[i];
}
while(Q--){
cin>>X;
int r=0;
for(int i=20;i>=0;i--) {
if(f(r+(1<<i))) r+=1<<i;
}
if(r%2)r++;
//cout<<r<<endl;
int ans=s[N]-s[N-r/2];
if(r<N)ans+=s1[N-r];
cout<<ans<<endl;
}
return 0;
} |
p03158 | C++ | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define pb push_back
ll n, q;
ll a[100005];
vector< ll > v;
ll s[100005];
ll es[100005];
// fuck this problem man for real tho!
bool ok(ll x, ll len, ll rgt, ll bd)
{
if(len > ((n+1)/2)) return false;
if(len <= ((rgt+1)/2) ) return true;
if(len > rgt) return false;
ll nxt = n-1-len+1;
ll remm = len - (rgt-len);
bd -= remm;
//bd = n-1-len-len;
//if(bd == -2 && (n%2 == 1) && (len == ((n+1)/2))) return true;
if(bd < -1) return false;
//if(remm >= 2){
if(abs(x - v[bd+2]) <= abs(v[nxt] - x)) return true;
return false;
/*}else {
ll bdo = bd + remm;
ll tk = len - remm;
ll xx = bdo + tk;
//if(remm==0) xx--;
if(x - v[bdo] <= v[xx] - x) return false;
return true;
}*/
}
ll solve(ll x)
{
if(n==1) return x;
if(x >= v.back()) {
ll tot = s[n-1];
ll ret=0;
if(n%2 == 0) {
ret = es[n-2];
return tot - ret;
}else {
return es[n-1];
}
return 0;
}else if(x < v[0]) {
ll A = n/2;
return s[n-1] - s[A-1];
}
if(abs(v[n/2] - x) >= abs(x - v[0])) {
return s[n-1] - s[(n/2) - 1];
}
auto it = upper_bound(v.begin() , v.end(), x) - v.begin();
ll bd = it-1;
ll rgt = n - 1 - bd;
//if(rgt==1)
/*if((rgt+1)/2 >= (n+1)/2) {
return s[n-1] - s[(n/2) - 1];
}*/
ll lo = (rgt+1)/2;
lo=1;
ll hi = rgt;
//hi=min(hi , (n+1)/2 + 1);
while(hi > lo) {
ll mid = lo + (hi - lo + 1)/2;
//cout << mid << endl;
if(ok(x,mid,rgt, bd)) lo=mid;
else hi = mid-1;
//cout << lo << " **** " << hi << endl;
}
//cout << "**** " << ok(x,hi,rgt,bd) << endl;
//while(ok(x,hi+1,rgt,bd)==true) hi++;
//while(ok(x,hi,rgt,bd)==false) hi--;
//cout << bd << " " << hi << endl;
ll ret = s[n-1] - s[n-1-hi];
ll rem = hi - rgt + hi;
bd = bd - rem;
ll N = bd+1;
if(N%2 == 0) {
ret += (s[bd] - es[bd-1]);
}else {
ret += es[bd];
}
return ret;
}
int main()
{
cin >> n >> q;
for(ll i=1;i<=n;i++) {
cin >> a[i];
v.pb(a[i]);
s[i-1] = a[i];
if(i-1 > 0) s[i-1] += s[i-2];
}
es[0]=v[0];
for(ll i=2;i<n;i += 2) es[i] = v[i] + es[i-2];
while(q--) {
ll x;
cin >> x;
cout << solve(x) << "\n";
}
return 0;
}
|
p03158 | C++ | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define pb push_back
ll n, q;
ll a[100005];
vector< ll > v;
ll s[100005];
ll es[100005];
// fuck this problem man for real tho!
bool ok(ll x, ll len, ll rgt, ll bd)
{
if(len > ((n+1)/2)) return false;
if(len <= ((rgt+1)/2) ) return true;
if(len > rgt) return false;
ll nxt = n-1-len+1;
ll remm = len - (rgt-len);
bd -= remm;
bd = n-1-len-len;
//if(bd == -2 && (n%2 == 1) && (len == ((n+1)/2))) return true;
if(bd < -1) return false;
//if(remm >= 2){
if(abs(x - v[bd+2]) <= abs(v[nxt] - x)) return true;
return false;
/*}else {
ll bdo = bd + remm;
ll tk = len - remm;
ll xx = bdo + tk;
//if(remm==0) xx--;
if(x - v[bdo] <= v[xx] - x) return false;
return true;
}*/
}
ll solve(ll x)
{
if(n==1) return x;
if(x >= v.back()) {
ll tot = s[n-1];
ll ret=0;
if(n%2 == 0) {
ret = es[n-2];
return tot - ret;
}else {
return es[n-1];
}
return 0;
}else if(x < v[0]) {
ll A = n/2;
return s[n-1] - s[A-1];
}
if(abs(v[n/2] - x) >= abs(x - v[0])) {
return s[n-1] - s[(n/2) - 1];
}
auto it = upper_bound(v.begin() , v.end(), x) - v.begin();
ll bd = it-1;
ll rgt = n - 1 - bd;
//if(rgt==1)
/*if((rgt+1)/2 >= (n+1)/2) {
return s[n-1] - s[(n/2) - 1];
}*/
ll lo = (rgt+1)/2;
lo=1;
ll hi = rgt;
//hi=min(hi , (n+1)/2 + 1);
while(hi > lo) {
ll mid = lo + (hi - lo + 1)/2;
//cout << mid << endl;
if(ok(x,mid,rgt, bd)) lo=mid;
else hi = mid-1;
//cout << lo << " **** " << hi << endl;
}
//cout << "**** " << ok(x,hi,rgt,bd) << endl;
//while(ok(x,hi+1,rgt,bd)==true) hi++;
//while(ok(x,hi,rgt,bd)==false) hi--;
//cout << bd << " " << hi << endl;
ll ret = s[n-1] - s[n-1-hi];
ll rem = hi - rgt + hi;
bd = bd - rem;
ll N = bd+1;
if(N%2 == 0) {
ret += (s[bd] - es[bd-1]);
}else {
ret += es[bd];
}
return ret;
}
int main()
{
cin >> n >> q;
for(ll i=1;i<=n;i++) {
cin >> a[i];
v.pb(a[i]);
s[i-1] = a[i];
if(i-1 > 0) s[i-1] += s[i-2];
}
es[0]=v[0];
for(ll i=2;i<n;i += 2) es[i] = v[i] + es[i-2];
while(q--) {
ll x;
cin >> x;
cout << solve(x) << "\n";
}
return 0;
}
|
p03158 | C++ | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <string>
#include <sstream>
#include <complex>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#define REP(i,n) for (long long i=0;i<(n);i++)
#define FOR(i,a,b) for (long long i=(a);i<(b);i++)
#define RREP(i,n) for(long long i=n;i>=0;i--)
#define RFOR(i,a,b) for(long long i=(a);i>(b);i--)
#define dump1d_arr(array) REP(i,array.size()) cerr << #array << "[" << (i) << "] ==> " << (array[i]) << endl
#define dump2d_arr(array) REP(i,array.size()) REP(j,array[i].size()) cerr << #array << "[" << (i) << "]" << "[" << (j) << "] ==> " << (array[i][j]) << endl
#define dump(x) cerr << #x << " => " << (x) << endl
#define dumpP(p) cerr << "( " << p.first << " , " << p.second << " )" << ends
#define SORT(c) sort((c).begin(),(c).end())
#define MIN(vec) *min_element(vec.begin(), vec.end())
#define MAX(vec) *max_element(vec.begin(), vec.end())
#define UNIQ(vec) vec.erase(unique(vec.begin(), vec.end()),vec.end()) //ソートの必要あり
#define IN(n,m) (!(m.find(n) == m.end()))
#define ENUM(m) for (auto itr = m.begin(); itr != m.end(); ++itr)
#define dump_MAP(m) for(auto itr = m.begin(); itr != m.end(); ++itr) { cerr << itr->first << " --> " << itr->second << endl; }
#define FINDL(vec,x) (lower_bound(vec.begin(),vec.end(),x) - vec.begin())
#define FINDU(vec,x) (upper_bound(vec.begin(),vec.end(),x) - vec.begin())
#define ROUND(N) setprecision(N)
#define ROUND_PRINT(N,val) cout << fixed;cout << setprecision(N) << val << endl
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define INARR(h,w,x,y) (0 <= y && y < h && 0 <= x && x < w)
#define EQ(a,b) (abs(a - b) < 1e-10)
using namespace std;
constexpr int dx[4] = {0,1,0,-1};
constexpr int dy[4] = {1,0,-1,0};
constexpr long double pi = M_PI;
constexpr double eps = 1e-10;
constexpr long mod = 1000000007;
constexpr short shINF = 32767;
constexpr long loINF = 2147483647;
constexpr long long llINF = 9223372036854775807;
typedef long long LL;
typedef vector<LL> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<LL,LL> pr;
typedef vector<bool> VB;
typedef vector<pr> VP;
typedef priority_queue<pr,vector<pr>,greater<pr>> pq;
template<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P)
{ return s << '<' << P.first << ", " << P.second << '>'; }
template<class T> ostream& operator << (ostream &s, vector<T> P)
{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << " "; } s << P[i]; } return s; }
template<class T> ostream& operator << (ostream &s, vector<vector<T> > P)
{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }
int aokiGetNum(int mid,int x,vector<LL> &A){
int idx = FINDU(A,2*x-A[mid]);
if (A[idx-1] == 2*x-A[mid]) return mid - idx + 1;
else return (mid - idx);
}
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int 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];
vector<LL> accAll(N);
vector<LL> accOdd(1);
vector<LL> accEven(1);
accAll[0] = A[0];
accOdd[0] = A[0];
accEven[0] = A[1];
int tk_num = N % 2 == 0 ? N / 2 : N / 2 + 1;
REP(i,N-1) {
accAll[i+1] += accAll[i] + A[i+1];
if (i % 2 == 1 && i < (N-2))
accEven.push_back(accEven[i/2] + A[i+2]);
if (i % 2 == 0 && i < (N-2))
accOdd.push_back(accOdd[i/2] + A[i+2]);
}
/*
cout << accAll << endl;
cout << accOdd << endl;
cout << accEven << endl;
*/
REP(i,Q){
int ub = N-1;
int lb = 0;
while(abs(ub - lb) > 1) {
int mid = (ub+lb)/2;
if (aokiGetNum(mid,X[i],A) < (N-mid-1))
lb = mid;
else ub = mid;
}
if ( N - ub >= tk_num ) {
cout << accAll[N-1] - accAll[N-1-tk_num] << endl;
}
else {
int board = (N-1) - (N - ub)*2;
if (board % 2 == 0) {
cout << (accAll[N-1] - accAll[ub-1] + accOdd[board/2]) << endl;
}
else {
cout << (accAll[N-1] - accAll[ub-1] + accEven[board/2]) << endl;
}
}
}
}
|
p03158 | C++ | #include <iostream>
#include <algorithm>
using namespace std;
int main() {
int n, q;
cin >> n >> q;
int a[n+1];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
long long psr[n+2], ps2[n+1];
ps2[0] = 0, ps2[1] = a[1];
for (int i = 2; i <= n; i++) {
ps2[i] = ps2[i-2] + a[i];
}
psr[n+1] = 0;
for (int i = n; i > 0; i--) {
psr[i] = psr[i+1] + a[i];
}
for (int i = 0; i < q; i++) {
int x;
cin >> x;
int l = 1, r = n + 1;
while (r - l > 1) {
int mid = (l + r) / 2;
int l2 = 2 * mid - 1 - n;
int r2 = mid - 1;
if (l2 <= 1) {
l = mid;
} else if (a[l2-1] > x) {
r = mid;
} else if (a[r2] < x) {
l = mid;
} else if (x - a[l2-1] <= a[r2] - x) {
r = mid;
} else {
l = mid;
}
}
cout << psr[l] + (l * 2 - n - 2 > 0 ? ps2[l*2-n-2] : 0) << endl;
}
return 0;
}
|
p03158 | C++ | #include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
#define int long long
#define inf 1000000007
#define pa pair<int,int>
#define ll long long
#define pal pair<double,double>
#define ppap pair<pa,int>
#define PI 3.14159265358979323846
#define paa pair<int,char>
#define mp make_pair
#define pb push_back
#define EPS (1e-10)
int dx[8]={0,1,0,-1,1,1,-1,-1};
int dy[8]={1,0,-1,0,-1,1,1,-1};
using namespace std;
class pa3{
public:
int x;
int y,z;
pa3(int x=0,int y=0,int z=0):x(x),y(y),z(z) {}
bool operator < (const pa3 &p) const{
if(x!=p.x) return x<p.x;
if(y!=p.y) return y<p.y;
return z<p.z;
//return x != p.x ? x<p.x: y<p.y;
}
bool operator > (const pa3 &p) const{
if(x!=p.x) return x>p.x;
if(y!=p.y) return y>p.y;
return z>p.z;
//return x != p.x ? x<p.x: y<p.y;
}
bool operator == (const pa3 &p) const{
return x==p.x && y==p.y && z==p.z;
}
bool operator != (const pa3 &p) const{
return !( x==p.x && y==p.y && z==p.z);
}
};
class pa4{
public:
int x;
int y,z,w;
pa4(int x=0,int y=0,int z=0,int w=0):x(x),y(y),z(z),w(w) {}
bool operator < (const pa4 &p) const{
if(x!=p.x) return x<p.x;
if(y!=p.y) return y<p.y;
if(z!=p.z)return z<p.z;
return w<p.w;
//return x != p.x ? x<p.x: y<p.y;
}
bool operator > (const pa4 &p) const{
if(x!=p.x) return x>p.x;
if(y!=p.y) return y>p.y;
if(z!=p.z)return z>p.z;
return w>p.w;
//return x != p.x ? x<p.x: y<p.y;
}
bool operator == (const pa4 &p) const{
return x==p.x && y==p.y && z==p.z &&w==p.w;
}
};
class pa2{
public:
int x,y;
pa2(int x=0,int y=0):x(x),y(y) {}
pa2 operator + (pa2 p) {return pa2(x+p.x,y+p.y);}
pa2 operator - (pa2 p) {return pa2(x-p.x,y-p.y);}
bool operator < (const pa2 &p) const{
return y != p.y ? y<p.y: x<p.x;
}
bool operator > (const pa2 &p) const{
return x != p.x ? x<p.x: y<p.y;
}
bool operator == (const pa2 &p) const{
return abs(x-p.x)==0 && abs(y-p.y)==0;
}
bool operator != (const pa2 &p) const{
return !(abs(x-p.x)==0 && abs(y-p.y)==0);
}
};
/*
class Point{
public:
double x,y;
Point(double x=0,double y=0):x(x),y(y) {}
Point operator + (Point p) {return Point(x+p.x,y+p.y);}
Point operator - (Point p) {return Point(x-p.x,y-p.y);}
Point operator * (double a) {return Point(x*a,y*a);}
Point operator / (double a) {return Point(x/a,y/a);}
double absv() {return sqrt(norm());}
double norm() {return x*x+y*y;}
bool operator < (const Point &p) const{
return x != p.x ? x<p.x: y<p.y;
}
bool operator == (const Point &p) const{
return fabs(x-p.x)<EPS && fabs(y-p.y)<EPS;
}
};
typedef Point Vector;
#define pl pair<int,pas>
struct Segment{
Point p1,p2;
};
double dot(Vector a,Vector b){
return a.x*b.x+a.y*b.y;
}
double cross(Vector a,Vector b){
return a.x*b.y-a.y*b.x;
}
bool parareru(Point a,Point b,Point c,Point d){
// if(abs(cross(a-b,d-c))<EPS)cout<<"dd "<<cross(a-b,d-c)<<endl;
return abs(cross(a-b,d-c))<EPS;
}
double distance_ls_p(Point a, Point b, Point c) {
if ( dot(b-a, c-a) < EPS ) return (c-a).absv();
if ( dot(a-b, c-b) < EPS ) return (c-b).absv();
return abs(cross(b-a, c-a)) / (b-a).absv();
}
bool is_intersected_ls(Segment a,Segment b) {
if(a.p1==b.p1||a.p2==b.p1||a.p1==b.p2||a.p2==b.p2) return false;
if(parareru((a.p2),(a.p1),(a.p1),(b.p2))&¶reru((a.p2),(a.p1),(a.p1),(b.p1))){
// cout<<"sss"<<endl;
if(dot(a.p1-b.p1,a.p1-b.p2)<EPS) return true;
if(dot(a.p2-b.p1,a.p2-b.p2)<EPS) return true;
if(dot(a.p1-b.p1,a.p2-b.p1)<EPS) return true;
if(dot(a.p1-b.p2,a.p2-b.p2)<EPS) return true;
return false;
}
else return ( cross(a.p2-a.p1, b.p1-a.p1) * cross(a.p2-a.p1, b.p2-a.p1) < EPS ) && ( cross(b.p2-b.p1, a.p1-b.p1) * cross(b.p2-b.p1, a.p2-b.p1) < EPS );
}
double segment_dis(Segment a,Segment b){
if(is_intersected_ls(a,b))return 0;
double r=distance_ls_p(a.p1, a.p2, b.p1);
r=min(r,distance_ls_p(a.p1, a.p2, b.p2));
r=min(r,distance_ls_p(b.p1, b.p2, a.p2));
r=min(r,distance_ls_p(b.p1, b.p2, a.p1));
return r;
}
Point intersection_ls(Segment a, Segment b) {
Point ba = b.p2-b.p1;
double d1 = abs(cross(ba, a.p1-b.p1));
double d2 = abs(cross(ba, a.p2-b.p1));
double t = d1 / (d1 + d2);
return a.p1 + (a.p2-a.p1) * t;
}
*/
string itos( int i ) {
ostringstream s ;
s << i ;
return s.str() ;
}
int gcd(int v,int b){
if(v>b) return gcd(b,v);
if(v==b) return b;
if(b%v==0) return v;
return gcd(v,b%v);
}
double distans(double x1,double y1,double x2,double y2){
double rr=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);
return sqrt(rr);
}
int mod;
int extgcd(int a, int b, int &x, int &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
int d = extgcd(b, a%b, y, x);
y -= a/b * x;
return d;
}
pa operator+(const pa & l,const pa & r) {
return {l.first+r.first,l.second+r.second};
}
int pr[1200010];
int inv[1200010];
int beki(int wa,int rr,int warukazu){
if(rr==0) return 1%warukazu;
if(rr==1) return wa%warukazu;
wa%=warukazu;
if(rr%2==1) return ((ll)beki(wa,rr-1,warukazu)*(ll)wa)%warukazu;
ll zx=beki(wa,rr/2,warukazu);
return (zx*zx)%warukazu;
}
double bekid(double w,int r){
if(r==0) return 1.0;
if(r==1) return w;
if(r%2) return bekid(w,r-1)*w;
double f=bekid(w,r/2);
return f*f;
}
int comb(int nn,int rr){
int r=pr[nn]*inv[rr];
r%=mod;
r*=inv[nn-rr];
r%=mod;
return r;
}
void gya(int ert){
pr[0]=1;
for(int i=1;i<=ert;i++){
pr[i]=(pr[i-1]*i)%mod;
}
for(int i=0;i<=ert;i++) inv[i]=beki(pr[i],mod-2,mod);
}
// cin.tie(0);
// ios::sync_with_stdio(false);
//priority_queue<pa3,vector<pa3>,greater<pa3>> pq;
//sort(ve.begin(),ve.end(),greater<int>());
//----------------kokomade tenpure------------
vector<int> ve;
vector<int> rui;
vector<int> rui2;
int n;
int solve(int x){
if(abs(ve[n-1])<abs(ve[n-2])) return rui2[n-1];
int si=0,ue=n+1,me;
while(ue-si>1){
int me=(ue+si)/2;
bool ch;
if(me*2>n) ch=0;
else if (me==0) ch=1;
else{
if(abs(ve[n-me]-x)<abs(ve[n-2*me]-x)) ch=0;
else ch=1;
}
if(ch) si=me;
else ue=me;
}
me=si;
//cout<<si<<endl;
pa ta={n-si,n-1};
pa ao;
pa ao1={n-2*me,n-me-1};
pa ao2={n-2*me-1,n-me-2};
if(ao2.first<0){
ao=ao1;
}
else{
if(max(abs(ve[ao1.first]-x),abs(ve[ao1.second]-x)) < max(abs(ve[ao2.first]-x),abs(ve[ao2.second]-x)))ao=ao1;
else ao=ao2;
}
//cout<<ao1.first<<" "<<ao1.second<<endl;
//cout<<ao.first<<" "<<ao.second<<endl;
if(ao==ao1){
if(n-2*me>0)return rui[n-1]-rui[ta.first-1]+rui2[n-2*me-1];
else return rui[n-1]-rui[ta.first-1];
}
else{
if(n-2*me-3>=0)return rui[n-1]-rui[ta.first-2]+rui2[n-2*me-3];
else return rui[n-1]-rui[ta.first-2];
}
}
signed main(){
cin.tie(0);
ios::sync_with_stdio(false);
int q;
cin>>n>>q;
for(int i=0;i<n;i++){
int y;
cin>>y;
ve.pb(y);
}
rui.pb(ve[0]);
rui2.pb(ve[0]);
rui2.pb(ve[1]);
for(int i=1;i<n;i++)rui.pb(rui.back()+ve[i]);
for(int i=2;i<n;i++)rui2.pb(rui2[i-2]+ve[i]);
for(int er=0;er<q;er++){
int x;
cin>>x;
cout<<solve(x)<<endl;
}
return 0;
}
|
p03158 | C++ | #include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
//#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;
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; }
//---------------------------------------------------------------------------------------------------
/*---------------------------------------------------------------------------------------------------
∧＿∧
∧＿∧ （´<_｀ ） Welcome to My Coding Space!
（ ´_ゝ`） / ⌒i
／ ＼ | |
/ /￣￣￣￣/ |
＿_(__ﾆつ/ ＿/ .| .|＿＿＿＿
＼/＿＿＿＿/ （u ⊃
---------------------------------------------------------------------------------------------------*/
int N, Q, A[101010], X[101010];
//---------------------------------------------------------------------------------------------------
ll B[101010], takasm[101010];
void init() {
B[0] = A[0];
rep(i, 1, N) B[i] = B[i - 1] + A[i];
rep(i, 0, N) {
if (N % 2 == 1 and i % 2 == 0) takasm[i] = A[i];
if (N % 2 == 0 and i % 2 == 1) takasm[i] = A[i];
}
rep(i, 1, N) takasm[i] += takasm[i - 1];
}
ll get(int L, int R) {
ll res = B[R];
if (L) res -= B[L - 1];
return res;
}
//---------------------------------------------------------------------------------------------------
pair<int, int> f(int x, int len) {
int lft = lower_bound(A, A + N, x - len) - A;
int rht = upper_bound(A, A + N, x + len) - A - 1;
return { lft, rht };
}
//---------------------------------------------------------------------------------------------------
ll solve(int x) {
int ng = -1, ok = inf;
while (ng + 1 != ok) {
int md = (ng + ok) / 2;
auto p = f(x, md);
if (p.first > p.second) {
ng = md;
continue;
}
int len = p.second - p.first + 1;
if (N - 1 <= p.second + len) ok = md;
else ng = md;
}
int L, R;
tie(L, R) = f(x, ok);
int turn = R - L + 1;
int taka = N - R - 1;
int aoki = turn;
if (taka != aoki) {
R--;
aoki--;
turn--;
}
ll res = get(R + 1, N - 1);
if (L) res += takasm[L - 1];
return res;
}
//---------------------------------------------------------------------------------------------------
void _main() {
cin >> N >> Q;
rep(i, 0, N) cin >> A[i];
rep(i, 0, Q) cin >> X[i];
init();
rep(i, 0, Q) printf("%lld\n", solve(X[i]));
}
|
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<int(n);++i)
typedef long long ll;
int n;
vector<int> a;
// kを増やすべきかどうか
bool check(int x, int k){
if (n-k <= n/2) return false;
return abs(a[n-k*2-1]-x) <= abs(a[n-k-1]-x);
}
int main(void){
int q;
cin >> n >> q;
a.resize(n);
rep(i,n) cin >> a[i];
vector<ll> sum(n+1), t_sum(n+1);
rep(i,n){
sum[i+1] = sum[i] + a[i];
if (i % 2 != n % 2) {
t_sum[i+1] = t_sum[i] + a[i];
} else {
t_sum[i+1] = t_sum[i];
}
}
rep(_,q){
int x;
cin >> x;
int l = 0, r = n;
while (l + 1 < r) {
int m = (l+r)/2;
if (check(x, m)) l = m;
else r = m;
}
int k = r;
cout << sum[n]-sum[n-k] + t_sum[max(n-2*k,0)]<< endl;
}
return 0;
}
|
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define vvi vector<vector<int>>
#define vec vector
#define pq priority_queue
#define all(v) (v).begin(), (v).end()
#define uniqueV(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
#define rep(i, n) for (int (i) = (0); (i) < (n); ++(i))
#define repp(i, m, n) for (int (i) = (m); (i) < (n); ++(i))
#define dbg(x) cerr << #x << ": " << x << endl;
#define dbg2(x, y) cerr<<"("<<#x<<", "<<#y<<") = "<<"("<<x<<", "<<y<<")"<<endl;
#define dbg3(x, y, z) cerr<<"("<<#x<<", "<<#y<<", "<<#z<<") = "<<"("<<x<<", "<<y<<", "<<z<<")"<<endl;
#define dbgB(value, size) cerr<<#value<<": "<<bitset<size>(value) << endl;
#define line() cerr << "---------------" << endl;
const int dx[] = {1, -1, 0, 0};
const int dy[] = {0, 0, -1, 1};
const double PI = 3.14159265358979323846;
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>
void print1(T begin, T end) {
while (begin != end) {
cout << (*begin) << " ";
*begin++;
}
cout << endl;
}
template<typename T>
void print2(T Array, int height, int width) {
for (int i = 0; i < height; i++) {
for (int j = 0; j < width; j++) {
cout << " " << Array[i][j];
}
cout << endl;
}
}
// ------------------------------------------------------------------------------------------
int N, Q, A[100001];
int S[100001], Sdiv[100001];
pair<int, int> X[100000];
int ans[100000];
signed main() {
cin >> N >> Q;
for (int i = 1; i <= N; i++) {
cin >> A[i];
S[i] = S[i-1] + A[i];
Sdiv[i] = A[i];
if (i - 2 > 0) Sdiv[i] += Sdiv[i-2];
}
for (int i = 0; i < Q; i++) {
int x;
cin >> x;
X[i] = {x, i};
}
sort(X, X+Q);
int y = 1;
for (int q = 0; q < Q; q++) {
int x = X[q].first;
while (y <= N && A[y] < x) y++;
while (y <= N) {
int upper = N - y + 1;
int lower = y - (lower_bound(A, A+N+1, max(1LL, 2*x-A[y])) - A) + 1;
if (upper > lower) {
y++;
} else {
break;
}
}
int result = S[N] - S[y-1];
int t_first = N - (N - y + 1) * 2;
if (t_first > 0) result += Sdiv[t_first];
ans[X[q].second] = result;
}
for (int i = 0; i < Q; i++) {
cout << ans[i] << endl;
}
return 0;
} |
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<int(n);++i)
typedef long long ll;
int n;
vector<int> a;
// kを増やすべきかどうか
bool check(int x, int k){
if (n-k <= n/2) return false;
return abs(a[n-k*2-1]-x) <= abs(a[n-k-1]-x);
}
int main(void){
int q;
cin >> n >> q;
a.resize(n);
rep(i,n) cin >> a[i];
vector<ll> sum(n+1), t_sum(n+1);
rep(i,n){
sum[i+1] = sum[i] + a[i];
if (i % 2 != n % 2) {
t_sum[i+1] = t_sum[i] + a[i];
} else {
t_sum[i+1] = t_sum[i];
}
}
rep(_,q){
int x;
cin >> x;
int l = 0, r = 1e9;
while (l + 1 < r) {
int m = (l+r)/2;
if (check(x, m)) l = m;
else r = m;
}
int k = r;
cout << sum[n]-sum[n-k] + t_sum[max(n-2*k,0)]<< endl;
}
return 0;
}
|
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<int(n);++i)
typedef long long ll;
int n;
vector<int> a;
// kを増やすべきかどうか
bool check(int x, int k){
if (n-k <= n/2) return false;
if (n-k*2-1 < 0) return false;
return abs(a[n-k*2-1]-x) <= abs(a[n-k-1]-x);
}
int main(void){
int q;
cin >> n >> q;
a.resize(n);
rep(i,n) cin >> a[i];
vector<ll> sum(n+1), t_sum(n+1);
rep(i,n){
sum[i+1] = sum[i] + a[i];
if (i % 2 != n % 2) {
t_sum[i+1] = t_sum[i] + a[i];
} else {
t_sum[i+1] = t_sum[i];
}
}
rep(_,q){
int x;
cin >> x;
int l = 0, r = 1e9;
while (l + 1 < r) {
int m = (l+r)/2;
if (check(x, m)) l = m;
else r = m;
}
int k = r;
cout << sum[n]-sum[n-k] + t_sum[max(n-2*k,0)]<< endl;
}
return 0;
}
|
p03158 | C++ | #include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<int(n);++i)
#define all(a) (a).begin(),(a).end()
typedef long long ll;
#define rep1(i,n) for(int i=1;i<=int(n);++i)
#define lb(s,x) int(lower_bound(all(s),x)-s.begin())
#define ub(s,x) int(upper_bound(all(s),x)-s.begin())
#define uniq(a) a.erase(unique(all(a)),a.end())
#define bit(k) (1LL<<(k))
const int INF = 1e9;
#define debug(x) cerr<<(#x)<<": "<<(x)<<endl
template<class T,class U>
ostream& operator<<(ostream& o, const pair<T,U> &p){
o<<"("<<p.first<<", "<<p.second<<")";
return o;
}
#define print(v) { cerr<<#v<<": [ "; for(auto _ : v) cerr<<_<<", "; cerr<<"]"<<endl; }
int n;
vector<int> a;
// kを増やすべきかどうか
bool check(int x, int k){
if (n-k <= n/2) return false;
if (n-k*2-1 < 0) return false;
return abs(a[n-k*2-1]-x) <= abs(a[n-k-1]-x);
}
int main(void){
int q;
cin >> n >> q;
a.resize(n);
rep(i,n) cin >> a[i];
vector<ll> sum(n+1), t_sum(n+1);
rep(i,n){
sum[i+1] = sum[i] + a[i];
if (i % 2 != n % 2) {
t_sum[i+1] = t_sum[i] + a[i];
} else {
t_sum[i+1] = t_sum[i];
}
}
rep(_,q){
int x;
cin >> x;
int l = 0, r = 1e9;
while (l + 1 < r) {
int m = (l+r)/2;
if (check(x, m)) l = m;
else r = m;
}
int k = r;
// debug(x);
// debug(k);
// int lob = lb(a,x-l), upb = ub(a,x+l);
// int k = upb - lob;
// int m = min(n-k, upb);
cout << sum[n]-sum[n-k] + t_sum[max(n-2*k,0)]<< endl;
}
return 0;
}
|
p03158 | C++ | #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAX=1e6+5;
ll n,m,x;
ll a[MAX];
ll sum[2][MAX];
ll pre[MAX];
int main()
{
while(cin>>n>>m)
{
for(int i=1;i<=n;i++)scanf("%lld",&a[i]);
sort(a+1,a+1+n);
for(int i=1;i<=n;i++)
{
pre[i]=pre[i-1]+a[i];
sum[i%2][i]=a[i];
sum[0][i]+=sum[0][i-1];
sum[1][i]+=sum[1][i-1];
}
while(m--)
{
scanf("%lld",&x);
ll l=1,r=n,mid;
while(l<r)
{
mid=(l+r)>>1;
ll j=mid-(n-mid);//second的最左端
if(j<1||a[mid]-x<x-a[j])l=mid+1;
else r=mid;
}
ll en=r-(n-r);
// cout<<"::: "<<en<<" "<<r<<endl;
ll ans=pre[n]-pre[r-1];
ans+=sum[en%2][en-1];
printf("%lld\n",ans);
}
}
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.