标签:
Time Limit: 1000MS | Memory Limit: 30000K | |
Total Submissions: 6455 | Accepted: 2463 |
Description
Input
Output
Sample Input
2 3 0 0 0 1 1 1 1 2 1 3 2 1 2 3 3 1 3 2 0 0 3 0 0 0 1 0 1 1 2 2 1 0 0
Sample Output
4 Oh,it‘s impossible~!!
Hint
Source
Memory: 148 KB | Time: 0 MS | |
Language: C++ | Result: Accepted | |
Public: |
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
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<algorithm>
#include<vector>
#include<map>
#include<iostream>
using namespace std;
const int maxn=60;
int a[maxn][maxn];
int x[maxn];
int free_x[maxn];
int gauss(int equ,int var)
{
int i,j,k,max_r,col;
for(int i=0;i<=var;i++)
{
x[i]=0;
free_x[i]=1;
}
col=0;
for(k=0;k<equ&&col<var;k++,col++)
{
max_r=k;
for(i=k+1;i<equ;i++)
{
if(abs(a[i][col])>abs(a[max_r][col]))
max_r=i;
}
if(max_r!=k)
{
for(j=k;j<var+1;j++)
swap(a[k][j],a[max_r][j]);
}
if(a[k][col]==0)
{
k--;
continue;
}
for(i=k+1;i<equ;i++)
{
if(a[i][col]!=0)
{
for(j=col;j<var+1;j++)
a[i][j]^=a[k][j];
}
}
}
for(i=k;i<equ;i++)
{
if(a[i][col]!=0)
return -1;
}
return var-k;
}
int start[maxn];
int end[maxn];
int main()
{
int n;
int s,e;
int T;
scanf("%d",&T);
while(T--)
{
scanf("%d",&n);
for(int i=0;i<n;i++)
{
scanf("%d",&start[i