CSES - NOI 2019

Submission details
Task:	Thieves and Prisons
Sender:	Henrik Aalto
Submission time:	2019-03-06 15:05:45 +0200
Language:	C++
Status:	READY
Result:	0

Feedback
group	verdict	score
#1	WRONG ANSWER	0
#2	RUNTIME ERROR	0
#3	WRONG ANSWER	0
#4	RUNTIME ERROR	0
#5	RUNTIME ERROR	0

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

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:25:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
       if(v[i].size() < s) {
                      ^
input/code.cpp:73:5: warning: label 'fail' defined but not used [-Wunused-label]
     fail:;
     ^~~~

Code

#include<bits/stdc++.h>
using namespace std;
const int N = 101010;
vector<int> v[N];
int p[N];
int t[N];
int n,m;
vector<int> paths[N];
void d(int x);
int bfs_with_path(int a,int b);
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> m;
  for(int i=1;i<=m;i++) {
    int a,b; cin >> a >> b;
    v[a].push_back(b);
    v[b].push_back(a);
  }
#define f first
#define s second
  if(n == m+1) {
    int s=1e9,b=-1;
    for(int i=1;i<=n;i++) {
      if(v[i].size() < s) {
        s = v[i].size();
        b = i;
      }
    }
    queue<pair<int,int>> q;
    vector<int> ans;
    int l = 0;
    q.push({b,++l});
    while(!q.empty()) {
      auto a=q.front(); q.pop();
      if(p[a.f]) continue;
      ans.push_back(a.f);
      l = max(l,a.s);
      p[a.f] = 1;
      for(auto u:v[a.f]) {
        if(!p[u]){
          q.push({u,a.s+1});
        }
      }
    }
    if(l == n) {
      for(auto u:ans)
        cout << u << " ";
      cout << "\n";
    }
    else cout << "IMPOSSIBLE\n";
  }
  else {
    // if not tree
    // brute the more trivial test cases
    for(int i=1;i<=n;i++) {
      d(i);  
    }
    vector<pair<int,int>> tests;
    for(int i=1;i<=n;i++) {
      if(paths[paths[i].back()].back() == i) {
        tests.push_back({i,paths[i].back()});
      }
    }
    for(auto u:tests) {
      if(bfs_with_path(u.f,u.s)) {
        for(auto u:paths[u.f])
          cout << u << " ";
        cout << "\n";
        return 0;
      }
    }
    fail:;
    cout << "IMPOSSIBLE\n";
  }
}
int bfs_with_path(int a,int b) {
  for(int i=1;i<=n;i++) p[i] = 0;
  vector<int> pos(n+1);
  for(int i=0;i<n;i++) {
    pos[paths[a][i]] = i+1;
  }
  queue<pair<int,int>> q;
  q.push({a,0});
  while(!q.empty()) {
    auto a=q.front(); q.pop();
    if(p[a.f]) continue;
    p[a.f] = 1;
    for(auto u:v[a.f]) {
      if(!p[u]){
        if( pos[u] < pos[a.f]) {
//          cout << pos[u] << " "<< pos[a.f] << " = " << u << " -> " << a.f << "\n";
          return 0;
        }
        q.push({u,a.f});
      }
    }
  }
  for(int i=1;i<=n;i++) p[i] = 0;
  q.push({b,0});
  while(!q.empty()) {
    auto a=q.front(); q.pop();
    if(p[a.f]) continue;
    p[a.f] = 1;
    for(auto u:v[a.f]) {
      if(!p[u]){
        if( pos[u] > pos[a.f]) {
          return 0;
        }
        q.push({u,a.f});
      }
    }
  }
  return 1;
}
void d(int x) {
  for(int i=1;i<=n;i++) p[i] = 0;
  queue<pair<int,int>> q;
  q.push({x,1});
  while(!q.empty()) {
    auto a=q.front(); q.pop();
    if(p[a.f]) continue;
    paths[x].push_back(a.f);
    p[a.f] = 1;
    for(auto u:v[a.f]) {
      if(!p[u]){
        q.push({u,a.s+1});
      }
    }
  }
}

Test details

Test 1

Group: 2, 4, 5

Verdict: RUNTIME ERROR

input
`1 1 1 C 1` view save

correct output
`1` view save

user output
(empty)

Test 2

Group: 2, 4, 5

Verdict: RUNTIME ERROR

input
`1 1 1 O 1` view save

correct output
`IMPOSSIBLE` view save

user output
(empty)

Test 3

Group: 2, 4, 5

Verdict: WRONG ANSWER

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

correct output
`IMPOSSIBLE` view save

user output
`1` view save

Test 4

Group: 2, 4, 5

Verdict: WRONG ANSWER

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

correct output
`IMPOSSIBLE` view save

user output
`1` view save

Test 5

Group: 2, 4, 5

Verdict: WRONG ANSWER

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

correct output
`IMPOSSIBLE` view save

user output
`1` view save

Test 6

Group: 4, 5

Verdict: WRONG ANSWER

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

correct output
`1 1` view save

user output
`IMPOSSIBLE` 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: WRONG ANSWER

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

correct output
`1 1` view save

user output
`IMPOSSIBLE` view save

Test 9

Group: 1, 3, 4, 5

Verdict: WRONG ANSWER

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

Test 10

Group: 1, 3, 4, 5

Verdict: WRONG ANSWER

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

Test 11

Group: 1, 3, 4, 5

Verdict: WRONG ANSWER

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
`IMPOSSIBLE` 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: WRONG ANSWER

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

correct output
`1 1 1 1` view save

user output
`IMPOSSIBLE` view save

Test 14

Group: 1, 3, 4, 5

Verdict: WRONG ANSWER

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

correct output
`1 1 1 1` view save

user output
`IMPOSSIBLE` view save

Test 15

Group: 1, 3, 4, 5

Verdict: WRONG ANSWER

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

correct output
`1 1 1` view save

user output
`IMPOSSIBLE` 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: WRONG ANSWER

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

correct output
`IMPOSSIBLE` view save

user output
`1` 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` view save

Test 19

Group: 2, 5

Verdict: TIME LIMIT EXCEEDED

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
(empty)

Test 20

Group: 2, 5

Verdict: TIME LIMIT EXCEEDED

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
(empty)

Test 21

Group: 2, 5

Verdict: TIME LIMIT EXCEEDED

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
(empty)

Test 22

Group: 5

Verdict: TIME LIMIT EXCEEDED

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
(empty)

Test 23

Group: 5

Verdict: TIME LIMIT EXCEEDED

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

correct output
`IMPOSSIBLE` view save

user output
(empty)

Test 24

Group: 3, 4, 5

Verdict: RUNTIME ERROR

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
(empty)

Test 25

Group: 3, 4, 5

Verdict: RUNTIME ERROR

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
(empty)

Test 26

Group: 3, 4, 5

Verdict: RUNTIME ERROR

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
(empty)

Test 27

Group: 3, 4, 5

Verdict: RUNTIME ERROR

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
(empty)

Test 28

Group: 4, 5

Verdict: RUNTIME ERROR

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
(empty)

Test 29

Group: 4, 5

Verdict: RUNTIME ERROR

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
(empty)

Test 30

Group: 4, 5

Verdict: RUNTIME ERROR

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
(empty)

Test 31

Group: 4, 5

Verdict: RUNTIME ERROR

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
(empty)

Test 32

Group: 2, 4, 5

Verdict: RUNTIME ERROR

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
(empty)

Test 33

Group: 2, 4, 5

Verdict: RUNTIME ERROR

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
(empty)

Test 34

Group: 2, 4, 5

Verdict: RUNTIME ERROR

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
(empty)

Test 35

Group: 2, 4, 5

Verdict: RUNTIME ERROR

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
(empty)

Test 36

Group: 3, 5

Verdict: TIME LIMIT EXCEEDED

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
(empty)

Test 37

Group: 3, 5

Verdict: TIME LIMIT EXCEEDED

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
(empty)

Test 38

Group: 3, 5

Verdict: TIME LIMIT EXCEEDED

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
(empty)

Test 39

Group: 3, 5

Verdict: TIME LIMIT EXCEEDED

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
(empty)

Test 40

Group: 5

Verdict: TIME LIMIT EXCEEDED

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
(empty)

Test 41

Group: 5

Verdict: TIME LIMIT EXCEEDED

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
(empty)

Test 42

Group: 5

Verdict: TIME LIMIT EXCEEDED

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
(empty)

Test 43

Group: 5

Verdict: TIME LIMIT EXCEEDED

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
(empty)

Test 44

Group: 2, 5

Verdict: TIME LIMIT EXCEEDED

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
(empty)

Test 45

Group: 2, 5

Verdict: TIME LIMIT EXCEEDED

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
(empty)

Test 46

Group: 2, 5

Verdict: TIME LIMIT EXCEEDED

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
(empty)

Test 47

Group: 2, 5

Verdict: TIME LIMIT EXCEEDED

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
(empty)

NOI 2019

Thieves and Prisons

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

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 (Henrik Aalto)