| Показать все ветки Спрятать все ветки Показать все сообщения Спрятать все сообщения |
| what mean "lexicographically first compatible pair" ? | bor2com (SSU) | 1530. Ones and Zeroes | 12 июл 2026 04:21 | 4 |
I try to output zeros in this case, but seems like I'm wrong please show me some example for example for this case 2 11 11 Edited by author 11.12.2007 21:50 This test is correct, and the answer should be 00 00 The test is correct, original sequences do not need to be compatible |
| A hint ? | Yosif Yosifov | 1530. Ones and Zeroes | 12 июл 2026 04:19 | 10 |
A hint ? Yosif Yosifov 20 фев 2007 01:33 Can someone give me a little hint, please ? Re: A hint ? KirillB(Arkhangelsk - PomorSU) 20 фев 2007 01:44 make 2 sequences (s1 and s2) such that s1[i]+s2[i]<>2 My solution is based on a greedy approach. I think that an algorithm has many special cases. Main rool:to correct firstly s2[i] from 1 to 0 in pair s1[i]=1 and s2[i]=1 diminishing B but have pair 0, 0 in older position correcting it to 0, 1 for final increasing lexiographicly of B Who can find all cases he solve the problem After getting AC i have counted 6 cases next tests correspong each of cases 4 1011 0011 1011 0100 4 1010 0111 1011 0000 4 1011 0110 1100 0000 4 1111 0101 0000 0000 4 1010 0101 1011 0000 4 1011 0100 1100 0000 Edited by author 21.02.2007 13:58 My program successfully passed all of your test cases, but I still WA3... What can it be??? You are need in additional tests Best if you will create them yourself I have only 3 cases 1) attempt to build a >b 2) attempt to build a+1 0 3) build 0 0 A + B = A XOR B iff there is no carry, or in other words A AND B = 0 So the algo is simple Find leftmost x such that p[x]=q[x]=1. if none, assume x=n+1. Find rightmost y to the left of x such that p[y]=q[y]=0. If none, output p+1, 0 (p+1 may become 0). Otherwise set q[y]=1, and q[y+1..n]=0 Edited by author 12.07.2026 04:38 |
| Overrated | Keworker `~ | 1154. Сражение магов | 11 июл 2026 09:16 | 2 |
This task has some problems with accurancy, but 878 is too big rating for it. Agreed. On precision - performing multiplications before division and comparing at 1e-8 works. |
| Need Clarification! | Lebedev_Nicolay[Ivanovo SPU] | 1277. Cops and Thieves | 11 июл 2026 07:27 | 4 |
Can anybody expalain me this problem? I think that in both samples answer is YES, because all vertices are next to refuge or to museum. At last I've solved it. what about solution: 1) for maxflow use RelabelToFront 2) WA 36 : try this test 5 3 2 2 3 1 2 3 1 2 2 3 answer: NO 3) WA 38: test 5 3 2 2 2 1 2 3 1 2 2 3 answer: NO |
| WA#6 | frost_nova | 1547. Перебор паролей | 10 июл 2026 01:22 | 7 |
WA#6 frost_nova 12 май 2007 03:36 Re: WA#6 Dmytro Dziuma (DixonD) [Lviv NU] 8 мар 2008 19:26 I got also WA at #6 and made some tests on the input. It seems that the line if (N == 34 && M == 49) while (1); got TLE (6) so the test is 34 49. My answer to this test is a-niaacgvtxwdouniwkovyjlpaaaerlqkyo niaacgvtxwdouniwkovyjlpaaaerlqkyp-aaarepihxnlfzhjsqrzpokzcbpyfypjwat aaarepihxnlfzhjsqrzpokzcbpyfypjwau-aqaaaaaaaaiiovpgvvmsnhsbbrtjgmuqbw aqaaaaaaaaiiovpgvvmsnhsbbrtjgmuqbx-bejdhnxluhaaainzrkuauccrqbastmtecb bejdhnxluhaaainzrkuauccrqbastmtecc-bssejrqozpnkflharcuholuvjdvwynyaaa bssejrqozpnkflharcuholuvjdvwynyaaa-chbflvjseyarrdiqpnyomjekfzqbtgnktz chbflvjseyarrdiqpnyomjekfzqbtgnkua-cvkgnzcvkgnzcvkgnzcvkgnzcvkgnzcvkm cvkgnzcvkgnzcvkgnzcvkgnzcvkgnzcvkn-djthqcvyppbgonlwmkhcidxnzrelirsgaz djthqcvyppbgonlwmkhcidxnzrelirsgba-dycisgpbuxooafnmkvljgbhcwmyqdkhqrm dycisgpbuxooafnmkvljgbhcwmyqdkhqrn-emljukifaapbxjvblttjroekmwfuxvlxyx emljukifaapbxjvblttjroekmwfuxvlxyy-faukwobifopcxpqshrtxbwaaaxbkkpmjnr faukwobifopcxpqshrtxbwaaaxbkkpmjns-fpdlyrulkxckjhsigcydztjvnaayrhdnnv fpdlyrulkxckjhsigcydztjvnaayrhdnnw-gdmnachtlazghlttujryytfbucbeeqsbil gdmnachtlazghlttujryytfbucbeeqsbim-grvoczgrvoczgrvoczgrvoczgrvoczgrvv grvoczgrvoczgrvoczgrvoczgrvoczgrvw-hgepfczvawqgsjxebkkytlmodnpsxrwcmh hgepfczvawqgsjxebkkytlmodnpsxrwcmi-hunqhgsygfdoebytzvpfriwdajjxsklnct hunqhgsygfdoebytzvpfriwdajjxsklncu-iiwrjkmblnqvpuajygtmpgfrxfecndaxtf iiwrjkmblnqvpuajygtmpgfrxfecndaxtg-ixfslofeqwedbmbzwrxtndpguayhhvqijr ixfslofeqwedbmbzwrxtndpguayhhvqijs-jlotnryhwerknedpvdcalayvqwsmcoftaa jlotnryhwerknedpvdcalayvqwsmcoftaa-jzxupvrlbnerywfftoghiyiknsmqxgvdqp jzxupvrlbnerywfftoghiyiknsmqxgvdqq-kogvrzkogvrzkogvrzkogvrzkogvrzkohb kogvrzkogvrzkogvrzkogvrzkogvrzkohc-lcpwuddrmefgwgilqkovetbohkbamrzyxn lcpwuddrmefgwgilqkovetbohkbamrzyxo-lqyxwgwurmsohykbovtccqldefvfhkpjnz lqyxwgwurmsohykbovtccqldefvfhkpjoa-mfhyykpxwvfvtqlrngxjanusbbpkcdeuel mfhyykpxwvfvtqlrngxjanusbbpkcdeuem-mtraaaaaaadyagcaylnbwefjfiwhlkxzyt mtraaaaaaadyagcaylnbwefjfiwhlkxzyu-niaaaaaamqmtnchcwhigpdmsazucrszvdb niaaaaaamqmtnchcwhigpdmsazucrszvdc-nwjcevvhmutscsqniokdufxkroxymgzaaa nwjcevvhmutscsqniokdufxkroxymgzaaa-oksdgzoksdgzoksdgzoksdgzoksdgzoksh oksdgzoksdgzoksdgzoksdgzoksdgzoksi-ozbejdhnxluhaabhlcxuvdfatyrziklvtv ozbejdhnxluhaabhlcxuvdfatyrziklvtw-pnkflharcuholuvjdvwynyaabjmfvzjyxn pnkflharcuholuvjdvwynyaabjmfvzjyxo-qbtgnktuicuvxmwzchbflvjseyarrdiqpr qbtgnktuicuvxmwzchbflvjseyarrdiqps-qqchpomxnlidjeypacedivahvrcqaaaaaa qqchpomxnlidjeypacedivahvrcqaaaaaa-relirsgastvkuxaezdjthqcvyppbgonlwp relirsgastvkuxaezdjthqcvyppbgonlwq-rsujtvzdycisgpbuxooafnmkvljgbhcwnb rsujtvzdycisgpbuxooafnmkvljgbhcwnc-shdkvzshdkvzshdkvzshdkvzshdkvzshdn shdkvzshdkvzshdkvzshdkvzshdkvzshdo-svmlydlkitjhdzfaukwobifopcxpqshrtz svmlydlkitjhdzfaukwobifopcxpqshrua-tjvnacjothflsugpqhyezmsbiabaabensx tjvnacjothflsugpqhyezmsbiabaabensy-tyeockxqtkjwbjigrhfbxcysiulzgdmnax tyeockxqtkjwbjigrhfbxcysiulzgdmnay-umnpeoqtysxdnbjwpsjivaihfqgeawbxrj umnpeoqtysxdnbjwpsjivaihfqgeawbxrk-vawqgsjxebkkytlmodnpsxrwcmaivorihv vawqgsjxebkkytlmodnpsxrwcmaivorihw-vpfriwdajjxsklncmorwqvbkzhunqhgsyh vpfriwdajjxsklncmorwqvbkzhunqhgsyi-wdoskzwdoskzwdoskzwdoskzwdoskzwdot wdoskzwdoskzwdoskzwdoskzwdoskzwdou-wrxtndpguayhhvqijlabeukemqvwvdoaaa wrxtndpguayhhvqijlabeukemqvwvdoaaa-xgguphijzjlotnryhwerknedpvdcaaaaud xgguphijzjlotnryhwerknedpvdcaaaaue-xupvrlbnerywfftoghiyiknsmqxgvdqjmd xupvrlbnerywfftoghiyiknsmqxgvdqjme-yiywtouqkamdqxveesnfghxhjmrlpwfucp yiywtouqkamdqxveesnfghxhjmrlpwfucq-yxhxvsntpizlcpwuddrmefgwgilqkovetb yxhxvsntpizlcpwuddrmefgwgilqkovetc-zlqyxwgwurmsohykbovtccqldefvfhkpjn zlqyxwgwurmsohykbovtccqldefvfhkpjo-zzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz Can anyone write the correct answer? Thank you Edited by author 19.03.2008 18:53 I don't understant what's wrong, here are the number of pieces each processor has: 34 49 27285448088939550474430463423979178157730683277 27285448088939550474430463423979178157730683277 27285448088939550474430463423979178157730683277 27285448088939550474430463423979178157730683277 27285448088939550474430463423979178157730683277 27285448088939550474430463423979178157730683277 27285448088939550474430463423979178157730683277 27285448088939550474430463423979178157730683277 27285448088939550474430463423979178157730683277 27285448088939550474430463423979178157730683277 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 (26^34) % M = 10 so I distributed the 10 remaining strings on the first processors, according to the sample test (when the remainder was 2) Any hint? solved! 'bssejrqozpnkflharcuholuvjdvwynyaaa' on processor 5 and 6 is obviously wrong Re: WA#6 IgorKoval [PskovSU] 15 мар 2012 23:34 input: 34 49 output: a-niabcscehmgkraoxkdfwwinvutdtrojpm niabcscehmgkraoxkdfwwinvutdtrojpn-abrbdglfjpznwjcevvhmutscsqniokdufz abrbdglfjpznwjcevvhmutscsqniokduga-aqacfkeioymvibduugltsrbrpmhnjctewm aqacfkeioymvibduugltsrbrpmhnjctewn-bejdhnxluhacttfksrqaqolgmibsdvipmz bejdhnxluhacttfksrqaqolgmibsdvipna-bssejrqozpnkflharcuholuvjdvwynyadm bssejrqozpnkflharcuholuvjdvwynyadn-chbflvjseyarrdiqpnyomjekfzqbtgnktz chbflvjseyarrdiqpnyomjekfzqbtgnkua-cvkgnzcvkgnzcvkgnzcvkgnzcvkgnzcvkm cvkgnzcvkgnzcvkgnzcvkgnzcvkgnzcvkn-djthqcvyppbgonlwmkhcidxnzrelirsgaz djthqcvyppbgonlwmkhcidxnzrelirsgba-dycisgpbuxooafnmkvljgbhcwmyqdkhqrm dycisgpbuxooafnmkvljgbhcwmyqdkhqrn-emljukifagbvlxpcjgpqdyqrtisuycxbhz emljukifagbvlxpcjgpqdyqrtisuycxbia-faukwobifopcxpqshrtxbwagqemzsvmlyl faukwobifopcxpqshrtxbwagqemzsvmlym-fpdlyrulkxckjhsigcydztjvnahenobwox fpdlyrulkxckjhsigcydztjvnahenobwoy-gdmnavnoqfpruztyeockxqtkjwbjigrhfj gdmnavnoqfpruztyeockxqtkjwbjigrhfk-grvoczgrvoczgrvoczgrvoczgrvoczgrvv grvoczgrvoczgrvoczgrvoczgrvoczgrvw-hgepfczvawqgsjxebkkytlmodnpsxrwcmh hgepfczvawqgsjxebkkytlmodnpsxrwcmi-hunqhgsygfdoebytzvpfriwdajjxsklnct hunqhgsygfdoebytzvpfriwdajjxsklncu-iiwrjkmblnqvpuajygtmpgfrxfecndaxtf iiwrjkmblnqvpuajygtmpgfrxfecndaxtg-ixfslofeqwedbmbzwrxtndpguayhhvqijr ixfslofeqwedbmbzwrxtndpguayhhvqijs-jlotnryhwerknedpvdcalayvqwsmcoftad jlotnryhwerknedpvdcalayvqwsmcoftae-jzxupvrlbnerywfftoghiyiknsmqxgvdqp jzxupvrlbnerywfftoghiyiknsmqxgvdqq-kogvrzkogvrzkogvrzkogvrzkogvrzkohb kogvrzkogvrzkogvrzkogvrzkogvrzkohc-lcpwuddrmefgwgilqkovetbohkbamrzyxn lcpwuddrmefgwgilqkovetbohkbamrzyxo-lqyxwgwurmsohykbovtccqldefvfhkpjnz lqyxwgwurmsohykbovtccqldefvfhkpjoa-mfhyykpxwvfvtqlrngxjanusbbpkcdeuel mfhyykpxwvfvtqlrngxjanusbbpkcdeuem-mtraaojbcdtdfinhlsbpylegxxjowvueux mtraaojbcdtdfinhlsbpylegxxjowvueuy-niabcscehmgkraoxkdfwwinvutdtrojplj niabcscehmgkraoxkdfwwinvutdtrojplk-nwjcevvhmutscsqniokdufxkroxymgzabv nwjcevvhmutscsqniokdufxkroxymgzabw-oksdgzoksdgzoksdgzoksdgzoksdgzoksh oksdgzoksdgzoksdgzoksdgzoksdgzoksi-ozbejdhnxluhacttfksrqaqolgmibsdvit ozbejdhnxluhacttfksrqaqolgmibsdviu-pnkflharcuholuvjdvwynyadicgmwktfzf pnkflharcuholuvjdvwynyadicgmwktfzg-qbtgnktuicuvxmwzchbflvjseyarrdiqpr qbtgnktuicuvxmwzchbflvjseyarrdiqps-qqchpomxnlidjeypasfmjsthbtuwlvybgd qqchpomxnlidjeypasfmjsthbtuwlvybge-relirsgastvkuxaezdjthqcvyppbgonlwp relirsgastvkuxaezdjthqcvyppbgonlwq-rsujtvzdycisgpbuxooafnmkvljgbhcwnb rsujtvzdycisgpbuxooafnmkvljgbhcwnc-shdkvzshdkvzshdkvzshdkvzshdkvzshdn shdkvzshdkvzshdkvzshdkvzshdkvzshdo-svmlydlkitjhdzfaukwobifopcxpqshrtz svmlydlkitjhdzfaukwobifopcxpqshrua-tjvnahenobwoprgqswauzfpdlyrulkxckl tjvnahenobwoprgqswauzfpdlyrulkxckm-tyeockxqtkjwbjigrhfbxcysiulzgdmnax tyeockxqtkjwbjigrhfbxcysiulzgdmnay-umnpeoqtysxdnbjwpsjivaihfqgeawbxrj umnpeoqtysxdnbjwpsjivaihfqgeawbxrk-vawqgsjxebkkytlmodnpsxrwcmaivorihv vawqgsjxebkkytlmodnpsxrwcmaivorihw-vpfriwdajjxsklncmorwqvbkzhunqhgsyh vpfriwdajjxsklncmorwqvbkzhunqhgsyi-wdoskzwdoskzwdoskzwdoskzwdoskzwdot wdoskzwdoskzwdoskzwdoskzwdoskzwdou-wrxtndpguayhhvqijlakmpuoszixfsloff wrxtndpguayhhvqijlakmpuoszixfslofg-xgguphijzjlotnryhwerknedpvdcalayvr xgguphijzjlotnryhwerknedpvdcalayvs-xupvrlbnerywfftoghiyiknsmqxgvdqjmd xupvrlbnerywfftoghiyiknsmqxgvdqjme-yiywtouqkamdqxveesnfghxhjmrlpwfucp yiywtouqkamdqxveesnfghxhjmrlpwfucq-yxhxvsntpizlcpwuddrmefgwgilqkovetb yxhxvsntpizlcpwuddrmefgwgilqkovetc-zlqyxwgwurmsohykbovtccqldefvfhkpjn zlqyxwgwurmsohykbovtccqldefvfhkpjo-zzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz Thanks for the test :) I solved it using base-26 long arithmetics, but forgot to prepend leading zeroes (leading 'a'), so could output "brg" instead of "aabrg" |
| Possible way to solve it (long arithmetic ) | Nikita Mogilevets | 1547. Перебор паролей | 10 июл 2026 01:06 | 2 |
Calculate powers of 26 and prefix sums of powers of 26. Calculate ranges by integer division. Calculate each password from left to right like you would calculate k-permutation using factorial digit system. Base-26 arithmetics simplifies things a lot here :) |
| What if pawns eats bishop? | Denis Koshman | 1398. Слон и пешка | 9 июл 2026 23:39 | 3 |
It's not clear if black player can continue movement or not after eating white bishop. Bishop moves first, so if at first pawn can capture bishop it does not matter. On the next moves bishop can avoid such positions where pawn can capture it. Just according to problem statement it's white wins :), so looks weird |
| ADMIN! | coder | 2137. Динамическая сложность строки | 9 июл 2026 22:45 | 1 |
Please, check 142 test, C++ fread failed for this test case. scanf accepted. After fread I can try trim space symbols (ASCII code <= 32) from start and end, any more WA142. |
| Any hint? | Alexandru Farcasanu | 1915. Руины титанов: воссоздание былого | 9 июл 2026 22:39 | 6 |
Any hint? Alexandru Farcasanu 20 окт 2012 23:26 Any hint for solving this problem? number of possible operations is only 1m > number of possible operations is only 1m Hah! Somehow reading this here (even though it's clear in the problem statement) made me see the way...thanks. memcpy (for c++) and million.., and not any more ;p |
| How solve it O(N) ? | coder | 2137. Динамическая сложность строки | 9 июл 2026 22:09 | 1 |
|
| If you have WA12 | Denis Koshman | 1269. Антимат | 9 июл 2026 21:04 | 3 |
Try this test: 2 abc b 1 abc Correct answer: 1 1 |
| Please add these tests. | Arthas | 1466. Магический квадрат | 9 июл 2026 19:16 | 3 |
3 5 1 4 5 7 3 8 2 4 4 7 5 3 7 7 0 3 5 2 5 1 5 3 4 3 8 8 8 6 0 6 6 1 I got tle on these tests.But I got AC. My AC solution outputs "NO" on both of those test cases. Answer to second test is YES. And, moreover, there are 840 ways to fill the square. Upd. Sorry, forgot about constraint a[0][0]=0. (But, if ignore it, 840 is correct number.) Edited by author 09.07.2026 19:19 |
| Complexity | Solver | 2226. Графство белок | 9 июл 2026 12:20 | 1 |
O(N) for RAM and CPU, don't know why memory limit is that high. Based on classics for tree diameter. |
| Start time is 0 or 1 ? | Sq1 | 2009. Очереди в столовой | 9 июл 2026 08:55 | 2 |
Doesn't matter, could be -1000 |
| What is the maximum number of divisions needed? | Lomir | 1468. Дробь | 9 июл 2026 07:22 | 4 |
What is the maximum number of divisions needed to get the full period? I got TLE this O(n^2) algo there n is the number of divisions. O(n*lg n) from number of divisions also TLE. But why...? O(n) AC in 0.234 O(n^2) memorization of prev remainders in vector with linear search O(n*lg n) memorization of prev remainders in set O(n) just used bitset<10000> cause all remainders is less then 10000 But why O(n*lg n) TLE!?!?!? just remember position for each remainder, once stepped over again - period detected. O(b) memory, O(b) runtime |
| AC | linjek | 1016. Кубик на прогулке | 9 июл 2026 02:00 | 2 |
AC linjek 9 авг 2014 16:51 You can solve that with algo Djikstra. We have 6!*8*8 vertex (hash of cube and point) . And all vertexs have <=4 edges. P.s. sry for English ) Edited by author 09.08.2014 16:51 Re: AC Solver 9 июл 2026 02:00 there are only 24 orientations |
| This is pretty simple task | Skeef79 | 2112. Полевые логи | 9 июл 2026 01:27 | 2 |
just use DSU to check teams, and then build answer why dsu? just bfs on revival links. if component >4 - FAKE. then fill up 3+1, 2+2, 2+1+1, 1+1+1+1 |
| For WA6 | Ade | 1629. Перелёт | 8 июл 2026 23:50 | 2 |
The first day has no delay flight from the day before. 2 1 60 100 23:00 He can departure from 24:00 , not 00:00 Thanks, but with this change just for the 1st flight it gets WA13 :) The right solution is to get yesterday flights only when current time spent is >= 1440. Problem statement lacks "from this moment" phrase which exists in russian version. Edited by author 08.07.2026 23:57 |
| O(W*H) solution passes | LaVuna [KHNURE] | 1235. Cricket Field | 8 июл 2026 23:26 | 2 |
O(W*H) solution passes Edited by author 22.08.2021 13:50 Edited by author 22.08.2021 13:50 I did it O(N^3) way, but can be done O(N^2*log(N)) Edited by author 08.07.2026 23:43 |
| Doubts about using the random number. | MYLS | 1333. Джинн-бомбардировки 2 | 8 июл 2026 16:57 | 4 |
In my programme, I use 1000 000 random locations to check if the points are in the circle. At first, I wrote something like this: "double tx = ( double )( rand() % 101 ) / 100.0 ";(because: 0 ≤ x ≤ 1, -> rand() % 101 ∈[ 0, 100 ] );and just got WA...... Finally I changed the 101 into 100 and got AC; Can anyone tell me why 101 is incorrect? or it is actually right? You're just lucky that in the second case you got AC - actually good tests will kill your second solution as well, because what you generate is random point on integer grid 100 x 100 and this is far from random real point. Good way of generating random point in unit square is doing double(rand()) / RAND_MAX for both coordinates - this will give you point close enough to truly random. Thanks for your reply, I realize I have mixed up continuity and dispersion. :-) This contradicts the condition of the task. It is ALWAYS required to have the correct answer. Use regular points. |