Lang:G++
Edit12345678910111213141516171819202122232425262728293031#include <cstdio>#include <cstring>#include <iostream>#include <algorithm>#include <vector>#include <string>#include <queue>using namespace std;const int N = 2000000;char node[N + 1];int counts[N + 1];int nextNode[N + 1];int to[N];int e = 0;queue<int> q;int main(){//freopen("input.txt", "r", stdin);memset(node, 0, sizeof node);memset(counts, 0, sizeof counts);memset(nextNode, 0, sizeof nextNode);memset(to, 0, sizeof to);int n;scanf("%d", &n);getchar();//string s;while (n--){char c;int b = 0;