Submission #1351932
Source Code Expand
#include <algorithm> #include <cassert> #include <climits> #include <cstdio> #include <numeric> #include <vector> #define repeat(i, n) for (int i = 0; (i) < int(n); ++(i)) #define repeat_from(i, m, n) for (int i = (m); (i) < int(n); ++(i)) #define whole(f, x, ...) ([&](decltype((x)) whole) { return (f)(begin(whole), end(whole), ## __VA_ARGS__); })(x) using ll = long long; using namespace std; template <class T> inline void setmin(T & a, T const & b) { a = min(a, b); } ll powmod(ll x, ll y, ll p) { // O(log y) assert (0 <= x and x < p); assert (0 <= y); ll z = 1; for (ll i = 1; i <= y; i <<= 1) { if (y & i) z = z * x % p; x = x * x % p; } return z; } ll inv(ll x, ll p) { // p must be a prime, O(log p) assert ((x % p + p) % p != 0); return powmod(x, p-2, p); } template <int mod> int fact(int n) { static vector<int> memo(1,1); if (memo.size() <= n) { int l = memo.size(); memo.resize(n+1); repeat_from (i,l,n+1) memo[i] = memo[i-1] *(ll) i % mod; } return memo[n]; } template <int mod> int choose(int n, int r) { // O(n) at first time, otherwise O(\log n) if (n < r) return 0; r = min(r, n - r); return fact<mod>(n) *(ll) inv(fact<mod>(n-r), mod) % mod *(ll) inv(fact<mod>(r), mod) % mod; } constexpr int mod = 1e9+7; int main() { int n, x, y; scanf("%d%d%d", &n, &x, &y); vector<vector<int> > w(n); repeat (i, n) { int c, w_i; scanf("%d%d", &c, &w_i); -- c; w[c].push_back(w_i); } vector<pair<int, int> > min_balls; repeat (c, n) if (not w[c].empty()) { whole(sort, w[c]); min_balls.emplace_back(w[c][0], c); whole(sort, min_balls); if (min_balls.size() >= 3) min_balls.pop_back(); } if (min_balls.size() == 1) { printf("%d\n", 1); // all balls have the same color return 0; } assert (min_balls.size() == 2); int min_w = min_balls[0].first; int min_w_color = min_balls[0].second; int second_w = min_balls[1].first; vector<int> connected; repeat (c, n) if (not w[c].empty()) { int x_connected = whole(upper_bound, w[c], x - w[c][0]) - w[c].begin(); int y_connected = whole(upper_bound, w[c], y - min_w) - w[c].begin(); if (c == min_w_color and second_w != min_w) { y_connected = whole(upper_bound, w[c], y - second_w) - w[c].begin(); } if (y_connected) { connected.push_back(max(x_connected, y_connected)); } } ll result = 1; int a = whole(accumulate, connected, 0); for (int b : connected) { result = result * choose<mod>(a, b) % mod; a -= b; } printf("%lld\n", result); return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Colorful Balls |
User | kimiyuki |
Language | C++14 (Clang 3.8.0) |
Score | 1000 |
Code Size | 2826 Byte |
Status | AC |
Exec Time | 101 ms |
Memory | 10488 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 1000 / 1000 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 00_example_01.txt, 00_example_02.txt, 00_example_03.txt |
All | 00_example_01.txt, 00_example_02.txt, 00_example_03.txt, 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, 38.txt, 39.txt, 40.txt, 41.txt, 42.txt, 43.txt, 44.txt, 45.txt, 46.txt, 47.txt, 48.txt, 49.txt, 50.txt, 51.txt, 52.txt, 53.txt, 54.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00_example_01.txt | AC | 9 ms | 888 KB |
00_example_02.txt | AC | 1 ms | 256 KB |
00_example_03.txt | AC | 1 ms | 256 KB |
01.txt | AC | 1 ms | 256 KB |
02.txt | AC | 1 ms | 256 KB |
03.txt | AC | 4 ms | 512 KB |
04.txt | AC | 1 ms | 256 KB |
05.txt | AC | 2 ms | 384 KB |
06.txt | AC | 1 ms | 256 KB |
07.txt | AC | 38 ms | 4224 KB |
08.txt | AC | 1 ms | 256 KB |
09.txt | AC | 15 ms | 2304 KB |
10.txt | AC | 12 ms | 1536 KB |
11.txt | AC | 1 ms | 256 KB |
12.txt | AC | 1 ms | 256 KB |
13.txt | AC | 5 ms | 640 KB |
14.txt | AC | 1 ms | 256 KB |
15.txt | AC | 21 ms | 2432 KB |
16.txt | AC | 36 ms | 3968 KB |
17.txt | AC | 6 ms | 896 KB |
18.txt | AC | 13 ms | 1792 KB |
19.txt | AC | 26 ms | 3328 KB |
20.txt | AC | 86 ms | 9720 KB |
21.txt | AC | 85 ms | 9724 KB |
22.txt | AC | 73 ms | 9344 KB |
23.txt | AC | 98 ms | 10108 KB |
24.txt | AC | 78 ms | 9088 KB |
25.txt | AC | 85 ms | 9724 KB |
26.txt | AC | 99 ms | 10104 KB |
27.txt | AC | 69 ms | 8960 KB |
28.txt | AC | 99 ms | 10232 KB |
29.txt | AC | 93 ms | 9976 KB |
30.txt | AC | 74 ms | 9088 KB |
31.txt | AC | 101 ms | 10236 KB |
32.txt | AC | 77 ms | 9344 KB |
33.txt | AC | 98 ms | 10108 KB |
34.txt | AC | 89 ms | 9464 KB |
35.txt | AC | 48 ms | 6784 KB |
36.txt | AC | 62 ms | 7296 KB |
37.txt | AC | 49 ms | 6912 KB |
38.txt | AC | 48 ms | 6784 KB |
39.txt | AC | 51 ms | 6784 KB |
40.txt | AC | 96 ms | 10104 KB |
41.txt | AC | 83 ms | 10104 KB |
42.txt | AC | 83 ms | 10108 KB |
43.txt | AC | 70 ms | 9728 KB |
44.txt | AC | 101 ms | 10488 KB |
45.txt | AC | 76 ms | 9600 KB |
46.txt | AC | 85 ms | 10104 KB |
47.txt | AC | 51 ms | 6136 KB |
48.txt | AC | 52 ms | 6136 KB |
49.txt | AC | 52 ms | 6136 KB |
50.txt | AC | 59 ms | 9464 KB |
51.txt | AC | 49 ms | 8824 KB |
52.txt | AC | 47 ms | 6392 KB |
53.txt | AC | 48 ms | 6392 KB |
54.txt | AC | 46 ms | 6392 KB |