oj.uz

Submission #81709

# Submission time Handle Problem Language Result Execution time Memory
81709 2018-10-26T09:42:18 Z luckyboy Karte (COCI18_karte) C++14
72 / 120
 126 ms 8032 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 << 1],cnt;
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];
    int l = 1,r = n + 1;
    while (r - l > 1)
    {
        int mid = (l+r) >> 1;;
        if (Calc(mid) >= k) l = mid;
        else r = mid;
    }
    if (Calc(l) == k) FORD(i,n-1,0) write(a[i+l]);
    else write(-1);
    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 508 KB Output is correct

Subtask #2
12.0 / 12.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
0 / 12.0

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

Subtask #5
12.0 / 12.0

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

Subtask #6
0 / 12.0

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

Subtask #7
0 / 12.0

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

Subtask #8
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 1908 KB Output is correct
2 Correct 19 ms 1916 KB Output is correct

Subtask #9
0 / 12.0

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

Subtask #10
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 126 ms 7588 KB Output is correct
2 Correct 86 ms 8032 KB Output is correct