oj.uz

Submission #892175

# Submission time Handle Problem Language Result Execution time Memory
892175 2023-12-25T03:21:23 Z Peter2017 Financial Report (JOI21_financial) C++14
60 / 100
 691 ms 198228 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 = 3e5 + 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];
deque <int> dq[(int)7e3 + 2];
vector <int> value;

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(){
    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 = (int)value.size();
}

namespace subtask3{
    void solve(){
        mem(f, -0x3f);
        for (int i = 1; i <= n; i++){
            f[i][a[i]] = 1;
            for (int j = 1; j <= k; j++){
                if (dq[j].size() && dq[j].front() < i - D) dq[j].pop_front();
                if (dq[j].size()) maxi(f[i][max(a[i], j)], f[dq[j].front()][j] + (j < a[i]));
            }
            for (int j = 1; j <= k; j++){
                while (dq[j].size() && f[dq[j].back()][j] <= f[i][j])
                    dq[j].pop_back();
                dq[j].push_back(i);
            }
        }
        int ans = 0;
        for (int i = 1; i <= k; i++)
            maxi(ans, f[n][i]);
        cout << ans;
    }
}

namespace subtask4{
    stack <int> st;
    void solve(){
        st.push(n);
        int ans = 1;
        for (int i = n - 1; i >= 1; i--){
            while (st.size() && a[st.top()] <= a[i]) st.pop();
            st.push(i);
            maxi(ans, st.size());
        }
        cout << ans;
    }
}

namespace subtask5{
    int b[N];
    void solve(){
        mem(b, 0x3f);
        int ans = 0;
        for (int i = 1; i <= n; i++){
            int id = lower_bound(b + 1, b + n + 1, a[i]) - b;
            if (i == n) cout << id;
            b[id] = a[i];
            maxi(ans, id);
        }
    }
}

int main(){
    load();
    input();
    compress();
    if (n <= (int)7e3){
        subtask3::solve();
        return 0;
    }
    if (D == 1){
        subtask4::solve();
        return 0;
    }
    subtask5::solve();
}

Compilation message

Main.cpp: In instantiation of 'bool maxi(T1&, T2) [with T1 = int; T2 = long unsigned int]':
Main.cpp:85:32:   required from here
Main.cpp:19:66: warning: comparison of integer expressions of different signedness: 'int' and 'long unsigned int' [-Wsign-compare]
   19 | template <typename T1, typename T2> bool maxi(T1 &a, T2 b){if (a < b){a = b; return 1;} return 0;}
      |                                                                ~~^~~
Main.cpp: In function 'void load()':
Main.cpp:33:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   33 |         freopen(name".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:34:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   34 |         freopen(name".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 198032 KB Output is correct
2 Correct 32 ms 197968 KB Output is correct
3 Correct 31 ms 197968 KB Output is correct
4 Correct 32 ms 197972 KB Output is correct
5 Correct 32 ms 197976 KB Output is correct
6 Correct 33 ms 197848 KB Output is correct
7 Correct 36 ms 197968 KB Output is correct
8 Correct 31 ms 197972 KB Output is correct
9 Correct 32 ms 197984 KB Output is correct
10 Correct 37 ms 197968 KB Output is correct
11 Correct 36 ms 197824 KB Output is correct
12 Correct 32 ms 197848 KB Output is correct
13 Correct 32 ms 197980 KB Output is correct
14 Correct 35 ms 197828 KB Output is correct
15 Correct 32 ms 197980 KB Output is correct
16 Correct 33 ms 197844 KB Output is correct
17 Correct 32 ms 197972 KB Output is correct
18 Correct 32 ms 197844 KB Output is correct
19 Correct 37 ms 197972 KB Output is correct
20 Correct 32 ms 197952 KB Output is correct
21 Correct 32 ms 197968 KB Output is correct
22 Correct 35 ms 197972 KB Output is correct
23 Correct 33 ms 197892 KB Output is correct
24 Correct 35 ms 197928 KB Output is correct
25 Correct 36 ms 197980 KB Output is correct
26 Correct 31 ms 197964 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 198032 KB Output is correct
2 Correct 32 ms 197968 KB Output is correct
3 Correct 31 ms 197968 KB Output is correct
4 Correct 32 ms 197972 KB Output is correct
5 Correct 32 ms 197976 KB Output is correct
6 Correct 33 ms 197848 KB Output is correct
7 Correct 36 ms 197968 KB Output is correct
8 Correct 31 ms 197972 KB Output is correct
9 Correct 32 ms 197984 KB Output is correct
10 Correct 37 ms 197968 KB Output is correct
11 Correct 36 ms 197824 KB Output is correct
12 Correct 32 ms 197848 KB Output is correct
13 Correct 32 ms 197980 KB Output is correct
14 Correct 35 ms 197828 KB Output is correct
15 Correct 32 ms 197980 KB Output is correct
16 Correct 33 ms 197844 KB Output is correct
17 Correct 32 ms 197972 KB Output is correct
18 Correct 32 ms 197844 KB Output is correct
19 Correct 37 ms 197972 KB Output is correct
20 Correct 32 ms 197952 KB Output is correct
21 Correct 32 ms 197968 KB Output is correct
22 Correct 35 ms 197972 KB Output is correct
23 Correct 33 ms 197892 KB Output is correct
24 Correct 35 ms 197928 KB Output is correct
25 Correct 36 ms 197980 KB Output is correct
26 Correct 31 ms 197964 KB Output is correct
27 Correct 35 ms 197972 KB Output is correct
28 Correct 33 ms 197968 KB Output is correct
29 Correct 35 ms 197992 KB Output is correct
30 Correct 34 ms 197968 KB Output is correct
31 Correct 32 ms 198156 KB Output is correct
32 Correct 33 ms 197972 KB Output is correct
33 Correct 33 ms 197968 KB Output is correct
34 Correct 35 ms 198028 KB Output is correct
35 Correct 34 ms 198024 KB Output is correct
36 Correct 35 ms 197968 KB Output is correct
37 Correct 33 ms 197924 KB Output is correct
38 Correct 33 ms 197968 KB Output is correct
39 Correct 33 ms 198040 KB Output is correct
40 Correct 36 ms 198008 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 198032 KB Output is correct
2 Correct 32 ms 197968 KB Output is correct
3 Correct 31 ms 197968 KB Output is correct
4 Correct 32 ms 197972 KB Output is correct
5 Correct 32 ms 197976 KB Output is correct
6 Correct 33 ms 197848 KB Output is correct
7 Correct 36 ms 197968 KB Output is correct
8 Correct 31 ms 197972 KB Output is correct
9 Correct 32 ms 197984 KB Output is correct
10 Correct 37 ms 197968 KB Output is correct
11 Correct 36 ms 197824 KB Output is correct
12 Correct 32 ms 197848 KB Output is correct
13 Correct 32 ms 197980 KB Output is correct
14 Correct 35 ms 197828 KB Output is correct
15 Correct 32 ms 197980 KB Output is correct
16 Correct 33 ms 197844 KB Output is correct
17 Correct 32 ms 197972 KB Output is correct
18 Correct 32 ms 197844 KB Output is correct
19 Correct 37 ms 197972 KB Output is correct
20 Correct 32 ms 197952 KB Output is correct
21 Correct 32 ms 197968 KB Output is correct
22 Correct 35 ms 197972 KB Output is correct
23 Correct 33 ms 197892 KB Output is correct
24 Correct 35 ms 197928 KB Output is correct
25 Correct 36 ms 197980 KB Output is correct
26 Correct 31 ms 197964 KB Output is correct
27 Correct 35 ms 197972 KB Output is correct
28 Correct 33 ms 197968 KB Output is correct
29 Correct 35 ms 197992 KB Output is correct
30 Correct 34 ms 197968 KB Output is correct
31 Correct 32 ms 198156 KB Output is correct
32 Correct 33 ms 197972 KB Output is correct
33 Correct 33 ms 197968 KB Output is correct
34 Correct 35 ms 198028 KB Output is correct
35 Correct 34 ms 198024 KB Output is correct
36 Correct 35 ms 197968 KB Output is correct
37 Correct 33 ms 197924 KB Output is correct
38 Correct 33 ms 197968 KB Output is correct
39 Correct 33 ms 198040 KB Output is correct
40 Correct 36 ms 198008 KB Output is correct
41 Correct 130 ms 197972 KB Output is correct
42 Correct 625 ms 198132 KB Output is correct
43 Correct 32 ms 197972 KB Output is correct
44 Correct 220 ms 198124 KB Output is correct
45 Correct 247 ms 197976 KB Output is correct
46 Correct 691 ms 198136 KB Output is correct
47 Correct 534 ms 198228 KB Output is correct
48 Correct 596 ms 197968 KB Output is correct
49 Correct 620 ms 198136 KB Output is correct
50 Correct 616 ms 198132 KB Output is correct
51 Correct 525 ms 198132 KB Output is correct
52 Correct 590 ms 198144 KB Output is correct
53 Correct 521 ms 198132 KB Output is correct
54 Correct 526 ms 198136 KB Output is correct
55 Correct 602 ms 198132 KB Output is correct
56 Correct 624 ms 198132 KB Output is correct
57 Correct 605 ms 198140 KB Output is correct
58 Correct 514 ms 198132 KB Output is correct
59 Correct 521 ms 197968 KB Output is correct
60 Correct 511 ms 198228 KB Output is correct
61 Correct 540 ms 198128 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 9932 KB Output is correct
2 Correct 44 ms 9920 KB Output is correct
3 Correct 51 ms 9932 KB Output is correct
4 Correct 85 ms 9936 KB Output is correct
5 Correct 69 ms 9936 KB Output is correct
6 Correct 86 ms 10000 KB Output is correct
7 Correct 43 ms 10144 KB Output is correct
8 Correct 43 ms 9788 KB Output is correct
9 Correct 48 ms 9936 KB Output is correct
10 Correct 50 ms 9936 KB Output is correct
11 Correct 78 ms 9924 KB Output is correct
12 Correct 77 ms 9932 KB Output is correct
13 Correct 68 ms 10128 KB Output is correct
14 Correct 82 ms 9928 KB Output is correct

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 9928 KB Output is correct
2 Incorrect 68 ms 9924 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 198032 KB Output is correct
2 Correct 32 ms 197968 KB Output is correct
3 Correct 31 ms 197968 KB Output is correct
4 Correct 32 ms 197972 KB Output is correct
5 Correct 32 ms 197976 KB Output is correct
6 Correct 33 ms 197848 KB Output is correct
7 Correct 36 ms 197968 KB Output is correct
8 Correct 31 ms 197972 KB Output is correct
9 Correct 32 ms 197984 KB Output is correct
10 Correct 37 ms 197968 KB Output is correct
11 Correct 36 ms 197824 KB Output is correct
12 Correct 32 ms 197848 KB Output is correct
13 Correct 32 ms 197980 KB Output is correct
14 Correct 35 ms 197828 KB Output is correct
15 Correct 32 ms 197980 KB Output is correct
16 Correct 33 ms 197844 KB Output is correct
17 Correct 32 ms 197972 KB Output is correct
18 Correct 32 ms 197844 KB Output is correct
19 Correct 37 ms 197972 KB Output is correct
20 Correct 32 ms 197952 KB Output is correct
21 Correct 32 ms 197968 KB Output is correct
22 Correct 35 ms 197972 KB Output is correct
23 Correct 33 ms 197892 KB Output is correct
24 Correct 35 ms 197928 KB Output is correct
25 Correct 36 ms 197980 KB Output is correct
26 Correct 31 ms 197964 KB Output is correct
27 Correct 35 ms 197972 KB Output is correct
28 Correct 33 ms 197968 KB Output is correct
29 Correct 35 ms 197992 KB Output is correct
30 Correct 34 ms 197968 KB Output is correct
31 Correct 32 ms 198156 KB Output is correct
32 Correct 33 ms 197972 KB Output is correct
33 Correct 33 ms 197968 KB Output is correct
34 Correct 35 ms 198028 KB Output is correct
35 Correct 34 ms 198024 KB Output is correct
36 Correct 35 ms 197968 KB Output is correct
37 Correct 33 ms 197924 KB Output is correct
38 Correct 33 ms 197968 KB Output is correct
39 Correct 33 ms 198040 KB Output is correct
40 Correct 36 ms 198008 KB Output is correct
41 Correct 130 ms 197972 KB Output is correct
42 Correct 625 ms 198132 KB Output is correct
43 Correct 32 ms 197972 KB Output is correct
44 Correct 220 ms 198124 KB Output is correct
45 Correct 247 ms 197976 KB Output is correct
46 Correct 691 ms 198136 KB Output is correct
47 Correct 534 ms 198228 KB Output is correct
48 Correct 596 ms 197968 KB Output is correct
49 Correct 620 ms 198136 KB Output is correct
50 Correct 616 ms 198132 KB Output is correct
51 Correct 525 ms 198132 KB Output is correct
52 Correct 590 ms 198144 KB Output is correct
53 Correct 521 ms 198132 KB Output is correct
54 Correct 526 ms 198136 KB Output is correct
55 Correct 602 ms 198132 KB Output is correct
56 Correct 624 ms 198132 KB Output is correct
57 Correct 605 ms 198140 KB Output is correct
58 Correct 514 ms 198132 KB Output is correct
59 Correct 521 ms 197968 KB Output is correct
60 Correct 511 ms 198228 KB Output is correct
61 Correct 540 ms 198128 KB Output is correct
62 Correct 35 ms 9932 KB Output is correct
63 Correct 44 ms 9920 KB Output is correct
64 Correct 51 ms 9932 KB Output is correct
65 Correct 85 ms 9936 KB Output is correct
66 Correct 69 ms 9936 KB Output is correct
67 Correct 86 ms 10000 KB Output is correct
68 Correct 43 ms 10144 KB Output is correct
69 Correct 43 ms 9788 KB Output is correct
70 Correct 48 ms 9936 KB Output is correct
71 Correct 50 ms 9936 KB Output is correct
72 Correct 78 ms 9924 KB Output is correct
73 Correct 77 ms 9932 KB Output is correct
74 Correct 68 ms 10128 KB Output is correct
75 Correct 82 ms 9928 KB Output is correct
76 Correct 35 ms 9928 KB Output is correct
77 Incorrect 68 ms 9924 KB Output isn't correct
78 Halted 0 ms 0 KB -