CSES - Datatähti 2017 loppu

CSES - Datatähti 2017 loppu - Results

Submission details
Task:	Mex-luku
Sender:	OulaK
Submission time:	2017-01-19 17:13:48 +0200
Language:	C++
Status:	READY
Result:	0

Feedback
group	verdict	score
#1	RUNTIME ERROR	0
#2	TIME LIMIT EXCEEDED	0

Test results
test	verdict	time	group
#1	RUNTIME ERROR	0.18 s	1	details
#2	RUNTIME ERROR	0.19 s	1	details
#3	RUNTIME ERROR	0.23 s	1	details
#4	RUNTIME ERROR	0.17 s	1	details
#5	RUNTIME ERROR	0.17 s	1	details
#6	RUNTIME ERROR	0.18 s	1	details
#7	RUNTIME ERROR	0.17 s	1	details
#8	RUNTIME ERROR	0.19 s	1	details
#9	RUNTIME ERROR	0.16 s	1	details
#10	RUNTIME ERROR	0.17 s	1	details
#11	TIME LIMIT EXCEEDED	--	2	details
#12	TIME LIMIT EXCEEDED	--	2	details
#13	TIME LIMIT EXCEEDED	--	2	details
#14	TIME LIMIT EXCEEDED	--	2	details
#15	TIME LIMIT EXCEEDED	--	2	details
#16	TIME LIMIT EXCEEDED	--	2	details
#17	TIME LIMIT EXCEEDED	--	2	details
#18	TIME LIMIT EXCEEDED	--	2	details
#19	TIME LIMIT EXCEEDED	--	2	details
#20	TIME LIMIT EXCEEDED	--	2	details

Compiler report

input/code.cpp: In function 'void r()':
input/code.cpp:14:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  if (i == s.size()) cout << *(--s.end()) + 1 << " ";
                  ^

Code

#include<bits/stdc++.h>
using namespace std;
 
deque<set<int>::iterator> v;
set<int> s;
inline void r() {
    
    int i = 0;
    for (auto it = s.begin(); it != s.end(); ++it) {
	if (*it != i++) {
	    cout << --i << " ";
	    break;
	}
	if (i == s.size()) cout << *(--s.end()) + 1 << " ";
    }
 
    //for (int i = 1; i < v.size(); ++i) {
    //    if (v[i - 1] == v[i]) v.erase(v.begin() + i);
    //}
 
    //for (int i = 0; i < v.size(); ++i) {
    //    if (v[i] != i) {
    //        cout << i << " ";
    //        break;
    //    }
 
    //    if (i == v.size() - 1) cout << i + 1 << " ";
    //}
}
 
 
int main() {
 
    int n, m; cin >> n >> m;
    int x[n]; 
    for (int i = 0; i < n; ++i) cin >> x[i];
 
    int offset = -1;
 
    for (int i = 0; i < m; ++i) {
	s.insert(x[i]);
	v.push_back(s.find(x[i]));
    }
 
    while (++offset + m <= n) {
	v.clear();
	r();
	s.erase(v.front());
	v.pop_front();
	s.insert(x[offset + m]);
	v.push_back(s.find(x[offset + m]));
    }
 
    cout << "\n";
 
    return 0;
}

Test details

Test 1

Group: 1

Verdict: RUNTIME ERROR

input
`100 10 1000000000 9 1 0 5 7 2 8 6 3 4...` view save

correct output
`4 10 9 1 1 1 1 1 1 1 1 4 10 3 ...` view save

user output
(empty)

Test 2

Group: 1

Verdict: RUNTIME ERROR

input
`100 10 1000000000 4 3 8 1 0 9 5 7 2 6...` view save

correct output
`6 10 4 3 3 1 1 1 1 1 3 3 10 6 ...` view save

user output
(empty)

Test 3

Group: 1

Verdict: RUNTIME ERROR

input
`100 10 1000000000 9 2 3 1 0 8 5 6 4 7...` view save

correct output
`7 10 9 2 2 1 0 1 1 1 2 9 10 4 ...` view save

user output
(empty)

Test 4

Group: 1

Verdict: RUNTIME ERROR

input
`100 10 1000000000 3 0 4 6 5 7 1 2 8 9...` view save

correct output
`9 10 3 0 0 0 0 0 4 2 2 2 10 6 ...` view save

user output
(empty)

Test 5

Group: 1

Verdict: RUNTIME ERROR

input
`100 10 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 ...` view save

correct output
`10 10 10 10 10 10 10 10 10 10 ...` view save

user output
(empty)

Test 6

Group: 1

Verdict: RUNTIME ERROR

input
`100 10 1000000000 0 5 1 9 3 4 6 7 2 8...` view save

correct output
`8 10 0 5 1 1 1 1 1 5 2 5 10 0 ...` view save

user output
(empty)

Test 7

Group: 1

Verdict: RUNTIME ERROR

input
`100 10 1000000000 1 2 9 3 8 0 4 7 5 6...` view save

correct output
`6 10 1 1 1 1 2 0 0 2 3 9 10 6 ...` view save

user output
(empty)

Test 8

Group: 1

Verdict: RUNTIME ERROR

input
`100 10 1000000000 5 0 6 7 1 4 8 3 9 2...` view save

correct output
`2 10 5 0 0 0 0 0 0 0 0 1 10 9 ...` view save

user output
(empty)

Test 9

Group: 1

Verdict: RUNTIME ERROR

input
`100 10 1000000000 7 3 0 1 4 9 2 5 6 8...` view save

correct output
`8 10 7 3 0 0 0 0 7 5 5 5 10 8 ...` view save

user output
(empty)

Test 10

Group: 1

Verdict: RUNTIME ERROR

input
`100 10 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 ...` view save

correct output
`10 10 10 10 10 10 10 10 10 10 ...` view save

user output
(empty)

Test 11

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`100000 10000 1000000000 4786 3512 3285 1919...` view save

correct output
`9547 10000 4786 3512 3285 1919...` view save

user output
(empty)

Test 12

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`100000 10000 1000000000 7981 3955 790 45 34...` view save

correct output
`7657 10000 7981 3955 790 45 45...` view save

user output
(empty)

Test 13

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`100000 10000 1000000000 2329 1825 9435 3800...` view save

correct output
`5701 10000 2329 1825 1825 1825...` view save

user output
(empty)

Test 14

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`100000 10000 1000000000 2754 6029 8007 6286...` view save

correct output
`1423 10000 2754 2754 2754 2754...` view save

user output
(empty)

Test 15

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`100000 10000 0 1 2 3 4 5 6 7 8 9 10 11 12 1...` view save

correct output
`10000 10000 10000 10000 10000 ...` view save

user output
(empty)

Test 16

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`100000 10000 1000000000 7560 4634 7044 3853...` view save

correct output
`9855 10000 7560 4634 4634 3853...` view save

user output
(empty)

Test 17

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`100000 10000 1000000000 7945 6674 3975 3002...` view save

correct output
`6373 10000 7945 6674 3975 3002...` view save

user output
(empty)

Test 18

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`100000 10000 1000000000 2506 6827 6871 8593...` view save

correct output
`2978 10000 2506 2506 2506 2506...` view save

user output
(empty)

Test 19

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`100000 10000 1000000000 2769 5036 539 4409 ...` view save

correct output
`2249 10000 2769 2769 539 539 5...` view save

user output
(empty)

Test 20

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`100000 10000 0 1 2 3 4 5 6 7 8 9 10 11 12 1...` view save

correct output
`10000 10000 10000 10000 10000 ...` view save

user output
(empty)

Datatähti 2017 loppu

Mex-luku

Compiler report

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Test 16

Test 17

Test 18

Test 19

Test 20

Tasks

Submissions (OulaK)