oj.uz

Submission #910594

# Submission time Handle Problem Language Result Execution time Memory
910594 2024-01-18T06:08:25 Z vjudge1 Money (IZhO17_money) C++17
45 / 100
 1500 ms 56052 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[4000001],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];
}

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]);
            //cout<<sum<<pp[a[i]]<<" "<<pp[a[j]]<<"\n";
            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 1 ms 2396 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 2 ms 8540 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 8540 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 2 ms 8540 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 8540 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 1 ms 2652 KB Output is correct
18 Correct 1 ms 2652 KB Output is correct
19 Correct 1 ms 2652 KB Output is correct
20 Correct 1 ms 6612 KB Output is correct
21 Correct 1 ms 4524 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 1 ms 6744 KB Output is correct
24 Correct 2 ms 6492 KB Output is correct
25 Correct 1 ms 4700 KB Output is correct
26 Correct 1 ms 2648 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 2 ms 8540 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 8540 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 1 ms 2652 KB Output is correct
18 Correct 1 ms 2652 KB Output is correct
19 Correct 1 ms 2652 KB Output is correct
20 Correct 1 ms 6612 KB Output is correct
21 Correct 1 ms 4524 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 1 ms 6744 KB Output is correct
24 Correct 2 ms 6492 KB Output is correct
25 Correct 1 ms 4700 KB Output is correct
26 Correct 1 ms 2648 KB Output is correct
27 Correct 1 ms 4444 KB Output is correct
28 Correct 1 ms 4444 KB Output is correct
29 Correct 1 ms 4440 KB Output is correct
30 Correct 1 ms 2396 KB Output is correct
31 Correct 1 ms 4444 KB Output is correct
32 Correct 1 ms 4700 KB Output is correct
33 Correct 1 ms 2652 KB Output is correct
34 Correct 1 ms 604 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 1 ms 2652 KB Output is correct
37 Correct 2 ms 5980 KB Output is correct
38 Correct 2 ms 7000 KB Output is correct

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 2 ms 8540 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 8540 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 1 ms 2652 KB Output is correct
18 Correct 1 ms 2652 KB Output is correct
19 Correct 1 ms 2652 KB Output is correct
20 Correct 1 ms 6612 KB Output is correct
21 Correct 1 ms 4524 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 1 ms 6744 KB Output is correct
24 Correct 2 ms 6492 KB Output is correct
25 Correct 1 ms 4700 KB Output is correct
26 Correct 1 ms 2648 KB Output is correct
27 Correct 1 ms 4444 KB Output is correct
28 Correct 1 ms 4444 KB Output is correct
29 Correct 1 ms 4440 KB Output is correct
30 Correct 1 ms 2396 KB Output is correct
31 Correct 1 ms 4444 KB Output is correct
32 Correct 1 ms 4700 KB Output is correct
33 Correct 1 ms 2652 KB Output is correct
34 Correct 1 ms 604 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 1 ms 2652 KB Output is correct
37 Correct 2 ms 5980 KB Output is correct
38 Correct 2 ms 7000 KB Output is correct
39 Correct 119 ms 6680 KB Output is correct
40 Correct 195 ms 11820 KB Output is correct
41 Correct 104 ms 8180 KB Output is correct
42 Correct 89 ms 4224 KB Output is correct
43 Correct 66 ms 9696 KB Output is correct
44 Correct 252 ms 6660 KB Output is correct
45 Correct 257 ms 4352 KB Output is correct
46 Correct 246 ms 6668 KB Output is correct
47 Correct 230 ms 10320 KB Output is correct
48 Correct 212 ms 10564 KB Output is correct
49 Correct 851 ms 31032 KB Output is correct
50 Correct 834 ms 30940 KB Output is correct
51 Correct 944 ms 31316 KB Output is correct
52 Correct 935 ms 31280 KB Output is correct
53 Correct 929 ms 31492 KB Output is correct
54 Correct 862 ms 31200 KB Output is correct
55 Execution timed out 1528 ms 56052 KB Time limit exceeded
56 Halted 0 ms 0 KB -