oj.uz

Submission #864210

# Submission time Handle Problem Language Result Execution time Memory
864210 2023-10-22T09:01:28 Z vjudge1 Financial Report (JOI21_financial) C++17
5 / 100
 42 ms 11220 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(){
  int mx = -1, res = 0;
  for (int i = 0; i < n; i++){
    if (a[i] > mx){
      mx = a[i];
      res++;
    }
  }
  cout << res << 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 Glup(){

}

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 <= 7000)Glup();
  else Smart();
}

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

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 600 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 Incorrect 1 ms 348 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 600 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 Incorrect 1 ms 348 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 600 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 Incorrect 1 ms 348 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 2652 KB Output is correct
2 Incorrect 24 ms 2652 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 2652 KB Output is correct
2 Correct 35 ms 3068 KB Output is correct
3 Correct 41 ms 5352 KB Output is correct
4 Correct 40 ms 5452 KB Output is correct
5 Correct 42 ms 6352 KB Output is correct
6 Correct 41 ms 5612 KB Output is correct
7 Correct 28 ms 11220 KB Output is correct
8 Correct 29 ms 5476 KB Output is correct
9 Correct 33 ms 6616 KB Output is correct
10 Correct 39 ms 5576 KB Output is correct
11 Correct 40 ms 5712 KB Output is correct
12 Correct 28 ms 5468 KB Output is correct

Subtask #6
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 600 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 Incorrect 1 ms 348 KB Output isn't correct
12 Halted 0 ms 0 KB -