oj.uz

Submission #892157

# Submission time Handle Problem Language Result Execution time Memory
892157 2023-12-25T02:13:40 Z Peter2017 Financial Report (JOI21_financial) C++14
0 / 100
 286 ms 394788 KB 
#include <bits/stdc++.h>
#define fi first
#define se second
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pill pair<int,ll>
#define mem(a, b) memset(a, b, sizeof(a))
#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)
#define name "test"

using namespace std;

const int N = 1e6 + 5;
const int mod = 1e9 + 7;
const ll oo = 1e18 + 69;

template <typename T1, typename T2> bool maxi(T1 &a, T2 b){if (a < b){a = b; return 1;} return 0;}
template <typename T1, typename T2> bool mini(T1 &a, T2 b){if (a > b){a = b; return 1;} return 0;}

int n;
int k;
int D;
int a[N];
int f[(int)7e3 + 2][(int)7e3 + 2];

void load(){
    cin.tie(0)->sync_with_stdio(0);
    if (fopen(name".inp", "r")){
        freopen(name".inp", "r", stdin);
        freopen(name".out", "w", stdout);
    }
}

void input(){
    cin >> n >> D;
    for (int i = 1; i <= n; i++){
        cin >> a[i];
    }
}

void compress(){
    vector <int> value;
    for (int i = 1; i <= n; i++)
        value.push_back(a[i]);
    sort(value.begin(), value.end());
    value.erase(unique(value.begin(), value.end()), value.end());
    for (int i = 1; i <= n; i++)
        a[i] = lower_bound(value.begin(), value.end(), a[i]) - value.begin() + 1;
    k = value.size();
}

void solve(){
    compress();
    mem(f, -0x3f);
    for (int i = 1; i <= n; i++){
        f[i][a[i]] = 1;
        for (int j = i - 1; j >= max(1, i - D); j--){
            if (a[j] < a[i])
                maxi(f[i][a[i]], f[j][a[i] - 1] + 1);
            else maxi(f[i][a[j]], f[j][a[j]]);
        }
        for (int j = 1; j <= k; j++){
            maxi(f[i][j], f[i][j - 1]);
        }
    }
    cout << f[n][k];
}

int main(){
    load();
    input();
    solve();
}

Compilation message

Main.cpp: In function 'void load()':
Main.cpp:31:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   31 |         freopen(name".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:32:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   32 |         freopen(name".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 193360 KB Output is correct
2 Correct 32 ms 193372 KB Output is correct
3 Correct 31 ms 193360 KB Output is correct
4 Correct 31 ms 193436 KB Output is correct
5 Correct 32 ms 193448 KB Output is correct
6 Correct 32 ms 193472 KB Output is correct
7 Correct 34 ms 193328 KB Output is correct
8 Correct 32 ms 193372 KB Output is correct
9 Correct 37 ms 193400 KB Output is correct
10 Correct 31 ms 193364 KB Output is correct
11 Correct 31 ms 193372 KB Output is correct
12 Correct 31 ms 193372 KB Output is correct
13 Correct 31 ms 193360 KB Output is correct
14 Correct 31 ms 193448 KB Output is correct
15 Incorrect 31 ms 193364 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 193360 KB Output is correct
2 Correct 32 ms 193372 KB Output is correct
3 Correct 31 ms 193360 KB Output is correct
4 Correct 31 ms 193436 KB Output is correct
5 Correct 32 ms 193448 KB Output is correct
6 Correct 32 ms 193472 KB Output is correct
7 Correct 34 ms 193328 KB Output is correct
8 Correct 32 ms 193372 KB Output is correct
9 Correct 37 ms 193400 KB Output is correct
10 Correct 31 ms 193364 KB Output is correct
11 Correct 31 ms 193372 KB Output is correct
12 Correct 31 ms 193372 KB Output is correct
13 Correct 31 ms 193360 KB Output is correct
14 Correct 31 ms 193448 KB Output is correct
15 Incorrect 31 ms 193364 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 193360 KB Output is correct
2 Correct 32 ms 193372 KB Output is correct
3 Correct 31 ms 193360 KB Output is correct
4 Correct 31 ms 193436 KB Output is correct
5 Correct 32 ms 193448 KB Output is correct
6 Correct 32 ms 193472 KB Output is correct
7 Correct 34 ms 193328 KB Output is correct
8 Correct 32 ms 193372 KB Output is correct
9 Correct 37 ms 193400 KB Output is correct
10 Correct 31 ms 193364 KB Output is correct
11 Correct 31 ms 193372 KB Output is correct
12 Correct 31 ms 193372 KB Output is correct
13 Correct 31 ms 193360 KB Output is correct
14 Correct 31 ms 193448 KB Output is correct
15 Incorrect 31 ms 193364 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 231 ms 394788 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 286 ms 394748 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 33 ms 193360 KB Output is correct
2 Correct 32 ms 193372 KB Output is correct
3 Correct 31 ms 193360 KB Output is correct
4 Correct 31 ms 193436 KB Output is correct
5 Correct 32 ms 193448 KB Output is correct
6 Correct 32 ms 193472 KB Output is correct
7 Correct 34 ms 193328 KB Output is correct
8 Correct 32 ms 193372 KB Output is correct
9 Correct 37 ms 193400 KB Output is correct
10 Correct 31 ms 193364 KB Output is correct
11 Correct 31 ms 193372 KB Output is correct
12 Correct 31 ms 193372 KB Output is correct
13 Correct 31 ms 193360 KB Output is correct
14 Correct 31 ms 193448 KB Output is correct
15 Incorrect 31 ms 193364 KB Output isn't correct
16 Halted 0 ms 0 KB -