— Dark mode

NOI 2019

Distance Code

  • Start: 2019-03-06 11:00:00
  • End: 2019-03-06 16:00:00
CSES - NOI 2019 - Results
Submission details
Task:Distance Code
Sender:Ingólfur Orri
Submission time:2019-03-06 14:46:34 +0200
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#10.01 s1, 2, 3details
#20.03 s1, 2, 3details
#30.02 s1, 2, 3details
#40.02 s1, 2, 3details
#50.01 s1, 2, 3details
#60.02 s1, 2, 3details
#70.02 s1, 2, 3details
#80.03 s1, 2, 3details
#90.02 s1, 2, 3details
#100.01 s1, 2, 3details
#110.02 s1, 2, 3details
#120.02 s2, 3details
#130.03 s2, 3details
#140.02 s2, 3details
#150.02 s2, 3details
#160.06 s3details
#170.08 s3details
#180.07 s3details
#190.07 s3details
#200.01 s1, 2, 3details

Code

#include <iostream>
#include <vector>
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;
            
            cap.push_back(fangi);
            
            if(top) pri--;
            else pri++;
            
            if(pri == 0) top = false;

            fang.push_back(pri);
           
        }
        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;
}

Test details

Test 1

Group: 1, 2, 3

Verdict:

input
1
2
2 1
view save

correct output
(empty)

user output
(empty)

Test 2

Group: 1, 2, 3

Verdict:

input
1
3
3 1
2 1
view save

correct output
(empty)

user output
(empty)

Test 3

Group: 1, 2, 3

Verdict:

input
1
4
3 2
2 1
4 1
view save

correct output
(empty)

user output
(empty)

Test 4

Group: 1, 2, 3

Verdict:

input
1
4
2 3
3 4
1 3
view save

correct output
(empty)

user output
(empty)

Test 5

Group: 1, 2, 3

Verdict:

input
1
5
3 5
4 1
1 3
...
view save

correct output
(empty)

user output
(empty)

Test 6

Group: 1, 2, 3

Verdict:

input
1
5
3 2
3 4
5 1
...
view save

correct output
(empty)

user output
(empty)

Test 7

Group: 1, 2, 3

Verdict:

input
1
5
4 3
1 4
4 2
...
view save

correct output
(empty)

user output
(empty)

Test 8

Group: 1, 2, 3

Verdict:

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

correct output
(empty)

user output
(empty)

Test 9

Group: 1, 2, 3

Verdict:

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

correct output
(empty)

user output
(empty)

Test 10

Group: 1, 2, 3

Verdict:

input
1
10
10 4
9 1
4 7
...
view save

correct output
(empty)

user output
(empty)

Test 11

Group: 1, 2, 3

Verdict:

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

correct output
(empty)

user output
(empty)

Test 12

Group: 2, 3

Verdict:

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

correct output
(empty)

user output
(empty)

Test 13

Group: 2, 3

Verdict:

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

correct output
(empty)

user output
(empty)

Test 14

Group: 2, 3

Verdict:

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

correct output
(empty)

user output
(empty)

Test 15

Group: 2, 3

Verdict:

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

correct output
(empty)

user output
(empty)

Test 16

Group: 3

Verdict:

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

correct output
(empty)

user output
(empty)

Test 17

Group: 3

Verdict:

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

correct output
(empty)

user output
(empty)

Test 18

Group: 3

Verdict:

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

correct output
(empty)

user output
(empty)

Test 19

Group: 3

Verdict:

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

correct output
(empty)

user output
(empty)

Test 20

Group: 1, 2, 3

Verdict:

input
1
6
2 1
3 2
4 2
...
view save

correct output
(empty)

user output
(empty)

Tasks

A Distance Code-B Thieves and Prisons-C Graph Ordering-

Submissions (Ingólfur Orri)

2019-03-06 15:57:29 02019-03-06 14:46:34 0