#include <iostream> #include <climits> #define MOD 1000000007 using namespace std; typedef unsigned long long ULL; long long count_comb(int n, int k){ long long total = 1; long long res = 1; if(n > 30){ for(int i = 1; i <= k; i++){ res = res * (n - i + 1) / i; res = res % MOD; total = (total + res) % MOD; } } else { for(int i = 1; i <= k; i++){ res = res * (n - i + 1) / i; total += res; } total %= MOD; } return total; } int dist(ULL *sp_a, ULL *sp_b, int len){ int res = 0; for(int i = 0; i < len; i++){ ULL diff = sp_a[i]^sp_b[i]; res += __builtin_popcount(diff); } return res; } bool different(ULL *sp_a, ULL *sp_b, int len){ bool res = false; for(int i = 0; i < len; i++){ if(sp_a[i] != sp_b[i]){ res = true; } } return res; } long long common(ULL *sp_a, ULL *sp_b, int r_a, int r_b, int len, long long curr){ int dist_ab = dist(sp_a, sp_b, len); long long common_points = 0; if(dist_ab < r_a){ return curr; } int overlap = min(r_a, dist_ab) + min(r_b, dist_ab) - dist_ab; if(overlap >= 0){ common_points += dist_ab * overlap; if(overlap == min(r_a, r_b)){ common_points += 1; } else { common_points += dist_ab; } } return common_points; } int main() { char format[5]; int single = sizeof(ULL) * CHAR_BIT; sprintf(format, "%c%i%s", '%', single, "[01]"); int n, len, r1, r2, r3; char buff[single]; ULL *sp1; ULL *sp2; ULL *sp3; scanf("%i", &n); len = n / single + 1; sp1 = new ULL[len]{}; sp2 = new ULL[len]{}; sp3 = new ULL[len]{}; scanf("%i ", &r1); for(int i = 0; i < len; i++){ scanf(format, buff); sp1[i] = strtol(buff, NULL, 2); } scanf("%i ", &r2); for(int i = 0; i < len; i++){ scanf(format, buff); sp2[i] = strtol(buff, NULL, 2); } scanf("%i ", &r3); for(int i = 0; i < len; i++){ scanf(format, buff); sp3[i] = strtol(buff, NULL, 2); } //KONIEC WCZYTYWANIA long long res = 0, res2, res3; if(different(sp1, sp2, len)) { if(different(sp1, sp3, len)) { res = count_comb(n, r1); res2 = count_comb(n, r2); res2 -= common(sp1, sp2, r1, r2, len, res2); if(res2 > 0) res += res2; res3 = count_comb(n, r3); res3 -= common(sp1, sp3, r1, r3, len, res3); res3 -= common(sp2, sp3, r2, r3, len, res3); if(res3 > 0) res += res3; } else { if(r1 > r3) { res = count_comb(n, r1); res2 = count_comb(n, r2) - common(sp1, sp2, r1, r2, len, res2); if(res2 > 0) res += res2; } else { res = count_comb(n, r3); res2 = count_comb(n, r2) - common(sp3, sp2, r3, r2, len, res2); if(res2 > 0) res += res2; } } } else { if(different(sp1, sp3, len)){ if(r1 > r2) { res = count_comb(n, r1); res3 = count_comb(n, r3) - common(sp1, sp3, r1, r3, len, res3); if(res3 > 0) res += res3; } else { res += count_comb(n, r2); res3 = count_comb(n, r3) - common(sp2, sp3, r2, r3, len, res3); if(res3 > 0) res += res3; } } else { res = count_comb(n, max(r1, max(r2, r3))); } } res %= MOD; cout<<res; delete [] sp1; delete [] sp2; delete [] sp3; return 0; }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 | #include <iostream> #include <climits> #define MOD 1000000007 using namespace std; typedef unsigned long long ULL; long long count_comb(int n, int k){ long long total = 1; long long res = 1; if(n > 30){ for(int i = 1; i <= k; i++){ res = res * (n - i + 1) / i; res = res % MOD; total = (total + res) % MOD; } } else { for(int i = 1; i <= k; i++){ res = res * (n - i + 1) / i; total += res; } total %= MOD; } return total; } int dist(ULL *sp_a, ULL *sp_b, int len){ int res = 0; for(int i = 0; i < len; i++){ ULL diff = sp_a[i]^sp_b[i]; res += __builtin_popcount(diff); } return res; } bool different(ULL *sp_a, ULL *sp_b, int len){ bool res = false; for(int i = 0; i < len; i++){ if(sp_a[i] != sp_b[i]){ res = true; } } return res; } long long common(ULL *sp_a, ULL *sp_b, int r_a, int r_b, int len, long long curr){ int dist_ab = dist(sp_a, sp_b, len); long long common_points = 0; if(dist_ab < r_a){ return curr; } int overlap = min(r_a, dist_ab) + min(r_b, dist_ab) - dist_ab; if(overlap >= 0){ common_points += dist_ab * overlap; if(overlap == min(r_a, r_b)){ common_points += 1; } else { common_points += dist_ab; } } return common_points; } int main() { char format[5]; int single = sizeof(ULL) * CHAR_BIT; sprintf(format, "%c%i%s", '%', single, "[01]"); int n, len, r1, r2, r3; char buff[single]; ULL *sp1; ULL *sp2; ULL *sp3; scanf("%i", &n); len = n / single + 1; sp1 = new ULL[len]{}; sp2 = new ULL[len]{}; sp3 = new ULL[len]{}; scanf("%i ", &r1); for(int i = 0; i < len; i++){ scanf(format, buff); sp1[i] = strtol(buff, NULL, 2); } scanf("%i ", &r2); for(int i = 0; i < len; i++){ scanf(format, buff); sp2[i] = strtol(buff, NULL, 2); } scanf("%i ", &r3); for(int i = 0; i < len; i++){ scanf(format, buff); sp3[i] = strtol(buff, NULL, 2); } //KONIEC WCZYTYWANIA long long res = 0, res2, res3; if(different(sp1, sp2, len)) { if(different(sp1, sp3, len)) { res = count_comb(n, r1); res2 = count_comb(n, r2); res2 -= common(sp1, sp2, r1, r2, len, res2); if(res2 > 0) res += res2; res3 = count_comb(n, r3); res3 -= common(sp1, sp3, r1, r3, len, res3); res3 -= common(sp2, sp3, r2, r3, len, res3); if(res3 > 0) res += res3; } else { if(r1 > r3) { res = count_comb(n, r1); res2 = count_comb(n, r2) - common(sp1, sp2, r1, r2, len, res2); if(res2 > 0) res += res2; } else { res = count_comb(n, r3); res2 = count_comb(n, r2) - common(sp3, sp2, r3, r2, len, res2); if(res2 > 0) res += res2; } } } else { if(different(sp1, sp3, len)){ if(r1 > r2) { res = count_comb(n, r1); res3 = count_comb(n, r3) - common(sp1, sp3, r1, r3, len, res3); if(res3 > 0) res += res3; } else { res += count_comb(n, r2); res3 = count_comb(n, r3) - common(sp2, sp3, r2, r3, len, res3); if(res3 > 0) res += res3; } } else { res = count_comb(n, max(r1, max(r2, r3))); } } res %= MOD; cout<<res; delete [] sp1; delete [] sp2; delete [] sp3; return 0; } |