oj.uz

Submission #864263

# Submission time Handle Problem Language Result Execution time Memory
864263 2023-10-22T09:36:59 Z vjudge1 Financial Report (JOI21_financial) C++17
31 / 100
 193 ms 8916 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(){

}

void Smart(){

}

void solve(){
  cin >> n >> D;
  a.resize(n);
  for (int i = 0; i < n; i++){
    cin >> a[i];
  }
  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 348 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 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 32 ms 348 KB Output is correct
17 Correct 8 ms 348 KB Output is correct
18 Correct 193 ms 432 KB Output is correct
19 Correct 45 ms 344 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 188 ms 348 KB Output is correct
22 Correct 193 ms 428 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 11 ms 348 KB Output is correct
26 Correct 23 ms 428 KB Output is correct

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 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 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 32 ms 348 KB Output is correct
17 Correct 8 ms 348 KB Output is correct
18 Correct 193 ms 432 KB Output is correct
19 Correct 45 ms 344 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 188 ms 348 KB Output is correct
22 Correct 193 ms 428 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 11 ms 348 KB Output is correct
26 Correct 23 ms 428 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Incorrect 0 ms 348 KB Output isn't correct
29 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 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 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 32 ms 348 KB Output is correct
17 Correct 8 ms 348 KB Output is correct
18 Correct 193 ms 432 KB Output is correct
19 Correct 45 ms 344 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 188 ms 348 KB Output is correct
22 Correct 193 ms 428 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 11 ms 348 KB Output is correct
26 Correct 23 ms 428 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Incorrect 0 ms 348 KB Output isn't correct
29 Halted 0 ms 0 KB -

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 2652 KB Output is correct
2 Correct 26 ms 2648 KB Output is correct
3 Correct 26 ms 2652 KB Output is correct
4 Correct 26 ms 2652 KB Output is correct
5 Correct 25 ms 2652 KB Output is correct
6 Correct 25 ms 2648 KB Output is correct
7 Correct 24 ms 5104 KB Output is correct
8 Correct 24 ms 2652 KB Output is correct
9 Correct 25 ms 4436 KB Output is correct
10 Correct 26 ms 2652 KB Output is correct
11 Correct 25 ms 2816 KB Output is correct
12 Correct 25 ms 2904 KB Output is correct
13 Correct 23 ms 2652 KB Output is correct
14 Correct 23 ms 2652 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 2648 KB Output is correct
2 Correct 38 ms 2652 KB Output is correct
3 Correct 37 ms 2652 KB Output is correct
4 Correct 37 ms 2828 KB Output is correct
5 Correct 38 ms 3800 KB Output is correct
6 Correct 36 ms 2652 KB Output is correct
7 Correct 24 ms 8916 KB Output is correct
8 Correct 28 ms 2652 KB Output is correct
9 Correct 30 ms 3956 KB Output is correct
10 Correct 35 ms 2652 KB Output is correct
11 Correct 37 ms 2812 KB Output is correct
12 Correct 24 ms 2652 KB Output is correct

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 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 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 32 ms 348 KB Output is correct
17 Correct 8 ms 348 KB Output is correct
18 Correct 193 ms 432 KB Output is correct
19 Correct 45 ms 344 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 188 ms 348 KB Output is correct
22 Correct 193 ms 428 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 11 ms 348 KB Output is correct
26 Correct 23 ms 428 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Incorrect 0 ms 348 KB Output isn't correct
29 Halted 0 ms 0 KB -