oj.uz

Submission #847543

# Submission time Handle Problem Language Result Execution time Memory
847543 2023-09-09T20:14:02 Z Mr_Ph Financial Report (JOI21_financial) C++14
0 / 100
 525 ms 1039988 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=ans(idx+1,(arr[idx]>arr[prv]?idx:prv),idx)+(arr[idx]>arr[prv]);
    if((idx-prv1<d&&prv!=n)||(prv1==n))
        e=max(e,ans(idx+1,prv,prv1));
    return dp[idx][prv][prv1]=e;
}
void preprocess() {}
void solve()
{
   cin>>n>>d;
   memset(dp,-1,sizeof dp);
   arr.resize(n);
   ent(arr);
   arr.push_back(-1e9);
   cout<<ans(0,n,0)<<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:41:4: note: in expansion of macro 'ent'
   41 |    ent(arr);
      |    ^~~

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 84 ms 508920 KB Output is correct
2 Correct 56 ms 508752 KB Output is correct
3 Correct 61 ms 508752 KB Output is correct
4 Correct 57 ms 508720 KB Output is correct
5 Correct 58 ms 508944 KB Output is correct
6 Correct 56 ms 508752 KB Output is correct
7 Correct 57 ms 508772 KB Output is correct
8 Correct 56 ms 508752 KB Output is correct
9 Correct 58 ms 508756 KB Output is correct
10 Correct 56 ms 508752 KB Output is correct
11 Correct 57 ms 508952 KB Output is correct
12 Correct 56 ms 508752 KB Output is correct
13 Correct 56 ms 508752 KB Output is correct
14 Correct 56 ms 508748 KB Output is correct
15 Incorrect 56 ms 508908 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 84 ms 508920 KB Output is correct
2 Correct 56 ms 508752 KB Output is correct
3 Correct 61 ms 508752 KB Output is correct
4 Correct 57 ms 508720 KB Output is correct
5 Correct 58 ms 508944 KB Output is correct
6 Correct 56 ms 508752 KB Output is correct
7 Correct 57 ms 508772 KB Output is correct
8 Correct 56 ms 508752 KB Output is correct
9 Correct 58 ms 508756 KB Output is correct
10 Correct 56 ms 508752 KB Output is correct
11 Correct 57 ms 508952 KB Output is correct
12 Correct 56 ms 508752 KB Output is correct
13 Correct 56 ms 508752 KB Output is correct
14 Correct 56 ms 508748 KB Output is correct
15 Incorrect 56 ms 508908 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 84 ms 508920 KB Output is correct
2 Correct 56 ms 508752 KB Output is correct
3 Correct 61 ms 508752 KB Output is correct
4 Correct 57 ms 508720 KB Output is correct
5 Correct 58 ms 508944 KB Output is correct
6 Correct 56 ms 508752 KB Output is correct
7 Correct 57 ms 508772 KB Output is correct
8 Correct 56 ms 508752 KB Output is correct
9 Correct 58 ms 508756 KB Output is correct
10 Correct 56 ms 508752 KB Output is correct
11 Correct 57 ms 508952 KB Output is correct
12 Correct 56 ms 508752 KB Output is correct
13 Correct 56 ms 508752 KB Output is correct
14 Correct 56 ms 508748 KB Output is correct
15 Incorrect 56 ms 508908 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

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

Subtask #5
0 / 5.0

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

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 84 ms 508920 KB Output is correct
2 Correct 56 ms 508752 KB Output is correct
3 Correct 61 ms 508752 KB Output is correct
4 Correct 57 ms 508720 KB Output is correct
5 Correct 58 ms 508944 KB Output is correct
6 Correct 56 ms 508752 KB Output is correct
7 Correct 57 ms 508772 KB Output is correct
8 Correct 56 ms 508752 KB Output is correct
9 Correct 58 ms 508756 KB Output is correct
10 Correct 56 ms 508752 KB Output is correct
11 Correct 57 ms 508952 KB Output is correct
12 Correct 56 ms 508752 KB Output is correct
13 Correct 56 ms 508752 KB Output is correct
14 Correct 56 ms 508748 KB Output is correct
15 Incorrect 56 ms 508908 KB Output isn't correct
16 Halted 0 ms 0 KB -