— 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:Ægir Örn Kristjánsson
Submission time:2019-03-06 16:03:32 +0200
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#10.03 s1, 2, 3details
#20.02 s1, 2, 3details
#30.01 s1, 2, 3details
#40.01 s1, 2, 3details
#50.02 s1, 2, 3details
#60.01 s1, 2, 3details
#70.02 s1, 2, 3details
#80.02 s1, 2, 3details
#90.03 s1, 2, 3details
#100.02 s1, 2, 3details
#110.02 s1, 2, 3details
#120.03 s2, 3details
#130.01 s2, 3details
#140.02 s2, 3details
#150.02 s2, 3details
#160.06 s3details
#170.09 s3details
#180.06 s3details
#190.06 s3details
#200.03 s1, 2, 3details

Code

#include <bits/stdc++.h>
using namespace std;

int main() {
  int n,k,m; cin>>n>>k>>m;

  bool prison[k];
  for (int i=0; i<k; i++) {
    prison[i]=false;
  }
  //0 ekki í fangelsi. Annað en 0 er númer hvaða fangelsi hann er í
  int thief[n];
  for (int i=0; i<n; i++) {
    thief[i]=0;
  }
 
  int ccount=0;
  int cinarow=0;
  int ocount=0;
  string ocevent[m];
  int tevent[m];
  bool impossible=false;
  int answer[m];

  for (int i=0; i<m; i++) {
    string oc;
    int t;
    cin>>oc>>t;
    ocevent[i]=oc;//Geymir hvort O eða C er notað í umferð
    tevent[i]=t;//Geymir hvaða fangi er notaður í umferð
  }

  for (int i=0; i<m; i++) {
    if (cinarow==n||thief[tevent[i]-1]!=0) {
      impossible=true;
      break;
    }

    int u; //Geymir hvaða fangelsi er valið í umferðinni

    if (ocevent[i]=="C") {
      if (prison[0]==false&&prison[1]==false) {
        u=1;
      } else if (ocevent[i+1]=="O"&&ocevent[i+2]=="O") {
        u=2;
      } else if (ocevent[i+1]=="O"&&ocevent[i+2]=="O"&&ocevent[i+3]=="O") {
        impossible=true;
        break;
      } else {
        u=1;
      }
      answer[i]=u;
      prison[u-1]=true;
      thief[tevent[i]-1]=u;
      ccount++;
      cinarow++;
    } 
    
    else if (ocevent[i]=="O") {
      if (ocount==ccount) {
        impossible=true;
        break;
      } else if (prison[0]==false&&prison[1]==false) {
        impossible=true;
        break;
      } else if (prison[1]==true) {
        u=2;
      } else {
        u=1;
      }
      answer[i]=u;
      prison[u-1]=false;
      ocount++;
      cinarow=0;
      for (int i=0; i<k; i++) {
        if (thief[i]==u) {
          thief[i]=0;
        }
      }
    }
  }

  if (impossible) {
    cout<<"IMPOSSIBLE";
  } else {
    for (int i=0; i<m; i++) {
      cout<<answer[i]<<" ";
    }
  }
}

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
-833330528 5225 -836908931 
view save

Test 3

Group: 1, 2, 3

Verdict:

input
1
4
3 2
2 1
4 1
view save

correct output
(empty)

user output
-1884683616 5301 -1888262019 
view save

Test 4

Group: 1, 2, 3

Verdict:

input
1
4
2 3
3 4
1 3
view save

correct output
(empty)

user output
331556544 5381 
view save

Test 5

Group: 1, 2, 3

Verdict:

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

correct output
(empty)

user output
617149088 5428 613570685 
view save

Test 6

Group: 1, 2, 3

Verdict:

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

correct output
(empty)

user output
2049606304 5372 2046027901 
view save

Test 7

Group: 1, 2, 3

Verdict:

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

correct output
(empty)

user output
0 5265 -651907744 5265 
view save

Test 8

Group: 1, 2, 3

Verdict:

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

correct output
(empty)

user output
IMPOSSIBLE
view save

Test 9

Group: 1, 2, 3

Verdict:

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

correct output
(empty)

user output
IMPOSSIBLE
view save

Test 10

Group: 1, 2, 3

Verdict:

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

correct output
(empty)

user output
IMPOSSIBLE
view save

Test 11

Group: 1, 2, 3

Verdict:

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

correct output
(empty)

user output
1919080128 5410 
view save

Test 12

Group: 2, 3

Verdict:

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

correct output
(empty)

user output
IMPOSSIBLE
view save

Test 13

Group: 2, 3

Verdict:

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

correct output
(empty)

user output
IMPOSSIBLE
view save

Test 14

Group: 2, 3

Verdict:

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

correct output
(empty)

user output
IMPOSSIBLE
view save

Test 15

Group: 2, 3

Verdict:

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

correct output
(empty)

user output
IMPOSSIBLE
view save

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
IMPOSSIBLE
view save

Test 20

Group: 1, 2, 3

Verdict:

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

correct output
(empty)

user output
-661604672 5442 
view save

Tasks

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

Submissions (Ægir Örn Kristjánsson)

2019-03-06 16:03:32 02019-03-06 16:01:32 2019-03-06 14:31:58 0