solution
stringlengths 10
159k
| difficulty
int64 0
3.5k
| language
stringclasses 2
values |
|---|---|---|
#include <bits/stdc++.h>
using namespace std;
int pr(string x, string y) {
int i = 0, n = x.size(), m = y.size();
if (x == y) return -1;
while (i < n && i < m && x[i] == y[i]) {
i++;
}
if (i == n && i == m)
return -1;
else if (i < n && i == m)
return -1;
else if (i == n && i < m)
return i;
else if (x[i] > y[i])
return -1;
else
return i;
}
int main() {
int n;
cin >> n;
string a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = n - 1; i > 0; i--) {
int ch = pr(a[i], a[i - 1]);
while (ch != -1) {
a[i - 1] = a[i - 1].substr(0, ch);
ch = pr(a[i], a[i - 1]);
}
}
for (int i = 0; i < n; i++) {
cout << a[i] << endl;
}
}
| 1,800 | CPP |
from collections import defaultdict
a=int(input())
for i in range(a):
s=input()
x=int(input())
z=list(map(int,input().split()))
result=[0 for i in range(len(z))]
pos=[]
tp=[]
for i in range(len(z)):
if(z[i]==0):
result[i]=1
pos.append(i)
tp.append(i)
z[i]==0
cha=1
zer=len(result)-result.count(1)
while(zer>0):
pos=tp.copy()
tp=[]
cha+=1
for i in range(len(result)):
if(not result[i]):
for j in range(len(pos)):
z[i]-=abs(pos[j]-i)
if(z[i]==0):
tp.append(i)
result[i]=cha
zer-=1
ans=[]
dl=defaultdict(int)
al=defaultdict(int)
for i in range(len(result)):
dl[result[i]]+=1
for i in range(len(s)):
ans.append(s[i])
al[s[i]]+=1
maxa=max(result)
ans=list(set(ans))
ans.sort()
ma=defaultdict(str)
index=len(ans)-1
ch=1
while(ch<=maxa):
if(al[ans[index]]>=dl[ch]):
ma[ch]=ans[index]
ch+=1
index-=1
fin=[]
for i in range(len(result)):
fin.append(ma[result[i]])
print(''.join(map(str,fin)))
| 1,800 | PYTHON3 |
#!/usr/bin/env python
import os
import sys
from io import BytesIO, IOBase
import threading
from math import cos,sin,pi
def main():
for _ in range(int(input())):
n=int(input())
arr=list(map(int,input().split()))
ans=arr.count(0)
if sum(arr)+ans==0:
ans+=1
print(ans)
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
# endregion
if __name__ == "__main__":
main() | 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, m;
vector<int> father;
vector<int> a;
vector<int> DP;
vector<pair<int, int>> answer;
vector<vector<int>> children;
vector<int> used;
vector<int> h;
bool bad = false;
void answer_dfs(int i, int height) {
h[i] = height;
for (int child : children[i]) answer_dfs(child, height + 1);
if (!used[DP[i]]) {
answer.emplace_back(h[DP[i]], DP[i]);
used[DP[i]] = true;
}
}
void dfs(int i, int target) {
if (bad || (DP[i] != -1 && DP[i] != target)) {
bad = true;
return;
}
DP[i] = target;
if (i != target && father[i] != -1) dfs(father[i], target);
}
void solve() {
DP.assign(n, -1);
used.assign(n, 0);
h.assign(n, -1);
for (int i = 0; i < n; i++) dfs(i, a[i]);
if (bad)
cout << -1 << endl;
else {
for (int i = 0; i < n; i++)
if (father[i] == -1) answer_dfs(i, 0);
sort(answer.rbegin(), answer.rend());
cout << answer.size() << endl;
for (auto x : answer) cout << x.second + 1 << '\n';
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
father.assign(n, -1);
a.assign(n, -1);
children.resize(n);
int p, q;
for (int i = 0; i < m; i++) {
cin >> p >> q;
p--;
q--;
father[q] = p;
children[p].push_back(q);
}
for (int i = 0; i < n; i++) {
cin >> a[i];
a[i]--;
}
solve();
return 0;
}
| 2,000 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1 << 29;
const double EPS = 1e-9;
const int dx[] = {1, 0, -1, 0}, dy[] = {0, -1, 0, 1};
int n, m;
int main() {
cin >> n >> m;
int ans = 0;
for (int i = 0; i <= n; i++) {
int tmp = 0;
int a1 = i;
int b1 = (m - 2 * i);
if (b1 < 0) break;
int r1, r2;
r1 = n - i;
r2 = (m - 2 * i);
int a2 = (r1 / 2);
int b2 = r2 - a2;
if (b2 < 0) {
tmp = i + r2;
} else {
tmp = i + a2;
}
ans = max(ans, tmp);
}
cout << ans << endl;
return 0;
}
| 1,300 | CPP |
n = int(input())
s=str(input())
if (s.count("*")<=4):
print("no")
exit()
for i in range(n):
for j in range(1, n + 1):
if i + 4 * j < n and s[i] == s[i + j] == s[i + 2 * j] == s[i + 3 * j] == s[i + 4 * j] == '*':
print('yes')
exit()
print('no') | 1,300 | PYTHON3 |
#include <bits/stdc++.h>
#pragma GCC target("avx2")
using namespace std;
const int maxn = 1e5 + 13;
const int maxa = 2e5 + 37;
map<int, int> factors[maxa];
bool prime[maxa];
int a[maxn];
int deg(int j, int i) {
int res = 0;
while (j % i == 0) {
++res;
j /= i;
}
return res;
}
void precalc() {
for (int i = 2; i < maxa; ++i) prime[i] = 1;
factors[1][1] = 1;
for (int i = 2; i < maxa; ++i) {
if (prime[i]) {
factors[i][i] = 1;
for (int j = 2 * i; j < maxa; j += i) {
prime[j] = 0;
factors[j][i] = deg(j, i);
}
}
}
}
int64_t pow_bin(int x, int y) {
int64_t res = 1, t = x;
while (y) {
if (y & 1) res *= t;
t *= t;
y >>= 1;
}
return res;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
precalc();
int n;
cin >> n;
map<int, vector<int> > cnt;
for (int i = 0; i < n; ++i) {
cin >> a[i];
for (auto pr : factors[a[i]]) cnt[pr.first].push_back(pr.second);
}
int64_t res = 1;
for (auto &pr : cnt) {
if (int(pr.second.size()) >= n - 1) {
sort(pr.second.begin(), pr.second.end());
if (int(pr.second.size()) == n)
res *= pow_bin(pr.first, pr.second[1]);
else
res *= pow_bin(pr.first, pr.second[0]);
}
}
cout << res << '\n';
}
| 1,600 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e2 + 5;
int n, m, r[maxn];
pair<int, int> v[maxn];
int main() {
cin >> n >> m;
while (m--) {
for (int i = 0; i < n; i++) {
int a;
cin >> a;
v[i] = make_pair(a, i);
}
sort(v, v + n);
if (v[n - 1].first != v[n - 2].first) {
r[v[n - 1].second]++;
} else {
int mx = v[n - 1].first;
for (int i = 0; i < n; i++) {
if (v[i].first == mx) {
r[v[i].second]++;
break;
}
}
}
}
int indx = 0, mx2 = 0;
for (int i = 0; i < n; i++) {
if (r[i] > mx2) {
indx = i;
mx2 = r[i];
}
}
return cout << indx + 1, 0;
}
| 1,100 | CPP |
n=int(input())
for i in range(n):
a=[int(i) for i in input().split()]
b=[int(i) for i in input().split()]
ans=(min(a[2],b[1])*2)
a[2]=a[2]-(ans//2)
if(b[2]<=a[0]):
print(ans)
else:
b[2]=b[2]-a[0]
if(b[2]<=a[2]):
print(ans)
else:
b[2]=b[2]-a[2]
print(ans-(b[2]*(2))) | 1,100 | PYTHON3 |
hi = int(input())
rightways = {}
leftways ={}
pairs = 0
for m in range(hi):
i = input().split()
j = int(i[0])
k = int(i[1])
if j-k in rightways.keys():
pairs += rightways[j-k]
rightways[j-k] += 1
else:
rightways[j-k] = 1
if j+k-1 in leftways.keys():
pairs += leftways[j+k-1]
leftways[j+k-1] +=1
else:
leftways[j+k-1] = 1
print(pairs)
| 1,300 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int N, M;
int d[200000];
int h[200000];
long long pos[200000];
int a[100000];
int b[100000];
int best[100000];
struct stree {
int a, b;
stree *left, *right;
long long mx, mn, tbest;
stree(int l, int r) {
a = l;
b = r;
if (a == b) {
mx = 2ll * h[a] + pos[a];
mn = 2ll * h[a] - pos[a];
tbest = 0;
left = right = nullptr;
} else {
int mid = (a + b) / 2;
left = new stree(a, mid);
right = new stree(mid + 1, b);
mx = max(left->mx, right->mx);
mn = max(left->mn, right->mn);
tbest = max(left->tbest, right->tbest);
tbest = max(tbest, right->mx + left->mn);
}
}
long long qbest(int l, int r) {
if (l > b || r < a) return 0;
if (l <= a && r >= b) return tbest;
long long ans = 0;
ans = max(left->qbest(l, r), ans);
ans = max(right->qbest(l, r), ans);
ans = max(ans, left->qmn(l, r) + right->qmx(l, r));
return ans;
}
long long qmx(int l, int r) {
if (l > b || r < a) return -1e15;
if (l <= a && r >= b) return mx;
return max(left->qmx(l, r), right->qmx(l, r));
}
long long qmn(int l, int r) {
if (l > b || r < a) return -1e15;
if (l <= a && r >= b) return mn;
return max(left->qmn(l, r), right->qmn(l, r));
}
};
int main() {
scanf("%d", &(N));
scanf("%d", &(M));
for (int i = (0); i < (N); i++) scanf("%d", &(d[i]));
for (int i = (0); i < (N); i++) scanf("%d", &(h[i]));
for (int i = (0); i < (M); i++) {
scanf("%d", &(a[i]));
scanf("%d", &(b[i]));
a[i]--;
b[i]--;
}
for (int i = (N); i < (N * 2); i++) d[i] = d[i - N];
for (int i = (N); i < (N * 2); i++) h[i] = h[i - N];
pos[0] = 0;
for (int i = (1); i < (N * 2); i++) pos[i] = pos[i - 1] + d[i - 1];
stree tree(0, 2 * N - 1);
for (int i = (0); i < (M); i++) {
long long ans;
if (a[i] <= b[i])
ans = tree.qbest(b[i] + 1, a[i] - 1 + N);
else
ans = tree.qbest(b[i] + 1, a[i] - 1);
printf("%lld\n", ans);
}
}
| 2,300 | CPP |
n = int(input())
current = 2
for i in range(n):
next = (i+1) * (i+2)
press = (i+1) * (i+2) * (i+2) - current // (i+1)
current = next
print(press)
| 1,600 | PYTHON3 |
for _ in range(int(input())):
x,req_rem,n=map(int,input().split())
max_rem=n%x
if max_rem==req_rem:
print(n)
elif max_rem>req_rem:
print(n-(max_rem-req_rem))
else:
quotient=n//x
quotient-=1
print((quotient*x)+req_rem) | 800 | PYTHON3 |
n = int(input())
cnt = 0
for i in range(n):
pbm = input().split()
if pbm.count('1') >= 2:
cnt += 1
print(cnt)
| 800 | PYTHON3 |
def check_gk(A, k):
N = len(A)
for i in range(N-1):
if A[i] >= k and A[i+1] >= k:
return True
for i in range(N-2):
if A[i] >= k and A[i+2] >= k:
return True
return False
def answer(b):
if b:
print("yes")
else:
print("no")
t = int(input())
for i in range(t):
n, k = input().split(' ')
n, k = int(n), int(k)
A = list(map(int, input().split(' ')))
if n <= 1:
answer(k in A)
else:
answer(k in A and check_gk(A, k))
| 2,000 | PYTHON3 |
#include <bits/stdc++.h>
const long long INF = 2009000999;
const float cp = 2 * acos(0.0);
const float eps = 1e-18;
using namespace std;
long long a[103][103], b[103][103], n, m;
bool f = false;
int main() {
string s;
long long k1 = 0, k2 = 0;
cin >> s;
for (int i = 0; i < s.size(); i += 2)
if (s[i] == '-')
s[i] = 'B';
else
s[i] = 'A';
for (int i = 1; i < s.size(); i += 2)
if (s[i] == '-')
s[i] = 'A';
else
s[i] = 'B';
for (int(i) = 0; (i) < (s.size()); i++)
if (s[i] == 'A')
k1++;
else
k2++;
if (k1 == k2)
puts("Yes");
else
puts("No");
return 0;
}
| 1,600 | CPP |
#include <bits/stdc++.h>
using namespace std;
int A[100005];
int segTree[300005];
void maketree(int l, int r, int ind) {
if (l == r) {
segTree[ind] = A[l];
return;
}
int mid = l + (r - l) / 2;
maketree(l, mid, ind * 2);
maketree(mid + 1, r, ind * 2 + 1);
segTree[ind] = segTree[ind * 2] + segTree[ind * 2 + 1];
}
void update(int l, int r, int curind, int tofind, int newval) {
if (tofind > r || tofind < l) return;
if (l == r) {
A[l] = newval;
segTree[curind] = newval;
return;
}
int mid = l + (r - l) / 2;
update(l, mid, curind * 2, tofind, newval);
update(mid + 1, r, curind * 2 + 1, tofind, newval);
segTree[curind] = segTree[curind * 2] + segTree[curind * 2 + 1];
}
int sum(int l, int r, int curind, int lr, int rr) {
int mid = l + (r - l) / 2;
if (l == r) return segTree[curind];
if (l >= lr && r <= rr) return segTree[curind];
if ((mid + 1) > rr)
return sum(l, mid, curind * 2, lr, rr);
else if (mid < lr)
return sum(mid + 1, r, curind * 2 + 1, lr, rr);
else
return sum(l, mid, curind * 2, lr, rr) +
sum(mid + 1, r, curind * 2 + 1, lr, rr);
}
int main() {
int N, Q;
scanf("%d%d", &N, &Q);
for (int i = 1; i <= N; i++) A[i] = 1;
maketree(1, N, 1);
int curstart = 1, curend = N;
bool flip = false;
while (Q--) {
int choice;
scanf("%d", &choice);
if (choice == 1) {
int crease;
scanf("%d", &crease);
if (flip) {
if (crease > (curend - curstart + 1) / 2) {
crease = (curend - curstart + 1) - crease;
for (int j = 1, i = curstart + crease; i < curstart + (2 * crease);
i++, j += 2)
update(1, N, 1, i, A[i] + A[i - j]);
for (int i = curstart; i < curstart + crease; i++)
update(1, N, 1, i, 0);
curstart += crease;
flip = false;
} else {
for (int j = 1, i = curend - crease; i > curend - (2 * crease);
i--, j += 2)
update(1, N, 1, i, A[i] + A[i + j]);
for (int i = curend; i > curend - crease; i--) update(1, N, 1, i, 0);
curend -= crease;
}
} else {
if (crease > (curend - curstart + 1) / 2) {
crease = (curend - curstart + 1) - crease;
for (int j = 1, i = curend - crease; i > curend - (2 * crease);
i--, j += 2)
update(1, N, 1, i, A[i] + A[i + j]);
for (int i = curend; i > curend - crease; i--) update(1, N, 1, i, 0);
curend -= crease;
flip = !flip;
} else {
for (int j = 1, i = curstart + crease; i < curstart + (2 * crease);
i++, j += 2)
update(1, N, 1, i, A[i] + A[i - j]);
for (int i = curstart; i < curstart + crease; i++)
update(1, N, 1, i, 0);
curstart += crease;
}
}
}
if (choice == 2) {
int l, r;
scanf("%d%d", &l, &r);
if (flip)
printf("%d\n",
sum(1, N, 1, (curend + 1) - (r), (curend + 1) - (l + 1)));
else
printf("%d\n", sum(1, N, 1, l + curstart, r + curstart - 1));
}
}
return 0;
}
| 2,200 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
long long x = (long long)ceil(n / 2.0);
if (k <= x) {
cout << k * 2 - 1 << endl;
} else {
cout << (k - x) * 2 << endl;
}
}
| 900 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <typename S, typename T>
ostream& operator<<(ostream& os, const pair<S, T>& x);
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& x);
template <typename T>
ostream& operator<<(ostream& os, const set<T>& v);
template <typename T>
ostream& operator<<(ostream& os, const multiset<T>& v);
template <typename S, typename T>
ostream& operator<<(ostream& os, const unordered_map<S, T>& v);
vector<long long> readvec(long long length, long long off = 0);
long long k;
long long prev_multiple_of_k(long long i) { return (i / k) * k; }
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
long long n_flowers, n_people, n_schema;
cin >> n_flowers >> k >> n_people >> n_schema;
vector<long long> v = readvec(n_flowers);
vector<long long> S = readvec(n_schema);
long long can_delete = n_flowers - n_people * k;
vector<long long> targets(6 * 1e5);
for (long long x : S) targets[x]++;
vector<long long> counts(6 * 1e5);
long long redundant = 0;
long long l = 0;
long long r = -1;
while (true) {
r++;
if (r >= n_flowers) goto fail;
counts[v[r]]++;
if (counts[v[r]] > targets[v[r]]) redundant++;
long long non_redundant = (r - l + 1) - redundant;
if (non_redundant >= n_schema) break;
}
while (targets[v[l]] == 0) {
l++;
if (l >= n_flowers) goto fail;
redundant--;
}
while (true) {
long long p = prev_multiple_of_k(l) + k - 1;
long long need_to_del = max(r - p, 0LL);
if (can_delete >= need_to_del &&
(l - prev_multiple_of_k(l) + redundant) >= need_to_del) {
cout << need_to_del << endl;
long long pos = prev_multiple_of_k(l);
while (need_to_del > 0) {
if (pos < l) {
cout << pos + 1 << " ";
need_to_del--;
} else {
if (counts[v[pos]] > targets[v[pos]]) {
cout << pos + 1 << " ";
counts[v[pos]]--;
need_to_del--;
}
}
pos++;
}
cout << endl;
return 0;
}
counts[v[l]]--;
if (counts[v[l]] >= targets[v[l]]) redundant--;
while (counts[v[l]] < targets[v[l]]) {
r++;
if (r >= n_flowers) goto fail;
if (counts[v[r]] >= targets[v[r]]) redundant++;
counts[v[r]]++;
}
l++;
}
fail:
cout << -1 << endl;
}
template <typename S, typename T>
ostream& operator<<(ostream& os, const unordered_map<S, T>& v) {
os << "[";
for (auto it = v.begin(); it != v.end(); it++) {
if (it != v.begin()) os << ", ";
os << it->first << ": " << it->second;
}
os << "]";
return os;
}
template <typename S, typename T>
ostream& operator<<(ostream& os, const map<S, T>& v) {
os << "{";
for (auto it = v.begin(); it != v.end(); it++) {
if (it != v.begin()) os << ", ";
os << it->first << ": " << it->second;
}
os << "}";
return os;
}
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;
}
os << "]";
return os;
}
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;
}
os << "]";
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;
}
os << "]";
return os;
}
template <typename S, typename T>
ostream& operator<<(ostream& os, const pair<S, T>& x) {
os << "(" << x.first << ", " << x.second << ")";
return os;
}
vector<long long> readvec(long long length, long long off) {
vector<long long> v;
for (long long i = 0; i < length; i++) {
long long x;
cin >> x;
v.push_back(x + off);
}
return v;
}
| 1,900 | CPP |
t=int(input())
for tt in range(t):
n,m=map(int,input().split())
li=list(map(int,input().split()))
x=sum(li)
x=min(x,m)
print(x) | 800 | PYTHON3 |
digitos = input()
var = int(digitos[6])
if var%2 == 0:
print('0')
else:
print('1') | 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long a[200010], N, l[200010], r[200010], f[200010];
stack<long long> stk;
long long read(long long x = 0) {
long long c, f = 1;
for (c = getchar(); !isdigit(c); c = getchar())
if (c == '-') f = -f;
for (; isdigit(c); c = getchar()) x = x * 10 + c - 48;
return f * x;
}
int main() {
long long N = read(), i, ans(0), j;
a[0] = a[N + 1] = (1ll << 60);
for (i = 1; i <= N; i++) a[i] = read(), f[a[i]] = i;
stk.emplace(0);
for (i = 1; i <= N; i++) {
while (a[stk.top()] < a[i]) stk.pop();
l[i] = stk.top() + 1;
stk.emplace(i);
}
while (!stk.empty()) stk.pop();
stk.emplace(N + 1);
for (i = N; i; i--) {
while (a[stk.top()] < a[i]) stk.pop();
r[i] = stk.top() - 1;
stk.emplace(i);
}
for (i = 1; i <= N; i++) {
if (i - l[i] < r[i] - i) {
for (j = l[i]; j < i; j++) {
if (i < f[a[i] - a[j]] and f[a[i] - a[j]] <= r[i]) ans++;
}
} else {
for (j = i + 1; j <= r[i]; j++) {
if (l[i] <= f[a[i] - a[j]] and f[a[i] - a[j]] < i) ans++;
}
}
}
printf("%lld", ans);
return 0;
}
| 2,200 | CPP |
#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1.0);
const int inf = (int)1e9 + 7;
const double inf1 = 1e-9;
const int ss = (int)1e6 + 3;
bool myf(const pair<string, string>& i, const pair<string, string>& j) {
return (i.first < j.first);
}
int main() {
int n, m;
double k;
cin >> n >> m >> k;
k += 1e-9;
map<string, int> a;
string s;
double z;
for (int i = 0; i < n; ++i) {
cin.get();
getline(cin, s, ' ');
cin >> z;
z = z * k;
if (z >= 100) a.insert(make_pair(s, z));
}
cin.get();
map<string, int>::iterator it;
for (int i = 0; i < m; ++i) {
getline(cin, s);
it = a.find(s);
if (it == a.end()) a.insert(make_pair(s, 0));
}
cout << a.size() << endl;
for (it = a.begin(); it != a.end(); ++it)
cout << it->first << " " << it->second << endl;
return 0;
}
| 1,700 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
cout << name << " : " << arg1 << "\n";
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
const char* comma = strchr(names + 1, ',');
cout.write(names, comma - names) << " : " << arg1 << " , ";
__f(comma + 1, args...);
}
int i, j, n, y, y2;
const int N = 10005;
const int D = 5000;
int st[4 * N];
void update(int node, int l, int r, int i, int val) {
if (l > r or l > i or r < i) return;
if (l == r and l == i) {
st[node] += val;
return;
}
int mid = (l + r) / 2;
update(2 * node + 1, l, mid, i, val);
update(2 * node + 2, mid + 1, r, i, val);
st[node] = st[2 * node + 1] + st[2 * node + 2];
}
int query(int node, int l, int r, int i, int j) {
if (l > r or l > j or r < i) return 0;
if (i <= l and r <= j) return st[node];
int mid = (l + r) / 2;
return query(2 * node + 1, l, mid, i, j) +
query(2 * node + 2, mid + 1, r, i, j);
}
int main() {
ios::sync_with_stdio(0);
cin >> n;
vector<pair<int, int> > h[N], v[N];
for (i = 0; i < n; ++i) {
int u, v1, w, x;
cin >> u >> v1 >> w >> x;
u += D, v1 += D, w += D, x += D;
if (u == w)
v[u].push_back({min(v1, x), max(v1, x)});
else
h[v1].push_back({min(u, w), max(u, w)});
}
long long ans = 0;
vector<int> bag[N];
for (y = 0; y < N; ++y) {
for (auto seg : h[y]) {
for (i = 0; i < N; ++i) bag[i].clear();
memset(st, 0, sizeof st);
int l = seg.first;
int r = seg.second;
for (i = l; i <= r; ++i) {
for (auto xseg : v[i]) {
if (xseg.first <= y and xseg.second > y) {
bag[xseg.second].push_back(i);
update(0, 0, N - 1, i, 1);
}
}
}
for (y2 = y + 1; y2 < N; ++y2) {
for (auto seg2 : h[y2]) {
int q = query(0, 0, N - 1, seg2.first, seg2.second);
ans += q * 1LL * (q - 1) / 2;
}
for (auto x : bag[y2]) update(0, 0, N - 1, x, -1);
}
}
}
cout << ans << "\n";
return 0;
}
| 2,200 | CPP |
#include <bits/stdc++.h>
using namespace std;
int a[100000];
vector<int> tree[100000];
long long dfs(int u, int prev) {
vector<long long> tmp;
for (int i = 0; i < (tree[u].size()); i++) {
int v = tree[u][i];
if (v != prev && a[v] >= 1) {
a[v]--;
tmp.push_back(1 + dfs(v, u) + 1);
}
}
sort(tmp.begin(), tmp.end(), greater<long long>());
int lim = min(a[u], (int)tmp.size());
long long res = accumulate(tmp.begin(), tmp.begin() + lim, 0LL);
a[u] -= lim;
for (int i = 0; i < (tree[u].size()); i++) {
int v = tree[u][i];
if (v != prev) {
long long m = min(a[u], a[v]);
res += 2 * m;
a[u] -= m;
a[v] -= m;
}
}
return res;
}
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < (n); i++) scanf("%d", a + i);
for (int i = 0; i < (n - 1); i++) {
int u, v;
scanf("%d%d", &u, &v);
u--;
v--;
tree[u].push_back(v);
tree[v].push_back(u);
}
int s;
scanf("%d", &s);
s--;
printf("%I64d\n", dfs(s, -1));
return 0;
}
| 2,100 | CPP |
import sys
dbg = False
if dbg:
sys.stdin = open('input.txt')
din = lambda:map(int, input().split())
M, N = din()
if (M*N) % 2 == 0:
print(M*N//2)
else:
print((M*N-1)//2)
| 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const long long MXN = 5e5 + 10;
const long long MXS = MXN * 4;
long long n, q;
long long A[MXN];
long long Seg[MXS], Lazy[MXS], LC[MXS], RC[MXS], Is_Rev[MXS];
void Build(long long id = 1, long long s = 1, long long e = n) {
if (s == e) {
Seg[id] = A[s];
return;
}
LC[id] = (id * 2), RC[id] = (id * 2 + 1);
Build((id * 2), s, ((s + e) / 2)), Build((id * 2 + 1), ((s + e) / 2 + 1), e);
Seg[id] = Seg[(id * 2)] + Seg[(id * 2 + 1)];
}
inline void Shift(long long id, long long s, long long e) {
Seg[id] += Lazy[id];
if (s == e) {
Lazy[id] = 0;
return;
}
Lazy[(id * 2)] += Lazy[id], Lazy[(id * 2 + 1)] += Lazy[id];
Lazy[id] = 0;
}
void Upd(long long ind, long long x, long long id = 1, long long s = 1,
long long e = n) {
Shift(id, s, e);
if (e < ind || s > ind) return;
if (s == e) {
Seg[id] = x;
return;
}
if (Is_Rev[(e - s + 1)]) swap(LC[id], RC[id]);
Upd(ind, x, LC[id], s, ((s + e) / 2)),
Upd(ind, x, RC[id], ((s + e) / 2 + 1), e);
if (Is_Rev[(e - s + 1)]) swap(LC[id], RC[id]);
Seg[id] = Seg[(id * 2)] + Seg[(id * 2 + 1)];
}
long long Get(long long l, long long r, long long id = 1, long long s = 1,
long long e = n) {
Shift(id, s, e);
if (e < l || s > r) return 0;
if (l <= s && e <= r) return Seg[id];
if (Is_Rev[(e - s + 1)]) swap(LC[id], RC[id]);
long long ans = Get(l, r, LC[id], s, ((s + e) / 2)) +
Get(l, r, RC[id], ((s + e) / 2 + 1), e);
if (Is_Rev[(e - s + 1)]) swap(LC[id], RC[id]);
return ans;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> q, n = (1LL << n);
for (int i = 1; i <= n; i++) cin >> A[i];
Build();
while (q--) {
long long typ, x, k, l, r;
cin >> typ;
switch (typ) {
case 1:
cin >> x >> k;
Upd(x, k);
break;
case 2:
cin >> k;
for (int i = 0; i <= k; i++) Is_Rev[(1LL << i)] = !Is_Rev[(1LL << i)];
break;
case 3:
cin >> k;
k++;
Is_Rev[(1LL << k)] = !Is_Rev[(1LL << k)];
break;
case 4:
cin >> l >> r;
cout << Get(l, r) << '\n';
break;
}
}
return 0;
}
| 2,400 | CPP |
#include <bits/stdc++.h>
using namespace std;
using int64 = long long;
constexpr int DEBUG = 0;
template <class T>
inline bool UpdateMin(T& a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T>
inline bool UpdateMax(T& a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <typename T>
vector<vector<T>> Make2DVector(int d1, int d2, T default_value) {
return vector<vector<T>>(d1, vector<T>(d2, default_value));
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
string s;
cin >> s;
vector<int> xs(n + 1);
int x_min = 0;
for (int i = 0; i < n; i++) {
xs[i + 1] = xs[i] + ((s[i] == '(') ? 1 : -1);
UpdateMin(x_min, xs[i + 1]);
}
if (xs[n] != 0) {
cout << 0 << endl;
cout << 1 << " " << 1 << endl;
return 0;
}
int max_score = 0;
for (int i = 1; i <= n; i++) {
if (xs[i] == x_min) max_score++;
}
int max_score_l = 0;
int max_score_r = 0;
for (int pattern = 0; pattern < 2; pattern++) {
int x_delta = vector<int>({-2, 2})[pattern];
char l_char = string("()")[pattern];
char r_char = string(")(")[pattern];
for (int new_min = x_min - 2; new_min <= x_min + 2; new_min++) {
auto dp1 = Make2DVector(n + 1, 3, -1);
auto dp2 = Make2DVector(n + 1, 3, -1);
dp1[0][0] = 0;
vector<int> next_states;
for (int i = 0; i < n; i++) {
for (int k = 0; k < 3; k++) {
if (dp1[i][k] < 0) continue;
next_states.clear();
next_states.push_back(k);
if (k == 0 && s[i] == l_char) next_states.push_back(1);
if (k == 1 && s[i] == r_char) next_states.push_back(2);
for (int next_state : next_states) {
int new_x = xs[i + 1] + ((next_state == 1) ? x_delta : 0);
if (new_x < new_min) continue;
int score_delta = (new_x == new_min) ? 1 : 0;
if (UpdateMax(dp1[i + 1][next_state], dp1[i][k] + score_delta)) {
dp2[i + 1][next_state] = k;
}
}
}
}
if (UpdateMax(max_score, dp1[n][2])) {
int cur_k = 2;
int l = -1;
int r = -1;
for (int i = n; i >= 0; i--) {
if (cur_k == 2 && dp2[i][cur_k] == 1) r = i - 1;
if (cur_k == 1 && dp2[i][cur_k] == 0) l = i - 1;
cur_k = dp2[i][cur_k];
if (cur_k == 0) break;
}
max_score_l = l;
max_score_r = r;
}
}
}
cout << max_score << endl;
cout << max_score_l + 1 << " " << max_score_r + 1 << endl;
}
| 2,500 | CPP |
magic = "1111111111111111111111111101010000001011111111111111111111111111111111111111111111111101000101010110100000111111111111111111111111111111111111111111000101110111001011110110111111111111111111111111111111111111100001010100000111100001010001011111111111111111111111111111111100111111010111110000111101010100111111111111111111111111111111011001000001000100010110100111011010111111111111111111111111111000110110111111010111000011001001001001111111111111111111111110000001001001000100010001111001101101110001111111111111111111110000000000001111011111011101001100100101100011111111111111111110000000000000000000010000000110000110000000000111111111111111110000000000000000000000000000000000000000000000001111111111111110000000000000000000000000000000000000000000000000011111111111111000000000000000000000000000000000000000000000000001111111111111000000000000000000000000000000000000000000000000000011111111111000000000000000000000000000000000000000000000000000000111111111100000000000000000000000000000000000000000000000000000011111111100000000000000000000000000000000000000000000000000000000111111100000000000000000000000000000000000000000000000000000000001111111100000000000000000000000000000000000000000000000000000000111111111100000000000011101100000000000000111010100000000000001111111001111100000000011011100000000000000010111111100000000111111111100001111100000111001011100000000000000010010011010011111110011100000001111101110001100011000000000001011011100111111111000000110000000001111101101100100111000000000100100000110111100000000011000000000000100100011111000110000000111011011110001000000000001100000000011111011100010001110000000010100000101110110100000000100000000000010001011011011101100000011011011110010001110000000000000000000011101101001000100010000101000100001100011101000000000000000000001000000100001111011010111101011010000111000100000000000000000000111110110110001000111010100100101101110110110000000000000000000001001000010010001110100011111000010100000010000000000000000000001110001101101110001011000100001101000111011100000000000000000000001111100100010010001001111101100100110111010000000000000000000000010010111101011110101101010010111001001000000000000000000000000111100001010101010000100101101000110001110000000000000000000000001011011100011100001110110011110110011100000000000000000000000000000111000111010010010010011010001011011000000000000000000000000000000111010000001111100000001110111000000000000000010000000000000000110111100000101000000000001110110000000000000011000000000000000000000000000000111100000000000000000000000000001100000000000000000000000000010110100000000000000000000000000000110000000000000000000000000101110000000000000000000000000000000011100000000000000000000000011101110000000000000000000000000000011110000000110000000000000000000100000000000000000000000000000001111100000001010000000000000000111000000000000000000000100000001111110000000111011100000000000110100000000000100000101111000000111111000000010101011010111001010011010110100111001111101000000011111110000000011100111110111111100111001111110101100010000000011111111100000001011000010000100011000111100010000010100000000011111111110000000000101101101110100001000100101111101110000000001111111111100000000111100100101111011101011110001011100000000001111111111111000000000100111000001001010111010011100000000000001111111111111100000000011000110101110001110100011011100000000000111111111111111000000000111000011100010010000100001000000000000111111111111111110000000001001111010111111011110100000000000000111111111111111111100000000000010100001001001010011000000000000111111111111111111111000000000000011110000111101111000000000000111111111111111111111111000000000000000000001000000000000000001111111111111111111111111110000000000000000000000000000000000001111111111111111111111111111110000000000000000000000000000000011111111111111111111111111111111100000000000000000000000000000011111111111111111111111111111111111110000000000000000000000001111111111111111111111111111111111111111110000000000000000000011111111111111111111111111111111111111111111111100000000000011111111111111111111111111"
r, c = map(int, input().split())
print("IN" if magic[r * 64 + c] == "0" else "OUT")
| 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int p[100005], n, m;
;
const int vx[] = {-1, 0, 0, 1}, vy[] = {0, -1, 1, 0};
bool check(int i, int j) {
int x1 = i / m, y1 = i % m;
int x2 = j / m, y2 = j % m;
for (int u = 0; u < 4; u++)
if (x1 + vx[u] == x2 && y1 + vy[u] == y2) return true;
return false;
}
bool dfs(int i) {
if (i == n * m) return true;
int x = i / m, y = i % m;
for (int j = i; j < n * m; j++) {
swap(p[i], p[j]);
if (x && check(p[i], p[(x - 1) * m + y])) continue;
if (y && check(p[i], p[x * m + y - 1])) continue;
if (dfs(i + 1)) return true;
swap(p[i], p[j]);
}
return false;
}
int main() {
while (~scanf("%d%d", &n, &m)) {
for (int i = 0; i < n * m; i++) p[i] = i;
if (dfs(0)) {
cout << "YES" << endl;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
if (j == m - 1)
printf("%d\n", p[i * m + j] + 1);
else
printf("%d ", p[i * m + j] + 1);
}
}
} else
cout << "NO" << endl;
}
}
| 2,200 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x, y, a, b;
vector<pair<int, int> > S;
cin >> x >> y >> a >> b;
for (int i = a; i <= x; ++i) {
for (int j = b; j <= y; ++j) {
if (i > j) {
S.push_back(make_pair(i, j));
}
}
}
sort(S.begin(), S.end());
cout << S.size() << endl;
for (int i = 0; i < S.size(); ++i) {
cout << S[i].first << " " << S[i].second << endl;
}
return 0;
}
| 1,100 | CPP |
input()
a = list(map(int, input().split()))
a_x = [x % 2 == 0 for x in a]
if a_x.count(True) > 1:
print(a_x.index(False) + 1)
else:
print(a_x.index(True) + 1)
| 1,300 | PYTHON3 |
for _ in range(int(input())):
x,y,n,m = map(int,input().split())
n += 1
m += 1
print(max(x*(m-1),x*(y-m),y*(n-1),y*(x-n))) | 800 | PYTHON3 |
# maa chudaaye duniya
from collections import deque
import sys
sys.setrecursionlimit(10**9)
md = 10**9+7
n, k = map(int, input().split())
cnt_e = 0
graph = [[] for i in range(n+1)]
for _ in range(n-1):
u, v, x = map(int, input().split())
if x == 0:
cnt_e += 1
graph[u].append(v)
graph[v].append(u)
total = pow(n, k, md)
if cnt_e == n:
print(0)
exit()
visited = [False]*(n+1)
b = 0
for i in range(1, n+1):
if visited[i]:
continue
queue = deque()
queue.append(i)
visited[i] = True
cnt = 0
while queue:
el = queue.pop()
for node in graph[el]:
if visited[node]:
continue
visited[node] = True
queue.append(node)
cnt += 1
b += pow(cnt, k, md)
print((total + md -b) % md) | 1,500 | PYTHON3 |
# -*- coding: utf-8 -*-
"""
Created on Sun Mar 29 12:08:36 2020
@author: Vincent
"""
#Input/Output
T = int(input())
for t in range(1, T + 1):
x = int(input())
print(1, x-1)
| 800 | PYTHON3 |
t=int(input())
while t>0:
t-=1
n=int(input())
print(n//2) | 800 | PYTHON3 |
q = int(input())
tl = []
tr = []
t_len = 2*10**5+1
t=[]
for x in range(0,t_len,+1):
t.append([0,''])
for x in range(0,q,+1):
tmp_tab = str(input()).split(' ')
l = tmp_tab[0]
c = int(tmp_tab[1])
if l=='L':
t[c][0] = len(tl)+1
t[c][1] = 'L'
tl.append(c)
elif l=='R':
t[c][0] = len(tr)+1
t[c][1] = 'R'
tr.append(c)
else:
if t[c][1]=='L':
print (min((len(tl)-t[c][0]),(len(tr)+t[c][0]-1)))
else:
print (min((len(tl)+t[c][0]-1),(len(tr)-t[c][0]))) | 1,400 | PYTHON3 |
#include <bits/stdc++.h>
int bit[4][12][12][100010] = {0}, n;
void update(int x, int y, int z, int i, int val) {
while (i <= n) {
bit[x][y][z][i] += val;
i = i + (i & (-i));
}
}
int sum(int x, int y, int z, int i) {
int s = 0;
while (i > 0) {
s += bit[x][y][z][i];
i = i - (i & (-i));
}
return s;
}
int getNumber(char a) {
if (a == 'A')
return 0;
else if (a == 'T')
return 1;
else if (a == 'G')
return 2;
else if (a == 'C')
return 3;
}
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(0);
std::string str;
std::cin >> str;
n = str.length();
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= 10; ++j) {
update(getNumber(str[i - 1]), j, i % j, i, 1);
}
}
int q;
std::cin >> q;
while (q--) {
int flip;
std::cin >> flip;
if (flip == 1) {
int place;
char c;
std::cin >> place >> c;
for (int j = 1; j <= 10; ++j) {
update(getNumber(str[place - 1]), j, place % j, place, -1);
update(getNumber(c), j, place % j, place, 1);
}
str[place - 1] = c;
} else {
int l, r, ans = 0;
std::string theOtherString;
std::cin >> l >> r >> theOtherString;
int lengthOfTheOtherString = theOtherString.length();
for (int i = 1; i <= lengthOfTheOtherString; ++i) {
ans += sum(getNumber(theOtherString[i - 1]), lengthOfTheOtherString,
(l + i - 1) % lengthOfTheOtherString, r) -
sum(getNumber(theOtherString[i - 1]), lengthOfTheOtherString,
(l + i - 1) % lengthOfTheOtherString, l - 1);
}
std::cout << ans << "\n";
}
}
}
| 2,100 | CPP |
#include <bits/stdc++.h>
using namespace std;
char a[110][110];
int n;
void read(int &x) {
char ch = getchar();
int mark = 1;
for (; ch != '-' && (ch < '0' || ch > '9'); ch = getchar())
;
if (ch == '-') mark = -1, ch = getchar();
for (x = 0; ch >= '0' && ch <= '9'; ch = getchar()) x = x * 10 + ch - 48;
x *= mark;
}
int main() {
read(n);
if (n == 5) {
printf(">...v\nv.<..\n..^..\n>....\n..^.<\n1 1\n");
} else if (n == 3) {
printf(">vv\n^<.\n^.<\n1 3\n");
} else {
int cnt = 0;
for (int i = 1; i <= n / 3; i++) a[1][++cnt] = '>';
for (int i = n / 3 + 1; i < n; i++) a[1][++cnt] = (i & 1) ? '>' : '.';
a[1][++cnt] = 'v';
a[2][1] = '^';
for (int i = 2; i <= n; i++) a[2][i] = (i & 1) ? '<' : 'v';
for (int i = n; i; i--) a[n][i] = (i & 1) ? '^' : '<';
for (int i = 1; i <= n; i++) {
int m = n - 3, cnt;
int t1 = 0, t2 = 0;
m++;
if (m % 3 == 1) t1 = 1;
if (m % 3 == 2) t2 = 1;
if (i & 1) {
cnt = n;
for (int j = 1; j <= m / 3 + t1; j++) a[cnt--][i] = '^';
for (int j = 1; j <= m / 3 + t2; j++)
a[cnt--][i] = '^', a[cnt--][i] = '.';
} else {
cnt = 1;
for (int j = 1; j <= m / 3 + t1; j++) a[++cnt][i] = 'v';
for (int j = 1; j <= m / 3 + t2; j++)
a[++cnt][i] = 'v', a[++cnt][i] = '.';
}
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) printf("%c", a[i][j]);
printf("\n");
}
printf("1 1\n");
}
return 0;
}
| 2,500 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t, i, j, k, n, l, m, o, p, ara[10] = {0}, count = 0;
char s[15];
scanf("%d", &t);
while (t--) {
scanf("%s", s);
n = strlen(s);
for (i = 0; i < n; i++)
if (s[i] == 'X') break;
if (i == n)
printf("0\n");
else {
ara[0] = 1;
count++;
for (i = 0, j = 6; i < 6; i++, j++)
if (s[i] == 'X' && s[j] == 'X') {
ara[1] = 2;
count++;
break;
}
for (i = 0, j = 4, k = 8; i < 4; i++, k++, j++)
if (s[i] == 'X' && s[j] == 'X' && s[k] == 'X') {
ara[2] = 3;
count++;
break;
}
for (i = 0, j = 3, k = 6, l = 9; i < 3; i++, k++, j++, l++)
if (s[i] == 'X' && s[j] == 'X' && s[k] == 'X' && s[l] == 'X') {
ara[3] = 4;
count++;
break;
}
for (i = 0, j = 2, k = 4, l = 6, m = 8, o = 10; i < 2;
i++, k++, j++, l++, m++, o++)
if (s[i] == 'X' && s[j] == 'X' && s[k] == 'X' && s[l] == 'X' &&
s[m] == 'X' && s[o] == 'X') {
ara[4] = 6;
count++;
break;
}
for (i = 0; i < n; i++)
if (s[i] != 'X') break;
if (i == n) {
ara[5] = 12;
count++;
}
printf("%d ", count);
for (i = 0; i < 10; i++) {
if (ara[i] != 0) printf("%dx%d ", ara[i], 12 / ara[i]);
}
printf("\n");
for (i = 0; i < 10; i++) ara[i] = 0;
count = 0;
}
}
return 0;
}
| 1,000 | CPP |
t=int(input())
def cal(l,comp,ind,counta,countb,n):
if(ind==n):
print(counta,countb)
if(ind==n and counta==countb):
return True
elif(ind==n):
return False
elif(l[ind]<comp):
return cal(l,l[ind],ind+1,counta+1,countb,n)
else:
return cal(l,l[ind],ind+1,counta+1,countb,n) or cal(l,l[ind],ind+1,counta,countb+1,n)
for _ in range(t):
# n,k=map(int,input().split())
# a,b=map(str,input().split())
n=int(input())
ans=""
if(n%4==0):
ans="8"*(n//4)
else:
ans="8"*((n//4)+1)
num9=n-len(ans)
ans="9"*num9+ans
print(ans) | 1,000 | PYTHON3 |
# import io, os
# input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
# import sys
t=int(input())
for _ in range(t):
a,b,c=list(map(int,input().split()))
if c<=a:
print(-1,b)
elif a<=c/b:
print(1,-1)
else:
print(1,b) | 1,000 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9 + 333;
const long long linf = 1e18 + inf;
const int N = 1e5 + 5;
const int SQRT = 100;
int n, q, ptr;
char str[N];
string s[N];
long long ans[N];
int fin[N], fail[N], trie[N][26];
vector<int> v[N], ___ends[N];
int x[N], y[N], k[N];
vector<int> ord;
vector<int> qu[N];
void build() {
for (int i = 1; i <= n; i++) {
int x = 0;
for (int j = 0; j < s[i].size(); j++) {
int u = s[i][j];
if (!trie[x][u]) {
trie[x][u] = ++ptr;
}
x = trie[x][u];
}
fin[i] = x;
___ends[x].push_back(i);
}
ord.push_back(0);
for (int it = 0; it < ord.size(); it++) {
int x = ord[it];
for (int i = 0; i < 26; i++) {
if (trie[x][i]) {
int u = trie[x][i];
int q = fail[x];
while (q and !trie[q][i]) {
q = fail[q];
}
if (q != x and trie[q][i]) q = trie[q][i];
v[q].push_back(u);
fail[u] = q;
ord.push_back(u);
}
}
}
}
vector<pair<pair<int, int>, int> > sq[N];
void get(int l, int r, int x, int id) {
int q = 0;
for (int i = 0; i < s[x].size(); i++) {
int u = s[x][i];
while (q and !trie[q][u]) {
q = fail[q];
}
if (trie[q][u]) q = trie[q][u];
sq[q].push_back(make_pair(pair<int, int>(l, r), id));
}
}
int fen[N];
void up(int x, int k) {
for (; x < N; x += x & -x) fen[x] += k;
}
int get(int x, int y) {
int res = 0;
for (; y; y -= y & -y) res += fen[y];
for (x--; x; x -= x & -x) res -= fen[x];
return res;
}
void dfs(int x) {
for (__typeof((___ends[x]).begin()) it = (___ends[x]).begin();
it != (___ends[x]).end(); it++) {
int u = *it;
up(u, 1);
}
for (__typeof((sq[x]).begin()) it = (sq[x]).begin(); it != (sq[x]).end();
it++) {
int l = it->first.first;
int r = it->first.second;
int i = it->second;
ans[i] += get(l, r);
}
for (__typeof((v[x]).begin()) it = (v[x]).begin(); it != (v[x]).end(); it++) {
int u = *it;
dfs(u);
}
for (__typeof((___ends[x]).begin()) it = (___ends[x]).begin();
it != (___ends[x]).end(); it++) {
int u = *it;
up(u, -1);
}
}
long long dp[N], cnt[N];
void solve(int x) {
memset(dp, 0, sizeof(dp));
memset(cnt, 0, sizeof(cnt));
int q = 0;
for (int i = 0; i < s[x].size(); i++) {
int u = s[x][i];
while (q and !trie[q][u]) {
q = fail[q];
}
if (trie[q][u]) q = trie[q][u];
cnt[q]++;
}
for (int i = (int)ord.size() - 1; i >= 0; i--) {
int x = ord[i];
cnt[fail[x]] += cnt[x];
}
for (int i = 1; i <= n; i++) {
dp[i] = dp[i - 1] + cnt[fin[i]];
}
for (__typeof((qu[x]).begin()) it = (qu[x]).begin(); it != (qu[x]).end();
it++) {
int i = *it;
int l = ::x[i];
int r = ::y[i];
ans[i] = dp[r] - dp[l - 1];
}
}
int main() {
scanf("%d %d", &n, &q);
for (int i = 1; i <= n; i++) {
scanf("%s", str);
s[i] = str;
for (int j = 0; j < s[i].size(); j++) s[i][j] -= 'a';
}
build();
for (int i = 1; i <= q; i++) {
scanf("%d %d %d", x + i, y + i, k + i);
if (s[k[i]].size() <= SQRT) {
get(x[i], y[i], k[i], i);
} else {
qu[k[i]].push_back(i);
}
}
dfs(0);
for (int i = 1; i <= n; i++) {
if (qu[i].size()) {
solve(i);
}
}
for (int i = 1; i <= q; i++) {
printf("%lld\n", ans[i]);
}
return 0;
}
| 3,000 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
string s;
cin >> s;
int st = 0, ed = s.length() - 1, c = 0;
while (st <= ed) {
if (s[st] != s[ed]) c++;
st++, ed--;
}
if (c > 1 || (c == 0 && s.length() % 2 == 0))
cout << "NO";
else
cout << "YES";
}
| 1,000 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
int n, m, num[250];
vector<int> a, b;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin >> n;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
a.push_back(x);
num[x]++;
}
cin >> m;
for (int i = 0; i < m; i++) {
int x;
cin >> x;
b.push_back(x);
num[x]++;
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
if (num[a[i] + b[j]] == 0) {
cout << a[i] << ' ' << b[j] << endl;
return 0;
}
}
}
}
| 800 | CPP |
a=int(input())
b=list(map(int,input().split()))
c=0
d=0
e=0
for i in b:
if i==1:
c+=1
elif i==2:
d+=1
else:
e+=1
y=0
print(min(c,d,e))
for i in range(min(c,d,e)):
for j in range(1,4):
print(b.index(j)+1)
y+=0
b[b.index(j)]=0 | 800 | PYTHON3 |
#dt = {} for i in x: dt[i] = dt.get(i,0)+1
import sys;input = sys.stdin.readline
#import io,os; input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline #for pypy
inp,ip = lambda :int(input()),lambda :[int(w) for w in input().split()]
for _ in range(inp()):
n = inp()
dt = {0:[],1:[],2:[]}
dt[0] = ip()
dt[1] = ip()
dt[2] = ip()
for k in range(3):
ans = [-1]*n
ans[0] = dt[k][0]
for i in range(1,n):
for j in range(3):
if dt[j][i] != ans[i-1]:
if i == n-1:
if dt[j][i] != ans[0]:
ans[i] = dt[j][i]
break
else:
ans[i] = dt[j][i]
break
if -1 not in ans:
break
print(*ans)
| 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353;
long long a[4004][4004];
long long g[4004 * 3004];
int main() {
int n, m, A, B, x, y, z;
cin >> n >> m >> A >> B >> g[0] >> x >> y >> z;
for (int i = 1; i <= n * m; ++i) {
g[i] = (g[i - 1] * x + y) % z;
}
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= m; ++j) {
int id = (i - 1) * m + j - 1;
a[i][j] = (g[id]);
}
}
long long ans = 0;
for (int i = 1; i <= n; ++i) {
deque<pair<int, int>> q;
q.clear();
for (int j = 1; j <= m; ++j) {
while (q.size() && q.back().first >= a[i][j]) q.pop_back();
while (q.size() && q.front().second + B - 1 < j) q.pop_front();
q.push_back({a[i][j], j});
a[i][j] = q.front().first;
}
}
for (int j = 1; j <= m; ++j) {
deque<pair<int, int>> q;
q.clear();
for (int i = 1; i <= n; ++i) {
while (q.size() && q.back().first >= a[i][j]) q.pop_back();
while (q.size() && q.front().second + A - 1 < i) q.pop_front();
q.push_back({a[i][j], i});
if (i >= A && j >= B) ans += q.front().first;
}
}
cout << ans << endl;
}
| 2,100 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, i, j, k, t;
scanf("%lld", &t);
while (t--) {
scanf("%lld", &n);
long long int a[n + 1], even[n + 1], odd[n + 1], sum = 0;
long long int diff = 0, oddp, evenp;
for (i = 0; i < n; i++) {
scanf("%lld", &a[i]);
even[i] = 0;
odd[i] = 0;
if (i % 2 == 0) sum += a[i];
}
for (i = 0; i < n; i++) {
if (i % 2) {
odd[i] = odd[i - 1] + a[i];
even[i] = even[i - 1];
} else {
if (i == 0) {
even[i] += a[i];
odd[i] = 0;
} else {
even[i] = even[i - 1] + a[i];
odd[i] = odd[i - 1];
}
}
if (i % 2) {
long long int d = odd[i] - even[i];
if (d > diff) diff = d;
if (d < 0) {
odd[i] = 0;
even[i] = 0;
}
}
}
for (i = 0; i < n; i++) {
odd[i] = 0;
even[i] = 0;
}
for (i = 1; i < n; i++) {
if (i % 2) {
odd[i] = odd[i - 1] + a[i];
even[i] = even[i - 1];
} else {
if (i == 0) {
even[i] += a[i];
odd[i] = 0;
} else {
even[i] = even[i - 1] + a[i];
odd[i] = odd[i - 1];
}
}
if (i % 2 == 0) {
long long int d = odd[i] - even[i];
if (d > diff) diff = d;
if (d < 0) {
odd[i] = 0;
even[i] = 0;
}
}
}
sum += diff;
cout << sum << endl;
}
}
| 1,600 | CPP |
#------------------------------warmup----------------------------
import os
import sys
import math
from io import BytesIO, IOBase
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
#-------------------game starts now----------------------------------------------------
n=int(input())
s=input()
c=0
for i in range (1,n):
if s[i]==s[i-1]:
c+=1
print(c) | 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int inf = 0x20202020;
const int mod = 1000000007;
inline void read(int &x) {
char ch;
bool f = 0;
int a = 0;
while (!((((ch = getchar()) >= '0') && (ch <= '9')) || (ch == '-')))
;
if (ch != '-')
a *= 10, a += ch - '0';
else
f = 1;
while (((ch = getchar()) >= '0') && (ch <= '9')) a *= 10, a += ch - '0';
if (f) a = -a;
x = a;
}
const int DX[] = {1, 0, -1, 0}, DY[] = {0, 1, 0, -1};
long long powmod(long long a, long long b) {
long long res = 1;
a %= mod;
for (; b; b >>= 1) {
if (b & 1) res = res * a % mod;
a = a * a % mod;
}
return res;
}
long long powmod(long long a, long long b, long long mod) {
long long res = 1;
a %= mod;
for (; b; b >>= 1) {
if (b & 1) res = res * a % mod;
a = a * a % mod;
}
return res;
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
const int N = 111111, M = 111111;
int l, m, n, t, tot;
struct zcc {
int x, v;
} a[N];
inline bool cmp(const zcc &a, const zcc &b) { return a.v < b.v; }
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; ++i) scanf("%d", &a[i].v), a[i].x = i, tot += a[i].v;
sort(a + 1, a + 1 + n, cmp);
if (n == 1 && m == tot) {
puts("Yes");
for (int i = 1; i <= 2 * a[1].v - 1; ++i) printf("%d ", a[1].x);
printf("%d\n", a[1].x);
} else if (n >= 2 && m >= 2 && m <= tot) {
puts("Yes");
while (m > 2) {
if (a[1].v > 1)
a[1].v--, printf("%d %d ", a[1].x, a[1].x), m--;
else if (a[n].v)
a[n].v--, printf("%d %d ", a[n].x, a[n].x), m--;
else
n--;
}
if (a[2].v) {
a[2].v--;
a[1].v--;
printf("%d ", a[1].x);
for (int i = 2; i <= n; ++i)
for (int j = 1; j <= a[i].v; ++j) printf("%d %d ", a[i].x, a[i].x);
printf("%d ", a[1].x);
printf("%d ", a[2].x);
for (int i = 1; i <= a[1].v; ++i) printf("%d %d ", a[1].x, a[1].x);
printf("%d\n", a[2].x);
} else {
printf("%d %d\n", a[1].x, a[1].x);
}
} else if (n >= 2 && m == 1 && a[1].v == 1) {
puts("Yes");
printf("%d ", a[1].x);
for (int i = 2; i <= n; ++i)
for (int j = 1; j <= a[i].v; ++j) printf("%d %d ", a[i].x, a[i].x);
printf("%d\n", a[1].x);
} else
puts("No");
return 0;
}
| 2,400 | CPP |
n = int(input())
s = input()
nr1 = s.count('n')
print('1 ' * nr1, end='')
nr2 = int((n - 3 * nr1) / 4)
print('0 ' * nr2)
| 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long i, j, k = 0, n;
string a[2000];
char l;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
}
for (i = 0; i < n; i++) {
if ((char(a[i][0]) == 'O') && (char(a[i][1]) == 'O')) {
a[i][0] = '+';
a[i][1] = '+';
k++;
break;
}
if ((char(a[i][3]) == 'O') && (char(a[i][4]) == 'O')) {
a[i][3] = '+';
a[i][4] = '+';
k++;
break;
}
}
if (k == 0)
cout << "NO";
else {
cout << "YES" << endl;
for (i = 0; i < n; i++) {
cout << a[i] << endl;
}
}
}
| 800 | CPP |
n=int(input())
s=input()
stack=[]
queue=[]
ans=[-1]*n
old=0
new=0
flag=0
for i in range(n):
if s[i]=="(":
if len(stack)==0:
stack.append(s[i])
old=i
else:
queue.append([i,s[i]])
elif s[i]==")":
stack.pop()
ans[i]=flag
ans[old]=flag
if flag==0:
flag=1
else:
flag=0
if len(stack)==0:
if len(queue)>0:
old=queue[0][0]
stack.append((queue.pop(0))[1])
sol=""
for i in ans:
if i==0:
sol+="0"
else:
sol+="1"
print (sol)
| 1,500 | PYTHON3 |
word=sorted(input())
k=""
for i in word[:-1]:
if i!="+":
k=k+i+"+"
print(k+word[-1])
| 800 | PYTHON3 |
import re
n = input()
if re.search('h.*e.*l.*l.*o',n):
print('YES')
else:
print('NO') | 1,000 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int bla(char c) {
if (c >= 'a' && c <= 'z') return -c + 'a' - 1;
if (c >= 'A' && c <= 'Z') return c - 'A' + 1;
return 0;
}
int main() {
string s;
cin >> s;
int ans = 0;
for (int i = 0; i < s.length(); i++) {
ans += bla(s[i]);
}
cout << ans;
}
| 2,000 | CPP |
q = int(input())
while q>0:
q-=1
n, m = list(map(int,input().split()))
mults = n//(10*m)
resto = n%(10*m)
s = 0
for i in range(1,10):
s += (m*i)%10
s *= mults
k = m
while k <= resto:
s += k%10
k += m
print(s)
| 1,200 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
long long lcm(long long a, long long b) { return a * (b / gcd(a, b)); }
void solve() {
cout << setprecision(15);
long long a, b, w, x, c, ans = 0;
cin >> a >> b >> w >> x >> c;
if (c - a <= 0)
cout << 0;
else
cout << c - a + ceil((((c - a) * x - b) * 1.0) / (w - x));
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int TESTS = 1;
while (TESTS--) {
solve();
}
return 0;
}
| 2,000 | CPP |
a,b=map(int,input().split())
bs,s={},{}
for _ in " "*a:
x,y,z=input().split()
y,z=int(y),int(z)
if x=='B':
if y in bs:bs[y]+=z
else:bs[y]=z
else:
if y in s:s[y]+=z
else:s[y]=z
z=[['S',i,s[i]] for i in sorted(s)][:b][::-1]
z1=[['B',i,bs[i]] for i in sorted(bs,reverse=True)][:b]
for i in z:print(*i)
for i in z1:print(*i) | 1,300 | PYTHON3 |
s = list(map(int,input().split()))
print(4 - (len(set(s)))) | 800 | PYTHON3 |
import array
import bisect
import heapq
import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = 'x' in file.mode or 'r' not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b'\n') + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode('ascii'))
self.read = lambda: self.buffer.read().decode('ascii')
self.readline = lambda: self.buffer.readline().decode('ascii')
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip('\r\n')
def ints_get(): return map(int, input().strip().split())
def list_get(): return list(map(int, sys.stdin.readline().strip().split()))
def chars_get(): return list(map(str, sys.stdin.readline().strip().split()))
def output(to_be_printed, end="\n"): sys.stdout.write(str(to_be_printed) + end)
# ******************************************************#
# **************** code starts here ********************#
# ******************************************************#
def main():
t = int(input())
val = 0
v = [0]
for i in range(1, 4 * (10**5)):
v.append(val)
val = val ^ i
for _ in range(t):
a, b = ints_get()
if v[a] == b:
output(a)
elif v[a] ^ b == a:
print(a + 2)
else:
print(a + 1)
return
if __name__ == "__main__":
main()
| 1,000 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int maxm = 2 * (int)1e6 + 100;
const int maxn = (int)1e5 + 10;
vector<int> h[maxm], g[maxn];
int val[maxn], l[maxn], r[maxn], ans[maxn], dep[maxn];
vector<int> prime;
int vis[2000];
int n, q, cnt;
void pre() {
for (int i = 2; i <= 1555; i++) {
if (vis[i] == 0) {
prime.push_back(i);
for (int j = i * i; j <= 1555; j += i) vis[j] = 1;
}
}
}
int findx(int val) {
if (h[val].size()) return h[val][h[val].size() - 1];
return 0;
}
void insertVal(int x, int v) { h[x].push_back(v); }
void deleteVal(int x) {
if (h[x].size()) h[x].pop_back();
}
void dfs(int u, int pos, bool all, int nod, int fa) {
ans[u] = 0;
int tmp = val[u];
for (int i = 0; i < prime.size() && prime[i] * prime[i] <= tmp; i++) {
if (tmp % prime[i] == 0) {
int v = findx(prime[i]);
if (dep[ans[u]] < dep[v]) ans[u] = v;
insertVal(prime[i], u);
while (tmp % prime[i] == 0) tmp /= prime[i];
}
}
if (tmp > 1) {
int v = findx(tmp);
if (dep[ans[u]] < dep[v]) ans[u] = v;
insertVal(tmp, u);
}
if (nod == 0) l[u] = ++cnt;
for (int i = 0; i < g[u].size(); i++) {
int v = g[u][i];
if (v == fa) continue;
if (nod == 0) dep[v] = dep[u] + 1;
dfs(v, pos, all || nod == u, nod, u);
}
if (nod == 0) r[u] = cnt;
tmp = val[u];
for (int i = 0; i < prime.size() && prime[i] * prime[i] <= tmp; i++) {
if (tmp % prime[i] == 0) {
deleteVal(prime[i]);
while (tmp % prime[i] == 0) tmp /= prime[i];
}
}
if (tmp > 1) {
deleteVal(tmp);
}
}
int main() {
pre();
dep[1] = 1;
scanf("%d%d", &n, &q);
for (int i = 1; i <= n; i++) scanf("%d", &val[i]);
for (int i = 0; i < n - 1; i++) {
int u, v;
scanf("%d%d", &u, &v);
g[u].push_back(v);
g[v].push_back(u);
}
dfs(1, 1, 1, 0, 1);
while (q--) {
int type;
scanf("%d", &type);
if (type == 1) {
int v;
scanf("%d", &v);
cout << (ans[v] ? ans[v] : -1) << endl;
} else {
int u, v;
scanf("%d%d", &u, &v);
val[u] = v;
dfs(1, l[u], 0, u, 1);
}
}
return 0;
}
| 2,100 | CPP |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
inline int rund() {
int x576363482791fuweh = rng();
return abs(x576363482791fuweh) % RAND_MAX;
}
const char en = '\n';
vector<int> bases;
ll myrand() {
ll a = rund();
a *= RAND_MAX;
a += rund();
return a;
}
const ll llinf = 1LL << 60;
const int inf = 1 << 30;
const int MOD = 1e9 + 7;
void yes() {
cout << "YES" << en;
return;
}
void no() {
cout << "NO" << en;
return;
}
inline int pot(int n, int k) {
ll ret = 1;
while (k) {
if (k & 1) {
ret *= n;
ret %= MOD;
}
n *= n;
n %= MOD;
k >>= 1;
}
return ret;
}
const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
const int MAXN = 3500 + 10;
int arr[MAXN];
vector<pair<int, pair<int, int> > > v;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
for (int i = 0; i < 10; ++i)
bases.push_back(rand() % (MOD - 2 * 13893829) + 13893829);
int t;
cin >> t;
while (t--) {
int n, m, k;
cin >> n >> m >> k;
k = min(k, m - 1);
v.clear();
for (int i = 0; i < n; ++i) cin >> arr[i];
for (int i = 0; i + n - m < n; ++i) {
v.push_back({max(arr[i], arr[i + n - m]), {i + 1, m - i}});
}
sort(begin(v), end(v));
int r = k;
int sol = v[0].first;
for (int l = 0; l <= k; ++l, --r) {
for (int i = 0; i + n - m < n; ++i) {
if (v[i].second.first > l && v[i].second.second > r) {
sol = max(sol, v[i].first);
break;
}
}
}
cout << sol << en;
}
return 0;
}
| 1,600 | CPP |
n=int(input())
s=list(map(int,input().split()))
mx=s[0]
mn=s[0]
c=0
for i in range(1,n):
if s[i]>mx:
mx=s[i]
c+=1
elif s[i]<mn:
mn=s[i]
c+=1
else:
continue
print(c)
| 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 2e5 + 1;
bool bought[MAX_N];
struct shirt {
int p;
int fc, bc;
int idx;
shirt() { p = 0, fc = 0, bc = 0, idx = 0; };
};
struct shirt_comp {
bool operator()(const shirt &a, const shirt &b) { return a.p < b.p; }
};
void solve() {
int n;
cin >> n;
vector<shirt> shirts(n);
map<int, set<shirt, shirt_comp> > m;
for (int i = 0; i < n; i++) {
int p;
cin >> p;
shirts[i].p = p;
shirts[i].idx = i;
}
for (int i = 0; i < n; i++) {
int fc;
cin >> fc;
shirts[i].fc = fc;
m[fc].insert(shirts[i]);
}
for (int i = 0; i < n; i++) {
int bc;
cin >> bc;
shirts[i].bc = bc;
m[bc].insert(shirts[i]);
}
int k;
cin >> k;
for (int i = 0; i < k; i++) {
int color;
cin >> color;
bool found = false;
while (!m[color].empty()) {
shirt cur = *m[color].begin();
m[color].erase(m[color].begin());
if (!bought[cur.idx]) {
found = true;
bought[cur.idx] = true;
cout << cur.p << ' ';
break;
}
}
if (!found) {
cout << -1 << ' ';
}
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
solve();
return 0;
}
| 1,400 | CPP |
from sys import stdin, stdout
n = int(stdin.readline())
event = []
for i in range(n):
a, b = map(int, stdin.readline().split())
event.append((a, b))
event.sort()
ans = 0
ind = 0
for i in range(1, n):
l, r = event[ind]
lc, rc = event[i]
if rc < r:
ans += 1
else:
ind = i
stdout.write(str(ans)) | 1,500 | PYTHON3 |
n = int(input())
if n%2==0:
print(n-8, '8')
else:
print(n-9,'9') | 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long INF = 1 << 28;
const double pi = acos(-1.0);
int fx[] = {1, -1, 0, 0};
int fy[] = {0, 0, 1, -1};
int dir[4][2] = {1, 0, -1, 0, 0, -1, 0, 1};
int knight[8][2] = {1, 2, 1, -2, 2, 1, 2, -1, -1, 2, -1, -2, -2, 1, -2, -1};
const long double EPS = 1e-7;
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 / gcd(a, b) * b; }
bool cmp(int a, int b) { return a < b; }
int on(int mask, int st) { return mask | (1 << st); }
int off(int mask, int st) { return mask & (~(1 << st)); }
const int mx = 200010;
string arr[mx];
int main() {
int n, l, k;
scanf("%d %d %d", &n, &l, &k);
string s;
cin >> s;
sort(s.begin(), s.end());
int ind = 0;
int ln = s.length();
char c = s[0];
int lastind = ln - 1;
int lf = 0, r = k - 1;
for (int j = 0; j < l; j++) {
int i = lf;
while (i <= r) {
if (c != s[ind]) {
lf = i;
c = s[ind];
}
arr[i] += s[ind++];
i++;
}
}
for (int i = 0; i < n; i++) {
while (arr[i].length() != l) {
arr[i] += s[ind++];
}
}
sort(arr, arr + n);
for (int i = 0; i < n; i++) {
cout << arr[i] << endl;
}
return 0;
}
| 1,800 | CPP |
n=int(input())
p=list(map(int,input().split()))[:n]
a=[]
for j in range(1,n+1):
for i in range(n):
if(p[i]==j):
a.append(i+1)
for name in a:
print(name,end=" ")
| 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long int a[55], b[55], n, m, t;
set<long long int> s;
int main() {
cin >> n >> m;
for (int i = 0; i < n; i++) cin >> a[i];
for (int j = 0; j < m; j++) cin >> b[j];
for (int i = 0; i < n; i++) {
t = -1e18;
for (int j = 0; j < n; j++)
if (j == i)
continue;
else
for (int k = 0; k < m; k++) t = max(t, a[j] * b[k]);
s.insert(t);
}
if (s.size() > 1) s.erase(*s.rbegin());
cout << *s.rbegin() << "\n";
}
| 1,400 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 105;
struct node {
int p, l, r;
bool operator<(const node &b) const { return p < b.p; }
} a[N];
int n, m, o[N * 3], id[N * 3], f[N][N * 3];
int main() {
scanf("%d", &n);
for (int i = 1, x, y; i <= n; ++i) {
scanf("%d%d", &x, &y);
a[i] = (node){x, x - y, x + y};
o[++m] = x;
o[++m] = x - y;
o[++m] = x + y;
}
sort(a + 1, a + n + 1);
sort(o + 1, o + m + 1);
m = unique(o + 1, o + m + 1) - o - 1;
for (int i = 1; i <= n; ++i) {
a[i].p = lower_bound(o + 1, o + m + 1, a[i].p) - o;
a[i].l = lower_bound(o + 1, o + m + 1, a[i].l) - o;
a[i].r = lower_bound(o + 1, o + m + 1, a[i].r) - o;
id[a[i].p] = i;
}
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= m; ++j) f[i][j] = f[i - 1][j];
for (int j = a[i].l + 1; j <= a[i].p; ++j)
f[i][j] = max(f[i][j], f[i - 1][a[i].l] + o[j] - o[a[i].l]);
for (int j = a[i].p + 1, k = f[i - 1][a[i].p]; j <= a[i].r; ++j) {
f[i][j] = max(f[i][j], k + o[j] - o[a[i].p]);
if (id[j] && a[id[j]].l < a[i].p)
k = max(k, f[i - 1][a[id[j]].l] + o[a[i].p] - o[a[id[j]].l]);
}
for (int j = 1; j <= m; ++j) f[i][j] = max(f[i][j], f[i][j - 1]);
}
printf("%d\n", f[n][m]);
return 0;
}
| 3,000 | CPP |
# Longest uncommon subsequence
def lucs(string_a, string_b):
if string_a == string_b:
return -1
return max(len(string_a), len(string_b))
if __name__ == "__main__":
string_a = input()
string_b = input()
response = lucs(string_a, string_b)
print(response)
| 1,000 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
void sync() {
cin.sync_with_stdio(0);
cout.tie(0);
}
int main() {
int a, b, c;
cin >> a >> b >> c;
cout << (2 * b + 1) * (a - 1) << " " << a * c << endl;
}
| 1,000 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline ostream &operator<<(ostream &_out, const vector<T> &_v) {
if (_v.empty()) return _out;
_out << _v.front();
for (auto _it = ++_v.begin(); _it != _v.end(); ++_it) _out << ' ' << *_it;
return _out;
}
template <typename T>
inline istream &operator>>(istream &_in, vector<T> &_v) {
for (auto &_i : _v) _in >> _i;
return _in;
}
template <typename T>
inline ostream &operator<<(ostream &_out, const set<T> &_s) {
if (_s.empty()) return _out;
_out << *_s.begin();
for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) _out << ' ' << *_it;
return _out;
}
template <typename T, typename U>
inline ostream &operator<<(ostream &_out, const map<T, U> &_m) {
if (_m.empty()) return _out;
_out << '(' << _m.begin()->first << ": " << _m.begin()->second << ')';
for (auto _it = ++_m.begin(); _it != _m.end(); ++_it)
_out << ", (" << _it->first << ": " << _it->second << ')';
return _out;
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
inline void solve() {
long long a, b, n, m;
cin >> a >> b >> n >> m;
cout << (m <= min(a, b) && m + n <= a + b ? "Yes\n" : "No\n");
}
inline void tsolve() {
int t;
cin >> t;
while (t--) solve();
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
tsolve();
return 0;
}
| 1,300 | CPP |
n, m = map(int, input().split())
maxf = (n - 1) * n // 2
if n & 1:
t = (n - 1) // 2
minf = t * (t + 1)
else:
t = n // 2 - 1
minf = t * (t + 1) + t + 1
ans = 0
for i in range(m):
x, d = map(int, input().split())
ans += x * n
if d > 0:
ans += maxf * d
else:
ans += minf * d
# print(ans)
print("%.10f" % (ans / n)) | 1,700 | PYTHON3 |
T,=map(int,input().split())
for _ in range(T):
K,=map(int,input().split())
if K%2:
print(-1)
continue
X=[]
R=0
while 1:
c=4
f=1
while R+c-2<=K:
if f:
f=0
X.append(1)
else:
X.append(0)
c*=2
R+=c//2 - 2
if R==K:
break
print(len(X))
print(*X)
| 1,900 | PYTHON3 |
abcd = input().split()
for i in range(len(abcd)):
abcd[i] = int(abcd[i])
d = abcd[-1]
abc = [abcd[i] for i in range(3)]
abc = sorted(abc)
count = 0
diff1 = abs(abc[0] - abc[1]) - d
diff2 = abs(abc[1] - abc[2]) - d
if diff1 < 0:
count += -1 * diff1
if diff2 < 0:
count += -1 * diff2
print(count) | 800 | PYTHON3 |
#include <bits/stdc++.h>
const int INF = 0x3f3f3f3f;
const int N = 5e5 + 10;
using namespace std;
int n, m, p;
char str[N];
int dp[N];
stack<int> s;
int cur;
int tree[4 * N];
char op[N];
void build(int l, int r, int x) {
if (l == r) {
tree[x] = 0;
return;
}
int mid = (l + r) >> 1;
build(l, mid, x << 1);
build(mid + 1, r, x << 1 | 1);
if (tree[x << 1] == 1 && tree[x << 1 | 1] == 1)
tree[x] = 1;
else
tree[x] = 0;
}
void init() {
scanf("%s", str + 1);
memset(dp, 0, sizeof(dp));
if (!s.empty()) s.pop();
for (int i = 1; i <= n; i++) {
if (str[i] == '(') {
s.push(i);
} else {
int r = s.top();
s.pop();
dp[i] = r;
dp[r] = i;
}
}
scanf("%s", op);
build(1, n, 1);
}
void add(int l, int r, int x, int L, int R) {
if (L == l && R == r) {
tree[x] = 1;
return;
}
int mid = (l + r) >> 1;
if (R <= mid)
add(l, mid, x << 1, L, R);
else if (L > mid)
add(mid + 1, r, x << 1 | 1, L, R);
else {
add(l, mid, x << 1, L, mid);
add(mid + 1, r, x << 1 | 1, mid + 1, R);
}
if (tree[x << 1] == 1 && tree[x << 1 | 1] == 1)
tree[x] = 1;
else
tree[x] = 0;
}
int flag;
int queryl(int l, int r, int x, int pos) {
if (l == r) {
if (tree[x] == 0) {
flag = 1;
return l;
} else {
flag = 0;
return l;
}
}
if (tree[x] == 1) {
flag = 0;
return 0;
}
int mid = (l + r) >> 1;
if (pos <= mid) return queryl(l, mid, x << 1, pos);
int e = queryl(mid + 1, r, x << 1 | 1, pos);
if (flag)
return e;
else
return queryl(l, mid, x << 1, pos);
}
int queryr(int l, int r, int x, int pos) {
if (l == r) {
if (tree[x] == 0) {
flag = 1;
return l;
} else {
flag = 0;
return l;
}
}
if (tree[x] == 1) {
flag = 0;
return 0;
}
int mid = (l + r) >> 1;
if (pos > mid) return queryr(mid + 1, r, x << 1 | 1, pos);
int e = queryr(l, mid, x << 1, pos);
if (flag)
return e;
else
return queryr(mid + 1, r, x << 1 | 1, pos);
}
int read(int l, int r, int x, int pos) {
if (l == r) return tree[x];
int mid = (l + r) >> 1;
if (tree[x] == 1) return 1;
if (pos <= mid)
return read(l, mid, x << 1, pos);
else
return read(mid + 1, r, x << 1 | 1, pos);
}
int main() {
int i, j;
while (~scanf("%d%d%d", &n, &m, &p)) {
init();
cur = p;
for (i = 0; i < m; i++) {
if (op[i] == 'R') {
flag = 0;
cur = queryr(1, n, 1, cur + 1);
} else if (op[i] == 'L') {
flag = 0;
cur = queryl(1, n, 1, cur - 1);
} else {
int l = min(dp[cur], cur);
int r = max(dp[cur], cur);
add(1, n, 1, l, r);
if (cur != n) {
flag = 0;
int e = queryr(1, n, 1, cur + 1);
if (flag)
cur = e;
else {
flag = 0;
cur = queryl(1, n, 1, cur - 1);
}
} else {
flag = 0;
cur = queryl(1, n, 1, cur - 1);
}
}
}
for (i = 1; i <= n; i++) {
if (!read(1, n, 1, i)) printf("%c", str[i]);
}
putchar('\n');
}
return 0;
}
| 1,700 | CPP |
listt = input().split('+')
listt.sort()
answer = '+'.join(listt)
print(answer)
| 800 | PYTHON3 |
(x,y,z) = map(int, input().split())
(a,b,c) = map(int, input().split())
if a >= x and a-x+b >= y and a-x+b-y+c >= z:
print("Yes")
else:
print("No")
| 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 5;
const long long p = 1009;
void fft(vector<complex<double> > &a, bool inv) {
int n = a.size(), j = 0;
vector<complex<double> > roots(n / 2);
for (int i = 1; i < n; i++) {
int bit = (n >> 1);
while (j >= bit) {
j -= bit;
bit >>= 1;
}
j += bit;
if (i < j) swap(a[i], a[j]);
}
double ang = 2 * acos(-1) / n * (inv ? -1 : 1);
for (int i = 0; i < n / 2; i++) {
roots[i] = complex<double>(cos(ang * i), sin(ang * i));
}
for (int i = 2; i <= n; i <<= 1) {
int step = n / i;
for (int j = 0; j < n; j += i) {
for (int k = 0; k < i / 2; k++) {
complex<double> u = a[j + k], v = a[j + k + i / 2] * roots[step * k];
a[j + k] = u + v;
a[j + k + i / 2] = u - v;
}
}
}
if (inv)
for (int i = 0; i < n; i++) a[i] /= n;
}
vector<long long> multiply(vector<long long> &v, vector<long long> &w) {
vector<complex<double> > fv(v.begin(), v.end()), fw(w.begin(), w.end());
int n = 1;
while (n < max(v.size(), w.size())) n <<= 1;
n <<= 1;
fv.resize(n);
fw.resize(n);
fft(fv, 0);
fft(fw, 0);
for (int i = 0; i < n; i++) fv[i] *= fw[i];
fft(fv, 1);
vector<long long> ret(n);
for (int i = 0; i < n; i++) ret[i] = (long long)round(fv[i].real());
return ret;
}
vector<long long> multiply(vector<long long> &v, vector<long long> &w,
long long mod) {
int n = 1;
while (n < max(v.size(), w.size())) n <<= 1;
n <<= 1;
vector<complex<double> > v1(n), v2(n);
vector<complex<double> > r1(n), r2(n);
for (int i = 0; i < v.size(); i++) {
v1[i] = complex<double>(v[i] >> 15, v[i] & 32767);
}
for (int i = 0; i < w.size(); i++) {
v2[i] = complex<double>(w[i] >> 15, w[i] & 32767);
}
fft(v1, 0);
fft(v2, 0);
for (int i = 0; i < n; i++) {
int j = (i ? (n - i) : i);
complex<double> ans1 = (v1[i] + conj(v1[j])) * complex<double>(0.5, 0);
complex<double> ans2 = (v1[i] - conj(v1[j])) * complex<double>(0, -0.5);
complex<double> ans3 = (v2[i] + conj(v2[j])) * complex<double>(0.5, 0);
complex<double> ans4 = (v2[i] - conj(v2[j])) * complex<double>(0, -0.5);
r1[i] = (ans1 * ans3) + (ans1 * ans4) * complex<double>(0, 1);
r2[i] = (ans2 * ans3) + (ans2 * ans4) * complex<double>(0, 1);
}
fft(r1, 1);
fft(r2, 1);
vector<long long> ret(n);
for (int i = 0; i < n; i++) {
long long av = (long long)round(r1[i].real());
long long bv =
(long long)round(r1[i].imag()) + (long long)round(r2[i].real());
long long cv = (long long)round(r2[i].imag());
av %= mod, bv %= mod, cv %= mod;
ret[i] = (av << 30) + (bv << 15) + cv;
ret[i] %= mod;
ret[i] += mod;
ret[i] %= mod;
}
return ret;
}
vector<long long> v[MAXN];
int n, m, k;
int ct[MAXN];
vector<long long> mult(int l, int r) {
if (l == r) return v[l];
int mid = (l + r) / 2;
vector<long long> b1 = mult(l, mid);
vector<long long> b2 = mult(mid + 1, r);
vector<long long> b = multiply(b1, b2, p);
while (b.size() > 0 && b.back() == 0) b.pop_back();
return b;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> m >> k;
for (int i = 0; i < n; ++i) {
int x;
cin >> x;
ct[x - 1]++;
}
for (int i = 0; i < m; ++i) {
v[i].resize(ct[i] + 1);
for (int j = 0; j <= ct[i]; ++j) v[i][j] = 1;
}
vector<long long> ans = mult(0, m - 1);
ans.resize(k + 2);
cout << ans[k] << endl;
}
| 2,600 | CPP |
def sol():
am = int(input())
arr = list(map(int,input().split()))
for i in range(am):
was = [False]*am
ind = i
while was[ind] == False:
was[ind] = True
ind = arr[ind] - 1
print(ind+1,end=" ")
sol() | 1,000 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 500010, A = 1000010;
int a[N], p[N], n, x, y, pnum;
bool b[A];
long long sum[N], ans = 9e18;
int erfen(int ll, int rr, int x) {
int res = 0;
for (int l = ll, r = rr, mid = (l + r) >> 1; l <= r; mid = (l + r) >> 1)
if (a[mid] <= x)
res = mid, l = mid + 1;
else
r = mid - 1;
return res;
}
void shai() {
for (int i = 2; i <= 1000000; ++i) {
if (!b[i]) p[pnum++] = i;
for (int j = 0; j < pnum && 1ll * i * p[j] <= 1000000; ++j) {
b[i * p[j]] = 1;
if (i % p[j] == 0) break;
}
}
}
int main() {
scanf("%d%d%d", &n, &x, &y);
for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
sort(a + 1, a + n + 1);
for (int i = 1; i <= n; i++) sum[i] = sum[i - 1] + a[i];
shai();
int op = 0;
for (int i = 0; i < pnum; i++) {
long long ret = 0;
if (p[i] < op) {
} else {
int t = x / y, la = 1;
for (int j = p[i]; la <= n; j += p[i]) {
int pos1 = erfen(la, n, j), pos2 = erfen(la, pos1, j - t - 1);
if (!pos1) pos1 = la - 1;
if (!pos2) pos2 = la - 1;
ret += 1ll * (pos2 - la + 1) * x;
ret += 1ll * (1ll * (pos1 - pos2) * j - sum[pos1] + sum[pos2]) * y;
la = pos1 + 1;
}
}
ans = min(ans, ret);
}
printf("%lld\n", ans);
}
| 2,100 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <class T>
bool umin(T& a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T>
bool umax(T& a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
set<int> on, adj[300009];
void dfs(int nd) {
vector<int> vec;
for (typeof((on).begin()) it = (on).begin(); it != (on).end(); it++) {
int u = *it, v = nd;
if (u > v) swap(u, v);
if (adj[u].find(v) == adj[u].end()) vec.push_back(*it);
}
for (typeof((vec).begin()) it = (vec).begin(); it != (vec).end(); it++)
on.erase(*it);
for (typeof((vec).begin()) it = (vec).begin(); it != (vec).end(); it++)
dfs(*it);
}
int main() {
int n, m, k, can = 0, comp = 0;
scanf("%d%d%d", &n, &m, &k);
for (int i = 1; i <= m; i++) {
int u, v;
scanf("%d%d", &u, &v);
if (u > v) swap(u, v);
adj[u].insert(v);
if (u == 1) can--;
}
if (can + (n - 1) < k) {
printf("impossible\n");
return 0;
}
for (int i = 2; i <= n; i++) on.insert(i);
for (int i = 2; i <= n; i++)
if (on.find(i) != on.end() and adj[1].find(i) == adj[1].end()) {
comp++;
dfs(i);
}
if (on.size() > 0 or comp > k) {
printf("impossible\n");
return 0;
}
printf("possible\n");
return 0;
}
| 2,400 | CPP |
#include <bits/stdc++.h>
using namespace std;
int arr[5001][5001];
int main() {
int n, m;
cin >> n >> m;
char mat[n][m];
for (int i = 0; i < n; i++) scanf("%s", mat[i]);
for (int i = 0; i < n; i++)
for (int j = m - 1; j >= 0; j--) {
if (j != m - 1) arr[i][j] = arr[i][j + 1];
arr[i][j] = (arr[i][j] + 1) * (mat[i][j] == '1');
}
int a[n], ans = 0;
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) a[j] = arr[j][i];
sort(a, a + n);
for (int j = 0; j < n; j++) ans = max(ans, a[j] * (n - j));
}
cout << ans << endl;
return 0;
}
| 1,600 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 510;
int n, m;
string s;
int c[maxn][maxn], f[maxn][maxn], d[maxn][maxn];
int b[maxn], dist[maxn], trace[maxn], cnt[26];
int getsign(int x) {
if (x >= 0)
return 1;
else
return -1;
}
bool findpath() {
for (int i = 1; i <= m; i++) dist[i] = 1e9;
dist[1] = 0;
while (1) {
bool stop = true;
for (int i = 1; i <= m; i++)
for (int j = 1; j <= m; j++)
if (f[i][j] < c[i][j] &&
dist[j] > dist[i] + d[i][j] * getsign(f[i][j])) {
dist[j] = dist[i] + d[i][j] * getsign(f[i][j]);
trace[j] = i;
stop = false;
}
if (stop) break;
}
return dist[2] != (int)1e9;
}
void incflow() {
int delta = 1e9;
int v = 2;
while (v != 1) {
int u = trace[v];
delta = min(delta, c[u][v] - f[u][v]);
v = u;
}
v = 2;
while (v != 1) {
int u = trace[v];
f[u][v] += delta;
f[v][u] -= delta;
v = u;
}
}
int main() {
cin >> n;
cin >> s;
s = ' ' + s;
for (int i = 1; i <= n; i++) cin >> b[i];
m = 2;
for (int i = 1; i <= n; i++) cnt[s[i] - 'a']++;
for (int i = 0; i < 26; i++) {
m++;
c[1][m] = cnt[i];
}
for (int i = 1; i <= n; i++) {
m++;
c[m][2] = 1;
}
for (int i = 1; i <= n / 2; i++) {
m++;
int k = m;
c[m][28 + i] = 1;
c[m][28 + n - i + 1] = 1;
for (int j = 0; j < 26; j++)
if (j != s[i] - 'a' && j != s[n - i + 1] - 'a') {
c[j + 3][m] = 1;
} else {
k++;
c[k][28 + i] = 1;
c[k][28 + n - i + 1] = 1;
if (j == s[i] - 'a') {
d[k][28 + i] = -b[i];
d[28 + i][k] = -b[i];
}
if (j == s[n - i + 1] - 'a') {
d[k][28 + n - i + 1] = -b[n - i + 1];
d[28 + n - i + 1][k] = -b[n - i + 1];
}
c[j + 3][k] = 1;
}
m = k;
}
int ans = 0;
while (findpath()) incflow();
for (int i = 1; i <= m; i++)
for (int j = 1; j <= m; j++)
if (f[i][j] > 0) ans -= f[i][j] * d[i][j];
cout << ans;
return 0;
}
| 2,500 | CPP |
import sys
n,k = map(int,input().split())
if n == k:
print('YES')
else:
x = n//k
print('YES') if x%2 != 0 else print('NO')
| 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
long long int n, i;
cin >> n;
string s, a, b;
cin >> s;
for (i = 0; i < n; i++) {
if (s[i] == '2') {
a += '0' + 1;
b += '0' + 1;
} else if (s[i] == '1') {
a += '0' + 1;
b += '0';
break;
} else {
a += '0';
b += '0';
}
}
if (i != n - 1) {
for (i = i + 1; i < n; i++) {
a += '0';
b += s[i];
}
}
cout << a << "\n" << b << endl;
}
return 0;
}
| 1,200 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, f, sum = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> f;
sum = sum + f;
}
int pos = 0;
n++;
for (int i = 1; i <= 5; i++) {
if ((sum + i) % n != 1) pos++;
}
cout << pos;
return 0;
}
| 1,000 | CPP |
for _ in range(int(input())):
a,b,c,n = tuple(map(int, input().split()))
total_coins = a+b+c+n
if total_coins%3 != 0:
print('NO')
else:
each = total_coins//3
if each-a>=0 and each-b>=0 and each-c>=0:
print('YES')
else:
print('NO') | 800 | PYTHON3 |
n, k = map(int, input().split())
num = k - n + 1
for i in range(n):
for t in range(i):
print(1, end = ' ')
print(num, end = ' ')
for j in range(n - i - 1):
print(1, end = ' ')
print('')
| 800 | PYTHON3 |
m, n = map(int, input().split())
esp = 0
for i in range (1, m+1):
esp += i * ((i/m)**n - ((i-1)/m)**n);
print (esp)
| 1,600 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, k, p[10];
long double ans, f;
inline void Check() {
int t = 0;
for (int i = 1; i <= n; i++)
for (int j = 1; j < i; j++)
if (p[i] < p[j]) t++;
ans += t / f;
}
inline void Dfs(int dep) {
if (!dep) {
Check();
return;
}
for (int i = 1; i <= n; i++)
for (int j = i; j <= n; j++) {
for (int r = j, l = i; l < r; l++, r--) swap(p[l], p[r]);
Dfs(dep - 1);
for (int r = j, l = i; l < r; l++, r--) swap(p[l], p[r]);
}
}
int main() {
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++) scanf("%d", p + i);
f = 1.0;
for (int i = 1; i <= k; i++) f *= (long double)(n * (n - 1) / 2 + n);
Dfs(k);
printf("%.14lf\n", (double)ans);
}
| 1,800 | CPP |
t = int(input())
for _ in range(t):
n = int(input())
mylist = list(map(int,input().split()))
i = 0
mini = mylist[0]
my_sum = 0
while i<n:
mini = mylist[i]
if mylist[i] < 0:
while i<n and mylist[i]<0:
if mylist[i]>mini:
mini = mylist[i]
i+=1
else:
while i<n and mylist[i]>0:
if mylist[i]>mini:
mini = mylist[i]
i+=1
#print(mini)
my_sum+=mini
print(my_sum)
| 1,200 | PYTHON3 |
import sys
input = lambda: sys.stdin.readline().rstrip()
inp = sys.stdin.buffer.readline
def I(): return list(map(int,inp().split()))
from math import sqrt
for _ in range(int(input())):
n=int(input())
a=[[0]*(n+2)]
for i in range(1,n+1):
a.append([0])
a[i].extend([int(i) for i in input()])
a[i].append(1)
a.append([1]*(n+2))
flag=0
for i in range(1,n+1):
for j in range(1,n+1):
if a[i][j]==1:
if not a[i+1][j]|a[i][j+1]:
flag=1
print(['YES','NO'][flag])
| 1,300 | PYTHON3 |
add = 0
player = input()
a = player.split('1')
b = player.split('0')
for x in a:
if len(x) >= 7:
print("YES")
add = 1
break
else:
for y in b:
if len(y) >= 7:
print("YES")
add = 1
break
if add == 0:
print("NO")
| 900 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, k;
int main() {
long long d = 0;
scanf("%d%d", &n, &k);
int j = 1;
for (int i = 1; i <= n; i++) {
long long a;
scanf("%I64d", &a);
if ((long long)d - (i - 1) * (n - i) * a < k) {
printf("%d\n", j);
i--;
n--;
} else
d += (long long)a * (i - 1);
j++;
}
return 0;
}
| 1,600 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long mod = 1e9 + 7;
long long qpow(long long x, long long k) {
long long ans = 1;
while (k) {
if (k & 1) ans = (ans * x) % mod;
k >>= 1;
x = (x * x) % mod;
}
return ans;
}
struct node {
long long val;
long long l;
};
node p[10];
struct opt {
string str;
};
opt t[100005];
int main() {
string st;
cin >> st;
int n;
cin >> n;
for (int i = 0; i < n; i++) cin >> t[i].str;
for (int i = 0; i < 10; i++) {
p[i].val = i;
p[i].l = 1;
}
for (int i = n - 1; i >= 0; i--) {
int f = t[i].str[0] - '0';
long nv = 0;
long long nl = 0;
for (int j = 3; j < t[i].str.length(); j++) {
int x = t[i].str[j] - '0';
nl += p[x].l;
nv = (nv * qpow(10, p[x].l) % mod + p[x].val) % mod;
}
p[f].val = nv;
p[f].l = nl % (mod - 1);
}
long long ans = 0;
for (int i = 0; i < st.length(); i++) {
int ch = st[i] - '0';
ans = (ans * qpow(10, p[ch].l) % mod + p[ch].val) % mod;
}
printf("%I64d\n", ans);
return 0;
}
| 2,100 | CPP |
#include <bits/stdc++.h>
using namespace std;
int N, M, Q;
string S[505], T;
int mo = 5;
int mat[500][800];
int rev(int a) {
int revt[] = {0, 1, 3, 2, 4};
return revt[a];
}
void solve() {
int i, j, k, l, r, x, y;
string s;
cin >> N >> M;
for (y = 0; y < (N); y++) {
cin >> S[y];
for (x = 0; x < (M); x++) mat[x][y] = S[y][x] - 'a';
}
cin >> Q;
for (i = 0; i < (Q); i++) {
cin >> T;
for (x = 0; x < (M); x++) mat[x][N + i] = T[x] - 'a';
}
signed long long pat = 1;
int step = 0, ret = 0;
for (step = 0; step < (N); step++) {
for (y = ret; y < M; y++)
if (mat[y][step]) break;
if (y == M) {
pat = pat * 5 % 1000000007;
continue;
}
for (x = step; x < N + Q; x++) swap(mat[ret][x], mat[y][x]);
int re = rev(mat[ret][step]);
for (x = step; x < N + Q; x++) mat[ret][x] = mat[ret][x] * re % mo;
for (y = 0; y < (M); y++)
if (y != ret && mat[y][step]) {
re = mat[y][step];
for (x = step; x < N + Q; x++)
mat[y][x] = ((mat[y][x] - re * mat[ret][x]) % mo + mo) % mo;
}
ret++;
}
for (i = 0; i < (Q); i++) {
for (x = ret; x < M; x++)
if (mat[x][N + i]) break;
if (x == M)
cout << pat << endl;
else
cout << 0 << endl;
}
}
int main(int argc, char** argv) {
string s;
int i;
if (argc == 1) ios::sync_with_stdio(false), cin.tie(0);
for (i = 0; i < (argc - 1); i++) s += argv[i + 1], s += '\n';
for (i = 0; i < (s.size()); i++) ungetc(s[s.size() - 1 - i], stdin);
solve();
return 0;
}
| 2,600 | CPP |
Subsets and Splits