add codeforces div.3 498 a ~ e

Author: nnks1010

codeforces/498/a.cpp

@@ -0,0 +1,20 @@
+#include <bits/stdc++.h>
+#define REP(i,a,b) for(int i=(a);i<(b);++i)
+#define rep(i,n) REP(i,0,n)
+using namespace std;
+
+int main() {
+    int n;
+    cin >> n;
+    rep(i, n) {
+        int a;
+        cin >> a;
+	a -= (a % 2 == 0 ? 1 : 0);
+	if (i == n - 1)
+	    cout << a << endl;
+	else
+	    cout << a << " ";
+    }
+    return 0;
+}
+

codeforces/498/b.cpp

@@ -0,0 +1,36 @@
+#include <bits/stdc++.h>
+#define REP(i,a,b) for(int i=(a);i<(b);++i)
+#define rep(i,n) REP(i,0,n)
+using namespace std;
+
+const int MAX_A = 2000;
+
+int main() {
+    int n, k;
+    cin >> n >> k;
+    int a[n], tmp[n], v[MAX_A] = {};
+    rep(i, n) {
+	cin >> a[i];
+	tmp[i] = a[i];
+    }
+    sort(tmp, tmp+n);
+    int sum = 0;
+    REP(i, n - k, n) {
+	sum += tmp[i];
+	v[tmp[i]] += 1;
+    }
+    cout << sum << endl;
+    sum = 0;
+    rep(i, n) {
+	sum++;
+	if (v[a[i]] && k > 1) {
+	    v[a[i]]--;
+	    k--;
+	    cout << sum << " ";
+	    sum = 0;
+	}
+    }
+    cout << sum << endl;
+    return 0;
+}
+

codeforces/498/c.cpp

@@ -0,0 +1,31 @@
+#include <bits/stdc++.h>
+#define REP(i,a,b) for(int i=(a);i<(b);++i)
+#define rep(i,n) REP(i,0,n)
+using namespace std;
+using ll = long long;
+
+const int MAX_A = 2000;
+
+int main() {
+    ll n;
+    cin >> n;
+    ll a[n];
+    rep(i, n) cin >> a[i];
+    ll idx1 = 0, idx3 = n - 1;
+    ll sum1 = 0, sum3 = 0;
+    ll ans = 0;
+    while (true) {
+	if (idx1 >= idx3)
+	    break;
+	sum1 += a[idx1++];
+	// cout << "sum1, idx: " << sum1 << ", " << idx1 << endl;
+	// cout << "sum3, idx: " << sum3 << ", " << idx3 << endl;
+	while (idx1 <= idx3 && sum3 + a[idx3] <= sum1)
+	    sum3 += a[idx3--];
+	if (sum1 == sum3)
+	    ans = sum1;
+    }
+    cout << ans << endl;
+    return 0;
+}
+

codeforces/498/d.cpp

@@ -0,0 +1,38 @@
+#include<bits/stdc++.h>
+#define REP(i,a,b) for(int i=(a);i<(int)(b);++i)
+#define rep(i,n) REP(i,0,n)
+using namespace std;
+
+int main() {
+    int n;
+    string a, b;
+    cin >> n >> a >> b;
+    int ans = 0;
+    rep(i, (n + 1) / 2) {
+        if (n % 2 == 1 && i == n / 2) {
+            if (a[i] != b[i]) ans += 1;
+            continue;
+        }
+        if (a[i] == b[i] && a[n - i - 1] == b[n - i - 1]) continue;
+        if (a[i] == a[n - i - 1] && b[i] == b[n - i - 1]) continue;
+        if (a[i] == b[n - i - 1] && b[i] == a[n - i - 1]) continue;
+
+        set<char> s;
+        s.insert(a[i]); s.insert(a[n - i - 1]);
+        s.insert(b[i]); s.insert(b[n - i - 1]);
+        if (s.size() > 2) {
+            if (a[i] == b[i] || a[n - i - 1] == b[n - i - 1])
+                ans += 1;
+            else if (a[i] == b[n - i - 1] || b[i] == a[n - i - 1])
+                ans += 1;
+            else if (b[i] == b[n - i - 1])
+                ans += 1;
+            else
+                ans += 2;
+        }
+        else
+            ans += 1;
+    }
+    cout << ans << endl;
+}
+

codeforces/498/e.cpp

@@ -0,0 +1,54 @@
+#include<bits/stdc++.h>
+#define REP(i,a,b) for(int i=(a);i<(int)(b);++i)
+#define rep(i,n) REP(i,0,n)
+using namespace std;
+
+const int MAX_N = 200000;
+
+int dfs(int id);
+
+struct vertex {
+    vector<vertex*> edge;
+    int id, t, n;
+};
+vertex G[MAX_N + 1];
+int a[MAX_N + 1];
+int idx;
+
+int main() {
+    int n, q;
+    cin >> n >> q;
+    G[1].id = 1;
+    for (int i = 2; i <= n; ++i) {
+        int p;
+        cin >> p;
+        G[i].id = i;
+        G[p].edge.push_back(&G[i]);
+    }
+    idx = 1;
+    dfs(1);
+    // rep(i, n + 1) cout << a[i] << ", " << G[a[i]].t << endl;
+    rep(i, q) {
+        int u, k;
+        cin >> u >> k;
+        if (k > G[u].t) {
+            cout << -1 << endl;
+            continue;
+        }
+        cout << a[G[u].n + k - 1] << endl;
+    }
+}
+
+int dfs(int id) {
+    int length = G[id].edge.size();
+    G[id].n = idx;
+    a[idx++] = id;
+    if (length == 0)
+        return G[id].t = 1;
+
+    int sum = 1;
+    rep(i, length)
+        sum += dfs(G[id].edge[i]->id);
+    G[id].t = sum;
+    return sum;
+}