oj.uz

Submission #763142

# Submission time Handle Problem Language Result Execution time Memory
763142 2023-06-22T04:51:28 Z khanhphucscratch Financial Report (JOI21_financial) C++14
0 / 100
 103 ms 142084 KB 
#include<bits/stdc++.h>
#define int long long
using namespace std;
unordered_map<int, int> dic;
deque<pair<int, int>> b[200001];
int st[800005], a[200001], dp[200001];
void add(int node, int l, int r, int p, int np, int v)
{
    if(l > p || r < p) return;
    if(l == p && r == p){
        while(b[l].size() > 0 && b[l].back().first <= v) b[l].pop_back();
        b[l].push_back({v, np});
        st[node] = b[l].front().first;
    }
    else{
        add(node*2, l, (l+r)/2, p, np, v);
        add(node*2+1, (l+r)/2+1, r, p, np, v);
        st[node] = max(st[node*2], st[node*2+1]);
    }
}
void del(int node, int l, int r, int p, int np)
{
    if(l > p || r < p) return;
    if(l == p && r == p){
        while(b[l].size() > 0 && b[l].front().second <= np) b[l].pop_front();
        if(b[l].size() > 0) st[node] = b[l].front().first;
        else st[node] = 0;
    }
    else{
        del(node*2, l, (l+r)/2, p, np);
        del(node*2+1, (l+r)/2+1, r, p, np);
        st[node] = max(st[node*2], st[node*2+1]);
    }
}
int query(int node, int l, int r, int tl, int tr)
{
    if(l > tr || r < tl) return -1e9;
    else if(l >= tl && r <= tr) return st[node];
    else return max(query(node*2, l, (l+r)/2, tl, tr), query(node*2+1, (l+r)/2+1, r, tl ,tr));
}
signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int n, d;
    cin>>n>>d;
    set<int> f;
    for(int i = 1; i <= n; i++){
        cin>>a[i];
        f.insert(a[i]);
    }
    f.insert(0);
    int c = 0;
    for(int i : f) dic[i] = ++c;
    for(int i = 1; i <= n; i++){
        if(dic[a[i]] > 1) dp[i] = query(1, 1, f.size(), 1, dic[a[i]]-1) + 1;
        else dp[i] = 1;
        add(1, 1, f.size(), dic[a[i]], i, dp[i]);
        if(i-d > 0) del(1, 1, f.size(), dic[a[i-d]], i-d);
        //cout<<dp[i]<<" "<<dic[a[i]]<<" "<<query(1, 1, n,1, 2)<<endl;
    }
    int ans = 0;
    for(int i = n; i >= n-d; i--) ans = max(ans, dp[i]);
    cout<<ans;
}

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 134892 KB Output is correct
2 Correct 65 ms 134864 KB Output is correct
3 Correct 65 ms 134964 KB Output is correct
4 Correct 66 ms 134888 KB Output is correct
5 Correct 69 ms 134860 KB Output is correct
6 Correct 64 ms 134868 KB Output is correct
7 Correct 66 ms 134872 KB Output is correct
8 Correct 66 ms 134928 KB Output is correct
9 Correct 66 ms 134988 KB Output is correct
10 Correct 65 ms 134860 KB Output is correct
11 Correct 66 ms 134916 KB Output is correct
12 Correct 65 ms 134868 KB Output is correct
13 Correct 73 ms 135032 KB Output is correct
14 Correct 66 ms 134936 KB Output is correct
15 Incorrect 70 ms 134860 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 134892 KB Output is correct
2 Correct 65 ms 134864 KB Output is correct
3 Correct 65 ms 134964 KB Output is correct
4 Correct 66 ms 134888 KB Output is correct
5 Correct 69 ms 134860 KB Output is correct
6 Correct 64 ms 134868 KB Output is correct
7 Correct 66 ms 134872 KB Output is correct
8 Correct 66 ms 134928 KB Output is correct
9 Correct 66 ms 134988 KB Output is correct
10 Correct 65 ms 134860 KB Output is correct
11 Correct 66 ms 134916 KB Output is correct
12 Correct 65 ms 134868 KB Output is correct
13 Correct 73 ms 135032 KB Output is correct
14 Correct 66 ms 134936 KB Output is correct
15 Incorrect 70 ms 134860 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 134892 KB Output is correct
2 Correct 65 ms 134864 KB Output is correct
3 Correct 65 ms 134964 KB Output is correct
4 Correct 66 ms 134888 KB Output is correct
5 Correct 69 ms 134860 KB Output is correct
6 Correct 64 ms 134868 KB Output is correct
7 Correct 66 ms 134872 KB Output is correct
8 Correct 66 ms 134928 KB Output is correct
9 Correct 66 ms 134988 KB Output is correct
10 Correct 65 ms 134860 KB Output is correct
11 Correct 66 ms 134916 KB Output is correct
12 Correct 65 ms 134868 KB Output is correct
13 Correct 73 ms 135032 KB Output is correct
14 Correct 66 ms 134936 KB Output is correct
15 Incorrect 70 ms 134860 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 103 ms 141772 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 102 ms 142084 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 134892 KB Output is correct
2 Correct 65 ms 134864 KB Output is correct
3 Correct 65 ms 134964 KB Output is correct
4 Correct 66 ms 134888 KB Output is correct
5 Correct 69 ms 134860 KB Output is correct
6 Correct 64 ms 134868 KB Output is correct
7 Correct 66 ms 134872 KB Output is correct
8 Correct 66 ms 134928 KB Output is correct
9 Correct 66 ms 134988 KB Output is correct
10 Correct 65 ms 134860 KB Output is correct
11 Correct 66 ms 134916 KB Output is correct
12 Correct 65 ms 134868 KB Output is correct
13 Correct 73 ms 135032 KB Output is correct
14 Correct 66 ms 134936 KB Output is correct
15 Incorrect 70 ms 134860 KB Output isn't correct
16 Halted 0 ms 0 KB -