oj.uz

Submission #847544

# Submission time Handle Problem Language Result Execution time Memory
847544 2023-09-09T20:25:38 Z Mr_Ph Financial Report (JOI21_financial) C++14
0 / 100
 380 ms 786880 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[7002][7002];
int ans(int idx,int prv)
{
    if(idx==n)return 0;
    if(dp[idx][prv]!=-1)return dp[idx][prv];
    int e=0;
    if(arr[idx]>=arr[prv])
        e=max(e,ans(idx+1,idx)+1-(arr[idx]==arr[prv]));
    if(idx-prv<d||prv==n)
        e=max(e,ans(idx+1,prv));
    return dp[idx][prv]=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)<<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:43:4: note: in expansion of macro 'ent'
   43 |    ent(arr);
      |    ^~~

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 384164 KB Output is correct
2 Correct 42 ms 384084 KB Output is correct
3 Correct 43 ms 384080 KB Output is correct
4 Correct 42 ms 384084 KB Output is correct
5 Correct 42 ms 384040 KB Output is correct
6 Correct 42 ms 384080 KB Output is correct
7 Correct 43 ms 384084 KB Output is correct
8 Correct 42 ms 384024 KB Output is correct
9 Correct 43 ms 384080 KB Output is correct
10 Correct 42 ms 384088 KB Output is correct
11 Correct 43 ms 384084 KB Output is correct
12 Correct 43 ms 384128 KB Output is correct
13 Correct 42 ms 384084 KB Output is correct
14 Correct 42 ms 384084 KB Output is correct
15 Incorrect 46 ms 384036 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 384164 KB Output is correct
2 Correct 42 ms 384084 KB Output is correct
3 Correct 43 ms 384080 KB Output is correct
4 Correct 42 ms 384084 KB Output is correct
5 Correct 42 ms 384040 KB Output is correct
6 Correct 42 ms 384080 KB Output is correct
7 Correct 43 ms 384084 KB Output is correct
8 Correct 42 ms 384024 KB Output is correct
9 Correct 43 ms 384080 KB Output is correct
10 Correct 42 ms 384088 KB Output is correct
11 Correct 43 ms 384084 KB Output is correct
12 Correct 43 ms 384128 KB Output is correct
13 Correct 42 ms 384084 KB Output is correct
14 Correct 42 ms 384084 KB Output is correct
15 Incorrect 46 ms 384036 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 384164 KB Output is correct
2 Correct 42 ms 384084 KB Output is correct
3 Correct 43 ms 384080 KB Output is correct
4 Correct 42 ms 384084 KB Output is correct
5 Correct 42 ms 384040 KB Output is correct
6 Correct 42 ms 384080 KB Output is correct
7 Correct 43 ms 384084 KB Output is correct
8 Correct 42 ms 384024 KB Output is correct
9 Correct 43 ms 384080 KB Output is correct
10 Correct 42 ms 384088 KB Output is correct
11 Correct 43 ms 384084 KB Output is correct
12 Correct 43 ms 384128 KB Output is correct
13 Correct 42 ms 384084 KB Output is correct
14 Correct 42 ms 384084 KB Output is correct
15 Incorrect 46 ms 384036 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 380 ms 786880 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 366 ms 784408 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 65 ms 384164 KB Output is correct
2 Correct 42 ms 384084 KB Output is correct
3 Correct 43 ms 384080 KB Output is correct
4 Correct 42 ms 384084 KB Output is correct
5 Correct 42 ms 384040 KB Output is correct
6 Correct 42 ms 384080 KB Output is correct
7 Correct 43 ms 384084 KB Output is correct
8 Correct 42 ms 384024 KB Output is correct
9 Correct 43 ms 384080 KB Output is correct
10 Correct 42 ms 384088 KB Output is correct
11 Correct 43 ms 384084 KB Output is correct
12 Correct 43 ms 384128 KB Output is correct
13 Correct 42 ms 384084 KB Output is correct
14 Correct 42 ms 384084 KB Output is correct
15 Incorrect 46 ms 384036 KB Output isn't correct
16 Halted 0 ms 0 KB -