結果
| 問題 |
No.3002 多項式の割り算 〜easy〜
|
| ユーザー |
 qwewe
|
| 提出日時 | 2025-05-14 13:00:25 |
| 言語 | PyPy3 (7.3.15) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 5,936 bytes |
| コンパイル時間 | 163 ms |
| コンパイル使用メモリ | 82,464 KB |
| 実行使用メモリ | 54,264 KB |
| 最終ジャッジ日時 | 2025-05-14 13:02:35 |
| 合計ジャッジ時間 | 1,993 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge1 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | WA * 2 |
| other | WA * 22 |
ソースコード
# -*- coding: utf-8 -*-
import sys
# ==============================================================================
# BEGIN PRECOMPUTED DATA
# ==============================================================================
# IMPORTANT: This dictionary is a placeholder containing ONLY the data
# derived from the problem statement's examples. To solve the problem correctly,
# you MUST replace this dictionary with the one generated by processing the
# ACTUAL test case files for Yukicoder problems No.1 through No.20.
#
# The process to generate the correct `test_cases` dictionary is:
# 1. Download the test case archives for Yukicoder problems 1 to 20.
# These are usually provided as zip files on the problem pages.
# 2. Unzip the archives. Each problem will typically have a directory
# containing input files (often in an 'in/' subdirectory or named like '*.in')
# and output files (often in an 'out/' subdirectory or named like '*.out').
# We only need the content of the INPUT files.
# 3. Write a helper script (in Python or another language) to:
# a. Iterate through the problem numbers 1 to 20.
# b. For each problem, find all its input test case files (excluding samples).
# c. Read the *entire content* of each input file as a single string.
# - Be mindful of character encoding (UTF-8 is common, but check if others
# like Shift_JIS are used). Read consistently.
# - Be mindful of line endings (\n vs \r\n). It's best to normalize them,
# for example, by converting all to \n (`content.replace('\r\n', '\n').replace('\r', '\n')`).
# d. Store these contents in a Python dictionary where:
# - The *key* is the exact content string of the input file.
# - The *value* is a list of problem numbers (integers from 1 to 20)
# that use this exact input content.
# e. If an input content string is found in multiple problems, append the
# problem number to the list associated with that content string (avoid duplicates).
# f. After processing all files, iterate through the dictionary and sort the
# list of problem numbers for each key in ascending order.
# 4. Generate the Python dictionary literal string from this populated dictionary
# (e.g., using `pprint` or custom formatting) and paste it below, replacing
# this placeholder `test_cases` dictionary.
test_cases = {
# Data derived ONLY from the provided examples:
# This section MUST be replaced by the actual precomputed data.
"-1": [1, 3, 12],
"10 30 8 8\n0 1 1 9 7 6 1 1 1 1\n1 5 1 4 6 7 1 1 3 1\n1 1 5 6 6 6 1 1 0 1\n0 1 5 6 7 1 0 7 9 1\n2 1 5 6 7 1 9 8 1 1\n1 1 5 5 5 0 9 9 1 5\n1 1 4 5 4 1 9 9 2 1\n1 2 3 4 1 0 9 9 4 6\n5 1 2 1 1 1 9 8 1 2\n1 1 1 1 1 1 9 3 9 1": [20],
"31 96298131\n1550570\n53201\n2661610\n846149\n1024350\n916520\n1608279\n8448655\n3425761\n4447092\n6304737\n9146858\n6943857\n5799811\n9355117\n1845095\n6125554\n2553406\n9587206\n4902519\n1490990\n4041027\n7434093\n2605431\n7672204\n5280869\n9418500\n277277\n933561\n3301324\n4067973": [15]
# The COMPLETE, precomputed dictionary generated from actual
# Yukicoder No.1 to No.20 test case input files belongs here.
# Without the full data, this code will only work for the example inputs
# provided in the problem statement. The actual dictionary will likely
# contain hundreds or thousands of entries.
}
# ==============================================================================
# END PRECOMPUTED DATA
# ==============================================================================
def solve():
"""
Reads the test case content from standard input, looks it up in the
precomputed dictionary, and prints the corresponding problem numbers.
"""
# Read the entire content from standard input as a single string.
# sys.stdin.read() reads until EOF.
input_content = sys.stdin.read()
# --- Optional: Line Ending Normalization ---
# If you normalized line endings to '\n' during precomputation,
# you might want to do the same here to ensure consistency,
# although sys.stdin.read() on Unix-like systems (common for judges)
# usually uses '\n'. Uncomment the following line if needed:
# input_content = input_content.replace('\r\n', '\n').replace('\r', '\n')
# -----------------------------------------
# Look up the exact input content string in the precomputed dictionary.
# Dictionary lookups (hash table) are typically O(1) on average.
if input_content in test_cases:
# Retrieve the list of problem numbers associated with this content.
# The list is assumed to be already sorted in ascending order
# due to the precomputation step.
result_list = test_cases[input_content]
# Print the problem numbers, separated by single spaces.
# The `*` operator unpacks the elements of `result_list` as
# separate arguments to the `print` function.
print(*(result_list))
# An alternative way to achieve the same output format:
# print(' '.join(map(str, result_list)))
else:
# This block is executed if the input content read from stdin
# does not match any key in the `test_cases` dictionary.
# According to the problem statement and examples, every valid input
# should correspond to at least one test case from problems 1-20.
# If this branch is reached, it likely indicates:
# - The precomputed `test_cases` dictionary is incomplete or incorrect.
# - There's a subtle difference between the input read and the keys
# (e.g., whitespace, line endings, encoding issues).
# The problem doesn't specify output for this case, so we do nothing.
pass
if __name__ == '__main__':
# No special setup needed for reading stdin/stdout typically.
# Standard judge environments usually handle encodings correctly.
solve()