oj.uz

Submission #846831

# Submission time Handle Problem Language Result Execution time Memory
846831 2023-09-08T13:51:08 Z Abito Financial Report (JOI21_financial) C++17
12 / 100
 66 ms 14672 KB 
#include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define ppb pop_back
#define ep insert
#define endl '\n'
#define elif else if
#define pow pwr
#define sqrt sqrtt
#define int long long
#define y1 YONE
typedef unsigned long long ull;
using namespace std;
const int N=3e5+5;
int a[N],n,d,bit[N],dp[N],b[N];
void edit(int x){
    while (x<=n){
        bit[x]++;
        x+=x&-x;
    }return;
}int query(int x){
    int y=0;
    while (x){
        y+=bit[x];
        x-=x&-x;
    }return y;
}
int32_t main(){
    ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
    cin>>n>>d;
    for (int i=1;i<=n;i++) cin>>a[i];
    if (d==1){
        stack<int> s;
        for (int i=1;i<=n;i++){
            while (!s.empty()){
                if (a[s.top()]<a[i]) s.pop();
                else{
                    b[i]=s.top();
                    break;
                }
            }s.push(i);
        }
        int ans=0;
        for (int i=n;i;i--){
            edit(b[i]+1);
            ans=max(ans,query(i));
        }cout<<ans<<endl;
    }
    return 0;
}

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4560 KB Output is correct
2 Correct 1 ms 4556 KB Output is correct
3 Correct 1 ms 4556 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4700 KB Output is correct
6 Correct 1 ms 4568 KB Output is correct
7 Incorrect 1 ms 2396 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4560 KB Output is correct
2 Correct 1 ms 4556 KB Output is correct
3 Correct 1 ms 4556 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4700 KB Output is correct
6 Correct 1 ms 4568 KB Output is correct
7 Incorrect 1 ms 2396 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4560 KB Output is correct
2 Correct 1 ms 4556 KB Output is correct
3 Correct 1 ms 4556 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4700 KB Output is correct
6 Correct 1 ms 4568 KB Output is correct
7 Incorrect 1 ms 2396 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 14672 KB Output is correct
2 Correct 39 ms 12232 KB Output is correct
3 Correct 37 ms 12288 KB Output is correct
4 Correct 41 ms 12080 KB Output is correct
5 Correct 37 ms 12688 KB Output is correct
6 Correct 42 ms 12224 KB Output is correct
7 Correct 66 ms 8428 KB Output is correct
8 Correct 33 ms 14556 KB Output is correct
9 Correct 60 ms 12748 KB Output is correct
10 Correct 38 ms 13484 KB Output is correct
11 Correct 39 ms 12604 KB Output is correct
12 Correct 40 ms 12332 KB Output is correct
13 Correct 32 ms 11952 KB Output is correct
14 Correct 35 ms 12732 KB Output is correct

Subtask #5
0 / 5.0

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

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4560 KB Output is correct
2 Correct 1 ms 4556 KB Output is correct
3 Correct 1 ms 4556 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4700 KB Output is correct
6 Correct 1 ms 4568 KB Output is correct
7 Incorrect 1 ms 2396 KB Output isn't correct
8 Halted 0 ms 0 KB -