oj.uz

답안 #996612

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
996612 2024-06-10T22:48:09 Z oj123 Rabbit Carrot (LMIO19_triusis) C++14
0 / 100
 0 ms 348 KB 
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define f first
#define s second

int main() {
  int n,m;
  cin >> n >> m;
  vector<ll> v;
  for (int i=0;i<n;i++){
    ll a;
    cin >> a;
    v.pb((a-(m*i)));
  }
  reverse(v.begin(),v.end());
  vector<ll> v1;
  for (int i:v){
    int pos=upper_bound(v1.begin(),v1.end(),i)-v1.begin();
    if (pos==v1.size()){
      v1.pb(i);
    }else{
      if (v1[pos]!=0){
        v1[pos]=i;
      }
    }
  }
  int cnt=0;
  for (auto o:v1){
    if (o>m){
      cnt++;
    }
  }
  cout << n-v1.size()+cnt << endl;
}

Compilation message

triusis.cpp: In function 'int main()':
triusis.cpp:21:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   21 |     if (pos==v1.size()){
      |         ~~~^~~~~~~~~~~

Subtask #1
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -