simmucheng

#include<cstdio>
#include<iostream>
using namespace std;
struct node
{
    int x;
    int y;
}s[120];
struct node1
{

simmucheng

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<fstream>
using namespace std;

//ofstream oo("1.txt");
const int MAXN=1e8;
int ss[1100];

simmucheng

#include<iostream>
#include<cstdio>
#include<cstring>
#define N 100000
using namespace std;
int tree[N*4],cnt,num,pre[N+5],add[N*4];
struct edge
{
    int u,v,next;
}e[N+5];

simmucheng

#include<cstdio>
#include<algorithm>
#include<iostream>
#include<cmath>
using namespace std;
int main()
{
    int n;
    scanf("%d",&n);
    while(n--)

simmucheng

#include<cstdio>
#include<algorithm>
#include<vector>
#include<iostream>
#include<cstring>
using namespace std;
vector<int>q;
int s[202000];
const int MAXN=1e8;
const int MINN=-1;

simmucheng

#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
int main()
{
    int i,j,m,n;
    while(scanf("%d",&n)!=EOF)
    {
        int ee=0;

simmucheng

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int main()
{
    int i,j,m,n;
    scanf("%d",&n);
    while(n--)
    {

simmucheng

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<vector>
#include<functional>
#include<queue>
#define N 10000
using namespace std;
struct node
{

simmucheng

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define MAX(a,b) (a)>(b)?(a):(b)
#define MIN(a,b) (a)<(b)?(a):(b)
#define N 999999
using namespace std;
int s[12000];
int mark[12000];