Submission #573409

#TimeUsernameProblemLanguageResultExecution timeMemory
573409MohammadAghilMoney (IZhO17_money)C++14
100 / 100
171 ms16064 KiB
#include <bits/stdc++.h> #pragma GCC optimize ("Ofast,unroll-loops") // #pragma GCC target ("avx2") using namespace std; typedef long long ll; typedef pair<int, int> pp; #define er(args ...) cerr << __LINE__ << ": ", err(new istringstream(string(#args)), args), cerr << endl #define per(i,r,l) for(int i = (r); i >= (l); i--) #define rep(i,l,r) for(int i = (l); i < (r); i++) #define all(x) x.begin(), x.end() #define sz(x) (int)(x).size() #define pb push_back #define ss second #define ff first void err(istringstream *iss){}template<typename T,typename ...Args> void err(istringstream *iss,const T &_val, const Args&...args){string _name;*iss>>_name;if(_name.back()==',')_name.pop_back();cerr<<_name<<" = "<<_val<<", ",err(iss,args...);} mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); const ll mod = 1e9 + 7, maxn = 1e6 + 5, lg = 22, lng = 26, inf = ll(1e9) + 5; ll pw(ll a,ll b,ll md=mod){if(!b)return 1;ll k=pw(a,b>>1ll);return k*k%md*(b&1ll?a:1)%md;} int prv[maxn], nxt[maxn], cnt[maxn]; void del(int x){ prv[nxt[x]] = prv[x], nxt[prv[x]] = nxt[x]; } int main(){ cin.tie(0) -> sync_with_stdio(0); int n; cin >> n; vector<int> a(n); rep(i,0,n) cin >> a[i], cnt[a[i]]++; iota(nxt, nxt + maxn, 1), iota(prv, prv + maxn, -1); rep(i,1,maxn-1) if(!cnt[i]) del(i); int ans = 0, bl = 0; per(i,n-1,0){ if(i == n-1 || (bl > 1 && a[i] != a[i+1] && cnt[a[i+1]]) || (a[i] != a[i+1] && prv[a[i+1]] != a[i])) bl = 0, ans++; if(i == n-1 || a[i] != a[i+1]) bl++; cnt[a[i]]--; if(!cnt[a[i]]) del(a[i]); } cout << ans << '\n'; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...