제출 #799239

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
799239		farhan132	Money (IZhO17_money)	C++17	100 / 100	307 ms	22752 KiB

money

/***Farhan132***/
#pragma GCC optimize("Ofast,fast-math")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")

#include <bits/stdc++.h>
 
using namespace std;
 
typedef int ll;
typedef double dd;
typedef pair<ll , ll> ii;
typedef tuple < ll,  ll, ll > tp;
 
#define ff first
#define ss second
#define pb push_back
#define in insert
#define bug printf("**!\n")
#define mem(a , b) memset(a, b ,sizeof(a))
#define front_zero(n) __builtin_clz(n)
#define back_zero(n) __builtin_ctzll(n)
#define total_one(n) __builtin_popcount(n)
#define clean fflush(stdout)
 
const ll mod =  (ll) 998244353;
// const ll mod =  (ll) 1e9 + 7;
//const ll INF = numeric_limits<ll>::max()-1;
const ll INF = (ll)2e18;
 
// ll dx[]={0,1,0,-1};
// ll dy[]={1,0,-1,0};
// ll dxx[]={0,1,0,-1,1,1,-1,-1};
// ll dyy[]={1,0,-1,0,1,-1,1,-1};
 
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
 
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
 
template <typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

const ll N = 1e6 + 5;
ll a[N], b[N];

struct DSU{
    vector < int > par;
    void start(int n){
        par.resize(n + 1);
        for(int i = 0; i <= n; i++) par[i] = i;
    }
    int find(int a){
        if(a == par[a]) return a;
        return par[a] = find(par[a]);
    }
    void merge(int x, int y){
        x = find(x); y = find(y);
        if(x == y) return;
        par[x] = y;
        return;
    }
}T;

ll L[N];

void solve(){

    ll n; cin >> n;

    for(ll i = 1; i <= n; i++){
        cin >> a[i];
        b[i] = a[i];
    }

    sort(b + 1, b + n + 1);
    T.start(n + 1);
    a[0] = -1;
    b[0] = 0;

    for(ll i = 1; i <= n; i++){
        if(b[i] - b[i - 1]) L[b[i]] = i;
    }
    ll cur = n; ll ans = 0;

    while(cur > 0){
        ll c = 1;
        while(a[cur - 1] == a[cur]){
            cur--; c++;
        }
        vector < ll > bad;
        for(ll i = L[a[cur]]; i < L[a[cur]] + c; i++) bad.pb(i);
        ll c_cur = L[a[cur]]; L[a[cur]] += c;
        while(a[cur - 1] == b[T.find(c_cur - 1)]){
            c_cur = T.find(c_cur - 1);
            bad.pb(c_cur); cur--;
        }
        for(auto u : bad){
            T.par[u] = u - 1;
        }
        cur--; ans++;
    }
    cout << ans << '\n';

   return;
}

int main() {

    #ifdef LOCAL
        freopen("in.txt", "r", stdin);
        freopen("out.txt", "w", stdout);
        auto start_time = clock();
    #else
         // freopen("subsequence.in", "r", stdin);
         // freopen("subsequence.out", "w", stdout); 
         ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
    #endif

    //precalc();
 
    ll T = 1, CT = 0;// cin >> T; 
 
    while(T--){
        // cout << "Case #" << ++CT << ": ";
        solve();
    }
    
    #ifdef LOCAL
        auto end_time = clock();
        cerr<< "Execution time: "<<(end_time - start_time)*(int)1e3/CLOCKS_PER_SEC<<" ms\n";
    #endif
 
    return 0;
} 

컴파일 시 표준 에러 (stderr) 메시지

money.cpp:4: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    4 | #pragma GCC optimization ("unroll-loops")
      | 
money.cpp: In function 'int main()':
money.cpp:122:15: warning: unused variable 'CT' [-Wunused-variable]
  122 |     ll T = 1, CT = 0;// cin >> T;
      |               ^~

• Subtask 1: 9 / 9
• Subtask 2: 16 / 16
• Subtask 3: 20 / 20
• Subtask 4: 55 / 55