text stringlengths 49 983k |
|---|
#include <bits/stdc++.h>
using namespace std;
const int M = 200005;
int w[M], n, m, ans, sum, bk[M];
bool vis[M];
int main() {
ios::sync_with_stdio(0);
cout.tie(0);
cin.tie(0);
cin >> n >> m;
for (int i = 1; i <= n; ++i) {
cin >> w[i];
}
for (int i = 1; i <= m; ++i) {
cin >> bk[i];
for (int j = i - 1; j >= 1; --j) {
if (bk[j] == bk[i]) {
for (int w = i - 1; w >= j; --w) vis[bk[w]] = 0;
break;
}
if (!vis[bk[j]]) sum += w[bk[j]];
vis[bk[j]] = 1;
if (j == 1) {
for (int w = i - 1; w >= j; --w) vis[bk[w]] = 0;
}
}
}
cout << sum << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1009;
int w[maxn], b[maxn], a[maxn], flag[maxn], n, m, top, p, 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", &b[i]);
if (!flag[b[i]]) a[++top] = b[i];
flag[b[i]] = 1;
}
for (int i = 1; i <= m; i++) {
p = 1;
while (a[p] != b[i]) {
ans += w[a[p]];
p++;
}
while (p >= 2) {
swap(a[p], a[p - 1]);
p--;
}
}
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int DIM = 1005;
bitset<DIM> oki;
int val[DIM], nxt[DIM];
int main(void) {
ios ::sync_with_stdio(false);
cin.tie();
cout.tie();
int n, m, ans = 0;
cin >> n >> m;
for (int i = 1; i <= n; ++i) cin >> val[i], nxt[i] = -1;
for (int i = 1; i <= m; ++i) {
int x;
cin >> x;
for (int j = 1; j <= n; ++j)
if (nxt[x] < nxt[j]) ans += val[j];
nxt[x] = i;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int w[505];
bool first[505];
int up[505];
int down[505];
int n, m;
cin >> n >> m;
for (int i = 1; i <= n; i++) {
cin >> w[i];
first[i] = true;
up[i] = -1;
down[i] = -1;
}
int b;
int ans = 0;
int totCarry = 0;
int top = -1;
for (int i = 0; i < m; i++) {
cin >> b;
if (first[b]) {
ans += totCarry;
totCarry += w[b];
first[b] = false;
} else {
int j = up[b];
while (j != -1) {
ans += w[j];
j = up[j];
}
if (up[b] != -1) {
if (down[b] != -1) up[down[b]] = up[b];
down[up[b]] = down[b];
}
}
if (top != -1 && top != b) {
up[top] = b;
down[b] = top;
}
top = b;
up[top] = -1;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int t[100100];
vector<int> Per;
void build(int a[], int v, int tl, int tr) {
if (tl == tr)
t[v] = a[Per[tl]];
else {
int tm = (tl + tr) / 2;
build(a, v * 2, tl, tm);
build(a, v * 2 + 1, tm + 1, tr);
t[v] = t[v * 2] + t[v * 2 + 1];
}
}
int sum(int v, int tl, int tr, int l, int r) {
if (l > r) return 0;
if (l == tl && r == tr) return t[v];
int tm = (tl + tr) / 2;
return sum(v * 2, tl, tm, l, min(r, tm)) +
sum(v * 2 + 1, tm + 1, tr, max(l, tm + 1), r);
}
void update(int v, int tl, int tr, int pos, int new_val) {
if (tl == tr)
t[v] = new_val;
else {
int tm = (tl + tr) / 2;
if (pos <= tm)
update(v * 2, tl, tm, pos, new_val);
else
update(v * 2 + 1, tm + 1, tr, pos, new_val);
t[v] = t[v * 2] + t[v * 2 + 1];
}
}
int w[1000];
bool f[1000];
set<int> S;
vector<int> C;
int main() {
int n, m, i, j;
scanf("%d%d", &n, &m);
for (i = 0; i <= n; ++i) f[i] = false;
for (i = 0; i < n; ++i) {
scanf("%d", &w[i]);
S.insert(i);
}
for (j = 1; j <= m; ++j) {
scanf("%d", &i);
if (f[i - 1] == false) {
Per.push_back(i - 1);
f[i - 1] = true;
}
C.push_back(i - 1);
}
while (S.size()) {
j = *S.begin();
if (!f[j]) Per.push_back(j);
S.erase(j);
}
build(w, 1, 0, n - 1);
int sc = 0;
reverse(C.begin(), C.end());
while (C.size()) {
for (i = 0; i < n; ++i)
if (Per[i] == C[C.size() - 1]) break;
if (i != 0) {
for (j = 0; j < i; ++j) sc += w[Per[j]];
while (i > 0) {
swap(Per[i], Per[i - 1]);
i--;
}
}
C.pop_back();
}
printf("%d", sc);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
while (cin >> a >> b) {
int A[1204] = {};
for (int i = 1; i <= a; i++) {
cin >> A[i];
}
int B[1024] = {};
for (int i = 1; i <= b; i++) {
cin >> B[i];
}
int vis[1024] = {};
vector<int> num;
for (int i = 1; i <= b; i++) {
if (!vis[B[i]]) {
vis[B[i]] = 1;
num.push_back(B[i]);
}
}
int ans = 0;
for (int i = 1; i <= b; i++) {
int sum = 0;
for (int j = 0; j < num.size(); j++) {
int k = num[j];
if (k == B[i]) {
ans += sum;
num.erase(num.begin() + j);
num.insert(num.begin(), B[i]);
break;
}
sum += A[k];
}
}
cout << ans << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int n, m, wt[505], ord[505], a[1005];
vector<long long int> v, v1, v2;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
long long int i, j, k;
cin >> n >> m;
for (i = 1; i <= n; i++) {
cin >> wt[i];
}
j = 1;
for (i = 1; i <= m; i++) {
cin >> a[i];
if (ord[a[i]] == 0) {
v.push_back(a[i]);
ord[a[i]] = 1;
}
}
long long int ans = 0, p, q;
for (i = 1; i <= m; i++) {
v1 = v;
j = a[i];
for (k = 0; k < v1.size(); k++) {
if (v1[k] == j) break;
ans += wt[v1[k]];
}
v2.clear();
v2.push_back(a[i]);
for (p = 0; p < k; p++) v2.push_back(v1[p]);
for (p = k + 1; p < v1.size(); p++) v2.push_back(v1[p]);
v = v2;
}
cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int> > books(n);
vector<bool> ch(n, false);
vector<int> ws(n);
for (int i = 0; i < n; i++) cin >> ws[i];
long long sum = 0;
int a;
for (int i = 0; i < m; i++) {
cin >> a;
a--;
if (!ch[a]) {
ch[a] = true;
for (int j = 0; j < books[a].size(); j++) {
sum += ws[books[a][j]];
}
for (int j = 0; j < n; j++) {
if (j == a) continue;
books[j].push_back(a);
}
} else {
for (int j = 0; j < books[a].size(); j++) {
sum += ws[books[a][j]];
books[books[a][j]].push_back(a);
}
}
books[a].clear();
}
cout << sum;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]) {
int n, m;
cin >> n >> m;
vector<int> w(n, 0);
for (int i = 0; i < n; i++) {
cin >> w[i];
}
vector<int> r(m);
for (int i = 0; i < m; i++) {
cin >> r[i];
r[i]--;
}
vector<int> before(n, -1);
int ans = 0;
for (int i = 0; i < m; i++) {
int x = r[i];
set<int> z;
for (int j = before[x] + 1; j < i; j++) {
int y = r[j];
if (!z.count(y)) {
ans += w[y];
z.insert(y);
}
}
before[x] = i;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 2333;
int n, m;
int w[N];
int b[N];
bool vis[N];
int a[N];
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) {
scanf("%d", &w[i]);
vis[i] = false;
}
int now = 0;
for (int i = 1; i <= m; i++) {
scanf("%d", &b[i]);
if (vis[b[i]]) continue;
a[now++] = b[i];
vis[b[i]] = true;
}
int tot = 0;
for (int i = 1; i <= m; i++) {
int pos = 0;
while (a[pos] != b[i]) pos++;
for (int j = pos - 1; j >= 0; j--) {
tot += w[a[j]];
swap(a[j], a[j + 1]);
}
}
printf("%d\n", tot);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ifstream ff("file.txt");
int n, m;
cin >> n >> m;
map<int, int> Mymap;
int u;
for (int i = 0; i < n; i++) {
cin >> u;
Mymap.insert(pair<int, int>(i + 1, u));
}
unsigned long long sum = 0;
vector<int> v2;
int z;
unsigned int sv;
for (int i = 0; i < m; i++) {
sv = v2.size();
cin >> z;
if (v2.empty()) {
v2.push_back(z);
} else {
for (int j = sv - 1; j >= 0; j--) {
if (v2[j] != z) {
sum += Mymap[v2[j]];
} else {
v2.erase(v2.begin() + j);
v2.push_back(z);
break;
}
if (j == 0) {
v2.push_back(z);
}
}
}
}
cout << sum << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1010;
int n, m, w[N], d[N];
bool vis[N];
int main() {
while (cin >> n >> m) {
for (int i = 1; i <= n; ++i) cin >> w[i];
for (int i = 1; i <= m; ++i) cin >> d[i];
long long ans = 0;
for (int i = 1; i <= m; ++i) {
memset(vis, false, sizeof vis);
for (int j = i - 1; j > 0; --j) {
if (d[i] == d[j]) break;
if (!vis[d[j]]) {
ans += w[d[j]];
vis[d[j]] = true;
}
}
}
cout << ans << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 511111;
const long long MOD = 1e9 + 7;
const double eps = 1e-6;
const long long MAXL = (long long)(0x7fffffffffffffff);
const int MAXI = 0x7fffffff;
int books[555];
int w[555];
int readorder[1111];
bool vis[555];
int main() {
int n, m;
while (cin >> n >> m) {
memset(vis, 0, sizeof(vis));
int c = 1;
for (int i = 1; i <= n; i++) {
cin >> w[i];
}
for (int i = 1; i <= m; i++) {
cin >> readorder[i];
if (!vis[readorder[i]]) {
vis[readorder[i]] = true;
books[c++] = readorder[i];
}
}
int ans = 0;
for (int i = 1; i <= m; i++) {
int p = 0;
for (int j = 1; j <= n; j++) {
if (books[j] == readorder[i]) {
p = j;
break;
}
ans += w[books[j]];
}
for (int j = p; j > 1; j--) {
books[j] = books[j - 1];
}
books[1] = readorder[i];
}
cout << ans << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-8;
const double PI = acos(-1.0);
int a[555], b[555 * 2], c[555 * 2];
bool vis[555];
stack<int> ss;
int main() {
int n, m, i, ans, j, cnt, tot;
scanf("%d%d", &n, &m);
for (i = 1; i <= n; i++) scanf("%d", &a[i]);
for (i = 1; i <= m; i++) {
scanf("%d", &b[i]);
}
memset(vis, false, sizeof(vis));
while (!ss.empty()) ss.pop();
ans = 0;
tot = 0;
memset(vis, false, sizeof(vis));
for (i = 1; i <= m; i++) {
if (!vis[b[i]]) {
ss.push(b[i]);
ans += tot;
tot += a[b[i]];
vis[b[i]] = true;
} else {
cnt = 0;
while (ss.top() != b[i]) {
ans += a[ss.top()];
c[cnt++] = ss.top();
ss.pop();
}
ss.pop();
for (j = cnt - 1; j >= 0; j--) ss.push(c[j]);
ss.push(b[i]);
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int w[n];
int d[m];
for (int i = 0; i < n; i++) cin >> w[i];
for (int i = 0; i < m; i++) cin >> d[i];
set<int> prev;
stack<int> st;
for (int i = 0; i < m; i++)
if (prev.count(d[i]) == 0) {
prev.insert(d[i]);
st.push(d[i]);
}
queue<int> xd;
while (st.size() > 0) {
xd.push(st.top());
st.pop();
}
while (xd.size() > 0) {
st.push(xd.front());
xd.pop();
}
long long int ans = 0;
for (int i = 0; i < m; i++) {
stack<int> temp;
int target = d[i];
while (st.top() != target) {
ans += w[st.top() - 1];
temp.push(st.top());
st.pop();
}
st.pop();
while (temp.size() > 0) {
st.push(temp.top());
temp.pop();
}
st.push(target);
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
int b[100000], w[100000];
deque<int> init;
bool used[100000];
int main() {
int n, m, len = 0;
cin >> n >> m;
for (int i = 0, _n = n; i < _n; i++) cin >> w[i];
for (int i = 0, _n = m; i < _n; i++) {
cin >> b[i];
b[i]--;
}
for (int i = 0, _n = m; i < _n; i++) {
if (!used[b[i]]) init.push_back(b[i]);
used[b[i]] = true;
}
int ans = 0;
for (int i = 0, _n = m; i < _n; i++) {
int idx = 0;
for (int j = 0, _n = n; j < _n; j++) {
if (init[j] != b[i])
ans += w[init[j]];
else {
idx = j;
break;
}
}
init.erase(init.begin() + idx);
init.push_front(b[i]);
}
cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:102400000,102400000")
template <class T>
inline void gmax(T &a, T b) {
if (b > a) a = b;
}
template <class T>
inline void gmin(T &a, T b) {
if (b < a) a = b;
}
using namespace std;
const int N = 1000 + 10, M = 2e6 + 10, Z = 1e9 + 7, maxint = 2147483647,
ms1 = 16843009, ms31 = 522133279, ms63 = 1061109567,
ms127 = 2139062143;
const double PI = acos(-1.0), eps = 1e-8;
void fre() {
freopen("/Users/luras/Desktop/in.txt", "r", stdin);
freopen("/Users/luras/Desktop/out.txt", "w", stdout);
}
const int INF = 1e9;
int casenum, casei;
int n, m, w[N], b[N], e[N], sum;
int a[N], t;
int main() {
while (~scanf("%d%d", &n, &m)) {
for (int i = 1; i <= n; i++) scanf("%d", &w[i]);
t = 0;
for (int i = 1; i <= m; i++) {
scanf("%d", &b[i]);
if (!e[b[i]]) {
e[b[i]] = ++t;
}
}
for (int i = 1; i <= m; i++) a[e[b[i]]] = b[i];
sum = 0;
for (int i = 1; i <= m; i++) {
for (int j = 1; j <= n; j++) {
if (a[j] == b[i]) {
for (int k = j; k > 1; k--) {
a[k] = a[k - 1];
}
a[1] = b[i];
break;
}
sum += w[a[j]];
}
}
printf("%d\n", sum);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
void addSelf(long long& x, long long y) {
x += y;
if (x >= mod) x -= mod;
}
void subSelf(long long& x, long long y) {
x -= y;
if (x < 0) x += mod;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, m;
cin >> n >> m;
vector<int> weight(n);
for (int i = 0; i < n; ++i) {
cin >> weight[i];
}
vector<int> read(m);
for (int i = 0; i < m; ++i) {
cin >> read[i];
read[i]--;
}
vector<int> seen(n, false);
vector<int> initialStack;
for (int i = 0; i < m; ++i) {
if (!seen[read[i]]) {
seen[read[i]] = true;
initialStack.push_back(read[i]);
}
}
long long sumi = 0;
for (int i = 0; i < m; ++i) {
int breaking = 0;
for (int j = 0; j < n; ++j) {
if (initialStack[j] == read[i]) {
breaking = j;
break;
}
sumi += weight[initialStack[j]];
}
int temp = initialStack[breaking];
for (int j = breaking; j > 0; --j) {
initialStack[j] = initialStack[j - 1];
}
initialStack[0] = temp;
}
cout << sumi;
}
|
#include <bits/stdc++.h>
using namespace std;
const double kEps = 10e-8;
const int kMax = 1005;
const int kInf = 1 << 30;
int main(int argc, char **argv) {
int n, m;
int w[kMax];
int b[kMax];
scanf("%d %d", &n, &m);
for (int i = 1; i <= n; i++) {
scanf("%d", &w[i]);
}
for (int i = 0; i < m; i++) {
scanf("%d", &b[i]);
}
set<int> in;
int cost = 0;
int S[kMax];
int top = 0;
for (int i = 0; i < m; i++) {
int book = b[i];
if (in.find(book) != in.end()) {
int t;
for (t = top - 1; t >= 0 && S[t] != book; t--) {
cost += w[S[t]];
}
while (t + 1 < top) {
S[t] = S[t + 1];
t++;
}
S[top - 1] = book;
} else {
in.insert(book);
for (int t = 0; t < top; t++) {
cost += w[S[t]];
}
S[top++] = book;
}
}
cout << cost << endl;
return EXIT_SUCCESS;
}
|
#include <bits/stdc++.h>
#pragma warning(disable : 4996)
using namespace std;
int n, m;
int a[1000];
int b[3000];
int x[1000];
int xi;
int c[1000];
int main() {
int i, j, k;
scanf("%d%d", &n, &m);
for (i = 0; i < n; i++) scanf("%d", &a[i]);
for (i = 0; i < m; i++) scanf("%d", &b[i]), b[i]--;
for (i = 0; i < m; i++) {
if (c[b[i]]) continue;
x[xi++] = b[i], c[b[i]] = 1;
}
for (i = 0; i < n; i++) {
if (c[i] == 0) x[xi++] = i;
}
int cnt = 0;
for (i = 0; i < m; i++) {
for (j = 0; j < n; j++) {
if (x[j] == b[i]) break;
cnt += a[x[j]];
}
for (k = j; k > 0; k--) x[k] = x[k - 1];
x[0] = b[i];
}
printf("%d", cnt);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m, l;
long long res;
int a[1000009], b[1000009], w[1000009];
int dd[1000009];
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]);
l = n;
for (int i = 1; i <= m; i++)
if (!dd[b[i]]) {
dd[b[i]] = 1;
a[l] = b[i];
l--;
}
for (int i = 1; i <= m; i++) {
bool ok = false;
for (int i = 1; i <= n; i++) dd[i] = 0;
for (int j = i - 1; j >= 1; j--)
if (!dd[b[j]]) {
dd[b[j]] = 1;
if (b[j] == b[i]) {
ok = true;
break;
}
res += w[b[j]];
}
if (!ok)
for (int j = n; j >= 1; j--)
if (!dd[a[j]]) {
dd[a[j]] = 1;
if (a[j] == b[i]) {
ok = true;
break;
}
res += w[a[j]];
}
}
cout << res << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1000 + 100;
bool mark[MAXN];
int n, m, w[MAXN], b[MAXN], ans;
vector<int> s;
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++) cin >> w[i];
for (int i = 0; i < m; i++) cin >> b[i];
for (int i = 0; i < m; i++)
if (!mark[b[i]]) {
mark[b[i]] = true;
s.push_back(b[i]);
}
for (int i = 0; i < m; i++) {
int ind = 0;
for (int j = 0; j < s.size(); j++)
if (s[j] == b[i]) {
ind = j;
break;
}
for (int j = 0; j < ind; j++) ans += w[s[j]];
for (int j = ind; j > 0; j--) s[j] = s[j - 1];
s[0] = b[i];
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int n, m, cnt, w[N], a[N], tmp[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 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;
long long Min(long long i, long long j) { return i < j ? i : j; }
long long Max(long long i, long long j) { return i > j ? i : j; }
long long w[5005], b[5005];
int main() {
long long a, i, j, k, l, m, n;
vector<long long> cur;
while (cin >> n >> m) {
for (i = 1; i <= n; i++) cin >> w[i];
for (i = 1; i <= m; i++) cin >> b[i];
a = 0;
cur.clear();
for (i = 1; i <= m; i++) {
bool bb = true;
for (j = 0; j < cur.size(); j++) {
if (cur[j] == b[i]) {
bb = false;
break;
}
a += w[cur[j]];
}
for (++j; j < cur.size(); j++) {
cur[j - 1] = cur[j];
bb = false;
}
if (cur.size() && !bb) cur.pop_back();
cur.push_back(0);
for (j = ((long long)cur.size()) - 2; j >= 0; j--) cur[j + 1] = cur[j];
cur[0] = b[i];
}
cout << a << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
const long long inf = 1000000000;
const long long inf64 = inf * inf;
const long long base = inf / 10ll;
const double pi = acos(-1.0);
using namespace std;
int Abs(int x) { return (x >= 0 ? x : -x); }
bool solve() {
int n, m;
cin >> n >> m;
vector<int> w(n), b(m);
set<int> s;
for (int i(0); i < n; i++) cin >> w[i];
for (int i(0); i < m; i++) cin >> b[i];
vector<long long> dp(m);
for (int i(1); i < m; i++) {
long long tmp = 0;
s.clear();
for (int j(i - 1); j >= 0; j--) {
if (b[j] == b[i]) break;
s.insert(b[j]);
}
for (set<int>::iterator j = s.begin(); j != s.end(); j++) tmp += w[*j - 1];
dp[i] = dp[i - 1] + tmp;
}
cout << dp[m - 1] << '\n';
return true;
}
int main() {
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int mass[n];
for (int i = 0; i < n; i++) cin >> mass[i];
list<int> lis;
int ans = 0;
for (int i = 0; i < m; i++) {
int temp;
cin >> temp;
temp--;
if (lis.empty())
lis.push_front(temp);
else {
int sum = 0;
list<int>::iterator i;
for (i = lis.begin(); i != lis.end(); i++) {
if (*i == temp)
break;
else
sum += mass[*i];
}
if (i != lis.end()) lis.erase(i);
lis.push_front(temp);
ans += sum;
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m;
int d[1005];
int w[506];
int ans[503];
signed long long int cost(int up, int dow) {
signed long long int r = 0;
for (int i = 1; i <= m; ++i) {
if (d[i] == dow) {
r += w[up];
swap(up, dow);
}
}
return r;
}
int main() {
cin >> n >> m;
for (int i = 1; i <= n; ++i) cin >> w[i], ans[i] = i;
for (int i = 1; i <= m; ++i) cin >> d[i];
for (int i = 1; i <= n; ++i) {
for (int j = i + 1; j <= n; ++j) {
if (cost(ans[i], ans[j]) > cost(ans[j], ans[i])) {
swap(ans[i], ans[j]);
}
}
}
signed long long int f = 0;
for (int i = 1; i <= n; ++i) {
for (int j = i + 1; j <= n; ++j) {
f += cost(ans[i], ans[j]);
}
}
cout << f;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long int mod = 998244353LL;
int vis[1000005];
int w[1000005], used[1000005], a[1000005];
int main() {
int n, m;
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", &used[i]);
int cur = 1;
for (int i = 1; i <= m; i++) {
if (!vis[used[i]]) {
a[cur] = used[i];
vis[a[cur]] = 1;
cur++;
}
}
for (int i = 1; i <= n; i++) {
if (!used[i]) {
a[cur] = i;
vis[i] = 1;
cur++;
}
}
int ans = 0;
for (int i = 1; i <= m; i++) {
cur = used[i];
int j;
for (j = 1; j <= n; j++) {
if (a[j] != cur)
ans += w[a[j]];
else
break;
}
for (int k = j; k > 1; k--) a[k] = a[k - 1];
a[1] = cur;
}
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, k, w[505];
queue<int> q[2];
int main() {
int wgt = 0;
scanf("%d%d", &n, &k);
for (int x = 0; x < n; x++) scanf("%d", &w[x]);
int cur = 0;
bool inq[505];
memset(inq, false, sizeof inq);
while (k--) {
int b;
scanf("%d", &b);
b--;
if (inq[b]) {
bool ketemu = false;
while (!q[cur].empty()) {
int tmp = q[cur].front();
q[cur].pop();
if (ketemu)
wgt += w[tmp];
else if (tmp == b)
ketemu = true;
if (tmp != b) q[!cur].push(tmp);
}
q[!cur].push(b);
cur = !cur;
} else {
inq[b] = true;
while (!q[cur].empty()) {
int tmp = q[cur].front();
q[cur].pop();
wgt += w[tmp];
q[!cur].push(tmp);
}
q[!cur].push(b);
cur = !cur;
}
}
printf("%d\n", wgt);
return 0;
}
|
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:255777216")
using namespace std;
double PI = 3.1415926535897932384626433832795;
struct st {
int w, id;
st(int W, int Id) {
w = W;
id = Id;
}
};
vector<st> p;
vector<int> a;
bool used[1 << 15];
int main() {
int n, m;
cin >> n >> m;
for (int i = 0; i < n; i++) {
int w;
cin >> w;
p.push_back(st(w, i + 1));
}
for (int i = 0; i < m; i++) {
int v;
cin >> v;
a.push_back(v);
}
int pos = 0;
for (int i = 0; i < m; i++) {
if (!used[a[i]]) {
used[a[i]] = true;
for (int j = pos; j < n; j++) {
if (p[j].id == a[i]) {
swap(p[j], p[pos]);
break;
}
}
pos++;
}
}
long long answ = 0;
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
if (p[j].id != a[i]) {
answ += p[j].w;
} else {
for (int k = j - 1; k >= 0; k--) swap(p[k], p[k + 1]);
break;
}
}
}
cout << answ << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m;
int w[1010];
int b[1010];
bool vis[1010];
int s[1010];
stack<int> s1, s2;
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]);
int ans = 0;
int id;
int where;
int num = 0;
int all = 0;
for (int j = 1; j <= m; j++) {
id = b[j];
if (!vis[id]) {
ans += all;
all += w[id];
vis[id] = 1;
s1.push(id);
} else {
for (;;) {
int t = s1.top();
s1.pop();
if (t == id) {
while (!s2.empty()) {
s1.push(s2.top());
s2.pop();
}
s1.push(id);
break;
} else {
s2.push(t);
ans += w[t];
}
}
}
}
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long last[1002];
void solve() {
long long n, m, i, j;
cin >> n >> m;
long long w[n + 1];
for (i = 1; i < n + 1; ++i) {
cin >> w[i];
}
long long arr[m + 1];
set<long long> s;
vector<long long> v;
for (i = 1; i < m + 1; ++i) {
cin >> arr[i];
if (s.find(arr[i]) == s.end()) v.push_back(arr[i]);
s.insert(arr[i]);
}
long long sum = 0;
long long prefix[(long long)v.size()];
prefix[0] = 0;
for (i = 1; i < (long long)v.size(); ++i) {
prefix[i] = prefix[i - 1] + w[v[i - 1]];
}
for (i = 0; i < (long long)v.size(); ++i) sum += prefix[i];
for (i = 1; i < m + 1; ++i) {
if (!last[arr[i]]) {
last[arr[i]] = i;
} else {
set<long long> temp;
for (j = last[arr[i]] + 1; j < i; ++j) {
if (temp.find(arr[j]) == temp.end()) sum += w[arr[j]];
temp.insert(arr[j]);
}
last[arr[i]] = i;
}
}
cout << sum << '\n';
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long t = 1;
while (t--) {
solve();
}
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 = n / 2;
for (i = 1; i <= aux; i++) swap(perm[i], perm[n - i + 1]);
for (i = 1; i <= m; i++) {
for (j = 1; j <= n; j++)
if (perm[j] == b[i]) {
poz = j;
j = n + 1;
}
for (j = poz + 1; j <= n; j++) {
sol += cost[perm[j]];
swap(perm[j], perm[j - 1]);
}
}
cout << sol << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 500 + 10;
const int maxm = 1000 + 10;
int w[maxn];
int b[maxm];
int vis[maxn];
stack<int> book;
stack<int> up;
int main() {
int n, m;
memset(vis, 0, sizeof(vis));
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) scanf("%d", &w[i]);
for (int i = 0; i < m; i++) {
scanf("%d", &b[i]);
if (!vis[b[i]]) {
up.push(b[i]);
vis[b[i]] = 1;
}
}
while (!up.empty()) {
book.push(up.top());
up.pop();
}
int res = 0;
for (int i = 0; i < m; i++) {
int cur = book.top();
book.pop();
while (cur != b[i]) {
res += w[cur];
up.push(cur);
cur = book.top();
book.pop();
}
while (!up.empty()) {
book.push(up.top());
up.pop();
}
book.push(cur);
}
printf("%d\n", res);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> w(n), b(m);
for (int i = (0); i < (n); ++i) cin >> w[i];
for (int i = (0); i < (m); ++i) cin >> b[i];
vector<int> visited(n, false);
list<int> stack;
for (auto it : b)
if (!visited[it - 1]) {
visited[it - 1] = true;
stack.push_back(it);
}
long long res = 0;
for (auto it : b) {
list<int>::iterator jt;
for (jt = stack.begin(); jt != stack.end(); jt++) {
if (*jt != it)
res += w[*jt - 1];
else
break;
}
stack.erase(jt);
stack.insert(stack.begin(), it);
}
cout << res;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int a[n], b[m];
int i, j, k, l;
for (i = 0; i < n; i++) cin >> a[i];
vector<int> v;
for (i = 0; i < m; i++) {
cin >> j;
b[i] = j;
if (v.size() != 0) {
if (find(v.begin(), v.end(), j) == v.end()) v.push_back(j);
} else
v.push_back(j);
}
stack<int> s, st;
for (i = v.size() - 1; i >= 0; i--) {
s.push(v[i]);
}
int ans = 0;
for (i = 0; i < m; i++) {
while (s.top() != b[i]) {
ans += a[s.top() - 1];
st.push(s.top());
s.pop();
}
int p = s.top();
s.pop();
while (st.size() != 0) {
s.push(st.top());
st.pop();
}
s.push(p);
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
long long visit[1005] = {0};
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long n, m, ans = 0;
cin >> n >> m;
long long arr[n + 1];
long long brr[m + 1];
vector<int> v[101];
for (int i = 1; i < n + 1; i++) cin >> arr[i];
for (int i = 1; i < m + 1; i++) {
cin >> brr[i];
}
for (long long i = 1; i <= m; i++) {
set<long long> s;
for (long long j = i - 1; j >= 1 && (brr[j] != brr[i]); j--) {
if (s.find(brr[j]) == s.end()) {
ans += arr[brr[j]];
s.insert(brr[j]);
}
}
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
int w[500 + 11];
int day[1011];
bool vis[511];
memset(vis, false, sizeof(vis));
vector<int> L;
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", &day[i]);
if (!vis[day[i]]) {
vis[day[i]] = true;
L.push_back(day[i]);
}
}
int ans = 0;
for (int i = 1; i <= m; i++) {
for (int j = 0; j < L.size(); j++) {
if (day[i] == L[j]) {
L.erase(L.begin() + j);
L.insert(L.begin(), day[i]);
break;
} else
ans += w[L[j]];
}
}
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
list<int> order;
int B[1550] = {0};
int BUCK[1550] = {0};
int W[1550];
int N, M;
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]);
if (BUCK[B[i]] == 0) {
BUCK[B[i]] = 1;
order.push_back(B[i]);
}
}
long long sum = 0;
for (int i = 1; i <= M; i++) {
auto it = order.begin();
for (; *it != B[i]; ++it) sum += W[*it];
order.erase(it);
order.push_front(B[i]);
}
printf("%I64d", sum);
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline T sqr(T x) {
return x * x;
}
const double EPS = 1e-9;
const int MAXN = 500 + 10;
int w[MAXN];
int b[MAXN * 10];
int n, m;
bool was[MAXN];
vector<int> order;
int main() {
scanf("%d%d", &n, &m);
for (int i = 0; i < (int)n; ++i) {
scanf("%d", &w[i]);
}
for (int i = 0; i < (int)m; ++i) {
scanf("%d", &b[i]);
--b[i];
}
memset(was, false, sizeof was);
for (int i = 0; i < (int)m; ++i) {
if (!was[b[i]]) {
order.push_back(b[i]);
was[b[i]] = true;
}
}
int res = 0;
for (int i = 0; i < (int)m; ++i) {
int pos = -1;
for (int j = 0; j < (int)((int)(order).size()); ++j) {
if (order[j] == b[i]) {
pos = j;
}
}
assert(pos != -1);
for (int j = 0; j < (int)pos; ++j) {
res += w[order[j]];
}
for (int j = pos; j > 0; --j) {
order[j] = order[j - 1];
}
order[0] = b[i];
}
printf("%d\n", res);
return 0;
}
|
#include <bits/stdc++.h>
int w[505], b[1005], s[505], o[505], last[505], r[1005];
long long int sum;
int main() {
int i, j, k, l, n, m, t;
while (scanf("%d%d", &n, &m) != EOF) {
for (i = 1; i <= n; i++) {
scanf("%d", &w[i]);
last[i] = 0;
o[i] = 0;
}
for (i = 1; i <= m; i++) {
scanf("%d", &b[i]);
r[i] = 0;
}
t = 1;
for (i = 1; i <= m; i++) {
if (o[b[i]] == 0) {
o[b[i]] = 1;
s[t] = b[i];
t++;
}
}
for (i = 1; i <= m; i++) {
if (i > last[b[i]] + 1) {
for (k = 1; k <= n; k++) {
o[k] = 0;
}
o[b[i]] = 1;
for (j = last[b[i]] + 1; j < i; j++) {
if (o[b[j]] == 0) {
r[i] = r[i] + w[b[j]];
o[b[j]] = 1;
}
}
}
last[b[i]] = i;
}
sum = 0;
for (i = 1; i <= m; i++) {
sum = sum + r[i];
}
printf("%d\n", sum);
}
}
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n, m;
scanf("%d%d", &n, &m);
vector<int> w(n);
for (int i(0), _l((int)(n)-1); i <= _l; ++i) scanf("%d", &w[i]);
vector<int> order(m);
long long ans(0);
for (int i(0), _l((int)(m)-1); i <= _l; ++i) {
scanf("%d", &order[i]);
set<int> SET;
for (int j = i - 1; j >= 0 && order[j] != order[i]; --j) {
SET.insert(order[j]);
}
long long tw(0);
for (int q : SET) {
tw += w[q - 1];
}
ans += tw;
}
cout << ans << endl;
}
int main() {
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int w[505], b[1005];
bool vis[505];
int main() {
int n, m, ans = 0;
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 = 2; i <= m; i++) {
memset(vis, false, sizeof(vis));
for (int j = i - 1; j > 0; j--) {
if (b[j] == b[i]) break;
if (!vis[b[j]]) {
ans += w[b[j]];
vis[b[j]] = true;
}
}
}
printf("%d\n", ans);
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1002;
int n, k, ar[MAXN], br[MAXN], vis[MAXN];
int main() {
while (cin >> n >> k) {
for (int i = 0; i < n; ++i) {
cin >> ar[i];
}
memset(vis, 0, sizeof(vis));
vector<int> V;
long long ret = 0;
for (int i = 0; i < k; ++i) {
cin >> br[i];
br[i]--;
if (vis[br[i]]) {
continue;
}
vis[br[i]] = 1;
V.push_back(br[i]);
}
for (int i = 0; i < k; ++i) {
vector<int> temp;
int pos = -1;
for (int j = 0; j < V.size(); ++j) {
if (V[j] == br[i]) {
break;
}
ret += ar[V[j]];
pos = j;
}
temp.push_back(V[pos + 1]);
for (int j = 0; j <= pos; ++j) {
temp.push_back(V[j]);
}
for (int j = pos + 2; j < V.size(); ++j) {
temp.push_back(V[j]);
}
V = temp;
}
cout << ret << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 505;
const int maxm = 1005;
int n, m, w[maxn], d[maxm], st[maxn];
bitset<maxn> used;
int main() {
cin >> n >> m;
for (int i = 1; i <= n; ++i) cin >> w[i];
for (int i = 1; i <= m; ++i) {
cin >> d[i];
if (!used[d[i]]) {
st[++st[0]] = d[i];
used[d[i]] = 1;
}
}
for (int i = 1; i <= n; ++i) {
if (!used[i]) st[++st[0]] = i;
}
int ans = 0;
for (int i = 1; i <= m; ++i) {
for (int j = 1; j <= n; ++j) {
if (st[j] == d[i]) {
for (int k = j; k > 1; --k) st[k] = st[k - 1];
st[1] = d[i];
break;
}
ans += w[st[j]];
}
}
cout << ans << '\n';
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1001;
int n, a[N], w[N], b[N], s[N], m;
int main() {
ios_base::sync_with_stdio(false);
cin >> n >> m;
for (int i = 1; i <= n; i++) cin >> w[i];
for (int i = 1; i <= m; i++) cin >> a[i];
int top = 1;
s[1] = a[1];
b[a[1]] = 1;
for (int i = 2; i <= m; i++)
if (!b[a[i]]) {
s[++top] = a[i];
b[a[i]] = 1;
}
int res = 0;
for (int i = 1; i <= m; i++) {
int vt, sum = 0;
for (int j = 1; j <= top; j++)
if (s[j] == a[i]) {
vt = j;
break;
} else
sum += w[s[j]];
res += sum;
for (int j = vt - 1; j >= 1; j--) s[j + 1] = s[j];
s[1] = a[i];
}
cout << res << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m;
int D[505];
int F[1005];
vector<int> C;
int ans = 0;
void solve(int v) {
int i = 0;
while (C[i] != v) {
ans = ans + D[C[i]];
i++;
}
vector<int> A;
A.push_back(v);
for (int i = 0; i < C.size(); i++) {
if (C[i] != v) {
A.push_back(C[i]);
}
}
C.clear();
for (int i = 0; i < A.size(); i++) {
C.push_back(A[i]);
}
}
int main() {
cin >> n >> m;
bool used[n];
for (int i = 0; i < n; i++) {
cin >> D[i];
used[i] = 0;
}
for (int i = 0; i < m; i++) {
cin >> F[i];
F[i]--;
}
for (int i = 0; i < m; i++) {
int x = F[i];
if (used[x] == 0) {
used[x] = 1;
C.push_back(x);
}
}
for (int i = 0; i < m; i++) {
solve(F[i]);
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int mm = 1e6;
long long int d[mm];
long long int ans[mm];
bool vis[mm];
queue<long long int> q, qq;
int main() {
long long int n, m, i, j, k, kk, a, b, t, num, p, z, l, r, mid, s, ss;
cin >> n >> m;
for (i = 1; i <= n; i++) cin >> d[i];
for (i = 1; i <= m; i++) cin >> ans[i];
for (i = 1; i <= m; i++)
if (vis[ans[i]] == 0) q.push(ans[i]), vis[ans[i]] = 1;
num = 0;
for (i = 1; i <= m; i++) {
qq.push(ans[i]);
while (1) {
k = q.front();
q.pop();
if (k != ans[i]) qq.push(k);
if (k != ans[i])
num += d[k];
else
break;
}
while (!q.empty()) {
k = q.front();
q.pop();
qq.push(k);
}
while (!qq.empty()) {
k = qq.front();
qq.pop();
q.push(k);
}
}
cout << num << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m, i, top, b, ans, tmp, j, k;
int f[10010], a[10010];
int main() {
scanf("%d%d", &n, &m);
for (i = 1; i <= n; i++) scanf("%d", &a[i]);
for (i = 1; i <= m; i++) {
scanf("%d", &b);
if (top == 0) {
top++;
f[top] = b;
} else {
tmp = 0;
for (j = top; j >= 1; j--)
if (f[j] == b)
break;
else
tmp = tmp + a[f[j]];
ans = ans + tmp;
if (j == 0) {
top++;
f[top] = b;
} else {
for (k = j + 1; k <= top; k++) f[k - 1] = f[k];
f[top] = b;
}
}
}
printf("%d\n", ans);
}
|
#include <bits/stdc++.h>
int m, n, wei[600], day[1020], mark[600] = {0}, set[600], i, j, k, total = 0,
temp;
int main(int argc, char** argv) {
scanf("%d%d", &m, &n);
for (i = 1; i <= m; i++) scanf("%d", &wei[i]);
for (i = 0, j = 0; i < n; i++) {
scanf("%d", &day[i]);
if (mark[day[i]] == 0) {
set[j++] = day[i];
mark[day[i]] = 1;
}
}
for (i = 0; i < n; i++) {
for (j = 0; j < m; j++) {
if (day[i] == set[j]) {
temp = set[j];
for (k = j; k > 0; k--) set[k] = set[k - 1];
set[0] = temp;
break;
} else
total += wei[set[j]];
}
}
printf("%d\n", total);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 505;
const int M = 1005;
int n, m, w[N], b[M], o[N], k;
set<int> on[N];
int main() {
scanf("%d %d", &n, &m);
for (int i = 0; i < n; i++) {
scanf("%d", &w[i]);
}
for (int i = 0; i < m; i++) {
scanf("%d", &b[i]);
b[i]--;
}
int ans = 0;
for (int i = 0; i < m; i++) {
for (set<int>::iterator it = on[b[i]].begin(); it != on[b[i]].end(); ++it) {
ans += w[*it];
}
on[b[i]].clear();
for (int j = 0; j < n; j++) {
if (j == b[i]) continue;
on[j].insert(b[i]);
}
}
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long n, m, w[1000], day[2000], a[1000], k = 0, ans = 0, p = 0, tmp;
bool mas[1000];
int main() {
std::ios::sync_with_stdio(false);
cin >> n >> m;
for (int i = 1; i <= n; i++) cin >> w[i];
for (int i = 1; i <= m; i++) {
cin >> day[i];
if (mas[day[i]] == false) {
mas[day[i]] = true;
k++;
a[k] = day[i];
}
}
for (int i = 2; i <= m; i++) {
for (int j = 1; j <= n; j++) {
if (a[j] == day[i]) {
p = j;
break;
}
ans += w[a[j]];
}
for (int j = p; j > 1; j--) {
a[j] = a[j - 1];
}
a[1] = day[i];
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int w[509];
int vis[509];
vector<int> order;
int book[1009];
long long int doit(int b) {
long long int res = 0;
for (int i = 0; i < (int)order.size(); i++) {
if (order[i] == b) break;
res += w[order[i]];
}
vector<int> n_o;
n_o.push_back(b);
for (int i = 0; i < (int)order.size(); i++) {
if (order[i] == b) {
continue;
}
n_o.push_back(order[i]);
}
order = n_o;
return res;
}
int main() {
int n, m, ww;
cin >> n >> m;
for (int i = 1; i <= n; i++) {
cin >> w[i];
}
for (int i = 1; i <= m; i++) {
cin >> book[i];
if (!vis[book[i]]) {
order.push_back(book[i]);
vis[book[i]] = 1;
}
}
long long int res = 0;
for (int i = 1; i <= m; i++) {
res += doit(book[i]);
}
cout << res << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int N, M, W[1000], B[1000], last[1000];
bool used[1000];
int main() {
for (int i = (0); i < (1000); i++) last[i] = -1;
scanf("%d", &(N));
scanf("%d", &(M));
for (int i = (0); i < (N); i++) scanf("%d", &(W[i]));
for (int i = (0); i < (M); i++) scanf("%d", &(B[i]));
for (int i = (0); i < (M); i++) B[i]--;
long long ttotal = 0;
for (int i = (0); i < (M); i++) {
long long total = 0;
for (int j = (0); j < (N); j++) used[j] = false;
for (int j = (0); j < (i); j++)
if (j > last[B[i]]) used[B[j]] = true;
for (int j = (0); j < (N); j++)
if (used[j]) total += W[j];
last[B[i]] = i;
ttotal += total;
}
printf("%lld\n", ttotal);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int w[n + 1], a[m + 1];
for (int i = 1; i <= n; ++i) cin >> w[i];
for (int i = 1; i <= m; ++i) cin >> a[i];
bool f[100 * 1000 + 1];
long long ans = 0;
for (int i = 1; i <= m; i++) {
for (int j = 1; j <= n; j++) f[j] = false;
for (int j = i - 1; j >= 1; j--) {
if (a[j] == a[i]) break;
if (f[a[j]]) continue;
f[a[j]] = true;
ans += w[a[j]];
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m, w[1005], b[1005], done[1005];
vector<int> uq;
int main() {
scanf("%d%d", &n, &m);
for (int i = 0; i < n; i++) scanf("%d", &w[i]);
for (int i = 0; i < m; i++) {
scanf("%d", &b[i]);
--b[i];
if (!done[b[i]]) {
done[b[i]] = true;
uq.push_back(b[i]);
}
}
int ans = 0;
for (int i = 0; i < m; i++) {
int j = 0, s = 0;
while (j < n) {
if (uq[j] == b[i]) break;
s += w[uq[j]];
j++;
}
ans += s;
uq.erase(uq.begin() + j);
uq.insert(uq.begin(), b[i]);
}
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXM = 1000;
const int MAXN = 500;
int b[MAXM + 10];
int w[MAXN + 10];
bool vis[MAXN + 10];
vector<int> vec;
void printVec(vector<int>& vec) {
for (int i = 0; i < vec.size(); i++) {
printf("%d ", vec[i]);
}
printf("\n");
return;
}
int search(int n, vector<int>& vec) {
vector<int> temp, nvec;
int ret = 0;
int i;
for (i = 0; i < vec.size(); i++) {
if (vec[i] != n) {
ret += w[vec[i]];
temp.push_back(vec[i]);
} else {
break;
}
}
nvec.push_back(vec[i]);
for (int j = 0; j < temp.size(); j++) {
nvec.push_back(temp[j]);
}
for (i = i + 1; i < vec.size(); i++) {
nvec.push_back(vec[i]);
}
vec = nvec;
return ret;
}
int calc(int m, vector<int>& vec) {
int ret = 0;
for (int i = 0; i < m; i++) {
ret += search(b[i], vec);
}
return ret;
}
int main() {
int n, m;
scanf("%d %d", &n, &m);
for (int i = 1; i <= n; i++) {
scanf("%d", &w[i]);
}
for (int i = 0; i < m; i++) {
scanf("%d", &b[i]);
if (!vis[b[i]]) {
vec.push_back(b[i]);
vis[b[i]] = true;
}
}
for (int i = 1; i <= n; i++) {
if (vis[i] == false) {
vec.push_back(i);
}
}
int ans = calc(m, vec);
printf("%d\n", ans);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m, i, j, cnt, ar[1002], w[1002], b[1002], vis[1002], ans = 0;
memset(vis, 0, sizeof(vis));
cin >> n >> m;
for (i = 0; i < n; i++) cin >> w[i];
for (i = 0; i < m; i++) {
cin >> b[i];
b[i]--;
}
cnt = 0;
for (i = 0; i < m; i++)
if (!vis[b[i]]) {
ar[cnt] = b[i];
cnt++;
vis[b[i]] = 1;
}
for (i = 0; i < n; i++)
if (!vis[i]) {
ar[cnt] = i;
cnt++;
}
for (i = 0; i < m; i++) {
int in = 0;
while (ar[in] != b[i]) {
ans += w[ar[in]];
in++;
}
for (j = in; j > 0; --j) ar[j] = ar[j - 1];
ar[0] = b[i];
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e3 + 100;
int w[N];
int flag[N];
int b[N];
int coc[N];
int n, m;
int sum;
int main() {
scanf("%d %d", &n, &m);
for (int i = 1; i <= n; i++) {
scanf("%d", &w[i]);
}
for (int j = 0; j < m; j++) {
scanf("%d", &b[j]);
if (!flag[b[j]]) {
coc[sum++] = b[j];
flag[b[j]] = 1;
}
}
int ans = 0;
for (int i = 0; i < m; i++) {
int pos = 0;
while (coc[pos] != b[i]) {
ans += w[coc[pos]];
pos++;
}
for (int j = pos; j > 0; j--) {
coc[j] = coc[j - 1];
}
coc[0] = b[i];
}
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int gcd(long long int a, long long int b) {
long long int r, i;
while (b != 0) {
r = a % b;
a = b;
b = r;
}
return a;
}
long long int power(long long int x, long long int y, long long int mod) {
long long int temp, ty, my;
if (y == 0) return 1;
temp = power(x, y / 2, mod);
ty = (temp % mod) * (temp % mod);
if (y % 2 == 0) {
return ty % mod;
} else {
my = (x % mod) * (ty % mod);
return my % mod;
}
}
long long int mycbrt(long long int n) {
long long int start = 0;
long long int end = 1000000LL;
long long int ans = -1;
while (start <= end) {
long long int mid = (start + end) / 2;
if ((mid * mid * mid) > n)
end = mid - 1;
else if ((mid * mid * mid) == n) {
ans = mid;
break;
} else {
start = mid + 1;
}
}
if (n == 1) {
ans = 1;
}
return ans;
}
void SieveOfEratosthenes(int n) {
bool prime[n + 1];
memset(prime, true, sizeof(prime));
for (int p = 2; p * p <= n; p++) {
if (prime[p] == true) {
for (int i = p * 2; i <= n; i += p) prime[i] = false;
}
}
for (int p = 2; p <= n; p++)
if (prime[p]) cout << p << " ";
}
struct abhi {
long long int val1;
long long int val2;
long long int po;
};
bool cmp(struct abhi x, struct abhi y) {
if (x.val1 == y.val1) return x.val2 < y.val2;
return x.val1 < y.val1;
}
void fastscan(int &number) {
bool negative = false;
register int c;
number = 0;
c = getchar();
if (c == '-') {
negative = true;
c = getchar();
}
for (; (c > 47 && c < 58); c = getchar()) number = number * 10 + c - 48;
if (negative) number *= -1;
}
vector<pair<long long int, long long int> > po;
long long int dp[2000010];
long long int dp2[200010];
long long int ar[2000010];
long long int br[2000010];
long long int x[2000010];
long long int y[2000010];
deque<long long int> bc;
deque<long long int>::iterator it;
vector<pair<long long int, long long int> > poss;
map<pair<long long int, long long int>, long long int> mp;
vector<long long int> ans;
long long int vis[1000];
int main() {
long long int n, i, j, k, s, q;
long long int t, m;
cin >> n >> m;
for (i = (0); i < (n); i++) {
cin >> ar[i + 1];
}
memset(vis, 0, sizeof(vis));
for (i = (0); i < (m); i++) {
cin >> br[i];
if (vis[br[i]] == 0) {
vis[br[i]] = 1;
bc.push_back(br[i]);
}
}
long long int ans = 0;
for (i = (0); i < (m); i++) {
long long int bno = br[i];
long long int sum = 0;
for (it = bc.begin(); it != bc.end(); it++) {
long long int num = *it;
if (num != bno) {
sum = sum + ar[num];
} else {
bc.erase(it);
bc.push_front(num);
ans = ans + sum;
break;
}
}
}
cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, w[1111], b[1111], seq[1111], dir[1111], cnt = 0, ans = 0;
bool exist[1111] = {0};
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 (!exist[b[i]]) {
exist[b[i]] = 1;
seq[++cnt] = b[i];
dir[b[i]] = cnt;
}
for (int i = 1; i <= m; i++)
if (seq[1] != b[i]) {
for (int j = dir[b[i]] - 1; j >= 1; j--) {
ans += w[seq[j]];
seq[j + 1] = seq[j];
dir[seq[j + 1]] = j + 1;
}
seq[1] = b[i];
dir[b[i]] = 1;
}
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[600], b[2000], n, m, i, j;
int result, k;
int main() {
cin >> n >> m;
i = 1;
while (i <= n) {
cin >> a[i];
b[i] = -1;
i++;
}
i = 1;
while (i <= m) {
cin >> k;
for (j = 1; j <= n; j++) {
if (b[j] > b[k]) result = result + a[j];
}
b[k] = i;
i++;
}
cout << result;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1);
const long long mod = 1e9 + 7;
const long long N = 500 + 5, K = 105;
const int si = (1 << 20);
const long long add = 1e4;
const long long M = 1000 + 5;
const double INFdb = 1e10;
const long long oo = 1e18;
int n, m;
int w[N];
int b[M];
bool used[N];
int ans;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(0);
cin >> n >> m;
for (int i = 1; i <= n; ++i) cin >> w[i];
for (int i = 1; i <= m; ++i) cin >> b[i];
for (int i = 1; i <= m; ++i) {
for (int j = 1; j <= n; ++j) used[j] = 0;
int res = 0;
for (int j = i - 1; j >= 1; --j) {
if (b[i] == b[j]) break;
if (used[b[j]]) continue;
used[b[j]] = 1;
res += w[b[j]];
}
ans += res;
}
cout << ans;
cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
return 0;
}
|
#include <bits/stdc++.h>
int n, m, x, i, j, t, ans, a[1001], w[501];
bool f[501];
int main() {
scanf("%d%d", &n, &m);
for (i = 1; i <= n; ++i) scanf("%d", w + i);
for (i = 1; i <= m; ++i) {
scanf("%d", a + i);
memset(f, 0, sizeof f);
for (j = i - 1, t = 0; j && a[j] != a[i]; --j)
if (!f[a[j]]) {
f[a[j]] = 1;
t += w[a[j]];
}
ans += t;
}
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MM = 1005;
const long long MOD = 1000000007;
int n, m;
int w[MM], b[MM];
int vis[MM], sta[MM];
int main() {
int cnt = 1;
scanf("%d%d", &n, &m);
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]);
for (int i = 1; i <= m; i++) {
if (vis[b[i]]) continue;
vis[b[i]] = 1;
sta[cnt++] = b[i];
}
for (int i = 1; i <= n; i++) {
if (vis[i]) continue;
sta[cnt++] = i;
}
int ans = 0;
for (int i = 1; i <= m; i++) {
int index = 1;
for (int j = 1; j <= n; j++) {
if (b[i] == sta[j]) {
index = j;
break;
}
ans += w[sta[j]];
}
for (int j = index - 1; j >= 1; j--) sta[j + 1] = sta[j];
sta[1] = b[i];
}
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> w(n), b(m);
for (int i = 0; i < n; i++) cin >> w[i];
for (int i = 0; i < m; i++) {
cin >> b[i];
b[i]--;
}
long long int otv = 0;
for (int i = 0; i < m; i++) {
vector<bool> was(n, false);
for (int j = i - 1; j >= 0 && b[j] != b[i]; j--)
if (!was[b[j]]) {
was[b[j]] = true;
otv += w[b[j]];
}
}
cout << otv;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int W[510];
int L[1010];
int P[510];
int main() {
int n, m, i, j, k;
memset(W, 0, sizeof(W));
memset(L, 0, sizeof(L));
memset(P, 0, sizeof(P));
cin >> n >> m;
for (i = 1; i <= n; i++) cin >> W[i];
for (i = 0; i < m; i++) cin >> L[i];
vector<int> list;
for (i = 0; i < m; i++) {
if (P[L[i]] == 0) {
list.push_back(L[i]);
P[L[i]] = 1;
}
}
int res = 0;
for (i = 0; i < m; i++) {
k = L[i];
for (j = 0; j < list.size(); j++) {
if (list[j] == k) {
list.erase(list.begin() + j);
list.insert(list.begin(), k);
break;
} else {
res += W[list[j]];
}
}
}
cout << res << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int mint(long long int a, long long int b) {
if (a < b)
return a;
else
return b;
}
int main() {
long long int n, m;
cin >> n >> m;
int arr[n];
long long int i;
for (i = 0; i < n; ++i) {
cin >> arr[i];
}
bool check[n];
memset(check, 0, sizeof(check));
int mm[m];
for (i = 0; i < m; ++i) {
cin >> mm[i];
}
long long int ans = 0;
long long int j;
for (i = 0; i < m; ++i) {
for (j = i - 1; j >= 0; j--) {
if (mm[j] == mm[i])
break;
else if (check[mm[j] - 1] == 0) {
ans += arr[mm[j] - 1];
check[mm[j] - 1] = 1;
}
}
memset(check, 0, sizeof(check));
}
cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[512], b[1024];
int main() {
int n, m;
cin >> n >> m;
for (int i = 1; i <= n; i++) cin >> a[i];
int ans = 0;
for (int i = 0; i < m; i++) {
cin >> b[i];
int now = 0;
set<int> st;
for (int j = i - 1; j >= 0 && b[i] != b[j]; j--) {
if (st.find(b[j]) == st.end()) now += a[b[j]];
st.insert(b[j]);
}
ans += now;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int arr[1005], Stack[1005];
bool vis[1005];
map<int, int> Map;
int main() {
int n, m;
cin >> n >> m;
for (int i = 1; i <= n; ++i) {
int e;
cin >> e;
Map.insert(make_pair(i, e));
}
int pos = 1;
for (int i = 1; i <= m; ++i) {
cin >> arr[i];
if (!vis[arr[i]] && pos <= n) {
Stack[pos] = arr[i];
vis[arr[i]] = true;
pos++;
}
}
long long sum = 0;
for (int i = 2; i <= m; ++i) {
for (int j = 1; j <= n; ++j) {
if (Stack[j] == arr[i]) {
for (int k = j; k > 1; --k) {
sum += Map[Stack[k - 1]];
swap(Stack[k], Stack[k - 1]);
}
}
}
}
cout << sum << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const double ESP = 1e-5;
const double PI = acos(-1.0);
const int MOD = 1e9 + 7;
const int MAXN = 1e5;
int weight[MAXN], pos[MAXN];
int st[MAXN], num[MAXN];
bool vis[MAXN];
int main() {
int n, m;
while (scanf("%d%d", &n, &m) != EOF) {
memset(vis, 0, sizeof(vis));
for (int i = 1; i <= n; i++) {
scanf("%d", &weight[i]);
}
int cnt = 0;
for (int i = 0; i < m; i++) {
scanf("%d", &st[i]);
if (!vis[st[i]]) {
pos[cnt++] = st[i];
vis[st[i]] = true;
}
}
int ans = 0;
memset(vis, 0, sizeof(vis));
cnt = 0;
for (int i = 0; i < m; i++) {
int p;
for (p = 0; pos[p] != st[i]; p++) {
ans += weight[pos[p]];
}
for (int j = p; j >= 1; j--) pos[j] = pos[j - 1];
pos[0] = st[i];
}
printf("%d\n", ans);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T>
bool Maximize(T &v, T nv) {
if (nv > v) return v = nv, 1;
return 0;
}
template <class T>
bool Minimize(T &v, T nv) {
if (nv < v) return v = nv, 1;
return 0;
}
template <class T>
T Mod(T &v, T mod) {
return v = (v % mod + mod) % mod;
}
const long long INFLL = numeric_limits<long long>::max();
const long INF = numeric_limits<long>::max(), N = 501, M = 1001;
const long di[4][2] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
long w[N], a[M];
bool u[N];
bool cmp(long a, long b) { return w[a] < w[b]; }
void solve() {
long n, m;
scanf("%ld %ld", &n, &m);
for (long i = 1; i <= n; ++i) scanf("%ld", w + i);
deque<long> s;
for (long i = 0; i < m; ++i) {
scanf("%ld", a + i);
if (!u[a[i]]) s.push_back(a[i]), u[a[i]] = 1;
;
}
vector<long> ss;
for (long i = 1; i <= n; ++i) {
if (!u[i]) ss.push_back(i);
}
sort((ss).begin(), (ss).end(), cmp);
s.insert(s.end(), (ss).begin(), (ss).end());
long ans = 0;
for (long i = 0; i < m; ++i) {
long j;
for (j = 0; s[j] != a[i]; ++j) {
ans += w[s[j]];
}
s.erase(s.begin() + j);
s.push_front(a[i]);
}
printf("%ld\n", ans);
}
void init() {}
int main() {
init();
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int gcd(int x, int y) {
if (y == 0) return x;
return gcd(y, x % y);
}
int lcm(int x, int y) {
long long Lcm = 1LL * x * y;
Lcm = Lcm / gcd(x, y);
return Lcm;
}
int a[600], b[1009], aa[1009][1009];
int main() {
int n, m;
cin >> n >> m;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = 1; i <= m; i++) cin >> b[i];
long long int l = 0;
for (int i = 1; i <= m; i++) {
for (int j = i + 1; j <= m; j++) {
if (b[j] != b[i] && aa[b[i]][b[j]] == 0) {
l += a[b[i]];
aa[b[i]][b[j]] = 1;
aa[b[j]][b[i]] = 0;
}
}
}
cout << l << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, m, i, j, a[505] = {0}, b[1005] = {0}, ans = 0;
scanf("%I64d%I64d", &n, &m);
for (i = 1; i <= n; i++) {
scanf("%I64d", &a[i]);
}
for (i = 1; i <= m; i++) {
scanf("%I64d", &b[i]);
long long int s = 0;
bool visited[505] = {false};
for (j = i - 1; j > 0; j--) {
if (b[j] == b[i]) break;
if (visited[b[j]]) continue;
s += (a[b[j]]);
visited[b[j]] = true;
}
ans += s;
}
printf("%I64d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m;
int weight[512], plan[1024];
bool vis[512];
stack<int> book, hand;
int ans;
int take(int a) {
int taken = 0;
while (book.top() != a) {
hand.push(book.top());
book.pop();
}
book.pop();
while (!hand.empty()) {
taken += weight[hand.top()];
book.push(hand.top());
hand.pop();
}
book.push(a);
return taken;
}
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) scanf("%d", &weight[i]);
for (int i = 1; i <= m; i++) {
scanf("%d", &plan[i]);
if (!vis[plan[i]]) hand.push(plan[i]);
vis[plan[i]] = 1;
}
while (!hand.empty()) {
book.push(hand.top());
hand.pop();
}
for (int i = 1; i <= m; i++) ans += take(plan[i]);
printf("%d", ans);
return 0;
}
|
#include <bits/stdc++.h>
const int N = 1001;
const int M = 5001;
int n, m, k, ans, a[N], b[M], c[M], f[N + 1];
inline int change(int ll) {
int tp = 0, t = c[ll];
for (register int i = ll - 1; i > -1; --i) c[i + 1] = c[i], tp += a[c[i]];
c[0] = t;
return tp;
}
int main() {
scanf("%d%d", &n, &m);
for (register int i = 1; i <= n; ++i) scanf("%d", &a[i]);
for (register int i = 0; i < m; ++i) scanf("%d", &b[i]);
c[0] = b[0], f[c[0]] = 1;
for (register int i = 1; i < m; ++i)
if (b[i] != c[k] && !f[b[i]]) c[++k] = b[i], f[b[i]] = 1;
for (register int i = 0; i < m; ++i)
for (register int j = 0; j <= k; ++j)
if (b[i] == c[j]) {
ans += change(j);
break;
}
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int sum, b[5001], c[5001], d[5001], a[5001];
int main() {
stack<int> s1, s2;
int n, day, q, con = 0, l;
cin >> n >> day;
for (int i = 0; i != n; i++) {
cin >> q;
b[i + 1] = q;
a[i + 1] = q;
}
for (int i = 0; i != day; i++) {
cin >> q;
if (b[q] != 0) {
d[con] = q;
con++;
b[q] = 0;
c[i] = q;
}
c[i] = q;
}
for (int i = con - 1; i >= 0; i--) s1.push(d[i]);
for (int i = 0; i != day; i++) {
while (!s1.empty()) {
if (s1.top() == c[i]) {
l = s1.top();
s1.pop();
break;
} else {
sum += a[s1.top()];
s2.push(s1.top());
s1.pop();
}
}
while (!s2.empty()) {
s1.push(s2.top());
s2.pop();
}
s1.push(l);
}
cout << sum;
return 0;
}
|
#include <bits/stdc++.h>
int w[505];
int book[505];
int v[1005];
int used[505];
int main(void) {
int n, m;
int k;
int r = 0;
scanf(" %d %d", &n, &m);
for (int i = 1; i <= n; i++) {
used[i] = 0;
scanf(" %d", &w[i]);
}
for (int i = 1; i <= m; i++) {
scanf(" %d", &v[i]);
}
k = 1;
for (int i = 1; i <= m; i++) {
if (!used[v[i]]) {
used[v[i]] = 1;
book[k++] = v[i];
}
}
for (int i = 1; i <= m; i++) {
for (int j = 1; j < k; j++) {
if (book[j] == v[i]) {
for (int p = j - 1; p >= 1; p--) {
r += w[book[p]];
book[p + 1] = book[p];
}
book[1] = v[i];
break;
}
}
}
printf("%d\n", r);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int w[50000], da[50000], done[50000], pos[50000], indx[50000];
int main() {
int n, m;
int i;
while (cin >> n >> m) {
for (i = 1; i <= n; i++) cin >> w[i];
for (i = 1; i <= m; i++) cin >> da[i];
memset(done, 0, sizeof(done));
for (int st = 1, sum = 0; st <= m && sum < n; st++) {
if (!done[da[st]]) {
done[da[st]] = 1;
pos[sum + 1] = da[st];
indx[da[st]] = sum + 1;
sum++;
}
}
int ans = 0;
for (i = 1; i <= m; i++) {
int k = indx[da[i]];
pos[0] = pos[k];
for (int j = k - 1; j >= 1; j--) {
ans += w[pos[j]];
pos[j + 1] = pos[j];
indx[pos[j + 1]] = j + 1;
}
pos[1] = pos[0];
indx[pos[1]] = 1;
}
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int n, m;
scanf("%d %d", &n, &m);
int W[600], M[1100];
int i, j;
for (i = 0; i < n; ++i) scanf("%d", &W[i]);
for (i = 0; i < m; ++i) scanf("%d", &M[i]);
int stack[600], top = n - 1;
int visited[600] = {0};
for (i = 0; i < m; ++i) {
if (visited[M[i]] == 0) {
stack[top--] = M[i];
visited[M[i]] = 1;
}
}
int total = 0;
for (i = 0; i < m; ++i) {
j = n;
while (stack[--j] != M[i]) total += W[stack[j] - 1];
int T[600];
int k = 0;
top = n;
while (stack[--top] != M[i]) T[k++] = stack[top];
int l = stack[top];
while (k > 0) stack[top++] = T[--k];
stack[top++] = l;
}
printf("%d", total);
return (0);
}
|
#include <bits/stdc++.h>
using namespace std;
int a[1000000], b[1000000];
int main() {
int n, m, i, j, k, l, ct = 0, s = 0, x, y;
cin >> n >> m;
vector<pair<int, int> > v, vx;
for (i = 0; i < n; i++) {
cin >> x;
v.push_back(make_pair(x, i + 1));
}
for (i = 0; i < m; i++) cin >> a[i];
for (i = 0; i < m; i++) {
if (b[a[i]] == 0) {
b[a[i]] = 1;
for (j = 0; j < n; j++) {
if (v[j].second == a[i]) {
vx.push_back(v[j]);
break;
}
}
}
if (vx.size() == n) break;
}
pair<int, int> p;
y = a[0];
for (i = 0; i < n; i++) {
if (y == vx[i].second) {
p = vx[i];
vx.erase(vx.begin() + i);
vx.insert(vx.begin(), p);
break;
}
}
for (i = 1; i < m; i++) {
y = a[i];
for (j = 0; j < vx.size(); j++) {
if (vx[j].second == y) {
p = vx[j];
vx.erase(vx.begin() + j);
vx.insert(vx.begin(), p);
break;
} else
s += vx[j].first;
}
}
cout << s << endl;
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int n, m;
int book;
std::vector<int> weights;
std::vector<int> readOrder;
std::vector<int> readOrderDuplicate;
std::cin >> n >> m;
for (int i = 0; i < n; ++i) {
std::cin >> book;
weights.push_back(book);
}
for (int i = 0; i < m; ++i) {
std::cin >> book;
readOrder.push_back(book);
}
readOrderDuplicate = readOrder;
std::vector<int> stackOrder;
for (int i = 0; i < n; ++i) {
book = readOrderDuplicate[0];
stackOrder.push_back(book);
for (int j = 0; j < readOrderDuplicate.size(); ++j) {
if (readOrderDuplicate[j] == book) {
readOrderDuplicate.erase(readOrderDuplicate.begin() + j);
j -= 1;
}
}
}
int mass = 0;
int bookPos;
for (int i = 0; i < readOrder.size(); ++i) {
book = readOrder[i];
for (int j = 0; j < stackOrder.size(); ++j) {
if (book == stackOrder[j]) {
bookPos = j;
j = stackOrder.size();
} else {
mass += weights[stackOrder[j] - 1];
}
}
stackOrder.erase(stackOrder.begin() + bookPos);
stackOrder.insert(stackOrder.begin(), book);
}
std::cout << mass << std::endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 510;
const int mod = 1e9 + 9;
int a[maxn], b[maxn * 2];
bool vis[maxn];
int main() {
memset(vis, false, sizeof(vis));
int ans = 0;
int n, m;
cin >> n >> m;
for (int i = 1; i <= n; i++) cin >> a[i];
for (int i = 1; i <= m; i++) cin >> b[i];
for (int i = 1; i <= m; i++) {
memset(vis, false, sizeof(vis));
for (int j = i - 1; j >= 1; j--)
if (b[j] == b[i])
break;
else if (!vis[b[j]]) {
ans += a[b[j]];
vis[b[j]] = true;
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[2000];
int w[2000];
int b[2000];
int mark[2000] = {0};
int book[2000];
int sp = 0;
int main() {
int i, j, t, n, m;
deque<int> dq;
int sum = 0;
cin >> n >> m;
for (i = 1; i <= n; ++i) cin >> w[i];
for (i = 0; i < m; ++i) {
cin >> b[i];
if (mark[b[i]] == 0) {
dq.push_back(b[i]);
mark[b[i]] = 1;
for (int i = sp; i > 0; --i) {
book[i] = book[i - 1];
sum += w[book[i]];
}
book[0] = b[i];
sp++;
} else {
for (j = 0; j < sp; ++j)
if (book[j] == b[i]) break;
for (int i = j; i > 0; --i) {
book[i] = book[i - 1];
sum += w[book[i]];
}
book[0] = b[i];
}
}
cout << sum;
}
|
#include <bits/stdc++.h>
int main(void) {
int n, d, i, j, k, ans = 0;
scanf("%d %d", &n, &d);
int w[n + 10], b[d + 10];
for (i = 0; i < n; i++) scanf("%d", &w[i]);
for (i = 0; i < d; i++) scanf("%d", &b[i]);
bool visit[n + 10];
for (i = 0; i < n + 10; i++) visit[i] = false;
for (i = 0; i < d; i++) {
for (k = 0; k < n + 10; k++) visit[k] = false;
for (j = i - 1; j >= 0 && b[i] != b[j]; j--) {
if (!visit[b[j]]) {
ans += w[b[j] - 1];
visit[b[j]] = true;
}
}
}
printf("%d", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long MaxN = 1e6 + 10;
const long long Mod = 1e9 + 7;
const long long inf = 1e18;
long long d[1010], b[1010];
void solve() {
long long n, m;
cin >> n >> m;
for (long long i = 0; i < n; i++) cin >> b[i];
for (long long i = 0; i < m; i++) cin >> d[i];
long long ans = 0;
for (long long i = m - 1; i >= 0; i--) {
set<long long> st;
for (long long j = i - 1; j >= 0; j--) {
if (d[j] == d[i]) break;
st.insert(d[j]);
}
for (auto j : st) ans += b[j - 1];
}
cout << ans;
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long t = 1;
while (t--) solve();
return 0;
}
|
#include <bits/stdc++.h>
int w[505], read[1005];
int vis[505];
int main() {
int n, m;
while (~scanf("%d%d", &n, &m)) {
memset(vis, 0, sizeof(vis));
std::stack<int> st1, st2;
for (int i = 1; i <= n; ++i) scanf("%d", &w[i]);
for (int i = 1; i <= m; ++i) {
scanf("%d", &read[i]);
if (!vis[read[i]]) {
st2.push(read[i]);
vis[read[i]] = 1;
}
}
while (!st2.empty()) {
st1.push(st2.top());
st2.pop();
}
int ans = 0;
for (int i = 1; i <= m; ++i) {
int weight = 0;
while (st1.top() != read[i]) {
weight += w[st1.top()];
st2.push(st1.top());
st1.pop();
}
int re = st1.top();
st1.pop();
while (!st2.empty()) {
st1.push(st2.top());
st2.pop();
}
st1.push(re);
ans += weight;
}
printf("%d\n", ans);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1010;
int s[maxn], lst[maxn];
int w[maxn], vis[maxn];
int q[maxn];
int main() {
int n, m, i, j, k;
cin >> n >> m;
for (i = 1; i <= n; i++) cin >> w[i];
int ans = 0;
for (i = 1; i <= m; i++) {
cin >> j;
q[i] = j;
for (k = i - 1; k >= 1; k--)
if (q[k] == j)
break;
else {
if (vis[q[k]] == i)
;
else {
vis[q[k]] = i;
ans += w[q[k]];
}
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m;
int a[501], pos[501];
int bit[1001];
void update(int u, int val) {
while (u > 0) {
bit[u] += val;
u -= u & (-u);
}
}
int get(int u) {
int kq = 0;
while (u <= m) {
kq += bit[u];
u += u & (-u);
}
return kq;
}
int main() {
scanf("%d %d", &n, &m);
for (int i = 1; i <= n; ++i) scanf("%d", &a[i]);
memset(bit, 0, sizeof(bit));
for (int i = 1; i <= n; ++i) pos[i] = 0;
int ans = 0;
for (int i = 1; i <= m; ++i) {
int u;
scanf("%d", &u);
ans += get(pos[u] + 1);
if (pos[u]) update(pos[u], -a[u]);
pos[u] = i;
update(pos[u], a[u]);
}
printf("%d", ans);
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T>
T min3(T a, T b, T c) {
return min(a, min(b, c));
};
template <class T>
T max3(T a, T b, T c) {
return max(a, max(b, c));
};
int n, m;
int w[510];
int a[1100];
bool v[1100];
int b[1100];
int main() {
scanf("%d%d", &n, &m);
for (int i = 0; i < n; i++) scanf("%d", &w[i]);
int t = 0;
for (int i = 0; i < m; i++) {
scanf("%d", &a[i]);
a[i]--;
if (v[a[i]] == false) {
v[a[i]] = true;
b[t++] = a[i];
}
}
long long res = 0;
for (int i = 0; i < m; i++) {
int sum = 0;
for (int j = 0; j < t; j++)
if (b[j] != a[i]) {
sum += w[b[j]];
} else {
for (int k = j; k > 0; k--) b[k] = b[k - 1];
b[0] = a[i];
res += sum;
break;
}
}
cout << res << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m;
int W[510];
int B[1010];
bool USED[510];
int A[510];
int a = 1;
int ans = 0;
int main() {
int i, j;
scanf("%d%d", &n, &m);
for (i = 1; i <= n; i++) {
scanf("%d", &W[i]);
}
for (i = 1; i <= m; i++) {
scanf("%d", &B[i]);
if (USED[B[i]] == false) {
A[a++] = B[i];
USED[B[i]] = true;
}
}
for (i = 1; i <= m; i++) {
for (j = 1; A[j] != B[i]; j++) {
ans += W[A[j]];
}
for (; j > 1; j--) {
swap(A[j - 1], A[j]);
}
}
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int flag[1000];
long long w[1000];
int a[1000];
int n, m, cur = 0, t[2000], k, tmp;
long long res = 0;
int main() {
cin >> n >> m;
memset(flag, 0, sizeof(flag));
for (int i = 1; i <= n; ++i) cin >> w[i];
for (int i = 1; i <= m; ++i) {
cin >> t[i];
if (flag[t[i]])
continue;
else {
flag[t[i]] = true;
a[++cur] = t[i];
}
}
for (int i = 1; i <= m; ++i) {
for (int j = 1; j <= n; ++j) {
if (a[j] == t[i]) {
k = j;
break;
}
res += w[a[j]];
}
tmp = a[k];
for (int j = k - 1; j; --j) a[j + 1] = a[j];
a[1] = tmp;
}
cout << res << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const long double PI = 4 * atan((long double)1);
const long long int INF = 1e18;
const long long int NINF = -1e18;
long long int get_hash(string s) {
long long int N = 1000001;
long long int base[N], A = 11, MD = 1110111110111;
base[0] = 1;
for (long long int i = (1); i < (N); ++i) base[i] = (base[i - 1] * A) % MD;
long long int hs = 0;
for (long long int i = (0); i < (s.size()); ++i) {
hs += (s[i] * base[i]);
hs %= MD;
}
return hs;
}
long long power(long long a, long long n) {
long long res = 1;
while (n) {
if (n % 2) res *= a;
a *= a;
n /= 2;
}
return res;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
int n, m;
cin >> n >> m;
map<int, int> mpc;
long long int a[n], b[m];
for (long long int i = (0); i < (n); ++i) cin >> a[i];
int arr[n];
map<int, int> mpa, mpb;
int k = 0;
for (long long int i = (0); i < (m); ++i) {
cin >> b[i];
if (mpa[b[i]] != 1) {
arr[k] = b[i];
k++;
mpa[b[i]] = 1;
}
}
if (k != n) {
for (long long int i = (1); i < (n + 1); ++i) {
if (mpa[i] != 1) {
mpa[i] = 1;
arr[k] = i;
k++;
}
}
}
stack<int> st, st1;
for (int i = n - 1; i >= 0; i--) st.push(arr[i]);
long long int ans = 0;
for (long long int i = (0); i < (m); ++i) {
int x = b[i];
while (st.top() != x) {
st1.push(st.top());
ans += a[st.top() - 1];
st.pop();
}
st.pop();
while (!st1.empty()) {
st.push(st1.top());
st1.pop();
}
st.push(x);
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename T>
T gcd(T u, T v) {
while (v != 0) {
T r = u % v;
u = v;
v = r;
}
return u;
}
template <typename T>
T factorial(T n) {
return (n == 1 || n == 0) ? 1 : factorial(n - 1) * n;
}
int n, m, a[100005], b[100005], c[100005], ans;
std::vector<int> v;
int main() {
scanf("%d %d", &n, &m);
for (int i = 0; i < n; ++i) scanf("%d", &a[i]);
for (int i = 0; i < m; ++i) scanf("%d", &b[i]);
for (int i = 0; i < m; ++i) {
if (c[b[i] - 1] == 0) v.push_back(b[i]);
c[b[i] - 1] = 1;
}
ans = 0;
for (int i = 0; i < m; ++i) {
for (int j = 0; j < v.size(); ++j) {
if (v[j] != b[i])
ans += a[v[j] - 1];
else {
for (int k = j; k > 0; --k) v[k] = v[k - 1];
v[0] = b[i];
break;
}
}
}
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
const double PI = acos(-1.0);
const int INF = 0x3f3f3f3f;
using namespace std;
const double eps = 1e-8;
const int MAXN = 1100 + 10;
const int MOD = 1000007;
const int dir[][2] = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};
int w[MAXN], brow[MAXN], vis[MAXN];
int main() {
int n, m, i, j;
scanf("%d%d", &n, &m);
for (i = 1; i <= n; i++) scanf("%d", &w[i]);
for (i = 1; i <= m; i++) scanf("%d", &brow[i]);
int ans = 0;
for (i = 1; i <= m; i++) {
memset(vis, 0, sizeof(vis));
for (j = i - 1; j > 0; j--) {
if (brow[i] == brow[j]) break;
if (!vis[brow[j]]) {
vis[brow[j]] = 1;
ans += w[brow[j]];
}
}
}
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const int mod = 1e9 + 7;
const double eps = 1e-8;
const double pi = acos(-1.0);
const int dx[] = {-1, 1, 0, 0};
const int dy[] = {0, 0, -1, 1};
int w[2005], b[2005], f[2005], pos[2005];
int read(int pos) {
int res = 0;
while (pos) {
res += f[pos];
pos -= pos & -pos;
}
return res;
}
void update(int pos, int val) {
while (pos < 2005) {
f[pos] += val;
pos += pos & -pos;
}
}
int main() {
ios_base::sync_with_stdio(0);
int n, m, cnt, res;
cin >> n >> m;
for (int i = 1; i <= n; ++i) cin >> w[i];
cnt = res = 0;
for (int i = 0; i < m; ++i) {
cin >> b[i];
if (!pos[b[i]]) {
pos[b[i]] = m + cnt + 1;
update(pos[b[i]], w[b[i]]);
++cnt;
}
}
for (int i = 0; i < m; ++i) {
res += read(pos[b[i]] - 1);
update(pos[b[i]], -w[b[i]]);
pos[b[i]] = m - i;
update(pos[b[i]], w[b[i]]);
}
cout << res << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
inline void OPEN(const string &s) {
freopen((s + ".in").c_str(), "r", stdin);
freopen((s + ".out").c_str(), "w", stdout);
}
int n, m, w[1100], b[1100], visited[1100];
int main() {
scanf("%d%d", &n, &m);
for (int i = 0; i < (n); ++i) scanf("%d", &w[i]);
for (int i = 0; i < (m); ++i) scanf("%d", &b[i]);
vector<int> ans;
for (int i = 0; i < (m); ++i) {
if (!visited[b[i]]) {
visited[b[i]] = 1;
ans.push_back(b[i]);
}
}
int total = 0;
for (int i = 0; i < (m); ++i) {
int weight = 0, pos = -1;
for (int j = 0; j < (m); ++j) {
if (ans[j] == b[i]) {
pos = j;
break;
} else {
weight += w[ans[j] - 1];
}
}
total += weight;
for (int j = (pos + 1) - 1; 0 <= j; --j) {
if (j) ans[j] = ans[j - 1];
}
ans[0] = b[i];
}
printf("%d\n", total);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int a[500], b[1000];
for (int i = 0; i < n; i++) cin >> a[i];
int c = 0;
vector<pair<int, int> > f(n, make_pair(1000, 0));
for (int i = 0; i < n; i++) f[i].second = i;
for (int i = 0; i < m; i++) {
cin >> b[i];
b[i]--;
if (f[b[i]].first == 1000) {
f[b[i]].first = ++c;
}
}
int w = 0, x;
for (int i = 0; i < m; i++) {
sort(f.begin(), f.end());
for (int j = 0; j < n; j++) {
if (f[j].second == b[i]) {
x = j;
break;
}
}
for (int j = 0; j < x; j++) {
w += a[f[j].second];
f[j].first++;
}
f[x].first = 1;
}
cout << w;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1010;
int N, M;
int w[maxn];
int num[maxn];
int vis[maxn];
int a[maxn];
int main() {
while (scanf("%d%d", &N, &M) != EOF) {
for (int i = 1; i <= N; i++) scanf("%d", &w[i]);
for (int i = 1; i <= M; i++) scanf("%d", &a[i]);
int ans = 0;
for (int i = 1; i <= M; i++) {
memset(vis, 0, sizeof(vis));
for (int j = i - 1; j > 0; j--)
if (a[j] == a[i])
break;
else if (!vis[a[j]]) {
vis[a[j]] = 1;
ans += w[a[j]];
}
}
printf("%d\n", ans);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int w[505];
int b[1505];
set<int> s;
vector<int> v;
int main() {
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];
b[i]--;
if (!s.count(b[i])) {
s.insert(b[i]);
v.push_back(b[i]);
}
}
for (int i = 0; i < n; i++) {
if (!s.count(i)) {
v.push_back(i);
}
}
int ans = 0;
for (int i = 0; i < m; i++) {
int pos = -1;
for (int j = 0; j < v.size(); j++) {
if (v[j] == b[i]) {
pos = j;
break;
}
}
for (int j = pos - 1; j >= 0; j--) {
ans += w[v[j]];
v[j + 1] = v[j];
}
v[0] = b[i];
}
cout << ans;
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.