CSES - NOI 2019 Open

CSES - NOI 2019 Open - Results

Submission details
Task:	Thieves and Prisons
Sender:	egor.lifar
Submission time:	2019-03-09 21:30:12 +0200
Language:	C++
Status:	READY
Result:	100

Feedback
group	verdict	score
#1	ACCEPTED	8
#2	ACCEPTED	13
#3	ACCEPTED	14
#4	ACCEPTED	18
#5	ACCEPTED	47

Test results
test	verdict	time	group
#1	ACCEPTED	0.02 s	2, 4, 5	details
#2	ACCEPTED	0.02 s	2, 4, 5	details
#3	ACCEPTED	0.01 s	2, 4, 5	details
#4	ACCEPTED	0.01 s	2, 4, 5	details
#5	ACCEPTED	0.02 s	2, 4, 5	details
#6	ACCEPTED	0.02 s	4, 5	details
#7	ACCEPTED	0.01 s	4, 5	details
#8	ACCEPTED	0.01 s	4, 5	details
#9	ACCEPTED	0.02 s	1, 3, 4, 5	details
#10	ACCEPTED	0.01 s	1, 3, 4, 5	details
#11	ACCEPTED	0.01 s	1, 3, 4, 5	details
#12	ACCEPTED	0.01 s	1, 3, 4, 5	details
#13	ACCEPTED	0.03 s	1, 3, 4, 5	details
#14	ACCEPTED	0.01 s	1, 3, 4, 5	details
#15	ACCEPTED	0.03 s	1, 3, 4, 5	details
#16	ACCEPTED	0.02 s	1, 3, 4, 5	details
#17	ACCEPTED	0.02 s	1, 2, 3, 4, 5	details
#18	ACCEPTED	0.01 s	1, 3, 4, 5	details
#19	ACCEPTED	0.09 s	2, 5	details
#20	ACCEPTED	0.07 s	2, 5	details
#21	ACCEPTED	0.09 s	2, 5	details
#22	ACCEPTED	0.04 s	5	details
#23	ACCEPTED	0.04 s	5	details
#24	ACCEPTED	0.02 s	3, 4, 5	details
#25	ACCEPTED	0.01 s	3, 4, 5	details
#26	ACCEPTED	0.02 s	3, 4, 5	details
#27	ACCEPTED	0.01 s	3, 4, 5	details
#28	ACCEPTED	0.02 s	4, 5	details
#29	ACCEPTED	0.02 s	4, 5	details
#30	ACCEPTED	0.02 s	4, 5	details
#31	ACCEPTED	0.03 s	4, 5	details
#32	ACCEPTED	0.01 s	2, 4, 5	details
#33	ACCEPTED	0.01 s	2, 4, 5	details
#34	ACCEPTED	0.02 s	2, 4, 5	details
#35	ACCEPTED	0.01 s	2, 4, 5	details
#36	ACCEPTED	0.06 s	3, 5	details
#37	ACCEPTED	0.07 s	3, 5	details
#38	ACCEPTED	0.05 s	3, 5	details
#39	ACCEPTED	0.05 s	3, 5	details
#40	ACCEPTED	0.07 s	5	details
#41	ACCEPTED	0.07 s	5	details
#42	ACCEPTED	0.07 s	5	details
#43	ACCEPTED	0.06 s	5	details
#44	ACCEPTED	0.08 s	2, 5	details
#45	ACCEPTED	0.08 s	2, 5	details
#46	ACCEPTED	0.09 s	2, 5	details
#47	ACCEPTED	0.08 s	2, 5	details

Code

 /*
ЗАПУСКАЕМ 
░ГУСЯ░▄▀▀▀▄░РАБОТЯГУ░░
▄███▀░◐░░░▌░░░░░░░
░░░░▌░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▌░░░░░▐▄▄░░░░░
░░░░▌░░░░▄▀▒▒▀▀▀▀▄
░░░▐░░░░▐▒▒▒▒▒▒▒▒▀▀▄
░░░▐░░░░▐▄▒▒▒▒▒▒▒▒▒▒▀▄
░░░░▀▄░░░░▀▄▒▒▒▒▒▒▒▒▒▒▀▄
░░░░░░▀▄▄▄▄▄█▄▄▄▄▄▄▄▄▄▄▄▀▄
░░░░░░░░░░░▌▌░▌▌░░░░░
░░░░░░░░░░░▌▌░▌▌░░░░░
░░░░░░░░░▄▄▌▌▄▌▌░░░░░ 
 */
#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#include <cassert>
#include <queue>
#include <stack>
#include <deque>
 
using namespace std;
template<typename T1, typename T2> inline void chkmin(T1 &a, T2 b) {if (a > b) a = b;}
template<typename T1, typename T2> inline void chkmax(T1 &a, T2 b) {if (a < b) a = b;}
#define files(FILENAME) read(FILENAME); write(FILENAME)
#define read(FILENAME) freopen((FILENAME + ".in").c_str(), "r", stdin)
#define write(FILENAME) freopen((FILENAME + ".out").c_str(), "w", stdout)
#define all(c) (c).begin(), (c).end()
#define sz(c) (int)(c).size()
#define left left228
#define right right228
#define y1 y1228
#define mp make_pair
#define pb push_back
#define y2 y2228
const string FILENAME = "input";
const int MAXN = 100228;
 
 
int n, k, m;
char c[MAXN];
int x[MAXN];
int res[MAXN];
int last[MAXN];
 
 
int  main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	//read(FILENAME);
	cin >> n >> k >> m;
	for (int i = 0; i < m; i++) {
		cin >> c[i] >> x[i];
	}
	set<int> s;
	for (int i = 1; i <= k; i++) {
		s.insert(i);
	}
	for (int i = 1; i <= n; i++) {
		last[i] = m + 1;
	}
	set<pair<int, int> > st;
	int lasts = 1;
	int times = m;
	for (int i = m - 1; i >= 0; i--) {
		if (c[i] == 'O') {
			if (s.empty()) {
				cout << "IMPOSSIBLE\n";
				return 0;
			}
			int f = *s.begin();
			s.erase(f);
			st.insert(make_pair(i, f));
			lasts = f;
			res[i] = f;
			times = i;
		} else {
			auto it = st.lower_bound(make_pair(last[x[i]], 0));
			if (it != st.begin()) {
				it--;
				pair<int, int> f = *it;
				st.erase(f);
				res[i] = f.second;
				s.insert(f.second);
			} else {
			//	cout << lasts << ' ' << times << ' ' << last[x[i]] <<  ' ' << x[i] << endl;
				//cout << times << endl;
				if (times >= last[x[i]]) {
					cout << "IMPOSSIBLE\n";
					return 0;
				}
				res[i] = lasts;
			}
		}
		last[x[i]] = i;
	}
	if (!st.empty()) {
		cout << "IMPOSSIBLE\n";
		return 0;
	}
	for (int i = 0; i < m; i++) {
		cout << res[i] << '\n';
	}
 	return 0; 
}

Test details

Test 1

Group: 2, 4, 5

Verdict: ACCEPTED

input
`1 1 1 C 1` view save

correct output
`1` view save

user output
`1` view save

Test 2

Group: 2, 4, 5

Verdict: ACCEPTED

input
`1 1 1 O 1` view save

correct output
`IMPOSSIBLE` view save

user output
`IMPOSSIBLE` view save

Test 3

Group: 2, 4, 5

Verdict: ACCEPTED

input
`1 1 2 C 1 C 1` view save

correct output
`IMPOSSIBLE` view save

user output
`IMPOSSIBLE` view save

Test 4

Group: 2, 4, 5

Verdict: ACCEPTED

input
`1 1 2 C 1 O 1` view save

correct output
`IMPOSSIBLE` view save

user output
`IMPOSSIBLE` view save

Test 5

Group: 2, 4, 5

Verdict: ACCEPTED

input
`1 1 2 O 1 C 1` view save

correct output
`IMPOSSIBLE` view save

user output
`IMPOSSIBLE` view save

Test 6

Group: 4, 5

Verdict: ACCEPTED

input
`2 1 2 C 1 C 2` view save

correct output
`1 1` view save

user output
`1 1` view save

Test 7

Group: 4, 5

Verdict: ACCEPTED

input
`2 1 2 C 1 O 1` view save

correct output
`IMPOSSIBLE` view save

user output
`IMPOSSIBLE` view save

Test 8

Group: 4, 5

Verdict: ACCEPTED

input
`2 1 2 C 1 O 2` view save

correct output
`1 1` view save

user output
`1 1` view save

Test 9

Group: 1, 3, 4, 5

Verdict: ACCEPTED

input
`3 2 5 C 1 C 2 O 3 C 1 ...` view save

correct output
`1 1 1 1 1` view save

user output
`1 1 1 1 1` view save

Test 10

Group: 1, 3, 4, 5

Verdict: ACCEPTED

input
`3 2 5 C 1 C 2 O 3 O 3 ...` view save

correct output
`2 1 2 1 1` view save

user output
`2 1 2 1 1` view save

Test 11

Group: 1, 3, 4, 5

Verdict: ACCEPTED

input
`3 2 5 C 1 C 2 O 3 O 1 ...` view save

correct output
`2 1 2 1 1` view save

user output
`2 1 2 1 1` view save

Test 12

Group: 1, 3, 4, 5

Verdict: ACCEPTED

input
`3 2 5 C 1 C 2 O 1 O 3 ...` view save

correct output
`IMPOSSIBLE` view save

user output
`IMPOSSIBLE` view save

Test 13

Group: 1, 3, 4, 5

Verdict: ACCEPTED

input
`3 2 4 C 1 O 2 C 1 O 3` view save

correct output
`1 1 1 1` view save

user output
`1 1 1 1` view save

Test 14

Group: 1, 3, 4, 5

Verdict: ACCEPTED

input
`3 2 4 C 1 O 2 C 2 O 1` view save

correct output
`1 1 1 1` view save

user output
`1 1 1 1` view save

Test 15

Group: 1, 3, 4, 5

Verdict: ACCEPTED

input
`3 2 3 C 1 C 2 C 3` view save

correct output
`1 1 1` view save

user output
`1 1 1` view save

Test 16

Group: 1, 3, 4, 5

Verdict: ACCEPTED

input
`3 2 3 O 1 C 2 C 3` view save

correct output
`IMPOSSIBLE` view save

user output
`IMPOSSIBLE` view save

Test 17

Group: 1, 2, 3, 4, 5

Verdict: ACCEPTED

input
`2 2 7 C 1 O 2 O 2 O 2 ...` view save

correct output
`IMPOSSIBLE` view save

user output
`IMPOSSIBLE` view save

Test 18

Group: 1, 3, 4, 5

Verdict: ACCEPTED

input
`4 2 5 C 2 O 3 C 1 O 4 ...` view save

correct output
`1 1 1 1 1` view save

user output
`1 1 1 1 1` view save

Test 19

Group: 2, 5

Verdict: ACCEPTED

input
`100000 100000 100000 C 1 C 2 C 3 C 4 ...` view save

correct output
`50000 49999 49998 49997 49996 ...` view save

user output
`50000 49999 49998 49997 49996 ...` Truncated

Test 20

Group: 2, 5

Verdict: ACCEPTED

input
`100000 100000 100000 C 1 C 2 C 3 C 4 ...` view save

correct output
`1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

user output
`1 1 1 1 1 ...` Truncated

Test 21

Group: 2, 5

Verdict: ACCEPTED

input
`100000 100000 100000 C 1 C 2 C 3 C 4 ...` view save

correct output
`20000 20000 20000 20000 20000 ...` view save

user output
`20000 20000 20000 20000 20000 ...` Truncated

Test 22

Group: 5

Verdict: ACCEPTED

input
`100000 100 100000 C 1 C 2 C 3 C 4 ...` view save

correct output
`1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

user output
`100 100 100 100 100 ...` Truncated

Test 23

Group: 5

Verdict: ACCEPTED

input
`100000 99 100000 C 1 C 2 C 3 C 4 ...` view save

correct output
`IMPOSSIBLE` view save

user output
`IMPOSSIBLE` view save

Test 24

Group: 3, 4, 5

Verdict: ACCEPTED

input
`500 2 500 C 384 O 62 C 387 O 473 ...` view save

correct output
`1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

user output
`1 1 1 1 1 ...` Truncated

Test 25

Group: 3, 4, 5

Verdict: ACCEPTED

input
`500 2 500 C 384 O 62 C 387 O 473 ...` view save

correct output
`1 1 1 1 1 1 1 1 1 1 1 1 1 2 2 ...` view save

user output
`1 1 1 1 1 ...` Truncated

Test 26

Group: 3, 4, 5

Verdict: ACCEPTED

input
`500 2 500 C 384 O 62 C 387 O 473 ...` view save

correct output
`1 1 1 1 1 1 1 1 1 1 1 1 2 1 2 ...` view save

user output
`1 1 1 1 1 ...` Truncated

Test 27

Group: 3, 4, 5

Verdict: ACCEPTED

input
`500 2 500 C 384 O 62 C 387 C 473 ...` view save

correct output
`1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

user output
`1 1 1 1 1 ...` Truncated

Test 28

Group: 4, 5

Verdict: ACCEPTED

input
`500 250 500 C 384 O 62 C 387 O 473 ...` view save

correct output
`1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

user output
`1 1 1 1 1 ...` Truncated

Test 29

Group: 4, 5

Verdict: ACCEPTED

input
`500 250 500 C 384 O 62 C 387 O 473 ...` view save

correct output
`1 1 1 1 1 1 1 1 1 1 1 1 2 1 3 ...` view save

user output
`1 1 1 1 1 ...` Truncated

Test 30

Group: 4, 5

Verdict: ACCEPTED

input
`500 250 500 C 384 O 62 C 387 O 473 ...` view save

correct output
`1 1 1 1 1 3 2 3 3 2 2 2 5 4 2 ...` view save

user output
`1 1 1 1 3 ...` Truncated

Test 31

Group: 4, 5

Verdict: ACCEPTED

input
`500 250 500 C 384 O 62 C 387 C 473 ...` view save

correct output
`1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

user output
`1 1 1 1 1 ...` Truncated

Test 32

Group: 2, 4, 5

Verdict: ACCEPTED

input
`500 500 500 C 384 O 62 C 387 O 473 ...` view save

correct output
`1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

user output
`1 1 1 1 1 ...` Truncated

Test 33

Group: 2, 4, 5

Verdict: ACCEPTED

input
`500 500 500 C 384 O 62 C 387 O 473 ...` view save

correct output
`1 1 1 1 1 1 1 1 1 1 1 1 2 1 3 ...` view save

user output
`1 1 1 1 1 ...` Truncated

Test 34

Group: 2, 4, 5

Verdict: ACCEPTED

input
`500 500 500 C 384 O 62 C 387 O 473 ...` view save

correct output
`1 1 1 1 2 1 3 3 3 2 2 2 2 4 5 ...` view save

user output
`1 1 1 1 3 ...` Truncated

Test 35

Group: 2, 4, 5

Verdict: ACCEPTED

input
`500 500 500 C 384 O 62 C 387 C 473 ...` view save

correct output
`1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

user output
`1 1 1 1 1 ...` Truncated

Test 36

Group: 3, 5

Verdict: ACCEPTED

input
`100000 2 100000 C 89384 O 54062 C 85387 O 53318 ...` view save

correct output
`1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

user output
`1 1 1 1 1 ...` Truncated

Test 37

Group: 3, 5

Verdict: ACCEPTED

input
`100000 2 100000 C 89384 O 54062 C 85387 O 53318 ...` view save

correct output
`1 1 1 1 1 1 1 1 1 1 1 1 2 2 1 ...` view save

user output
`1 1 1 1 1 ...` Truncated

Test 38

Group: 3, 5

Verdict: ACCEPTED

input
`100000 2 100000 C 89384 O 54062 C 85387 O 53318 ...` view save

correct output
`1 1 1 1 1 1 1 1 1 1 1 1 1 2 2 ...` view save

user output
`1 1 1 1 1 ...` Truncated

Test 39

Group: 3, 5

Verdict: ACCEPTED

input
`100000 2 100000 C 89384 O 54062 C 85387 C 53318 ...` view save

correct output
`1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

user output
`1 1 1 1 1 ...` Truncated

Test 40

Group: 5

Verdict: ACCEPTED

input
`100000 50000 100000 C 89384 O 54062 C 85387 O 53318 ...` view save

correct output
`1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

user output
`1 1 1 1 1 ...` Truncated

Test 41

Group: 5

Verdict: ACCEPTED

input
`100000 50000 100000 C 89384 O 54062 C 85387 O 53318 ...` view save

correct output
`1 1 1 1 1 1 1 1 1 1 1 1 3 2 1 ...` view save

user output
`1 1 1 1 1 ...` Truncated

Test 42

Group: 5

Verdict: ACCEPTED

input
`100000 50000 100000 C 89384 O 54062 C 85387 O 53318 ...` view save

correct output
`1 1 1 1 1 3 2 3 3 3 3 3 3 4 5 ...` view save

user output
`1 1 1 1 3 ...` Truncated

Test 43

Group: 5

Verdict: ACCEPTED

input
`100000 50000 100000 C 89384 O 54062 C 85387 C 53318 ...` view save

correct output
`1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

user output
`1 1 1 1 1 ...` Truncated

Test 44

Group: 2, 5

Verdict: ACCEPTED

input
`100000 100000 100000 C 89384 O 54062 C 85387 O 53318 ...` view save

correct output
`1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

user output
`1 1 1 1 1 ...` Truncated

Test 45

Group: 2, 5

Verdict: ACCEPTED

input
`100000 100000 100000 C 89384 O 54062 C 85387 O 53318 ...` view save

correct output
`1 1 1 1 1 1 1 1 1 1 1 1 3 2 1 ...` view save

user output
`1 1 1 1 1 ...` Truncated

Test 46

Group: 2, 5

Verdict: ACCEPTED

input
`100000 100000 100000 C 89384 O 54062 C 85387 O 53318 ...` view save

correct output
`1 1 1 1 2 1 3 3 3 3 3 3 4 5 3 ...` view save

user output
`1 1 1 1 3 ...` Truncated

Test 47

Group: 2, 5

Verdict: ACCEPTED

input
`100000 100000 100000 C 89384 O 54062 C 85387 C 53318 ...` view save

correct output
`1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

user output
`1 1 1 1 1 ...` Truncated

NOI 2019 Open

Thieves and Prisons

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

Test 21

Test 22

Test 23

Test 24

Test 25

Test 26

Test 27

Test 28

Test 29

Test 30

Test 31

Test 32

Test 33

Test 34

Test 35

Test 36

Test 37

Test 38

Test 39

Test 40

Test 41

Test 42

Test 43

Test 44

Test 45

Test 46

Test 47

Tasks

Submissions (egor.lifar)