結果
| 問題 |
No.2650 [Cherry 6th Tune *] セイジャク
|
| コンテスト | |
| ユーザー |
 AD010
|
| 提出日時 | 2024-02-23 23:48:07 |
| 言語 | C++17(clang) (17.0.6 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 382 ms / 2,500 ms |
| コード長 | 8,228 bytes |
| コンパイル時間 | 2,311 ms |
| コンパイル使用メモリ | 155,504 KB |
| 実行使用メモリ | 15,104 KB |
| 最終ジャッジ日時 | 2024-09-29 09:15:08 |
| 合計ジャッジ時間 | 12,899 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 31 |
ソースコード
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <deque> // deque
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <math.h>
#include <cmath>
#include <climits>
#include <functional>
#include <iomanip>
#include <limits>
#include <cassert>
#include <random>
#include <complex>
#include <numeric>
#include <regex>
#include <list>
#include <ctime>
using namespace std;
#define ll long long
#define ull unsigned long long
#define ld long double
typedef vector<long long> vll;
using LL = long long; using ULL = unsigned long long;
using VI = vector<int>; using VVI = vector<VI>; using VVVI = vector<VVI>;
using VL = vector<LL>; using VVL = vector<VL>; using VVVL = vector<VVL>;
using VB = vector<bool>; using VVB = vector<VB>; using VVVB = vector<VVB>;
using VD = vector<double>; using VVD = vector<VD>; using VVVD = vector<VVD>;
using VC = vector<char>; using VS = vector<string>; using VVC = vector<VC>;
using PII = pair<int,int>; using PLL = pair<LL,LL>; using PDD = pair<double,double>; using PIL = pair<int,LL>;
using MII = map<int,int>; using MLL = map<LL,LL>;
using SI = set<int>; using SL = set<LL>;
using MSI = multiset<int>; using MSL = multiset<LL>;
template<class T> using MAXPQ = priority_queue<T>;
template<class T> using MINPQ = priority_queue< T, vector<T>, greater<T> >;
const ll MOD = 1000000007;
const ll MOD2 = 998244353;
const ll INF = 1LL << 60;
#define PI 3.14159265358979323846
#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define EACH(e, v) for(auto &e : v)
#define RITR(it, v) for(auto it = (v).rbegin(); it != (v).rend(); ++it)
#define ALL(v) v.begin(),v.end()
vector<ll> x8={1,1,1,0,0,-1,-1,-1},y8={1,0,-1,1,-1,1,0,-1};
int dx4[4]={1,-1,0,0}, dy4[4]={0,0,1,-1};
/*
memo
-uf,RMQ(segtree),BIT,BIT2,SegTree,SegTreeLazy
-isprime,Eratosthenes,gcdlcm,factorize,divisors,modpow,moddiv(modpow必要)
nCr(+modnCr,inverse,extend_euclid.powmod),tobaseB,tobase10
-dijkstra,Floyd,bellmanford,sccd,topological,treediamiter
-compress1,compress2,rotate90
-co,ci,fo1,fo2,fo3,fo4
-bitsearch,binaryserach
-bfs(vis.assign忘れるな)
-SegTreedec,SegTreeLazydec
*/
template <typename X, typename M>
struct LazySegTree{
using FX = function<X(X,X)>;
using FA = function<X(M,X)>;
using FM = function<M(M,M)>;
long long n, N, log;
vector<X> dat;
vector<M> lazy;
FX fx;
FA fa;
FM fm;
X ex;
M em;
LazySegTree(long long _n, FX _fx, FA _fa, FM _fm, X _ex, M _em){
init(_n,_fx,_fa,_fm,_ex,_em);
}
void init(long long _n, FX _fx, FA _fa, FM _fm, X _ex, M _em){
N = _n, fx = _fx, fa = _fa, fm = _fm, ex = _ex, em = _em;
long long x = 1;
log = 0;
while(_n > x) x *= 2, log++;
n = x;
dat.assign(n*2,ex);
lazy.assign(n*2,em);
}
void pull_dat(long long k){
dat[k] = fx(dat[2*k],dat[2*k+1]);
}
void apply_lazy(long long k, M f){
dat[k] = fa(f, dat[k]);
if(k < n) lazy[k] = fm(f, lazy[k]);
}
void push_lazy(long long k){
if(lazy[k] == em) return;
apply_lazy(2*k, lazy[k]);
apply_lazy(2*k + 1, lazy[k]);
lazy[k] = em;
}
void pull_dat_deep(long long k){
for(int h = 1; h <= log; h++) pull_dat(k >> h);
}
void push_lazy_deep(long long k){
for(int h = log; h >= 1; h--) push_lazy(k >> h);
}
//i番目の要素をxにアップデートする(0-indexed),O(logN)
void set(long long i, X x){
i += n;
push_lazy_deep(i);
dat[i] = x;
pull_dat_deep(i);
}
//i番目の要素にアクセス(0-indexed),O(logN);
X get(long long i){
i += n;
push_lazy_deep(i);
return dat[i];
}
X operator[](long long i){return get(i);};
//i番目の要素にfaを作用させる
void apply(long long i, M f){
i += n;
push_lazy_deep(i);
dat[i] = fa(f, dat[i]);
pull_dat_deep(i);
}
//[l,r)までfaを作用させる
void apply(long long l, long long r, M f){
if(l == r) return;
l += n, r += n;
for(int h = log; h >= 1; h--){
if(((l >> h) << h) != l) push_lazy(l >> h);
if(((r >> h) << h) != r) push_lazy((r-1) >> h);
}
long long L = l, R = r;
for(;l < r; l >>= 1, r >>= 1){
if(l & 1) apply_lazy(l++,f);
if(r & 1) apply_lazy(--r,f);
}
l = L, r = R;
for(int h = 1; h <= log; h++){
if(((l >> h) << h) != l) pull_dat(l >> h);
if(((r >> h) << h) != r) pull_dat((r-1) >> h);
}
}
//[l,r)で二項演算を作用した結果(0-indexed),O(logN)
X prod(long long l, long long r){
if(l == r) return ex;
l += n, r += n;
for(int h = log; h >= 1; h--){
if(((l >> h) << h) != l) push_lazy(l >> h);
if(((r >> h) << h) != r) push_lazy(r >> h);
}
X vleft = ex, vright = ex;
for(; l < r; l >>= 1, r >>= 1){
if(l & 1) vleft = fx(vleft,dat[l++]);
if(r & 1) vright = fx(dat[--r],vright);
}
return fx(vleft,vright);
}
X all_prod(){return dat[1];};
//x=prod(l,r),f(x)=trueとなる最大のrを求める(f(ex)=true, 0-indexed),O(logN)
long long max_right(function<bool(X)> f, long long l = 0){
if(l == N) return N;
l += n;
push_lazy_deep(l);
X sum = ex;
do{
while(l % 2 == 0) l >>= 1;
if(!f(fx(sum,dat[l]))){
while(l < n){
push_lazy(l);
l *= 2;
if(f(fx(sum,dat[l]))){
sum = fx(sum,dat[l]);
l++;
}
}
return l - n;
}
sum = fx(sum,dat[l]);
l++;
}while((l & -l) != l);
return N;
}
//x=prod(l,r),f(x)=trueとなる最小のlを求める(f(ex)=true, 0-indexed),O(logN)
long long min_left(function<bool(X)> f, long long r = -1){
if(r == 0) return 0;
if(r == -1) return N;
r += n;
push_lazy_deep(r-1);
X sum = ex;
do{
r--;
while(r > 1 && (r % 2)) r >>= 1;
if(!f(fx(sum,dat[r]))){
while(r < n){
push_lazy(r);
r *= 2;
if(f(fx(sum,dat[r]))){
sum = fx(sum,dat[r]);
r--;
}
}
return r + 1 - n;
}
sum = fx(sum,dat[r]);
}while((r & -r) != r);
return 0;
}
};
int main(){
cin.tie(0);
ios_base::sync_with_stdio(0);
ll N,A,T;
cin >> N >> A;
VL x(N),xs;
for(ll i = 0; i < N; i++) cin >> x[i];
xs = x;
sort(ALL(xs));
using S = ll;
using F = ll;
auto fx = [](S x1, S x2) { return min(x1, x2); };
auto fa = [](F m, S x) { return m != -1? m : x; };
auto fm = [](F m1, F m2) { return m1 != -1? m1 : m2; };
S ex = 0;
F em = -1;
LazySegTree<S, F> seg(N, fx, fa, fm, ex, em); //モノイド(集合S,F, 二項演算fx,fa,fm, 単位元ex,em);
cin >> T;
ll l,r;
for(ll i = 0; i < T; i++){
cin >> l >> r;
auto itr1 = lower_bound(ALL(xs),l);
auto itr2 = upper_bound(ALL(xs),r);
ll ql = itr1-xs.begin();
ll qr = itr2-xs.begin();
seg.apply(ql,qr,i+1);
}
map<ll,ll>mp;
for(ll i = 0; i < N; i++){
mp[xs[i]] = seg.get(i);
}
for(ll i = 0; i < N; i++) cout << (mp[x[i]]!=0? mp[x[i]] : -1) << endl;
}