oj.uz

Submission #40623

# Submission time Handle Problem Language Result Execution time Memory
40623 2018-02-05T21:55:11 Z repeating Studentsko (COCI14_studentsko) C++11
10 / 100
 37 ms 792 KB 
#include <bits/stdc++.h>

#define F first
#define S second
#define P push
#define pb push_back
#define MEM(dp,i) memset(dp,i,sizeof(dp))
#define W while
#define R return
#define C continue
#define SI size()
#define ll long long
#define ld long double
#define pll pair<ll,ll>
#define pii pair<int,int>
#define SF(x) scanf("%Id",&x)
#define SF2(x,y) scanf("%Id%Id",&x,&y)
#define SF3(x,y,z) scanf("%I64d%I64d%I64d",&x,&y,&z)
#define SF4(x,y,z,o) scanf("%I64d%I64d%I64d%I64d",&x,&y,&z,&o)
#define all(v) v.begin(),v.end()

using namespace std;
const long long INF = 1e9+1;
const long long MOD = 1e9+7;
const int MX=200015;
int a[5015];
vector<pii> v;
bool vis[5015];
int start[5015];
int FIND(int n,int y){
    int res=0;
    for(int i=0;i<n;i++)
        res+=(y==a[i]);
    R res;
}
int main(){
    int n,m;
    cin>>n>>m;
    for(int i=0;i<n;i++){
        cin>>a[i];
        v.pb({a[i],i});
    }
    sort(v.begin(),v.end());
    for(int i=0;i<n;i++){
        a[v[i].S]=(i/m)+1;
    }
    for(int i=0;i<n;i++){
        int num=a[i],tk=0;
        for(int j=i;j<n;j++){
            if(a[j]==num){
                vis[j]=1;
                tk++;
                start[i]++;
                if(tk==m)tk=0,num++;
            }
        }
    }
    int res=0;
    for(int i=0;i<n;i++){
        res=max(res,start[i]+FIND(i,a[i]-1));
    }
    cout<<n-res;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 10.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 10.0

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

Subtask #6
0 / 10.0

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

Subtask #7
0 / 10.0

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

Subtask #8
0 / 10.0

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

Subtask #9
0 / 10.0

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

Subtask #10
0 / 10.0

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