oj.uz

Submission #969965

# Submission time Handle Problem Language Result Execution time Memory
969965 2024-04-26T02:44:16 Z Requiem Financial Report (JOI21_financial) C++17
65 / 100
 635 ms 388436 KB 
#include<bits/stdc++.h>
#define int long long
#define pb push_back
#define fast ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
#define MOD 1000000007
#define INF 1e18
#define fi first
#define se second
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define FORD(i,a,b) for(int i=a;i>=b;i--)
#define sz(a) ((int)(a).size())
#define endl '\n'
#define pi 3.14159265359
#define TASKNAME "financialreport"
template<typename T> bool maximize(T &res, const T &val) { if (res < val){ res = val; return true; }; return false; }
template<typename T> bool minimize(T &res, const T &val) { if (res > val){ res = val; return true; }; return false; }
using namespace std;
typedef pair<int,int> ii;
typedef pair<int,ii> iii;
typedef vector<int> vi;
const int MAXN = 3e5 + 9;
int a[MAXN], n, d;

namespace subtask1{
    bool checkSubtask1(){
         return n <= 20;
    }

    void solveSubtask1(){
         int res = 0;
         for(int msk = 0; msk < (1 << (n - 1)); msk++){
             int prv = -1, mx = -INF, valid = 1, cur = 0;
             for(int j = 0; j < n; j++){
                 if ((msk & (1 << j)) or j == n - 1) {

                     if (prv != -1 and j - prv > d) valid = 0;
                     if (maximize(mx, a[j + 1])){
                         cur++;
                     }
                     prv = j;
                 }
             }

             if (valid) maximize(res, cur);
         }
         cout << res << endl;
    }
}

namespace subtask2{
    bool checkSubtask2(){
         return n <= 400;
    }

    int dp[406][406];
    vector<int> listval;
    void computeDp1(){
         memset(dp, -0x3f, sizeof(dp));
         for(int i = 1; i <= n; i++){
             dp[i][i] = 1;
         }
         a[0] = -INF;
         for(int i = 0; i <= n; i++){ //regard i
             for(int j = 0; j <= n; j++){
                 if (dp[i][j] > -INF){
//                     cout << i << ' ' << j << ' ' << dp[i][j] << endl;
                     for(int k = i + 1; k <= min(i + d, n); k++){
                         int mxId = (a[j] >= a[k]) ? j : k;
                         if (mxId == k) maximize(dp[k][mxId], dp[i][j] + 1);
                         else maximize(dp[k][mxId], dp[i][j]);
                     }
                 }
             }
         }
         int res = 0;
         for(int i = 0; i <= n; i++){
             maximize(res, dp[n][i]);
         }
         cout << res << endl;
    }

    void computeDp2(){
         for(int i = 1; i <= n; i++){
             listval.pb(a[i]);
         }
         sort(listval.begin(), listval.end());
         listval.erase(unique(listval.begin(), listval.end()), listval.end());

    }
    void solveSubtask2(){
         computeDp1();
    }
}

namespace subtask3{
    int Valid[7003][7003];
    bool checkSubtask3(){
         return n <= 7000;
    }
    int dp[MAXN];

    void solveSubtask3(){
         memset(Valid, 0x3f, sizeof(Valid));
         deque<int> opt;

         for(int i = 1; i <= n; i++){
             Valid[i][i] = a[i];
             for(int j = i; j <= n; j++){
                 if (j - i <= d) Valid[i][j] = max(a[i], a[j]);
                 else minimize(Valid[i][j], max(Valid[i][opt.front()], a[j]) );

                 while(!opt.empty() and Valid[i][j] <= Valid[i][opt.back()]) opt.pop_back();
                 opt.push_back(j);
                 while(!opt.empty() and opt.front() + d <= j) {
                       opt.pop_front();
                 }
//                 cout << Valid[i][j] << ' ';
             }
             opt.clear();
//             cout << endl;
         }
         int res = 0;
         for(int i = 1; i <= n; i++){
             dp[i] = 1;
             for(int j = i - 1; j >= 1; j--){
                 if (Valid[j][i] <= a[i] and a[i] > a[j]) maximize(dp[i], dp[j] + 1);
             }
             maximize(res, dp[i]);
//             cout << dp[i] << ' ';
         }
//         cout << endl;
         cout << res << endl;
    }
}
namespace subtask4{
    bool checkSubtask4(){
         return d == 1;
    }

    void solveSubtask4(){
        stack<int> st;
        int res = 1;
        st.push(n);
        for(int i = n - 1; i >= 1; i--){
            while(!st.empty() and a[i] >= a[st.top()]) st.pop();
            st.push(i);
            maximize(res, (int) st.size());
        }
        cout << res << endl;
    }
}

namespace subtask5{
    bool checkSubtask5(){
        return d == n;
    }

    int dp[MAXN];

    void solveSubtask5(){
        multiset<int> st;
        int res = 0;
        for(int i = 1; i <= n; i++){
            auto it = st.lower_bound(a[i]);
//            cout << st.size() << ' ' << i << endl;
            if (it == st.end()) st.insert(a[i]);
            else {
                st.erase(it);
                st.insert(a[i]);
            }
        }

        cout << (int) st.size() << endl;
    }
}
main()
{
    fast;
    if (fopen(TASKNAME".inp","r")){
        freopen(TASKNAME".inp","r",stdin);
        freopen(TASKNAME".out","w",stdout);
    }
    cin >> n >> d;
    for(int i = 1; i <= n; i++){
        cin >> a[i];
    }

    if (subtask1::checkSubtask1()) return subtask1::solveSubtask1(), 0;
    if (subtask2::checkSubtask2()) return subtask2::solveSubtask2(), 0;
    if (subtask3::checkSubtask3()) return subtask3::solveSubtask3(), 0;
    if (subtask4::checkSubtask4()) return subtask4::solveSubtask4(), 0;
    if (subtask5::checkSubtask5()) return subtask5::solveSubtask5(), 0;
}
/**
Warning:
- MLE / TLE?
- Gioi han mang?
- Gia tri max phai luon gan cho -INF
- long long co can thiet khong?
- tran mang.
- code can than hon
- Nho sinh test de tranh RTE / TLE

--> Coi lai truoc khi nop
**/

Compilation message

Main.cpp: In function 'void subtask5::solveSubtask5()':
Main.cpp:162:13: warning: unused variable 'res' [-Wunused-variable]
  162 |         int res = 0;
      |             ^~~
Main.cpp: At global scope:
Main.cpp:176:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  176 | main()
      | ^~~~
Main.cpp: In function 'int main()':
Main.cpp:180:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  180 |         freopen(TASKNAME".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:181:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  181 |         freopen(TASKNAME".out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2548 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 1 ms 2804 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 22 ms 2392 KB Output is correct
16 Correct 5 ms 2396 KB Output is correct
17 Correct 2 ms 2396 KB Output is correct
18 Correct 43 ms 2396 KB Output is correct
19 Correct 12 ms 2672 KB Output is correct
20 Correct 43 ms 2396 KB Output is correct
21 Correct 44 ms 2396 KB Output is correct
22 Correct 43 ms 2396 KB Output is correct
23 Correct 40 ms 2392 KB Output is correct
24 Correct 41 ms 2396 KB Output is correct
25 Correct 3 ms 2396 KB Output is correct
26 Correct 5 ms 2396 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2548 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 1 ms 2804 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 22 ms 2392 KB Output is correct
16 Correct 5 ms 2396 KB Output is correct
17 Correct 2 ms 2396 KB Output is correct
18 Correct 43 ms 2396 KB Output is correct
19 Correct 12 ms 2672 KB Output is correct
20 Correct 43 ms 2396 KB Output is correct
21 Correct 44 ms 2396 KB Output is correct
22 Correct 43 ms 2396 KB Output is correct
23 Correct 40 ms 2392 KB Output is correct
24 Correct 41 ms 2396 KB Output is correct
25 Correct 3 ms 2396 KB Output is correct
26 Correct 5 ms 2396 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 2 ms 2396 KB Output is correct
29 Correct 2 ms 2396 KB Output is correct
30 Correct 2 ms 2520 KB Output is correct
31 Correct 4 ms 2512 KB Output is correct
32 Correct 13 ms 2396 KB Output is correct
33 Correct 2 ms 2396 KB Output is correct
34 Correct 1 ms 2516 KB Output is correct
35 Correct 2 ms 2396 KB Output is correct
36 Correct 4 ms 2396 KB Output is correct
37 Correct 1 ms 2396 KB Output is correct
38 Correct 1 ms 2396 KB Output is correct
39 Correct 3 ms 2392 KB Output is correct
40 Correct 2 ms 2392 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2548 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 1 ms 2804 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 22 ms 2392 KB Output is correct
16 Correct 5 ms 2396 KB Output is correct
17 Correct 2 ms 2396 KB Output is correct
18 Correct 43 ms 2396 KB Output is correct
19 Correct 12 ms 2672 KB Output is correct
20 Correct 43 ms 2396 KB Output is correct
21 Correct 44 ms 2396 KB Output is correct
22 Correct 43 ms 2396 KB Output is correct
23 Correct 40 ms 2392 KB Output is correct
24 Correct 41 ms 2396 KB Output is correct
25 Correct 3 ms 2396 KB Output is correct
26 Correct 5 ms 2396 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 2 ms 2396 KB Output is correct
29 Correct 2 ms 2396 KB Output is correct
30 Correct 2 ms 2520 KB Output is correct
31 Correct 4 ms 2512 KB Output is correct
32 Correct 13 ms 2396 KB Output is correct
33 Correct 2 ms 2396 KB Output is correct
34 Correct 1 ms 2516 KB Output is correct
35 Correct 2 ms 2396 KB Output is correct
36 Correct 4 ms 2396 KB Output is correct
37 Correct 1 ms 2396 KB Output is correct
38 Correct 1 ms 2396 KB Output is correct
39 Correct 3 ms 2392 KB Output is correct
40 Correct 2 ms 2392 KB Output is correct
41 Correct 507 ms 386460 KB Output is correct
42 Correct 450 ms 386384 KB Output is correct
43 Correct 445 ms 386328 KB Output is correct
44 Correct 440 ms 386276 KB Output is correct
45 Correct 525 ms 386536 KB Output is correct
46 Correct 546 ms 386344 KB Output is correct
47 Correct 474 ms 386328 KB Output is correct
48 Correct 493 ms 388436 KB Output is correct
49 Correct 504 ms 386340 KB Output is correct
50 Correct 579 ms 386304 KB Output is correct
51 Correct 450 ms 386132 KB Output is correct
52 Correct 451 ms 386128 KB Output is correct
53 Correct 628 ms 386280 KB Output is correct
54 Correct 635 ms 386812 KB Output is correct
55 Correct 611 ms 386328 KB Output is correct
56 Correct 482 ms 386340 KB Output is correct
57 Correct 495 ms 386564 KB Output is correct
58 Correct 422 ms 386336 KB Output is correct
59 Correct 423 ms 386444 KB Output is correct
60 Correct 433 ms 386288 KB Output is correct
61 Correct 426 ms 386336 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 7360 KB Output is correct
2 Correct 25 ms 7004 KB Output is correct
3 Correct 27 ms 7508 KB Output is correct
4 Correct 31 ms 7508 KB Output is correct
5 Correct 26 ms 7480 KB Output is correct
6 Correct 27 ms 7516 KB Output is correct
7 Correct 28 ms 9788 KB Output is correct
8 Correct 24 ms 7768 KB Output is correct
9 Correct 25 ms 9160 KB Output is correct
10 Correct 25 ms 7508 KB Output is correct
11 Correct 26 ms 7516 KB Output is correct
12 Correct 30 ms 7516 KB Output is correct
13 Correct 24 ms 7508 KB Output is correct
14 Correct 24 ms 7512 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 7764 KB Output is correct
2 Correct 50 ms 7504 KB Output is correct
3 Correct 57 ms 7516 KB Output is correct
4 Correct 57 ms 7516 KB Output is correct
5 Correct 79 ms 13140 KB Output is correct
6 Correct 61 ms 7764 KB Output is correct
7 Correct 100 ms 21584 KB Output is correct
8 Correct 31 ms 7504 KB Output is correct
9 Correct 61 ms 11604 KB Output is correct
10 Correct 57 ms 7764 KB Output is correct
11 Correct 58 ms 7504 KB Output is correct
12 Correct 34 ms 7356 KB Output is correct

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2548 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 1 ms 2804 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 22 ms 2392 KB Output is correct
16 Correct 5 ms 2396 KB Output is correct
17 Correct 2 ms 2396 KB Output is correct
18 Correct 43 ms 2396 KB Output is correct
19 Correct 12 ms 2672 KB Output is correct
20 Correct 43 ms 2396 KB Output is correct
21 Correct 44 ms 2396 KB Output is correct
22 Correct 43 ms 2396 KB Output is correct
23 Correct 40 ms 2392 KB Output is correct
24 Correct 41 ms 2396 KB Output is correct
25 Correct 3 ms 2396 KB Output is correct
26 Correct 5 ms 2396 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 2 ms 2396 KB Output is correct
29 Correct 2 ms 2396 KB Output is correct
30 Correct 2 ms 2520 KB Output is correct
31 Correct 4 ms 2512 KB Output is correct
32 Correct 13 ms 2396 KB Output is correct
33 Correct 2 ms 2396 KB Output is correct
34 Correct 1 ms 2516 KB Output is correct
35 Correct 2 ms 2396 KB Output is correct
36 Correct 4 ms 2396 KB Output is correct
37 Correct 1 ms 2396 KB Output is correct
38 Correct 1 ms 2396 KB Output is correct
39 Correct 3 ms 2392 KB Output is correct
40 Correct 2 ms 2392 KB Output is correct
41 Correct 507 ms 386460 KB Output is correct
42 Correct 450 ms 386384 KB Output is correct
43 Correct 445 ms 386328 KB Output is correct
44 Correct 440 ms 386276 KB Output is correct
45 Correct 525 ms 386536 KB Output is correct
46 Correct 546 ms 386344 KB Output is correct
47 Correct 474 ms 386328 KB Output is correct
48 Correct 493 ms 388436 KB Output is correct
49 Correct 504 ms 386340 KB Output is correct
50 Correct 579 ms 386304 KB Output is correct
51 Correct 450 ms 386132 KB Output is correct
52 Correct 451 ms 386128 KB Output is correct
53 Correct 628 ms 386280 KB Output is correct
54 Correct 635 ms 386812 KB Output is correct
55 Correct 611 ms 386328 KB Output is correct
56 Correct 482 ms 386340 KB Output is correct
57 Correct 495 ms 386564 KB Output is correct
58 Correct 422 ms 386336 KB Output is correct
59 Correct 423 ms 386444 KB Output is correct
60 Correct 433 ms 386288 KB Output is correct
61 Correct 426 ms 386336 KB Output is correct
62 Correct 32 ms 7360 KB Output is correct
63 Correct 25 ms 7004 KB Output is correct
64 Correct 27 ms 7508 KB Output is correct
65 Correct 31 ms 7508 KB Output is correct
66 Correct 26 ms 7480 KB Output is correct
67 Correct 27 ms 7516 KB Output is correct
68 Correct 28 ms 9788 KB Output is correct
69 Correct 24 ms 7768 KB Output is correct
70 Correct 25 ms 9160 KB Output is correct
71 Correct 25 ms 7508 KB Output is correct
72 Correct 26 ms 7516 KB Output is correct
73 Correct 30 ms 7516 KB Output is correct
74 Correct 24 ms 7508 KB Output is correct
75 Correct 24 ms 7512 KB Output is correct
76 Correct 34 ms 7764 KB Output is correct
77 Correct 50 ms 7504 KB Output is correct
78 Correct 57 ms 7516 KB Output is correct
79 Correct 57 ms 7516 KB Output is correct
80 Correct 79 ms 13140 KB Output is correct
81 Correct 61 ms 7764 KB Output is correct
82 Correct 100 ms 21584 KB Output is correct
83 Correct 31 ms 7504 KB Output is correct
84 Correct 61 ms 11604 KB Output is correct
85 Correct 57 ms 7764 KB Output is correct
86 Correct 58 ms 7504 KB Output is correct
87 Correct 34 ms 7356 KB Output is correct
88 Incorrect 25 ms 7508 KB Output isn't correct
89 Halted 0 ms 0 KB -