Task: | Mex value |
Sender: | herkar |
Submission time: | 2017-01-22 13:24:17 +0200 |
Language: | C++ |
Status: | READY |
Result: | 0 |
group | verdict | score |
---|---|---|
#1 | WRONG ANSWER | 0 |
#2 | WRONG ANSWER | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | WRONG ANSWER | 0.04 s | 1 | details |
#2 | WRONG ANSWER | 0.04 s | 1 | details |
#3 | WRONG ANSWER | 0.03 s | 1 | details |
#4 | WRONG ANSWER | 0.03 s | 1 | details |
#5 | ACCEPTED | 0.05 s | 1 | details |
#6 | WRONG ANSWER | 0.04 s | 1 | details |
#7 | WRONG ANSWER | 0.03 s | 1 | details |
#8 | WRONG ANSWER | 0.05 s | 1 | details |
#9 | WRONG ANSWER | 0.04 s | 1 | details |
#10 | ACCEPTED | 0.03 s | 1 | details |
#11 | WRONG ANSWER | 0.25 s | 2 | details |
#12 | WRONG ANSWER | 0.24 s | 2 | details |
#13 | WRONG ANSWER | 0.24 s | 2 | details |
#14 | WRONG ANSWER | 0.21 s | 2 | details |
#15 | ACCEPTED | 0.17 s | 2 | details |
#16 | WRONG ANSWER | 0.21 s | 2 | details |
#17 | WRONG ANSWER | 0.22 s | 2 | details |
#18 | WRONG ANSWER | 0.20 s | 2 | details |
#19 | WRONG ANSWER | 0.24 s | 2 | details |
#20 | ACCEPTED | 0.18 s | 2 | details |
Code
#include <functional> #include <algorithm> #include <iostream> #include <string> #include <vector> #include <cmath> #include <queue> #include <stack> #include <set> #include <map> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace __gnu_pbds; using namespace std; template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; #define rep(i,a,b) for(int i = (a); i < int(b); ++i) #define rrep(i,a,b) for(int i = (b); i --> int(a); ) #define trav(i,v) for(auto&i:v) #define all(c) (c).begin(), (c).end() #define sz(c) int((c).size()) typedef long long ll; typedef vector<int> vi; typedef pair<int,int> pii; int main(){ cin.tie(0); cin.sync_with_stdio(0); cin.tie(0); cin.sync_with_stdio(0); int n,k; cin >> n >> k; vi v(n); trav(i,v) cin >> i; map<int,int> C; Tree<int> T; function<void(int)> add = [&](int a){ if(C[a]++) return; T.insert(a); }, rem = [&](int a){ if(--C[a]) return; T.erase(T.find(a)); }; rep(i,0,k) add(v[i]); rep(i,k,n+1){ int m = 0; for(int j = k/2; j > 0; j >>= 1) while(m+j < k && !(T.find(m+j) == T.end()) && int(T.order_of_key(m+j)) == m+j) m += j; cout << m+1 << " "; if(i < n){ add(v[i]); rem(v[i-k]); } } cout << endl; }
Test details
Test 1
Group: 1
Verdict: WRONG ANSWER
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: WRONG ANSWER
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: WRONG ANSWER
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 1 1 1 1 2 9 10 4 ... |
Test 4
Group: 1
Verdict: WRONG ANSWER
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 1 1 1 1 1 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: WRONG ANSWER
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 1 5 1 1 1 1 1 5 2 5 10 1 ... |
Test 7
Group: 1
Verdict: WRONG ANSWER
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 1 1 2 3 9 10 6 ... |
Test 8
Group: 1
Verdict: WRONG ANSWER
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 1 1 1 1 1 1 1 1 1 10 9 ... |
Test 9
Group: 1
Verdict: WRONG ANSWER
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 1 1 1 1 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: WRONG ANSWER
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: WRONG ANSWER
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: WRONG ANSWER
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: WRONG ANSWER
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: WRONG ANSWER
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: WRONG ANSWER
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: WRONG ANSWER
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: WRONG ANSWER
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 ... |