oj.uz

Submission #910567

# Submission time Handle Problem Language Result Execution time Memory
910567 2024-01-18T05:55:44 Z vjudge1 Money (IZhO17_money) C++17
9 / 100
 3 ms 12892 KB 
/*#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")*/
#include <bits/stdc++.h>
#include <iomanip>
#define ll long long
#define int long long
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define str string
#define pii pair<int,int>
#define sz(x) x.size()
#define all(x) x.begin(), x.end()
#define vi vector<int>
#define mii map<int,int>
#define mll map<ll,ll>
#define yes cout<<"YES\n";
#define no cout<<"NO\n";
#define yess cout<<"Yes\n";
#define noo cout<<"No\n";
using namespace std;

int t[4000001],sum=0;

void get(int v,int tl,int tr,int l,int r){
    if(tl>=l && tr<=r){
        //cout<<t[v]<<" "<<tl<< " "<<tr<<"\n";
        sum+=t[v];
        return;
    }
    if(tl>r || tr<l){
        return;
    }
    int tm=(tl+tr)>>1;
    get(v+v,tl,tm,l,r);
    get(v+v+1,tm+1,tr,l,r);
}

void upd(int v,int tl,int tr,int l,int r){
    if(l<=tl && tr<=r){
        t[v]=1;
        return;
    }
    if(tl>r || tr<l){
        return;
    }
    int tm=(tl+tr)>>1;
    upd(v+v,tl,tm,l,r);
    upd(v+v+1,tm+1,tr,l,r);
    t[v]=t[v+v]+t[v+v+1];
}

void solve(){
    int n;
    cin>>n;
    int a[n+3];
    for(int i=1;i<=n;i++){
        cin>>a[i];
    }
    int ans=0;
    a[0]=-1;
    map<int ,int>pp;
    for(int i=1;i<=n;i++){
        int o=i;
        for(int j=i+1;j<=n;j++){
            if(a[j]<a[j-1]){
                break;
            }
            sum=0;
            get(1,1,1000000,a[i],a[j]);
            if(sum-pp[a[i]]-pp[a[j]]>0){
                o=j-1;
                break;
            }
            else{
                o=j;
            }
        }
        for(int j=i;j<=o;j++){
            upd(1,1,1000000,a[j],a[j]);
            pp[a[j]]++;
        }
        ans++;
        i=o;
    }
    cout<<ans;
}
signed main(){
	ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	//srand( time(0));
	//rand()
	//freopen("sum.in", "r", stdin);
	//freopen("sum.out", "w", stdout);
    int tests=1;
    //cin>>tests;
    for(int i=1;i<=tests;i++){
		//cout<<"TEST CASE : "<<i<<"\n";
		solve();
	}
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4440 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 4856 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 4700 KB Output is correct
10 Correct 2 ms 12752 KB Output is correct
11 Correct 2 ms 6488 KB Output is correct
12 Correct 3 ms 12892 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 2 ms 8540 KB Output is correct
15 Correct 3 ms 10844 KB Output is correct
16 Correct 2 ms 10584 KB Output is correct

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4440 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 4856 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 4700 KB Output is correct
10 Correct 2 ms 12752 KB Output is correct
11 Correct 2 ms 6488 KB Output is correct
12 Correct 3 ms 12892 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 2 ms 8540 KB Output is correct
15 Correct 3 ms 10844 KB Output is correct
16 Correct 2 ms 10584 KB Output is correct
17 Incorrect 1 ms 4700 KB Output isn't correct
18 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4440 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 4856 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 4700 KB Output is correct
10 Correct 2 ms 12752 KB Output is correct
11 Correct 2 ms 6488 KB Output is correct
12 Correct 3 ms 12892 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 2 ms 8540 KB Output is correct
15 Correct 3 ms 10844 KB Output is correct
16 Correct 2 ms 10584 KB Output is correct
17 Incorrect 1 ms 4700 KB Output isn't correct
18 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4440 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 4856 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 4700 KB Output is correct
10 Correct 2 ms 12752 KB Output is correct
11 Correct 2 ms 6488 KB Output is correct
12 Correct 3 ms 12892 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 2 ms 8540 KB Output is correct
15 Correct 3 ms 10844 KB Output is correct
16 Correct 2 ms 10584 KB Output is correct
17 Incorrect 1 ms 4700 KB Output isn't correct
18 Halted 0 ms 0 KB -