oj.uz

Submission #969769

# Submission time Handle Problem Language Result Execution time Memory
969769 2024-04-25T14:44:57 Z Requiem Financial Report (JOI21_financial) C++17
45 / 100
 96 ms 20048 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];
    void solveSubtask2(){
         memset(dp, -0x3f, sizeof(dp));
         dp[0][0] = 0;
         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]);
                     }
                 }
             }
         }
//         cout << endl;

         int res = 0;
         for(int i = 0; i <= n; i++){
             maximize(res, dp[n][i]);
         }
         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 (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:112:13: warning: unused variable 'res' [-Wunused-variable]
  112 |         int res = 0;
      |             ^~~
Main.cpp: At global scope:
Main.cpp:126:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  126 | main()
      | ^~~~
Main.cpp: In function 'int main()':
Main.cpp:130:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  130 |         freopen(TASKNAME".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:131:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  131 |         freopen(TASKNAME".out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 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 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 0 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 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Correct 23 ms 2392 KB Output is correct
16 Correct 6 ms 2648 KB Output is correct
17 Correct 2 ms 2396 KB Output is correct
18 Correct 42 ms 2396 KB Output is correct
19 Correct 12 ms 2392 KB Output is correct
20 Correct 44 ms 2392 KB Output is correct
21 Correct 44 ms 2396 KB Output is correct
22 Correct 41 ms 2392 KB Output is correct
23 Correct 40 ms 2396 KB Output is correct
24 Correct 42 ms 2392 KB Output is correct
25 Correct 3 ms 2396 KB Output is correct
26 Correct 5 ms 2508 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 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 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 0 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 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Correct 23 ms 2392 KB Output is correct
16 Correct 6 ms 2648 KB Output is correct
17 Correct 2 ms 2396 KB Output is correct
18 Correct 42 ms 2396 KB Output is correct
19 Correct 12 ms 2392 KB Output is correct
20 Correct 44 ms 2392 KB Output is correct
21 Correct 44 ms 2396 KB Output is correct
22 Correct 41 ms 2392 KB Output is correct
23 Correct 40 ms 2396 KB Output is correct
24 Correct 42 ms 2392 KB Output is correct
25 Correct 3 ms 2396 KB Output is correct
26 Correct 5 ms 2508 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 1 ms 2396 KB Output is correct
29 Correct 2 ms 2516 KB Output is correct
30 Correct 2 ms 2396 KB Output is correct
31 Correct 6 ms 2520 KB Output is correct
32 Correct 10 ms 2396 KB Output is correct
33 Correct 1 ms 2396 KB Output is correct
34 Correct 1 ms 2396 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 2396 KB Output is correct
40 Correct 2 ms 2652 KB Output is correct

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 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 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 0 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 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Correct 23 ms 2392 KB Output is correct
16 Correct 6 ms 2648 KB Output is correct
17 Correct 2 ms 2396 KB Output is correct
18 Correct 42 ms 2396 KB Output is correct
19 Correct 12 ms 2392 KB Output is correct
20 Correct 44 ms 2392 KB Output is correct
21 Correct 44 ms 2396 KB Output is correct
22 Correct 41 ms 2392 KB Output is correct
23 Correct 40 ms 2396 KB Output is correct
24 Correct 42 ms 2392 KB Output is correct
25 Correct 3 ms 2396 KB Output is correct
26 Correct 5 ms 2508 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 1 ms 2396 KB Output is correct
29 Correct 2 ms 2516 KB Output is correct
30 Correct 2 ms 2396 KB Output is correct
31 Correct 6 ms 2520 KB Output is correct
32 Correct 10 ms 2396 KB Output is correct
33 Correct 1 ms 2396 KB Output is correct
34 Correct 1 ms 2396 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 2396 KB Output is correct
40 Correct 2 ms 2652 KB Output is correct
41 Correct 2 ms 2652 KB Output is correct
42 Incorrect 1 ms 2396 KB Output isn't correct
43 Halted 0 ms 0 KB -

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 5972 KB Output is correct
2 Correct 26 ms 5732 KB Output is correct
3 Correct 27 ms 5972 KB Output is correct
4 Correct 27 ms 5972 KB Output is correct
5 Correct 27 ms 5872 KB Output is correct
6 Correct 29 ms 5984 KB Output is correct
7 Correct 26 ms 8580 KB Output is correct
8 Correct 24 ms 5816 KB Output is correct
9 Correct 25 ms 7508 KB Output is correct
10 Correct 32 ms 5976 KB Output is correct
11 Correct 27 ms 5972 KB Output is correct
12 Correct 30 ms 5928 KB Output is correct
13 Correct 26 ms 5952 KB Output is correct
14 Correct 25 ms 5980 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 5768 KB Output is correct
2 Correct 51 ms 5948 KB Output is correct
3 Correct 57 ms 6008 KB Output is correct
4 Correct 57 ms 6016 KB Output is correct
5 Correct 75 ms 11344 KB Output is correct
6 Correct 59 ms 5952 KB Output is correct
7 Correct 96 ms 20048 KB Output is correct
8 Correct 32 ms 5976 KB Output is correct
9 Correct 60 ms 10040 KB Output is correct
10 Correct 63 ms 6292 KB Output is correct
11 Correct 57 ms 5972 KB Output is correct
12 Correct 34 ms 5968 KB Output is correct

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 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 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 0 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 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Correct 23 ms 2392 KB Output is correct
16 Correct 6 ms 2648 KB Output is correct
17 Correct 2 ms 2396 KB Output is correct
18 Correct 42 ms 2396 KB Output is correct
19 Correct 12 ms 2392 KB Output is correct
20 Correct 44 ms 2392 KB Output is correct
21 Correct 44 ms 2396 KB Output is correct
22 Correct 41 ms 2392 KB Output is correct
23 Correct 40 ms 2396 KB Output is correct
24 Correct 42 ms 2392 KB Output is correct
25 Correct 3 ms 2396 KB Output is correct
26 Correct 5 ms 2508 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 1 ms 2396 KB Output is correct
29 Correct 2 ms 2516 KB Output is correct
30 Correct 2 ms 2396 KB Output is correct
31 Correct 6 ms 2520 KB Output is correct
32 Correct 10 ms 2396 KB Output is correct
33 Correct 1 ms 2396 KB Output is correct
34 Correct 1 ms 2396 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 2396 KB Output is correct
40 Correct 2 ms 2652 KB Output is correct
41 Correct 2 ms 2652 KB Output is correct
42 Incorrect 1 ms 2396 KB Output isn't correct
43 Halted 0 ms 0 KB -