OJ Board

A stupid error. Try input: 15 0 1 1 2 Just one line? Just one line? 1 2 Just one []line? Just one line? 2 2 The first characters of the alphabet are: [abcde] Here they come: a b c d e 1 1 That's it: [ abcde] That's it: AbCdE 1 1 [2] and [3] make [5] I guess 2 and 3 are less than 50. 1 1 The first ch...

This problem should employ special judge.

Test data generator. #include <bits/stdc++.h> using namespace std; int main(int argc, char *argv[]) { srand(time(NULL)); int cases = 100; cout << cases << "\n\n"; for (int cs = 1; cs <= cases; cs++) { if (cs > 1) cout << '\n'; int N = rand() % 101; cout << N << '\n'; string push = "LRTB"; for (int i...

Test data generator. #include <bits/stdc++.h> using namespace std; const double EPSILON = 1e-7; struct point { double x, y; point(double x = 0, double y = 0): x(x), y(y) {} bool operator<(const point & p) const { if (fabs(y - p.y) > EPSILON) return y < p.y; return x < p.x; } bool operator==(const po...

Test data generator. #include <bits/stdc++.h> using namespace std; int main(int argc, char *argv[]) { srand(time(NULL)); int n = rand() % 490000 + 10000, m = 10000; cout << n << ' ' << m << '\n'; for (int i = 0, sign = 1; i < n; i++) { if (i) cout << ' '; if (rand() % 100 > 80) sign *= -1; cout << s...

After using assert, the test data may contains some bug. In query, there may be some coordinate value which is bigger than given N, for example: In my AC code, I output 0 in this situation.

Test data generator. #include <bits/stdc++.h> using namespace std; int main(int argc, char *argv[]) { cin.tie(0), cout.tie(0), ios::sync_with_stdio(false); srand(time(NULL)); for (int cs = 1; cs <= 100; cs++) { int n = rand() % 25 + 1; for (int i = 0; i < n; i++) cout << rand() % 100 + 1 << ' '; cou...

Test data generator. #include <bits/stdc++.h> using namespace std; int main(int argc, char *argv[]) { srand(time(NULL)); int T = 100; cout << T << '\n'; for (int cs = 1; cs <= T; cs++) { int N = 1000; cout << N << '\n'; for (int i = 0; i < N; i++) { int x1 = rand() % 198 - 99, x2 = rand() % 198 - 99...

If you use (8*bt(i)+2*fl(i)+5)/10 to calculate the score, you may get WA, but if you use round(0.8*bt(i)+0.2*fl(i)), you may get AC.

Test data generator. #include <bits/stdc++.h> using namespace std; int main(int argc, char *argv[]) { srand(time(NULL)); int T = 100; cout << T << "\n\n"; for (int cs = 1; cs <= T; cs++) { long long k, N, S, D, x, y; k = rand() % 100000000; if (rand() % 100 > 70) k *= -1; N = rand() % 1000 + 1; S = ...

Human planets are NOT needed to leave for allien planets at the same time.
Max Cardinality Bipartite Matching + Binary Search. Similar: 10804 Gopher Strategy, 11262 Weird Fence.

After tons of submit, I always got WA, so I turn to UVa BBS for help. It is a classical 0-1 knapsack problem. I have considered various boundary test cases: (1)the total allowed time equal to 0; (2)evidences with time 0; (3)evidences with same score and time, I choose the item which description asci...

Test data generator. #include <bits/stdc++.h> using namespace std; int main(int argc, char *argv[]) { srand(time(NULL)); for (int cases = 1; cases <= 100; cases++) { int n = rand() % 100 + 1; int m = min(rand() % n + 1, 20); cout << n << ' ' << m << '\n'; for (int i = 1; i <= n; i++) { cout << rand(...

Test data generator. #include <bits/stdc++.h> using namespace std; int main(int argc, char *argv[]) { srand(time(NULL)); int N[10] = {2, 4, 8, 16, 32, 64, 128, 256, 512, 1024}; for (int cases = 1; cases <= 100; cases++) { int n = N[rand() % 10]; cout << n << '\n'; for (int i = 0; i < (2 * n - 1); i+...

Be careful of the boundary condition.