CSES - NOI 2019 - Results
 Task: Distance Code Sender: Ingólfur Orri Submission time: 2019-03-06 15:57:29 +0200 Language: C++ Status: READY Result: 0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#10.02 s1, 2, 3details
#20.02 s1, 2, 3details
#30.01 s1, 2, 3details
#40.02 s1, 2, 3details
#50.02 s1, 2, 3details
#60.01 s1, 2, 3details
#70.01 s1, 2, 3details
#80.02 s1, 2, 3details
#90.02 s1, 2, 3details
#100.02 s1, 2, 3details
#110.02 s1, 2, 3details
#120.01 s2, 3details
#130.02 s2, 3details
#140.01 s2, 3details
#150.03 s2, 3details
#160.06 s3details
#170.08 s3details
#180.06 s3details
#190.06 s3details
#200.02 s1, 2, 3details

### Code

```#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main() {
int n, k, m;
cin >> n  >> k >> m;
vector<int> fang;
vector<int> cap;
int pri = 0;
bool top = false;

for(int i = 0; i < m; i++) {
string act;
int fangi;
cin >> act >> fangi;
if(act == "C") {

if(pri == n) top = true;

if(find(cap.begin(), cap.end(), fangi) != cap.end()) {
cout << "IMPOSSIBLE" << endl;
return 0;
}

else  cap.push_back(fangi);

if(top) pri--;
else pri++;

if(pri == 1) top = false;

fang.push_back(pri);

}
else if(act == "O") {

if(pri == 0) {
cout << "IMPOSSIBLE" << endl;
return 0;
}

for(unsigned int j = 0; j < cap.size(); j++) {
if(fangi == cap[j]) {
cout << "IMPOSSIBLE" << endl;
return 0;
}
}
cap.pop_back();
fang.push_back(pri);
pri--;
if(pri < 0) pri = 0;
}
}
for(unsigned int i = 0; i < fang.size(); i++) {
cout << fang[i] << " ";
}
cout << endl;
return 0;
}
```

Group: 1, 2, 3

Verdict:

input
1
2
2 1

correct output
(empty)

user output
(empty)

Group: 1, 2, 3

Verdict:

input
1
3
3 1
2 1

correct output
(empty)

user output
(empty)

Group: 1, 2, 3

Verdict:

input
1
4
3 2
2 1
4 1

correct output
(empty)

user output
(empty)

Group: 1, 2, 3

Verdict:

input
1
4
2 3
3 4
1 3

correct output
(empty)

user output
(empty)

Group: 1, 2, 3

Verdict:

input
1
5
3 5
4 1
1 3
...

correct output
(empty)

user output
(empty)

Group: 1, 2, 3

Verdict:

input
1
5
3 2
3 4
5 1
...

correct output
(empty)

user output
(empty)

Group: 1, 2, 3

Verdict:

input
1
5
4 3
1 4
4 2
...

correct output
(empty)

user output
(empty)

Group: 1, 2, 3

Verdict:

input
1
10
9 3
8 9
2 9
...

correct output
(empty)

user output
(empty)

Group: 1, 2, 3

Verdict:

input
1
10
9 2
5 8
7 1
...

correct output
(empty)

user output
(empty)

Group: 1, 2, 3

Verdict:

input
1
10
10 4
9 1
4 7
...

correct output
(empty)

user output
(empty)

Group: 1, 2, 3

Verdict:

input
1
10
2 6
4 3
3 5
...

correct output
(empty)

user output
(empty)

Group: 2, 3

Verdict:

input
1
500
10 6
6 255
6 428
...

correct output
(empty)

user output
(empty)

Group: 2, 3

Verdict:

input
1
500
152 466
451 313
158 479
...

correct output
(empty)

user output
(empty)

Group: 2, 3

Verdict:

input
1
500
109 440
330 190
443 161
...

correct output
(empty)

user output
(empty)

Group: 2, 3

Verdict:

input
1
500
144 373
257 233
341 318
...

correct output
(empty)

user output
(empty)

Group: 3

Verdict:

input
1
100000
54983 75172
93807 75172
44082 75172
...

correct output
(empty)

user output
(empty)

Group: 3

Verdict:

input
1
100000
88863 19059
86423 76688
98536 95984
...

correct output
(empty)

user output
(empty)

Group: 3

Verdict:

input
1
100000
59979 6389
19097 24999
27846 82330
...

correct output
(empty)

user output
(empty)

Group: 3

Verdict:

input
1
100000
58761 66001
25102 51081
98625 67861
...

correct output
(empty)

user output
(empty)

Group: 1, 2, 3

Verdict:

input
1
6
2 1
3 2
4 2
...

correct output
(empty)

user output
(empty)