結果
問題 | No.1705 Mode of long array |
ユーザー |
|
提出日時 | 2022-09-18 23:52:47 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 397 ms / 3,000 ms |
コード長 | 7,227 bytes |
コンパイル時間 | 3,252 ms |
コンパイル使用メモリ | 191,624 KB |
最終ジャッジ日時 | 2025-02-07 12:01:52 |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 51 |
ソースコード
#include <atcoder/all>#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 <iomanip>using namespace std;using namespace atcoder;#define rep(i, n) for (int i = 0; i < (int)(n); i++)#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)typedef long long ll;typedef unsigned long long ull;const ll inf=1e18;using graph = vector<vector<int> > ;using P= pair<ll,ll>;using vi=vector<int>;using vvi=vector<vi>;using vll=vector<ll>;using vvll=vector<vll>;using vp=vector<P>;using vpp=vector<vp>;//string T="ABCDEFGHIJKLMNOPQRSTUVWXYZ";//string S="abcdefghijklmnopqrstuvwxyz";//g++ main.cpp -std=c++14 -I .//cout <<setprecision(20);//cout << fixed << setprecision(10);//cin.tie(0); ios::sync_with_stdio(false);const double PI = acos(-1);int vx[]={0,1,0,-1,-1,1,1,-1},vy[]={1,0,-1,0,1,1,-1,-1};ll pow_pow(ll x,ll n,ll mod){if(n==0) return 1;x%=mod;ll res=pow_pow(x*x%mod,n/2,mod);if(n&1)res=res*x%mod;return res;}struct UnionFind { vector<int> par, siz; UnionFind(int n) : par(n, -1) , siz(n, 1) { } int root(int x) { if (par[x] == -1) return x;else return par[x] = root(par[x]);}bool issame(int x, int y) {return root(x) == root(y);}bool unite(int x, int y) {x = root(x), y = root(y);if (x == y) return false;if (siz[x] < siz[y]) swap(x, y);par[y] = x;siz[x] += siz[y];return true;}int size(int x) {return siz[root(x)];}};int gcd(int x,int y){if(y==0)return x;return gcd(y,x%y);}ll lcm(ll x,ll y){return ll(x/gcd(x,y))*y;}template<class T> bool chmin(T& a, T b) {if (a > b) {a = b;return true;}else return false;}template<class T> bool chmax(T& a, T b) {if (a < b) {a = b;return true;}else return false;}// https://youtu.be/L8grWxBlIZ4?t=9858// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize// https://youtu.be/8uowVvQ_-Mo?t=1329 : divisionconst ll mod =998244353;struct mint {ll x; // typedef long long ll;mint(ll x=0):x((x%mod+mod)%mod){}mint operator-() const { return mint(-x);}mint& operator+=(const mint a) {if ((x += a.x) >= mod) x -= mod;return *this;}mint& operator-=(const mint a) {if ((x += mod-a.x) >= mod) x -= mod;return *this;}mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;}mint operator+(const mint a) const { return mint(*this) += a;}mint operator-(const mint a) const { return mint(*this) -= a;}mint operator*(const mint a) const { return mint(*this) *= a;}mint pow(ll t) const {if (!t) return 1;mint a = pow(t>>1);a *= a;if (t&1) a *= *this;return a;}// for prime modmint inv() const { return pow(mod-2);}mint& operator/=(const mint a) { return *this *= a.inv();}mint operator/(const mint a) const { return mint(*this) /= a;}};istream& operator>>(istream& is, const mint& a) { return is >> a.x;}ostream& operator<<(ostream& os, const mint& a) { return os << a.x;}// combination mod prime// https://www.youtube.com/watch?v=8uowVvQ_-Mo&feature=youtu.be&t=1619struct combination {vector<mint> fact, ifact;combination(int n):fact(n+1),ifact(n+1) {//assert(n < mod);fact[0] = 1;for (int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i;ifact[n] = fact[n].inv();for (int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i;}mint operator()(int n, int k) {if (k < 0 || k > n) return 0;return fact[n]*ifact[k]*ifact[n-k];}mint p(int n, int k) {return fact[n]*ifact[n-k];}} c(20000050);using vm=vector<mint> ;using vvm=vector<vm> ;ll sqrt_(ll x) {ll l = 0, r = ll(3e9)+1;while (l+1<r) {ll c = (l+r)/2;if (c*c <= x) l = c; else r = c;}return l;}int valid(int x,int y,int h,int w){if(x>=0 && y>=0 && x<h && y<w)return 1;else return 0;}ll comb[51][51];void init_comb(){comb[0][0]=1;for(int i=1; i<=50; i++){for(int j=0; j<=i; j++){if(j==0 || j==i)comb[i][j]=1;else comb[i][j]=comb[i-1][j]+comb[i-1][j-1];}}}ll nCk(int n,int k){return comb[n][k];}struct edge{int to; ll cost;edge(int to,ll cost) : to(to),cost(cost) {}};using ve=vector<edge>;using vve =vector<ve>;map<ll,ll>d;void comp(vll&a){set<ll>s(a.begin(),a.end());int cnt=0;for(auto y:s)d[y]=cnt++;for(auto&y:a)y=d[y];}const int MAX_ROW = 510; // to be set appropriatelyconst int MAX_COL = 510; // to be set appropriatelystruct BitMatrix {int H, W;bitset<MAX_COL> val[MAX_ROW];BitMatrix(int m = 1, int n = 1) : H(m), W(n) {}inline bitset<MAX_COL>& operator [] (int i) {return val[i];}};int GaussJordan(BitMatrix &A, bool is_extended = false) {int rank = 0;for (int col = 0; col < A.W; ++col) {if (is_extended && col == A.W - 1) break;int pivot = -1;for (int row = rank; row < A.H; ++row) {if (A[row][col]) {pivot = row;break;}}if (pivot == -1) continue;swap(A[pivot], A[rank]);for (int row = 0; row < A.H; ++row) {if (row != rank && A[row][col]) A[row] ^= A[rank];}++rank;}return rank;}int linear_equation(BitMatrix A, vector<int> b, vector<int> &res) {int m = A.H, n = A.W;BitMatrix M(m, n + 1);for (int i = 0; i < m; ++i) {for (int j = 0; j < n; ++j) M[i][j] = A[i][j];M[i][n] = b[i];}int rank = GaussJordan(M, true);// check if it has no solutionfor (int row = rank; row < m; ++row) if (M[row][n]) return -1;// answerres.assign(n, 0);for (int i = 0; i < rank; ++i) res[i] = M[i][n];return rank;}using S=P;S op(S l,S r){if(l.first>r.first)return l;else if(l.first<r.first)return r;else {if(l.second>r.second)return l;else return r;}}S e(){return P(-inf,-inf);}int main(){cin.tie(0); ios::sync_with_stdio(false);ll n,m; cin >> n >> m;vp a(m);rep(i,m){cin >> a[i].first;a[i].second=i;}segtree<S,op,e> seg(a);int q; cin >> q;vll anss;rep(qi,q){ll t,x,y; cin >> t >> x >> y;x--;if(t==1){auto now=seg.get(x);now.first+=y;seg.set(x,now);}if(t==2){auto now=seg.get(x);now.first-=y;seg.set(x,now);}if(t==3){auto ans=seg.all_prod().second+1;anss.push_back(ans);}}for(auto u:anss)cout << u << endl;}