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
| #include <cstdio>
#include <cstdlib>
#include <iostream>
#define N 2000
int n, q, p[N], BIT[4*N];
bool AB[N][N];
int buildtree(int l, int r, int id)
{
if(l == r) {
BIT[id] = l-1;
return l-1;
}
int t1, t2;
t1 = buildtree(l, (l+r)/2, id*2);
t2 = buildtree((l+r)/2+1, r, id*2+1);
BIT[id] = (p[t1] >= p[t2])? t1 : t2;
return BIT[id];
}
void update(int a, int l, int r, int id)
{
if(l == r) return;
if(p[BIT[id]] < p[a]){
BIT[id] = a;
}
if(a <= (l+r)/2)update(a, l, (l+r)/2, id*2);
else update(a, (l+r)/2+1, r, id*2+1);
return;
}
int main(int argc, char *argv[])
{
scanf("%d", &n);
int a, b;
for(int i = 0; i < n*(n-1)/2; i++){
scanf("%d %d", &a, &b);
AB[a][b] = true;
p[a] ++;
}
buildtree(1, n, 1);
scanf("%d", &q);
char c;
for(int i = 0; i < q; ){
c = getchar();
if(c == 'A'){printf("%d\n", BIT[1]);i++;}
else if(c == 'C'){
scanf("%d %d", &a, &b);
i++;
if(AB[a][b]){
AB[a][b] = false;
AB[b][a] = true;
p[a] --;
p[b] ++;
update(a, 1, n, 1);
update(b, 1, n, 1);
}else{
AB[b][a] = false;
AB[a][b] = true;
p[b] --;
p[a] ++;
update(b, 1, n, 1);
update(a, 1, n, 1);
}
}
}
return 0;
}
|
