Submission #1081305

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1081305	2024-08-29T21:47:04 Z	chaoslong	Rabbit Carrot (LMIO19_triusis)	C++14	100 / 100	66 ms	5840 KB

triusis

// Calm down.
// Think three times, code twice.
#include "bits/stdc++.h"
#define forr(_a,_b,_c) for(int _a = (_b); _a <= (_c); ++_a)
#define ford(_a,_b,_c) for(int _a = (_b) + 1; _a --> (_c);)
#define forf(_a,_b,_c) for(int _a = (_b); _a < (_c); ++_a)
#define st first
#define nd second
#define ll long long
#define ull unsigned long long
#define pii pair <int,int>
#define pll pair <ll,ll>
#define piii pair <int,pii>
#define vi vector <int>
#define pb push_back
#define mp make_pair
#define all(x) begin(x),end(x)
#define mask(i) (1LL << (i))
#define bit(x, i) (((x) >> (i)) & 1)
#define bp __builtin_popcountll
#define file "test"

using namespace std;
const int N = 2e5 + 5;
const int mod = 1e9 + 7; // 998244353
const ll oo = 1e18;

int n, m, a[N], t[4 * N];

void update(int id, int l, int r, int p, int val) {
    if(l > p || r < p) return;
    if(l == r) {
        t[id] = val;
        return;
    }
    int mid = (l + r) >> 1;
    update(id << 1, l, mid, p, val);
    update(id << 1 | 1, mid + 1, r, p, val);
    t[id] = max(t[id << 1], t[id << 1 | 1]);
}

int get(int id, int l, int r, int u, int v) {
    if(l > v || r < u) return 0;
    if(u <= l && r <= v) return t[id];
    int mid = (l + r) >> 1;
    int trai = get(id << 1, l, mid, u, v);
    int phai = get(id << 1 | 1, mid + 1, r, u, v);
    return max(trai, phai);
}

void to_nho_cau() {
    cin >> n >> m;
    vector<int> nen;
    int kt = 0;
    forr(i, 1, n) {
        int x; cin >> x;
        a[i] = -1;
        if(m * i < x) continue;
        a[i] = m * i - x;
        nen.pb(a[i]);
    }
    sort(all(nen));
    nen.resize(unique(all(nen)) - nen.begin());
    int mx = 0;
    forr(i, 1, n) {
        if(a[i] >= 0)
        a[i] = lower_bound(all(nen), a[i]) - nen.begin() + 1;
        mx = max(mx, a[i]);
    }
    int ans = 0;
    forr(i, 1, n) {
        if(a[i] < 0) continue;
        int val = get(1, 1, mx, 0, a[i]) + 1;
        update(1, 1, mx, a[i], val);
        ans = max(ans, val);
    }
    cout << n - ans << "\n";
}

signed main(){
    ios_base::sync_with_stdio(0);cin.tie(0);
    #ifdef LOCAL
        freopen(file".inp","r",stdin);
        freopen(file".out","w",stdout);
    #endif
    int t = 1;
    //cin >> t;
    while(t--) to_nho_cau();
}
/*
1.self check:
2.long long
3.size of array
4.code for testing
5.initializing
6.modulo number
*/
/**
  ∧__∧
（｀•ω• )づ__∧
（つ　 /( •ω•。)
  しーＪ (nnノ) pat pat
**/
/**  /\_/\
*   (= ._.)
*   / >☕ \>💻
**/

Compilation message

triusis.cpp:104:9: warning: "/*" within comment [-Wcomment]
  104 | /**  /\_/\
      |          
triusis.cpp: In function 'void to_nho_cau()':
triusis.cpp:54:9: warning: unused variable 'kt' [-Wunused-variable]
   54 |     int kt = 0;
      |         ^~

Subtask #1
14.0 / 14.0

#	Verdict	Memory	Grader output
1	Correct	344 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Correct	348 KB	Output is correct
4	Correct	348 KB	Output is correct
5	Correct	348 KB	Output is correct
6	Correct	348 KB	Output is correct
7	Correct	348 KB	Output is correct
8	Correct	420 KB	Output is correct
9	Correct	348 KB	Output is correct
10	Correct	348 KB	Output is correct
11	Correct	344 KB	Output is correct
12	Correct	348 KB	Output is correct
13	Correct	348 KB	Output is correct
14	Correct	348 KB	Output is correct
15	Correct	348 KB	Output is correct
16	Correct	344 KB	Output is correct

Subtask #2
21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 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	420 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	344 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	344 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	2 ms	344 KB	Output is correct
21	Correct	2 ms	604 KB	Output is correct
22	Correct	1 ms	504 KB	Output is correct
23	Correct	2 ms	604 KB	Output is correct
24	Correct	2 ms	604 KB	Output is correct
25	Correct	3 ms	628 KB	Output is correct
26	Correct	2 ms	604 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	1 ms	476 KB	Output is correct
29	Correct	2 ms	604 KB	Output is correct
30	Correct	2 ms	604 KB	Output is correct
31	Correct	1 ms	416 KB	Output is correct
32	Correct	2 ms	604 KB	Output is correct
33	Correct	2 ms	604 KB	Output is correct

Subtask #3
28.0 / 28.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	2 ms	344 KB	Output is correct
5	Correct	2 ms	604 KB	Output is correct
6	Correct	1 ms	504 KB	Output is correct
7	Correct	2 ms	604 KB	Output is correct
8	Correct	2 ms	604 KB	Output is correct
9	Correct	3 ms	628 KB	Output is correct
10	Correct	2 ms	604 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	476 KB	Output is correct
13	Correct	2 ms	604 KB	Output is correct
14	Correct	2 ms	604 KB	Output is correct
15	Correct	1 ms	416 KB	Output is correct
16	Correct	2 ms	604 KB	Output is correct
17	Correct	2 ms	604 KB	Output is correct
18	Correct	0 ms	344 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	420 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	0 ms	344 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	0 ms	344 KB	Output is correct
34	Correct	1 ms	348 KB	Output is correct
35	Correct	1 ms	348 KB	Output is correct
36	Correct	1 ms	348 KB	Output is correct
37	Correct	1 ms	604 KB	Output is correct
38	Correct	1 ms	428 KB	Output is correct
39	Correct	1 ms	348 KB	Output is correct
40	Correct	1 ms	348 KB	Output is correct
41	Correct	1 ms	348 KB	Output is correct
42	Correct	2 ms	484 KB	Output is correct
43	Correct	2 ms	604 KB	Output is correct

Subtask #4
37.0 / 37.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	1 ms	604 KB	Output is correct
5	Correct	1 ms	428 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	2 ms	484 KB	Output is correct
10	Correct	2 ms	604 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	2 ms	344 KB	Output is correct
15	Correct	2 ms	604 KB	Output is correct
16	Correct	1 ms	504 KB	Output is correct
17	Correct	2 ms	604 KB	Output is correct
18	Correct	2 ms	604 KB	Output is correct
19	Correct	3 ms	628 KB	Output is correct
20	Correct	2 ms	604 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	1 ms	476 KB	Output is correct
23	Correct	2 ms	604 KB	Output is correct
24	Correct	2 ms	604 KB	Output is correct
25	Correct	1 ms	416 KB	Output is correct
26	Correct	2 ms	604 KB	Output is correct
27	Correct	2 ms	604 KB	Output is correct
28	Correct	0 ms	344 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	0 ms	348 KB	Output is correct
34	Correct	0 ms	348 KB	Output is correct
35	Correct	0 ms	420 KB	Output is correct
36	Correct	0 ms	348 KB	Output is correct
37	Correct	0 ms	348 KB	Output is correct
38	Correct	0 ms	344 KB	Output is correct
39	Correct	0 ms	348 KB	Output is correct
40	Correct	0 ms	348 KB	Output is correct
41	Correct	0 ms	348 KB	Output is correct
42	Correct	0 ms	348 KB	Output is correct
43	Correct	0 ms	344 KB	Output is correct
44	Correct	64 ms	4608 KB	Output is correct
45	Correct	14 ms	3164 KB	Output is correct
46	Correct	56 ms	5840 KB	Output is correct
47	Correct	58 ms	4560 KB	Output is correct
48	Correct	61 ms	5072 KB	Output is correct
49	Correct	66 ms	5580 KB	Output is correct
50	Correct	21 ms	4060 KB	Output is correct
51	Correct	26 ms	3880 KB	Output is correct
52	Correct	64 ms	4048 KB	Output is correct
53	Correct	11 ms	2392 KB	Output is correct
54	Correct	62 ms	5072 KB	Output is correct
55	Correct	66 ms	5072 KB	Output is correct

Submission #1081305

Compilation message

Subtask #1 14.0 / 14.0

Subtask #2 21.0 / 21.0

Subtask #3 28.0 / 28.0

Subtask #4 37.0 / 37.0

Subtask #1
14.0 / 14.0

Subtask #2
21.0 / 21.0

Subtask #3
28.0 / 28.0

Subtask #4
37.0 / 37.0