oj.uz

Submission #88788

# Submission time Handle Problem Language Result Execution time Memory
88788 2018-12-08T18:13:27 Z asifthegreat Studentsko (COCI14_studentsko) C++14
100 / 100
 60 ms 976 KB 
#include <bits/stdc++.h>
using namespace std;


const int N = 50003;
int ara[N],tmp[N],dp[N],n,k;
vector<int>v;
map<int,int>id;

int main()
{
    scanf("%d %d",&n,&k);
    for(int i = 0; i < n;i++){
        scanf("%d",&ara[i]);tmp[i] = ara[i];
    }
    sort(tmp,tmp+n);
    for(int i = 0; i < n;i++)id[tmp[i]] = i/k;
    for(int i = 0; i < n;i++)v.push_back(id[ara[i]]);
    for(int i = 0; i <= n;i++)dp[i] = 1;

    for(int i = 1; i < n;i++)
        for(int j = 0; j < i;j++)
            if(v[j] <= v[i])dp[i] = max(dp[i],dp[j]+1);
    cout << n-*max_element(dp,dp+n) << endl;
    return 0;
}

Compilation message

studentsko.cpp: In function 'int main()':
studentsko.cpp:12:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d",&n,&k);
     ~~~~~^~~~~~~~~~~~~~~
studentsko.cpp:14:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d",&ara[i]);tmp[i] = ara[i];
         ~~~~~^~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 856 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 940 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 940 KB Output is correct
2 Correct 44 ms 940 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 940 KB Output is correct
2 Correct 60 ms 940 KB Output is correct

Subtask #8
10.0 / 10.0

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

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 976 KB Output is correct
2 Correct 50 ms 976 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 976 KB Output is correct
2 Correct 57 ms 976 KB Output is correct