Submission #762546

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
762546	2023-06-21T13:34:44 Z	AutomatiC__	Rabbit Carrot (LMIO19_triusis)	C++17	0 / 100	1 ms	340 KB

triusis

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <cctype>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <vector>
#include <cstdlib>
#include <bitset>
#include <deque>
#define inf 0x3f3f3f3f
#define infll 0x3f3f3f3f3f3f3f3fll
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int maxn = 200005;
ll a[maxn];
ll n, m;
int main() {
    cin >> n >> m;
    for (int i = 1; i <= n; i++) cin >> a[i];
    vector<ll> vec;
    for (int i = 1; i <= n; i++) {
        if (m * i - a[i] >= 0) vec.push_back(m * i - a[i]);
    }
    vector<ll> dp;
    for (int i = 0; i < vec.size(); i++) {
        if (dp.empty() || vec[i] >= dp.back()) {
            dp.push_back(vec[i]);
        } else {
            int pos = lower_bound(dp.begin(), dp.end(), vec[i]) - dp.begin();
            dp[pos] = vec[i];
        }
    }
    cout << n - dp.size() << endl;
    return 0;
}

Compilation message

triusis.cpp: In function 'int main()':
triusis.cpp:33:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |     for (int i = 0; i < vec.size(); i++) {
      |                     ~~^~~~~~~~~~~~

Subtask #1

0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	300 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	308 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	304 KB	Output is correct
12	Incorrect	0 ms	212 KB	Output isn't correct
13	Halted	0 ms	0 KB	-

Subtask #2

0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	300 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	308 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	304 KB	Output is correct
12	Incorrect	0 ms	212 KB	Output isn't correct
13	Halted	0 ms	0 KB	-

Subtask #3

0 / 28.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	300 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	308 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	304 KB	Output is correct
12	Incorrect	0 ms	212 KB	Output isn't correct
13	Halted	0 ms	0 KB	-

Subtask #4

0 / 37.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	300 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	308 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	304 KB	Output is correct
12	Incorrect	0 ms	212 KB	Output isn't correct
13	Halted	0 ms	0 KB	-