• save_code


    #!/usr/bin/python3
    import sys,os,random
    os.system("mkdir alldata")
    A=[]
    for root,dirs,file in os.walk("."):
    	if root[2:9]=="alldata" or root==".":continue
    	for i in file:
    		if i[-4:]==".ans" or i[-3:]==".in" or  i[-4:]==".out":
    			A.append([root,i])
    			print(i)
    A.sort()
    n_subtasks=1
    for i in range(1,len(A)):
    	if A[i][0]!=A[i-1][0]:n_subtasks+=1
    ID=0
    SID=0
    conf=open("alldata/problem.conf","w")
    print("n_tests %d
    "%(len(A)//2),
    "n_ex_tests 0
    "
    "n_sample_tests 0
    "
    "input_pre data
    "
    "input_suf in
    "
    "output_pre data
    "
    "output_suf out
    "
    "time_limit 1?
    "
    "memory_limit 512?
    "
    "output_limit 64
    "
    "use_builtin_judger on
    "
    "use_builtin_checker wcmp?
    "
    "n_subtasks %d"%n_subtasks,
    file=conf,sep='')
    for i in range(0,len(A),2):
    	ID+=1
    	root=A[i][0]
    	filein=A[i][1]
    	fileout=A[i+1][1]
    	if A[i][1][-4:]==".ans":filein,fileout=fileout,filein
    	os.system("cp %s/%s alldata/data%s"%(root,filein,str(ID)+".in"))
    	os.system("cp %s/%s alldata/data%s"%(root,fileout,str(ID)+".out"))
    	if i==len(A)-2 or A[i+2][0]!=A[i][0]:
    		SID+=1
    		print("subtask_end_%d"%SID,ID,file=conf)
    		print("subtask_score_%d "%SID,file=conf)
    os.system("gedit alldata/problem.conf&")
    
  • 相关阅读:
    HDU 1495 广度优先搜索
    oj 1792:迷宫 广搜和深搜
    oj 1756:八皇后 搜索
    OJ1700 八皇后问题 基本搜索算法
    PAT A1020
    PAT A1103
    PAT A1046 Shortest Distance
    PAT A1059
    PAT B1013
    二分查找
  • 原文地址:https://www.cnblogs.com/xzz_233/p/14072815.html
Copyright © 2020-2023  润新知