| ||||||||||
| Online Judge | Problem Set | Authors | Online Contests | User | ||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest | |||||||||
很不明白pku上面AC了而九度过不了~~~〒_〒话说也测了大神们的数据可以通过~代码如下
#include<stdio.h>
void main()
{
int n,lines,i,j,num,pos,count,temp;
int flag[1001] = {0};
int left[500];
int right[500];
int less[1000] = {0};
int more[1000] = {0};
char ch;
int inequal = 0;
scanf("%d %d",&n,&lines);
for(i = 0;i < lines*2;i = i+2)
{
scanf("%d",&num);
for(j = 0;j < num;j++)
scanf("%d",&left[j]);
for(j = 0;j < num;j++)
scanf("%d",&right[j]);
getchar();
ch = getchar();
if(ch == '=')
{
for(j = 0;j < num;j++)
flag[left[j]] = 1;
for(j = 0;j < num;j++)
flag[right[j]] = 1;
}
else
{
inequal++;
if(ch == '>')
{
for(j = 0;j<num;j++)
{
temp = left[j];
left[j] = right[j];
right[j] = temp;
}
}
for(j = 0;j < num;j++)
less[left[j]]++;;
for(j = 0;j < num;j++)
more[right[j]]++;
}
}
for(i = 1;i <= n;i++)
{
if(((less[i] + more[i] < inequal) && (less[i] != 0 ||more[i] != 0)) ||(less[i] != 0 && more[i] != 0))
{
flag[i] = 1;
}
}
pos = 0;
count = 0;
for(i = 1;i <= n;i++)
{
if(flag[i] == 0)
{
pos = i;
count++;
}
}
if(count > 1)
printf("0\n");
else
printf("%d\n",pos);
}
Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator