python 1到10000的累加和_Python在大于等于10000的数字上进行列表比较的效率

我一直在试图完成一个问题，从最近的ACM编程挑战后的竞争，并一直遇到了一个障碍。问题是这样的Your team has been retained by the director of a competition who supervises a panel of judges. The competition asks the judges to assign integer scores to competitors – the higher the score, the better. Although the event has standards for what score values mean, each judge is likely to interpret those standards differently. A score of 100, say, may mean different things to different judges.

The director's main objective is to determine which competitors should receive prizes for the top positions. Although absolute scores may differ from judge to judge, the director realizes that relative rankings provide the needed information – if two judges rank the same competitors first, second, third, ... then they agree on who should receive the prizes.

Your team is to write a program to assist the director by comparing the scores of pairs of judges. The program is to read two lists of integer scores in competitor order and determine the highest ranking place (first place being highest) at which the judges disagree.

Input to your program will be a series of score list pairs. Each pair begins with a single integer giving the number of competitors N, 1 < N < 1,000,000. The next N integers are the scores from the first judge in competitor order. These are followed by the second judge's scores – N more integers, also in competitor order. Scores are in the range 0 to 100,000,000 inclusive. Judges are not allowed to give ties, so each judge’s scores will be unique. Values are separated from each other by one or more spaces and/or newlines. The last score list pair is followed by the end-of-file indicator.

有一些示例测试用例覆盖N=4和N=84

3 8 6 2

15 37 17 3

8

80 60 40 20 10 30 50 70

160 100 120 80 20 60 90 135

以及预期产量：

对于每个分数对，打印一行整数，表示评委不同意的最高排名。如果评委们对每一个地方都达成一致意见，请打印一行只包含“同意”一词的行。使用下面的格式：“Case”，一个空格，一个案例编号，一个冒号和一个空格，并且这个案例的答案没有尾随空格。在Case 1: agree

Case 2: 3

我的代码如下：import sys

def calculate(competitors, scores1, scores2):

scores1sort = sorted(scores1, reverse = True)

scores2sort = sorted(scores2, reverse = True)

for x in range(len(scores1)) :

indexed1 = scores1.index(scores1sort[x])

#print ('place: ', x+1, 'Position: ',indexed1+1)

#iterating over the entire length of the sorted lists multiple times takes too long

indexed2 = scores2.index(scores2sort[x])

#print ('place: ', x+1, 'Position: ',indexed2+1)

if indexed2 != indexed1 :

print ( "Case", str(case) + ":", x+1)

return

#run both fors at the same time, compare indexed of scores1 to index of scores2

#if the position(indexed + 1) doesnt match between the two, print the place(x+1) of the disparity

#if match:

#print ("Case " + case +": " + "agree"

#else: print (Case " + case + ": " + index of disagreement

print ("Case", str(case) + ":" , "agree")

scores1 = [];

scores2 = [];

case = 1;

state = 0;

# 0 indicates number of competitors

# 1 indicates judge 1

# 2 indicates judge 2

#for line in sys.stdin:

for line in test.split("\n"):

line = line.strip().split()

if not line:

continue

if state == 0:

#if empty line, error

competitors = int(line[0])

state = 1;

else:

for y in line:

if state == 1:

scores1.append(int(y))

if len(scores1) >= competitors:

state = 2;

elif state == 2:

scores2.append(int(y))

if len(scores2) >= competitors:

state = 0;

#print (competitors, score1, scores2)

calculate(competitors, scores1, scores2);

case += 1;

我的代码目前是使用一个文本文件运行的，该文件包含了留给我们的编程竞赛的测试输入，其中包括一些小的测试值，但也包括一组有10000名竞争对手的值。在

我毫不怀疑，如果给足够的时间，代码是可以完成的，但是编程挑战指南规定代码必须在比当前运行时更短的时间窗口内运行。在

因此，我想征求任何人对如何优化我的代码以加快执行速度的建议。在