oj.uz

Submission #818168

# Submission time Handle Problem Language Result Execution time Memory
818168 2023-08-10T03:04:40 Z trucmai Financial Report (JOI21_financial) C++17
0 / 100
 4000 ms 3396 KB 
#include <bits/stdc++.h>
using namespace std; 
#define ll long long 
const ll N = 3e5+5;
ll n,d,a[N],dp[N],mx[N];
//dp[i] = max dp[j] + 1 va (a[i] > a[j] && |i-j| <= D)
//wutdahell
signed main(){ 
  cin>>n>>d;
  for(ll i = 1;i <= n;++i) cin>>a[i]; 
  // deque<ll>dq;
  // for(ll i = 1;i <= n;++i){
  //   while(!dq.empty() && a[dq.back()] < a[i]) dq.pop_back(); 
  //   while(!dq.empty() && dq.front() + d <= i) dq.pop_front(); 
  //   dq.push_back(i); 
  //   if(i <= d) mx[i] = a[dq.front()];
  // }
  dp[1] = 1; 
  for(ll i = 2;i <= n;++i){
    dp[i] = 1;
    for(ll j = 1;j < i;++j){
      if(i - j <= d)
        if(a[i] > a[j]) dp[i] = max(dp[i],dp[j] + 1);
    }
  }
  ll res = 0;
  cout<<dp[n]<<endl;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:26:6: warning: unused variable 'res' [-Wunused-variable]
   26 |   ll res = 0;
      |      ^~~

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 260 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Incorrect 0 ms 212 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 260 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Incorrect 0 ms 212 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 260 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Incorrect 0 ms 212 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4029 ms 3396 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4070 ms 3276 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 260 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Incorrect 0 ms 212 KB Output isn't correct
11 Halted 0 ms 0 KB -