CSES - NOI 2019

Submission details
Task:	Distance Code
Sender:	Loke Gustafsson
Submission time:	2019-03-07 00:57:22 +0200
Language:	C++
Status:	READY
Result:	100

Feedback
group	verdict	score
#1	ACCEPTED	21
#2	ACCEPTED	47
#3	ACCEPTED	32

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.02 s	1, 2, 3	details
#4	ACCEPTED	0.02 s	1, 2, 3	details
#5	ACCEPTED	0.02 s	1, 2, 3	details
#6	ACCEPTED	0.01 s	1, 2, 3	details
#7	ACCEPTED	0.02 s	1, 2, 3	details
#8	ACCEPTED	0.01 s	1, 2, 3	details
#9	ACCEPTED	0.01 s	1, 2, 3	details
#10	ACCEPTED	0.02 s	1, 2, 3	details
#11	ACCEPTED	0.02 s	1, 2, 3	details
#12	ACCEPTED	0.03 s	2, 3	details
#13	ACCEPTED	0.01 s	2, 3	details
#14	ACCEPTED	0.01 s	2, 3	details
#15	ACCEPTED	0.02 s	2, 3	details
#16	ACCEPTED	0.15 s	3	details
#17	ACCEPTED	0.16 s	3	details
#18	ACCEPTED	0.15 s	3	details
#19	ACCEPTED	0.16 s	3	details
#20	ACCEPTED	0.02 s	1, 2, 3	details

Compiler report

input/code.cpp: In member function 'bool Node::isLeaf()':
input/code.cpp:41:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   return (nextChild >= children.size() || children.size() == 0);
           ~~~~~~~~~~^~~~~~~~~~~~~~~~~~

Code

#include <iostream>
#include <vector>
#include <unordered_map>

#define ll long long
#define vi vector<ll>
#define adjList unordered_map<ll, vi>

using namespace std;

struct Node
{
	Node* parent;
	vector<Node*> children;
	ll id;
	ll nextChild;

	Node(ll i, Node* par)
	{
		this->id = i;
		this->parent = par;
		this->nextChild = 0;
	}

	static Node* makeNode(ll i, Node* par, adjList& graph) // creates rooted graph from adjList
	{
		Node* n = new Node(i, par);
		for (ll p : graph[i])
		{
			if (par != nullptr && p == par->id)
			{
				continue;
			}
			n->children.push_back(makeNode(p, n, graph));
		}
		return n;
	}

	bool isLeaf()
	{
		return (nextChild >= children.size() || children.size() == 0);
	}

	Node* next()
	{
		if ( isLeaf() )
		{
			return parent;
		}
		else
		{
			return children[nextChild++];
		}
	}
};

void printEdges(Node* active)
{
	for (Node* child : active->children)
	{
		cout << child->id << " " << active->id << endl;
		printEdges(child);
	}

}

int main()
{
	ll t;
	cin >> t;
	ll n;
	cin >> n;

	if (t == 1)
	{
		// encode
		adjList graph;
		for (int i = 0; i < n - 1; i++)
		{
			ll a, b;
			cin >> a >> b;
			graph[a].push_back(b);
			graph[b].push_back(a);
		}

		Node* active = Node::makeNode(1, nullptr, graph);

		while ( !( active->isLeaf() ) ) 
		{
			active = active->next();
		}
		// traverse tree and destroy nodes
		for (int i = 0; i < n; i++)
		{
			cout << active->id << " ";

			active = active->next();
			if (active == nullptr)
			{
				break;
			}
			
			while (!(active->isLeaf()))
			{
				active = active->next();
			}
		}
		cout << endl;
	}
	else
	{
		// decode
		ll idn = 0;
		Node* active = new Node(++idn, nullptr);

		for (int i = 0; i < n - 1; i++)
		{
			ll j;
			cin >> j;
			
			if (active->parent == nullptr)
			{
				active->parent = new Node(++idn, nullptr);
				active->parent->children.push_back(active);
			}
			active = active->parent;
			
			while (j > 1)
			{
				Node* child = new Node(++idn, active);
				active->children.push_back(child);
				active = child;
				--j;
			}
		}

		printEdges(active);
	}

    return 0;
}

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 3 2` 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
`2 3 1 2 4 3` 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
`2 4 1 2 3 2` 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
`2 3 1 2 4 3 5 4` 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 3 2 4 3 5 3` 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
`2 5 1 2 3 2 4 2` 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
`2 10 1 2 3 2 4 2 5 2 ...` view save

Test 9

Group: 1, 2, 3

Verdict: ACCEPTED

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

correct output
(empty)

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

Test 10

Group: 1, 2, 3

Verdict: ACCEPTED

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

correct output
(empty)

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

Test 11

Group: 1, 2, 3

Verdict: ACCEPTED

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

correct output
(empty)

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

Test 12

Group: 2, 3

Verdict: ACCEPTED

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

correct output
(empty)

user output
`2 500 1 2 3 2 4 2 5 2 ...` Truncated

Test 13

Group: 2, 3

Verdict: ACCEPTED

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

correct output
(empty)

user output
`350 351 349 350 348 349 347 348 346 347 ...` Truncated

Test 14

Group: 2, 3

Verdict: ACCEPTED

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

correct output
(empty)

user output
`1 2 3 2 4 3 5 4 6 4 ...` Truncated

Test 15

Group: 2, 3

Verdict: ACCEPTED

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

correct output
(empty)

user output
`6 7 5 6 4 5 3 4 2 3 ...` Truncated

Test 16

Group: 3

Verdict: ACCEPTED

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

correct output
(empty)

user output
`2 100000 1 2 3 2 4 2 5 2 ...` Truncated

Test 17

Group: 3

Verdict: ACCEPTED

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

correct output
(empty)

user output
`34232 34233 34231 34232 34230 34231 34229 34230 34228 34229 ...` Truncated

Test 18

Group: 3

Verdict: ACCEPTED

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

correct output
(empty)

user output
`1 2 3 2 4 3 5 4 6 4 ...` Truncated

Test 19

Group: 3

Verdict: ACCEPTED

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

correct output
(empty)

user output
`99999 100000 99998 99999 99997 99998 99983 99997 99982 99983 ...` Truncated

Test 20

Group: 1, 2, 3

Verdict: ACCEPTED

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

correct output
(empty)

user output
`4 6 2 4 1 2 3 2 5 4` 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 (Loke Gustafsson)