oj.uz

Submission #515752

# Submission time Handle Problem Language Result Execution time Memory
515752 2022-01-19T15:08:05 Z _Monkey_ Financial Report (JOI21_financial) C++17
45 / 100
 56 ms 3656 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
const int maxx=407;
int dp[maxx][maxn];
void sub2(){
    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;
}


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;
}

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 0 ms 204 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 0 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 1 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 5 ms 204 KB Output is correct
19 Correct 2 ms 204 KB Output is correct
20 Correct 6 ms 332 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 204 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 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 0 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 1 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 5 ms 204 KB Output is correct
19 Correct 2 ms 204 KB Output is correct
20 Correct 6 ms 332 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 204 KB Output is correct
27 Correct 0 ms 204 KB Output is correct
28 Correct 2 ms 3404 KB Output is correct
29 Correct 2 ms 3148 KB Output is correct
30 Correct 3 ms 3276 KB Output is correct
31 Correct 12 ms 3468 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 2 ms 3404 KB Output is correct
34 Correct 2 ms 3404 KB Output is correct
35 Correct 4 ms 3484 KB Output is correct
36 Correct 5 ms 3404 KB Output is correct
37 Correct 3 ms 3276 KB Output is correct
38 Correct 3 ms 3276 KB Output is correct
39 Correct 3 ms 3404 KB Output is correct
40 Correct 4 ms 3404 KB Output is correct

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 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 0 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 1 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 5 ms 204 KB Output is correct
19 Correct 2 ms 204 KB Output is correct
20 Correct 6 ms 332 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 204 KB Output is correct
27 Correct 0 ms 204 KB Output is correct
28 Correct 2 ms 3404 KB Output is correct
29 Correct 2 ms 3148 KB Output is correct
30 Correct 3 ms 3276 KB Output is correct
31 Correct 12 ms 3468 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 2 ms 3404 KB Output is correct
34 Correct 2 ms 3404 KB Output is correct
35 Correct 4 ms 3484 KB Output is correct
36 Correct 5 ms 3404 KB Output is correct
37 Correct 3 ms 3276 KB Output is correct
38 Correct 3 ms 3276 KB Output is correct
39 Correct 3 ms 3404 KB Output is correct
40 Correct 4 ms 3404 KB Output is correct
41 Correct 1 ms 332 KB Output is correct
42 Incorrect 1 ms 324 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 28 ms 1428 KB Output is correct
2 Correct 28 ms 1448 KB Output is correct
3 Correct 31 ms 1412 KB Output is correct
4 Correct 36 ms 1476 KB Output is correct
5 Correct 38 ms 1472 KB Output is correct
6 Correct 30 ms 1484 KB Output is correct
7 Correct 28 ms 3604 KB Output is correct
8 Correct 28 ms 1372 KB Output is correct
9 Correct 28 ms 2628 KB Output is correct
10 Correct 29 ms 1376 KB Output is correct
11 Correct 29 ms 1484 KB Output is correct
12 Correct 29 ms 1428 KB Output is correct
13 Correct 27 ms 1456 KB Output is correct
14 Correct 27 ms 1376 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 1440 KB Output is correct
2 Correct 38 ms 1440 KB Output is correct
3 Correct 42 ms 1484 KB Output is correct
4 Correct 43 ms 1476 KB Output is correct
5 Correct 44 ms 2072 KB Output is correct
6 Correct 56 ms 1484 KB Output is correct
7 Correct 30 ms 3656 KB Output is correct
8 Correct 28 ms 1484 KB Output is correct
9 Correct 37 ms 2120 KB Output is correct
10 Correct 40 ms 1476 KB Output is correct
11 Correct 39 ms 1420 KB Output is correct
12 Correct 35 ms 1384 KB Output is correct

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 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 0 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 1 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 5 ms 204 KB Output is correct
19 Correct 2 ms 204 KB Output is correct
20 Correct 6 ms 332 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 204 KB Output is correct
27 Correct 0 ms 204 KB Output is correct
28 Correct 2 ms 3404 KB Output is correct
29 Correct 2 ms 3148 KB Output is correct
30 Correct 3 ms 3276 KB Output is correct
31 Correct 12 ms 3468 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 2 ms 3404 KB Output is correct
34 Correct 2 ms 3404 KB Output is correct
35 Correct 4 ms 3484 KB Output is correct
36 Correct 5 ms 3404 KB Output is correct
37 Correct 3 ms 3276 KB Output is correct
38 Correct 3 ms 3276 KB Output is correct
39 Correct 3 ms 3404 KB Output is correct
40 Correct 4 ms 3404 KB Output is correct
41 Correct 1 ms 332 KB Output is correct
42 Incorrect 1 ms 324 KB Output isn't correct
43 Halted 0 ms 0 KB -