1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
#include <bits/stdc++.h>

#define MAXN 31000
#define st first
#define nd second

using namespace std;

typedef pair<char, pair<int,int>> pcii;

unordered_set<int> g1[MAXN], g2[MAXN];
bool visited[MAXN];
vector<pcii> ans, ansrev;

void DFS1(int v)
{
    if(v!=1&&g1[v].find(1)==g1[v].end())
        ans.push_back({'+', {1, v}});
    visited[v] = 1;
    for(int i:g1[v])
    {
        if(visited[i])
            continue;
        DFS1(i);
    }
}

void DFS2(int v)
{
    if(v!=1&&g2[v].find(1)==g2[v].end())
        ansrev.push_back({'-', {1, v}});
    visited[v] = 1;
    for(int i:g2[v])
    {
        if(visited[i])
            continue;
        DFS2(i);
    }
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int n, m1, m2;
    cin>>n;
    cin>>m1;
    for(int i=0; i<m1; i++)
    {
        int a,b;
        cin>>a>>b;
        g1[a].insert(b);
        g1[b].insert(a);
    }
    cin>>m2;
    for(int i=0; i<m2; i++)
    {
        int a,b;
        cin>>a>>b;
        g2[a].insert(b);
        g2[b].insert(a);
    }
    DFS1(1);
    for(int i=0; i<=n; i++)
        visited[i]=0;
    for(int i=2; i<=n; i++)
    {
        for(int k:g2[i])
        {
            if(k!=1 && g1[i].find(k) == g1[i].end())
            {
                g1[i].insert(k);
                g1[k].insert(i);
                ans.push_back({'+',{i,k}});
            }
        }
    }
    DFS2(1);

    for(int i=2; i<=n; i++)
    {
        for(int k:g1[i])
        {
            if(k!=1 && g2[i].find(k) == g2[i].end())
            {
                g2[i].insert(k);
                g2[k].insert(i);
                ansrev.push_back({'-',{i,k}});
            }
        }
    }

    cout<<ans.size()+ansrev.size()<<"\n";
    for(pcii p:ans)
        cout<<p.st<<" "<<p.nd.st<<" "<<p.nd.nd<<"\n";

    for(vector<pcii>::reverse_iterator it = ansrev.rbegin(); it!=ansrev.rend(); it++)
        cout<<it->st<<" "<<it->nd.st<<" "<<it->nd.nd<<"\n";
}