CSES - NOI 2019

CSES - NOI 2019 - Results

Submission details
Task:	Distance Code
Sender:	Tuomas Katajisto
Submission time:	2019-03-06 15:50:07 +0200
Language:	C++
Status:	READY
Result:	0

Feedback
group	verdict	score
#1	TIME LIMIT EXCEEDED	0
#2	TIME LIMIT EXCEEDED	0
#3	TIME LIMIT EXCEEDED	0

Test results
test	verdict	time	group
#1	ACCEPTED	0.01 s	1, 2, 3	details
#2	ACCEPTED	0.02 s	1, 2, 3	details
#3	ACCEPTED	0.01 s	1, 2, 3	details
#4	ACCEPTED	0.01 s	1, 2, 3	details
#5	ACCEPTED	0.02 s	1, 2, 3	details
#6	ACCEPTED	0.02 s	1, 2, 3	details
#7	ACCEPTED	0.01 s	1, 2, 3	details
#8	ACCEPTED	0.02 s	1, 2, 3	details
#9	TIME LIMIT EXCEEDED	--	1, 2, 3	details
#10	TIME LIMIT EXCEEDED	--	1, 2, 3	details
#11	TIME LIMIT EXCEEDED	--	1, 2, 3	details
#12	RUNTIME ERROR	0.02 s	2, 3	details
#13	RUNTIME ERROR	0.01 s	2, 3	details
#14	RUNTIME ERROR	0.03 s	2, 3	details
#15	RUNTIME ERROR	0.01 s	2, 3	details
#16	RUNTIME ERROR	0.02 s	3	details
#17	RUNTIME ERROR	0.02 s	3	details
#18	RUNTIME ERROR	0.03 s	3	details
#19	RUNTIME ERROR	0.02 s	3	details
#20	ACCEPTED	0.01 s	1, 2, 3	details

Compiler report

input/code.cpp: In function 'std::vector<int> dc1(int, std::set<int>*)':
input/code.cpp:24:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(rm.size() != n) {
      ~~~~~~~~~~^~~~
input/code.cpp: In function 'std::vector<int> dc2(int, std::set<int>*)':
input/code.cpp:85:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(rm.size() != n) {
      ~~~~~~~~~~^~~~
input/code.cpp:103:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i = 1; i < rm.size(); i++) {
                  ~~^~~~~~~~~~~
input/code.cpp: In function 'void puugen(int)':
input/code.cpp:140:8: warning: statement has no effect [-Wunused-value]
       1+1;
       ~^~

Code

#include<bits/stdc++.h>
using namespace std;
 
vector<int> dc1(int n, set<int> t[11]) {
  vector<int> rm;
  bool dq = false;
  while(!dq) {
    dq = true;
    vector<pair<int,int>> tr;
    for(int i = 1; i <= n; i++) {
      if(t[i].size() != 0) dq = false;
      if(t[i].size() == 1) {
	rm.push_back(i);
	for(auto u : t[i]) {
	  tr.push_back({u,i});
	}
      }
    }
    for(auto u : tr) {
      t[u.first].erase(u.second);
      t[u.second].erase(u.first);
    }
  }
  if(rm.size() != n) {
    set<int> jj;
    for(int i = 1; i <= n; i++) {
      jj.insert(i);
    }
    for(auto u : rm) jj.erase(u);
    if(jj.size() != 0) {
      for(auto u : jj) {
	rm.push_back(u);
      }
    }
  }
  return rm;
}
 
 
int dist(set<int> t[11], int s, set<int> bt, int q) {
  //cout << "DIST FROM " << s << " TO " << q << "\n";
  if(bt.count(s)) { /*cout << "RTAV\n"*/; return 0; }
  bt.insert(s);
  if(s == q) {
    //cout << "AT Q" << "\n";
    return 1;
  }
  int ret = 0;
  //cout << "SETSIZE " << t[s].size() << endl;
  for(auto u : t[s]) {
    //cout << "NEXT" << "\n";
    ret += dist(t,u,bt,q);
  }
  if(ret > 0) ret++;
  return ret;
}
 
int dd(set<int> t[11], int s, int q) {
  set<int> bt;
  return dist(t,s,bt,q)-1;
}
 
vector<int> dc2(int n, set<int> t[11]) {
  vector<int> rm;
  set<int> tc[11];
  for(int i = 0; i < 11; i++) tc[i] = t[i];
  bool dq = false;
  while(!dq) {
    dq = true;
    vector<pair<int,int>> tr;
    for(int i = 1; i <= n; i++) {
      if(t[i].size() != 0) dq = false;
      if(t[i].size() == 1) {
	rm.push_back(i);
	for(auto u : t[i]) {
	  tr.push_back({u,i});
	}
      }
    }
    for(auto u : tr) {
      t[u.first].erase(u.second);
      t[u.second].erase(u.first);
    }
  }
  if(rm.size() != n) {
    set<int> jj;
    for(int i = 1; i <= n; i++) {
      jj.insert(i);
    }
    for(auto u : rm) jj.erase(u);
    if(jj.size() != 0) {
      for(auto u : jj) {
	rm.push_back(u);
      }
    }
  }
  //cout << "ERORDER" << "\n";
  //for(auto u : rm) {
  //  cout << u << " ";
  //}
  //cout << endl;
  vector<int> rv;
  for(int i = 1; i < rm.size(); i++) {
    //cout << "DIST BETWEEN " << rm[i-1] << " " << rm[i] << ": " << dd(tc,rm[i-1],rm[i]) << "\n";
    rv.push_back(dd(tc,rm[i-1],rm[i]));
  }
  return rv;
}
int n;
 
vector<int> ok;
 
int tc = 1;
 
vector<pair<int,int>> vp;
 
void puugen(int j) {
  if(j == n+1) {
    set<int> t[11];
    //cout << " ----- TREE " << tc << " -----\n";
    /*for(auto u : vp) {
      cout << u.first << " " << u.second << "\n";
      }*/
    //tc++;
    //cout << " ------ END ---- \n";
    for(auto u : vp) {
      t[u.first].insert(u.second);
      t[u.second].insert(u.first);
    }
    if(dc2(n,t) == ok) {
      for(auto u : vp) {
	cout << u.first << " " << u.second << "\n";
      }
      exit(0);
    }
    return;
  }
  if(1){
    if(j == 1) {
      1+1;
      puugen(j+1);
    }
    else {
      for(int i = 1; i < j; i++) {
	vp.push_back({i,j});
	puugen(j+1);
	vp.pop_back();
      }
    }
  }
}
 
int main() {
  int t; cin>>t;
  if(t == 1) {
    cin >> n;
    set<int> t[11];
    for(int i = 0; i < n-1; i++) {
      int a,b; cin >> a >> b;
      t[a].insert(b);
      t[b].insert(a);
    }
    vector<int> vs = dc1(n,t);
    for(auto u : vs) {
      cout << u << " ";
    }
  }
  else {
    cin >> n;
    for(int i = 0; i < n-1; i++) {
      int je; cin >> je;
      ok.push_back(je);
    }
    puugen(1);
  }
}

Test details

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

input
`1 2 2 1` view save

correct output
(empty)

user output
`1 2` view save

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

input
`1 3 3 1 2 1` view save

correct output
(empty)

user output
`1 2 1 3` view save

Test 3

Group: 1, 2, 3

Verdict: ACCEPTED

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

correct output
(empty)

user output
`1 2 2 3 1 4` view save

Test 4

Group: 1, 2, 3

Verdict: ACCEPTED

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

correct output
(empty)

user output
`1 2 1 3 1 4` view save

Test 5

Group: 1, 2, 3

Verdict: ACCEPTED

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

correct output
(empty)

user output
`1 2 1 3 3 4 2 5` view save

Test 6

Group: 1, 2, 3

Verdict: ACCEPTED

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

correct output
(empty)

user output
`1 2 2 3 2 4 1 5` view save

Test 7

Group: 1, 2, 3

Verdict: ACCEPTED

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

correct output
(empty)

user output
`1 2 1 3 1 4 1 5` view save

Test 8

Group: 1, 2, 3

Verdict: ACCEPTED

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

correct output
(empty)

user output
`1 2 1 3 1 4 1 5 1 6 ...` view save

Test 9

Group: 1, 2, 3

Verdict: TIME LIMIT EXCEEDED

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

correct output
(empty)

user output
(empty)

Test 10

Group: 1, 2, 3

Verdict: TIME LIMIT EXCEEDED

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

correct output
(empty)

user output
(empty)

Test 11

Group: 1, 2, 3

Verdict: TIME LIMIT EXCEEDED

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

correct output
(empty)

user output
(empty)

Test 12

Group: 2, 3

Verdict: RUNTIME ERROR

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

correct output
(empty)

user output
(empty)

Test 13

Group: 2, 3

Verdict: RUNTIME ERROR

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

correct output
(empty)

user output
(empty)

Test 14

Group: 2, 3

Verdict: RUNTIME ERROR

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

correct output
(empty)

user output
(empty)

Test 15

Group: 2, 3

Verdict: RUNTIME ERROR

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

correct output
(empty)

user output
(empty)

Test 16

Group: 3

Verdict: RUNTIME ERROR

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

correct output
(empty)

user output
(empty)

Test 17

Group: 3

Verdict: RUNTIME ERROR

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

correct output
(empty)

user output
(empty)

Test 18

Group: 3

Verdict: RUNTIME ERROR

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

correct output
(empty)

user output
(empty)

Test 19

Group: 3

Verdict: RUNTIME ERROR

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

correct output
(empty)

user output
(empty)

Test 20

Group: 1, 2, 3

Verdict: ACCEPTED

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

correct output
(empty)

user output
`1 2 1 3 1 4 2 5 2 6` view save

NOI 2019

Distance Code

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

Tasks

Submissions (Tuomas Katajisto)