text stringlengths 49 983k |
|---|
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
const long long N = 100000;
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
os << "{";
for (auto it = v.begin(); it != v.end(); ++it) {
if (it != v.begin()) os << ", ";
os << *it;
}
return os << "}";
}
template <typename first, typename second>
ostream &operator<<(ostream &os, const pair<first, second> &p) {
return os << "(" << p.first << ", " << p.second << ")";
}
template <typename T>
ostream &operator<<(ostream &os, const set<T> &v) {
os << "[";
for (auto it = v.begin(); it != v.end(); ++it) {
if (it != v.begin()) os << ", ";
os << *it;
}
return os << "]";
}
template <typename T>
ostream &operator<<(ostream &os, const multiset<T> &v) {
os << "[";
for (auto it = v.begin(); it != v.end(); ++it) {
if (it != v.begin()) os << ", ";
os << *it;
}
return os << "]";
}
template <typename first, typename second>
ostream &operator<<(ostream &os, const map<first, second> &v) {
os << "[";
for (auto it = v.begin(); it != v.end(); ++it) {
if (it != v.begin()) os << ", ";
os << it->first << " = " << it->second;
}
return os << "]";
}
long long solve(vector<long long> a, vector<long long> b,
vector<long long> stac) {
long long res = 0;
for (long long i = 0; i < b.size(); i++) {
long long cur = b[i];
long long W = 0;
for (long long j = 0; j < stac.size(); j++) {
if (b[i] == stac[j]) {
stac.erase(stac.begin() + j);
reverse(stac.begin(), stac.end());
stac.push_back(b[i]);
reverse(stac.begin(), stac.end());
break;
}
W += a[stac[j] - 1];
}
res += W;
}
return res;
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
long long n;
cin >> n;
long long m;
cin >> m;
vector<long long> a(n);
for (long long i = 0; i < n; i++) {
cin >> a[i];
}
vector<long long> b(m);
for (long long i = 0; i < m; i++) {
cin >> b[i];
}
vector<long long> stac;
map<long long, long long> done;
for (long long i = 0; i < m; i++) {
if (!done[b[i]]) {
stac.push_back(b[i]);
done[b[i]] = 1;
}
}
long long res = solve(a, b, stac);
cout << res << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f, MOD = 1e9 + 7;
int a[1010];
int b[1010];
int ans = 0;
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];
for (int j = i - 1; j > 0; j--) {
if (b[j] == b[i]) {
b[j] = 0;
break;
} else {
ans += a[b[j]];
}
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int t, cs, n, m, k;
int a[505];
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i < n + 1; i++) scanf("%d", &a[i]);
vector<int> v, s;
map<int, int> mp;
while (m--) {
scanf("%d", &k);
s.push_back(k);
if (mp[k]) continue;
mp[k] = 1;
v.push_back(k);
}
stack<int> st;
for (int i = v.size() - 1; i >= 0; i--) st.push(v[i]);
int sum = 0;
stack<int> tmp = st;
for (int i = 0; i < s.size(); i++) {
stack<int> q;
q.push(s[i]);
while (st.top() != s[i]) {
sum += a[st.top()];
q.push(st.top());
st.pop();
}
st.pop();
while (!q.empty()) {
st.push(q.top());
q.pop();
}
tmp = st;
}
printf("%d", sum);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <class _T>
_T MAX(_T a, _T b) {
return a > b ? a : b;
}
template <class _T>
_T MIN(_T a, _T b) {
return a < b ? a : b;
}
template <class _T>
_T GCD(_T a, _T b) {
return b ? GCD(b, a % b) : a;
}
const int maxn = 1 << 10;
int n, m, w[maxn], b[maxn], done[maxn];
vector<int> s, temp;
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]);
if (done[b[i]]) continue;
done[b[i]] = 1;
s.push_back(b[i]);
}
int aa = 0;
for (int(i) = (1); (i) <= (m); (i)++) {
int j = 0;
int ans = 0;
for (j = 0; j < n; j++) {
if (s[j] == b[i]) break;
ans += w[s[j]];
}
for (int k = j; k > 0; k--) {
s[k] = s[k - 1];
}
s[0] = b[i];
aa += ans;
}
printf("%d\n", aa);
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int n, i, j, m, tot;
int weg[555], hastnd[555], book[1010];
while (scanf("%d%d", &n, &m) != EOF) {
tot = 0;
for (i = 1; i <= n; i++) {
scanf("%d", &weg[i]);
}
for (i = 0; i < m; i++) {
scanf("%d", &book[i]);
}
for (i = 1; i < m; i++) {
memset(hastnd, 0, sizeof(hastnd));
for (j = i - 1; j >= 0; j--) {
if (book[i] == book[j])
break;
else if (hastnd[book[j]] == 0) {
hastnd[book[j]]++;
tot += weg[book[j]];
}
}
}
printf("%d\n", tot);
}
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int n, m;
scanf("%d %d", &n, &m);
int w[n];
int b[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]--;
}
bool a[n];
memset(a, 0, sizeof(a));
int c[n];
int pos = 0;
int p[n];
for (int i = 0; i < m; ++i) {
if (!a[b[i]]) {
c[pos] = b[i];
p[b[i]] = pos;
pos++;
a[b[i]] = true;
}
}
int ans = 0;
for (int i = 1; i < m; ++i) {
for (int j = p[b[i]]; j > 0; --j) {
c[j] = c[j - 1];
p[c[j]] = j;
ans += w[c[j]];
}
c[0] = b[i];
p[b[i]] = 0;
}
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 505, MAXM = 1005;
int flag[MAXN], s[MAXN], b[MAXM], w[MAXN];
int main() {
int n, m;
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]);
int ans = 0, sum = 0;
memset(flag, 0, sizeof(flag));
for (int i = 0; i < m; ++i) {
if (flag[b[i]] == 0) {
flag[b[i]] = 1;
s[b[i]] = sum;
sum += w[b[i] - 1];
continue;
}
}
for (int i = m - 1; i > 0; --i) {
int dq = b[i];
memset(flag, 0, sizeof(flag));
int pd = 0, sum = 0;
for (int j = i - 1; j >= 0; --j) {
if (b[j] == dq) {
pd = 1;
break;
}
if (flag[b[j]] == 0) {
sum += w[b[j] - 1];
flag[b[j]] = 1;
}
}
if (pd == 1)
ans += sum;
else
ans += s[dq];
}
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, w[510], y[1010];
bool b[510] = {0};
cin >> n >> m;
vector<int> ans;
for (int i = 1; i <= n; ++i) cin >> w[i];
for (int i = 0; i < m; ++i) {
int x;
cin >> x;
if (!b[x]) ans.push_back(x);
b[x] = 1;
y[i] = x;
}
long long jwb = 0;
for (int i = 0; i < m; ++i) {
auto it = ans.begin();
while ((*it) != y[i]) {
jwb += w[(*it)];
++it;
}
ans.erase(it);
ans.insert(ans.begin(), y[i]);
}
cout << jwb << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int getWeight(int today, vector<int>& init, int* weight) {
int ret = 0;
vector<int>::iterator it = init.begin();
while (*it != today) {
ret += weight[*it];
it++;
}
init.erase(it);
init.insert(init.begin(), today);
return ret;
}
int main() {
int ret = 0, visit[600], weight[600], day[1600], n, m;
cin >> n >> m;
vector<int> init;
memset(visit, 0, sizeof(visit));
for (int i = 1; i <= n; i++) cin >> weight[i];
for (int i = 0; i < m; i++) {
cin >> day[i];
if (!visit[day[i]]) {
visit[day[i]] = 1;
init.push_back(day[i]);
}
}
for (int i = 0; i < m; i++) {
ret += getWeight(day[i], init, weight);
}
cout << ret << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m, w[1000], b[2000];
int st[1000], pos, tmp[1000], pos2;
int main() {
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]);
int ans = 0;
pos = 0;
for (int i = (0); i < (m); ++i) {
pos2 = 0;
while ((pos > 0) && (st[pos - 1] != b[i])) {
tmp[pos2] = st[pos - 1];
ans += w[tmp[pos2]];
--pos;
++pos2;
}
if (pos > 0) --pos;
while (pos2 > 0) {
st[pos++] = tmp[--pos2];
}
st[pos++] = b[i];
}
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m;
int s[1005], t[1005];
void init() {
scanf("%d%d", &n, &m);
for (int i = 0; i < n; i++) scanf("%d", &s[i]);
for (int i = 0; i < m; i++) scanf("%d", &t[i]), t[i]--;
}
int st[1005], sz;
bool used[1005];
void process() {
sz = 0;
memset(used, 0, sizeof used);
for (int i = 0; i < m; i++) {
if (used[t[i]]) continue;
used[t[i]] = true;
st[sz++] = t[i];
}
int ans = 0;
for (int i = 0; i < m; i++) {
int ptr = 0;
while (st[ptr] != t[i]) {
ans += s[st[ptr]];
ptr++;
}
while (ptr) st[ptr] = st[ptr - 1], ptr--;
st[0] = t[i];
}
printf("%d\n", ans);
}
int main() {
init();
process();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, w[600], b[1100], i, j, rk[600];
scanf("%d%d", &n, &m);
for (i = 1; i <= n; i++) {
scanf("%d", &w[i]);
}
for (i = 0; i < m; i++) {
scanf("%d", &b[i]);
}
int cnt = 0, vis[550];
memset(vis, 0, sizeof(vis));
for (i = 0; cnt < n && i < m; i++) {
if (!vis[b[i]]) {
vis[b[i]] = 1;
rk[cnt] = b[i];
cnt++;
}
}
int tmp, tt;
int res = 0;
for (i = 0; i < m; i++) {
for (j = 0; j < n; j++) {
if (rk[j] == b[i]) {
tmp = j;
}
}
for (j = 0; j < tmp; j++) {
res += w[rk[j]];
}
tt = rk[tmp];
for (j = tmp; j > 0; j--) {
rk[j] = rk[j - 1];
}
rk[0] = tt;
}
printf("%d\n", res);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[502], b[1003], n, m;
int ans = 0, z;
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++) cin >> a[i], b[i] = -1;
for (int i = 1; i <= m; i++) {
cin >> z;
for (int j = 1; j <= n; j++) {
if (b[j] > b[z]) ans += a[j];
}
b[z] = ans;
}
cout << ans;
}
|
#include <bits/stdc++.h>
int n, m;
int w[501];
int b[1001];
int next[501];
int prev[501];
int head;
int sum = 0;
void order() {
int last;
int select[501] = {0};
head = b[1];
last = head;
select[b[1]] = 1;
prev[head] = 0;
for (int i = 2; i <= m; i++) {
if (select[b[i]] == 0) {
select[b[i]] = 1;
next[last] = b[i];
prev[b[i]] = last;
last = b[i];
}
}
int u = 10;
return;
}
int get_weight(int i) {
int sum = 0;
i = prev[i];
while (i != head) {
sum += w[i];
i = prev[i];
}
sum += w[head];
return sum;
}
void move() {
for (int i = 1; i <= m; i++) {
if (head == b[i]) {
continue;
}
sum += get_weight(b[i]);
next[prev[b[i]]] = next[b[i]];
prev[next[b[i]]] = prev[b[i]];
next[b[i]] = head;
prev[head] = b[i];
head = b[i];
prev[b[i]] = 0;
}
}
void solve() {
order();
move();
return;
}
int main() {
scanf("%d %d\n", &n, &m);
for (int i = 1; i <= n; i++) {
scanf("%d ", w + i);
}
for (int i = 1; i <= m; i++) {
scanf("%d ", b + i);
}
solve();
printf("%d", sum);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<pair<int, int>> books(n + 1), books2(n + 1);
vector<int> query(m);
map<int, int> isMapExist, posX;
for (int i = 0; i < n; i++) {
int x;
scanf("%d", &x);
books[i] = {i, x};
}
int u = 0;
for (int i = 0; i < m; i++) {
int x;
scanf("%d", &x);
x--;
query[i] = x;
if (!isMapExist[x]) {
books2[u] = books[x];
posX[books[x].first] = u;
u++;
}
isMapExist[x] = true;
}
for (int i = 0; i < n; i++) {
if (!isMapExist[i]) {
books2.push_back(books[i]);
posX[books[i].first] = u;
u++;
}
isMapExist[i] = true;
}
long long s = 0;
for (int i = 0; i < m; i++) {
int q = posX[query[i]];
pair<int, int> qq = books2[q];
for (int j = q - 1; j >= 0; j--) {
s += books2[j].second;
posX[books2[j].first]++;
books2[j + 1] = books2[j];
}
posX[qq.first] = 0;
books2[0] = qq;
}
cout << s;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 500;
const int MAXM = 1000;
int w[MAXN + 100];
int b[MAXM + 100];
bool inq[MAXN + 100];
list<int> q;
int main() {
std::ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
for (int i = 1; i <= n; ++i) {
cin >> w[i];
inq[i] = false;
}
for (int i = 1; i <= m; ++i) {
cin >> b[i];
if (!inq[b[i]]) {
q.push_back(b[i]);
inq[b[i]] = true;
}
}
long long ans = 0;
for (int i = 1; i <= m; ++i) {
list<int>::iterator it = q.begin();
while (*it != b[i]) {
ans += w[*it];
++it;
}
q.erase(it);
q.push_front(b[i]);
}
cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const double PI = 2 * acos(0.0);
const double eps = 1e-9;
template <class T>
T jog(T a, T b) {
return a + b;
}
template <class T>
T bog(T a, T b) {
return a - b;
}
template <class T>
T gon(T a, T b) {
return a * b;
}
template <class T>
T sq(T x) {
return x * x;
}
template <class T>
T gcd(T a, T b) {
return b == 0 ? a : gcd(b, a % b);
}
template <class T>
T lcm(T a, T b) {
return (a / gcd(a, b)) * b;
}
template <class T>
T power(T a, T p) {
int res = 1, x = a;
while (p) {
if (p & 1) res = res * x;
x = x * x;
p >>= 1;
}
return res;
}
template <class T>
T cordinatlenth(T a, T b, T c, T d) {
return sqrt(sq(a - c) + sq(b - d));
}
template <class T>
string toString(T n) {
ostringstream oss;
oss << n;
oss.flush();
return oss.str();
}
int toInt(string s) {
int r = 0;
istringstream sin(s);
sin >> r;
return r;
}
long long bigmod(long long a, long long p, long long mod) {
long long res = 1, x = a;
while (p) {
if (p & 1) res = (res * x) % mod;
x = (x * x) % mod;
p >>= 1;
}
return res;
}
int diraction1[] = {-1, 0, 0, 1, 1, -1, -1, 1};
int diraction2[] = {0, -1, 1, 0, 1, -1, 1, -1};
int horsed1[] = {-2, -2, -1, 1, 2, 2, 1, -1};
int horsed2[] = {1, -1, -2, -2, -1, 1, 2, 2};
void input();
int n, m, w[510], b[1010], st[1010];
long long ans;
int main() {
input();
return 0;
}
void input() {
scanf("%d %d", &n, &m);
ans = 0;
for (int i = 1; i <= n; i++) scanf("%d", &w[i]);
for (int i = 0; i < m; i++) scanf("%d", &b[i]);
memset(st, -1, sizeof(st));
int ind = 0;
st[ind++] = b[0];
for (int i = 1; i < m; i++) {
int flag = 1;
for (int j = 0; j < ind; j++) {
if (st[j] == b[i]) {
for (int k = j; k > 0; k--) st[k] = st[k - 1];
st[0] = b[i];
flag = 0;
break;
}
ans += w[st[j]];
}
if (flag) {
ind++;
for (int j = ind; j > 0; j--) st[j] = st[j - 1];
st[0] = b[i];
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> w(n);
for (int i = 0; i < n; ++i) cin >> w[i];
vector<int> por(k);
vector<bool> vis(n);
vector<int> st;
st.reserve(n);
for (int i = 0; i < k; ++i) {
cin >> por[i];
--por[i];
if (!vis[por[i]]) {
st.push_back(por[i]);
vis[por[i]] = 1;
}
}
for (int i = 0; i < n; ++i)
if (!vis[i]) st.push_back(i);
long long int sum = 0;
for (int i = 0; i < k; ++i) {
for (int j = 0; j < n; ++j) {
if (st[j] == por[i]) {
st.erase(st.begin() + j);
st.insert(st.begin(), por[i]);
break;
}
sum += w[st[j]];
}
}
cout << sum << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long a[511];
long long a1[1010];
bool u[511];
long long s[511];
long long pos[511];
int main() {
long long n, m;
cin >> n >> m;
for (long long i = 1; i <= n; i++) {
cin >> a[i];
}
long long ans = 0;
long long uk = 1;
long long uk1 = 0;
for (long long i = 1; i <= m; i++) {
cin >> a1[i];
if (!u[a1[i]]) {
u[a1[i]] = 1;
pos[a1[i]] = uk;
s[a1[i]] = s[uk1] + a[uk1];
uk1 = a1[i];
uk++;
}
}
for (long long i = 1; i <= m; i++) {
long long q = a1[i];
ans += s[q];
for (long long j = 1; j <= n; j++) {
if (pos[q] > pos[j]) {
pos[j]++;
s[j] += a[q];
}
}
s[q] = 0;
pos[q] = 1;
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int w[510], b[5010];
int main() {
int n, m;
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) {
scanf("%d", &w[i]);
}
set<int> s;
long long ans = 0;
for (int i = 1; i <= m; i++) {
scanf("%d", &b[i]);
int t = b[i];
s.clear();
for (int j = i - 1; j >= 1; j--) {
if (t == b[j])
break;
else {
if (s.count(b[j]) == 0) {
s.insert(b[j]);
ans += w[b[j]];
}
}
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m, re;
int w[505], d[1005];
bool ok[505];
int use[505], id;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> w[i];
}
for (int i = 0; i < m; i++) {
cin >> d[i];
d[i]--;
if (!ok[d[i]]) {
use[id++] = d[i];
ok[d[i]] = true;
}
}
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
if (use[j] == d[i]) {
for (int k = j; k > 0; k--) {
use[k] = use[k - 1];
}
use[0] = d[i];
break;
}
re += w[use[j]];
}
}
cout << re;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 105000;
const long long inf = 99999999999999;
const long long mod = 1000000007;
int n, m;
int w[maxn], b[maxn];
int biaoji[maxn];
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++) cin >> w[i];
for (int j = 1; j <= m; j++) cin >> b[j];
int ans = 0;
for (int i = 2; i <= m; i++) {
memset(biaoji, 0, sizeof(biaoji));
for (int j = i - 1; j >= 1; j--) {
if (b[i] == b[j])
break;
else {
if (!biaoji[b[j]]) {
biaoji[b[j]] = 1;
ans += w[b[j]];
}
}
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
long long n, m, mas[1005], ord[1005], w[1005], arr[1005];
int main() {
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> mas[i];
}
int j = 0;
for (int i = 0; i < m; i++) {
cin >> ord[i];
if (w[ord[i]] == 0) {
arr[j] = ord[i];
j++;
}
w[ord[i]]++;
}
long long sum = 0;
for (int i = 0; i < m; i++) {
int j = 0;
while (ord[i] != arr[j]) {
sum += mas[arr[j] - 1];
j++;
}
int varJ = arr[j];
for (int k = j - 1; k >= 0; k--) {
arr[k + 1] = arr[k];
}
arr[0] = varJ;
}
cout << sum;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m;
int w[1200];
int b[1200];
int a[1200];
int c[1200];
int use[1200];
int cmp1(const void *p1, const void *p2) { return *(int *)p1 - *(int *)p2; }
int cmp2(const void *p1, const void *p2) { return *(int *)p2 - *(int *)p1; }
void solve() {
int i, j, k, idx;
for (i = 1; i <= n; i++) {
a[i] = 0;
use[i] = false;
}
j = 1;
for (i = 1; i <= n; i++) scanf("%d", &w[i]);
for (i = 1; i <= m; i++) {
scanf("%d", &b[i]);
if (!use[b[i]]) {
use[b[i]] = true;
c[j++] = b[i];
}
}
i = 1;
while (j <= n && i <= n) {
if (!use[i]) {
c[j++] = i;
use[i] = true;
}
i++;
}
for (i = 1; i <= m; i++) {
k = 0;
idx = 0;
for (j = 1; j <= n; j++) {
if (c[j] == b[i]) {
idx = j;
break;
}
a[c[j]]++;
}
if (idx == 0) continue;
for (j = idx; j > 1; j--) {
c[j] = c[j - 1];
}
c[1] = b[i];
}
w[0] = -10000;
a[0] = 1000000000;
k = 0;
for (i = 1; i <= n; i++) {
k += (a[i] * w[i]);
}
printf("%d\n", k);
}
int main() {
while (scanf("%d %d", &n, &m) != EOF) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int t, n, m;
int b[1010], c[1010], vis[1010];
struct node {
int w, no;
} a[1010];
map<int, int> mm;
vector<int> vec;
int main() {
vec.push_back(0);
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) {
scanf("%d", &t);
mm[i] = t;
}
for (int i = 1; i <= m; i++) {
scanf("%d", &b[i]);
}
for (int i = 1; i <= m; i++) {
if (vis[b[i]] == 0) {
vec.push_back(b[i]);
vis[b[i]] = 1;
}
}
for (int i = 1; i <= n; i++) {
if (vis[i] == 0) vec.push_back(i);
}
for (int i = 1; i <= n; i++) {
a[i].no = vec[i];
a[i].w = mm[vec[i]];
}
long long ans = 0;
int x, y;
for (int i = 1; i <= m; i++) {
for (int j = 1; j <= n; j++) {
if (a[j].no == b[i]) {
x = j;
y = a[j].w;
break;
}
}
for (int j = x - 1; j > 0; j--) {
ans += a[j].w;
a[j + 1] = a[j];
}
a[1].no = b[i], a[1].w = y;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m, a[1004], b[1004], ans;
bool q[1004];
int main() {
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(q, false, sizeof(q));
for (int j = i - 1; j; j--) {
if (b[i] == b[j]) break;
if (!q[b[j]]) q[b[j]] = true, ans += a[b[j]];
}
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool visit[505];
int main() {
memset(visit, false, sizeof(visit));
int n, m, w[505], b[1005];
cin >> n >> m;
for (int i = 1; i <= n; ++i) cin >> w[i];
for (int i = 1; i <= m; ++i) cin >> b[i];
long long int ans = 0;
stack<int> sk, tp;
for (int i = 1; i <= m; ++i) {
if (visit[b[i]]) continue;
visit[b[i]] = true;
tp.push(b[i]);
}
while (!tp.empty()) {
sk.push(tp.top());
tp.pop();
}
for (int i = 1; i <= m; ++i) {
int t = sk.top();
while (t != b[i]) {
ans += w[t];
tp.push(t);
sk.pop();
t = sk.top();
}
sk.pop();
while (!tp.empty()) {
sk.push(tp.top());
tp.pop();
}
sk.push(t);
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long n, q, a[1005], w[505], h, k, ans, t;
bitset<505> b;
map<long long, long long> m;
vector<long long> v;
stack<long long> s;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> q;
for (int i = 1; i <= n; i++) {
cin >> w[i];
}
for (int i = 1; i <= q; i++) {
cin >> a[i];
if (b[a[i]] == false) {
b[a[i]] = true;
s.push(a[i]);
m[a[i]] = s.size();
}
}
t = s.size();
for (int i = 0; i < t; i++) {
k = s.top();
v.push_back(k);
s.pop();
}
for (int i = 0; i < v.size(); i++) {
s.push(v[i]);
}
v.clear();
for (int i = 1; i <= q; i++) {
h = m[a[i]];
if (h == 1) {
continue;
} else {
for (int j = 1; j < h; j++) {
k = s.top();
ans += w[k];
s.pop();
m[k] = j + 1;
v.push_back(k);
}
s.pop();
for (int j = 1; j < h; j++) {
k = v.back();
v.pop_back();
s.push(k);
}
s.push(a[i]);
m[a[i]] = 1;
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const int inf = 1000000000;
bool cmp(pair<int, int> a, pair<int, int> b) { return a.second < b.second; }
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, m;
cin >> n >> m;
stack<int> s;
int a[n + 1], b[m];
long long ans = 0;
for (int i = 1; i <= n; i++) cin >> a[i];
for (int i = 0; i < m; i++) cin >> b[i];
for (int i = 0; i < m; i++) {
int j = b[i];
stack<int> f;
while (!s.empty()) {
int z = s.top();
if (z == j) {
s.pop();
break;
}
f.push(z);
ans += a[z];
s.pop();
}
while (!f.empty()) {
int x = f.top();
s.push(x);
f.pop();
}
s.push(j);
}
cout << ans << "\n";
}
|
#include <bits/stdc++.h>
#pragma warning(disable : 4996)
using namespace std;
int w[505], b[1005];
bool flag[505];
stack<int> order;
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 >> b[i];
}
int ans = 0;
for (int i = 1; i < m; i++) {
memset(flag, 0, sizeof(flag));
for (int j = i - 1; j >= 0; j--) {
if (b[i] == b[j]) break;
if (!flag[b[j]]) {
ans += w[b[j]];
flag[b[j]] = 1;
}
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int T, n, m;
int a[550], b[1500], pre[500];
int g[400][400];
int mm;
char ch[500];
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
for (int i = 1; i <= m; i++) scanf("%d", &b[i]);
vector<int> ans;
ans.push_back(b[m]);
for (int i = m - 1; i >= 1; i--) {
int len = ans.size();
if (b[i] == ans[len - 1]) continue;
int now = -1;
for (int j = 0; j < len; j++)
if (ans[j] == b[i]) {
now = j;
break;
}
if (now == -1)
ans.push_back(b[i]);
else {
ans.erase(ans.begin() + now);
ans.push_back(b[i]);
}
}
int tot = 0;
for (int i = 1; i <= m; i++) {
int len = ans.size();
int now = -1;
for (int j = len - 1; j >= 0; j--) {
if (ans[j] == b[i]) {
now = j;
break;
}
tot += a[ans[j]];
}
assert(now != -1);
ans.erase(ans.begin() + now);
ans.push_back(b[i]);
}
printf("%d", tot);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, i, a, atual, pesos[500], contador;
stack<int> s, aux;
scanf("%d %d", &n, &m);
for (i = 0; i < n; i++) scanf("%d", &pesos[i]);
contador = 0;
for (i = 0; i < m; i++) {
scanf("%d", &a);
a--;
while (!s.empty() && s.top() != a) {
contador += pesos[s.top()];
aux.push(s.top());
s.pop();
}
if (!s.empty()) s.pop();
while (!aux.empty()) {
s.push(aux.top());
aux.pop();
}
s.push(a);
}
printf("%d\n", contador);
return 0;
}
|
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:100000000")
using namespace std;
const double pi = acos(-1.0);
const int size = 10 * 1000 + 100;
int n, m, w[size], b[size];
int lst[size];
bool used[size];
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]--;
}
for (int i = 0; i < n; i++) lst[i] = -1;
int ans = 0;
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) used[j] = false;
for (int j = lst[b[i]] + 1; j < i; j++) used[b[j]] = true;
used[b[i]] = false;
for (int j = 0; j < n; j++)
if (used[j]) ans += w[j];
lst[b[i]] = 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];
vector<int> was(n);
vector<int> v;
for (int i = 0; i < m; ++i) {
cin >> b[i];
--b[i];
if (!was[b[i]]) v.push_back(b[i]);
was[b[i]] = 1;
}
for (int i = 0; i < n; ++i)
if (!was[i]) v.push_back(i);
reverse(v.begin(), v.end());
long long res = 0;
for (int i = 0; i < b.size(); ++i) {
int pos = 0;
for (; pos < n && v[pos] != b[i]; ++pos) {
}
for (; pos + 1 < n; ++pos) {
res += w[v[pos + 1]];
swap(v[pos], v[pos + 1]);
}
}
cout << res << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int color[510], arr[510], wrr[510], brr[1010];
int main() {
long long n, m, i, l, ans, x, j;
cin >> n >> m;
for (i = 1; i <= n; i++) {
cin >> wrr[i];
}
l = 0;
for (i = 1; i <= m; i++) {
cin >> brr[i];
if (color[brr[i]] == 0) {
l++;
arr[l] = brr[i];
color[brr[i]] = 1;
}
}
ans = 0;
for (i = 1; i <= m; i++) {
x = 1;
while (arr[x] != brr[i]) {
x++;
}
for (j = x; j > 1; j--) {
ans += wrr[arr[j - 1]];
swap(arr[j], arr[j - 1]);
}
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1000 + 10;
int w[maxn], k[maxn];
vector<int> pos;
bool vis[maxn];
int main() {
int n, m;
cin >> n >> m;
for (int i = 1; i <= n; i++) {
cin >> w[i];
}
long long int ans = 0;
for (int i = 1; i <= m; i++) {
cin >> k[i];
if (!vis[k[i]]) {
pos.push_back(k[i]);
vis[k[i]] = 1;
}
}
for (int i = 1; i <= m; i++) {
int j = 0;
while (j < pos.size()) {
if (pos[j] == k[i]) {
pos.erase(pos.begin() + j);
pos.insert(pos.begin(), k[i]);
break;
}
ans += w[pos[j]];
j++;
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int w[505], p[1005], t[5001], was[105];
int main() {
int a, b, c, d, f = 0, n, m, x, y, i, j;
memset(was, 0, sizeof was);
memset(t, 0, sizeof t);
scanf("%d %d", &n, &m);
for (a = 1; a <= n; a++) scanf("%d", &w[a]);
for (a = 1; a <= m; a++) scanf("%d", &p[a]);
t[1] = p[1];
d = 2;
for (a = 2; a <= m; a++) {
y = 0;
for (i = 1; i < d; i++) {
if (t[i] == p[a]) {
for (b = i; b > 1; b--) {
t[b] = t[b - 1];
f += w[t[b]];
}
t[1] = p[a];
y = 1;
break;
}
}
if (y == 0) {
for (b = d; b > 1; b--) {
t[b] = t[b - 1];
f += w[t[b]];
}
t[1] = p[a];
d++;
}
}
printf("%d\n", f);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int w[502] = {}, b[10002] = {};
for (int i = 0; i < n; i++) cin >> w[i];
for (int i = 0; i < m; i++) cin >> b[i];
int count[1000] = {};
vector<int> ans;
for (int i = 0; i < m; i++) {
if (count[b[i]] == 0) {
count[b[i]] = 1;
ans.push_back(b[i]);
}
}
long long int final = 0;
for (int i = 1; i < m; i++) {
int check[505] = {};
for (int j = i - 1; j >= 0; j--) {
if (b[j] == b[i]) break;
if (check[b[j]] == 0) {
check[b[j]] = 1;
final += w[b[j] - 1];
}
}
}
cout << final << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cout.precision(10);
cout << fixed;
int n, m;
cin >> n >> m;
vector<int> w(n);
for (int i = 0; i < n; i++) {
cin >> w[i];
}
vector<int> b;
int x;
for (int i = 0; i < m; i++) {
cin >> x;
b.push_back(x - 1);
}
long long res = 0;
m = b.size();
for (int i = 0; i < m; i++) {
set<int> used;
for (int j = i - 1; j >= 0; j--) {
if (b[j] == b[i]) break;
if (used.find(b[j]) == used.end()) {
used.insert(b[j]);
res += w[b[j]];
}
}
}
cout << res << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using namespace std;
int n, m;
int w[501];
int A[1000];
int tree[2000];
int pos[501];
void upd(int idx, int val) {
while (idx < 2000) {
tree[idx] += val;
idx += idx & -idx;
}
}
int read(int idx) {
int sum = 0;
while (idx > 0) {
sum += tree[idx];
idx -= idx & -idx;
}
return sum;
}
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++) cin >> w[i];
int idx = 1;
memset(pos, -1, sizeof pos);
memset(tree, 0, sizeof tree);
for (int i = 0; i < m; i++) {
cin >> A[i];
if (pos[A[i]] == -1) {
pos[A[i]] = n - idx + 1;
upd(pos[A[i]], w[A[i]]);
idx++;
}
}
idx = n + 1;
int ans = 0;
for (int i = 0; i < m; i++) {
int num = A[i];
ans += read(1999) - read(pos[num]);
upd(pos[num], -w[A[i]]);
pos[A[i]] = idx++;
upd(pos[A[i]], w[A[i]]);
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int fix[100001];
int a[100001];
int b[100001];
int n, m, k, i, j, res, sum;
vector<int> v;
int main() {
cin >> n >> m;
for (i = 1; i <= n; i++) cin >> a[i];
for (i = 1; i <= m; i++) cin >> b[i];
for (i = 1; i <= m; i++)
if (!fix[b[i]]) {
v.push_back(b[i]), fix[b[i]] = 1;
}
for (i = 1; i <= m; i++) {
sum = 0;
for (j = 0; j < v.size(); j++) {
if (v[j] == b[i]) {
res += sum;
for (int I = j; I >= 1; I--) v[I] = v[I - 1];
v[0] = b[i];
break;
}
sum += a[v[j]];
}
}
cout << res;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int w[n + 1];
int i;
for (i = 0; i < n; ++i) cin >> w[i];
int days[m + 1];
for (i = 0; i < m; ++i) cin >> days[i];
vector<int> vec;
int hsh[501] = {0};
for (i = 0; i < m; ++i) {
if (hsh[days[i]] == 0) {
vec.push_back(days[i]);
hsh[days[i]] = 1;
}
}
int ans = 0, l, j;
for (i = 0; i < m; ++i) {
l = 1;
for (j = vec.size() - 1; j > 0; --j) {
if (vec[j] == days[i]) l = 0;
if (l == 0) {
vec[j] = vec[j - 1];
ans = ans + w[vec[j] - 1];
}
}
vec[0] = days[i];
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int w[n];
int p[n];
int k[n];
for (int i = (int)0; i <= (int)n - 1; ++i) {
cin >> w[i];
p[i] = 0;
k[i] = 0;
}
int t = 0;
for (int d = (int)1; d <= (int)m; ++d) {
int x;
cin >> x;
--x;
t += p[x];
p[x] = 0;
for (int i = (int)0; i <= (int)n - 1; ++i) {
if (k[i] >= k[x] && x != i) {
p[i] += w[x];
}
}
k[x] = d;
}
cout << t << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int find(vector<int> &v, int val) {
for (int i = 0; i < v.size(); i++)
if (v[i] == val) return i;
return -1;
}
void pr(vector<int> &v) {
for (int i = 0; i < v.size(); i++) cout << v[i] << " ";
cout << endl;
}
int main() {
int n, m;
cin >> n >> m;
vector<int> w(n);
for (int i = 0; i < n; i++) cin >> w[i];
vector<int> b(m);
for (int i = 0; i < m; i++) {
cin >> b[i];
b[i]--;
}
vector<int> s;
int sum = 0;
for (int i = 0; i < m; i++) {
int f = find(s, b[i]);
if (f == -1) {
f = s.size();
s.push_back(b[i]);
}
for (int i = 0; i < f; i++) sum += w[s[i]];
int book = s[f];
for (int i = f; i > 0; i--) {
s[i] = s[i - 1];
}
s[0] = book;
}
cout << sum;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<int>;
using VVI = vector<VI>;
using PI = pair<ll, int>;
using VPI = vector<PI>;
using VVPI = vector<VPI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using VS = vector<string>;
using VB = vector<bool>;
using VD = vector<long double>;
using VVD = vector<VD>;
int main(int argc, char const *argv[]) {
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
VI w(n);
for (int i = 0; i < n; ++i) {
cin >> w[i];
}
VI book(m), read(n, false);
VI v;
for (int i = 0; i < m; ++i) {
cin >> book[i];
--book[i];
if (!read[book[i]]) {
v.push_back(book[i]);
read[book[i]] = true;
}
}
int ans = 0;
for (int i = 0; i < m; ++i) {
int pos = 0;
while (v[pos] != book[i]) {
++pos;
}
while (pos != 0) {
swap(v[pos], v[pos - 1]);
ans += w[v[pos]];
--pos;
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long n, m, i, j = 0, w[510] = {0}, color[510] = {0}, s = 0, t, t1, t2,
a[1006] = {0}, k;
cin >> n >> m;
for (i = 0; i < n; i++) cin >> w[i];
for (i = 0; i < m; i++) {
cin >> t;
if (!color[t]) {
a[j++] = t;
color[t] = 1;
}
t2 = t1 = a[0];
for (k = 0; k < j; k++) {
if (t2 != t) {
s += w[t1 - 1];
t2 = a[k + 1];
a[k + 1] = t1;
t1 = t2;
} else
break;
}
a[0] = t;
}
cout << s << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, m;
long long int a[1000], b[1001];
cin >> n >> m;
for (long long int i = 0; i < n; i++) {
cin >> a[i];
}
for (long long int i = 0; i < m; i++) {
cin >> b[i];
}
set<long long int> s;
long long int sz = 0;
list<long long int> v;
for (long long int i = 0; i < m; i++) {
s.insert(b[i]);
if (s.size() > sz) {
v.push_back(b[i]);
sz++;
}
}
long long int weight = 0;
for (long long int i = 0; i < m; i++) {
auto itr = v.begin();
for (long long int j = 0; j < n; j++) {
if (b[i] == *itr) {
long long int j = *itr;
v.erase(itr);
v.push_front(j);
break;
} else
weight += a[*itr - 1];
itr++;
}
}
cout << weight << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1234567;
int w[N], a[N];
bool was[N];
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", a + i);
}
long long ans = 0;
for (int i = 0; i < m; i++) {
for (int j = 1; j <= n; j++) {
was[j] = false;
}
for (int j = i - 1; j >= 0; j--) {
if (a[j] == a[i]) {
break;
}
if (was[a[j]]) {
continue;
}
was[a[j]] = true;
ans += w[a[j]];
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
;
{
long long int n, m, i, s = 0, p, j;
cin >> n >> m;
long long int w[n], a[n];
memset(a, -1, sizeof a);
for (i = 0; i < n; i++) cin >> w[i];
for (j = 0; j < m; j++) {
cin >> p;
p--;
for (i = 0; i < n; i++)
if (a[i] > a[p]) s += w[i];
a[p] = j;
}
cout << s;
cout << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int m, n, w[505], b[1005], order[505], vis[505];
memset(w, 0, sizeof(w));
memset(b, 0, sizeof(b));
memset(vis, 0, sizeof(vis));
memset(order, 0, sizeof(order));
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) {
scanf("%d", &w[i]);
}
int k = 1;
for (int i = 1; i <= m; i++) {
scanf("%d", &b[i]);
if (vis[b[i]] == 0) {
order[k] = b[i];
vis[b[i]] = 1;
k++;
}
}
int sum = 0, j;
for (int i = 1; i <= m; i++) {
for (j = 1; order[j] != b[i]; j++) {
sum += w[order[j]];
}
order[0] = order[j];
for (int u = j - 1; u >= 1; u--) {
order[u + 1] = order[u];
}
order[1] = order[0];
order[0] = 0;
}
printf("%d\n", sum);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> vn(n), vm(m);
for (int i = 0; i < n; i++) cin >> vn[i];
vector<int> s;
vector<bool> vis(n, false);
for (int i = 0; i < m; i++) {
cin >> vm[i];
if (!vis[vm[i]]) {
s.push_back(vm[i]);
vis[vm[i]] = true;
}
}
int res = 0;
for (int i = 0; i < m; i++) {
int j, x;
for (j = 0; j < s.size(); j++) {
if (s[j] == vm[i]) {
x = s[j];
break;
}
}
j--;
for (; j >= 0; j--) {
s[j + 1] = s[j];
res += vn[s[j] - 1];
}
s[0] = x;
}
cout << res;
return 0;
}
|
#include <bits/stdc++.h>
int main() {
long n, m;
scanf("%ld %ld\n", &n, &m);
std::vector<int> weight(n + 1, 0);
for (long p = 1; p <= n; p++) {
scanf("%d", &weight[p]);
}
std::vector<int> read(m);
for (int p = 0; p < m; p++) {
scanf("%d", &read[p]);
}
long total(0);
for (int book = 1; book <= n; book++) {
std::set<int> onTop;
for (int day = 0; day < m; day++) {
int current = read[day];
if (current == book) {
for (std::set<int>::iterator setIt = onTop.begin();
setIt != onTop.end(); setIt++) {
total += weight[*setIt];
}
onTop.clear();
} else {
onTop.insert(current);
}
}
}
printf("%ld\n", total);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using std::map;
const int CMAX = 100005;
const char Cfd[] = "", Cfr[] = "";
int main() {
int n;
string s;
cin >> n >> s;
for (int i = 0; i < s.length(); i++)
if (s[i] == '*')
for (int j = 1; i + 4 * j < s.length(); j++)
if (s[i + j] == '*' && s[i + 2 * j] == '*' && s[i + 3 * j] == '*' &&
s[i + 4 * j] == '*') {
cout << "yes";
return 0;
}
cout << "no";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char input[100010];
bool check(int start, int tot, int length) {
int cnt = 0;
for (int i = start; i < tot && cnt < 5; i += length, cnt++) {
if (input[i] != '*') return false;
}
if (cnt == 5)
return true;
else
return false;
}
int main() {
int i, j, n;
while (scanf("%d%s", &n, input) != EOF) {
bool ok = false;
for (i = 0; i < n; i++)
for (j = 1; j <= n; j++) {
if (check(i, n, j)) ok = true;
}
if (ok)
printf("yes\n");
else
printf("no\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T>
T gcd(T a, T b) {
return (b == 0) ? a : gcd(b, a % b);
}
const unsigned int MOD = 1000000007;
template <class T>
T power(T a, long long int n) {
T res = 1;
while (n > 0) {
if (n % 2) res = res * a;
a = a * a, n = n / 2;
}
return res;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long int n;
cin >> n;
string s;
cin >> s;
for (int p = 0; p <= n - 4; p++) {
for (int i = 1; i <= n / 4; i++) {
long long int jump = 0;
for (int j = p; j < n; j += i, jump++) {
if (s[j] == '.') break;
if (jump == 4) {
cout << "yes";
return 0;
}
}
}
}
cout << "no";
}
|
#include <bits/stdc++.h>
using namespace std;
long long power(long long a, long long n) {
a %= 1000000007;
if (n == 1) return a;
if (n == 0) return 1;
if (n % 2)
return (a * (power((a * a) % 1000000007, n / 2) % 1000000007)) % 1000000007;
return power((a * a) % 1000000007, n / 2) % 1000000007;
}
const long long inf = (long long)1e18;
long long inverse(long long x) { return power(x, 1000000007 - 2) % 1000000007; }
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
;
long long n, ans = 0;
string s;
cin >> n >> s;
for (long long i = 0; i < n; ++i) {
if (s[i] == '.') continue;
for (long long d = 1; d < 101; ++d) {
long long fo = 1;
for (long long j = 1; j < 5; ++j)
if (i + j * d >= n || s[i + j * d] == '.') fo = 0;
if (fo) ans = 1;
}
}
if (ans)
cout << "yes\n";
else
cout << "no\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string s;
int n;
int main() {
ios_base::sync_with_stdio(false);
cin >> n >> s;
for (long long i = 0; i < n; i++) {
for (long long j = 1; j <= n; j++) {
int c = 0;
for (int k = i; k < n && s[k] != '.'; k += j) c++;
if (c >= 5) {
cout << "yes";
return 0;
}
}
}
cout << "no";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
string code;
cin >> code;
for (int k = 0; k < code.length(); k++) {
for (int j = 1; j < code.length(); j++) {
int cnt = 0;
for (int i = 0; i < code.length(); i++) {
if (k + j * i < code.length() && code[k + j * i] == '*') {
cnt++;
}
if (k + j * i < code.length() && code[k + j * i] == '.') {
cnt = 0;
}
if (cnt >= 5) {
cout << "yes" << endl;
return 0;
}
}
}
}
cout << "no" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
char s[105];
cin >> s;
bool flag = false;
for (int i = 0; i < n; i++) {
for (int j = 1; j <= n; j++) {
int k = i;
int count = 0;
while (k < n) {
if (s[k] == '*') {
k += j;
count++;
continue;
} else
break;
}
if (count >= 5) {
flag = true;
break;
}
}
}
if (flag)
cout << "yes" << endl;
else
cout << "no" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string s;
int N;
int make(int x, int z) {
int nr = 0;
while (x < s.size()) {
if (s[x] == '.') return 0;
++nr;
if (nr >= 5) return 1;
x += z;
}
return 0;
}
int main() {
cin >> N >> s;
for (int i = 0; i < s.size(); ++i) {
for (int k = 1; k < s.size(); ++k) {
if (make(i, k)) {
printf("yes");
return 0;
}
}
}
printf("no\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int n;
cin >> n >> s;
for (long long i = 0; i < n; i++) {
if (s[i] == '*')
for (long long t = 1; t <= n - 1; t++) {
bool check = true;
for (long long j = 0; j < 5; j++)
if (i + j * t >= n || s[i + j * t] == '.') check = false;
if (check == 1) {
cout << "yes";
return 0;
cout << "khaktoo saret";
}
}
}
cout << "no" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char s[104];
int main() {
int n;
scanf("%d", &n);
scanf("%s", s);
s[n] = 'x';
int i, j;
for (i = 1; i < n; i++) {
for (j = 0; j < n - 4 * i; j++)
if (s[j] == '*' && s[j + i] == '*' && s[j + 2 * i] == '*' &&
s[j + 3 * i] == '*' && s[j + 4 * i] == '*') {
printf("yes");
return 0;
}
}
printf("no");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string s;
int n;
bool check(int pos, int len) {
if (pos + 4 * len >= n) return false;
for (int i = 0; i < 5; i++)
if (s[pos + i * len] == '.') return false;
return true;
}
int main() {
cin >> n >> s;
for (int i = 0; i < n; i++)
for (int j = 1; j < n; j++)
if (check(i, j)) {
cout << "yes";
return 0;
}
cout << "no";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string s;
int main() {
int n;
cin >> n;
cin >> s;
for (int i = 0; i < n; i++) {
if (s[i] == '*') {
for (int j = 1; (i + j * 4) <= n; j++) {
if (s[i + j] == '*' && s[i + j * 2] == '*' && s[i + j * 3] == '*' &&
s[i + j * 4] == '*') {
cout << "yes";
return 0;
}
}
}
}
cout << "no";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool f(int k, string& s) {
int n = s.size();
for (int i = 0; i < n; i++) {
if (s[i] == '*')
if (i + 4 * k < n && s[i + k] == '*' && s[i + 2 * k] == '*' &&
s[i + 3 * k] == '*' && s[i + 4 * k] == '*')
return true;
}
return false;
}
int main() {
int n;
cin >> n;
string s;
cin >> s;
for (int i = 1; i < n; i++) {
if (f(i, s)) {
cout << "yes" << endl;
return 0;
}
}
cout << "no" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, t = 0, cnt;
string s;
cin >> n;
cin >> s;
if (s.size() < 5)
cout << "no\n";
else {
for (int i = 0; i < n - 4; i++) {
if (s.at(i) == '*' && s.at(i + 1) == '*' && s.at(i + 2) == '*' &&
s.at(i + 3) == '*' && s.at(i + 4) == '*') {
cout << "yes\n";
t = 1;
break;
} else {
if (s.at(i) != '.') {
int k;
m = 2;
for (int j = i;;) {
cnt = 0;
for (k = j + m; k < n; k += m) {
if (s.at(k) == '.') {
m++;
break;
} else {
cnt++;
if (cnt == 4) {
cout << "yes\n";
t = 1;
break;
}
}
}
if (cnt == 4)
break;
else if (k >= n)
break;
}
}
}
if (cnt == 4) break;
}
if (t == 0) cout << "no\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool f[2333];
char c[2333];
int n;
bool check(int a, int x) {
if ((a + 4 * x) > n) return false;
if (c[a] == '*' && c[a + x] == '*' && c[a + x + x] == '*' &&
c[a + x + x + x] == '*' && c[a + 4 * x] == '*')
return true;
return false;
}
int main() {
scanf("%d", &n);
scanf("%s", c);
for (int step = 1; step <= 30; step++) {
for (int i = 0; i < n; i++)
if (check(i, step)) {
printf("yes");
return 0;
}
}
printf("no");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
for (int len = 1; len <= n; ++len) {
for (int i = 0; i < n; ++i) {
int cur = i;
int z = 5;
while (z && cur < n) {
if (s[cur] == '.') break;
--z;
cur += len;
}
if (z == 0) {
puts("yes");
return 0;
}
}
}
puts("no");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char s[1010];
int main() {
int n;
scanf("%d", &n);
scanf(" %s", s);
for (int i = 0; i < n; ++i) {
for (int j = 1; j <= n; ++j) {
bool ok = 1;
for (int k = 0; k < 5; ++k) {
int t = i + j * k;
if (t >= n || s[t] == '.') {
ok = 0;
break;
}
}
if (ok) {
puts("yes");
return 0;
}
}
}
puts("no");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
const long double EPS = 1e-8;
const int MAXN = 1110;
char s[MAXN];
int main() {
int n;
scanf("%d", &n);
scanf("%s", s);
bool ans = false;
for (int l = 1; l <= n; ++l) {
for (int st = 0; st < (n); ++st) {
bool flag = true;
for (int i = st, it = 0; it < 5; ++it, i += l) {
if (i >= n) {
flag = false;
break;
}
if (s[i] == '.') {
flag = false;
break;
}
}
if (flag) {
ans = true;
}
}
}
if (ans) {
cout << "yes\n";
} else {
cout << "no\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void Open() {}
char trip[110];
int main() {
Open();
int n;
scanf("%d", &n);
scanf("%s", trip);
bool flag = true;
for (int len = 1; len < n && flag; len++) {
for (int i = 0; i < n && flag; i++) {
if (trip[i] == '.') continue;
if (i + 4 * len < n) {
if (trip[i + len] == '*' && trip[i + len * 2] == '*' &&
trip[i + len * 3] == '*' && trip[i + len * 4] == '*')
flag = false;
} else {
break;
}
}
}
if (flag)
printf("no\n");
else
printf("yes\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
const long long INF64 = 1e18;
const int MOD = 1000000007;
const int N = 1000001;
int main() {
int n;
cin >> n;
string s;
cin >> s;
for (int len = 1; len <= n; len++) {
for (int i = 0; i < int(n); i++) {
int cnt = 0;
for (int j = i; j < n; j += len) {
if (s[j] == '*')
cnt++;
else
break;
}
if (cnt >= 5) {
cout << "yes";
return 0;
}
}
}
cout << "no";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int sz;
string s;
cin >> sz >> s;
for (int range = 1;; range++) {
if ((sz + 10) / range < 4) break;
for (int st = 0; st < range; st++) {
int cnt = 0;
for (int j = st; j < sz; j += range) {
if (s[j] == '*') {
cnt++;
if (cnt == 5) {
cout << "YES" << endl;
return 0;
}
} else {
cnt = 0;
}
}
}
}
cout << "NO" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int n;
bool flag = 0;
cin >> n >> s;
for (int i = 0; i < n; i++) {
for (int step = 1; step < n; step++) {
int cnt = 0;
for (int j = 0; j < 5; j++)
if (i + j * step < n && s[i + j * step] == '*') cnt++;
if (cnt == 5) flag = 1;
}
}
cout << (flag ? "yes" : "no") << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string tostring(int a) {
ostringstream temp;
temp << a;
return temp.str();
}
int sumfromto(int a[], int st, int end) {
int s = 0;
for (int i = st; i < end; i++) {
s += a[i];
}
return s;
}
long long sumn(long long p[], int n) {
int s = 0;
for (int i = 0; i < n; i++) {
s += p[i];
}
return s;
}
long long gcd(long long a, long long b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
long long lcm(long long a, long long b) { return a * b / gcd(a, b); }
void multiply(long long F[2][2], long long M[2][2]);
void power(long long F[2][2], long long n);
long long fib(long long n) {
long long F[2][2] = {{1, 1}, {1, 0}};
if (n == 0) return 0;
power(F, n - 1);
return F[0][0];
}
void power(long long F[2][2], long long n) {
if (n == 0 || n == 1) return;
long long M[2][2] = {{1, 1}, {1, 0}};
power(F, n / 2);
multiply(F, F);
if (n % 2 != 0) multiply(F, M);
}
void multiply(long long F[2][2], long long M[2][2]) {
long long x = F[0][0] * M[0][0] + F[0][1] * M[1][0];
long long y = F[0][0] * M[0][1] + F[0][1] * M[1][1];
long long z = F[1][0] * M[0][0] + F[1][1] * M[1][0];
long long w = F[1][0] * M[0][1] + F[1][1] * M[1][1];
F[0][0] = x;
F[0][1] = y;
F[1][0] = z;
F[1][1] = w;
}
int n, m, k, t, h, x, y, z, q;
pair<double, double> p[100];
char alph[26] = {'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() {
cin >> n;
char* s = new char[2 * n];
for (int i = 0; i < 2 * n; i++) {
s[i] = '.';
}
for (int i = 0; i < n; i++) {
cin >> s[i];
}
int cnt, k;
for (int i = 0; i < n; i++) {
if (s[i] == '*') {
for (int j = 1; j < 25; j++) {
cnt = 1;
k = i;
while (s[k] == s[k + j]) {
cnt++;
if (cnt >= 5) {
cout << "yes" << endl;
return 0;
}
k = k + j;
}
}
}
}
cout << "no" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char s[111];
bool num[111];
int main() {
int z;
scanf("%d%s", &z, s);
int n = 0;
for (int i = 0; i < z; i++) {
if (s[i] == '*') {
num[i + 1] = 1;
}
}
bool flag = 0;
for (int i = 1; i < 111; i++) {
if (num[i]) {
for (int k = 1; k < 100; k++) {
int cnt = 0;
for (int j = i; num[j] && j < 101; j += k) {
cnt++;
}
if (cnt >= 5) {
puts("yes");
return 0;
}
}
}
}
puts("no");
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long n;
cin >> n;
string a;
cin >> a;
for (int i = 0; i < n; i++) {
if (a[i] == '*') {
for (int j = 1; j < n / 4 + 1; j++) {
long long can = 0;
for (int k = 1; k < 5; k++) {
if (i + j * k > n - 1) break;
if (a[i + j * k] == '*') can++;
}
if (can == 4) {
cout << "yes" << endl;
return 0;
}
}
}
}
cout << "no" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
char s[10101];
scanf("%d", &n);
scanf("%s", s);
bool can = false;
for (int jump = 1; !can && jump <= n; ++jump)
for (int i = 0; !can && i < n; ++i) {
if (s[i] == '.') continue;
int p = i;
can = true;
for (int j = 0; j < 4; ++j) {
p += jump;
if (p >= n) {
can = false;
break;
}
if (s[p] == '.') can = false;
}
if (can) {
break;
}
}
if (can)
printf("yes\n");
else
printf("no\n");
return 0;
}
|
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:66777216")
using namespace std;
long long n, m, x, y, z;
int a[105];
int main() {
cin >> n;
string s;
cin >> s;
for (int i = 1; i < n; i++) {
for (int c = 0; c < n; c++) {
int ans = 0;
for (int k = c; k < n; k += i) {
if (s[k] == '*')
ans++;
else
break;
}
if (ans >= 5) {
cout << "yes";
return 0;
}
}
}
cout << "no";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string str;
int n;
while (cin >> n >> str) {
bool flag = 0;
for (int i = 0; i < (str.size()); ++i) {
if (str[i] == '.') continue;
for (int k = 1; i + k * 4 < str.size(); ++k) {
bool tmp = 1;
for (int j = (1); j <= (4); ++j)
if (str[i + j * k] == '.') tmp = 0;
if (tmp) {
flag = 1;
break;
}
}
if (flag) break;
}
if (flag)
puts("yes");
else
puts("no");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int found = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
if (s[i] == '*' && s[j] == '*') {
int d = j - i;
int c = 2;
for (int k = j + d; k < n; k += d) {
if (s[k] == '*') {
c++;
} else {
break;
}
}
if (c >= 5) {
found = 1;
break;
}
}
}
if (found == 1) {
break;
}
}
if (found) {
cout << "yes\n";
} else {
cout << "no\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
int n;
string a;
cin >> n >> a;
for (int i = 0; i < n; i++)
for (int j = i + 1; j < n; j++)
if (a[i] == '*' && a[j] == '*') {
int ok = 1;
for (int k = 1; k <= 3; k++)
if (j + k * (j - i) >= n || a[j + k * (j - i)] != '*') ok = 0;
if (ok) {
cout << "yes";
return 0;
}
}
cout << "no";
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
string s;
bool good(int start, int step) {
for (int k = 1; k <= 4; ++k)
if (start + step * k >= n || s[start + step * k] != '*') return false;
return true;
}
int main() {
cin >> n;
cin >> s;
bool flag = false;
for (int i = 0; i < s.length(); ++i) {
if (s[i] != '*') continue;
for (int j = 1; j < s.length(); ++j)
if (good(i, j)) {
flag = true;
break;
}
if (flag) {
break;
}
}
cout << (flag ? "yes" : "no") << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char s[110];
int a[550], n;
int check() {
int i, j, k, flag;
for (i = 0; i < n; i++) {
for (j = 1; j < n; j++) {
flag = 1;
for (k = 0; k < 5; k++) {
if (a[i + k * j] == 0) flag = 0;
}
if (flag == 1) return 1;
}
}
return 0;
}
int main() {
int i;
cin >> n >> s;
for (i = 0; i < n; i++)
if (s[i] == '*') a[i] = 1;
if (check())
cout << "yes" << endl;
else
cout << "no" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int a, n;
cin >> n >> s;
for (int i = 0; i < n; ++i) {
for (int j = 1; j < n + 1; ++j) {
if (i + 4 * j >= n) break;
if (s[i] == '*' && s[i + j] == '*' && s[i + 2 * j] == '*' &&
s[i + 3 * j] == '*' && s[i + 4 * j] == '*') {
printf("yes\n");
return 0;
}
}
}
printf("no\n");
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
int i, j, diff;
for (i = 0; i < n; i++) {
if (s[i] == '*') {
for (j = i + 1; j < n; j++) {
if (s[j] == '*') {
diff = j - i;
if (s[j + diff] == '*' && s[j + 2 * diff] == '*' &&
s[j + 3 * diff] == '*') {
cout << "yes" << endl;
return 0;
}
}
}
}
}
cout << "no" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T bigmod(T p, T e, T M) {
long long int ret = 1;
for (; e > 0; e >>= 1) {
if (e & 1) ret = (ret * p) % M;
p = (p * p) % M;
}
return (T)ret;
}
template <class T>
inline T gcd(T a, T b) {
if (b == 0) return a;
return gcd(b, a % b);
}
template <class T>
inline T modinverse(T a, T M) {
return bigmod(a, M - 2, M);
}
template <class T>
inline T bpow(T p, T e) {
long long int ret = 1;
for (; e > 0; e >>= 1) {
if (e & 1) ret = (ret * p);
p = (p * p);
}
return (T)ret;
}
int toInt(string s) {
int sm;
stringstream ss(s);
ss >> sm;
return sm;
}
int toLlint(string s) {
long long int sm;
stringstream ss(s);
ss >> sm;
return sm;
}
char s[105];
int main() {
int t, i, j, n;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf(" %c", &s[i]);
}
for (i = 0; i < n; i++) {
if (s[i] == '*')
for (j = 1; i + 4 * j < n; j++) {
if (s[i + j] == '*' && s[i + 2 * j] == '*' && s[i + 3 * j] == '*' &&
s[i + 4 * j] == '*') {
printf("yes\n");
exit(0);
}
}
}
printf("no\n");
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int n;
scanf("%d", &n);
char level[100 + 1];
scanf("%s", level);
int a, d;
for (a = 0; a < n; a++) {
for (d = 1; d < n; d++) {
if (a + 4 * d < n) {
if (level[a] == '*' && level[a + d] == '*' && level[a + 2 * d] == '*' &&
level[a + 3 * d] == '*' && level[a + 4 * d] == '*') {
printf("yes\n");
return 0;
}
}
}
}
printf("no\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long n;
cin >> n;
string s, a;
cin >> s;
bool check = false;
for (long long i = 0; i < n && !check; i++) {
if (s[i] == '*') {
for (long long j = 1; j < 30 && !check; j++) {
long long now = i + j, local = 0;
while (now < n && s[now] == '*') {
now += j;
local++;
}
if (local >= 4) check = true;
}
}
}
cout << (check ? "YES" : "NO");
}
|
#include <bits/stdc++.h>
using namespace std;
const long long inf = 10000000;
int main() {
int n;
string s;
scanf("%d", &n);
cin >> s;
for (int i = 0; i < s.size(); i++) {
for (int j = 1; j < 25; j++) {
if (i + j * 4 < 100) {
if (s[i] == '*' && s[i + j] == '*' && s[i + j * 2] == '*' &&
s[i + j * 3] == '*' && s[i + j * 4] == '*') {
printf("yes");
return 0;
}
}
}
}
printf("no");
return 0;
}
|
#include <bits/stdc++.h>
const int NUM = 100010;
const double EPS = 1e-10, PI = acos(-1.0);
using namespace std;
int n;
char road[110];
int main() {
int i, j, k;
scanf("%d", &n);
scanf("%s", road);
for (k = 1; k < n; k++) {
for (i = 0; i < n; i++)
if (road[i] == '*') {
int f = 0;
for (j = i; j < n; j += k)
if (road[j] == '*')
f++;
else
break;
if (f >= 5) {
printf("yes\n");
return 0;
}
}
}
printf("no\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[10000];
int main() {
int n;
string s;
cin >> n >> s;
for (int i = 0; i < n; i++)
if (s[i] == '*') a[i] = 1;
for (int i = 0; i < n; i++) {
if (s[i] == '*') {
for (int j = 1; j <= n; j++) {
int cnt = 0, mx = 0;
for (int k = i; k < n; k += j) {
if (a[k]) {
cnt++;
} else
cnt = 0;
mx = max(cnt, mx);
}
if (mx >= 5) {
cout << "YES";
return 0;
}
}
}
}
cout << "NO";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<bool> level;
for (int i = 0; i < n; ++i) {
char temp;
cin >> temp;
if (temp == '*')
level.push_back(true);
else
level.push_back(false);
}
for (int i = 0; i < n; ++i) {
for (int j = 1; j < (n - i + 3) / 4; ++j) {
if (level[i] && level[i + j] && level[i + 2 * j] && level[i + 3 * j] &&
level[i + 4 * j]) {
cout << "yes\n";
return 0;
}
}
}
cout << "no\n";
}
|
#include <bits/stdc++.h>
using namespace std;
set<long long>::iterator it;
vector<long long>::iterator it1;
struct stc {
int fir, sc;
} input[1000];
bool comp(stc a, stc b) { return a.fir < b.fir; }
int main() {
long long n, i, j, k, it, ans, f, len;
string s;
while (cin >> n) {
cin >> s;
len = s.size();
f = 1;
if (len < 5)
cout << "no\n";
else {
for (j = 0; j < len; j++) {
if (s[j] == '*') {
ans = 1;
for (i = j + 1; i < len; i++) {
if (s[i] == '*') {
ans = 2;
for (k = i + (i - j); k < len; k += (i - j)) {
if (s[k] == '*') {
ans++;
} else {
f = 1;
break;
}
if (ans == 5) {
f = 0;
break;
}
}
}
if (!f) break;
}
}
if (!f) break;
}
if (!f)
cout << "yes\n";
else
cout << "no\n";
}
}
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int n;
std::cin >> n;
std::string str;
std::getline(std::cin, str);
std::getline(std::cin, str);
for (int k = 1; k < n; ++k) {
for (int i = 0; i < n; ++i) {
if (i + 4 * k < n &&
(str[i] == '*' && str[i] == str[i + k] && str[i] == str[i + 2 * k] &&
str[i] == str[i + 3 * k] && str[i] == str[i + 4 * k])) {
std::cout << "yes" << std::endl;
return 0;
}
}
}
std::cout << "no" << std::endl;
return 0;
}
|
#include <bits/stdc++.h>
const long long INF = (long long)1e18 + 2;
using namespace std;
void solve();
void fastIO() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
int main() {
fastIO();
solve();
}
void solve() {
int n;
cin >> n;
string s;
cin >> s;
bool flag = false;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
int cnt = 0;
for (int k = i; k <= n; k += j) {
if (s[k - 1] == '*')
cnt++;
else
break;
}
if (cnt >= 5) {
flag = true;
break;
}
}
if (flag) break;
}
if (flag)
cout << "yes";
else
cout << "no";
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int cnt = 0;
cin >> n;
string s;
cin >> s;
for (int i = 0; i < n; i++) {
if (s[i] == '*') {
for (int j = 1; j < n; j++) {
cnt = 0;
for (int k = i + j; k < n; k += j) {
if (s[k] == s[i])
cnt++;
else
break;
if (cnt == 4) {
cout << "yes";
return 0;
}
}
}
}
}
cout << "no";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long N = 2e5;
const long long M = N * N;
const long long INF = 1e15;
const long long MOD = 1000000007;
int main() {
ios::sync_with_stdio(false);
ifstream inf("input.txt");
int n;
cin >> n;
string s;
cin >> s;
int ans = 0;
for (int i = 0; i < n; i++)
for (int i1 = 1; i + 4 * i1 < n; i1++) {
if (s[i] == '*' && s[i + i1] == '*' && s[i + 2 * i1] == '*' &&
s[i + 3 * i1] == '*' && s[i + 4 * i1] == '*')
ans = 1;
}
if (ans)
cout << "yes";
else
cout << "no";
}
|
#include <bits/stdc++.h>
using namespace std;
long long int n;
bool bound(long long int j) { return j < n; }
long long int solve() {
cin >> n;
string s;
cin >> s;
for (long long int j = 0; j < n; j++) {
for (long long int i = 1; i <= n; i++) {
if (bound(j + 4 * i)) {
if (s[j] == '*') {
if (s[j + i] == '*') {
if (s[j + 2 * i] == '*') {
if (s[j + 3 * i] == '*') {
if (s[j + 4 * i] == '*') {
cout << "yes\n";
return 0;
}
}
}
}
}
}
}
}
cout << "no\n";
return 0;
}
signed main() {
ios::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
long long int t;
t = 1;
while (t--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool debug;
const int inf = 1e9 + 5;
const long long INF = (long long)inf * inf;
const int nax = 1e6 + 5;
int n;
char sl[nax];
bool ok(int i) { return i < n && sl[i] == '*'; }
int main(int argc, char *argv[]) {
debug = argc > 1;
scanf("%d", &n);
scanf("%s", sl);
for (int i = 0; i <= (n)-1; ++i)
for (int j = i + 1; j <= n - 1; ++j) {
int d = j - i;
if (ok(i) && ok(j) && ok(j + d) && ok(j + 2 * d) && ok(j + 3 * d)) {
puts("yes");
return 0;
}
}
puts("no");
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.