oj.uz

Submission #88791

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

const int N = 50003;

int ara[N],tmp[N],dp[N],n,k;
vector<int>v;
unordered_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]]);
    dp[0] = 1;
    for(int i = 1; i < n;i++){
        dp[i] = 1;
        for(int j = 0; j < i;j++)
        if(v[j] <= v[i])dp[i] = max(dp[i],dp[j]+1);
    }
    printf("%d\n",n-*max_element(dp,dp+n));
    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:13:36: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(int i = 0; i < n;i++){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 448 KB Output is correct
2 Correct 2 ms 448 KB Output is correct

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 876 KB Output is correct

Subtask #6
10.0 / 10.0

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

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 880 KB Output is correct
2 Correct 54 ms 1004 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 1004 KB Output is correct
2 Correct 39 ms 1004 KB Output is correct

Subtask #9
10.0 / 10.0

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

Subtask #10
10.0 / 10.0

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