結果
問題 | No.1394 Changing Problems |
ユーザー |
![]() |
提出日時 | 2021-02-12 23:19:37 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 5,508 bytes |
コンパイル時間 | 2,037 ms |
コンパイル使用メモリ | 144,136 KB |
最終ジャッジ日時 | 2025-01-18 19:50:22 |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | WA * 3 |
other | AC * 1 WA * 27 RE * 1 |
ソースコード
#include <string>#include <vector>#include<iostream>#include<cstdio>#include<cstdlib>#include<stack>#include<queue>#include<cmath>#include<algorithm>#include<functional>#include<list>#include<deque>#include<bitset>#include<set>#include<map>#include<unordered_map>#include<unordered_set>#include<cstring>#include<sstream>#include<complex>#include<iomanip>#include<numeric>#include<cassert>#include<random>#define X first#define Y second#define pb push_back#define rep(X,Y) for (int (X) = 0;(X) < (int)(Y);++(X))#define reps(X,S,Y) for (int (X) = (int)(S);(X) < (int)(Y);++(X))#define rrep(X,Y) for (int (X) = (int)(Y)-1;(X) >=0;--(X))#define rreps(X,S,Y) for (int (X) = (int)(Y)-1;(X) >= (int)(S);--(X))#define repe(X,Y) for ((X) = 0;(X) < (Y);++(X))#define peat(X,Y) for (;(X) < (Y);++(X))#define all(X) (X).begin(),(X).end()#define rall(X) (X).rbegin(),(X).rend()#define eb emplace_back#define UNIQUE(X) (X).erase(unique(all(X)),(X).end())#define Endl endl#define NL <<"\n"#define cauto const autousing namespace std;using ll=long long;using pii=pair<int,int>;using pll=pair<ll,ll>;template<class T> using vv=vector<vector<T>>;template<class T> inline bool MX(T &l,const T &r){return l<r?l=r,1:0;}template<class T> inline bool MN(T &l,const T &r){return l>r?l=r,1:0;}//#undef NUIP#ifdef NUIP#include "benri.h"#else#define out(args...)#endifvoid ouT(ll x,int d=3){auto re=to_string(x);if((int)re.size()>d) re=x>0?"oo":"-oo";cout<<string(d-re.size(),' ')<<re<<",";}#ifdef __cpp_init_capturestemplate<typename T>vector<T> table(int n, T v){ return vector<T>(n, v);}template <class... Args> auto table(int n, Args... args){auto val = table(args...); return vector<decltype(val)>(n, move(val));}#endiftemplate<class A,class B> pair<A,B> operator+(const pair<A,B> &p,const pair<A,B> &q){ return {p.X+q.X,p.Y+q.Y};}template<class A,class B,class C,class D> pair<A,B>& operator+=(pair<A,B> &p,const pair<C,D> &q){ p.X+=q.X; p.Y+=q.Y; return p;}template<class A,class B> pair<A,B> operator-(const pair<A,B> &p,const pair<A,B> &q){ return {p.X-q.X,p.Y-q.Y};}template<class A,class B,class C,class D> pair<A,B>& operator-=(pair<A,B> &p,const pair<C,D> &q){ p.X-=q.X; p.Y-=q.Y; return p;}template<class A,class B> istream& operator>>(istream &is, pair<A,B> &p){ is>>p.X>>p.Y; return is;}template<class T=ll> T read(){ T re; cin>>re; return move(re);}template<class T=ll> T read(const T &dec){ T re; cin>>re; return re-dec;}template<class T=ll> vector<T> readV(const int sz){ vector<T> re(sz); for(auto &x:re) x=read<T>(); return move(re);}template<class T=ll> vector<T> readV(const int sz, const T &dec){ vector<T> re(sz); for(auto &x:re) x=read<T>(dec); return move(re);}vv<int> readG(const int &n,const int &m){ vv<int> g(n); rep(_,m){ cauto a=read<int>(1),b=read<int>(1); g[a].pb(b); g[b].pb(a);} return move(g);}vv<int> readG(const int &n){ return readG(n,n-1);}#define TT cauto TTT=read();rep(_,TTT)const ll MOD=1e9+7; //998244353;struct Seg{ll v;int c=0;Seg(ll d=0,int t=0):v(d),c(t){}static Seg e;};Seg Seg::e=Seg();Seg operator+(const Seg &l,const Seg &r){return Seg(l.v+r.v,l.c+r.c);}template<class SegTree>struct SegTreeUpdater{SegTree *st;int i;SegTreeUpdater(SegTree *st,int i):st(st),i(i){}template<class Seg> void operator+=(const Seg &seg){ st->add(i,seg);}template<class Seg> void operator=(const Seg &seg){ st->assign(i,seg);}};template<class Seg>struct SegTree{vector<Seg> segs;void add(int k,Seg a){k+=segs.size()/2-1;segs[k]=segs[k]+a;upd(k);}void assign(int k,Seg a){k+=segs.size()/2-1;segs[k]=a;upd(k);}void upd(int k){while(k>0){k=(k-1)/2;segs[k]=segs[k*2+1]+segs[k*2+2];}}void upd(){ rrep(k,segs.size()/2-1) segs[k]=segs[k*2+1]+segs[k*2+2];}//(l,r,0,0,nn)template<class T=Seg> T query(int a,int b,int k,int l,int r){if(r<=a || b<=l)return T::e;if(a<=l && r<=b) return segs[k];T lv=query(a,b,k*2+1,l,(l+r)/2) ,rv= query(a,b,k*2+2,(l+r)/2,r);return lv+rv;}SegTree(int n){int pw=1;while(pw<n) pw*=2;segs.resize(2*pw);}SegTreeUpdater<SegTree<Seg>> operator[](int i){ return {this,i};}Seg operator()(int l,int r){ return query(max(0,l),min((int)segs.size()/2,r),0,0,segs.size()/2);};Seg& operator()(int i){ return segs[segs.size()/2-1+i];}Seg operator()(){ return segs[0];}Seg rb(int r){ return operator()(0,r); }Seg lb(int l){ return operator()(l,segs.size()/2); }};// ��Ƶ�// https://lorent-kyopro.hatenablog.com/entry/2020/08/18/040229int main(){ios_base::sync_with_stdio(false); cin.tie(0);cout<<fixed<<setprecision(0);cauto n=read();auto as=readV(n);cauto q=read();cauto qs=readV<pii>(q,{1,0});ll sum=accumulate(all(as),0ll);multiset<int> mx(all(as));SegTree<Seg> st(n);for(cauto a:as){cauto x=((n-2-a)%(n-1)+n-1)%(n-1);st[x]+=Seg(x,1);}for(cauto [i,x]:qs){sum-=as[i];mx.erase(mx.find(as[i]));{cauto x=((n-2-as[i])%(n-1)+n-1)%(n-1);st[x]+=Seg(-x,-1);}as[i]=x;sum+=as[i];mx.emplace(as[i]);{cauto x=((n-2-as[i])%(n-1)+n-1)%(n-1);st[x]+=Seg(x,1);}if(*mx.rbegin()<=n-2){cout<<0 NL;continue;}ll l=0,r=1e15;while(r-l>1){cauto m=(l+r)/2;if(n-2+m-*mx.rbegin()<0){ l=m; continue;}cauto k=m%(n-1);auto t=sum;cauto segr=st(n-1-k,n-1);t-=segr.v-segr.c*(n-1ll-k);cauto segl=st(0,n-1-k);t-=segl.v+segl.c*k;(t/(n-1)>=m?r:l)=m;}cout<<r NL;}return 0;}