部分点に対応

Author: tossy310

even2primes/java-tossy-tle/Even2PrimesNaive.java

@@ -5,7 +5,7 @@
 #cxx_solution(src='main.cc', flags=[]) # -std=c++11 -O2 as default
 #java_solution(src='Main.java', encoding='UTF-8', mainclass='Main')
 java_solution(src='Even2PrimesNaive.java', encoding='UTF-8', mainclass='Even2PrimesNaive',
-              challenge_cases=['large.in'])
+              challenge_cases=[])
 #java_solution(src='Main.java', encoding='UTF-8', mainclass='Main',
 #              challenge_cases=['10_corner*.in'])
 #script_solution(src='main.sh') # shebang line is required
@@ -17,4 +17,4 @@ java_solution(src='Even2PrimesNaive.java', encoding='UTF-8', mainclass='Even2Pri
 #cs_solution(src='main.cs') # C# (mono)
 
 ## Score
-#expected_score(100)
+expected_score(10)

even2primes/java-tossy-tle/SOLUTION

@@ -10,11 +10,11 @@
 #              challenge_cases=['10_corner*.in'])
 #script_solution(src='main.sh') # shebang line is required
 #script_solution(src='main.pl') # shebang line is required
-script_solution(src='main.py', challenge_cases=['large.in']) # shebang line is required
+script_solution(src='main.py', challenge_cases=[]) # shebang line is required
 #script_solution(src='main.rb') # shebang line is required
 #js_solution(src='main.js') # javascript (nodejs)
 #hs_solution(src='main.hs') # haskell (stack + ghc)
 #cs_solution(src='main.cs') # C# (mono)
 
 ## Score
-#expected_score(100)
+expected_score(10)

even2primes/python-tle/SOLUTION

@@ -9,7 +9,7 @@ def all_primes(start, end):
    return list(sorted(set(range(start, end + 1)).difference(set((p * f) for p in range(2, int(end ** 0.5) + 2) for f in range(2, (end // p) + 1)))))
 
 def primesfrom2to(n):
-   “”" Input n>=6, Returns a array of primes, 2 <= p < n “”"
+   """ Input n>=6, Returns a array of primes, 2 <= p < n """
    sieve = numpy.ones(n//3 + (n%6 == 2), dtype=numpy.bool)
    for i in range(1, int(n**0.5)//3+1):
        if sieve[i]:

even2primes/python-tle/main.py

@@ -17,3 +17,6 @@ cxx_validator(src='validator.cpp', dependency=['testlib.h'])
 #cxx_judge(src='judge.cc')
 #java_judge(src='Judge.java', encoding='UTF-8', mainclass='Judge')
 #script_judge(src='judge.py')
+
+subtask_testset(name='All', score=100, input_patterns=['*'])
+subtask_testset(name='Med', score=10, input_patterns=['sample.in', 'small.in', 'medium.in'])

even2primes/tests/TESTSET

@@ -2,7 +2,7 @@
 
 ## Solution
 #c_solution(src='main.c') # -lm -O2 as default
-cxx_solution(src='main.cpp', flags=[], challenge_cases=['large.in']) # -std=c++11 -O2 as default
+cxx_solution(src='main.cpp', flags=[], challenge_cases=[]) # -std=c++11 -O2 as default
 #java_solution(src='Main.java', encoding='UTF-8', mainclass='Main')
 #java_solution(src='Main.java', encoding='UTF-8', mainclass='Main',
 #              challenge_cases=[])
@@ -17,4 +17,4 @@ cxx_solution(src='main.cpp', flags=[], challenge_cases=['large.in']) # -std=c++1
 #cs_solution(src='main.cs') # C# (mono)
 
 ## Score
-#expected_score()
+expected_score(10)

two-squares/cpp-getty-med/SOLUTION

@@ -47,6 +47,7 @@ int main() {
       if(mp[4].fi == mp[5].fi && mp[4].se == mp[6].se && mp[5].se == mp[7].se && mp[6].fi == mp[7].fi){
         ll a = abs(mp[0].se - mp[1].se) * abs(mp[0].fi - mp[2].fi);
         ll b = abs(mp[4].se - mp[5].se) * abs(mp[4].fi - mp[6].fi);
+        if(a == 0 || b == 0) continue;
         ll t1 = mmin(a,b);
         ll t2 = mmax(a,b);
         cout << t1 << " " << t2 << endl;

two-squares/cpp-getty-med/main.cpp

@@ -2,7 +2,7 @@
 
 ## Solution
 #c_solution(src='main.c') # -lm -O2 as default
-cxx_solution(src='main.cpp', flags=[], challenge_cases=['medium.in', 'large.in']) # -std=c++11 -O2 as default
+cxx_solution(src='main.cpp', flags=[], challenge_cases=[]) # -std=c++11 -O2 as default
 #java_solution(src='Main.java', encoding='UTF-8', mainclass='Main')
 #java_solution(src='Main.java', encoding='UTF-8', mainclass='Main',
 #              challenge_cases=[])

two-squares/cpp-zura-wrong/SOLUTION

@@ -36,6 +36,7 @@ cxx_validator(src='validator.cpp', dependency=['testlib.h'])
 #gcj_merger(output_replace=casenum_replace('Case 1', 'Case {0}'))
 id='X'
 #merged_testset(name=id + '_Merged', input_pattern='*.in')
-#subtask_testset(name='All', score=100, input_patterns=['*'])
+subtask_testset(name='All', score=100, input_patterns=['*'])
+subtask_testset(name='Med', score=10, input_patterns=['small.in', 'medium.in'])
 # precisely scored by judge program like Jiyukenkyu (KUPC 2013)
 #scoring_judge()