oj.uz

Submission #88802

# Submission time Handle Problem Language Result Execution time Memory
88802 2018-12-08T20:04:02 Z shafinalam Studentsko (COCI14_studentsko) C++14
100 / 100
 59 ms 1148 KB 
#include <bits/stdc++.h>

using namespace std;

const int mx = 1e5+5;
typedef long long ll;
typedef unsigned int ui;
typedef unsigned long long ull;
typedef pair<int,int>pii;
typedef pair<int,pii>piii;

#define  sf scanf
#define  pf printf

#define  input freopen("input.txt","r",stdin)
#define  output freopen("output.txt","w",stdout)

#define  inf 1e16
#define  ff first
#define  ss second
#define  MP make_pair
#define  pb push_back
#define  all(v) v.begin(), v.end()
#define  printcase(cases) printf("Case %d:", cases);
#define  Unique(a) a.erase(unique(a.begin(),a.end()),a.end())
#define  FAST  ios_base::sync_with_stdio(0);cout.tie(0)
#define  endl printf("\n")
#define  __lcm(a, b) ((a*b)/__gcd(a, b))

int  Set(int N,int pos){return N=N | (1<<pos);}
int  reset(int N,int pos){return N= N & ~(1<<pos);}
bool check(int N,int pos){return (bool)(N & (1<<pos));}
int arr[mx];
int tmp[mx];
map<ll,int>id;
int dp[mx];
vector<int>v;

int main()
{
    int n, k;
    sf("%d%d", &n, &k);

    for(int i = 0; i < n; i++)
    {
        sf("%d", &arr[i]);
        tmp[i] = arr[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[arr[i]]);
    int boro = 0;
    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);
        }
        boro = max(boro, dp[i]);
    }
    int ans = n-*max_element(dp, dp+n);
    pf("%d\n", ans);
    return 0;
}

Compilation message

studentsko.cpp: In function 'int main()':
studentsko.cpp:42:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     sf("%d%d", &n, &k);
       ^
studentsko.cpp:46:11: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         sf("%d", &arr[i]);
           ^

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
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 1056 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 1056 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 1056 KB Output is correct
2 Correct 50 ms 1088 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 1108 KB Output is correct
2 Correct 59 ms 1148 KB Output is correct

Subtask #8
10.0 / 10.0

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

Subtask #9
10.0 / 10.0

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

Subtask #10
10.0 / 10.0

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