oj.uz

Submission #448614

# Submission time Handle Problem Language Result Execution time Memory
448614 2021-07-31T07:33:56 Z Neos Rabbit Carrot (LMIO19_triusis) C++14
0 / 100
 1 ms 204 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll,ll> ii;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef vector<ld> vld;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef vector<vii> vvii;
 
#define task "test"
#define fastIO ios::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define forw(i,l,r) for( ll i = (l) ; i < (r) ; i++ )
#define forb(i,r,l) for( ll i = (r) ; i >= (l) ; i-- )
#define sz(x) (int)x.size()
#define fi first
#define se second
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_front
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define cntbit(x) __builtin_popcount(x)
#define lb lower_bound
#define ub upper_bound
#define endl '\n'
 
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
 
const int N = 2e5+7;
const ll inf = 1e18;

int n, m, h[N];
vi lis, List;

void solve() {
	cin >> n >> m;
	forw(i, 1, n + 1) cin >> h[i];

	int ans = 0;
	forw(i, 1, n + 1) 
    if (m * i >= h[i - 1]) {
      List.pb(m * i - h[i - 1]);
    }

  for (auto it: List) {
    auto p = upper_bound(all(lis), it);
    if (p == lis.end()) lis.pb(it);
    else lis[(p - lis.begin())] = it;
  }
  cout << n - sz(lis) << endl;
}
 
int main() {
  fastIO;
  /*#ifndef ONLINE_JUDGE
  freopen(task".inp", "r", stdin);
  freopen(task".out", "w", stdout);
  #endif*/
 
  int tc = 1;
  // cin >> tc;
  while (tc--) {
    solve();
  }
}

Compilation message

triusis.cpp: In function 'void solve()':
triusis.cpp:49:6: warning: unused variable 'ans' [-Wunused-variable]
   49 |  int ans = 0;
      |      ^~~

Subtask #1
0 / 14.0

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

Subtask #2
0 / 21.0

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

Subtask #3
0 / 28.0

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

Subtask #4
0 / 37.0

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