oj.uz

Submission #940244

# Submission time Handle Problem Language Result Execution time Memory
940244 2024-03-07T06:58:03 Z Sundavar Financial Report (JOI21_financial) C++14
0 / 100
 180 ms 20216 KB 
#include <bits/stdc++.h>
using namespace std;


struct dat{
    int price, len, id;
    bool operator < (dat a) const{
        return a.price > price;
    }
};

int main(){
    int n, d;
    cin>>n>>d;
    vector<int> used(n, -1), price(n);
    set<dat> best;
    best.insert({0,0, -1});
    multiset<int> el;
    for(int i = 0; i < n; i++){
        cin>>price[i];
        if(i > d){
            el.erase(el.find(price[i-d-1]));
            while(best.size() > 1){
                auto it = next(best.begin());
                if(it->price < *el.begin()) best.erase(it);
                else break;
            }
        }
        
        auto it = best.lower_bound({price[i], -1, -1}), p = prev(it);
        el.insert({price[i]});
        if(it != best.end() && it->price == price[i]) continue;
        if(it != best.end() && it->len == p->len+1) best.erase(it);
        best.insert({price[i], p->len+1, i});
    }
    cout << prev(best.end())->len << "\n";
}

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 1 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 1 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 1 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 100 ms 5564 KB Output is correct
2 Incorrect 107 ms 5200 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 127 ms 20216 KB Output is correct
2 Incorrect 180 ms 19712 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 1 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -