Updates

Atcoder.geany

@@ -27,7 +27,7 @@ long_line_behaviour=1
 long_line_column=72
 
 [files]
-current_page=11
+current_page=15
 FILE_NAME_0=244;C++;0;EUTF-8;1;1;0;C%3A%5CUsers%5CShuce%5Cprojects%5CAtcoder%5Cwelcome.cpp;0;4
 FILE_NAME_1=170;C++;0;EUTF-8;1;1;0;C%3A%5CUsers%5CShuce%5Cprojects%5CAtcoder%5Cfrog1.cpp;0;4
 FILE_NAME_2=436;C++;0;EUTF-8;1;1;0;C%3A%5CUsers%5CShuce%5Cprojects%5CAtcoder%5Cfrog2.cpp;0;4
@@ -40,3 +40,7 @@ FILE_NAME_8=311;C++;0;EUTF-8;1;1;0;C%3A%5CUsers%5CShuce%5Cprojects%5CAtcoder%5Cg
 FILE_NAME_9=561;C++;0;EUTF-8;1;1;0;C%3A%5CUsers%5CShuce%5Cprojects%5CAtcoder%5Ccoins.cpp;0;4
 FILE_NAME_10=276;C++;0;EUTF-8;1;1;0;C%3A%5CUsers%5CShuce%5Cprojects%5CAtcoder%5Csushi.cpp;0;4
 FILE_NAME_11=755;C++;0;EUTF-8;1;1;0;C%3A%5CUsers%5CShuce%5Cprojects%5CAtcoder%5Cdeque.cpp;0;4
+FILE_NAME_12=0;C++;0;EUTF-8;1;1;0;C%3A%5CUsers%5CShuce%5Cprojects%5CAtcoder%5Cabc332_a.cpp;0;4
+FILE_NAME_13=97;C++;0;EUTF-8;1;1;0;C%3A%5CUsers%5CShuce%5Cprojects%5CAtcoder%5Cabc332_b.cpp;0;4
+FILE_NAME_14=160;C++;0;EUTF-8;1;1;0;C%3A%5CUsers%5CShuce%5Cprojects%5CAtcoder%5Cabc332_c.cpp;0;4
+FILE_NAME_15=1612;C++;0;EUTF-8;1;1;0;C%3A%5CUsers%5CShuce%5Cprojects%5CAtcoder%5Cabc332_d.cpp;0;4

Atcoder/abc332_a.cpp

@@ -0,0 +1,15 @@
+#include <bits/stdc++.h>
+using namespace std;
+#define int long long
+
+int32_t main() {
+ ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
+ int n, s, k; cin >> n >> s >> k;
+ int ans = 0;
+ for (int i = 0; i < n; i++) {
+ int x, y; cin >> x >> y;
+ ans += x * y;
+ }
+ if (ans < s) ans += k;
+ cout << ans;
+}

Atcoder/abc332_b.cpp

@@ -0,0 +1,20 @@
+#include <bits/stdc++.h>
+using namespace std;
+typedef long long ll;
+
+int32_t main() {
+ ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
+ int k, g, m; cin >> k >> g >> m;
+ int gc = 0, mc = 0;
+ while (k--) {
+ if (gc == g) gc = 0;
+ else if (mc == 0) mc = m;
+ else {
+ int req = g - gc;
+ int transfer = min(req, mc);
+ mc -= transfer;
+ gc += transfer;
+ }
+ }
+ cout << gc << ' ' << mc;
+}

Atcoder/abc332_c.cpp

@@ -0,0 +1,22 @@
+#include <bits/stdc++.h>
+using namespace std;
+typedef long long ll;
+
+int32_t main() {
+ ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
+ int n, m; string s; cin >> n >> m >> s;
+ int mx = 0, cur = 0, left = m;
+ for (int i = 0; i < n; i++) {
+ if (s[i] == '2') cur++;
+ else if (s[i] == '1') {
+ if (left == 0) cur++;
+ else left--;
+ }
+ if (s[i] == '0' || i == n - 1) {
+ mx = max(mx, cur);
+ cur = 0;
+ left = m;
+ }
+ }
+ cout << mx;
+}

Atcoder/abc332_d.cpp

@@ -0,0 +1,72 @@
+#include <bits/stdc++.h>
+using namespace std;
+#define int long long
+
+int inversions(vector<int> &arr) { 
+ multiset<int> set1; 
+ set1.insert(arr[0]); 
+ int invcount = 0;
+ multiset<int>::iterator itset1;
+ for (int i=1; i<arr.size(); i++) { 
+ set1.insert(arr[i]); 
+ itset1 = set1.upper_bound(arr[i]); 
+ invcount += distance(itset1, set1.end()); 
+ } 
+ return invcount; 
+} 
+
+int32_t main() {
+ ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
+ int n, m; cin >> n >> m;
+ set<int> a[6], b[6], c[6], d[6];
+ multiset<int> aa, bb;
+ for (int i = 0; i < n; i++) {
+ for (int j = 0; j < m; j++) {
+ int x; cin >> x;
+ a[i].insert(x);
+ c[j].insert(x);
+ aa.insert(x);
+ }
+ }
+ for (int i = 0; i < n; i++) {
+ for (int j = 0; j < m; j++) {
+ int x; cin >> x;
+ b[i].insert(x);
+ d[j].insert(x);
+ bb.insert(x);
+ }
+ }
+
+ if (aa != bb) { cout << -1; return 0; }
+
+ bool b1 = true; bool used1[6]{}; vector<int> v1;
+ for (int i = 0; i < n; i++) {
+ bool bb = false;
+ for (int j = 0; j < n; j++) {
+ if (!used1[j] && b[i] == a[j]) {
+ v1.push_back(j);
+ used1[j] = 1;
+ bb = true;
+ break;
+ }
+ }
+ if (!bb) { b1 = 0; break; }
+ }
+
+ bool b2 = true; bool used2[6]{}; vector<int> v2;
+ for (int i = 0; i < m; i++) {
+ bool bb = false;
+ for (int j = 0; j < m; j++) {
+ if (!used2[j] && d[i] == c[j]) {
+ v2.push_back(j);
+ used2[j] = 1;
+ bb = true;
+ break;
+ }
+ }
+ if (!bb) { b2 = 0; break; }
+ }
+
+ if (!b1 || !b2) cout << -1;
+ else cout << inversions(v1) + inversions(v2);
+}

CodeBreaker/4russians.cpp

@@ -1,31 +1,23 @@
 #include <bits/stdc++.h>
 using namespace std;
-typedef long long ll;
+#define int long long
 
 int n, k;
-int pre[5005], c[5005], s[5005];
-int dp[5005][5005];
-
-int cost(int l, int r) {
- int res = -(l <= 1 ? 0 : c[l] * c[l - 1]) -(r >= n ? 0 : c[r] * c[r + 1]);
- res += (pre[r] - pre[l - 1]);
- return res;
-}
+int c[5005], s[5005];
+int dp[5005][5005][2];
 
 int32_t main() {
  ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
- cin >> n >> k;
+ cin >> n >> k; c[0] = c[n + 1] = 0;
  for (int i = 1; i <= n; i++) cin >> c[i];
  for (int i = 1; i <= n; i++) cin >> s[i];
- pre[0] = 0; for (int i = 1; i <= n; i++) pre[i] = pre[i-1] + s[i];
 
- cout << cost(2, 2) << '\n';
- for (int i = 0; i <= n; i++) for (int j = 0; j <= k; j++) {
- if (i == 0 || j == 0) dp[i][j] = 0;
- dp[i][j] = dp[i - 1][j];
- for (int a = 1; a <= j; a++)
- dp[i][j] = max(dp[i][j], dp[i - a][j - a] + cost(i - a + 1, i));
+ for (int i = 0; i <= n; i++) for (int j = 0; j <= k; j++) for (int f = 1; f >= 0; f--) {
+ if (i == 0 && f == 0) dp[i][j][f] = 0;
+ else if (i == 0 && f == 1) dp[i][j][f] = -1e18;
+ else if (f == 1) dp[i][j][f] = max(dp[i-1][j-1][0]+s[i]-c[i]*c[i-1], dp[i-1][j-1][1]+s[i]);
+ else if (f == 0) dp[i][j][f] = max(dp[i-1][j][0], dp[i][j][1]-c[i]*c[i+1]);
  }
 
- cout << dp[n][k];
+ cout << dp[n][k][0];
 }

CodeBreaker/addk.cpp

@@ -0,0 +1,60 @@
+#include <bits/stdc++.h>
+using namespace std;
+#define int long long
+
+int n, k, q, a[100005];
+int fw1[100005], fw2[100005], fw3[100005];
+
+void update(int *t, int p, int v) {
+ while (p <= n) {
+ t[p] += v;
+ p += p & -p;
+ }
+}
+
+void update(int p, int v) {
+ update(fw1, p, v);
+ update(fw2, p, p * v);
+ update(fw3, p, (n - p + 1) * v);
+}
+
+int query(int *t, int p) {
+ int res = 0;
+ while (p) {
+ res += t[p];
+ p -= p & -p;
+ }
+ return res;
+}
+
+int query(int *t, int l, int r) {
+ return query(t, r) - query(t, l - 1);
+}
+
+int32_t main() {
+ ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
+ cin >> n >> k;
+ for (int i = 1; i <= n; i++) {
+ cin >> a[i];
+ update(i, a[i]);
+ }
+
+ cin >> q;
+ while (q--) {
+ int t, b[k]; cin >> t;
+ if (t == 1) {
+ for (int i = 0; i < k; i++) cin >> b[i];
+ int tmp = a[b[0]];
+ for (int i = 1; i < k; i++)
+ update(b[i - 1], a[b[i]] - a[b[i - 1]]), a[b[i - 1]] = a[b[i]];
+ update(b[k - 1], tmp - a[b[k - 1]]); a[b[k - 1]] = tmp;
+ } else {
+ int l, r, m; cin >> l >> r >> m;
+ int sum = 0;
+ sum += query(fw2, l, l + m - 2) - ((l - 1) * query(fw1, l, l + m - 2));
+ sum = sum + query(fw3, r - m + 2, r) - ((n - r) * query(fw1, r - m + 2, r));
+ sum += m * query(fw1, l + m - 1, r - m + 1);
+ cout << sum << '\n';
+ }
+ }
+}

CodeBreaker/adjmatrix.cpp

@@ -19,7 +19,6 @@ void dfs(int cur) {
 
 int main() {
  cin >> V >> E >> start;
-
  for (int i = 0; i < E; i++) {
  cin >> A >> B;
  g[A].push_back(B);

CodeBreaker/arraypartition.cpp

@@ -2,20 +2,29 @@
 using namespace std;
 typedef long long ll;
 
+int n, s, l, a[300005], g[300005], dp[300005];
+
 int32_t main() {
  ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
- int n, s, l; cin >> n >> s >> l;
- int a[n]; for (int i = 0; i < n; i++) cin >> a[i];
- int cur = a[0], cnt = 1, ans = 0;
- for (int i = 1; i < n; i++) {
- if (a[i] == cur) cnt++;
- else {
- if (cnt < l) { cout << -1; return 0; }
- cur = a[i];
- cnt = 1;
- ans++;
- }
+ cin >> n >> s >> l;
+ for (int i = 1; i <= n; i++) cin >> a[i];
+
+ multiset<int> st; int p = 1;
+ for (int i = 1; i <= n; i++) {
+ st.insert(a[i]);
+ while (*(--st.end()) - *st.begin() > s)
+ st.erase(st.find(a[p++]));
+ g[i] = st.size();
  }
 
- cout << ans;
+ dp[0] = 0; multiset<int> w{0}; int x = 0, y = 1;
+ for (int i = 1; i <= n; i++) {
+ int from = max(i - g[i], 0), to = i - l;
+ if (to < from) { dp[i] = 1e9; continue; }
+ for (int j = y + 1; j <= to; j++) w.insert(dp[j]); y = to;
+ for (int j = x; j < from; j++) w.erase(w.find(dp[j])); x = from;
+ dp[i] = (w.empty() ? 1e9 : *w.begin() + 1);
+ }
+
+ cout << (dp[n] == 1e9 ? -1 : dp[n]);
 }

CodeBreaker/atleasttripledate.cpp

@@ -0,0 +1,16 @@
+#include <bits/stdc++.h>
+using namespace std;
+#define int long long
+const int m = 1e9 + 7;
+
+int dp[2005];
+
+int32_t main() {
+ ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
+ int n; cin >> n;
+ dp[0] = 1; dp[3] = 1;
+ for (int i = 4; i <= n; i++) {
+ for (int j = 0; j <= i - 3; j++) dp[i] = (dp[i] + dp[j]) % m;
+ }
+ cout << dp[n];
+}

CodeBreaker/attention.cpp

@@ -0,0 +1,36 @@
+#include <bits/stdc++.h>
+using namespace std;
+typedef long long ll;
+
+int dp[19][(1 << 19)], g[19][19];
+
+int32_t main() {
+ ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
+ int n, m; cin >> n >> m;
+ for (int i = 0; i < m; i++) {
+ int u, v; cin >> u >> v;
+ g[u][v] = g[v][u] = 1;
+ }
+
+ int ans = 0;
+ for (int mask = 1; mask < (1 << n); mask++) {
+ int mnbit = __builtin_ctz(mask);
+ if ((1 << mnbit) == mask) {
+ dp[mnbit][mask] = 1;
+ continue;
+ }
+
+ for (int i = mnbit + 1; i < n; i++) {
+ if (!(mask & (1 << i))) continue;
+ if (__builtin_popcount(mask) == 2) {
+ dp[i][mask] = g[mnbit][i];
+ continue;
+ }
+ for (int j = mnbit + 1; j < n; j++) 
+ if (g[i][j]) dp[i][mask] += dp[j][mask ^ (1 << i)];
+ ans += g[i][mnbit] * dp[i][mask];
+ }
+ }
+
+ cout << ans / 2;
+}