oj.uz

Submission #667744

# Submission time Handle Problem Language Result Execution time Memory
667744 2022-12-01T23:56:14 Z Github Studentsko (COCI14_studentsko) C++14
100 / 100
 2 ms 412 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;
    }

    for (int i = 0; i < n; i++){
        auto pos = upper_bound(l.begin(), l.end(), a[i]);
        if (pos == l.end()){
            l.push_back(a[i]);
        }else{
            *pos = a[i];
        }
    }
    cout << n-l.size() << endl;
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 316 KB Output is correct
2 Correct 1 ms 212 KB Output is correct

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
10.0 / 10.0

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

Subtask #7
10.0 / 10.0

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

Subtask #8
10.0 / 10.0

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

Subtask #9
10.0 / 10.0

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

Subtask #10
10.0 / 10.0

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