样例对了为什么还0分

#include <bits/stdc++.h>
#define re register
#define fi first
#define se second
#define mp make_pair
#define inf 0x3f3f3f3f
#define dbg(x) cout << #x << " = " << (x) << endl
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int uint;
using namespace std;
const int N = 100005, M = 1000005;
int n, a, b;
string s1, s2;
vector<int> v[N];
inline int read(){
	int f = 0, x = 0; char ch;
	do {ch = getchar(); f |= ch == '-';} while(!isdigit(ch));
	do {x = (x << 3) + (x << 1) + (ch ^ 48); ch = getchar();} while(isdigit(ch));
	return f ? -x : x;
}
inline pair<int, int> find1(){
	for (re int i = 0; i < n; ++i){
		for (re int j = 0; j < v[i].size(); ++j){
			if (v[i][j] == a){
				return mp(i, j);
			}
		}
	}
}
inline pair<int, int> find2(){
	for (re int i = 0; i < n; ++i){
		for (re int j = 0; j < v[i].size(); ++j){
			if (v[i][j] == b){
				return mp(i, j);
			}
		}
	}
}
int main(){
	//freopen("data.txt", "r", stdin);
	n = read();
	for (re int i = 0; i < n; ++i)v[i].push_back(i);
	while (cin >> s1){
		if (s1 == "quit")break;
		a = read();
		cin >> s2;
		b = read();
		int u1 = find1().fi, v1 = find1().se, u2 = find2().fi, v2 = find2().se;
		if (u1 == u2)continue;
		if (s1 == "move"){
			if (s2 == "onto"){
				for (re int i = v[u1].size() - 1; i > v1; --i){
					v[v[u1].back()].push_back(v[u1].back());
					v[u1].pop_back();
				}
				for (re int i = v[u2].size() - 1; i > v2; --i){
					v[v[u2].back()].push_back(v[u2].back());
					v[u2].pop_back();
				}
				v[u2].push_back(a);
				v[u1].pop_back();
			}
			else{
				for (re int i = v[u1].size() - 1; i > v1; --i){
					v[v[u1].back()].push_back(v[u1].back());
					v[u1].pop_back();
				}
				v[u2].push_back(a);
				v[u1].pop_back();	
			}
		}
		else{
			if (s2 == "onto"){
				int Size = v[u1].size();
				for (re int i = v[u2].size() - 1; i > v2; --i){
					v[v[u2].back()].push_back(v[u2].back());
					v[u2].pop_back();
				}
				for (re int i = v1; i < v[u1].size(); ++i)v[u2].push_back(v[u1][i]);
				for (re int i = v[u1].size() - 1; i >= v1; --i)v[u1].pop_back();
			}
			else{
				int Size = v[u1].size(); 
				vector<int> nw;
				for (re int i = v1; i < v[u1].size(); ++i)nw.push_back(v[u1][i]);
				for (re int i = v1; i < Size; ++i)v[u1].pop_back();
				for (re int i = 0; i < nw.size(); ++i)v[u2].push_back(nw[i]);
			}
		}
	}
	for (re int i = 0; i < n; ++i){
		printf("%d:", i);
		if (!v[i].empty()){
			putchar(' ');
			for (re int j = 0; j < v[i].size(); ++j){
				printf("%d", v[i][j]);
				if (j != v[i].size() - 1)putchar(' ');
			}
		}
		if (i != n - 1)putchar('\n');
	}
	return 0;
}