結果
| 問題 |
No.3367 Looks like a convolution
|
| コンテスト | |
| ユーザー |
 tute7627
|
| 提出日時 | 2025-11-17 21:16:03 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 1,673 ms / 2,000 ms |
| コード長 | 19,178 bytes |
| コンパイル時間 | 3,127 ms |
| コンパイル使用メモリ | 229,248 KB |
| 実行使用メモリ | 108,404 KB |
| 最終ジャッジ日時 | 2025-11-17 21:16:45 |
| 合計ジャッジ時間 | 24,809 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 33 |
ソースコード
//#define _GLIBCXX_DEBUG
//#pragma GCC target("avx2")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <debug_print.hpp>
#define OUT(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#define OUT(...) (static_cast<void>(0))
#endif
#define endl '\n'
#define lfs cout<<fixed<<setprecision(15)
#define ALL(a) (a).begin(),(a).end()
#define ALLR(a) (a).rbegin(),(a).rend()
#define UNIQUE(a) (a).erase(unique((a).begin(),(a).end()),(a).end())
#define spa << " " <<
#define fi first
#define se second
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define EB emplace_back
#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)
#define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--)
namespace template_tute{
using ll = long long;
using ld = long double;
const ll MOD1 = 1e9+7;
const ll MOD9 = 998244353;
const ll INF = 4.1e18;
using P = pair<ll, ll>;
template<typename T> using PQ = priority_queue<T>;
template<typename T> using QP = priority_queue<T,vector<T>,greater<T>>;
template<typename T1, typename T2>bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}
template<typename T1, typename T2>bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}
ll median(ll a,ll b, ll c){return a+b+c-max<ll>({a,b,c})-min<ll>({a,b,c});}
void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}
void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;}
void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;}
template<typename T1,typename T2>void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;}
template<typename T1,typename T2,typename T3>void anss(T1 x,T2 y,T3 z){ans(x!=y,x,z);};
template<typename T>void debug(const T &v,ll h,ll w,string sv=" "){for(ll i=0;i<h;i++){cout<<v[i][0];for(ll j=1;j<w;j++)cout<<sv<<v[i][j];cout<<endl;}};
template<typename T>void debug(const T &v,ll n,string sv=" "){if(n!=0)cout<<v[0];for(ll i=1;i<n;i++)cout<<sv<<v[i];cout<<endl;};
template<typename T>void debug(const vector<T>&v){debug(v,v.size());}
template<typename T>void debug(const vector<vector<T>>&v){for(auto &vv:v)debug(vv,vv.size());}
template<typename T>void debug(stack<T> st){while(!st.empty()){cout<<st.top()<<" ";st.pop();}cout<<endl;}
template<typename T>void debug(queue<T> st){while(!st.empty()){cout<<st.front()<<" ";st.pop();}cout<<endl;}
template<typename T>void debug(deque<T> st){while(!st.empty()){cout<<st.front()<<" ";st.pop_front();}cout<<endl;}
template<typename T>void debug(PQ<T> st){while(!st.empty()){cout<<st.top()<<" ";st.pop();}cout<<endl;}
template<typename T>void debug(QP<T> st){while(!st.empty()){cout<<st.top()<<" ";st.pop();}cout<<endl;}
template<typename T>void debug(const set<T>&v){for(auto z:v)cout<<z<<" ";cout<<endl;}
template<typename T>void debug(const multiset<T>&v){for(auto z:v)cout<<z<<" ";cout<<endl;}
template<typename T,size_t size>void debug(const array<T, size> &a){for(auto z:a)cout<<z<<" ";cout<<endl;}
template<typename T,typename V>void debug(const map<T,V>&v){for(auto z:v)cout<<"["<<z.first<<"]="<<z.second<<",";cout<<endl;}
template<typename T>vector<vector<T>>vec(ll x, ll y, T w){vector<vector<T>>v(x,vector<T>(y,w));return v;}
vector<ll>dx={1,-1,0,0,1,1,-1,-1};vector<ll>dy={0,0,1,-1,1,-1,1,-1};
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...));}
template<typename T1, typename T2>ostream &operator<<(ostream &os, const pair<T1, T2>&p){return os << "(" << p.first << "," << p.second << ")";}
template<typename T>ostream &operator<<(ostream &os, const vector<T> &v){os<<"[";for(auto &z:v)os << z << ",";os<<"]"; return os;}
template<typename T>void rearrange(vector<int>&ord, vector<T>&v){
auto tmp = v;
for(int i=0;i<tmp.size();i++)v[i] = tmp[ord[i]];
}
template<typename Head, typename... Tail>void rearrange(vector<int>&ord,Head&& head, Tail&&... tail){
rearrange(ord, head);
rearrange(ord, tail...);
}
template<typename T> vector<int> ascend(const vector<T>&v){
vector<int>ord(v.size());iota(ord.begin(),ord.end(),0);
sort(ord.begin(),ord.end(),[&](int i,int j){return make_pair(v[i],i)<make_pair(v[j],j);});
return ord;
}
template<typename T> vector<int> descend(const vector<T>&v){
vector<int>ord(v.size());iota(ord.begin(),ord.end(),0);
sort(ord.begin(),ord.end(),[&](int i,int j){return make_pair(v[i],-i)>make_pair(v[j],-j);});
return ord;
}
template<typename T> vector<T> inv_perm(const vector<T>&ord){
vector<T>inv(ord.size());
for(int i=0;i<ord.size();i++)inv[ord[i]] = i;
return inv;
}
ll FLOOR(ll n,ll div){assert(div>0);return n>=0?n/div:(n-div+1)/div;}
ll CEIL(ll n,ll div){assert(div>0);return n>=0?(n+div-1)/div:n/div;}
ll digitsum(ll n){ll ret=0;while(n){ret+=n%10;n/=10;}return ret;}
ll modulo(ll n,ll d){return (n%d+d)%d;};
template<typename T>T min(const vector<T>&v){return *min_element(v.begin(),v.end());}
template<typename T>T max(const vector<T>&v){return *max_element(v.begin(),v.end());}
template<typename T>T acc(const vector<T>&v){return accumulate(v.begin(),v.end(),T(0));};
template<typename T>T reverse(const T &v){return T(v.rbegin(),v.rend());};
//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());
int popcount(ll x){return __builtin_popcountll(x);};
int poplow(ll x){return __builtin_ctzll(x);};
int pophigh(ll x){return 63 - __builtin_clzll(x);};
template<typename T>T poll(queue<T> &q){auto ret=q.front();q.pop();return ret;};
template<typename T>T poll(priority_queue<T> &q){auto ret=q.top();q.pop();return ret;};
template<typename T>T poll(QP<T> &q){auto ret=q.top();q.pop();return ret;};
template<typename T>T poll(stack<T> &s){auto ret=s.top();s.pop();return ret;};
ll MULT(ll x,ll y){if(LLONG_MAX/x<=y)return LLONG_MAX;return x*y;}
ll POW2(ll x, ll k){ll ret=1,mul=x;while(k){if(mul==LLONG_MAX)return LLONG_MAX;if(k&1)ret=MULT(ret,mul);mul=MULT(mul,mul);k>>=1;}return ret;}
ll POW(ll x, ll k){ll ret=1;for(int i=0;i<k;i++){if(LLONG_MAX/x<=ret)return LLONG_MAX;ret*=x;}return ret;}
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::end(buffer);
do {
--d;
*d = "0123456789"[tmp % 10];
tmp /= 10;
} while (tmp != 0);
if (value < 0) {
--d;
*d = '-';
}
int len = std::end(buffer) - d;
if (dest.rdbuf()->sputn(d, len) != len) {
dest.setstate(std::ios_base::badbit);
}
}
return dest;
}
namespace converter{
int dict[500];
const string lower="abcdefghijklmnopqrstuvwxyz";
const string upper="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string digit="0123456789";
const string digit1="123456789";
void regi_str(const string &t){
for(int i=0;i<t.size();i++){
dict[t[i]]=i;
}
}
void regi_int(const string &t){
for(int i=0;i<t.size();i++){
dict[i]=t[i];
}
}
vector<int>to_int(const string &s,const string &t){
regi_str(t);
vector<int>ret(s.size());
for(int i=0;i<s.size();i++){
ret[i]=dict[s[i]];
}
return ret;
}
vector<int>input(const string &t){
string s;cin>>s;
return to_int(s,t);
}
vector<int>to_int(const string &s){
auto t=s;
sort(t.begin(),t.end());
t.erase(unique(t.begin(),t.end()),t.end());
return to_int(s,t);
}
vector<int>input(){
string s;cin>>s;
return to_int(s);
}
vector<vector<int>>to_int(const vector<string>&s,const string &t){
regi_str(t);
vector<vector<int>>ret(s.size(),vector<int>(s[0].size()));
for(int i=0;i<s.size();i++){
for(int j=0;j<s[0].size();j++){
ret[i][j]=dict[s[i][j]];
}
}
return ret;
}
vector<vector<int>>input(int h,const string &t){
vector<string>s(h);for(int i=0;i<h;i++)cin>>s[i];
return to_int(s,t);
}
vector<vector<int>>to_int(const vector<string>&s){
string t;
for(int i=0;i<s.size();i++){
t+=s[i];
}
sort(t.begin(),t.end());t.erase(unique(t.begin(),t.end()),t.end());
return to_int(s,t);
}
vector<vector<int>>input(int h){
vector<string>s(h);for(int i=0;i<h;i++)cin>>s[i];
return to_int(s);
}
string to_str(const vector<int>&s,const string &t){
regi_int(t);
string ret;
for(auto z:s)ret+=dict[z];
return ret;
}
vector<string> to_str(const vector<vector<int>>&s,const string &t){
regi_int(t);
vector<string>ret(s.size());
for(int i=0;i<s.size();i++){
for(auto z:s[i])ret[i]+=dict[z];
}
return ret;
}
}
template< typename T = int >
struct edge {
int to;
T cost;
int id;
edge():to(-1),id(-1){};
edge(int to, T cost = 1, int id = -1):to(to), cost(cost), id(id){}
operator int() const { return to; }
};
template<typename T>
using Graph = vector<vector<edge<T>>>;
template<typename T>
Graph<T>revgraph(const Graph<T> &g){
Graph<T>ret(g.size());
for(int i=0;i<g.size();i++){
for(auto e:g[i]){
int to = e.to;
e.to = i;
ret[to].push_back(e);
}
}
return ret;
}
template<typename T>
Graph<T> readGraph(int n,int m,int indexed=1,bool directed=false,bool weighted=false){
Graph<T> ret(n);
for(int es = 0; es < m; es++){
int u,v;
T w=1;
cin>>u>>v;u-=indexed,v-=indexed;
if(weighted)cin>>w;
ret[u].emplace_back(v,w,es);
if(!directed)ret[v].emplace_back(u,w,es);
}
return ret;
}
template<typename T>
Graph<T> readParent(int n,int indexed=1,bool directed=true){
Graph<T>ret(n);
for(int i=1;i<n;i++){
int p;cin>>p;
p-=indexed;
ret[p].emplace_back(i);
if(!directed)ret[i].emplace_back(p);
}
return ret;
}
}
using namespace template_tute;
struct SegmentTreeBeats {
static const long long INF = 1LL << 60;
struct Node {
Node *left, *right;
long long max_v, smax_v, max_c;
long long min_v, smin_v, min_c;
long long sum;
long long len, ladd, lval;
Node() : left(0), right(0), ladd(0), lval(INF) {}
void init(long long x) {
max_v = min_v = sum = x;
smax_v = -INF; smin_v = INF;
max_c = min_c = 1;
}
void init_empty() {
max_v = smax_v = -INF;
min_v = smin_v = INF;
max_c = min_c = 0;
}
void update_max(long long x) {
sum += (x - max_v) * max_c;
/* */if (max_v == min_v) max_v = min_v = x;
else if (max_v == smin_v) max_v = smin_v = x;
else max_v = x;
if (lval != INF and x < lval) lval = x;
}
void update_min(long long x) {
sum += (x - min_v) * min_c;
/* */if (max_v == min_v) max_v = min_v = x;
else if (max_v == smin_v) min_v = smax_v = x;
else min_v = x;
if (lval != INF and lval < x) lval = x;
}
void addall(long long x) {
max_v += x;
if (smax_v != -INF) smax_v += x;
min_v += x;
if (smin_v != INF) smin_v += x;
sum += len * x;
if (lval != INF) lval += x;
else ladd += x;
}
void updateall(long long x) {
max_v = min_v = x;
smax_v = -INF; smin_v = INF;
max_c = min_c = len;
sum = len * x;
lval = x; ladd = 0;
}
void push() {
if (lval != INF) {
left -> updateall(lval);
right -> updateall(lval);
lval = INF;
return;
}
if (ladd != 0) {
left -> addall(ladd);
right -> addall(ladd);
ladd = 0;
}
if (max_v < left -> max_v) left -> update_max(max_v);
if (left -> min_v < min_v) left -> update_min(min_v);
if (max_v < right -> max_v) right -> update_max(max_v);
if (right -> min_v < min_v) right -> update_min(min_v);
}
void update() {
sum = left -> sum + right -> sum;
if (left -> max_v < right -> max_v) {
max_v = right -> max_v;
max_c = right -> max_c;
smax_v = max(left -> max_v, right -> smax_v);
} else if (left -> max_v > right -> max_v) {
max_v = left -> max_v;
max_c = left -> max_c;
smax_v = max(left -> smax_v, right -> max_v);
} else {
max_v = left -> max_v;
max_c = left -> max_c + right -> max_c;
smax_v = max(left -> smax_v, right -> smax_v);
}
if (left -> min_v < right -> min_v) {
min_v = left -> min_v;
min_c = left -> min_c;
smin_v = min(left -> smin_v, right -> min_v);
} else if (left -> min_v > right -> min_v) {
min_v = right -> min_v;
min_c = right -> min_c;
smin_v = min(left -> min_v, right -> smin_v);
} else {
min_v = left -> min_v;
min_c = left -> min_c + right -> min_c;
smin_v = min(left -> smin_v, right -> smin_v);
}
}
};
int n, n0;
Node *root;
void _update_min(long long x, int a, int b, Node *nd, int l, int r) {
if (b <= l || r <= a || nd -> max_v <= x) return;
if (a <= l && r <= b && nd -> smax_v < x) {
nd -> update_max(x);
return;
}
nd -> push();
_update_min(x, a, b, nd -> left, l, (l + r) >> 1);
_update_min(x, a, b, nd -> right, (l + r) >> 1, r);
nd -> update();
}
void _update_max(long long x, int a, int b, Node *nd, int l, int r) {
if (b <= l || r <= a || x <= nd -> min_v) return;
if (a <= l && r <= b && x < nd -> smin_v) {
nd -> update_min(x);
return;
}
nd -> push();
_update_max(x, a, b, nd -> left, l, (l + r) >> 1);
_update_max(x, a, b, nd -> right, (l + r) >> 1, r);
nd -> update();
}
void _add_val(long long x, int a, int b, Node *nd, int l, int r) {
if (b <= l || r <= a) return;
if (a <= l && r <= b) {
nd -> addall(x);
return;
}
nd -> push();
_add_val(x, a, b, nd -> left, l, (l + r) >> 1);
_add_val(x, a, b, nd -> right, (l + r) >> 1, r);
nd -> update();
}
void _update_val(long long x, int a, int b, Node *nd, int l, int r) {
if (b <= l || r <= a) return;
if (a <= l && r <= b) {
nd -> updateall(x);
return;
}
nd -> push();
_update_val(x, a, b, nd -> left, l, (l + r) >> 1);
_update_val(x, a, b, nd -> right, (l + r) >> 1, r);
nd -> update();
}
long long _query_max(int a, int b, Node *nd, int l, int r) {
if (b <= l || r <= a) return -INF;
if (a <= l && r <= b) return nd -> max_v;
nd -> push();
long long lv = _query_max(a, b, nd -> left, l, (l + r) >> 1);
long long rv = _query_max(a, b, nd -> right, (l + r) >> 1, r);
return max(lv, rv);
}
long long _query_min(int a, int b, Node *nd, int l, int r) {
if (b <= l || r <= a) return INF;
if (a <= l && r <= b) return nd -> min_v;
nd -> push();
long long lv = _query_min(a, b, nd -> left, l, (l + r) >> 1);
long long rv = _query_min(a, b, nd -> right, (l + r) >> 1, r);
return min(lv, rv);
}
long long _query_sum(int a, int b, Node *nd, int l, int r) {
if (b <= l || r <= a) return 0;
if (a <= l && r <= b) return nd -> sum;
nd -> push();
long long lv = _query_sum(a, b, nd -> left, l, (l + r) >> 1);
long long rv = _query_sum(a, b, nd -> right, (l + r) >> 1, r);
return lv + rv;
}
SegmentTreeBeats(int n, long long val = 0) : n(n) {
n0 = 1; while (n0 < n) n0 <<= 1;
Node *nds = new Node[2 * n0];
root = nds;
nds[0].len = n0;
for (int i = 0; i < n0 - 1; ++i) {
nds[i].left = &nds[2 * i + 1];
nds[i].right = &nds[2 * i + 2];
nds[2 * i + 1].len = nds[2 * i + 2].len = nds[i].len >> 1;
}
for (int i = 0; i < n; ++i) nds[n0 - 1 + i].init(val);
for (int i = n; i < n0; ++i) nds[n0 - 1 + i].init_empty();
for (int i = n0 - 2; i >= 0; i--) nds[i].update();
}
SegmentTreeBeats(vector<long long> a) : n(a.size()) {
n0 = 1; while (n0 < n) n0 <<= 1;
Node *nds = new Node[2 * n0];
root = nds;
nds[0].len = n0;
for (int i = 0; i < n0 - 1; ++i) {
nds[i].left = &nds[2 * i + 1];
nds[i].right = &nds[2 * i + 2];
nds[2 * i + 1].len = nds[2 * i + 2].len = nds[i].len >> 1;
}
for (int i = 0; i < n; ++i) nds[n0 - 1 + i].init(a[i]);
for (int i = n; i < n0; ++i) nds[n0 - 1 + i].init_empty();
for (int i = n0 - 2; i >= 0; i--) nds[i].update();
}
void update_min(int a, int b, long long x) { _update_min(x, a, b, root, 0, n0); }
void update_max(int a, int b, long long x) { _update_max(x, a, b, root, 0, n0); }
void add_val(int a, int b, long long x) { _add_val(x, a, b, root, 0, n0); }
void update_val(int a, int b, long long x) { _update_val(x, a, b, root, 0, n0); }
long long query_max(int a, int b) { return _query_max(a, b, root, 0, n0); }
long long query_min(int a, int b) { return _query_min(a, b, root, 0, n0); }
long long query_sum(int a, int b) { return _query_sum(a, b, root, 0, n0); }
void print(){
for(int i=0;i<n;i++)cout<<query_sum(i,i+1)<<" ";cout<<endl;
}
};
void solve(){
ll res=0,buf=0;
bool judge = true;
ll n;cin>>n;
vector<ll>a(n);
rep(i,0,n)cin>>a[i];
vector<ll>b(n);
rep(i,0,n)cin>>b[i];
SegmentTreeBeats sa(a);
SegmentTreeBeats sb(b);
vector<ll>ret;
rep(i,0,n){
sa.update_min(0,i+1,a[i]);
sb.update_min(0,i+1,b[i]);
ll ok=-1,ng=i+1;
while(ng-ok>=2){
ll mid=(ok+ng)/2;
if(sa.query_max(mid,mid+1)<sb.query_max(i-mid,i-mid+1)){
ok=mid;
}
else{
ng=mid;
}
}
//0..okはsa担当
ll va=sa.query_sum(0,ok+1);
ll vb=sb.query_sum(0,i-ok);
ret.PB(va+vb);
}
debug(ret);
}
int main(){
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
ll res=0,buf=0;
bool judge = true;
int T = 1;
//cin>>T;
while(T--){
solve();
}
return 0;
}