oj.uz

Submission #165101

# Submission time Handle Problem Language Result Execution time Memory
165101 2019-11-25T07:09:00 Z egekabas Studentsko (COCI14_studentsko) C++14
80 / 100
 267 ms 65540 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;
ll n, k;
ll dp[5009][5009];
pll a[5009];
ll 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(ll i = 0; i < n; ++i){
        cin >> a[i].ff;
        a[i].ss = i;
    }
    sort(a, a+n);
    for(ll i = 0; i < n; ++i)
        team[a[i].ss] = i/k;
    set<int> s;
    for(ll i = 0; i < n; ++i){
        s.clear();
        for(ll j = 0; j <= (n-1)/k; ++j){
            if(i > 0)
                s.insert(dp[i-1][j]);
            if(!s.empty())
                dp[i][j] = *s.begin()+1;
            else
                dp[i][j] = 1;
        }
        --dp[i][team[i]];
    }
    ll ans = 1e18;
    for(ll j = 0; j <= (n-1)/k; ++j)
        ans = min(ans, dp[n-1][j]);
    cout << ans << "\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
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 #3
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 #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 109 ms 33912 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 22776 KB Output is correct

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 225 ms 65540 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 99 ms 35872 KB Output is correct
2 Runtime error 267 ms 65536 KB Execution killed with signal 9 (could be triggered by violating memory limits)

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 115 ms 40312 KB Output is correct
2 Correct 18 ms 18936 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 21368 KB Output is correct
2 Correct 81 ms 30756 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 24024 KB Output is correct
2 Correct 33 ms 22236 KB Output is correct