結果
| 問題 | No.122 傾向と対策：門松列（その３） |
| ユーザー |
 kimiyuki
|
| 提出日時 | 2016-12-20 22:14:32 |
| 言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 635 ms / 5,000 ms |
| コード長 | 4,718 bytes |
| コンパイル時間 | 1,175 ms |
| コンパイル使用メモリ | 89,580 KB |
| 実行使用メモリ | 6,820 KB |
| 最終ジャッジ日時 | 2024-12-14 11:36:53 |
| 合計ジャッジ時間 | 6,527 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 8 |
ソースコード
#include <iostream>#include <vector>#include <algorithm>#include <array>#include <set>#include <tuple>#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)typedef long long ll;using namespace std;const int mod = 1e9+7;ll choose_distinct(pair<int, int> x1, pair<int, int> x2, pair<int, int> x3) {int al, ar; tie(al, ar) = x1; // [l, r]int bl, br; tie(bl, br) = x2;int cl, cr; tie(cl, cr) = x3;if (al > ar) return 0;if (bl > br) return 0;if (cl > cr) return 0;++ ar; // [l, r)++ br;++ cr;vector<int> xs { al, ar, bl, br, cl, cr };whole(sort, xs);xs.erase(whole(unique, xs), xs.end());vector<int> length(xs.size()-1);vector<array<bool, 3> > contained(xs.size()-1);repeat (i,xs.size()-1) {int l = xs[i];int r = xs[i+1];length[i] = r - l;contained[i][0] = al <= l and r <= ar;contained[i][1] = bl <= l and r <= br;contained[i][2] = cl <= l and r <= cr;}ll acc = 0;repeat (i,contained.size()) if (contained[i][0]) {repeat (j,contained.size()) if (contained[j][1]) {repeat (k,contained.size()) if (contained[k][2]) {acc += length[i] *(ll) max(0, length[j] - (j == i)) % mod * max(0, length[k] - (k == i) - (k == j)) % mod;}}}return acc % mod;}ll choose_distinct(pair<int, int> x1, pair<int, int> x2) {return choose_distinct(x1, x2, { 0, 0 });}int main() {const int A = 0, B = 1, C = 2, D = 3, E = 4, F = 5, G = 6;int x_min[7], x_max[7]; repeat (i,7) cin >> x_min[i] >> x_max[i]; // [l, r]auto is_in = [&](int a, int x) { return x_min[x] <= a and a <= x_max[x]; };auto range_le = [&](int upper, int x) { return make_pair(x_min[x], min(upper, x_max[x])); };auto range_ge = [&](int lower, int x) { return make_pair(max(lower, x_min[x]), x_max[x]); };int max_x_max= *whole(max_element, x_max);vector<int> acc_aceg_min(max_x_max+1);repeat(min_aceg, max_x_max+1) {ll acc = 0;if (is_in(min_aceg, A)) acc += choose_distinct( range_ge(min_aceg+1, C), range_ge(min_aceg+1, E), range_ge(min_aceg+1, G) );if (is_in(min_aceg, C)) acc += choose_distinct( range_ge(min_aceg+1, A), range_ge(min_aceg+1, E), range_ge(min_aceg+1, G) );if (is_in(min_aceg, E)) acc += choose_distinct( range_ge(min_aceg+1, A), range_ge(min_aceg+1, C), range_ge(min_aceg+1, G) );if (is_in(min_aceg, G)) acc += choose_distinct( range_ge(min_aceg+1, A), range_ge(min_aceg+1, C), range_ge(min_aceg+1, E) );acc_aceg_min[min_aceg] = acc % mod;}vector<int> acc_aceg_max(max_x_max+1);repeat (max_aceg, max_x_max+1) {ll acc = 0;if (is_in(max_aceg, A)) acc += choose_distinct( range_le(max_aceg-1, C), range_le(max_aceg-1, E), range_le(max_aceg-1, G) );if (is_in(max_aceg, C)) acc += choose_distinct( range_le(max_aceg-1, A), range_le(max_aceg-1, E), range_le(max_aceg-1, G) );if (is_in(max_aceg, E)) acc += choose_distinct( range_le(max_aceg-1, A), range_le(max_aceg-1, C), range_le(max_aceg-1, G) );if (is_in(max_aceg, G)) acc += choose_distinct( range_le(max_aceg-1, A), range_le(max_aceg-1, C), range_le(max_aceg-1, E) );acc_aceg_max[max_aceg] = acc % mod;}vector<int> acc_bdf_min(max_x_max+1);repeat (min_bdf, max_x_max+1) {ll acc = 0;if (is_in(min_bdf, B)) acc += choose_distinct( range_ge(min_bdf+1, D), range_ge(min_bdf+1, F) );if (is_in(min_bdf, D)) acc += choose_distinct( range_ge(min_bdf+1, B), range_ge(min_bdf+1, F) );if (is_in(min_bdf, F)) acc += choose_distinct( range_ge(min_bdf+1, B), range_ge(min_bdf+1, D) );acc_bdf_min[min_bdf] = acc % mod;}vector<int> acc_bdf_max(max_x_max+1);repeat (max_bdf, max_x_max+1) {ll acc = 0;if (is_in(max_bdf, B)) acc += choose_distinct( range_le(max_bdf-1, D), range_le(max_bdf-1, F) );if (is_in(max_bdf, D)) acc += choose_distinct( range_le(max_bdf-1, B), range_le(max_bdf-1, F) );if (is_in(max_bdf, F)) acc += choose_distinct( range_le(max_bdf-1, B), range_le(max_bdf-1, D) );acc_bdf_max[max_bdf] = acc % mod;}ll ans = 0;repeat_from (mx,1,max_x_max+1) {repeat_from (mn,mx+1,max_x_max+1) {ans += acc_aceg_max[mx] *(ll) acc_bdf_min[mn] % mod;ans += acc_bdf_max[mx] *(ll) acc_aceg_min[mn] % mod;}ans %= mod;}cout << ans << endl;return 0;}