oj.uz

Submission #515851

# Submission time Handle Problem Language Result Execution time Memory
515851 2022-01-20T00:46:54 Z _Monkey_ Financial Report (JOI21_financial) C++17
45 / 100
 182 ms 478204 KB 
// Song Đồng Gia Phúc

/*
 *      ʕ•ᴥ•ʔ
 *  [Penguin_024]
 *       U U
 */

#include<bits/stdc++.h>
using namespace std;

#define el '\n'
#define ll long long
#define ull unsigned long long
#define vll vector<ll>
#define double double
#define fi first
#define se second
#define cico(A) freopen(A".INP","r",stdin); freopen(A".OUT","w",stdout);
template<typename x,typename y> void amin(x &a,y b){if(b<a) a=b;}
template<typename x,typename y> void amax(x &a,y b){if(b>a) a=b;}
const int maxn=3e5+7,maxq=19*1e4+7;
const string yes="YES\n",no="NO\n";

int n,d,a[maxn];
int ans,res,oo=1e9+7;

/////// SUB 4
void sub4(){
    vector<int> f;
    ans = 0;
    for(int i=n;i>0;--i){
        while( !f.empty() && a[i]>=f.back() ) f.pop_back();
        f.push_back(a[i]);
        amax( ans , f.size() );
    }
    cout << ans;
}

/////// SUB 1
void quaylui(int id,int maxi,int sum,int kc){
    if(kc>=d) return;
    if(id==n+1){
        amax(ans,sum);
        return;
    }
    quaylui( id+1 , max(maxi,a[id]) , sum + (a[id]>maxi) , 0 );
    quaylui( id+1 , maxi , sum , kc + (sum>0) );
}

void sub1(){
    ans = 0;
    quaylui(1,-1,0,0);
    cout << ans;
}

/////// SUB 5
void sub5(){
    vector<int> f(1,-1);
    for(int i=1;i<=n;++i){
        if( a[i]>f.back() ){
            f.push_back(a[i]);
        } else {
            res = lower_bound( f.begin() , f.end() , a[i] ) - f.begin();
            f[res] = a[i];
        }
    }
    ans = f.size() - 1;
    cout << ans;
}

/////// SUB 2
void sub2(){
    const int maxx=407;
    int dp[maxx][maxn];
    for(int i=1;i<=n;++i){
        for(int j=1;j<=n;++j) dp[i][j] = oo;
    }
    for(int i=1;i<=n;++i){
        dp[i][1] = a[i];
        for(int j=i-1;j>0 && i-j<=d;j--){
            for(int z=2;z<=i;z++){
                if( a[i] > dp[j][z-1] ) amin( dp[i][z] ,a[i] );
                amin( dp[i][z] , max(dp[j][z],a[i]) );
            }
        }
    }
    for(int i=1;i<=n;++i) if(dp[n][i] < oo) ans=i;
    cout << ans;
}

/////// SUB 3
void sub3(){
    const int maxx = 7e3+7;
    int dp[maxx],kc=0;
    ans = 0;
    for(int i=1;i<=n;++i){
        dp[i] = 1;
        for(int j=i-1;j>0;--j){
            if( a[i] > a[j] ){
                amax( dp[i] , dp[j] + 1 );
                kc=0;
            } else kc++;
            if(kc>=d) break;
        }
        amax( ans , dp[i] );
    }
    cout << ans;
}

signed main(){
    ios_base::sync_with_stdio(0);cin.tie(0);

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

    // sub 4
    if(d==1){
        sub4();
        return 0;
    }

    // sub 1
    if(n<=20){
        sub1();
        return 0;
    }

    // sub 5
    if(d==n){
        sub5();
        return 0;
    }

    // sub 2
    if(n<=400){
        sub2();
        return 0;
    }

    // sub 3
    if(n<=7000){
        sub3();
        return 0;
    }

    return 0;
}

Compilation message

Main.cpp: In instantiation of 'void amax(x&, y) [with x = int; y = long unsigned int]':
Main.cpp:35:30:   required from here
Main.cpp:21:57: warning: comparison of integer expressions of different signedness: 'long unsigned int' and 'int' [-Wsign-compare]
   21 | template<typename x,typename y> void amax(x &a,y b){if(b>a) a=b;}
      |                                                        ~^~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 260 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 6 ms 204 KB Output is correct
19 Correct 2 ms 204 KB Output is correct
20 Correct 6 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 3 ms 204 KB Output is correct
23 Correct 0 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 312 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 260 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 6 ms 204 KB Output is correct
19 Correct 2 ms 204 KB Output is correct
20 Correct 6 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 3 ms 204 KB Output is correct
23 Correct 0 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 312 KB Output is correct
27 Correct 0 ms 204 KB Output is correct
28 Correct 182 ms 478076 KB Output is correct
29 Correct 174 ms 478168 KB Output is correct
30 Correct 171 ms 478116 KB Output is correct
31 Correct 172 ms 478084 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 178 ms 478120 KB Output is correct
34 Correct 168 ms 478172 KB Output is correct
35 Correct 165 ms 478148 KB Output is correct
36 Correct 175 ms 478084 KB Output is correct
37 Correct 170 ms 478148 KB Output is correct
38 Correct 180 ms 478204 KB Output is correct
39 Correct 177 ms 478164 KB Output is correct
40 Correct 171 ms 478144 KB Output is correct

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 260 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 6 ms 204 KB Output is correct
19 Correct 2 ms 204 KB Output is correct
20 Correct 6 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 3 ms 204 KB Output is correct
23 Correct 0 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 312 KB Output is correct
27 Correct 0 ms 204 KB Output is correct
28 Correct 182 ms 478076 KB Output is correct
29 Correct 174 ms 478168 KB Output is correct
30 Correct 171 ms 478116 KB Output is correct
31 Correct 172 ms 478084 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 178 ms 478120 KB Output is correct
34 Correct 168 ms 478172 KB Output is correct
35 Correct 165 ms 478148 KB Output is correct
36 Correct 175 ms 478084 KB Output is correct
37 Correct 170 ms 478148 KB Output is correct
38 Correct 180 ms 478204 KB Output is correct
39 Correct 177 ms 478164 KB Output is correct
40 Correct 171 ms 478144 KB Output is correct
41 Correct 1 ms 332 KB Output is correct
42 Incorrect 3 ms 332 KB Output isn't correct
43 Halted 0 ms 0 KB -

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 1356 KB Output is correct
2 Correct 37 ms 1420 KB Output is correct
3 Correct 30 ms 1388 KB Output is correct
4 Correct 30 ms 1368 KB Output is correct
5 Correct 40 ms 1388 KB Output is correct
6 Correct 39 ms 1412 KB Output is correct
7 Correct 34 ms 3648 KB Output is correct
8 Correct 26 ms 1376 KB Output is correct
9 Correct 27 ms 2640 KB Output is correct
10 Correct 31 ms 1396 KB Output is correct
11 Correct 29 ms 1400 KB Output is correct
12 Correct 38 ms 1376 KB Output is correct
13 Correct 33 ms 1684 KB Output is correct
14 Correct 27 ms 1352 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 1364 KB Output is correct
2 Correct 37 ms 1440 KB Output is correct
3 Correct 41 ms 1476 KB Output is correct
4 Correct 47 ms 1484 KB Output is correct
5 Correct 43 ms 2004 KB Output is correct
6 Correct 42 ms 1516 KB Output is correct
7 Correct 28 ms 3592 KB Output is correct
8 Correct 27 ms 1404 KB Output is correct
9 Correct 39 ms 2148 KB Output is correct
10 Correct 42 ms 1520 KB Output is correct
11 Correct 39 ms 1392 KB Output is correct
12 Correct 38 ms 1480 KB Output is correct

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 260 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 6 ms 204 KB Output is correct
19 Correct 2 ms 204 KB Output is correct
20 Correct 6 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 3 ms 204 KB Output is correct
23 Correct 0 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 312 KB Output is correct
27 Correct 0 ms 204 KB Output is correct
28 Correct 182 ms 478076 KB Output is correct
29 Correct 174 ms 478168 KB Output is correct
30 Correct 171 ms 478116 KB Output is correct
31 Correct 172 ms 478084 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 178 ms 478120 KB Output is correct
34 Correct 168 ms 478172 KB Output is correct
35 Correct 165 ms 478148 KB Output is correct
36 Correct 175 ms 478084 KB Output is correct
37 Correct 170 ms 478148 KB Output is correct
38 Correct 180 ms 478204 KB Output is correct
39 Correct 177 ms 478164 KB Output is correct
40 Correct 171 ms 478144 KB Output is correct
41 Correct 1 ms 332 KB Output is correct
42 Incorrect 3 ms 332 KB Output isn't correct
43 Halted 0 ms 0 KB -