#include <iostream>
#include <vector>
#include <unordered_set>
using namespace std;
int main() {
// your code goes here
int n = 5;
vector<pair<int, unordered_set<int>>> graph(n, make_pair(0, unordered_set<int>()));
graph[0].first = 1;
graph[1].second.insert(5);
graph[1].second.insert(6);
for (auto&& p : graph) {
std::cout << p.first << " " << p.second.size() << std::endl;
}
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8dmVjdG9yPgojaW5jbHVkZSA8dW5vcmRlcmVkX3NldD4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCmludCBtYWluKCkgewoJLy8geW91ciBjb2RlIGdvZXMgaGVyZQoJaW50IG4gPSA1OwoJdmVjdG9yPHBhaXI8aW50LCB1bm9yZGVyZWRfc2V0PGludD4+PiBncmFwaChuLCBtYWtlX3BhaXIoMCwgdW5vcmRlcmVkX3NldDxpbnQ+KCkpKTsKCWdyYXBoWzBdLmZpcnN0ID0gMTsKCWdyYXBoWzFdLnNlY29uZC5pbnNlcnQoNSk7CglncmFwaFsxXS5zZWNvbmQuaW5zZXJ0KDYpOwogICAgZm9yIChhdXRvJiYgcCA6IGdyYXBoKSB7CiAgICAJc3RkOjpjb3V0IDw8IHAuZmlyc3QgPDwgIiAiIDw8IHAuc2Vjb25kLnNpemUoKSA8PCBzdGQ6OmVuZGw7CiAgICB9CglyZXR1cm4gMDsKfQ==