oj.uz

Submission #81700

# Submission time Handle Problem Language Result Execution time Memory
81700 2018-10-26T08:53:19 Z luckyboy Karte (COCI18_karte) C++14
84 / 120
 1000 ms 9560 KB 
/**Lucky Boy**/
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define FORD(i, a, b) for (int i = (a); i >= (b); --i)
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define maxc 1000000007
#define maxn 500005
#define maxm 500005
#define pii pair <int,int>
#define Task "Karte"
template <typename T> inline void read(T &x){char c;bool nega=0;while((!isdigit(c=getchar()))&&(c!='-'));if(c=='-'){nega=1;c=getchar();}x=c-48;while(isdigit(c=getchar())) x=x*10+c-48;if(nega) x=-x;}
template <typename T> inline void writep(T x){if(x>9) writep(x/10);putchar(x%10+48);}
template <typename T> inline void write(T x){if(x<0){putchar('-');x=-x;}writep(x);putchar(' ');}
template <typename T> inline void writeln(T x){write(x);putchar('\n');}
using namespace std;
int n,k,a[maxn],cnt;
pii x[maxn];
int Calc(int x)
{
    int cnt = 0;
    FOR(i,0,n-1) if (cnt < a[i+x]) ++cnt;
    return cnt;
}
int main()
{
    //ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    //freopen(Task".inp", "r",stdin);
    //freopen(Task".out", "w",stdout);
    read(n),read(k);
    FOR(i,1,n) read(a[i]);
    sort(a+1,a+n+1);
    FOR(i,1,n) a[i+n] = a[i];
    FOR(i,1,n)
    {
        if (Calc(i) == k)
        {
            FORD(j,n-1,0) write(a[i+j]);
            return 0;
        }
    }
    write(-1);
//    FOR(i,1,n)
//    {
//        if (a[i] == cnt) ++x[cnt].S;
//        else x[++cnt] = mp(a[i],1);
//    }
//    if (cnt < k)
//    {
//        write(-1);
//        return 0;
//    }

    return 0;
}

Subtask #1
12.0 / 12.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 692 KB Output is correct
2 Correct 4 ms 692 KB Output is correct

Subtask #5
12.0 / 12.0

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

Subtask #6
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 692 KB Output is correct
2 Correct 8 ms 692 KB Output is correct

Subtask #7
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 708 KB Output is correct
2 Correct 8 ms 720 KB Output is correct

Subtask #8
0 / 12.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1063 ms 2012 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 12.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1074 ms 4016 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 12.0

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