oj.uz

Submission #667745

# Submission time Handle Problem Language Result Execution time Memory
667745 2022-12-01T23:57:09 Z Github Studentsko (COCI14_studentsko) C++14
100 / 100
 42 ms 408 KB 
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

#define speedup ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
#define ll long long
int main() {
    speedup
    int n, k;
    cin >> n >> k;
    vector<pair<int, int>> array(n);
    for (int i = 0; i < n; i++){
        cin >> array[i].first;
        array[i].second = i;
    }
    sort(array.begin(), array.end());
    vector<int> a(n), l;
    for (int i = 0; i < n; i++){
        a[array[i].second] = i/k;
    }
    ll dp[n];
    dp[0] = 1;
    ll len = 0;
    for (int i = 1; i < n; i++){
        dp[i] = 1;
        for (int j = 0; j <= i-1; j++){
            if (a[j] <= a[i]){
                dp[i] = max(dp[i], dp[j]+1);
            }
        }
    }
    long long mx = 0;
    for (int i = 0; i < n; i++){
        mx = max(mx, dp[i]);
    }
    cout << n-mx << endl;
    return 0;
}

Compilation message

studentsko.cpp: In function 'int main()':
studentsko.cpp:24:8: warning: unused variable 'len' [-Wunused-variable]
   24 |     ll len = 0;
      |        ^~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 340 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 408 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 380 KB Output is correct
2 Correct 38 ms 392 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 392 KB Output is correct
2 Correct 42 ms 340 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 392 KB Output is correct
2 Correct 31 ms 396 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 340 KB Output is correct
2 Correct 42 ms 388 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 400 KB Output is correct
2 Correct 40 ms 396 KB Output is correct