generated from TNFSH-Programming-Contest/tps-starter
-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Merge branch 'main' of https://github.com/TNFSH-Programming-Contest/2…
- Loading branch information
Showing
8 changed files
with
111 additions
and
118 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,32 +1,40 @@ | ||
correct1.cpp | ||
solution compile[OK] | ||
0-01 sol[OK] 0.013 check[OK] 1 [Correct] | ||
1-01 sol[OK] 0.012 check[OK] 1 [Correct] | ||
1-02 sol[OK] 0.012 check[OK] 1 [Correct] | ||
2-01 sol[OK] 0.012 check[OK] 1 [Correct] | ||
2-02 sol[OK] 0.012 check[OK] 1 [Correct] | ||
samples [1/1 tests] [Correct] [0/0 pts] [match with expected] 0-01 | ||
simple [2/2 tests] [Correct] [20/20 pts] [match with expected] 1-01 | ||
hacked [2/2 tests] [Correct] [80/80 pts] [match with expected] 2-01 | ||
|
||
Subtask summary | ||
100/100 pts | ||
|
||
Finished. | ||
|
||
correct2.cpp | ||
correct.cpp | ||
solution compile[OK] | ||
0-01 sol[OK] 0.012 check[OK] 1 [Correct] | ||
small-01 sol[OK] 0.012 check[OK] 1 [Correct] | ||
small-02 sol[OK] 0.012 check[OK] 1 [Correct] | ||
1-01 sol[OK] 0.012 check[OK] 1 [Correct] | ||
1-02 sol[OK] 0.012 check[OK] 1 [Correct] | ||
2-01 sol[OK] 0.012 check[OK] 0 [Wrong Answer] | ||
2-02 sol[OK] 0.012 check[OK] 0 [Wrong Answer] | ||
1-03 sol[OK] 0.012 check[OK] 1 [Correct] | ||
1-04 sol[OK] 0.013 check[OK] 1 [Correct] | ||
1-05 sol[OK] 0.013 check[OK] 1 [Correct] | ||
1-06 sol[OK] 0.013 check[OK] 1 [Correct] | ||
1-07 sol[OK] 0.013 check[OK] 1 [Correct] | ||
1-08 sol[OK] 0.013 check[OK] 1 [Correct] | ||
1-09 sol[OK] 0.013 check[OK] 1 [Correct] | ||
1-10 sol[OK] 0.013 check[OK] 1 [Correct] | ||
1-11 sol[OK] 0.013 check[OK] 1 [Correct] | ||
2-01 sol[OK] 0.037 check[OK] 1 [Correct] | ||
2-02 sol[OK] 0.045 check[OK] 1 [Correct] | ||
2-03 sol[OK] 0.044 check[OK] 1 [Correct] | ||
2-04 sol[OK] 0.050 check[OK] 1 [Correct] | ||
2-05 sol[OK] 0.049 check[OK] 1 [Correct] | ||
2-06 sol[OK] 0.049 check[OK] 1 [Correct] | ||
2-07 sol[OK] 0.049 check[OK] 1 [Correct] | ||
3-01 sol[OK] 0.196 check[OK] 1 [Correct] | ||
3-02 sol[OK] 0.195 check[OK] 1 [Correct] | ||
3-03 sol[OK] 0.197 check[OK] 1 [Correct] | ||
3-04 sol[OK] 0.197 check[OK] 1 [Correct] | ||
3-05 sol[OK] 0.199 check[OK] 1 [Correct] | ||
3-06 sol[OK] 0.194 check[OK] 1 [Correct] | ||
3-07 sol[OK] 0.195 check[OK] 1 [Correct] | ||
samples [1/1 tests] [Correct] [0/0 pts] [match with expected] 0-01 | ||
simple [2/2 tests] [Correct] [20/20 pts] [match with expected] 1-01 | ||
hacked [2/2 tests] [Wrong Answer] [0/80 pts] [match with expected] 2-01 | ||
n2 [14/14 tests] [Correct] [25/25 pts] [match with expected] 0-01 | ||
nc [10/10 tests] [Correct] [36/36 pts] [match with expected] 0-01 | ||
full [28/28 tests] [Correct] [39/39 pts] [match with expected] 0-01 | ||
|
||
Subtask summary | ||
20/100 pts | ||
100/100 pts | ||
|
||
Finished. | ||
|
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,29 +1,29 @@ | ||
# test_name gen_line_number gen_line_content | ||
0-01 2 manual example.in | ||
small-01 5 gen 1 0 | ||
small-02 6 gen 1 1000000000 | ||
1-01 10 gen 100 100 a | ||
1-02 11 gen 100 1000000000 b | ||
1-03 12 gen 100 0 | ||
1-04 13 gen 2000 0 | ||
1-05 14 gen 2000 10000 | ||
1-06 15 gen 2000 10000 | ||
1-07 16 gen 2000 1000000000 a | ||
1-08 17 gen 2000 1000000000 b | ||
1-09 18 gen 2000 1000000000 c | ||
1-10 19 gen 2000 1000000000 d | ||
1-11 20 gen 2000 1000000000 e | ||
2-01 24 gen 300000 0 | ||
2-02 25 gen 300000 10 a | ||
2-03 26 gen 300000 10 b | ||
2-04 27 gen 300000 40 a | ||
2-05 28 gen 300000 40 b | ||
2-06 29 gen 300000 40 c | ||
2-07 30 gen 300000 40 d | ||
3-01 35 gen 300000 1000000000 a | ||
3-02 36 gen 300000 1000000000 b | ||
3-03 37 gen 300000 1000000000 c | ||
3-04 38 gen 300000 1000000000 d | ||
3-05 39 gen 300000 1000000000 e | ||
3-06 40 gen 300000 1000000000 f | ||
3-07 41 gen 300000 1000000000 g | ||
small-01 6 gen 1 0 | ||
small-02 7 gen 1 1000000000 | ||
1-01 11 gen 100 100 a | ||
1-02 12 gen 100 1000000000 b | ||
1-03 13 gen 100 0 | ||
1-04 14 gen 2000 0 | ||
1-05 15 gen 2000 10000 | ||
1-06 16 gen 2000 10000 | ||
1-07 17 gen 2000 1000000000 a | ||
1-08 18 gen 2000 1000000000 b | ||
1-09 19 gen 2000 1000000000 c | ||
1-10 20 gen 2000 1000000000 d | ||
1-11 21 gen 2000 1000000000 e | ||
2-01 25 gen 300000 0 | ||
2-02 26 gen 300000 10 a | ||
2-03 27 gen 300000 10 b | ||
2-04 28 gen 300000 40 a | ||
2-05 29 gen 300000 40 b | ||
2-06 30 gen 300000 40 c | ||
2-07 31 gen 300000 40 d | ||
3-01 36 gen 300000 1000000000 a | ||
3-02 37 gen 300000 1000000000 b | ||
3-03 38 gen 300000 1000000000 c | ||
3-04 39 gen 300000 1000000000 d | ||
3-05 40 gen 300000 1000000000 e | ||
3-06 41 gen 300000 1000000000 f | ||
3-07 42 gen 300000 1000000000 g |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,34 +1,24 @@ | ||
correct1.cpp | ||
binary_search.cpp | ||
solution compile[OK] | ||
checker compile[OK] | ||
0-01 sol[OK] 0.014 check[OK] 1 [Correct] | ||
1-01 sol[OK] 0.013 check[OK] 1 [Correct] | ||
1-02 sol[OK] 0.013 check[OK] 1 [Correct] | ||
2-01 sol[OK] 0.014 check[OK] 1 [Correct] | ||
2-02 sol[OK] 0.014 check[OK] 1 [Correct] | ||
samples [1/1 tests] [Correct] [0/0 pts] [match with expected] 0-01 | ||
simple [2/2 tests] [Correct] [20/20 pts] [match with expected] 1-01 | ||
hacked [2/2 tests] [Correct] [80/80 pts] [match with expected] 2-01 | ||
checker compile[FAIL] | ||
exit-code: 2 | ||
stdout: | ||
stderr: | ||
make: *** /home/runner/work/2023TNFSH-Preliminary/2023TNFSH-Preliminary/pC/checker: No such file or directory. Stop. | ||
|
||
Subtask summary | ||
100/100 pts | ||
|
||
Finished. | ||
|
||
correct2.cpp | ||
linear.cpp | ||
solution compile[OK] | ||
checker compile[OK] | ||
0-01 sol[OK] 0.013 check[OK] 1 [Correct] | ||
1-01 sol[OK] 0.013 check[OK] 1 [Correct] | ||
1-02 sol[OK] 0.014 check[OK] 1 [Correct] | ||
2-01 sol[OK] 0.013 check[OK] 1 [Correct] | ||
2-02 sol[OK] 0.013 check[OK] 1 [Correct] | ||
samples [1/1 tests] [Correct] [0/0 pts] [match with expected] 0-01 | ||
simple [2/2 tests] [Correct] [20/20 pts] [match with expected] 1-01 | ||
hacked [2/2 tests] [Correct] [80/80 pts] [match with expected] 2-01 | ||
checker compile[FAIL] | ||
exit-code: 2 | ||
stdout: | ||
stderr: | ||
make: *** /home/runner/work/2023TNFSH-Preliminary/2023TNFSH-Preliminary/pC/checker: No such file or directory. Stop. | ||
|
||
Subtask summary | ||
100/100 pts | ||
|
||
Finished. | ||
n3.cpp | ||
solution compile[OK] | ||
checker compile[FAIL] | ||
exit-code: 2 | ||
stdout: | ||
stderr: | ||
make: *** /home/runner/work/2023TNFSH-Preliminary/2023TNFSH-Preliminary/pC/checker: No such file or directory. Stop. | ||
|
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
Binary file not shown.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,57 +1,49 @@ | ||
|
||
## Progress | ||
<!-- progress start --> | ||
- cover.tex [:white_check_mark:](cover.tex) | ||
|
||
- cover.tex [:x:](cover.tex) | ||
- appendix.tex [:x:](appendix.tex) | ||
|
||
| | A | B | C | D | | ||
| --- | --- | --- | --- | --- | | ||
| contest_name | [:white_check_mark:](pA/problem.json) | [:white_check_mark:](pB/problem.json) | [:white_check_mark:](pC/problem.json) | [:white_check_mark:](pD/problem.json) | | ||
| problem_label | [:white_check_mark:](pA/problem.json) | [:white_check_mark:](pB/problem.json) | [:white_check_mark:](pC/problem.json) | [:white_check_mark:](pD/problem.json) | | ||
| name | [:white_check_mark:](pA/problem.json)<br>Arithmetic | [:white_check_mark:](pB/problem.json)<br>pB | [:white_check_mark:](pC/problem.json)<br>pC | [:white_check_mark:](pD/problem.json)<br>pD | | ||
| title | [:white_check_mark:](pA/problem.json)<br>四則運算 | [:white_check_mark:](pB/problem.json)<br>浮點誤差但不使用checker | [:white_check_mark:](pC/problem.json)<br>浮點誤差使用checker | [:white_check_mark:](pD/problem.json)<br>Checker範例 | | ||
| memory_limit | 512 | 512 | 512 | 512 | | ||
| time_limit | 1.0 | 1.0 | 1.0 | 1.0 | | ||
| has_checker | False | False | True | True | | ||
| gen | [:white_check_mark:](pA/gen) | [:white_check_mark:](pB/gen) | [:white_check_mark:](pC/gen) | [:white_check_mark:](pD/gen) | | ||
| solution | [:white_check_mark:](pA/solution) | [:white_check_mark:](pB/solution) | [:white_check_mark:](pC/solution) | [:white_check_mark:](pD/solution) | | ||
| validator | [:white_check_mark:](pA/validator) | [:white_check_mark:](pB/validator) | [:white_check_mark:](pC/validator) | [:x:](pD/validator)<br>[validator.cpp](pD/validator/validator.cpp) | | ||
| subtasks.json<br>global_validators | [:white_check_mark:](pA/subtasks.json) | [:white_check_mark:](pB/subtasks.json) | [:white_check_mark:](pC/subtasks.json) | [:white_check_mark:](pD/subtasks.json) | | ||
| tests | [:white_check_mark:](pA/tests) | [:white_check_mark:](pB/tests) | [:white_check_mark:](pC/tests) | [:white_check_mark:](pD/tests) | | ||
| statement/index.md | [:white_check_mark:](pA/statement/index.md) | [:x:](pB/statement/index.md) | [:x:](pC/statement/index.md) | [:x:](pD/statement/index.md) | | ||
| statement/index.pdf | [:white_check_mark:](pA/statement/index.pdf) | [:white_check_mark:](pB/statement/index.pdf) | [:white_check_mark:](pC/statement/index.pdf) | [:white_check_mark:](pD/statement/index.pdf) | | ||
| | B | C | | ||
| --- | --- | --- | | ||
| contest_name | [:white_check_mark:](pB/problem.json) | [:white_check_mark:](pC/problem.json) | | ||
| problem_label | [:white_check_mark:](pB/problem.json) | [:white_check_mark:](pC/problem.json) | | ||
| name | [:white_check_mark:](pB/problem.json)<br>cell | [:white_check_mark:](pC/problem.json)<br>SOS | | ||
| title | [:white_check_mark:](pB/problem.json)<br>細胞培養 | [:white_check_mark:](pC/problem.json)<br>求救訊號 | | ||
| memory_limit | 256 | 512 | | ||
| time_limit | 1.0 | 1.0 | | ||
| has_checker | False | True | | ||
| gen | [:white_check_mark:](pB/gen) | [:white_check_mark:](pC/gen) | | ||
| solution | [:white_check_mark:](pB/solution) | [:white_check_mark:](pC/solution) | | ||
| validator | [:white_check_mark:](pB/validator) | [:white_check_mark:](pC/validator) | | ||
| subtasks.json<br>global_validators | [:white_check_mark:](pB/subtasks.json) | [:white_check_mark:](pC/subtasks.json) | | ||
| tests | [:white_check_mark:](pB/tests) | [:white_check_mark:](pC/tests) | | ||
| statement/index.md | [:white_check_mark:](pB/statement/index.md) | [:white_check_mark:](pC/statement/index.md) | | ||
| statement/index.pdf | [:white_check_mark:](pB/statement/index.pdf) | [:white_check_mark:](pC/statement/index.pdf) | | ||
|
||
<!-- progress end --> | ||
|
||
## Subtasks | ||
<!-- subtasks start --> | ||
|
||
| | 1 | 2 | 3 | | ||
| --- | --- | --- | --- | | ||
| A | 20<br>$A = 0$、$1 \leq B \leq 10^{4}$ | 30<br>$0 \leq A, B \leq 10^{4}$ | 50<br>無額外限制 | | ||
| B | 20<br>Simple tests | 80<br>Hacked tests | | ||
| C | 20<br>Simple tests | 80<br>Hacked tests | | ||
| D | 20<br>$A, B \leq 10$ | 30<br>$A, B \leq 100$ | 50<br>無額外限制 | | ||
| B | 25<br>$N \leq 2000$ | 36<br>$c_i \leq 40$ | 39<br>無額外限制 | | ||
| C | 14<br>$N, M \leq 100$ | 46<br>$N, M \leq 500$ | 40<br>無額外限制 | | ||
|
||
<!-- subtasks end --> | ||
|
||
## Scores | ||
<!-- scores start --> | ||
|
||
| score | count | groups | | ||
| --- | --- | --- | | ||
| 20 | 4 | (A1) (B1) (C1) (D1) | | ||
| 30 | 2 | (A2) (D2) | | ||
| 40 | 6 | (A1, B1) (A1, C1) (B1, C1) (A1, D1) (B1, D1) (C1, D1) | | ||
| 50 | 10 | (A1, A2) (A2, B1) (A2, C1) (A2, D1) (A1, D2) (B1, D2) (C1, D2) (D1, D2) (A3) (D3) | | ||
| 60 | 5 | (A1, B1, C1) (A1, B1, D1) (A1, C1, D1) (B1, C1, D1) (A2, D2) | | ||
| 70 | 20 | (A1, A2, B1) (A1, A2, C1) (A2, B1, C1) (A1, A2, D1) (A2, B1, D1) (A2, C1, D1) (A1, B1, D2) (A1, C1, D2) (B1, C1, D2) (A1, D1, D2) (B1, D1, D2) (C1, D1, D2) (A1, A3) (A3, B1) (A3, C1) (A3, D1) (A1, D3) (B1, D3) (C1, D3) (D1, D3) | | ||
| 80 | 10 | (A1, A2, D2) (A2, B1, D2) (A2, C1, D2) (A2, D1, D2) (A2, A3) (A3, D2) (A2, D3) (D2, D3) (B2) (C2) | | ||
| 90 | 12 | (A1, A3, B1) (A1, A3, C1) (A3, B1, C1) (A1, A3, D1) (A3, B1, D1) (A3, C1, D1) (A1, B1, D3) (A1, C1, D3) (B1, C1, D3) (A1, D1, D3) (B1, D1, D3) (C1, D1, D3) | | ||
| 100 | 25 | (A1, A2, A3) (A2, A3, B1) (A2, A3, C1) (A2, A3, D1) (A1, A3, D2) (A3, B1, D2) (A3, C1, D2) (A3, D1, D2) (A1, A2, D3) (A2, B1, D3) (A2, C1, D3) (A2, D1, D3) (A1, D2, D3) (B1, D2, D3) (C1, D2, D3) (D1, D2, D3) (A3, D3) (A1, B2) (B1, B2) (B2, C1) (B2, D1) (A1, C2) (B1, C2) (C1, C2) (C2, D1) | | ||
| 110 | 6 | (A2, A3, D2) (A2, D2, D3) (A2, B2) (B2, D2) (A2, C2) (C2, D2) | | ||
| 120 | 16 | (A1, A3, D3) (A3, B1, D3) (A3, C1, D3) (A3, D1, D3) (A1, B1, B2) (A1, B2, C1) (B1, B2, C1) (A1, B2, D1) (B1, B2, D1) (B2, C1, D1) (A1, B1, C2) (A1, C1, C2) (B1, C1, C2) (A1, C2, D1) (B1, C2, D1) (C1, C2, D1) | | ||
| 130 | 22 | (A2, A3, D3) (A3, D2, D3) (A1, A2, B2) (A2, B1, B2) (A2, B2, C1) (A2, B2, D1) (A1, B2, D2) (B1, B2, D2) (B2, C1, D2) (B2, D1, D2) (A3, B2) (B2, D3) (A1, A2, C2) (A2, B1, C2) (A2, C1, C2) (A2, C2, D1) (A1, C2, D2) (B1, C2, D2) (C1, C2, D2) (C2, D1, D2) (A3, C2) (C2, D3) | | ||
| 140 | 2 | (A2, B2, D2) (A2, C2, D2) | | ||
| 150 | 16 | (A1, A3, B2) (A3, B1, B2) (A3, B2, C1) (A3, B2, D1) (A1, B2, D3) (B1, B2, D3) (B2, C1, D3) (B2, D1, D3) (A1, A3, C2) (A3, B1, C2) (A3, C1, C2) (A3, C2, D1) (A1, C2, D3) (B1, C2, D3) (C1, C2, D3) (C2, D1, D3) | | ||
| 160 | 9 | (A2, A3, B2) (A3, B2, D2) (A2, B2, D3) (B2, D2, D3) (A2, A3, C2) (A3, C2, D2) (A2, C2, D3) (C2, D2, D3) (B2, C2) | | ||
| 180 | 6 | (A3, B2, D3) (A3, C2, D3) (A1, B2, C2) (B1, B2, C2) (B2, C1, C2) (B2, C2, D1) | | ||
| 190 | 2 | (A2, B2, C2) (B2, C2, D2) | | ||
| 210 | 2 | (A3, B2, C2) (B2, C2, D3) | | ||
| 39 | 2 | (B1, C1) (B3) | | ||
| 75 | 2 | (B1, B2, C1) (B2, B3) | | ||
| 79 | 2 | (B1, C1, C2) (B3, C2) | | ||
| 85 | 2 | (B1, C1, C2) (B3, C2) | | ||
| 100 | 2 | (B1, B2, B3) (C1, C2) | | ||
| 125 | 2 | (B1, C1, C2) (B3, C2) | | ||
|
||
<!-- scores end --> |