text stringlengths 49 983k |
|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, f;
cin >> a >> b >> c >> d >> f;
int sum = a + b + c + d + f;
if (sum == 0)
cout << -1;
else if (sum % 5 == 0) {
cout << sum / 5;
} else
cout << -1;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int x, y, z, count = 0, a[100000];
for (y = 0; y < 5; y++) {
cin >> a[y];
count = count + a[y];
}
if (count % 5 == 0 && count != 0) {
cout << count / 5;
} else
cout << "-1";
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int a, b, c, d, e, X;
scanf("%d%d%d%d%d", &a, &b, &c, &d, &e);
X = a + b + c + d + e;
if (X > 0 && X % 5 == 0) {
printf("%d", X / 5);
} else {
printf("-1");
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int ar[5];
int sum = 0;
for (int i = 0; i < 5; i++) {
cin >> ar[i];
sum += ar[i];
}
if (sum % 5 == 0 && sum != 0) {
cout << sum / 5;
} else {
cout << "-1";
}
}
|
#include <bits/stdc++.h>
long long MM = 1000000007;
using namespace std;
long long gcd(long long a, long long b) {
if (a == 0 || b == 0) return abs(a - b);
long long res = a % b;
while (res) {
a = b;
b = res;
res = a % b;
}
return b;
}
long long lcm(long long a, long long b) { return a * b / gcd(a, b); }
long long max(long long a, long long b) {
if (a > b)
return a;
else
return b;
}
long long min(long long a, long long b) {
if (a < b)
return a;
else
return b;
}
long long numberofdiviser(long long a) {
long long ans = 0;
long long i;
for (i = 1; i * i < a; i++) {
if (a % i == 0) ans += 2;
}
if (i * i == a) ans++;
return ans;
}
void fival(long long* a, long long b, long long n) {
for (int i = 0; i < n; i++) {
a[i] = b;
}
}
long long sum, ans, l, r, x;
long long ss(vector<long long> a, vector<long long>& b, int ii) {
for (int i = ii; i < a.size(); i++) {
b.push_back(a[i]);
sum += a[i];
if (b.size() > 1 && sum >= l && sum <= r && b[b.size() - 1] - b[0] >= x)
ans++;
ss(a, b, i + 1);
sum -= b[b.size() - 1];
b.pop_back();
}
return ans;
}
unsigned long long fact(long long n) {
if (n == 0) return 1;
return n * fact(n - 1);
}
unsigned long long Combinations(unsigned long long n, unsigned long long r) {
if (r > n) return 0;
if (r * 2 > n) r = n - r;
if (r == 0) return 1;
unsigned long long res = n;
for (int i = 2; i <= r; ++i) {
res *= (n - i + 1);
res /= i;
}
return res;
}
long long pow(long long a, long long b, long long m) {
if (b == 0) return 1;
if (b == 1) return a;
long long x = pow(a, b / 2, m);
x = (x * x) % m;
if (b % 2) x = (x * a);
return x % m;
}
int solve() {
int x;
int sum = 0;
for (int i = 0; i < 5; i++) {
cin >> x;
sum += x;
}
if (sum % 5 == 0 && sum != 0)
cout << sum / 5;
else
cout << -1;
return 0;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t = 1;
while (t--) {
solve();
}
}
|
#include <bits/stdc++.h>
int main() {
int i, sum, x, s[1000];
scanf("%d", &s[0]);
sum = s[0];
for (i = 1; i < 5; i++) {
scanf("%d", &s[i]);
sum += s[i];
}
if (sum == 0)
printf("-1");
else if (sum % 5 == 0) {
x = sum / 5;
printf("%d", x);
} else
printf("-1");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a[10], sum = 0;
for (int i = 0; i < 5; i++) {
cin >> a[i];
sum += a[i];
}
if (sum % 5 != 0 || sum == 0)
cout << "-1";
else if (sum != 0)
cout << sum / 5;
}
|
#include <bits/stdc++.h>
int main() {
int i[5], a = 0, b;
for (int x = 0; x < 5; x++) scanf("%d", &i[x]);
for (int x = 0; x < 5; x++) a = a + i[x];
if (a < 5)
printf("-1");
else if (a % 5 == 0)
printf("%d", a / 5);
else
printf("-1");
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e;
scanf("%d%d%d%d%d", &a, &b, &c, &d, &e);
if ((a + b + c + d + e) % 5 == 0 && a + b + c + d + e >= 5)
printf("%d\n", (a + b + c + d + e) / 5);
else
printf("-1\n");
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int i, c, sum = 0;
for (i = 0; i < 5; i++) {
cin >> c;
sum += c;
}
if (sum % 5 || !sum)
cout << -1;
else
cout << sum / 5;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int x, s = 0, c = 5;
while (c--) {
cin >> x;
s += x;
}
if (s && s % 5 == 0)
cout << s / 5;
else
cout << "-1";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, a, b;
int main() {
for (int i = 1; i <= 5; i++) cin >> a, b += a;
if (b == 0)
cout << -1;
else if (b % 5 == 0)
cout << b / 5;
else
cout << -1;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int sum = 0;
int cur;
for (int i = 0; i < 5; ++i) {
cin >> cur;
sum += cur;
}
if (sum > 0 && sum % 5 == 0) {
cout << sum / 5 << endl;
} else {
cout << -1 << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, tong = 0, bien;
for (int i = 0; i < 5; i++) {
cin >> bien;
tong += bien;
}
if (tong % 5 == 0 && tong != 0)
cout << tong / 5;
else
cout << -1;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e;
cin >> a >> b >> c >> d >> e;
int sum = a + b + c + d + e;
if (sum % 5 != 0 || sum == 0)
cout << -1 << endl;
else
cout << sum / 5 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e;
cin >> a >> b >> c >> d >> e;
if (a == 0 && b == 0 && c == 0 && d == 0 && e == 0)
cout << -1;
else if ((a + b + c + d + e) % 5 != 0)
cout << -1;
else
cout << (a + b + c + d + e) / 5;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e;
cin >> a >> b >> c >> d >> e;
if (a == 0 && b == 0) {
cout << "-1";
return 0;
}
if ((a + b + c + d + e) % 5 == 0) {
cout << (a + b + c + d + e) / 5;
} else {
cout << "-1";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int x1, x2, x3, x4, x5, tot;
cin >> x1 >> x2 >> x3 >> x4 >> x5;
tot = x1 + x2 + x3 + x4 + x5;
if (tot == 0)
cout << -1;
else if (tot % 5 == 0)
cout << tot / 5;
else
cout << -1;
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int c1, c2, c3, c4, c5;
scanf("%d %d %d %d %d\n", &c1, &c2, &c3, &c4, &c5);
if (((c1 + c2 + c3 + c4 + c5) % 5) != 0 || (c1 + c2 + c3 + c4 + c5) == 0)
printf("-1\n");
else
printf("%d\n", ((c1 + c2 + c3 + c4 + c5) / 5));
}
|
#include <bits/stdc++.h>
using namespace std;
int x, s, n;
int main() {
for (int i = 1; i <= 5; i++) {
cin >> x;
s += x;
}
if (s % 5 == 0 && s != 0)
cout << s / 5;
else
cout << "-1";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int A[5];
int B[5];
int main() {
for (int i = 0; i < 5; ++i) scanf("%d", &A[i]);
if ((A[0] + A[1] + A[2] + A[3] + A[4]) % 5 != 0 ||
(A[0] + A[1] + A[2] + A[3] + A[4]) == 0) {
printf("-1");
return 0;
}
int x = (A[0] + A[1] + A[2] + A[3] + A[4]) / 5;
for (int i = 0; i < 5; ++i) B[i] = x - A[i];
if (B[0] + B[1] + B[2] + B[3] + B[4] == 0) {
printf("%d", x);
return 0;
} else {
printf("-1");
return 0;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long a[5], sum = 0;
for (int i = 0; i < 5; i++) {
cin >> a[i];
sum += a[i];
}
if (sum == 0) {
cout << -1;
} else if (sum % 5 == 0) {
cout << sum / 5;
} else {
cout << -1;
}
}
|
#include <bits/stdc++.h>
int main() {
int a, b, c, d, e, s;
scanf("%d%d%d%d%d", &a, &b, &c, &d, &e);
s = a + b + c + d + e;
if (s > 0 && s % 5 == 0) {
printf("%d", s / 5);
} else {
printf("-1");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c = 0;
int tmp = 0;
for (int i = 0; i < 5; i++) {
scanf("%d", &tmp);
c += tmp;
}
printf("%d\n", c == 0 || c % 5 != 0 ? -1 : c / 5);
}
|
#include <bits/stdc++.h>
using namespace std;
long long s;
long long temp;
int main() {
ios::sync_with_stdio(false);
int n = 5;
s = 0;
while (n--) {
cin >> temp;
s += temp;
}
if (s % 5 == 0 && s / 5 != 0) {
cout << s / 5;
} else {
cout << -1;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int A[6];
int main() {
int i, j, k, N, T, x, sum, b;
sum = 0;
for (i = 0; i < 5; i++) {
scanf("%d", &x);
sum += x;
}
b = sum / 5;
if (b <= 0 || sum % 5 != 0)
printf("-1");
else
printf("%d", b);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c1, c2, c3, c4, c5, sum;
cin >> c1 >> c2 >> c3 >> c4 >> c5;
sum = c1 + c2 + c3 + c4 + c5;
if (sum % 5 == 0 && sum != 0) {
cout << sum / 5 << endl;
} else
cout << "-1" << endl;
}
|
#include <bits/stdc++.h>
int main() {
int a[5], i, sum = 0;
for (i = 0; i < 5; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i < 5; i++) {
sum = sum + a[i];
}
if (sum % 5 == 0 && sum != 0)
printf("%d", (sum / 5));
else
printf("-1");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, sum;
sum = 0;
cin >> k;
sum += k;
cin >> k;
sum += k;
cin >> k;
sum += k;
cin >> k;
sum += k;
cin >> k;
sum += k;
if (sum % 5 == 0 && sum != 0)
cout << sum / 5 << endl;
else
cout << "-1" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long min(long long a, long long b) {
if (a <= b)
return a;
else
return b;
}
long long max(long long a, long long b) {
if (a >= b)
return a;
else
return b;
}
long long ceil(long long a, long long b) {
long long res = a / b;
if (res * b != a) res++;
return res;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int T = 1;
while (T--) {
vector<int> v(5);
int sum = 0;
for (int i = 0; i < 5; i++) {
cin >> v[i];
sum += v[i];
}
if (sum % 5 == 0 && sum / 5 > 0)
cout << sum / 5;
else
cout << -1;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a[5], sum = 0;
for (int i = 0; i < 5; i++) {
cin >> a[i];
sum += a[i];
}
if (sum % 5 == 0 && sum != 0)
cout << (sum / 5);
else
cout << -1;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c1, c2, c3, c4, c5;
cin >> c1 >> c2 >> c3 >> c4 >> c5;
int s = (c1 + c2 + c3 + c4 + c5) / 5;
if (5 * s == c1 + c2 + c3 + c4 + c5 && (c1 + c2 + c3 + c4 + c5) != 0)
cout << s;
else
cout << "-1";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e;
cin >> a >> b >> c >> d >> e;
int x = a + b + c + d + e;
if (x % 5 == 0 and x > 0) {
cout << x / 5 << endl;
} else {
cout << -1 << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
int s = 0;
for (int i = 0; i < 5; i++) {
int x;
cin >> x;
s += x;
}
if (s > 0 && s % 5 == 0)
cout << s / 5 << "\n";
else
cout << "-1\n";
}
int main() {
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b, c, d, e, f;
cin >> a >> b >> c >> d >> e;
long long ans;
f = a + b + c + d + e;
ans = (a + b + c + d + e) / 5;
if (f % 5 == 0 && f != 0) {
cout << ans << endl;
} else {
cout << -1 << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a[5];
int sum = 0;
for (int i = 0; i < 5; i++) {
cin >> a[i];
sum += a[i];
}
if (sum % 5 == 0 && sum != 0)
cout << sum / 5;
else
cout << -1;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, sum;
cin >> a >> b >> c >> d >> e;
sum = a + b + c + d + e;
if (sum % 5 == 0 && sum > 0) {
cout << sum / 5 << '\n';
} else
cout << "-1" << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool cek(int x) { return (0 <= x and x <= 100); }
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int a, b, c, d, e;
cin >> a >> b >> c >> d >> e;
int tot = a + b + c + d + e;
if (tot % 5 == 0 and tot != 0) {
cout << tot / 5 << endl;
} else
cout << -1 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c, sum = 0;
for (int i = 1; i <= 5; i++) {
cin >> c;
sum += c;
}
if (sum % 5 != 0 || sum == 0) {
cout << -1;
return 0;
}
cout << sum / 5;
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int a, i;
int m[10];
scanf("%d %d %d %d %d", &m[0], &m[1], &m[2], &m[3], &m[4]);
i = m[0] + m[1] + m[2] + m[3] + m[4];
if (i == 0)
printf("%d", -1);
else if (i % 5 == 0)
printf("%d", i / 5);
else
printf("%d", -1);
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int a, b, c, d, e;
scanf("%d %d %d %d %d", &a, &b, &c, &d, &e);
if ((a + b + c + d + e) % 5 != 0 || ((a + b + c + d + e) == 0)) {
printf("-1");
} else {
printf("%d", (a + b + c + d + e) / 5);
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c1, c2, c3, c4, c5, sum = 0;
cin >> c1 >> c2 >> c3 >> c4 >> c5;
sum += c1;
sum += c2;
sum += c3;
sum += c4;
sum += c5;
if (sum % 5 == 0 && sum > 0) {
cout << sum / 5;
} else {
cout << -1;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int sum = 0;
for (int val, i = 0; i != 5; ++i) {
cin >> val;
sum += val;
}
if (sum == 0) {
cout << "-1";
} else if (sum % 5 == 0) {
cout << sum / 5;
} else {
cout << "-1";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c[5];
int sum = 0;
for (int i = 0; i < 5; i++) {
cin >> c[i];
sum = sum + c[i];
}
if (sum % 5 == 0 && sum != 0)
cout << sum / 5 << "\n";
else
cout << -1 << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, sum = 0;
cin >> a >> b >> c >> d >> e;
sum = a + b + c + d + e;
if (sum % 5 == 0 && sum / 5 != 0) {
cout << sum / 5 << endl;
} else {
cout << "-1" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e, sum = 0;
cin >> a >> b >> c >> d >> e;
sum = a + b + c + d + e;
if (sum == 0) {
cout << "-1" << endl;
} else if (sum % 5 == 0) {
cout << sum / 5 << endl;
} else
cout << "-1" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c[5];
for (int i = 0; i < 5; i++) cin >> c[i];
if ((c[0] + c[1] + c[2] + c[3] + c[4]) % 5 ||
(c[0] + c[1] + c[2] + c[3] + c[4]) == 0)
cout << "-1";
else {
int avg = (c[0] + c[1] + c[2] + c[3] + c[4]) / 5, sum = 0;
for (int i = 0; i < 5; i++) sum += (c[i] - avg);
if (sum == 0)
cout << avg;
else
cout << "-1";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int c1, c2, c3, c4, c5, sum;
while (cin >> c1 >> c2 >> c3 >> c4 >> c5) {
sum = c1 + c2 + c3 + c4 + c5;
if (sum % 5 != 0 || sum == 0)
cout << "-1" << endl;
else
cout << sum / 5 << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int c, s;
int main() {
for (int i = 0; i < 5; i++) {
cin >> c;
s += c;
}
if (s % 5 == 0 && s != 0)
cout << s / 5;
else
cout << -1;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
n = 5;
long long sum = 0;
while (n) {
n--;
long long x;
cin >> x;
sum += x;
}
if (sum % 5 == 0 && sum != 0)
cout << sum / 5;
else
cout << -1;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int t, n, m, i, x, y, ans, sum;
long long int a, b, c, d, e;
cin >> a >> b >> c >> d >> e;
sum = (a + b + c + d + e);
if (sum == 0 or sum % 5 != 0)
cout << -1;
else
cout << sum / 5;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int c[5];
long long int i, ans = 0;
cin >> c[0] >> c[1] >> c[2] >> c[3] >> c[4];
int sum = c[0] + c[1] + c[2] + c[3] + c[4];
if (sum == 0)
cout << "-1" << endl;
else if (sum % 5 == 0)
cout << sum / 5 << endl;
else {
cout << "-1" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int x, i, s = 0;
for (i = 0; i < 5; i++) {
cin >> x;
s = s + x;
}
if (s % 5 == 0 && s != 0)
cout << s / 5;
else
cout << -1;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e;
cin >> a >> b >> c >> d >> e;
cout << ((a + b + c + d + e) % 5 == 0 && (a + b + c + d + e) != 0
? (a + b + c + d + e) / 5
: -1);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x = 0, a[10], i, j;
for (i = 0; i < 5; i++) scanf("%d", &a[i]);
for (i = 0; i < 5; i++) x = x + a[i];
if (x % 5 > 0 || x == 0)
printf("-1");
else
printf("%d", x / 5);
return 0;
}
|
#include <bits/stdc++.h>
void radix_sort(int a[], int n) {
int i, x[n + 1], m = 0, exp = 1;
for (i = 1; i <= n; i++)
if (a[i] > m) m = a[i];
while (m / exp > 0) {
int box[10] = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0};
for (i = 0; i < n; i++) box[a[i] / exp % 10]++;
for (i = 1; i < 10; i++) box[i] += box[i - 1];
for (i = n - 1; i >= 0; i--) {
x[--box[a[i] / exp % 10]] = a[i];
}
for (i = 0; i < n; i++) {
a[i] = x[i];
}
exp *= 10;
}
}
int h[200];
int aa[5];
int main() {
int t, w, i, m, p, j, s = 0, d;
int n = 5;
for (i = 0; i < n; i++) {
scanf("%d", &aa[i]);
s = s + aa[i];
}
if (s % 5 == 0 && s > 0)
printf("%d", s / 5);
else
printf("-1");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d, e;
cin >> a >> b >> c >> d >> e;
if ((a + b + c + d + e) % 5 || (a + b + c + d + e) == 0)
cout << -1;
else
cout << (a + b + c + d + e) / 5;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int i, a, sum = 0;
for (i = 0; i < 5; i++) {
scanf("%d", &a);
sum += a;
}
if (sum % 5 == 0 && sum != 0) {
printf("%d\n", sum / 5);
} else
printf("-1\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename T>
T ABS(const T& val) {
return val < 0 ? -val : val;
}
int main() {
std::ios_base::sync_with_stdio(false);
int c[5];
while (cin >> c[0] >> c[1] >> c[2] >> c[3] >> c[4]) {
int sum = 0;
for (int i = 0; i < 5; ++i) {
sum += c[i];
}
if (sum % 5 == 0 && sum / 5 != 0) {
cout << sum / 5 << "\n";
} else {
cout << -1 << "\n";
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int s = 0;
for (int i = 0; i < 5; i++) {
int x;
cin >> x;
s += x;
}
if (s % 5 || !s)
cout << "-1";
else
cout << s / 5;
}
|
#include <bits/stdc++.h>
using namespace std;
int32_t main() {
long long t = 1;
while (t--) {
long long sum = 0;
for (long long i = 0; i < 5; i++) {
long long c;
cin >> c;
sum += c;
}
if (sum % 5 != 0 || sum <= 0)
cout << "-1\n";
else
cout << sum / 5 << "\n";
}
}
|
#include <bits/stdc++.h>
int main() {
int a, b, c, d, e, sum;
scanf("%d %d %d %d %d", &a, &b, &c, &d, &e);
sum = a + b + c + d + e;
if (sum % 5 == 0 && sum != 0)
printf("%d", sum / 5);
else
printf("-1");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1005;
inline int read() {
int x = 0, w = 1;
char ch = 0;
while (ch < '0' || ch > '9') {
ch = getchar();
if (ch == '-') w = -1;
}
while (ch <= '9' && ch >= '0') {
x = (x << 1) + (x << 3) + ch - '0';
ch = getchar();
}
return x * w;
}
int n, m, tot, s[N], Ans;
int a[N], w[N], ans[N];
bool vis[N];
int main() {
n = read(), m = read();
for (int i = 1; i <= n; ++i) w[i] = read();
for (int i = 1; i <= m; ++i) {
a[i] = read();
memset(vis, 0, sizeof(vis));
for (int j = i - 1; j; --j) {
if (a[i] == a[j]) break;
if (vis[a[j]]) continue;
vis[a[j]] = 1;
Ans += w[a[j]];
}
}
printf("%d\n", Ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int w[505], b[1005], c[505];
bool vis[505];
int ss[505];
int main() {
int n, m, i, j;
cin >> n >> m;
for (i = 1; i <= n; i++) {
cin >> w[i];
}
for (j = 1; j <= m; j++) {
cin >> b[j];
}
int ret = 0, u = 0;
stack<int> st;
for (i = 1; i <= m; i++) {
stack<int> q;
while (q.size() != 0) q.pop();
while (st.size() != 0) {
int x = st.top();
st.pop();
if (x == b[i]) {
break;
}
q.push(x);
}
while (q.size() != 0) {
st.push(q.top());
ret += w[q.top()];
q.pop();
}
st.push(b[i]);
}
cout << ret << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, k;
int a[1111];
int bk[1111];
int used[1111];
int main() {
scanf("%d %d", &n, &k);
for (int i = 0; i < n; ++i) {
scanf("%d", &a[i]);
}
for (int i = 0; i < k; ++i) {
scanf("%d", &bk[i]);
}
int res = 0;
for (int i = k - 1; i >= 0; --i) {
memset(used, 0, sizeof(used));
for (int j = i - 1; j >= 0; --j) {
if (bk[i] == bk[j]) break;
if (!used[bk[j]]) {
res += a[bk[j] - 1];
used[bk[j]] = 1;
}
}
}
printf("%d\n", res);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m;
int w[500];
int b[1000];
bool seen[500];
int main() {
cin >> n >> m;
for (int i = 0; i < n; i++) cin >> w[i];
for (int i = 0; i < m; i++) {
cin >> b[i];
b[i]--;
}
int total = 0;
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) seen[j] = false;
for (int j = i + 1; (j < m) && (b[j] != b[i]); j++) {
if (seen[b[j]]) continue;
seen[b[j]] = true;
total += w[b[i]];
}
}
cout << total << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int w[510];
int mm[1010];
int a[510];
bool mark[510];
int main() {
int n, m;
cin >> n >> m;
for (int i = 1; i <= n; i++) {
cin >> w[i];
}
for (int i = 0; i < m; i++) {
cin >> mm[i];
}
int t = 0;
for (int i = 0; i < m; i++) {
for (int j = a[mm[i]]; j < i; j++) {
if (i > 0 && mark[mm[j]] == 0) {
t = t + w[mm[j]];
mark[mm[j]] = 1;
}
}
for (int k = 0; k < i; k++) {
mark[mm[k]] = 0;
}
a[mm[i]] = i + 1;
}
cout << t;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1005;
int N, M, W[MAXN], B[MAXN], res;
pair<int, int> P[MAXN];
int main() {
cin >> N >> M;
for (int i = 1; i <= N; i++) {
cin >> W[i];
P[i].first = MAXN;
P[i].second = i;
}
for (int i = 1; i <= M; i++) {
cin >> B[i];
if (P[B[i]].first == MAXN) P[B[i]].first = i;
}
sort(P + 1, P + N + 1);
for (int i = 1; i <= M; i++) {
for (int j = N; j > 1; j--) {
if (P[j].second != B[i]) continue;
swap(P[j - 1], P[j]);
res += W[P[j].second];
}
}
cout << res << '\n';
}
|
#include <bits/stdc++.h>
using namespace std;
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};
const int mod = 1000000007;
const double pi = (double)22 / 7;
int main() {
cin.tie(0);
std::ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<int> wight(n);
for (int i = 0; i < n; cin >> wight[i++])
;
vector<int> book(m);
for (int i = 0; i < m; cin >> book[i++])
;
map<int, bool> u;
vector<int> list;
for (int i = 0; i < m; i++) {
if (!u[book[i]]) {
u[book[i]] = 1;
list.push_back(book[i]);
}
}
int ans = 0;
for (int i = 0; i < m; i++) {
int j = 0;
while (list[j] != book[i]) {
ans += wight[list[j] - 1];
j++;
if (list[j] == book[i]) {
list.erase(list.begin() + j);
list.insert(list.begin(), book[i]);
break;
}
}
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline T POW(T B, T P) {
if (P == 0) return 1;
if (P & 1)
return B * POW(B, P - 1);
else
return SQR(POW(B, P / 2));
}
template <typename T>
inline T BigMod(T b, T p, T m) {
if (p == 0) return 1;
if (p % 2 == 0) {
T s = BigMod(b, p / 2, m);
return ((s % m) * (s % m)) % m;
}
return ((b % m) * (BigMod(b, p - 1, m) % m)) % m;
}
template <typename T>
inline T ModInv(T b, T m) {
return BigMod(b, m - 2, m);
}
template <typename T>
inline T ABS(T a) {
if (a < 0)
return -a;
else
return a;
}
template <typename T>
inline T gcd(T a, T b) {
if (a < 0) return gcd(-a, b);
if (b < 0) return gcd(a, -b);
return (b == 0) ? a : gcd(b, a % b);
}
template <typename T>
inline T lcm(T a, T b) {
if (a < 0) return lcm(-a, b);
if (b < 0) return lcm(a, -b);
return a * (b / gcd(a, b));
}
int arr[510], x, vis[1510], stk[1510];
int main() {
int n, m, i, j = 1000, top, res;
cin >> n >> m;
for (i = 1; i <= n; i++) {
cin >> arr[i];
}
int p = n, id;
top = 0, res = 0;
for (int k = 1; k <= m; k++) {
cin >> x;
if (vis[x]) {
for (int l = p; l < 1500; l++) {
if (stk[l] == x) {
id = l;
break;
}
}
for (int l = id; l > p + 1; l--) {
res += arr[stk[l - 1]];
swap(stk[l - 1], stk[l]);
}
} else {
stk[p--] = x;
res += top;
top += arr[x];
vis[x] = 1;
}
}
cout << res << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<bool> sieve(long long n) {
vector<bool> prime(n + 1, true);
prime[0] = prime[1] = false;
for (long long i = 2; i <= n; ++i) {
if (prime[i] && (i * i) <= n)
for (long long j = i * i; j <= n; j += i) prime[j] = false;
}
return prime;
}
long long power(long long a, long long b, long long m = 1000000007) {
a %= m;
long long res = 1;
while (b > 0) {
if (b & 1) res = res * a % m;
a = a * a % m;
b >>= 1;
}
return res;
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long n, m;
cin >> n >> m;
vector<long long> b(m);
map<long long, long long> wt;
for (long long i = 0; i < n; ++i) {
long long val;
cin >> val;
wt[i + 1] = val;
}
for (long long i = 0; i < m; ++i) cin >> b[i];
vector<long long> a, vis(n + 1, false);
for (long long i = 0; i < m; ++i) {
if (!vis[b[i]]) {
vis[b[i]] = 1;
a.push_back(b[i]);
long long len = a.size();
if (len == n) break;
}
}
long long res = 0;
for (long long i = 0; i < m; ++i) {
long long temp = 0;
long long idx = 0;
for (long long j = 0; j < n; ++j) {
if (a[j] == b[i]) {
idx = j;
break;
} else {
temp += wt[a[j]];
}
}
res += temp;
for (long long j = idx; j >= 1; --j) {
a[j] = a[j - 1];
}
a[0] = b[i];
}
cout << res << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int wg[502], mr[1003], n, i, j, m, sm = 0, vis[502];
cin >> n >> m;
for (i = 1; i <= n; i++) cin >> wg[i];
for (i = 1; i <= m; i++) cin >> mr[i];
for (i = 1; i <= m; i++) {
for (j = 1; j <= n; j++) vis[j] = 0;
for (j = i - 1; j >= 1 && mr[j] != mr[i]; j--) {
if (vis[mr[j]] == 0) {
vis[mr[j]] = 1;
sm += wg[mr[j]];
}
}
}
cout << sm;
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int n, m;
std::cin >> n >> m;
std::vector<int> w(n);
std::vector<int> b(m);
std::vector<std::vector<int> > above(n);
std::vector<int> above_sum(n);
bool is_above[n][n];
for (int i = 0; i < n; ++i) {
above_sum[i] = 0;
std::cin >> w[i];
for (int j = 0; j < n; ++j) {
is_above[i][j] = false;
}
}
for (int i = 0; i < m; ++i) {
std::cin >> b[i];
}
int ttl = 0;
for (auto it : b) {
int i = it - 1;
ttl += above_sum[i];
above_sum[i] = 0;
for (int j = 0; j < n; ++j) {
if (j == i) continue;
is_above[j][i] = false;
if (!is_above[i][j]) {
is_above[i][j] = true;
above_sum[j] += w[i];
}
}
}
std::cout << ttl << std::endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MaxN = 2000;
int b[MaxN];
int w[MaxN];
int n, m;
bool f[MaxN];
int s[MaxN], top = 0;
int main(void) {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; ++i) scanf("%d", w + i);
for (int i = 1; i <= m; ++i) scanf("%d", b + i);
for (int i = 1; i <= m; ++i) {
if (!f[b[i]]) s[top++] = b[i];
f[b[i]] = true;
}
reverse(s, s + top);
long long ans = 0;
for (int i = 1; i <= m; ++i) {
long long temp = 0;
int j;
for (j = top - 1; j >= 0; --j) {
if (b[i] == s[j]) break;
temp += w[s[j]];
}
for (int k = j; k < top - 1; ++k) s[k] = s[k + 1];
s[top - 1] = b[i];
ans += temp;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = (int)1e9 + 10;
const int MOD = (int)1e9 + 7;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
set<int> s;
vector<int> lift;
int n, m, ans = 0;
cin >> n >> m;
vector<int> weight(n), days(m);
for (int i = 0; i < n; i++) cin >> weight[i];
for (int i = 0; i < m; i++) cin >> days[i];
stack<int> revOrder, order;
for (int i = 0; i < m; i++) {
if (s.count(days[i])) continue;
revOrder.push(days[i]);
s.insert(days[i]);
}
while (revOrder.size()) order.push(revOrder.top()), revOrder.pop();
for (int i = 0; i < m; i++) {
while (order.top() != days[i])
lift.push_back(order.top()), ans += weight[order.top() - 1], order.pop();
order.pop();
for (int i = lift.size() - 1; i >= 0; i--) order.push(lift[i]);
order.push(days[i]);
lift.clear();
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0)->sync_with_stdio(0);
cin.exceptions(ios::badbit | ios::failbit);
int n, m;
cin >> n >> m;
vector<int> w(n);
for (auto i = 0; i < n; ++i) {
cin >> w[i];
}
vector<int> lp(n, -1), a(m);
int res = 0;
for (auto i = 0; i < m; ++i) {
cin >> a[i], --a[i];
vector<int> added(n);
for (auto t = lp[a[i]] + 1; t < i; ++t) {
if (!added[a[t]]) {
added[a[t]] = true;
res += w[a[t]];
}
}
lp[a[i]] = i;
}
cout << res << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> w, b;
int cur;
for (int i = 0; i < n; i++) {
cin >> cur;
w.push_back(cur);
}
for (int i = 0; i < m; i++) {
cin >> cur;
b.push_back(cur);
}
vector<int> used(n + 2, -1);
vector<int> st;
for (int i = 0; i < m; i++) {
if (used[b[i]] == -1) {
st.push_back(b[i]);
used[b[i]] = st.size() - 1;
}
}
int sum = 0;
for (int i = 0; i < m; i++) {
for (int j = 0; j < used[b[i]]; j++) {
sum += w[st[j] - 1];
used[st[j]]++;
}
st.erase(st.begin() + used[b[i]]);
st.insert(st.begin(), b[i]);
used[b[i]] = 0;
}
cout << sum << endl;
return 0;
}
|
#include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
using namespace std;
template <class T1, class T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
os << "{" << p.first << "," << p.second << "}";
return os;
}
const int N = 3e5 + 5;
const int oo = 1e9 + 7;
int a[N];
int w[N];
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, m;
cin >> n >> m;
int sz = 0;
int ans = 0;
for (int i = 1; i <= n; i++) cin >> w[i];
while (m--) {
int b;
cin >> b;
int idx = 0;
for (int i = 1; i <= sz; i++) {
if (a[i] == b) {
idx = i;
break;
}
}
for (int i = idx + 1; i <= sz; i++) ans += w[a[i]];
if (idx != 0) {
for (int i = idx; i < sz; i++) a[i] = a[i + 1];
sz--;
}
a[++sz] = b;
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 504;
const int M = 1001;
int n, m;
int w[N];
int arr[M];
int order[N];
bool mark[N] = {0};
int cur = 0;
int ans = 0;
int main(void) {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; ++i) scanf("%d ", &w[i]);
for (int i = 1; i <= m; ++i) {
scanf("%d", &arr[i]);
if (!mark[arr[i]]) {
order[++cur] = arr[i];
mark[arr[i]] = 1;
}
}
for (int i = 1; i <= m; ++i) {
for (int j = 1; j <= cur; ++j) {
if (order[j] == arr[i]) {
int k = j - 1;
while (k >= 1) {
swap(order[k], order[k + 1]);
k--;
}
break;
} else {
ans += w[order[j]];
}
}
}
printf("%d", ans);
}
|
#include <bits/stdc++.h>
using namespace std;
inline int read() {
int x = 0, k = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-') k = -1;
c = getchar();
}
while (c >= '0' && c <= '9')
x = (x << 3) + (x << 1) + (c ^ 48), c = getchar();
return x * k;
}
int w[505], n, cnt, b[505], ans = (1 << 30), m, ed[1005];
bool use[505];
inline int work() {
int t = 0;
for (int i = 2; i <= m; i++) {
for (int j = 1; j <= n; j++) {
if (b[j] == ed[i]) {
for (int k = j - 1; k; k--) {
t += w[b[k]];
b[k + 1] = b[k];
}
b[1] = ed[i];
break;
}
}
}
return t;
}
int main() {
n = read(), m = read();
for (int i = 1; i <= n; i++) {
w[i] = read();
}
for (int i = 1; i <= m; i++) {
ed[i] = read();
if (!use[ed[i]]) {
use[ed[i]] = 1;
b[++cnt] = ed[i];
}
}
printf("%d", work());
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int d[2100], l[2000], vi[2000], cc[2000], cnt;
int main() {
int n, t, i, j, k, m;
scanf("%d%d", &n, &m);
for (i = 1; i <= n; ++i) scanf("%d", &d[i]);
for (i = 0; i < m; ++i) scanf("%d", &l[i]);
for (i = 0; i < m; ++i) {
if (vi[l[i]] == 0) {
vi[l[i]]++;
cc[cnt++] = l[i];
}
}
int sum = 0, z = 0;
for (i = 0; i < m; ++i) {
z = 0;
for (j = 0; j < cnt; ++j) {
if (cc[j] == l[i]) break;
z += d[cc[j]];
}
sum += z;
for (k = j; k > 0; --k) cc[k] = cc[k - 1];
cc[0] = l[i];
}
cout << sum << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N_ = 505, M_ = 1050;
int N, M;
int W[N_], D[M_];
bool used[N_];
int pile[N_], pile_n;
int ans;
int main() {
scanf("%d%d", &N, &M);
for (int i = 1; i <= N; i++) {
scanf("%d", &W[i]);
}
for (int i = 1; i <= M; i++) {
scanf("%d", &D[i]);
if (!used[D[i]]) pile[++pile_n] = D[i], used[D[i]] = true;
}
for (int i = 1; i <= N; i++)
if (!used[i]) pile[++pile_n] = i;
for (int i = 1; i <= M; i++) {
for (int j = 1; j <= N; j++) {
if (pile[j] == D[i]) {
for (int k = j; k > 1; k--) pile[k] = pile[k - 1];
pile[1] = D[i];
break;
}
ans += W[pile[j]];
}
}
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAX = 1e3 + 10;
const int MOD = 1e9 + 7;
stack<int> a, bb, mm;
int w[MAX], b[MAX], vis[MAX];
int main() {
int n, m;
while (scanf("%d %d", &n, &m) == 2) {
memset(vis, 0, sizeof(vis));
for (int i = 1; i <= n; i++) {
scanf("%d", &w[i]);
}
for (int i = 1; i <= m; i++) {
scanf("%d", &b[i]);
}
int cnt = 0;
for (int i = 1; i <= m; i++) {
if (!vis[b[i]]) {
vis[b[i]] = 1;
cnt++;
mm.push(b[i]);
}
if (cnt == n) break;
}
if (cnt < n) {
for (int i = 1; i <= n; i++) {
if (!vis[i]) mm.push(i);
}
}
while (!mm.empty()) {
int x = mm.top();
mm.pop();
a.push(x);
}
int res = 0;
for (int i = 1; i <= m; i++) {
while (true) {
int x = a.top();
a.pop();
if (x == b[i]) break;
bb.push(x);
res += w[x];
}
while (!bb.empty()) {
int x = bb.top();
bb.pop();
a.push(x);
}
a.push(b[i]);
}
printf("%d\n", res);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename T>
T Abs(T first) {
return (first < 0 ? -first : first);
}
template <typename T>
T Sqr(T first) {
return (first * first);
}
string plural(string s) {
return (int((s).size()) && s[int((s).size()) - 1] == 'x' ? s + "en"
: s + "s");
}
const int INF = (int)1e9;
const long double EPS = 1e-9;
const long double PI = acos(-1.0);
bool Read(int &first) {
char c, r = 0, n = 0;
first = 0;
for (;;) {
c = getchar();
if ((c < 0) && (!r)) return (0);
if ((c == '-') && (!r))
n = 1;
else if ((c >= '0') && (c <= '9'))
first = first * 10 + c - '0', r = 1;
else if (r)
break;
}
if (n) first = -first;
return (1);
}
bool ReadLL(long long &first) {
char c, r = 0, n = 0;
first = 0;
for (;;) {
c = getchar();
if ((c < 0) && (!r)) return (0);
if ((c == '-') && (!r))
n = 1;
else if ((c >= '0') && (c <= '9'))
first = first * 10 + c - '0', r = 1;
else if (r)
break;
}
if (n) first = -first;
return (1);
}
int main() {
if (0) freopen("in.txt", "r", stdin);
int N, M;
int i, j, k, c;
static int V[1005], ord[1005], ind[1005];
static pair<int, int> P[1005];
stack<int> S, S2;
Read(N), Read(M);
for (i = 0; i < N; i++) Read(V[i]);
memset(ind, 60, sizeof(ind));
for (i = 0; i < M; i++) {
Read(ord[i]), ord[i]--;
ind[ord[i]] = min(ind[ord[i]], i);
}
for (i = 0; i < N; i++) P[i] = make_pair(ind[i], i);
sort(P, P + N);
for (i = (N)-1; i >= 0; i--) S.push(P[i].second);
long long ans = 0;
for (i = 0; i < M; i++) {
j = ord[i];
while (S.top() != j) ans += V[S.top()], S2.push(S.top()), S.pop();
S.pop();
while (!S2.empty()) S.push(S2.top()), S2.pop();
S.push(j);
}
cout << ans << endl;
return (0);
}
|
#include <bits/stdc++.h>
using namespace std;
const int kMaxN = 505;
const int kMaxM = 1005;
int n, m;
int w[kMaxN];
int b[kMaxM];
int order[kMaxN];
int lastPos[kMaxN];
int solve() {
int res = 0;
int cnt = 0;
int sum_w = 0;
memset(lastPos, -1, sizeof(lastPos));
for (int i = 0; i < (m); ++i) {
int cur_book = b[i];
if (lastPos[cur_book] == -1) {
res += sum_w;
lastPos[cur_book] = cnt;
order[cnt] = cur_book;
++cnt;
sum_w += w[cur_book];
} else {
int add = 0;
for (int j = lastPos[cur_book] + 1; j < cnt; ++j) {
add += w[order[j]];
order[j - 1] = order[j];
lastPos[order[j]] = j - 1;
}
res += add;
order[cnt - 1] = cur_book;
lastPos[cur_book] = cnt - 1;
}
}
return res;
}
int main() {
cin >> n >> m;
for (int i = 0; i < (n); ++i) {
cin >> w[i];
}
for (int i = 0; i < (m); ++i) {
cin >> b[i];
--b[i];
}
cout << solve() << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m, w[600], a[1200], k[600], q[600], u[600], qs, ans;
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) scanf("%d", w + i);
for (int i = 1; i <= m; i++) {
scanf("%d", a + i);
if (!u[a[i]]) q[++qs] = a[i], u[a[i]] = 1;
}
for (int i = 1; i <= m; i++) {
int s = 1, l = a[i];
while (q[s] != a[i]) {
k[q[s]]++;
swap(l, q[s]);
s++;
}
q[s] = l;
}
for (int i = 1; i <= n; i++) ans += k[i] * w[i];
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m;
int w[1005];
int b[1005];
vector<int> vec;
int pos[1005];
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; ++i) scanf("%d", &w[i]);
for (int i = 1; i <= m; ++i) scanf("%d", &b[i]);
for (int i = 1; i <= m; ++i) {
if (!pos[b[i]]) {
vec.push_back(b[i]);
pos[b[i]] = vec.size();
}
}
int ans = 0;
for (int i = 1; i <= m; ++i) {
int p = pos[b[i]] - 1;
for (int j = 0; j < p; ++j) ans += w[vec[j]];
for (int j = p - 1; j >= 0; --j) {
vec[j + 1] = vec[j];
pos[vec[j]]++;
}
vec[0] = b[i];
pos[vec[0]] = 1;
}
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
long long MOD = 1000000007;
using namespace std;
bool sortbysec(const pair<long long, long long> &a,
const pair<long long, long long> &b) {
return (a.second < b.second);
}
long long POW(long long a, long long b) {
if (b == 0) return 1;
if (b == 1) return a % MOD;
long long temp = POW(a, b / 2);
if (b % 2 == 0)
return (temp * temp) % MOD;
else
return (((temp * temp) % MOD) * a) % MOD;
}
vector<char> capl = {'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I',
'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R',
'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z'};
vector<char> sml = {'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i',
'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r',
's', 't', 'u', 'v', 'w', 'x', 'y', 'z'};
int main() {
int n, m;
cin >> n >> m;
int w[n], a[m];
deque<int> d1, d2;
map<int, int> m1;
for (int i = 0; i < n; i++) {
cin >> w[i];
}
for (int i = 0; i < m; i++) {
cin >> a[i];
if (m1[a[i]] == 0) {
d1.push_back(a[i]);
}
m1[a[i]]++;
}
int c, sum = 0;
for (int i = 0; i < m; i++) {
while (!d1.empty()) {
c = d1.front();
if (d1.front() == a[i]) {
d1.pop_front();
break;
} else {
sum += w[c - 1];
d2.push_back(c);
d1.pop_front();
}
}
while (!d2.empty()) {
d1.push_front(d2.back());
d2.pop_back();
}
d1.push_front(c);
}
cout << sum;
}
|
#include <bits/stdc++.h>
using namespace std;
void err(istream_iterator<string> it) {}
template <typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
cout << *it << " = " << a << endl;
err(++it, args...);
}
const int mod = 1e9 + 7;
vector<int> freq(501, 0), w(501);
void solve() {
int n, m;
cin >> n >> m;
int b[m + 1];
for (int i = 1; i <= n; i++) cin >> w[i];
for (int i = 1; i <= m; i++) {
cin >> b[i];
freq[b[i]]++;
}
vector<int> cnt(n + 1, 0);
vector<int> temp;
for (int i = 1; i <= m; i++) {
if (cnt[b[i]] == 0) {
temp.push_back(b[i]);
cnt[b[i]]++;
}
}
int len = ((int)(temp).size()), ans = 0;
for (int i = 1; i <= m; i++) {
int ind;
for (int j = 0; j < len; j++) {
if (temp[j] == b[i]) {
ind = j;
break;
}
}
int x = temp[ind];
for (int j = ind - 1; j >= 0; j--) {
ans += w[temp[j]];
temp[j + 1] = temp[j];
}
temp[0] = x;
}
cout << ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
;
solve();
}
|
#include <bits/stdc++.h>
using namespace std;
int w[550];
int f[1005], flag[550];
int main() {
int n, m, i;
while (scanf("%d%d", &n, &m) != EOF) {
for (i = 1; i <= n; i++) scanf("%d", &w[i]);
memset(flag, 0, sizeof(flag));
queue<int> q, Q;
for (i = 0; i < m; i++) {
scanf("%d", &f[i]);
if (!flag[f[i]]) {
q.push(f[i]);
flag[f[i]] = 1;
}
}
int sum = 0;
int a, b;
for (i = 0; i < m; i++) {
int p = 0;
while (!q.empty()) {
a = q.front();
if (a == f[i]) {
p = 1;
b = a;
} else {
Q.push(a);
if (!p) sum += w[a];
}
q.pop();
}
q.push(b);
while (!Q.empty()) {
b = Q.front();
Q.pop();
q.push(b);
}
}
cout << sum << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
ifstream fin("frac1.in");
ofstream fout("frac1.out");
class compare : public std::binary_function<double, double, bool> {
public:
compare(double arg = 1e-7) : e(arg) {}
bool operator()(const double &left, const double &right) const {
return (abs(left - right) > e) && (left < right);
}
double e;
};
inline int d_compare(double x, double y) {
return (fabs(x - y) <= 1e-7) ? 0 : (x > y) ? 1 : -1;
}
inline int mod(long long x, int y) {
if (y == 0) return x;
if (x < 0) x = -x;
if (x >= y) x %= y;
return x;
}
inline int cmod(int x, int y) {
if (y == 0) return x;
if (x < 0) x += (abs(x) / y + 1) * y;
if (x >= y) x = x % y;
return x;
}
int Bcount(int mask) {
int n = 0;
while (mask) n += ((mask & -mask) != 0), mask &= ~(mask & -mask);
return n;
}
inline bool Bstate(int mask, int idx) { return (mask & (1 << idx)); }
inline int B1(int mask, int idx) { return mask | (1 << idx); }
inline int B0(int mask, int idx) { return mask & ~(1 << idx); }
inline int drift(int mask, int n) { return mask & ((1 << n) - 1); }
void debugmask(int mask, int n) {
for (int i = 0; i < n; i++) cout << Bstate(mask, i);
}
int dr[4] = {0, 0, -1, 1}, dc[4] = {-1, 1, 0, 0};
template <typename Ty>
void clear(Ty &q) {
Ty empty;
swap(q, empty);
}
int main() {
deque<int> s;
stack<int> temp;
int n, m;
int w[501];
int vis[501] = {0};
int o[1001];
cin >> n >> m;
for (int i = 0; i < n; i++) cin >> w[i + 1];
for (int i = 0; i < m; i++) {
cin >> o[i];
if (!vis[o[i]]) s.push_back(o[i]), vis[o[i]] = 1;
}
int ans = 0;
for (int i = 0; i < m; i++) {
while (s.front() != o[i]) {
ans += w[s.front()];
temp.push(s.front());
s.pop_front();
}
s.pop_front();
while (!temp.empty()) {
s.push_front(temp.top());
temp.pop();
}
s.push_front(o[i]);
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int NMAX = 505;
int n, m, cost[NMAX], b[NMAX * 2], perm[NMAX];
bitset<NMAX> viz;
long long sol;
int main() {
int i, j, aux, poz;
cin.sync_with_stdio(false);
cin >> n >> m;
for (i = 1; i <= n; i++) cin >> cost[i];
for (i = 1; i <= m; i++) {
cin >> b[i];
if (!viz[b[i]]) {
viz[b[i]] = 1;
perm[++perm[0]] = b[i];
}
}
aux = perm[0] / 2;
for (i = 1; i <= aux; i++) swap(perm[i], perm[perm[0] - i + 1]);
for (i = 1; i <= m; i++) {
for (j = 1; j <= perm[0]; j++)
if (perm[j] == b[i]) {
poz = j;
j = m + 1;
}
for (j = poz + 1; j <= perm[0]; j++) {
sol += cost[perm[j]];
swap(perm[j], perm[j - 1]);
}
}
cout << sol << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int w[n];
int b[m];
for (int i = 0; i < n; i++) cin >> w[i];
for (int i = 0; i < m; i++) {
cin >> b[i];
b[i]--;
}
int ans = 0;
for (int t = 0; t < n; t++) {
int tmp[n];
for (int ii = 0; ii < n; ii++) tmp[ii] = 0;
for (int i = 0; i < m; i++) {
if (b[i] == t) {
for (int ii = 0; ii < n; ii++) {
ans += tmp[ii] * w[ii];
}
for (int ii = 0; ii < n; ii++) tmp[ii] = 0;
} else {
tmp[b[i]] = 1;
}
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int n, m;
while (scanf("%d %d", &n, &m) == 2) {
int w[n + 1], b[m + 1], c[m + 1];
w[0] = 0;
b[0] = 0;
for (int i = 1; i < n + 1; i++) {
scanf("%d", &w[i]);
}
for (int i = 1; i < m + 1; i++) {
scanf("%d", &b[i]);
c[i] = b[i];
}
int cnt = 1;
long long int ans = 0;
for (int i = 1; i < m + 1; i++) {
int j;
for (j = 1; j < i; j++) {
if (c[i] == c[j]) {
break;
}
}
if (j == i) {
c[cnt] = c[i];
cnt++;
}
}
for (int i = 1; i < m + 1; i++)
for (int j = 1; j < cnt; j++) {
if (b[i] == c[j]) {
for (int p = 1; p < j; p++) {
ans = ans + (long long int)w[c[p]];
}
for (int p = j; p > 0; p--) {
c[p] = c[p - 1];
}
c[1] = b[i];
break;
}
}
printf("%lld\n", ans);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m, i, j, w[505], v, h, b[1005], mark[505], ans, size;
pair<int, int> a[505];
int max(int a, int b) {
if (a > b) return a;
return b;
}
int min(int a, int b) {
if (b < a) return b;
return a;
}
int main() {
cin >> n >> m;
for (i = 1; i <= n; i++) cin >> w[i];
for (i = 1; i <= m; i++) {
cin >> b[i];
if (size < n && mark[b[i]] == 0) {
mark[b[i]] = 1;
a[++size] = make_pair(b[i], w[b[i]]);
}
}
for (i = 1; i <= m; i++) {
for (j = 1; j <= n; j++) {
if (a[j].first == b[i]) {
h = j;
break;
}
ans += a[j].second;
}
for (j = h; j >= 2; j--) a[j] = a[j - 1];
a[1] = make_pair(b[i], w[b[i]]);
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[1008], b[1008], vis[1008];
int main() {
int t, m, n, i, j, k, l;
scanf("%d", &n);
scanf("%d", &m);
memset(vis, 0, sizeof(vis));
a[0] = 0;
for (i = 1; i <= n; i++) scanf("%d", &a[i]);
vector<int> v;
v.clear();
for (i = 1; i <= m; i++) {
scanf("%d", &b[i]);
j = b[i];
if (!vis[j]) v.push_back(j);
vis[j] = 1;
}
long long ans = 0;
for (i = 1; i <= n; i++) {
if (!vis[i]) v.push_back(i);
}
vector<int> vv;
for (i = v.size() - 1; i >= 0; i--) vv.push_back(v[i]);
v = vv;
for (i = 1; i <= m; i++) {
k = b[i];
for (j = v.size() - 1; j >= 0; j--) {
if (v[j] == k) break;
ans += a[v[j]];
}
v[j] = 0;
v.push_back(k);
}
cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(NULL);
ios::sync_with_stdio(false);
long long int n, m, i, j, k, ans = 0;
cin >> n >> m;
long long int A[n], B[m];
string str(500, '0');
for (i = 0; i < n; i++) cin >> A[i];
for (i = 0; i < m; i++) {
cin >> k;
k--;
B[i] = k;
}
for (i = 0; i < m; i++) {
j = i - 1;
str = string(500, '0');
while (j >= 0 && B[j] != B[i]) {
if (str[B[j]] != '1') {
ans += A[B[j]];
str[B[j]] = '1';
}
j--;
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
int c;
while (a != 0) {
c = a;
a = b % a;
b = c;
}
return b;
}
bool isPrime[100000 + 5];
vector<long long> seieve(long long maxPrime) {
vector<long long> primes;
for (long long i = 0; i <= maxPrime; i++) {
isPrime[i] = true;
}
isPrime[1] = false;
for (long long i = 2; i <= maxPrime; i++) {
if (isPrime[i]) {
primes.push_back(i);
for (long long j = 2; j * i <= maxPrime; j++) {
isPrime[i * j] = false;
}
}
}
return primes;
}
int w[505], b[1005];
int main() {
ios_base::sync_with_stdio(false);
int n, m;
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> w[i];
}
for (int i = 0; i < m; i++) {
cin >> b[i];
}
int tong = 0;
map<int, int> check;
for (int i = m - 1; i >= 0; i--) {
check.clear();
for (int j = i - 1; j >= 0; j--) {
if (b[i] == b[j]) break;
if (check.count(b[j]) == 0) {
tong += w[b[j] - 1];
check[b[j]] = 1;
}
}
}
cout << tong << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1000 + 5;
int n, m, cnt, w[N], a[N], tmp[N], p[N][N];
bool check[N], taken[N];
void Input() {
cin >> n >> m;
for (int i = 1; i <= n; i++) cin >> w[i];
for (int i = 1; i <= m; i++) cin >> a[i];
}
void another_one() {
cnt++;
for (int i = 1; i <= n; i++) p[cnt][i] = tmp[i];
}
void get_permutation(int k) {
if (k > n) {
another_one();
return;
}
for (int i = 1; i <= n; i++) {
if (check[i] == false) {
check[i] = true, tmp[k] = i;
get_permutation(k + 1);
check[i] = false;
}
}
}
void Get() {
for (int i = 1; i <= m; i++) {
if (!taken[a[i]]) {
cnt++, tmp[cnt] = a[i];
taken[a[i]] = true;
}
}
}
void Solve() {
int res = 0;
for (int j = 1; j <= m; j++) {
int sum = 0;
for (int temp = 1; temp <= n; temp++) {
if (tmp[temp] == a[j]) {
int root = tmp[temp];
for (int k = temp; k > 1; k--) tmp[k] = tmp[k - 1];
tmp[1] = root, res += sum;
break;
} else
sum += w[tmp[temp]];
}
}
cout << res << '\n';
}
int main() {
Input();
Get();
Solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[505], b[5005];
int use[505];
int main() {
int i, j, s, n, t;
cin >> n >> t;
for (i = 1; i <= n; i++) scanf("%d", &a[i]);
s = 0;
for (i = 1; i <= t; i++) {
scanf("%d", &b[i]);
memset(use, 0, sizeof(use));
for (j = i - 1; j >= 1; j--) {
if (b[i] == b[j]) break;
}
j++;
for (j; j < i; j++) {
if (!use[b[j]]) {
s += a[b[j]];
use[b[j]] = 1;
}
}
}
cout << s << endl;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.