oj.uz

Submission #847549

# Submission time Handle Problem Language Result Execution time Memory
847549 2023-09-09T20:55:45 Z Mr_Ph Financial Report (JOI21_financial) C++14
33 / 100
 489 ms 1036692 KB 
///Never gonna give you up.
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
typedef long long ll;
typedef long long int lli;
typedef unsigned long long ull;
using namespace std;
using namespace __gnu_pbds;
template<class x>
using ordered_set = tree<x, null_type,less<x>, rb_tree_tag,tree_order_statistics_node_update>;
const ll mod=(ll)1e9+7;
const ll mod1=998244353;
///the defines :)
#define endl '\n'
#define vi vector<int>
#define vll vector<ll>
#define ent(arr) for(int i=0;i<arr.size();i++)cin>>arr[i];
#define all(arr) arr.begin(),arr.end()
#define allr(arr) arr.rbegin(),arr.rend()
#define sz size()
#define int long long
int n,d;
vi arr;
int dp[402][402][402];
int ans(int idx,int prv,int prv1)
{
    if(idx==n)
        return 0;
    if(dp[idx][prv][prv1]!=-1)
        return dp[idx][prv][prv1];
    int e=0;
    if(arr[idx]<arr[prv])
        e=max(ans(idx+1,prv,idx),e);
    if(arr[idx]>=arr[prv])
        e=max(ans(idx+1,idx,idx)+1-(arr[idx]==arr[prv]),e);
    if(idx-prv1<d||prv==n||prv==n)
        e=max(ans(idx+1,prv,prv1),e);
    return dp[idx][prv][prv1]=e;
}
void preprocess() {}
void solve()
{
    cin>>n>>d;
    arr.resize(n);
    ent(arr);
    if(d==n)
    {
        vi ans;
        for(int i=0; i<n; i++)
        {
            int x=lower_bound(all(ans),arr[i])-ans.begin();
            if(x==ans.sz)
                ans.push_back(arr[i]);
            else
                ans[x]=arr[i];
        }
        cout<<ans.sz<<endl;
    }
    else
    {
        memset(dp,-1,sizeof dp);
        arr.push_back(-1e9);
        cout<<ans(0,n,n)<<endl;
    }
}
signed main()
{
    // freopen("div7.in","r",stdin);
    //freopen("div7.out","w",stdout);
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    preprocess();
    //bla();
    int t=1;
    //cin>>t;
    while(t--)
        solve();
}

Compilation message

Main.cpp: In function 'void solve()':
Main.cpp:18:31: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 | #define ent(arr) for(int i=0;i<arr.size();i++)cin>>arr[i];
      |                              ~^~~~~~~~~~~
Main.cpp:46:5: note: in expansion of macro 'ent'
   46 |     ent(arr);
      |     ^~~
Main.cpp:53:17: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |             if(x==ans.sz)
      |                 ^

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 56 ms 508756 KB Output is correct
5 Correct 56 ms 508740 KB Output is correct
6 Correct 58 ms 509028 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 55 ms 508956 KB Output is correct
11 Correct 56 ms 508756 KB Output is correct
12 Correct 59 ms 508796 KB Output is correct
13 Correct 56 ms 508760 KB Output is correct
14 Correct 56 ms 508756 KB Output is correct
15 Correct 56 ms 508836 KB Output is correct
16 Correct 55 ms 508728 KB Output is correct
17 Correct 57 ms 508752 KB Output is correct
18 Correct 57 ms 508944 KB Output is correct
19 Correct 56 ms 508752 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 59 ms 508752 KB Output is correct
22 Correct 56 ms 508752 KB Output is correct
23 Correct 56 ms 508952 KB Output is correct
24 Correct 56 ms 508844 KB Output is correct
25 Correct 56 ms 508924 KB Output is correct
26 Correct 56 ms 508756 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 56 ms 508756 KB Output is correct
5 Correct 56 ms 508740 KB Output is correct
6 Correct 58 ms 509028 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 55 ms 508956 KB Output is correct
11 Correct 56 ms 508756 KB Output is correct
12 Correct 59 ms 508796 KB Output is correct
13 Correct 56 ms 508760 KB Output is correct
14 Correct 56 ms 508756 KB Output is correct
15 Correct 56 ms 508836 KB Output is correct
16 Correct 55 ms 508728 KB Output is correct
17 Correct 57 ms 508752 KB Output is correct
18 Correct 57 ms 508944 KB Output is correct
19 Correct 56 ms 508752 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 59 ms 508752 KB Output is correct
22 Correct 56 ms 508752 KB Output is correct
23 Correct 56 ms 508952 KB Output is correct
24 Correct 56 ms 508844 KB Output is correct
25 Correct 56 ms 508924 KB Output is correct
26 Correct 56 ms 508756 KB Output is correct
27 Correct 56 ms 508752 KB Output is correct
28 Correct 59 ms 508756 KB Output is correct
29 Correct 60 ms 508980 KB Output is correct
30 Correct 62 ms 508756 KB Output is correct
31 Correct 71 ms 508996 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 56 ms 508780 KB Output is correct
34 Correct 59 ms 508812 KB Output is correct
35 Correct 58 ms 508896 KB Output is correct
36 Correct 70 ms 508988 KB Output is correct
37 Correct 56 ms 508752 KB Output is correct
38 Correct 57 ms 509236 KB Output is correct
39 Correct 64 ms 508752 KB Output is correct
40 Correct 66 ms 508784 KB Output is correct

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 56 ms 508756 KB Output is correct
5 Correct 56 ms 508740 KB Output is correct
6 Correct 58 ms 509028 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 55 ms 508956 KB Output is correct
11 Correct 56 ms 508756 KB Output is correct
12 Correct 59 ms 508796 KB Output is correct
13 Correct 56 ms 508760 KB Output is correct
14 Correct 56 ms 508756 KB Output is correct
15 Correct 56 ms 508836 KB Output is correct
16 Correct 55 ms 508728 KB Output is correct
17 Correct 57 ms 508752 KB Output is correct
18 Correct 57 ms 508944 KB Output is correct
19 Correct 56 ms 508752 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 59 ms 508752 KB Output is correct
22 Correct 56 ms 508752 KB Output is correct
23 Correct 56 ms 508952 KB Output is correct
24 Correct 56 ms 508844 KB Output is correct
25 Correct 56 ms 508924 KB Output is correct
26 Correct 56 ms 508756 KB Output is correct
27 Correct 56 ms 508752 KB Output is correct
28 Correct 59 ms 508756 KB Output is correct
29 Correct 60 ms 508980 KB Output is correct
30 Correct 62 ms 508756 KB Output is correct
31 Correct 71 ms 508996 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 56 ms 508780 KB Output is correct
34 Correct 59 ms 508812 KB Output is correct
35 Correct 58 ms 508896 KB Output is correct
36 Correct 70 ms 508988 KB Output is correct
37 Correct 56 ms 508752 KB Output is correct
38 Correct 57 ms 509236 KB Output is correct
39 Correct 64 ms 508752 KB Output is correct
40 Correct 66 ms 508784 KB Output is correct
41 Runtime error 449 ms 1031848 KB Execution killed with signal 11
42 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Runtime error 489 ms 1036692 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 2652 KB Output is correct
2 Correct 32 ms 2648 KB Output is correct
3 Correct 36 ms 2828 KB Output is correct
4 Correct 37 ms 2820 KB Output is correct
5 Correct 39 ms 3792 KB Output is correct
6 Correct 37 ms 2908 KB Output is correct
7 Correct 28 ms 7636 KB Output is correct
8 Correct 23 ms 2652 KB Output is correct
9 Correct 29 ms 3792 KB Output is correct
10 Correct 33 ms 2652 KB Output is correct
11 Correct 36 ms 2652 KB Output is correct
12 Correct 24 ms 2652 KB Output is correct

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 56 ms 508756 KB Output is correct
5 Correct 56 ms 508740 KB Output is correct
6 Correct 58 ms 509028 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 55 ms 508956 KB Output is correct
11 Correct 56 ms 508756 KB Output is correct
12 Correct 59 ms 508796 KB Output is correct
13 Correct 56 ms 508760 KB Output is correct
14 Correct 56 ms 508756 KB Output is correct
15 Correct 56 ms 508836 KB Output is correct
16 Correct 55 ms 508728 KB Output is correct
17 Correct 57 ms 508752 KB Output is correct
18 Correct 57 ms 508944 KB Output is correct
19 Correct 56 ms 508752 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 59 ms 508752 KB Output is correct
22 Correct 56 ms 508752 KB Output is correct
23 Correct 56 ms 508952 KB Output is correct
24 Correct 56 ms 508844 KB Output is correct
25 Correct 56 ms 508924 KB Output is correct
26 Correct 56 ms 508756 KB Output is correct
27 Correct 56 ms 508752 KB Output is correct
28 Correct 59 ms 508756 KB Output is correct
29 Correct 60 ms 508980 KB Output is correct
30 Correct 62 ms 508756 KB Output is correct
31 Correct 71 ms 508996 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 56 ms 508780 KB Output is correct
34 Correct 59 ms 508812 KB Output is correct
35 Correct 58 ms 508896 KB Output is correct
36 Correct 70 ms 508988 KB Output is correct
37 Correct 56 ms 508752 KB Output is correct
38 Correct 57 ms 509236 KB Output is correct
39 Correct 64 ms 508752 KB Output is correct
40 Correct 66 ms 508784 KB Output is correct
41 Runtime error 449 ms 1031848 KB Execution killed with signal 11
42 Halted 0 ms 0 KB -