oj.uz

Submission #864271

# Submission time Handle Problem Language Result Execution time Memory
864271 2023-10-22T09:50:54 Z vjudge1 Financial Report (JOI21_financial) C++17
14 / 100
 4000 ms 5348 KB 
/* DK ORZ! */
#include "iostream"
#include "cstdio"
#include "cstdlib"
#include "algorithm"
#include "cmath"
#include "vector"
#include "set"
#include "map"
#include "unordered_set"
#include "unordered_map"
#include "queue"
#include "ctime"
#include "random"
#include "cassert"
#include "complex"
#include "string"
#include "cstring"
#include "chrono"
#include "bitset"
#include "array"
#include "stack"

#define endl '\n'
#define all(x) x.begin(), x.end()
#define int long long

using namespace std;

const int mod = 998244353;
const int nax = 300000;

int n, D;
vector <int> a;

void D1(){
  deque<int>s;
  int ans = 1;
  s.push_back(a.back());
  for (int i = n - 2; i >= 0; i--){
    while(s.size() > 0 && a[i] >= s.front())s.pop_front();
    s.push_front(a[i]);
    ans = max(ans, (int)s.size());
  }
  cout << ans << endl;
}

void DN(){
  vector <int> LIS;
  LIS.push_back(a[0]);
  for (int i = 1; i < n; i++){
    if (a[i] > LIS.back()){
      LIS.push_back(a[i]);
    }else{
      int ind = lower_bound(all(LIS), a[i]) - LIS.begin();
      LIS[ind] = a[i];
    }
  }
  cout << (int)LIS.size() << endl;
}

void Preglup(){
  int ans = 1;
  for (int i = 1; i < (1 << n); i++){
    vector <int> b;
    for (int j = 0; j < n; j++){
      if ((i & (1 << j))){
        b.push_back(j);
      }
    }
    if (b.back() != n - 1)continue;
    int ok = 1, mx = a[b[0]], cur = 1;
    for (int j = 1; j < (int)b.size(); j++){
      ok&= (b[j] - b[j - 1] <= D);
      if (a[b[j]] > mx)++cur;
      mx = max(mx, a[b[j]]);
    }
    if (ok)ans = max(ans, cur);
    
  }
  cout << ans << endl;
}

void NeTakaGlup(){
  int dp[n];
  for (int i = 0; i < n; i++){
    dp[i] = 1;
    int last = i;
    for (int j = i - 1; j >= 0; j--){
      if (last - j > D){
        break;
      }
      dp[i] = max(dp[i], 1 + dp[j]);
      if (a[j] < a[i]){
        last = j;
      }
    }
  }
  cout << dp[n - 1] << endl;
}

void Smart(){

}

void solve(){
  cin >> n >> D;
  a.resize(n);
  for (int i = 0; i < n; i++){
    cin >> a[i];
  }
  Preglup();
  return;
  if (D == 1)D1();
  else if (D == n)DN();
  else if (n <= 20)Preglup();
  else if (n <= 7000)NeTakaGlup();
  else Smart();
}

signed main(){
  ios::sync_with_stdio(0);
  cin.tie(0);
  int tt = 1;
  //cin >> tt;
  while (tt--){
    solve();
  }
  return 0;
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 90 ms 424 KB Output is correct
16 Correct 22 ms 344 KB Output is correct
17 Correct 5 ms 348 KB Output is correct
18 Correct 192 ms 444 KB Output is correct
19 Correct 44 ms 600 KB Output is correct
20 Correct 185 ms 348 KB Output is correct
21 Correct 188 ms 348 KB Output is correct
22 Correct 190 ms 348 KB Output is correct
23 Correct 181 ms 344 KB Output is correct
24 Correct 184 ms 684 KB Output is correct
25 Correct 11 ms 344 KB Output is correct
26 Correct 23 ms 348 KB Output is correct

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 90 ms 424 KB Output is correct
16 Correct 22 ms 344 KB Output is correct
17 Correct 5 ms 348 KB Output is correct
18 Correct 192 ms 444 KB Output is correct
19 Correct 44 ms 600 KB Output is correct
20 Correct 185 ms 348 KB Output is correct
21 Correct 188 ms 348 KB Output is correct
22 Correct 190 ms 348 KB Output is correct
23 Correct 181 ms 344 KB Output is correct
24 Correct 184 ms 684 KB Output is correct
25 Correct 11 ms 344 KB Output is correct
26 Correct 23 ms 348 KB Output is correct
27 Incorrect 63 ms 348 KB Output isn't correct
28 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 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 90 ms 424 KB Output is correct
16 Correct 22 ms 344 KB Output is correct
17 Correct 5 ms 348 KB Output is correct
18 Correct 192 ms 444 KB Output is correct
19 Correct 44 ms 600 KB Output is correct
20 Correct 185 ms 348 KB Output is correct
21 Correct 188 ms 348 KB Output is correct
22 Correct 190 ms 348 KB Output is correct
23 Correct 181 ms 344 KB Output is correct
24 Correct 184 ms 684 KB Output is correct
25 Correct 11 ms 344 KB Output is correct
26 Correct 23 ms 348 KB Output is correct
27 Incorrect 63 ms 348 KB Output isn't correct
28 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

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

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 2648 KB Output is correct
2 Execution timed out 4026 ms 5348 KB Time limit exceeded
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 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 90 ms 424 KB Output is correct
16 Correct 22 ms 344 KB Output is correct
17 Correct 5 ms 348 KB Output is correct
18 Correct 192 ms 444 KB Output is correct
19 Correct 44 ms 600 KB Output is correct
20 Correct 185 ms 348 KB Output is correct
21 Correct 188 ms 348 KB Output is correct
22 Correct 190 ms 348 KB Output is correct
23 Correct 181 ms 344 KB Output is correct
24 Correct 184 ms 684 KB Output is correct
25 Correct 11 ms 344 KB Output is correct
26 Correct 23 ms 348 KB Output is correct
27 Incorrect 63 ms 348 KB Output isn't correct
28 Halted 0 ms 0 KB -