zoj 3198 python代码超时，求指教。。

来源：互联网发布：一句可爱的话知乎编辑：程序博客网时间：2024/05/21 13:57

用python写了一个。。超时，，自己还写了个二分，，还是超时。。估计是输入太慢了还是怎么地？cin 600ms scanf 230ms

求指教。。

import sysdef readANum(): line = sys.stdin.readline() a = line.split() n = int(a[0]) return ndef BinarySearch(a,target): low = 0 high = len(a)-1 while(low<=high): mid = (low+high)/2 midVal = a[mid] if midVal < target: low = mid+1 elif midVal > target: high = mid -1 else: return mid return -1n=readANum()for tmp in range(n):k=readANum()L=[]LL=[]for i in range(k):tmp = readANum()L.append(tmp)k=readANum()for i in range(k):tmp = readANum()LL.append(tmp)count = 0for tmp in L:#if tmp in LL:if BinarySearch(LL,tmp) != -1:count+=1print count#print L#print LL

c++版的。。

#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>using namespace std;int t[100002];int main(void){int T,n,tmp,m;//scanf("%d",&T);cin>>T;while(T--){//scanf("%d",&n);cin>>n;for(int i=1;i<=n;i++)//scanf("%d",&t[i]);cin>>t[i];//scanf("%d",&m);cin>>m;int count1 = 0;for(int i=0;i<m;i++){//scanf("%d",&tmp);cin>>tmp;if (binary_search(t+1,t+n+1,tmp))count1++;}//printf("%d/n",count1);cout<<count1<<endl;}return 0;}