oj.uz

Submission #165097

# Submission time Handle Problem Language Result Execution time Memory
165097 2019-11-25T06:52:30 Z egekabas Studentsko (COCI14_studentsko) C++14
30 / 100
 66 ms 56676 KB 
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long   ll;
typedef unsigned long long   ull;
typedef long double ld;
typedef pair<ll, ll>    pll;
typedef pair<ull, ull>    pull;
typedef pair<ll, ll>  pii;
typedef pair<ld, ld>  pld;
int n, k;
int dp[5009][5009];
int a[5009];
pii b[5009];
int team[5009];
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    
    //freopen("in.txt", "r", stdin);
    //freopen("out.txt", "w", stdout);
    
    cin >> n >> k;
    for(int i = 0; i < n; ++i){
        cin >> a[i];
        b[i] = {a[i], i};
    }
    sort(b, b+n);
    for(int i = 0; i < n; ++i){
        team[b[i].ss] = i/k;
    }
    for(int i = 0; i < n; ++i)
        for(int j = 0; j <= (n-1)/k; ++j){
            if(i == 0){
                if(team[i] == j)
                    dp[i][j] = 0;
                else
                    dp[i][j] = 1;
            }
            else if(j == 0){
                dp[i][j] = 1+dp[i-1][j];
                if(team[i] == j)
                    --dp[i][j];
            }
            else{
                dp[i][j] = 1+min(dp[i-1][j], dp[i-1][j-1]);
                if(team[i] == j)
                    --dp[i][j];    
            }
        }
    cout << dp[n-1][(n-1)/k] << "\n";
}

Subtask #1
10.0 / 10.0

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

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 632 KB Output is correct
2 Incorrect 2 ms 376 KB Output isn't correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 2 ms 504 KB Output isn't correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 27 ms 27000 KB Output isn't correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 21624 KB Output is correct

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 66 ms 56676 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 29 ms 27812 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 31 ms 30560 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 20984 KB Output is correct
2 Incorrect 27 ms 25336 KB Output isn't correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 22136 KB Output is correct
2 Correct 20 ms 21436 KB Output is correct