| Task: | Mex value |
| Sender: | Kaban-5 |
| Submission time: | 2017-01-20 15:59:57 +0200 |
| Language: | C++ |
| Status: | READY |
| Result: | 100 |
| group | verdict | score |
|---|---|---|
| #1 | ACCEPTED | 28 |
| #2 | ACCEPTED | 72 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | ACCEPTED | 0.04 s | 1 | details |
| #2 | ACCEPTED | 0.04 s | 1 | details |
| #3 | ACCEPTED | 0.04 s | 1 | details |
| #4 | ACCEPTED | 0.03 s | 1 | details |
| #5 | ACCEPTED | 0.04 s | 1 | details |
| #6 | ACCEPTED | 0.03 s | 1 | details |
| #7 | ACCEPTED | 0.03 s | 1 | details |
| #8 | ACCEPTED | 0.04 s | 1 | details |
| #9 | ACCEPTED | 0.04 s | 1 | details |
| #10 | ACCEPTED | 0.04 s | 1 | details |
| #11 | ACCEPTED | 0.20 s | 2 | details |
| #12 | ACCEPTED | 0.16 s | 2 | details |
| #13 | ACCEPTED | 0.16 s | 2 | details |
| #14 | ACCEPTED | 0.15 s | 2 | details |
| #15 | ACCEPTED | 0.32 s | 2 | details |
| #16 | ACCEPTED | 0.15 s | 2 | details |
| #17 | ACCEPTED | 0.16 s | 2 | details |
| #18 | ACCEPTED | 0.18 s | 2 | details |
| #19 | ACCEPTED | 0.15 s | 2 | details |
| #20 | ACCEPTED | 0.33 s | 2 | details |
Code
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fst first
#define snd second
#define forn(i, n) for (int i = 0; i < int(n); ++i)
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef vector<pii> vii;
#define sz(c) (int)(c).size()
#define ALL(c) (c).begin(), (c).end()
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
typedef tree<int, int, less<int>, rb_tree_tag,
tree_order_statistics_node_update> ordered_set;
void solve (int n)
{
int k;
cin >> k;
vi a(n);
forn (i, n) cin >> a[i];
ordered_set s;
forn (i, k) s[a[i]] = 1;
for (int i = k; i <= n; i++)
{
int left = 0, right = n + 1;
while (right - left > 1)
{
int mid = (left + right) / 2;
int posm = s.order_of_key(mid);
assert(posm <= mid);
if (posm == mid)
left = mid;
else
right = mid;
}
cout << right - 1 << " \n"[i == n];
if (i != n)
{
s[a[i - k]]--;
if (s[a[i - k]] == 0)
s.erase(a[i - k]);
s[a[i]]++;
}
}
}
int main()
{
#ifndef ONLINE_JUDGE
//freopen("input.txt", "rt", stdin);
//freopen("output.txt", "w", stdout);
#endif // ONLINE_JUDGE
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
while (cin >> n)
solve(n);
}
Test details
Test 1
Group: 1
Verdict: ACCEPTED
| input |
|---|
| 100 10 1000000000 9 1 0 5 7 2 8 6 3 4... |
| correct output |
|---|
| 4 10 9 1 1 1 1 1 1 1 1 4 10 3 ... |
| user output |
|---|
| 4 10 9 1 1 1 1 1 1 1 1 4 10 3 ... |
Test 2
Group: 1
Verdict: ACCEPTED
| input |
|---|
| 100 10 1000000000 4 3 8 1 0 9 5 7 2 6... |
| correct output |
|---|
| 6 10 4 3 3 1 1 1 1 1 3 3 10 6 ... |
| user output |
|---|
| 6 10 4 3 3 1 1 1 1 1 3 3 10 6 ... |
Test 3
Group: 1
Verdict: ACCEPTED
| input |
|---|
| 100 10 1000000000 9 2 3 1 0 8 5 6 4 7... |
| correct output |
|---|
| 7 10 9 2 2 1 0 1 1 1 2 9 10 4 ... |
| user output |
|---|
| 7 10 9 2 2 1 0 1 1 1 2 9 10 4 ... |
Test 4
Group: 1
Verdict: ACCEPTED
| input |
|---|
| 100 10 1000000000 3 0 4 6 5 7 1 2 8 9... |
| correct output |
|---|
| 9 10 3 0 0 0 0 0 4 2 2 2 10 6 ... |
| user output |
|---|
| 9 10 3 0 0 0 0 0 4 2 2 2 10 6 ... |
Test 5
Group: 1
Verdict: ACCEPTED
| input |
|---|
| 100 10 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 ... |
| correct output |
|---|
| 10 10 10 10 10 10 10 10 10 10 ... |
| user output |
|---|
| 10 10 10 10 10 10 10 10 10 10 ... |
Test 6
Group: 1
Verdict: ACCEPTED
| input |
|---|
| 100 10 1000000000 0 5 1 9 3 4 6 7 2 8... |
| correct output |
|---|
| 8 10 0 5 1 1 1 1 1 5 2 5 10 0 ... |
| user output |
|---|
| 8 10 0 5 1 1 1 1 1 5 2 5 10 0 ... |
Test 7
Group: 1
Verdict: ACCEPTED
| input |
|---|
| 100 10 1000000000 1 2 9 3 8 0 4 7 5 6... |
| correct output |
|---|
| 6 10 1 1 1 1 2 0 0 2 3 9 10 6 ... |
| user output |
|---|
| 6 10 1 1 1 1 2 0 0 2 3 9 10 6 ... |
Test 8
Group: 1
Verdict: ACCEPTED
| input |
|---|
| 100 10 1000000000 5 0 6 7 1 4 8 3 9 2... |
| correct output |
|---|
| 2 10 5 0 0 0 0 0 0 0 0 1 10 9 ... |
| user output |
|---|
| 2 10 5 0 0 0 0 0 0 0 0 1 10 9 ... |
Test 9
Group: 1
Verdict: ACCEPTED
| input |
|---|
| 100 10 1000000000 7 3 0 1 4 9 2 5 6 8... |
| correct output |
|---|
| 8 10 7 3 0 0 0 0 7 5 5 5 10 8 ... |
| user output |
|---|
| 8 10 7 3 0 0 0 0 7 5 5 5 10 8 ... |
Test 10
Group: 1
Verdict: ACCEPTED
| input |
|---|
| 100 10 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 ... |
| correct output |
|---|
| 10 10 10 10 10 10 10 10 10 10 ... |
| user output |
|---|
| 10 10 10 10 10 10 10 10 10 10 ... |
Test 11
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 100000 10000 1000000000 4786 3512 3285 1919... |
| correct output |
|---|
| 9547 10000 4786 3512 3285 1919... |
| user output |
|---|
| 9547 10000 4786 3512 3285 1919... |
Test 12
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 100000 10000 1000000000 7981 3955 790 45 34... |
| correct output |
|---|
| 7657 10000 7981 3955 790 45 45... |
| user output |
|---|
| 7657 10000 7981 3955 790 45 45... |
Test 13
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 100000 10000 1000000000 2329 1825 9435 3800... |
| correct output |
|---|
| 5701 10000 2329 1825 1825 1825... |
| user output |
|---|
| 5701 10000 2329 1825 1825 1825... |
Test 14
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 100000 10000 1000000000 2754 6029 8007 6286... |
| correct output |
|---|
| 1423 10000 2754 2754 2754 2754... |
| user output |
|---|
| 1423 10000 2754 2754 2754 2754... |
Test 15
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 100000 10000 0 1 2 3 4 5 6 7 8 9 10 11 12 1... |
| correct output |
|---|
| 10000 10000 10000 10000 10000 ... |
| user output |
|---|
| 10000 10000 10000 10000 10000 ... |
Test 16
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 100000 10000 1000000000 7560 4634 7044 3853... |
| correct output |
|---|
| 9855 10000 7560 4634 4634 3853... |
| user output |
|---|
| 9855 10000 7560 4634 4634 3853... |
Test 17
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 100000 10000 1000000000 7945 6674 3975 3002... |
| correct output |
|---|
| 6373 10000 7945 6674 3975 3002... |
| user output |
|---|
| 6373 10000 7945 6674 3975 3002... |
Test 18
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 100000 10000 1000000000 2506 6827 6871 8593... |
| correct output |
|---|
| 2978 10000 2506 2506 2506 2506... |
| user output |
|---|
| 2978 10000 2506 2506 2506 2506... |
Test 19
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 100000 10000 1000000000 2769 5036 539 4409 ... |
| correct output |
|---|
| 2249 10000 2769 2769 539 539 5... |
| user output |
|---|
| 2249 10000 2769 2769 539 539 5... |
Test 20
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 100000 10000 0 1 2 3 4 5 6 7 8 9 10 11 12 1... |
| correct output |
|---|
| 10000 10000 10000 10000 10000 ... |
| user output |
|---|
| 10000 10000 10000 10000 10000 ... |
