結果
問題 | No.2198 Concon Substrings (COuNt-CONstruct Version) |
ユーザー | Navier_Boltzmann |
提出日時 | 2023-01-27 23:17:38 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 871 bytes |
コンパイル時間 | 179 ms |
コンパイル使用メモリ | 82,040 KB |
実行使用メモリ | 71,672 KB |
最終ジャッジ日時 | 2024-06-28 08:08:33 |
合計ジャッジ時間 | 16,654 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 50 ms
61,720 KB |
testcase_01 | AC | 51 ms
62,112 KB |
testcase_02 | WA | - |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | AC | 47 ms
55,688 KB |
testcase_07 | AC | 48 ms
57,376 KB |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | AC | 61 ms
64,748 KB |
testcase_13 | AC | 65 ms
69,176 KB |
testcase_14 | AC | 64 ms
66,744 KB |
testcase_15 | AC | 59 ms
65,456 KB |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | AC | 47 ms
56,984 KB |
testcase_19 | AC | 47 ms
56,860 KB |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | AC | 63 ms
64,676 KB |
testcase_25 | AC | 66 ms
68,000 KB |
testcase_26 | AC | 67 ms
66,272 KB |
testcase_27 | AC | 74 ms
68,748 KB |
testcase_28 | AC | 52 ms
61,724 KB |
testcase_29 | AC | 50 ms
62,228 KB |
testcase_30 | WA | - |
testcase_31 | WA | - |
testcase_32 | WA | - |
testcase_33 | WA | - |
testcase_34 | WA | - |
testcase_35 | WA | - |
testcase_36 | AC | 48 ms
57,336 KB |
testcase_37 | AC | 47 ms
57,996 KB |
testcase_38 | AC | 47 ms
57,004 KB |
testcase_39 | AC | 48 ms
57,180 KB |
testcase_40 | AC | 48 ms
57,588 KB |
testcase_41 | WA | - |
testcase_42 | WA | - |
testcase_43 | WA | - |
testcase_44 | WA | - |
testcase_45 | WA | - |
testcase_46 | WA | - |
testcase_47 | WA | - |
testcase_48 | WA | - |
testcase_49 | WA | - |
testcase_50 | WA | - |
testcase_51 | WA | - |
testcase_52 | WA | - |
testcase_53 | AC | 66 ms
65,908 KB |
testcase_54 | AC | 62 ms
65,000 KB |
testcase_55 | AC | 65 ms
68,056 KB |
testcase_56 | AC | 61 ms
65,496 KB |
testcase_57 | AC | 62 ms
66,832 KB |
testcase_58 | AC | 65 ms
67,708 KB |
testcase_59 | AC | 60 ms
65,120 KB |
testcase_60 | AC | 64 ms
66,692 KB |
testcase_61 | AC | 65 ms
67,796 KB |
testcase_62 | AC | 58 ms
65,480 KB |
testcase_63 | AC | 63 ms
68,236 KB |
testcase_64 | AC | 65 ms
68,748 KB |
testcase_65 | AC | 66 ms
67,408 KB |
testcase_66 | AC | 64 ms
68,356 KB |
testcase_67 | AC | 69 ms
68,444 KB |
testcase_68 | AC | 62 ms
67,728 KB |
testcase_69 | AC | 67 ms
66,264 KB |
testcase_70 | AC | 95 ms
69,688 KB |
testcase_71 | WA | - |
testcase_72 | AC | 66 ms
68,016 KB |
testcase_73 | AC | 61 ms
65,476 KB |
testcase_74 | AC | 65 ms
67,808 KB |
testcase_75 | AC | 100 ms
70,944 KB |
testcase_76 | AC | 69 ms
67,984 KB |
testcase_77 | AC | 66 ms
67,996 KB |
testcase_78 | AC | 130 ms
70,232 KB |
testcase_79 | AC | 69 ms
65,888 KB |
testcase_80 | AC | 65 ms
69,356 KB |
testcase_81 | AC | 99 ms
70,068 KB |
testcase_82 | AC | 61 ms
67,668 KB |
testcase_83 | AC | 69 ms
67,676 KB |
testcase_84 | AC | 63 ms
67,324 KB |
testcase_85 | AC | 65 ms
68,612 KB |
testcase_86 | AC | 64 ms
67,280 KB |
testcase_87 | AC | 133 ms
71,252 KB |
testcase_88 | AC | 63 ms
66,444 KB |
testcase_89 | AC | 67 ms
66,356 KB |
testcase_90 | AC | 103 ms
70,556 KB |
testcase_91 | WA | - |
testcase_92 | AC | 105 ms
68,812 KB |
testcase_93 | AC | 62 ms
67,796 KB |
testcase_94 | AC | 96 ms
70,432 KB |
testcase_95 | AC | 96 ms
69,544 KB |
testcase_96 | AC | 106 ms
70,360 KB |
testcase_97 | WA | - |
testcase_98 | WA | - |
testcase_99 | AC | 66 ms
66,056 KB |
testcase_100 | AC | 138 ms
71,672 KB |
testcase_101 | AC | 99 ms
70,624 KB |
testcase_102 | AC | 65 ms
67,032 KB |
testcase_103 | AC | 65 ms
67,552 KB |
testcase_104 | AC | 142 ms
71,316 KB |
testcase_105 | AC | 105 ms
71,324 KB |
testcase_106 | WA | - |
testcase_107 | AC | 66 ms
67,508 KB |
ソースコード
from collections import * from itertools import * from functools import * from heapq import * import sys,math input = sys.stdin.readline M = int(input()) def fcr(n): ng = math.ceil(n**(1/3)) + 100 ok = math.ceil(n**(1/3)) - 100 while ng-ok>1: mid = (ng+ok)//2 if mid**3<=n: ok = mid else: ng = mid return ok N = fcr(M) for k in range(-1,2): W = N + k flg = False for i in range(-1000,1000): Z = N+i for j in range(-1000,1000): Y = N+j if (1< M - W*((Y+1)*Z+1) + W + Y + Z<=59998)&(M >= W*((Y+1)*Z+1)): flg = True break if flg: break if flg: break X = M - W*(Z*(Y+1)+1) ans = ['c','o'] + ['n']*X + ['c']*Y + ['o']*Z + ['n']*W print(''.join(ans))