結果
問題 | No.875 Range Mindex Query |
ユーザー | t9unkubj |
提出日時 | 2024-08-01 06:47:35 |
言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 74 ms / 2,000 ms |
コード長 | 6,196 bytes |
コンパイル時間 | 4,687 ms |
コンパイル使用メモリ | 267,116 KB |
実行使用メモリ | 6,948 KB |
最終ジャッジ日時 | 2024-08-01 06:47:43 |
合計ジャッジ時間 | 6,387 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
6,812 KB |
testcase_01 | AC | 2 ms
6,944 KB |
testcase_02 | AC | 2 ms
6,940 KB |
testcase_03 | AC | 2 ms
6,940 KB |
testcase_04 | AC | 2 ms
6,940 KB |
testcase_05 | AC | 2 ms
6,944 KB |
testcase_06 | AC | 2 ms
6,940 KB |
testcase_07 | AC | 1 ms
6,944 KB |
testcase_08 | AC | 2 ms
6,940 KB |
testcase_09 | AC | 2 ms
6,948 KB |
testcase_10 | AC | 2 ms
6,944 KB |
testcase_11 | AC | 73 ms
6,940 KB |
testcase_12 | AC | 71 ms
6,940 KB |
testcase_13 | AC | 58 ms
6,944 KB |
testcase_14 | AC | 55 ms
6,940 KB |
testcase_15 | AC | 70 ms
6,940 KB |
testcase_16 | AC | 67 ms
6,940 KB |
testcase_17 | AC | 74 ms
6,940 KB |
testcase_18 | AC | 69 ms
6,940 KB |
ソースコード
#ifdef t9unkubj #include"template.h" //#include"template_no_debug.h" #else #undef _GLIBCXX_DEBUG #pragma GCC optimize("O3") #define dbg(...) 199958 using namespace std; #include<bits/stdc++.h> using uint=unsigned; using ll=long long; using ull=unsigned long long; using ld=long double; using pii=pair<int,int>; using pll=pair<ll,ll>; template<class T>using vc=vector<T>; template<class T>using vvc=vc<vc<T>>; template<class T>using vvvc=vvc<vc<T>>; using vi=vc<int>; using vvi=vc<vi>; using vvvi=vc<vvi>; using vl=vc<ll>; using vvl=vc<vl>; using vvvl=vc<vvl>; template<class T>using smpq=priority_queue<T,vector<T>,greater<T>>; template<class T>using bipq=priority_queue<T>; #define rep(i,n) for(ll i=0;i<(ll)(n);i++) #define REP(i,j,n) for(ll i=(j);i<(ll)(n);i++) #define DREP(i,n,m) for(ll i=(n);i>=(m);i--) #define drep(i,n) for(ll i=((n)-1);i>=0;i--) #define all(x) x.begin(),x.end() #define rall(x) x.rbegin(),x.rend() #define mp make_pair #define pb push_back #define eb emplace_back #define fi first #define se second #define is insert #define bg begin() #define ed end() void scan(int&a) { cin >> a; } void scan(ll&a) { cin >> a; } void scan(string&a) { cin >> a; } void scan(char&a) { cin >> a; } void scan(uint&a) { cin >> a; } void scan(ull&a) { cin >> a; } void scan(bool&a) { cin >> a; } void scan(ld&a){ cin>> a;} template<class T> void scan(vector<T>&a) { for(auto&x:a) scan(x); } void read() {} template<class Head, class... Tail> void read(Head&head, Tail&... tail) { scan(head); read(tail...); } #define INT(...) int __VA_ARGS__; read(__VA_ARGS__); #define LL(...) ll __VA_ARGS__; read(__VA_ARGS__); #define ULL(...) ull __VA_ARGS__; read(__VA_ARGS__); #define STR(...) string __VA_ARGS__; read(__VA_ARGS__); #define CHR(...) char __VA_ARGS__; read(__VA_ARGS__); #define DBL(...) double __VA_ARGS__; read(__VA_ARGS__); #define LD(...) ld __VA_ARGS__; read(__VA_ARGS__); #define VC(type, name, ...) vector<type> name(__VA_ARGS__); read(name); #define VVC(type, name, size, ...) vector<vector<type>> name(size, vector<type>(__VA_ARGS__)); read(name); void print(int a) { cout << a; } void print(ll a) { cout << a; } void print(string a) { cout << a; } void print(char a) { cout << a; } void print(uint a) { cout << a; } void print(bool a) { cout << a; } void print(ull a) { cout << a; } void print(double a) { cout << a; } void print(ld a){ cout<< a; } template<class T> void print(vector<T>a) { for(int i=0;i<(int)a.size();i++){if(i)cout<<" ";print(a[i]);}cout<<endl;} void PRT() { cout <<endl; return ; } template<class T> void PRT(T a) { print(a); cout <<endl; return; } template<class Head, class... Tail> void PRT(Head head, Tail ... tail) { print(head); cout << " "; PRT(tail...); return; } template<class T,class F> bool chmin(T &x, F y){ if(x>y){ x=y; return true; } return false; } template<class T, class F> bool chmax(T &x, F y){ if(x<y){ x=y; return true; } return false; } void YesNo(bool b){ cout<<(b?"Yes":"No")<<endl; } void Yes(){ cout<<"Yes"<<endl; } void No(){ cout<<"No"<<endl; } template<class T> int popcount(T n){ return __builtin_popcountll(n); } template<class T> T sum(vc<T>&a){ return accumulate(all(a),T(0)); } template<class T> T max(vc<T>&a){ return *max_element(all(a)); } template<class T> T min(vc<T>&a){ return *min_element(all(a)); } template<class T> void unique(vc<T>&a){ a.erase(unique(all(a)),a.end()); } vvi readgraph(int n,int m,int off = -1){ vvi g(n); rep(i, m){ int u,v; cin>>u>>v; u+=off,v+=off; g[u].push_back(v); g[v].push_back(u); } return g; } vvi readtree(int n,int off=-1){ return readgraph(n,n-1,off); } template<class T> vc<T> presum(vc<T> &a){ vc<T> ret(a.size()+1); rep(i,a.size())ret[i+1]=ret[i]+a[i]; return ret; } template<class T, class F> vc<T> &operator+=(vc<T> &a,F b){ for (auto&v:a)v += b; return a; } template<class T, class F> vc<T> &operator-=(vc<T>&a,F b){ for (auto&v:a)v-=b; return a; } template<class T, class F> vc<T> &operator*=(vc<T>&a,F b){ for (auto&v:a)v*=b; return a; } #endif double pass_time=0; template<class T,T (*op)(T, T)> struct segtree{ int n; vector<T>node; T e; segtree(){} segtree(int n,T e):n(n),e(e),node(n*2,e){} void set(int i,T x){ node[i+=n]=x; while(i>>=1)node[i]=op(node[i<<1],node[i<<1|1]); } T prod(int l,int r){ l+=n,r+=n; T sml=e,smr=e; while(l<r){ if(l&1)sml=op(sml,node[l++]); if(r&1)smr=op(node[--r],smr); l>>=1,r>>=1; } return op(sml,smr); } T get(int i){ return node[i+n]; } template<class F> int max_right(int L, F f) const { long long l = n + L, w = 1, ansL = e; for(; L + w <= n; l >>= 1, w <<= 1) if(l & 1) { if(not f(op(ansL, node[l]))) break; ansL = op(ansL, node[l++]); L += w; } while(l <<= 1, w >>= 1){ if(L + w <= n && f(op(ansL, node[l]))){ ansL = op(ansL, node[l++]); L += w; } } return L; } template<class F> int min_left(int R, F f) const { long long r = n + R, w = 1, ansR = e; for(; R - w >= 0; r >>= 1, w <<= 1) if(r & 1) { if(not f(op(node[r - 1], ansR))) break; ansR = op(node[--r], ansR); R -= w; } while(r <<= 1, w >>= 1){ if(R - w >= 0 && f(op(node[r - 1], ansR))){ ansR = op(node[--r], ansR); R -= w; } } return R; } }; pii op(pii a,pii b){return min(a,b);} void solve(){ INT(n,q); VC(int,a,n); segtree<pii,op>seg(n,mp(1e9,1e9)); rep(i,n)seg.set(i,mp(a[i],i)); while(q--){ INT(t,l,r); if(t==1){ --l,--r; swap(a[l],a[r]); seg.set(l,mp(a[l],l)); seg.set(r,mp(a[r],r)); }else{ --l,--r; cout<<seg.prod(l,r+1).se+1<<"\n"; } } } signed main(){ cin.tie(0)->sync_with_stdio(0); pass_time=clock(); int t=1; //cin>>t; while(t--)solve(); pass_time=clock()-pass_time; dbg(pass_time/CLOCKS_PER_SEC); }