Comments
|
+47
Don’t you think that every problem must have reference solution which works correctly and fast enough for every test within given constraints? Otherwise it is unfair to the contestants. |
|
+8
Codeforces Beta Round #88 will be old-style common contest with 5 problems.
|
|
0
This problem in the writer's solution influenced 2 hacks: yours and ilyakor's. The solution was fixed in 13 minutes, and hacks were rejudged. We are extremely sorry for this.
|
|
0
thank you
|
|
+19
GCJ 2012 will be held in Paris, as it was said on the awards ceremony. |
|
+19
|
|
+8
Looks like you compile without optimizations (-O2).
|
|
0
We already have this option. You can toggle "Show tags for unsolved problems" in your profile settings.
|
|
+5
It is impossible to consider all probable bugs. We are working on automatic adding of all the hacks in the final tests. It will be introduced soon.
|
|
+3
No, everything is correct. The first pretest is the first sample test.
|
|
0
99 99 |
|
+2
Big random test with 99 cars, and 100 segments for each car.
|
|
+13
As you may know, I am the problem coordinator on Codeforces. If you want to be an author of a round, first of all, send me statements of your problems. If they are new and interesting, they will be accepted. Then author have to prepare tests, an AC solution on any of the supported languages and some small programs for validating participants' hacks (called validator) and for checking participants' outputs (called checker). |
|
On NALP →
School Individual Contest #1 (WCS 2010/11) - Codeforces Beta Round #38 (ACM-ICPC Rules), 19 months ago
0
Yes
|
|
0
Field 27 × 27 with 700 random stars. You need to find constellation number 1107, and it exists.
|
|
0
1000000 1000000 1 Answer is 1000000000000 |
|
0
No. The correct one is 8.
|
|
0
9 8 7 |
|
0
Some big test. The answer is 0.
|
|
0
6 264896923 2497658 57071588 447086061 2497658 483723090 57071588 264896923 158310110 483723090 158310110 72866107 |
|
0
772 467 142 356 889 |
|
0
1000 999 1 1 1000 |
|
0
No, the answer is 1001
|
|
0
1000 1 1 1 1 |
|
0
2 1 1 1 1000 |
|
0
4 90104473 221011623 18773664 221011623 90104473 74427905 74427905 186329050 |
|
0
3 458744979 589655889 248228386 824699605 458744979 824699605 |
|
0
4 |
|
+3
The 14th test is just big test with n=500 and m=1000
|
|
0
pretest1 = sample test1
May be you output "," instead of "." ? |
|
0
8 4 3 1 4 8 5 7 6 3 5 7 3 4 2 2 6 8 |
|
+13
Yes
|
|
+13
2 1 1 1 1 |
|
0
6 5 5 3 4 1 2 6 5 1 5 2 |
|
0
It is big random test where N=50
|
|
0
Big random test, N = M = 100
|
|
0
N = 8, answer is 24
|
|
+12
5 3 5 2 5 1 5 1 4 4 3 1 3 2 3 4 5 4 2 |
|
0
Test 18 for C is big random test, test 10 for D: 6 4 6 3 1 3 6 4 5 3 |
|
0
N = 8, answer is 24
|
|
0
N = 20, answer is 240
|
|
0
N = 9, answer is 36
|
|
-3
Some big test. N = 10^5, but there are only 2 different numbers. The answer is:
3 1 3 4 May be your program does not work properly with equal numbers? |
|
0
6th pretest is:
4 2 3 3 1 |
|
0
864691128455135232 |
|
0
118 |
|
0
The 44th test is some big random test, every string contains letters 't' and 'y' only.
|
|
0
The 26th test:
The first string consists of 92235 letters. Letter in position 81200 (1-based) is 'z', the others are 't'. The second string consists of 68546 letters. Letter in position 40450 (1-based) is 'z', the others are 't'. The third string consists of 92026 letters 't'. The answer is 120123 |
|
0
39 6 13 15 39 10 35 31 28 4 21 12 39 3 7 3 13 6 1 5 14 36 28 12 15 18 38 30 29 19 34 36 16 20 22 8 13 38 32 26 39 21 37 1 7 15 27 12 26 8 3 6 14 29 2 25 23 32 21 5 16 32 25 6 8 13 10 23 30 34 37 29 33 28 14 36 5 |
|
0
Test 8 in problem D:
10 5 9 8 5 7 6 7 9 3 9 2 1 7 2 3 6 7 1 |
|
0
Maybe you don't output line breaks?
|
|
+1
There are no special cases for PE in this problem. You can get PE if you either output not an integer or output city index that violates range [1, n] or your number of days is negative.
|