Submission #1056127

#TimeUsernameProblemLanguageResultExecution timeMemory
1056127cpdreamerFinancial Report (JOI21_financial)C++14
28 / 100
73 ms7632 KiB
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <utility>
#define V vector
#define P pair
#define S second
#define F first
#define pb push_back
#define all(v) v.begin(),v.end()
typedef long long ll;
using namespace __gnu_pbds;
using namespace std;
typedef tree<int,null_type,less<int>,rb_tree_tag,
        tree_order_statistics_node_update> indexed_set;
static int called = 0;const long long MOD = 1e9+7; // 1e9 + 7

void file(){
    freopen("input.txt.txt","r",stdin);
    freopen("output.txt.txt","w",stdout);
}
void file(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}
void modify(int &a,int v1,int v2){
    if(a==-1)
        a=max(v1,v2);
    else
        a=min(a,max(v1,v2));
}
bool dp[401][401];
int max_value[401][401];
void solve() {
    int n;
    cin >> n;
    int d;
    cin >> d;
    int A[n];
    memset(dp, false, sizeof(dp));
    memset(max_value, -1, sizeof(max_value));
    dp[0][1] = true;
    for(int i=0;i<n;i++)
        cin>>A[i];
    max_value[0][1]=A[0];
    for(int i=1;i<n;i++){
        dp[i][1]=true;
        max_value[i][1]=A[i];
        for(int j=1;j<=i+1;j++){
            for(int g=max(0,i-d);g<=i;g++){
                if(A[i]>max_value[g][j-1]){
                    if(dp[g][j-1]) {
                        dp[i][j]=true;
                        modify(max_value[i][j], A[i], max_value[g][j - 1]);
                    }
                }
                else{
                    if(dp[g][j]){
                        dp[i][j]=true;
                        modify(max_value[i][j],A[i],max_value[g][j]);
                    }
                }
            }
        }
    }
    int ans=1;
    for(int i=1;i<=400;i++){
        if(dp[n-1][i]){
            ans=i;
        }
    }
    cout<<ans<<endl;
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    //file();
    solve();
    return 0;
}

Compilation message (stderr)

Main.cpp: In function 'void file()':
Main.cpp:18:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   18 |     freopen("input.txt.txt","r",stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:19:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   19 |     freopen("output.txt.txt","w",stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp: In function 'void file(std::string)':
Main.cpp:22:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   22 |     freopen((s + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:23:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   23 |     freopen((s + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp: At global scope:
Main.cpp:15:12: warning: 'called' defined but not used [-Wunused-variable]
   15 | static int called = 0;const long long MOD = 1e9+7; // 1e9 + 7
      |            ^~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...