oj.uz

Submission #319235

# Submission time Handle Problem Language Result Execution time Memory
319235 2020-11-04T14:35:45 Z balbit Money (IZhO17_money) C++14
0 / 100
 4 ms 4332 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define ull unsigned ll
#define f first
#define s second
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)x.size()
#define SQ(x) (x)*(x)
#define MN(a,b) a = min(a,(__typeof__(a))(b))
#define MX(a,b) a = max(a,(__typeof__(a))(b))
#define pb push_back
#define REP(i,n) for (int i = 0; i<n; ++i)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#ifdef BALBIT
#define IOS()
#define bug(...) fprintf(stderr,"#%d (%s) = ",__LINE__,#__VA_ARGS__),_do(__VA_ARGS__);
template<typename T> void _do(T &&x){cerr<<x<<endl;}
template<typename T, typename ...S> void _do(T &&x, S &&...y){cerr<<x<<", ";_do(y...);}
#else
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#define endl '\n'
#define bug(...)
#endif

const int iinf = 1e9+10;
const ll inf = 1ll<<60;
const ll mod = 1e9+7 ;


void GG(){cout<<"0\n"; exit(0);}

ll mpow(ll a, ll n, ll mo = mod){ // a^n % mod
    ll re=1;
    while (n>0){
        if (n&1) re = re*a %mo;
        a = a*a %mo;
        n>>=1;
    }
    return re;
}

ll inv (ll b, ll mo = mod){
    if (b==1) return b;
    return (mo-mo/b) * inv(mo%b,mo) % mo;
}

const int maxn = 1e6+5;

int L[maxn], R[maxn];
int a[maxn];
int newv[maxn];
int nof[maxn];

signed main(){
    IOS();

    int n; cin>>n;
    REP(i,n){
        cin>>a[i]; nof[a[i]]++; //--a[i];
        L[i+1] = i; R[i+1] = i+2;
    }
    int nowcnt = 0;
    REP(i, 1000001) {
        newv[i] = nowcnt;
        nowcnt += nof[i];
    }
    REP(i,n) {
        a[i] = ++newv[a[i]]; bug(i, a[i]);
    }
    int nxt = -1;
    int re = 0;
    for (int i=n-1; i>=0; --i) {
        if (a[i] != nxt) {
            ++re;
        }
        R[L[a[i]]] = R[a[i]];
        L[R[a[i]]] = L[a[i]];
        nxt = L[a[i]];
    }
    cout<<re<<endl;

}

// 6 3 6 4 5 1 2

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4328 KB Output is correct
2 Correct 4 ms 4332 KB Output is correct
3 Correct 4 ms 4332 KB Output is correct
4 Incorrect 4 ms 4332 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4328 KB Output is correct
2 Correct 4 ms 4332 KB Output is correct
3 Correct 4 ms 4332 KB Output is correct
4 Incorrect 4 ms 4332 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4328 KB Output is correct
2 Correct 4 ms 4332 KB Output is correct
3 Correct 4 ms 4332 KB Output is correct
4 Incorrect 4 ms 4332 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4328 KB Output is correct
2 Correct 4 ms 4332 KB Output is correct
3 Correct 4 ms 4332 KB Output is correct
4 Incorrect 4 ms 4332 KB Output isn't correct
5 Halted 0 ms 0 KB -