oj.uz

Submission #900683

# Submission time Handle Problem Language Result Execution time Memory
900683 2024-01-08T21:37:05 Z n3rm1n Karte (COCI18_karte) C++17
120 / 120
 85 ms 9928 KB 
#include<bits/stdc++.h>
#define endl '\n'
#pragma GCC optimize("Ofast")
using namespace std;
const int MAXN = 5e5 + 10;
void speed()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
}
int n, k, a[MAXN];

void read()
{
    cin >> n >> k;
    int cnt0 = 0;
    for (int i = 1; i <= n; ++ i)
    {
        cin >> a[i];
        if(!a[i])cnt0 ++;
    }
    sort(a+1, a+n+1);
    if(k == 0)
    {
        if(cnt0 != n)cout << -1 << endl;
        else
        {
            for (int i = 1; i <= n; ++ i)
                cout << a[i] << " ";
            cout << endl;
        }
        exit(0);
    }
    int cnt_false = 0;
    vector < int > g;
    for(int i = n - k + 1; i <= n; ++ i)
    {
        g.push_back(a[i]);
        if(a[i] > cnt_false)cnt_false ++;
    }
    for (int i = 1; i <= n - k; ++ i)
    {
        g.push_back(a[i]);
        if(a[i] > cnt_false)
        {
            cnt_false ++;

        }
    }

    //cout << cnt_false << endl;
    if(cnt_false == k)
    {
        for (int i = g.size()-1; i >= 0; -- i)
            cout << g[i] << " ";
        cout << endl;
    }
    else cout << -1 << endl;
}
int main()
{
    speed();

    read();
    return 0;
}

Subtask #1
12.0 / 12.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
12.0 / 12.0

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

Subtask #5
12.0 / 12.0

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

Subtask #6
12.0 / 12.0

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

Subtask #7
12.0 / 12.0

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

Subtask #8
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 2268 KB Output is correct
2 Correct 14 ms 2016 KB Output is correct

Subtask #9
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 4304 KB Output is correct
2 Correct 24 ms 3548 KB Output is correct

Subtask #10
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 85 ms 9928 KB Output is correct
2 Correct 66 ms 7544 KB Output is correct