oj.uz

Submission #910597

# Submission time Handle Problem Language Result Execution time Memory
910597 2024-01-18T06:09:54 Z vjudge1 Money (IZhO17_money) C++17
100 / 100
 568 ms 22324 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 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[3000001],sum=0;

void get(int v,int tl,int tr,int l,int r){
    if(tl>=l && tr<=r){
        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(tl>=l && 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];
}
int pp[1000001];
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;
    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]]=1;
        }
        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();
	}
}

Compilation message

money.cpp:3: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    3 | #pragma GCC optimization("unroll-loops")
      |

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 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 4440 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 2 ms 10588 KB Output is correct
11 Correct 1 ms 6488 KB Output is correct
12 Correct 2 ms 12636 KB Output is correct
13 Correct 2 ms 6488 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 2 ms 10588 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4440 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 4440 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 2 ms 10588 KB Output is correct
11 Correct 1 ms 6488 KB Output is correct
12 Correct 2 ms 12636 KB Output is correct
13 Correct 2 ms 6488 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 2 ms 10588 KB Output is correct
17 Correct 1 ms 2392 KB Output is correct
18 Correct 1 ms 2392 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 2 ms 10588 KB Output is correct
21 Correct 2 ms 8536 KB Output is correct
22 Correct 2 ms 4444 KB Output is correct
23 Correct 2 ms 8792 KB Output is correct
24 Correct 2 ms 8540 KB Output is correct
25 Correct 2 ms 6748 KB Output is correct
26 Correct 1 ms 4696 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4440 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 4440 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 2 ms 10588 KB Output is correct
11 Correct 1 ms 6488 KB Output is correct
12 Correct 2 ms 12636 KB Output is correct
13 Correct 2 ms 6488 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 2 ms 10588 KB Output is correct
17 Correct 1 ms 2392 KB Output is correct
18 Correct 1 ms 2392 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 2 ms 10588 KB Output is correct
21 Correct 2 ms 8536 KB Output is correct
22 Correct 2 ms 4444 KB Output is correct
23 Correct 2 ms 8792 KB Output is correct
24 Correct 2 ms 8540 KB Output is correct
25 Correct 2 ms 6748 KB Output is correct
26 Correct 1 ms 4696 KB Output is correct
27 Correct 2 ms 6488 KB Output is correct
28 Correct 2 ms 6488 KB Output is correct
29 Correct 2 ms 6492 KB Output is correct
30 Correct 1 ms 4444 KB Output is correct
31 Correct 2 ms 6488 KB Output is correct
32 Correct 1 ms 6608 KB Output is correct
33 Correct 1 ms 4444 KB Output is correct
34 Correct 1 ms 2652 KB Output is correct
35 Correct 1 ms 2396 KB Output is correct
36 Correct 1 ms 6492 KB Output is correct
37 Correct 2 ms 8280 KB Output is correct
38 Correct 2 ms 7516 KB Output is correct

Subtask #4
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4440 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 4440 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 2 ms 10588 KB Output is correct
11 Correct 1 ms 6488 KB Output is correct
12 Correct 2 ms 12636 KB Output is correct
13 Correct 2 ms 6488 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 2 ms 10588 KB Output is correct
17 Correct 1 ms 2392 KB Output is correct
18 Correct 1 ms 2392 KB Output is correct
19 Correct 1 ms 4444 KB Output is correct
20 Correct 2 ms 10588 KB Output is correct
21 Correct 2 ms 8536 KB Output is correct
22 Correct 2 ms 4444 KB Output is correct
23 Correct 2 ms 8792 KB Output is correct
24 Correct 2 ms 8540 KB Output is correct
25 Correct 2 ms 6748 KB Output is correct
26 Correct 1 ms 4696 KB Output is correct
27 Correct 2 ms 6488 KB Output is correct
28 Correct 2 ms 6488 KB Output is correct
29 Correct 2 ms 6492 KB Output is correct
30 Correct 1 ms 4444 KB Output is correct
31 Correct 2 ms 6488 KB Output is correct
32 Correct 1 ms 6608 KB Output is correct
33 Correct 1 ms 4444 KB Output is correct
34 Correct 1 ms 2652 KB Output is correct
35 Correct 1 ms 2396 KB Output is correct
36 Correct 1 ms 6492 KB Output is correct
37 Correct 2 ms 8280 KB Output is correct
38 Correct 2 ms 7516 KB Output is correct
39 Correct 111 ms 8508 KB Output is correct
40 Correct 203 ms 15700 KB Output is correct
41 Correct 108 ms 12228 KB Output is correct
42 Correct 94 ms 6140 KB Output is correct
43 Correct 66 ms 11684 KB Output is correct
44 Correct 245 ms 10668 KB Output is correct
45 Correct 247 ms 6544 KB Output is correct
46 Correct 238 ms 6584 KB Output is correct
47 Correct 250 ms 12572 KB Output is correct
48 Correct 234 ms 12368 KB Output is correct
49 Correct 444 ms 16380 KB Output is correct
50 Correct 428 ms 16712 KB Output is correct
51 Correct 398 ms 16468 KB Output is correct
52 Correct 380 ms 16468 KB Output is correct
53 Correct 411 ms 16724 KB Output is correct
54 Correct 411 ms 16724 KB Output is correct
55 Correct 568 ms 16840 KB Output is correct
56 Correct 535 ms 21844 KB Output is correct
57 Correct 447 ms 22096 KB Output is correct
58 Correct 429 ms 22324 KB Output is correct
59 Correct 449 ms 21848 KB Output is correct
60 Correct 451 ms 21844 KB Output is correct
61 Correct 509 ms 22276 KB Output is correct
62 Correct 438 ms 22096 KB Output is correct