oj.uz

Submission #892159

# Submission time Handle Problem Language Result Execution time Memory
892159 2023-12-25T02:17:24 Z Peter2017 Financial Report (JOI21_financial) C++14
14 / 100
 25 ms 192552 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 = 2e5 + 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][max(j, a[i])], f[i - 1][j]);
            maxi(f[i][j], f[i][j - 1]);
        }
    }
    cout << f[n][k];
}

int main(){
    load();
    input();
    if (n <= (int)7e3) 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
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 192080 KB Output is correct
2 Correct 22 ms 192124 KB Output is correct
3 Correct 22 ms 192344 KB Output is correct
4 Correct 21 ms 192348 KB Output is correct
5 Correct 22 ms 192080 KB Output is correct
6 Correct 21 ms 192348 KB Output is correct
7 Correct 23 ms 192192 KB Output is correct
8 Correct 23 ms 192084 KB Output is correct
9 Correct 21 ms 192080 KB Output is correct
10 Correct 22 ms 192348 KB Output is correct
11 Correct 22 ms 192196 KB Output is correct
12 Correct 24 ms 192092 KB Output is correct
13 Correct 23 ms 192308 KB Output is correct
14 Correct 22 ms 192348 KB Output is correct
15 Correct 22 ms 192184 KB Output is correct
16 Correct 25 ms 192552 KB Output is correct
17 Correct 22 ms 192080 KB Output is correct
18 Correct 22 ms 192348 KB Output is correct
19 Correct 24 ms 192236 KB Output is correct
20 Correct 22 ms 192084 KB Output is correct
21 Correct 22 ms 192224 KB Output is correct
22 Correct 21 ms 192132 KB Output is correct
23 Correct 22 ms 192348 KB Output is correct
24 Correct 22 ms 192540 KB Output is correct
25 Correct 22 ms 192220 KB Output is correct
26 Correct 22 ms 192084 KB Output is correct

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 192080 KB Output is correct
2 Correct 22 ms 192124 KB Output is correct
3 Correct 22 ms 192344 KB Output is correct
4 Correct 21 ms 192348 KB Output is correct
5 Correct 22 ms 192080 KB Output is correct
6 Correct 21 ms 192348 KB Output is correct
7 Correct 23 ms 192192 KB Output is correct
8 Correct 23 ms 192084 KB Output is correct
9 Correct 21 ms 192080 KB Output is correct
10 Correct 22 ms 192348 KB Output is correct
11 Correct 22 ms 192196 KB Output is correct
12 Correct 24 ms 192092 KB Output is correct
13 Correct 23 ms 192308 KB Output is correct
14 Correct 22 ms 192348 KB Output is correct
15 Correct 22 ms 192184 KB Output is correct
16 Correct 25 ms 192552 KB Output is correct
17 Correct 22 ms 192080 KB Output is correct
18 Correct 22 ms 192348 KB Output is correct
19 Correct 24 ms 192236 KB Output is correct
20 Correct 22 ms 192084 KB Output is correct
21 Correct 22 ms 192224 KB Output is correct
22 Correct 21 ms 192132 KB Output is correct
23 Correct 22 ms 192348 KB Output is correct
24 Correct 22 ms 192540 KB Output is correct
25 Correct 22 ms 192220 KB Output is correct
26 Correct 22 ms 192084 KB Output is correct
27 Correct 22 ms 192344 KB Output is correct
28 Incorrect 22 ms 192348 KB Output isn't correct
29 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 192080 KB Output is correct
2 Correct 22 ms 192124 KB Output is correct
3 Correct 22 ms 192344 KB Output is correct
4 Correct 21 ms 192348 KB Output is correct
5 Correct 22 ms 192080 KB Output is correct
6 Correct 21 ms 192348 KB Output is correct
7 Correct 23 ms 192192 KB Output is correct
8 Correct 23 ms 192084 KB Output is correct
9 Correct 21 ms 192080 KB Output is correct
10 Correct 22 ms 192348 KB Output is correct
11 Correct 22 ms 192196 KB Output is correct
12 Correct 24 ms 192092 KB Output is correct
13 Correct 23 ms 192308 KB Output is correct
14 Correct 22 ms 192348 KB Output is correct
15 Correct 22 ms 192184 KB Output is correct
16 Correct 25 ms 192552 KB Output is correct
17 Correct 22 ms 192080 KB Output is correct
18 Correct 22 ms 192348 KB Output is correct
19 Correct 24 ms 192236 KB Output is correct
20 Correct 22 ms 192084 KB Output is correct
21 Correct 22 ms 192224 KB Output is correct
22 Correct 21 ms 192132 KB Output is correct
23 Correct 22 ms 192348 KB Output is correct
24 Correct 22 ms 192540 KB Output is correct
25 Correct 22 ms 192220 KB Output is correct
26 Correct 22 ms 192084 KB Output is correct
27 Correct 22 ms 192344 KB Output is correct
28 Incorrect 22 ms 192348 KB Output isn't correct
29 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Runtime error 22 ms 2392 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 20 ms 2136 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 25 ms 192080 KB Output is correct
2 Correct 22 ms 192124 KB Output is correct
3 Correct 22 ms 192344 KB Output is correct
4 Correct 21 ms 192348 KB Output is correct
5 Correct 22 ms 192080 KB Output is correct
6 Correct 21 ms 192348 KB Output is correct
7 Correct 23 ms 192192 KB Output is correct
8 Correct 23 ms 192084 KB Output is correct
9 Correct 21 ms 192080 KB Output is correct
10 Correct 22 ms 192348 KB Output is correct
11 Correct 22 ms 192196 KB Output is correct
12 Correct 24 ms 192092 KB Output is correct
13 Correct 23 ms 192308 KB Output is correct
14 Correct 22 ms 192348 KB Output is correct
15 Correct 22 ms 192184 KB Output is correct
16 Correct 25 ms 192552 KB Output is correct
17 Correct 22 ms 192080 KB Output is correct
18 Correct 22 ms 192348 KB Output is correct
19 Correct 24 ms 192236 KB Output is correct
20 Correct 22 ms 192084 KB Output is correct
21 Correct 22 ms 192224 KB Output is correct
22 Correct 21 ms 192132 KB Output is correct
23 Correct 22 ms 192348 KB Output is correct
24 Correct 22 ms 192540 KB Output is correct
25 Correct 22 ms 192220 KB Output is correct
26 Correct 22 ms 192084 KB Output is correct
27 Correct 22 ms 192344 KB Output is correct
28 Incorrect 22 ms 192348 KB Output isn't correct
29 Halted 0 ms 0 KB -