solution
stringlengths 10
159k
| difficulty
int64 0
3.5k
| language
stringclasses 2
values |
|---|---|---|
t=int(input())
for i in range(t):
n,k=map(int,input().split())
if n%2==0 and k%2==0:
if k*k<=n:
print("YES")
else:
print("NO")
elif n%2==1 and k%2==1:
if k*k <=n:
print("YES")
else:
print("NO")
else:
print("NO") | 1,100 | PYTHON3 |
'''
for i in range(int(input())):
n, k = map(int, input().split())
a = list(input())
ans = ['1'] * n
t = 0
for j in range(n):
if (a[j] == '0'):
s = min(k, j - t)
k -= s
ans[j - s] = '0'
t += 1
print("".join(ans))
'''
'''
import collections
def solve():
# ? Yes as long as there is a slope > 1
# n = map(int, input().split())
n = int(input())
s = list(map(int, input().split()))
for i in range(len(s)-1):
if abs(s[i] - s[i+1]) > 1:
print('Yes')
print(i+1, i+2)
return
print('No')
for _ in range(int(input())):
solve()
'''
import collections
# n, k = map(int, input().split())
n = int(input())
s = str(input())
L = 0
R = 0
for c in s:
if c == 'L':
L += 1
else:
R += 1
print(1+L+R) | 800 | PYTHON3 |
def solve():
n, m = map(int, input().split())
while True:
if n == 0 or m == 0:
print(n, m)
return
elif n >= 2*m:
n = n % (2*m)
continue
elif m >= 2*n:
m = m % (2*n)
continue
else:
print(n,m)
return
if __name__ == "__main__":
solve()
| 1,100 | PYTHON3 |
a=[int(i) for i in input().strip().split('+')]
a.sort()
print('+'.join(map(str,a)))
| 800 | PYTHON3 |
n,l = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
a.sort()
b = []
if(n>1):
for i in range (n-1):
b.append((a[i+1]-a[i])/2)
b.sort(reverse = True)
hsl = max(a[0], (l-a[n-1]), b[0])
print (hsl)
else:
print (max(a[0], l-a[0])) | 1,200 | PYTHON3 |
n, k = map(int,input().split())
w = list(map(int,input().split()))
w = [i for i in w if k%i == 0]
print(k//max(w))
| 900 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, temp, data[200], hasil = 0;
memset(data, 0, sizeof(data));
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &temp);
data[temp]++;
}
for (int i = 1; i <= 100; i++) {
if (data[i] >= 2) hasil += data[i] / 2;
}
printf("%d\n", hasil / 2);
}
| 1,000 | CPP |
n=input()
n=int(n)
l = [int(x) for x in input().split()]
d = {}
for i in l:
if i==0:
continue
if i in d:
x=d[i]
d[i]=x+1
else:
d[i]=1
print(len(d))
| 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, a[10000] = {0};
cin >> n;
a[1] = 1;
a[2] = 1;
a[3] = 1;
long long int x = 3, y = 2;
while (x < n && y < n) {
a[x + y] = 1;
long long int t = x;
x += y;
y = t;
}
for (long long int i = 1; i <= n; i++) {
if (a[i] == 0)
cout << "o";
else
cout << "O";
}
}
| 800 | CPP |
#include <bits/stdc++.h>
using namespace std;
inline int read() {
int ans = 0;
char ch = getchar();
while (!isdigit(ch)) {
ch = getchar();
}
while (isdigit(ch)) {
ans = (ans << 3) + (ans << 1) + (ch ^ 48), ch = getchar();
}
return ans;
}
int first[100005], n, cnt, dep[100005];
double ans = 0;
struct edge {
int v, next;
} e[100005 << 1];
inline void add(int u, int v) {
e[++cnt].v = v, e[cnt].next = first[u], first[u] = cnt;
}
inline void dfs(int p, int fa) {
for (int i = first[p]; i; i = e[i].next) {
int v = e[i].v;
if (v == fa) continue;
dep[v] = dep[p] + 1, dfs(v, p);
}
}
int main() {
n = read();
for (int i = 1; i < n; ++i) {
int u = read(), v = read();
add(u, v), add(v, u);
}
dep[1] = 1, dfs(1, 1);
for (int i = 1; i <= n; ++i) ans += 1.0 / (1.0 * dep[i]);
printf("%.20lf", ans);
return 0;
}
| 2,200 | CPP |
for _ in range(int(input())):
n=int(input())
a=list(map(int,input().split()))
a.sort()
m=1000000000
for i in range(n-1):
m=min(a[i+1]-a[i],m)
print(m) | 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long n, h;
bool ok(long long x) {
long long ans = 0;
if (x >= 2e9) return 1;
if (x <= h)
ans = x * (x + 1) / 2;
else {
ans = h * (h + 1) / 2 + (x - h) * h;
long long high = x - h - 1;
long long t1 = high / 2, t2 = high - t1;
ans += t1 * (t1 + 1) / 2 + t2 * (t2 + 1) / 2;
}
if (ans >= n)
return 1;
else
return 0;
}
int main() {
cin >> n >> h;
long long l = 1, r = 1e18 + 1;
long long mid = (l + r) / 2;
while (l < r) {
mid = (l + r) / 2;
if (ok(mid))
r = mid;
else
l = mid + 1;
}
printf("%lld\n", l);
return 0;
}
| 2,100 | CPP |
n=int(input())
for i in range(n):
a,b=map(int,input().split())
if(not a%b):
print("YES")
else:
print("NO") | 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
bool isMult = false;
void solve() {
string s, t, a, b;
cin >> s;
s += ',';
bool isNum = true;
for (char i : s) {
if (i == ',' || i == ';') {
if (isNum && t.size() && (t.size() == 1 || t[0] != '0')) {
a += t + ",";
} else {
b += t + ",";
}
isNum = true;
t.clear();
} else {
if (i < '0' || i > '9') {
isNum = false;
}
t += i;
}
}
if (a.size()) {
cout << "\"" << a.substr(0, a.size() - 1) << "\"" << '\n';
} else {
cout << '-' << '\n';
}
if (b.size()) {
cout << "\"" << b.substr(0, b.size() - 1) << "\"" << '\n';
} else {
cout << '-' << '\n';
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int tt = 1;
if (isMult) {
cin >> tt;
}
while (tt--) {
solve();
}
return 0;
}
| 1,600 | CPP |
from math import ceil
n = int(input())
print((1, -1)[n % 2] * ceil(n / 2)) | 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int a, b, c, d, e;
string s;
int main() {
cin >> s;
int n = s.size();
for (int i = 0; i < n; i++) {
if (s[i] == 'h') {
a = 1;
}
if (a && s[i] == 'e') {
b = 1;
}
if (b && s[i] == 'i') {
c = 1;
}
if (c && s[i] == 'd') {
d = 1;
}
if (d && s[i] == 'i') {
e = 1;
}
}
if (e)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
| 800 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
string s, t;
cin >> n >> k >> s >> t;
vector<vector<vector<int>>> dp(
n + 1, vector<vector<int>>(k + 2, vector<int>(n + 2, -1000000000)));
dp[0][0][0] = 0;
for (int i = 0; i < n; i++) {
int e0 = s[i] == t[0], e1 = s[i] == t[1], e01 = t[0] == t[1];
for (int j = 0; j <= k; j++) {
for (int h = 0; h <= n; h++) {
if (dp[i][j][h] == -1000000000) continue;
dp[i + 1][j][h + e0] =
max(dp[i + 1][j][h + e0], dp[i][j][h] + (e1 ? h : 0));
if (j < k) {
dp[i + 1][j + 1][h + 1] =
max(dp[i + 1][j + 1][h + 1], dp[i][j][h] + (e01 ? h : 0));
dp[i + 1][j + 1][h + e01] =
max(dp[i + 1][j + 1][h + e01], dp[i][j][h] + h);
}
}
}
}
int ans = 0;
for (int i = 0; i <= k; i++) {
for (int j = 0; j <= n; j++) {
ans = max(ans, dp[n][i][j]);
}
}
cout << ans;
}
| 2,100 | CPP |
x = 0
for i in range(int(input())):
input_two = input().lower()
if input_two == "++x" or input_two == "x++":
x += 1
else:
x -= 1
print(x)
| 800 | PYTHON3 |
n, k = map(int, input().split())
a = []
cnt = 0
a = list(map(int, input().split()))
if len(a) == n:
# while True:
for i in range(n):
if a[0] <= k:
a.pop(0)
cnt = cnt+ 1
elif a[len(a)-1] <= k:
a.pop(len(a)-1)
cnt = cnt + 1
else:
break
print(cnt)
| 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, w, a[110], ans[110];
pair<int, int> ind[110];
int main() {
cin >> n >> w;
for (int i = 0; i < n; i++) {
cin >> a[i];
ind[i].first = a[i];
ind[i].second = i;
}
sort(ind, ind + n);
reverse(ind, ind + n);
for (int i = 0; i < n; i++) {
ans[i] = (a[i] + 1) / 2;
w -= ans[i];
if (w < 0) {
cout << -1;
return 0;
}
}
for (int i = 0; i < n; i++) {
int cur = ind[i].second;
int add = min(a[cur] - ans[cur], w);
ans[cur] += add;
w -= add;
}
for (int i = 0; i < n; i++) cout << ans[i] << ' ';
return 0;
}
| 1,400 | CPP |
n,x=map(int,input().split())
d=0
for i in range(n):
am,c=input().split()
if(am=='+'):
x+=int(c)
else:
if(x>=int(c)):
x-=int(c)
else:
d+=1
print(x,end=" ")
print(d) | 800 | PYTHON3 |
for i in range(int(input())):
n=input()
if len(n)<=10:
print(n)
else:
print("%s%d%s"%(n[:1],(len(n)-2),n[-1])) | 800 | PYTHON3 |
n = int(input())
m = int(input())
dfr=abs(n-m)+1
s=dfr//2
print((s+dfr%2)*s) | 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int MAXSIZE = 10000020;
int bufpos;
char buf[MAXSIZE];
void init() {
buf[fread(buf, 1, MAXSIZE, stdin)] = ' ';
bufpos = 0;
}
int readint() {
int val = 0;
for (; !isdigit(buf[bufpos]); bufpos++)
;
for (; isdigit(buf[bufpos]); bufpos++) val = val * 10 + buf[bufpos] - '0';
return val;
}
char readchar() {
for (; isspace(buf[bufpos]); bufpos++)
;
return buf[bufpos++];
}
int readstr(char* s) {
int cur = 0;
for (; isspace(buf[bufpos]); bufpos++)
;
for (; !isspace(buf[bufpos]); bufpos++) s[cur++] = buf[bufpos];
s[cur] = '\0';
return cur;
}
char s[250002], t[250002];
bool a[6][6];
int fa[6], sz[6];
bool app[6];
int getf(int x) { return fa[x] == x ? x : fa[x] = getf(fa[x]); }
int main() {
init();
int n = readstr(s + 1), m = readstr(t + 1);
for (int i = 1; i <= n; i++) {
if (i + m - 1 > n) break;
memset(a, 0, sizeof(a));
for (int j = 1; j <= m; j++) a[s[i + j - 1] - 'a'][t[j] - 'a'] = 1;
for (int j = 0; j < 6; j++) fa[j] = j;
memset(app, 0, sizeof(app));
for (int j = 0; j < 6; j++)
for (int k = 0; k < 6; k++)
if (a[j][k] && j != k) {
app[j] = app[k] = 1;
fa[getf(j)] = getf(k);
}
memset(sz, 0, sizeof(sz));
for (int j = 0; j < 6; j++)
if (app[j]) sz[getf(j)]++;
int ans = 0;
for (int j = 0; j < 6; j++)
if (sz[j]) ans += sz[j] - 1;
printf("%d ", ans);
}
}
| 2,200 | CPP |
n, k = map(int, input().split())
l = list(map(int, input().split()))
if max(l) - min(l) > k:
print('NO')
quit()
print('YES')
res = ['1']*(min(l) + 1)
for i in range(2, k + 1):
res.append(str(i))
for a in l:
print(' '.join(res[:a])) | 1,300 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
const int inf = 1e9 + 1;
const int prime_100000000 = 5761460;
const double eps = 1e-15;
const double EPS = 1e-9;
const double PI = acos(-1.0);
int lucky_number[9] = {4, 7, 44, 47, 74, 77, 444, 447, 477};
int main() {
ios_base ::sync_with_stdio(false);
cin.tie(NULL);
long long n, k, a;
cin >> n >> k;
long long v[1000];
for (long long i = 0; i < n; i++) {
cin >> v[i];
}
long long cost = 0;
for (long long i = 0; i < n - 1; i++) {
if ((v[i] + v[i + 1]) < k) {
cost += (k - v[i] - v[i + 1]);
v[i + 1] = (k - v[i]);
}
}
cout << cost << endl;
for (long long i = 0; i < n; i++) {
cout << v[i] << " ";
}
return 0;
}
| 1,000 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int T;
cin >> T;
while (T--) {
int n;
cin >> n;
vector<int> v(n + 1);
for (int i = 1; i <= n; i++) cin >> v[i];
reverse(v.begin() + 1, v.end());
int now = v[1];
int ans = 0;
for (int i = 1; i <= n; i++) {
if (v[i] <= now) {
continue;
} else {
ans++;
now = v[i];
}
}
cout << ans << '\n';
}
return 0;
}
| 900 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, t;
string s;
cin >> n >> k >> s;
for (int i = 0; i < n; i++) {
if (s.substr(0, i) == s.substr(n - i, i)) t = i;
}
for (int i = 1; i < k; i++) {
cout << s.substr(0, n - t);
}
cout << s << endl;
return 0;
}
| 1,300 | CPP |
import sys
import math
import functools
input = sys.stdin.readline
n, m = map(int, input().strip().split())
a = []
for _ in range(m):
z = list(map(int, input().strip().split()))
a.append(z[::-1])
def compare(A):
return A[0]
a.sort(key = compare, reverse=True)
ans = 0
for el in a:
ans += min(n, el[1]) * el[0]
n -= min(n, el[1])
print(ans)
| 900 | PYTHON3 |
import functools
import logging
import os
import sys
import time
logger = logging.getLogger()
reader = sys.stdin
# Need to define DEBUGGING variable when run locally
is_judge = os.getenv("DEBUGGING") is None
def timeit(func):
@functools.wraps(func)
def timed(*args, **kwargs):
if is_judge:
rv = func(*args, **kwargs)
else:
ts = time.time()
rv = func(*args, **kwargs)
te = time.time()
logger.debug("performance %r %2.2fms", func.__name__, (te - ts) * 1000)
return rv
return timed
# ----------------------
# - /SOLUTION -
# ----------------------
def tanya_sub(n, k):
while k > 0:
rm = n % 10
if rm == 0:
k -= 1
n //= 10
else:
s = min(k, rm)
k -= s
n -= s
return n
@timeit
def main():
n = int(reader.readline()) # Ignore N
coins = [int(v) for v in reader.readline().strip().split(" ")]
coins.sort(reverse=True)
total = sum(coins)
i = 0
s = 0
while i < n and s <= total//2:
s += coins[i]
i += 1
print(i)
# while line := reader.readline():
# n, k = line.strip().split(" ")
# print(tanya_sub(int(n), int(k)))
# ----------------------
# - \SOLUTION -
# ----------------------
def setup():
global logger, reader
if is_judge:
logger.setLevel(logging.WARNING)
else:
# Format logger
handler = logging.StreamHandler(sys.stdout)
handler.setLevel(logging.DEBUG)
formatter = logging.Formatter("{asctime}s - {message}", style='{')
handler.setFormatter(formatter)
logger.addHandler(handler)
logger.setLevel(logging.DEBUG)
# Stdin from file
reader = open("input.txt")
if __name__ == '__main__':
setup()
try:
main()
except KeyboardInterrupt:
logger.debug("KeyboardInterrupt")
except IOError as e:
logger.error(f"I/O error({e.errno}): {e.strerror}")
| 900 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, f[100010];
namespace LCA {
const int LOG = 20;
int dep[100010], fa[100010][20];
int g[100010][20];
void Build() {
for (int j = 1; j < LOG; ++j)
for (int i = 1; i <= n; ++i) {
fa[i][j] = fa[fa[i][j - 1]][j - 1];
g[i][j] = g[i][j - 1] | g[fa[i][j - 1]][j - 1];
}
}
bool LCA(int x, int y, int k) {
int res1 = 0, res2 = 0, flag = 0;
if (dep[x] < dep[y]) swap(x, y), flag = 1;
for (int i = 19; ~i; --i)
if (dep[x] - (1 << i) >= dep[y]) res1 |= g[x][i], x = fa[x][i];
if (x == y) {
if (flag)
return res2 == k;
else
return res1 == k;
} else if (k == 1)
return false;
for (int i = 19; ~i; --i)
if (fa[x][i] != fa[y][i]) {
res1 |= g[x][i], res2 |= g[y][i];
x = fa[x][i], y = fa[y][i];
}
res1 |= g[x][0];
res2 |= g[y][0];
if (flag)
return res2 == 2 && res1 == 1;
else
return res1 == 2 && res2 == 1;
}
}; // namespace LCA
int Find(int u) { return f[u] ? f[u] = Find(f[u]) : u; }
void Init() {
int i, fat, k, fu, fv;
scanf("%d", &n);
for (i = 1; i <= n; ++i) {
scanf("%d %d", &fat, &k);
if (fat == -1) continue;
LCA::fa[i][0] = fat;
LCA::g[i][0] = 1 << k;
LCA::dep[i] = LCA::dep[fat] + 1;
fu = Find(i);
fv = Find(fat);
if (fu == fv) continue;
f[fv] = fu;
}
LCA::Build();
}
void Work() {
int q, t, u, v;
for (scanf("%d", &q); q; --q) {
scanf("%d %d %d", &t, &u, &v);
if (u == v)
printf("NO\n");
else if (Find(u) != Find(v))
printf("NO\n");
else
printf("%s\n", LCA::LCA(v, u, t) ? "YES" : "NO");
}
}
int main() {
Init();
Work();
return 0;
}
| 2,500 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, x, y;
cin >> n >> x >> y;
int kx, ky;
if (x < n / 2) {
kx = n / 2 - x + 1;
} else {
kx = x - n / 2;
}
if (y < n / 2) {
ky = n / 2 - y + 1;
} else {
ky = y - n / 2;
}
int k = max(kx, ky);
if (k <= 1) {
cout << "NO" << endl;
} else {
cout << "YES" << endl;
}
return 0;
}
| 1,200 | CPP |
n,m,d=map(int,input().split())
x=[]
y=[]
for i in range(n):
a=list(map(int,input().split()))
y+=a
x.append(a)
y.sort()
e=y[(0+n*m-1)//2]
a=x[0][0]%d
count=0
ans=0
for i in x:
for j in range(len(i)):
if(i[j]%d!=a):
pass
else:
count+=1
ans+=(max(i[j],e)-min(i[j],e))//d
if(count==n*m):
print(ans)
else:
print(-1) | 1,400 | PYTHON3 |
n=int(input())
array=[int(i) for i in input().split()]
ans=0
for j in range(32):
num=2**j
diction=dict()
for i in array:
if i in diction:
ans+=diction[i]
if num-i>0:
if num-i in diction:
diction[num-i]+=1
else:
diction[num-i]=1
print(ans)
| 1,500 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
pair<int, pair<int, int> > a[100000];
pair<int, int> ans[100000];
int to[100001];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, m;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int w, p;
cin >> w >> p;
a[i] = make_pair(w, make_pair(!p, i));
}
sort(a, a + m);
for (int i = 0; i <= n; i++) to[i] = i;
int use = 1;
int from = 2;
for (int i = 0; i < m; i++) {
if (a[i].second.first == 0) {
ans[a[i].second.second] = make_pair(1, use + 1);
use++;
} else {
if (to[from] + 1 > use) {
from++;
if (to[from] + 1 > use) {
from = 2;
if (to[from] + 1 > use) {
cout << -1;
return 0;
} else {
to[from]++;
}
} else {
to[from]++;
}
} else {
to[from]++;
}
ans[a[i].second.second] = make_pair(from, to[from]);
}
}
for (int i = 0; i < m; i++)
cout << ans[i].first << " " << ans[i].second << "\n";
return 0;
}
| 1,700 | CPP |
a = [[], []]
input()
for ai in map(int, input().split()):
a[ai % 2].append(ai)
a, b = a
a.sort()
b.sort()
print(sum(a[:-len(b) - 1] + b[:-len(a) - 1]))
| 900 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
void trace(const char* name, T&& arg1) {
cout << name << " : " << arg1 << endl;
}
template <typename T, typename... Args>
void trace(const char* names, T&& arg1, Args&&... args) {
const char* comma = strchr(names + 1, ',');
cout.write(names, comma - names) << " : " << arg1 << " | ";
trace(comma + 1, args...);
}
bool codejam = 0;
const long long MOD = 1000 * 1000 * 1000 + 7;
const long long NMAX = 1000 * 1000 + 11;
long long arr[NMAX];
long long n, m, p, q, k, a, b, c, ans;
string s, t, str;
char ch;
vector<long long> v;
long long cnts[26], cntt[26];
void solve() {
cin >> n;
cin >> s >> t;
memset(cnts, 0, sizeof(cnts));
memset(cntt, 0, sizeof(cntt));
for (long long i = 0; i < n; i++) {
cnts[s[i] - 'a']++;
cntt[t[i] - 'a']++;
}
bool f = 0;
for (long long i = 0; i < 26; i++) {
if (cnts[i] == cntt[i]) {
} else {
cout << "NO";
return;
}
if (cnts[i] >= 2) {
f = 1;
}
}
if (f) {
cout << "YES";
return;
}
long long cnt1 = 0, cnt2 = 0;
for (long long i = 0; i < n; i++) {
for (long long j = i + 1; j < n; j++) {
if (s[i] > s[j]) cnt1++;
}
}
for (long long i = 0; i < n; i++) {
for (long long j = i + 1; j < n; j++) {
if (t[i] > t[j]) cnt2++;
}
}
if ((cnt1 % 2 == cnt2 % 2)) {
cout << "YES";
return;
}
cout << "NO";
return;
}
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long t = 1;
long long cs = 1;
cin >> t;
while (t--) {
if (codejam) {
cout << "Case #" << cs << ": ";
}
cs++;
solve();
cout << "\n";
}
}
| 2,000 | CPP |
t = int(input())
for i in range(t):
n = int(input())
list1 = list(map(int, input().strip().split()))[:n]
val = ((n * (n - 1)) / 2) - 1
i=0
count=0
while i<n-1:
if list1[i]>list1[i+1]:
count+=1
i+=1
if count<n-1:
print("YES")
else:
print("NO")
| 900 | PYTHON3 |
t = int(input())
for i in range(t):
a , b , c , r = map(int, input().split())
if a > b:
a , b = b , a
if (b == a) or (c >= b and c-r <= a) or (c <= a and c+r >= b) or (c >= a and c <= b and c+r >=b and c-r <= a):
print(0)
elif(c > b and c-r >= b) or (c < a and c+r <= a):
print(b-a)
elif c >= b:
print(c - a - r)
elif c <= a:
print(b - r - c)
elif c >= a and c <= b and c-r >= a and c+r <= b:
print(b - a - 2*r)
elif c >= a and c <= b and c-r < a and c+r <= b:
print(b - c - r)
elif c >= a and c <= b and c-r >= a and c+r > b:
print(c - a - r)
| 900 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int N;
vector<int> x, r;
void UpdateFw(vector<int> &fw, int x, int diff) {
int MAXX = fw.size() - 1;
for (int i = x; i <= MAXX; i += i & -i) {
fw[i] += diff;
if (i > (MAXX - (i & -i))) {
break;
}
}
}
int64_t SumFw(const vector<int> &fw, int x) {
int64_t res = 0;
for (int i = x; i > 0; i -= i & -i) {
res += fw[i];
}
return res;
}
int64_t QueryFw(const vector<int> &fw, int xmin, int xmax) {
if (xmax < xmin) {
return 0;
}
return SumFw(fw, xmax) - SumFw(fw, xmin - 1);
}
bool IsLess(const int i, const int j) {
int pi = i % N, pj = j % N;
int ti = i / N, tj = j / N;
int vi = x[pi], vj = x[pj];
if (ti == 0) {
vi -= r[pi];
} else if (ti == 2) {
vi += r[pi];
}
if (tj == 0) {
vj -= r[pj];
} else if (tj == 2) {
vj += r[pj];
}
if (vi != vj) {
return vi < vj;
} else {
return ti < tj;
}
}
void CalcRank(const vector<int> &a, vector<int> &id2rank,
vector<int> &rank2id) {
int n = a.size();
vector<pair<int, int> > b(n);
for (int i = 0; i < n; i++) {
b[i] = make_pair(a[i], i);
}
sort(b.begin(), b.end());
for (int i = 0; i < n; i++) {
id2rank[b[i].second] = i;
rank2id[i] = b[i].second;
}
return;
}
int CalcRankUniqe(const vector<int> &a, vector<int> &id2rank,
vector<int> &rank2id) {
int n = a.size();
vector<pair<int, int> > b(n);
for (int i = 0; i < n; i++) {
b[i] = make_pair(a[i], i);
}
sort(b.begin(), b.end());
int rank = 0;
for (int i = 0; i < n; i++) {
if (i > 0 && b[i].first != b[i - 1].first) {
rank++;
}
id2rank[b[i].second] = rank;
rank2id[rank] = b[i].second;
}
return rank + 1;
}
int main(int argc, char **argv) {
int K;
scanf("%d%d", &N, &K);
const int NMAX = 1e5l;
vector<int> q(N);
x.resize(N);
r.resize(N);
for (int i = 0; i < N; i++) {
scanf("%d%d%d", &x[i], &r[i], &q[i]);
}
vector<int> qid2rnk(N), qrnk2id(N);
int qrnksize = CalcRankUniqe(q, qid2rnk, qrnk2id);
vector<vector<int> > gqx(qrnksize, vector<int>(1, -1)),
gqxid(qrnksize, vector<int>(1, -1));
vector<int> xid2qxrnk(N);
for (int i = 0; i < N; i++) {
int qrank = qid2rnk[i];
gqx[qrank].push_back(x[i]);
gqxid[qrank].push_back(i);
}
vector<vector<int> > fw(qrnksize);
for (int qrank = 0; qrank < qrnksize; qrank++) {
int m = gqx[qrank].size();
vector<int> gqrnk2id(m), gqid2rnk(m);
CalcRank(gqx[qrank], gqid2rnk, gqrnk2id);
for (int j = 1; j < m; j++) {
xid2qxrnk[gqxid[qrank][j]] = gqid2rnk[j];
}
sort(gqx[qrank].begin() + 1, gqx[qrank].end());
fw[qrank] = vector<int>(m, 0);
}
gqxid.clear();
vector<int> id(3 * N);
for (int i = 0; i < N; i++) {
id[i] = i;
id[N + i] = N + i;
id[N + N + i] = N + N + i;
}
sort(id.begin(), id.end(), IsLess);
int64_t res = 0;
for (int i = 0; i < 3 * N; i++) {
int ti = id[i] / N;
int bi = id[i] % N;
int xi = x[bi], ri = r[bi], qi = q[bi];
int qpos = qid2rnk[bi];
int xpos = xid2qxrnk[bi];
if (ti == 0) {
UpdateFw(fw[qpos], xpos, 1);
} else if (ti == 1) {
int qkmin = max(0, qi - K), qkmax = min(qi + K, 1000000000);
int qjposmin = max(qpos - K, 0), qjposmax = min(qpos + K, qrnksize - 1);
for (int qjpos = qjposmin; qjpos <= qjposmax; qjpos++) {
if (gqx[qjpos].size() < 2) {
continue;
}
int qv = q[qrnk2id[qjpos]];
if (qv < qkmin) {
continue;
} else if (qv > qkmax) {
break;
}
int xmin = max(0, xi - ri);
int xmax = min(xi + ri, 1000000000);
int xminpos =
lower_bound(gqx[qjpos].begin() + 1, gqx[qjpos].end(), xmin) -
gqx[qjpos].begin();
int xmaxpos =
upper_bound(gqx[qjpos].begin() + 1, gqx[qjpos].end(), xmax) -
gqx[qjpos].begin() - 1;
res += QueryFw(fw[qjpos], xminpos, xmaxpos);
}
} else {
UpdateFw(fw[qpos], xpos, -1);
}
}
res -= N;
res >>= 1;
printf("%" PRId64 "\n", res);
return 0;
}
| 2,200 | CPP |
#include <bits/stdc++.h>
using namespace std;
int t;
char c[200007];
signed main(void) {
scanf("%d", &t);
while (t--) {
int n, k;
scanf("%d%d", &n, &k);
cin >> c + 1;
int last = 0x7fffffff, ans = 0, tmp = 0;
for (int i = 1; i <= n; i++) {
int num = i - last - 1;
if (c[i] == '1') {
tmp++;
if (num > 0) {
if (num > k) {
if (num - num / (k + 1) * (k + 1) >= k)
ans += num / (k + 1);
else if (num - (num / (k + 1) - 1) * (k + 1) >= k)
ans += num / (k + 1) - 1;
}
}
last = i;
}
}
if (tmp == 0)
ans = 1 + (n - 1) / (k + 1);
else {
if (c[n] == '0') {
ans += (n - last) / (k + 1);
}
if (c[1] == '0') {
int first;
for (int i = 1; i <= n; i++) {
if (c[i] == '1') {
first = i;
break;
}
}
ans += (first - 1) / (k + 1);
}
}
cout << ans << '\n';
}
}
| 1,300 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long mul(long long a, long long b) { return (a * b) % (100000007); }
long long add(long long a, long long b) { return (a + b) % (100000007); }
long long sub(long long a, long long b) {
return (a - b + (a - b) / (100000007) * (100000007) + (100000007)) %
(100000007);
}
long long n, d, x;
int i, a[(100000 + 10)], b[(100000 + 10)];
long long getNextX() {
x = (x * 37 + 10007) % 1000000007;
return x;
}
void initAB() {
for (i = 0; i < n; i = i + 1) {
a[i] = i + 1;
}
for (i = 0; i < n; i = i + 1) {
swap(a[i], a[getNextX() % (i + 1)]);
}
for (i = 0; i < n; i = i + 1) {
if (i < d)
b[i] = 1;
else
b[i] = 0;
}
for (i = 0; i < n; i = i + 1) {
swap(b[i], b[getNextX() % (i + 1)]);
}
}
int q[(100000 + 10)] = {0}, h[(100000 + 10)] = {0};
int main() {
cin >> n >> d >> x;
initAB();
for (int i = 0; i < n; i++)
if (b[i]) q[++q[0]] = i;
for (int i = 0; i < n; i++) h[a[i]] = i;
for (int i = 0; i < n; i++) {
int s = 400, ans = 0;
for (int j = 0; j < 400; j++) {
if (n - j <= 0) break;
int t = h[n - j];
if (t <= i && b[i - t]) {
ans = n - j;
break;
}
}
if (!ans) {
for (int j = 1; j <= q[0]; j++) {
int t = q[j];
if (t > i) break;
ans = max(ans, a[i - t] * b[t]);
}
}
printf("%d\n", ans);
}
return 0;
}
| 2,300 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> a;
int n;
int i;
bool ans;
cin >> n;
a.resize(n);
for (i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
ans = false;
for (i = 1; i < n; i++) {
if (a[i] > a[i - 1] && 2 * a[i - 1] > a[i]) {
ans = true;
break;
}
}
cout << (ans ? "YES" : "NO") << endl;
return 0;
}
| 1,400 | CPP |
t = int(input())
for i in range(t):
n = int(input())
lista = list(map(int,input().split()))
pos = {}
for j in range(n):
pos[lista[j]] = j
l = r = pos[1]
ans = "1"
for j in range(2,n+1):
l = min(l,pos[j])
r = max(r,pos[j])
if(r-l+1 == j):
ans += "1"
else:
ans += "0"
print(ans) | 1,300 | PYTHON3 |
n = int(input())
coins = [int(c) for c in input().split()]
coins.sort()
coins.reverse()
all_coins = sum(coins)
me = 0
for i, c in enumerate(coins):
me += c
if me > all_coins * 0.5:
print(i+1)
break | 900 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
int a[n];
int cnt1 = 0, cnt2 = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] == 1)
cnt1++;
else
cnt2++;
}
if (cnt2 >= 1) {
cnt2--;
cout << 2 << " ";
}
if (cnt1 >= 1) {
cnt1--;
cout << 1 << " ";
}
long long sum = 0;
for (int i = 0; i < cnt2; i++) {
cout << 2 << " ";
}
for (int i = 0; i < cnt1; i++) {
cout << 1 << " ";
}
}
| 1,200 | CPP |
import sys
input = lambda: sys.stdin.readline().rstrip()
N = int(input())
D = {}
ans = []
for i in range(N):
x, y, z = map(int, input().split())
if z in D:
if y in D[z]:
D[z][y].append((x, i))
else:
D[z][y] = [(x, i)]
else:
D[z] = {y: [(x, i)]}
E = {}
for z in D:
for y in D[z]:
D[z][y] = sorted(D[z][y])
while len(D[z][y]) >= 2:
a, b = D[z][y].pop(), D[z][y].pop()
ans.append((a[1], b[1]))
if len(D[z][y]):
if z in E:
E[z].append((y, D[z][y][0][1]))
else:
E[z] = [(y, D[z][y][0][1])]
F = []
for z in E:
E[z] = sorted(E[z])
while len(E[z]) >= 2:
a, b = E[z].pop(), E[z].pop()
ans.append((a[1], b[1]))
if len(E[z]):
F.append((z, E[z][0][1]))
F = sorted(F)
while len(F) >= 2:
a, b = F.pop(), F.pop()
ans.append((a[1], b[1]))
ans = [(a[0]+1, a[1]+1) for a in ans]
sans = [" ".join(map(str, a)) for a in ans]
print("\n".join(sans))
| 1,900 | PYTHON3 |
x=int(input())
while x>0:
a = input()
if len(a)<=10:
print(a)
else:
print(a[0]+str(len(a)-2)+a[-1])
x-=1 | 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, k;
cin >> n >> k;
map<int, int> p;
if (k > 100000) k = 100000;
for (int i = 1; i <= k; i++) {
int t = n % i;
if (!p.count(t)) {
p[t] = 1;
} else {
cout << "No";
return 0;
}
}
cout << "Yes";
return 0;
}
| 1,600 | CPP |
a = input()
l = len(a)
k=0
if l%2==1:
for i in range(l//2+1):
if a[i]!=a[l-1-i]:
k+=1
if k>1:
print("NO")
break
if k==0:
print("YES")
else:
for i in range(l//2):
if a[i]!=a[l-1-i]:
k+=1
if k>1:
print("NO")
break
if k==0:
print("NO")
if k==1:
print("YES") | 1,000 | PYTHON3 |
import os
import sys
from io import BytesIO, IOBase
import math
import itertools
import bisect
import heapq
def main():
pass
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 binary(n):
return (bin(n).replace("0b", ""))
def decimal(s):
return (int(s, 2))
def pow2(n):
p = 0
while (n > 1):
n //= 2
p += 1
return (p)
def primeFactors(n):
l = []
while n % 2 == 0:
l.append(2)
n = n / 2
for i in range(3, int(math.sqrt(n)) + 1, 2):
while n % i == 0:
l.append(i)
n = n / i
if n > 2:
l.append(int(n))
return (l)
def isPrime(n):
if (n == 1):
return (False)
else:
root = int(n ** 0.5)
root += 1
for i in range(2, root):
if (n % i == 0):
return (False)
return (True)
def maxPrimeFactors(n):
maxPrime = -1
while n % 2 == 0:
maxPrime = 2
n >>= 1
for i in range(3, int(math.sqrt(n)) + 1, 2):
while n % i == 0:
maxPrime = i
n = n / i
if n > 2:
maxPrime = n
return int(maxPrime)
def countcon(s, i):
c = 0
ch = s[i]
for i in range(i, len(s)):
if (s[i] == ch):
c += 1
else:
break
return (c)
def lis(arr):
n = len(arr)
lis = [1] * n
for i in range(1, n):
for j in range(0, i):
if arr[i] > arr[j] and lis[i] < lis[j] + 1:
lis[i] = lis[j] + 1
maximum = 0
for i in range(n):
maximum = max(maximum, lis[i])
return maximum
def isSubSequence(str1, str2):
m = len(str1)
n = len(str2)
j = 0
i = 0
while j < m and i < n:
if str1[j] == str2[i]:
j = j + 1
i = i + 1
return j == m
def maxfac(n):
root = int(n ** 0.5)
for i in range(2, root + 1):
if (n % i == 0):
return (n // i)
return (n)
def p2(n):
c=0
while(n%2==0):
n//=2
c+=1
return c
def seive(n):
primes=[True]*(n+1)
primes[1]=primes[0]=False
for i in range(2,n+1):
if(primes[i]):
for j in range(i+i,n+1,i):
primes[j]=False
p=[]
for i in range(0,n+1):
if(primes[i]):
p.append(i)
return(p)
def ncr(n, r, p):
num = den = 1
for i in range(r):
num = (num * (n - i)) % p
den = (den * (i + 1)) % p
return (num * pow(den,
p - 2, p)) % p
def denofactinverse(n,m):
fac=1
for i in range(1,n+1):
fac=(fac*i)%m
return (pow(fac,m-2,m))
def numofact(n,m):
fac = 1
for i in range(1, n + 1):
fac = (fac * i) % m
return(fac)
n=int(input())
root=int(n**0.5)
f=0
for i in range(1,root+1):
if(i*i==n):
f+=1
elif(n%i==0):
f+=2
print(f) | 1,200 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
struct Nod {
int mark, label;
} nod[200010];
int val[200010];
bool cmp1(Nod n1, Nod n2) {
if (n1.mark != n2.mark) return n1.mark > n2.mark;
return n1.label < n2.label;
}
bool cmp2(Nod n1, Nod n2) {
if (n1.mark != n2.mark) return n1.mark > n2.mark;
return n1.label > n2.label;
}
int main() {
int n, a, b;
scanf("%d", &n);
scanf("%d%d", &a, &b);
for (int i = 0; i < n; ++i) {
scanf("%d", &nod[i].mark);
nod[i].label = i;
}
if (a == b) {
for (int i = 1; i < n; ++i)
if (i <= n / 2)
printf("1 ");
else
printf("2 ");
printf("2\n");
return 0;
}
if (a < b) {
sort(nod, nod + n, cmp1);
for (int i = 0; i < n; ++i) {
if (i < a)
val[nod[i].label] = 1;
else
val[nod[i].label] = 2;
}
} else {
sort(nod, nod + n, cmp2);
for (int i = 0; i < n; ++i) {
if (i < b)
val[nod[i].label] = 2;
else
val[nod[i].label] = 1;
}
}
for (int i = 0; i < n - 1; ++i) printf("%d ", val[i]);
printf("%d\n", val[n - 1]);
return 0;
}
| 1,700 | CPP |
#include <bits/stdc++.h>
const int N = 100005;
int n, m, K, Q, l, r, f[N], a[N][8], cnt[8][N];
int find(int x) {
if (f[x] == x) return x;
f[x] = find(f[x]);
return f[x];
}
int main() {
scanf("%d%d%d", &n, &K, &m);
for (int i = 1; i <= m; i++) {
scanf("%d%d", &l, &r);
a[l][r - l] = 1;
}
for (int i = 1; i <= n; i++) f[i] = i;
for (int i = 1; i <= K; i++)
for (int j = 1; j + i <= n; j++)
if (a[j][i]) {
int l = j, r = j + i;
int fx = find(l), fy = find(r);
if (fx == fy) a[j][i] = 0;
f[fx] = fy;
}
for (int i = 1; i <= K; i++)
for (int j = 1; j + i <= n; j++) cnt[i][j] = cnt[i][j - 1] + a[j][i];
scanf("%d", &Q);
while (Q--) {
scanf("%d%d", &l, &r);
int sum = 0;
for (int i = 1; i <= K && i <= r - l; i++)
sum += cnt[i][r - i] - cnt[i][l - 1];
printf("%d\n", r - l + 1 - sum);
}
return 0;
}
| 2,900 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 7;
int fa[maxn];
int find(int x) {
if (x == fa[x])
return x;
else
return fa[x] = find(fa[x]);
}
void un(int a, int b) {
a = find(a);
b = find(b);
fa[a] = b;
}
int n, a, b;
map<int, int> ma;
int val[maxn];
int main() {
cin >> n >> a >> b;
for (int i = 1; i < maxn; i++) fa[i] = i;
for (int i = 1; i <= n; i++) {
scanf("%d", val + i);
ma[val[i]] = i;
}
for (int i = 1; i <= n; i++) {
if (val[i] <= a) {
if (ma[a - val[i]] != 0)
un(i, ma[a - val[i]]);
else
un(i, 2 + n);
} else
un(i, 2 + n);
if (val[i] <= b) {
if (ma[b - val[i]] != 0)
un(i, ma[b - val[i]]);
else
un(i, 1 + n);
} else
un(i, 1 + n);
}
if (find(1 + n) == find(n + 2))
puts("NO");
else {
puts("YES");
int faa = find(n + 1);
int fab = find(n + 2);
for (int i = 1; i <= n; i++) {
if (find(i) == faa) {
puts("0");
} else {
puts("1");
}
}
}
return 0;
}
| 2,000 | CPP |
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("unroll-loops")
using namespace std;
int t;
long double n;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> t;
while (t--) {
cin >> n;
long long num1 = ceil(n / 3.0);
long long num2 = floor(n / 3.0);
if (num1 + 2 * num2 == n) {
cout << num1 << " " << num2 << endl;
} else if (n - num1 + 2 * num2 == 0) {
cout << num1 << " " << num2 << endl;
} else {
cout << num2 << " " << num1 << endl;
}
}
}
| 800 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 100;
const long long INFLL = 1e18 + 100;
const int MAXN = 3e5 + 100;
int n, m, ans;
char a[55][55];
int dx[] = {1, 2, 3, 4};
string s;
bool tr = false, lo = false;
void rec(int cur, int x, int y) {
if (lo || tr) return;
if (a[x][y] == 'E') {
tr = 1;
return;
}
if (cur >= s.size() || x > n || x < 1 || y > m || y < 1 || a[x][y] == '#') {
lo = 1;
return;
}
if (dx[0] == (s[cur] - 48) + 1) {
rec(cur + 1, x + 1, y);
if (lo || tr) return;
} else if (dx[1] == (s[cur] - 48) + 1) {
rec(cur + 1, x, y + 1);
if (lo || tr) return;
} else if (dx[2] == (s[cur] - 48) + 1) {
rec(cur + 1, x, y - 1);
if (lo || tr) return;
} else {
rec(cur + 1, x - 1, y);
if (lo || tr) return;
}
if (lo || tr) return;
}
int main() {
ios_base::sync_with_stdio(0), cin.tie(NULL), cout.tie(NULL);
srand(time(NULL));
if (fopen("sorting"
".in",
"r")) {
freopen(
"sorting"
".in",
"r", stdin);
freopen(
"sorting"
".out",
"w", stdout);
}
cin >> n >> m;
int stx, sty;
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= m; ++j) {
cin >> a[i][j];
if (a[i][j] == 'S') {
stx = i;
sty = j;
}
}
}
cin >> s;
do {
tr = lo = false;
rec(0, stx, sty);
if (tr && !lo) ++ans;
} while (next_permutation(dx, dx + 4));
cout << ans;
return 0;
}
| 1,200 | CPP |
#include <bits/stdc++.h>
using namespace std;
int N, M;
double mat[64][64];
double R[8][64];
double S[8][64];
void solve() {
int i, j, k, l, r, x, y;
string s;
cin >> N;
M = 1 << N;
for (y = 0; y < (M); y++)
for (x = 0; x < (M); x++) cin >> mat[y][x], mat[y][x] /= 100.0;
for (y = 0; y < (M); y++) R[0][y] = 1;
for (i = 0; i < (N); i++) {
x = 1 << i;
for (y = 0; y < M; y += 2 * x) {
for (int l = y; l < y + x; l++)
for (int r = y + x; r < y + 2 * x; r++) {
R[i + 1][l] += R[i][l] * R[i][r] * mat[l][r];
R[i + 1][r] += R[i][l] * R[i][r] * mat[r][l];
}
for (int l = y; l < y + x; l++)
for (int r = y + x; r < y + 2 * x; r++) {
S[i + 1][l] =
max(S[i + 1][l], S[i][l] + S[i][r] + (1 << i) * R[i + 1][l]);
S[i + 1][r] =
max(S[i + 1][r], S[i][l] + S[i][r] + (1 << i) * R[i + 1][r]);
}
}
}
double ret = 0;
for (x = 0; x < (M); x++) ret = max(ret, S[N][x]);
(void)printf("%.12lf\n", ret);
}
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);
cout.tie(0);
solve();
return 0;
}
| 2,100 | CPP |
#include <bits/stdc++.h>
using namespace std;
int sol[200000 + 10];
int timelim = 0;
struct node {
int l;
int r;
int d;
} Node[200000 + 10];
bool ccc(int a, int b) { return a > b; }
bool cmp(struct node a, struct node b) { return a.l < b.l; }
int my_max(int a, int b) { return a > b ? a : b; }
bool check(int abil, int size) {
int nowtime;
int nowloca;
int nowxj = 0;
while (nowxj < size && Node[nowxj].d <= abil) nowxj++;
nowtime = nowloca = Node[nowxj].l - 1;
while (nowxj < size) {
int k = nowxj;
int rimo = Node[k].r;
while (k < size && (Node[k].l == Node[nowxj].l || Node[k].l <= rimo)) {
if (Node[k].d > abil) rimo = my_max(rimo, Node[k].r);
k++;
}
nowxj = k;
while (nowxj < size && Node[nowxj].d <= abil) nowxj++;
nowtime += 2 * (rimo - nowloca);
nowtime += (Node[nowxj].l - 1 - nowloca);
nowloca = Node[nowxj].l - 1;
}
if (nowtime <= timelim)
return true;
else
return false;
}
int main() {
int m, n, k, t;
scanf("%d %d %d %d", &m, &n, &k, &t);
for (int i = 0; i < m; i++) scanf("%d", &sol[i]);
sol[m++] = 1000010;
sort(sol, sol + m, ccc);
for (int i = 0; i < k; i++)
scanf("%d %d %d", &Node[i].l, &Node[i].r, &Node[i].d);
Node[k].r = Node[k].l = n + 2;
Node[k].d = 1000010;
sort(Node, Node + k, cmp);
int star, end;
star = 0;
end = m - 1;
while (star <= end) {
timelim = t;
int mid = (star + end) / 2;
if (check(sol[mid], k) == true)
star = mid + 1;
else
end = mid - 1;
}
printf("%d\n", end);
return 0;
}
| 1,900 | CPP |
import os
import sys
debug = True
if debug and os.path.exists("input.in"):
input = open("input.in", "r").readline
else:
debug = False
input = sys.stdin.readline
def inp():
return (int(input()))
def inlt():
return (list(map(int, input().split())))
def insr():
s = input()
return s[:len(s) - 1] # Remove line char from end
def invr():
return (map(int, input().split()))
test_count = 1
if debug:
test_count = int(input())
for t in range(test_count):
if debug:
print("Test Case #", t + 1)
# Start code here
b = inp()
g = inp()
n = inp()
ans = 0
for i in range(0, n + 1):
if i <= b and (n - i) <= g:
ans += 1
print(ans)
| 1,100 | PYTHON3 |
t = int(input())
for _ in range(t):
a = list(map(int, input().split()))
b = list(map(int, input().split()))
a = sorted(a)
b = sorted(b)
if (a[0] + b[0]) == a[1] and a[1] == b[1] :
print('YES')
else:
print('NO') | 900 | PYTHON3 |
import sys
from collections import deque
#from functools import *
#from fractions import Fraction as f
from copy import *
#from bisect import *
#from heapq import *
#from math import gcd,ceil,sqrt
from itertools import permutations as prm,product
def eprint(*args):
print(*args, file=sys.stderr)
zz=1
#sys.setrecursionlimit(10**6)
if zz:
input=sys.stdin.readline
else:
sys.stdin=open('input.txt', 'r')
sys.stdout=open('all.txt','w')
di=[[-1,0],[1,0],[0,1],[0,-1]]
def string(s):
return "".join(s)
def fori(n):
return [fi() for i in range(n)]
def inc(d,c,x=1):
d[c]=d[c]+x if c in d else x
def bo(i):
return ord(i)-ord('A')
def li():
return [int(xx) for xx in input().split()]
def fli():
return [float(x) for x in input().split()]
def comp(a,b):
if(a>b):
return 2
return 2 if a==b else 0
def gi():
return [xx for xx in input().split()]
def cil(n,m):
return n//m+int(n%m>0)
def fi():
return int(input())
def pro(a):
return reduce(lambda a,b:a*b,a)
def swap(a,i,j):
a[i],a[j]=a[j],a[i]
def si():
return list(input().rstrip())
def mi():
return map(int,input().split())
def gh():
sys.stdout.flush()
def isvalid(i,j,n,m):
return 0<=i<n and 0<=j<m
def bo(i):
return ord(i)-ord('a')
def graph(n,m):
for i in range(m):
x,y=mi()
a[x].append(y)
a[y].append(x)
t=fi()
while t>0:
t-=1
n=fi()
a=li()
ans=1
r=[0]*(n+5)
r[0]=1
for i in range(1,n):
if a[i]<a[i-1]:
if r[ans-1]==1:
ans+=1
r[ans]+=1
else:
r[ans-1]-=1
r[ans]+=1
else:
r[ans]+=1
#print(ans,r,a[i])
print(ans) | 1,600 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e17;
struct edge {
int u, v;
edge() {}
edge(int _u, int _v) : u(_u), v(_v) {}
};
struct node {
vector<edge> edges;
};
struct tree {
vector<node> nodes;
int root, n;
tree(int _n, int _r = 0) : n(_n), root(_r) { nodes.resize(n); }
void add_edge(int u, int v) {
edge e1(u, v);
edge e2(v, u);
nodes[u].edges.push_back(e1);
nodes[v].edges.push_back(e2);
}
vector<pair<int, int>> findDiametersAndCenters() {
vector<pair<int, int>> ans;
vector<bool> vis1(n, 0), vis2(n, 0);
vector<int> parent(n, 0);
for (int i = 0; i < n; i++) {
if (vis1[i]) {
continue;
}
int diameter, d1, d2;
findDiameter(i, vis1, vis2, parent, diameter, d1, d2);
int c = findCenter(d2, diameter, parent);
ans.push_back({diameter, c});
}
return move(ans);
}
pair<int, int> bfs(int u, vector<bool> &visited, vector<int> &parent) {
queue<pair<int, int>> Q;
visited[u] = true;
int dist = 0;
Q.push({u, 0});
while (!Q.empty()) {
u = Q.front().first;
dist = Q.front().second;
Q.pop();
for (auto &e : nodes[u].edges) {
if (visited[e.v]) {
continue;
}
visited[e.v] = true;
Q.push({e.v, dist + 1});
parent[e.v] = u;
}
}
return {u, dist};
}
void findDiameter(int u, vector<bool> &vis1, vector<bool> &vis2,
vector<int> &parent, int &diameter, int &d1, int &d2) {
d1 = bfs(u, vis1, parent).first;
auto p = bfs(d1, vis2, parent);
d2 = p.first;
diameter = p.second;
}
int findCenter(int u, int diameter, vector<int> &parent) {
diameter >>= 1;
while (diameter--) {
u = parent[u];
}
return u;
}
};
int main() {
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
int n, m;
cin >> n >> m;
tree t(n);
for (int i = 0; i < m; i++) {
int u, v;
cin >> u >> v;
u--;
v--;
t.add_edge(u, v);
}
vector<pair<int, int>> DnC = t.findDiametersAndCenters();
sort(DnC.rbegin(), DnC.rend());
int res = DnC[0].first;
if (DnC.size() >= 2) {
res = max(res, (DnC[0].first + 1) / 2 + (DnC[1].first + 1) / 2 + 1);
}
if (DnC.size() >= 3) {
res = max(res, (DnC[1].first + 1) / 2 + (DnC[2].first + 1) / 2 + 2);
}
cout << res << '\n';
for (int i = 1; i < DnC.size(); i++) {
cout << DnC[i].second + 1 << ' ' << DnC[0].second + 1 << '\n';
}
}
| 2,000 | CPP |
n=int(input())
l=[]
for i in range(n):
l1=input()
l.append(l1)
m=list(set(l))
ma=0
for i in range(len(m)):
c=l.count(m[i])
if(c>ma):
ma=c
p=m[i]
print(p) | 1,000 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int dir8[2][8] = {{1, -1, 0, 0, 1, -1, 1, -1}, {0, 0, 1, -1, 1, -1, -1, 1}};
int dir4[2][4] = {{1, -1, 0, 0}, {0, 0, 1, -1}};
long long m, n, row, col, x, y;
char g[1006];
map<int, char> s;
int len, i, j, a[26], required;
bool nums[100000];
int primes[100000];
void siv() {
int d = 0;
primes[d++] = 2;
for (long long w = 3; w < 100000; w += 2) {
if (!nums[w]) {
primes[d++] = (int)w;
for (long long j = w * w; j < 100000; j += (2 * w)) nums[j] = 1;
}
}
}
struct node {
int val, idx;
} freq[26];
bool cmp(node a, node b) { return a.val > b.val; }
void solve() {
scanf("%s", g);
len = strlen(g);
map<int, int> rel;
for (i = 0; i < len; i++) {
a[g[i] - 'a']++;
}
for (i = 0; i < 26; i++) {
freq[i].val = a[i];
freq[i].idx = i;
}
sort(freq, freq + 26, cmp);
bool acid = 0;
for (i = 0; primes[i] <= len; i++) {
required = len / primes[i];
if (required >= 2) {
int deb = 0;
for (j = primes[i] - 1; j < len; j += primes[i]) {
if (s[j] == 0) {
deb++;
s[j] = (char)(freq[0].idx + 98);
}
}
if (freq[0].val < deb) {
acid = 1;
break;
} else
freq[0].val -= deb;
} else {
for (j = 0; j < 26; j++) {
if (freq[j].val >= required) {
freq[j].val -= required;
s[primes[i] - 1] = (char)(freq[j].idx + 98);
break;
}
}
}
}
if (acid)
printf("NO\n");
else {
printf("YES\n");
for (i = 0; i < 26; i++) {
if (freq[i].val == 1) {
s[0] = (char)(freq[i].idx + 98);
}
}
s[len] = 0;
for (i = 0; s[i]; i++) cout << (char)((int)s[i] - 1);
}
}
int main() {
siv();
solve();
return 0;
}
| 1,300 | CPP |
n = int(input())
for _ in range(n):
x = int(input())
if x%2== 0 and (x // 2) % 2 == 0:
print("YES")
else:
print("NO")
| 800 | PYTHON3 |
loop = int(input())
start = 0
while start < loop:
word = str(input())
if len(word) > 10:
print(word[0] + str(len(word) - 2) + word[len(word) - 1])
else:
print(word)
start += 1 | 800 | PYTHON3 |
#! /usr/bin/python3
import re
import math
def getA(a):
num = 0
for aa in range(0, len(a)):
b = ord(a[aa]) - 64
num = num * 26 + b
return num
def getB(a):
a = int(a)
if a <= 26:
return chr(a + 64)
s = ''
while True:
b = math.floor(a / 26)
c = a % 26
if c == 0:
c = 26
b = b - 1
s = chr(c + 64) + s
if b <= 26:
s = chr(b + 64) + s
break
else:
a = b
return s
rows = input()
rows = int(rows)
list = []
for i in range(0, rows):
a = input()
a = a.strip()
m = re.search('^([A-Z]+)(\d+)$', a)
n = re.search('^R(\d+)C(\d+)', a)
if m:
c = getA(m.group(1))
list.append('R' + str(m.group(2)) + 'C' + str(c))
if n:
c = getB(n.group(2))
list.append(c + str(n.group(1)))
for a in list:
print(a) | 1,600 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1005;
long long n, m, a[maxn], ans, d[maxn];
pair<long long, long long> b[maxn];
vector<long long> g[maxn];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n >> m;
for (long long i = 1; i <= n; i++) {
cin >> a[i];
b[i] = make_pair(a[i], i);
}
for (long long i = 1; i <= m; i++) {
long long x, y;
cin >> x >> y;
d[x] += a[y];
d[y] += a[x];
g[x].push_back(y);
g[y].push_back(x);
}
sort(b + 1, b + n + 1);
for (long long i = n; i >= 1; i--) {
long long x = b[i].second;
ans += d[x];
for (long long j = 0; j < g[x].size(); j++) d[g[x][j]] -= a[x];
}
cout << ans;
return 0;
}
| 1,400 | CPP |
import random
n, k = map(int, input().split())
password = ''
d = [chr(x) for x in range(ord('a'), ord('z') + 1)]
l = random.sample(d, k)
for i in range(0, n):
password += l[i % k]
print(password)
| 800 | PYTHON3 |
t = int(input())
for i in range(t):
n = int(input())
curr = 3
while(n%curr != 0):
curr = 2*curr+1
print(n//curr) | 900 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
struct edge {
long long int A;
long long int B;
};
long long int power(long long int a, long long int b, long long int mod) {
long long int x = 1, y = a;
while (b > 0) {
if (b % 2) {
x = (x * y) % mod;
}
y = (y * y) % mod;
b /= 2;
}
return x % mod;
}
long long int modular_inverse(long long int n, long long int mod) {
return power(n, mod - 2, mod);
}
bool edgecompare(edge lhs, edge rhs) {
if (lhs.B != rhs.B)
return lhs.B < rhs.B;
else
return lhs.A < rhs.A;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long int n, m, i, j, k, flag = 0, x;
string str;
long long int a;
cin >> n;
set<long long int> S;
long long int ans = 1;
long long int curr = 0;
long long int buy = INT_MIN, sell = INT_MAX;
S.insert(INT_MIN);
S.insert(INT_MAX);
for (i = 0; i < n; i++) {
cin >> str >> a;
if (str == "ADD") {
S.insert(a);
if (a > buy && a < sell) {
curr++;
}
} else {
if (a < buy || a > sell) {
ans = 0;
break;
} else {
set<long long int>::iterator it2 = S.find(a);
set<long long int>::iterator it1 = S.find(a);
it1--;
it2++;
if (a != buy && a != sell) {
buy = *it1;
sell = *it2;
ans *= 2;
ans %= 1000000007;
curr = 0;
} else {
buy = *it1;
sell = *it2;
curr = 0;
}
S.erase(a);
}
}
}
ans *= (curr + 1);
ans %= 1000000007;
cout << ans;
return 0;
}
| 2,100 | CPP |
for t in range(int(input())):
a,b=tuple(map(int,input().split()))
if a==b:
print(0)
elif b>a:
if (b-a)%2!=0:
print(1)
else:
print(2)
else:
if(a-b)%2!=0:
print(2)
else:
print(1) | 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int sum(int n) { return n * (n + 1) / 2; }
int main() {
int n;
while (~scanf("%d", &n)) {
int s = 0;
int i = 1;
while (1) {
s = sum(i);
n -= s;
i++;
if (n < sum(i)) {
break;
}
}
printf("%d\n", i - 1);
}
return 0;
}
| 800 | CPP |
t = int(input())
result = []
for i in range(t):
n = int(input())
a = [int(x) for x in input().split(" ")]
a.sort()
countEven = 0
countOdd = 0
for x in a:
if x % 2 == 0:
countEven = countEven + 1
else:
countOdd = countOdd + 1
if countEven % 2 == 0:
result.append("YES")
else:
ok = True
for i in range(n - 1):
if a[i + 1] - a[i] == 1:
ok = False
break
if ok:
result.append("NO")
else:
result.append("YES")
for i in result:
print(i)
| 1,100 | PYTHON3 |
R = lambda: map(int,input().split())
n,m,k = R()
h = set(R())
cb = 1
for i in range(k):
u,v = R()
if cb in h:
break
if u == cb:
cb = v
elif v == cb:
cb = u
print(cb) | 1,300 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int dir1[8][2] = {1, 2, 2, 1, 2, -1, 1, -2, -1, 2, -2, 1, -1, -2, -2, -1};
int dir2[4][2] = {1, 0, 0, 1, -1, 0, 0, -1};
int dir3[8][2] = {1, 0, 0, 1, -1, 0, 0, -1, 1, 1, 1, -1, -1, 1, -1, -1};
int gcd(int x, int y) { return y == 0 ? x : gcd(y, x % y); }
bool isPrime(int x) {
if (x == 1)
return false;
else if (x == 2)
return true;
for (int i = 2; i <= sqrt(x * 1.0); ++i) {
if (x % i == 0) return false;
}
return true;
}
int sqr(int x) { return x * x; }
int main() {
long long int n;
while (cin >> n) {
long long int ans = (n + 2) * (n + 1) * n / 6;
long long int sum = ans * (ans * (n + 3) * (n + 4) / 20);
cout << sum << endl;
}
return 0;
}
| 1,600 | CPP |
n, l, r = map(int, input().split())
minlst = []
maxlst = []
for i in range(l):
minlst.append(2 ** i)
for i in range(r):
maxlst.append(2 ** i)
for i in range(n - l):
minlst.append(1)
for i in range(n - r):
maxlst.append(2 ** (r - 1))
print(sum(minlst))
print(sum(maxlst))
| 900 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int i, j, k, n, m, l = 0, x, y, flag = 0;
cin >> n >> m >> k;
long long int a[n], b[m];
vector<pair<long long int, long long int> > v;
for (i = 0; i < n; i++) cin >> a[i];
for (i = 0; i < k; i++) {
cin >> x >> y;
if (x == 1) {
flag = 0;
for (j = 0; j < l; j++) {
if (v[j].second == y) {
flag = 1;
break;
}
}
if (l < m) {
l++;
v.push_back(make_pair(a[y - 1], y));
} else {
sort(v.begin(), v.end());
if (a[y - 1] > v[0].first) {
v[0].first = a[y - 1];
v[0].second = y;
}
}
} else {
flag = 0;
for (j = 0; j < l; j++) {
if (v[j].second == y) {
flag = 1;
break;
}
}
if (flag == 1)
cout << "YES\n";
else
cout << "NO\n";
}
}
return 0;
}
| 1,200 | CPP |
cnt,s = 1,''
while len(s)<10000:cnt,s=cnt+1,s+str(cnt)
print(s[int(input())-1]) | 1,000 | PYTHON3 |
import re
txt = input()
t=False
if(re.search('AB',txt)!= None):
st = txt.replace('AB','X',1)
if(re.search('BA',st)!= None):
t=True
if(re.search('BA',txt)!= None):
st = txt.replace('BA','X',1)
if(re.search('AB',st)!= None):
t=True
if(t==False):
print("NO")
else:
print("YES") | 1,500 | PYTHON3 |
n,k,x = map(int, input().split())
chores = list(map(int,input().split()))
for i in range(n-1,n-1-k,-1):
chores[i] = x
print(sum(chores)) | 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int a, b, c, d, i, j, k, l;
map<long double, long long int> m;
cin >> a;
long double a1[a];
string s;
for (i = 0; i < a; i++) {
cin >> s;
string s1 = "", s2 = "", s3 = "";
j = 1;
while (1) {
if (s[j] == '+') break;
s1 += s[j], j++;
}
j++;
while (1) {
if (s[j] == ')') break;
s2 += s[j];
j++;
}
j += 2;
while (1) {
if (j == s.length()) break;
s3 += s[j];
j++;
}
int p, q, r;
p = stoi(s1);
q = stoi(s2);
r = stoi(s3);
long double cur = (p + q) / (long double)r;
a1[i] = cur;
auto it = m.find(a1[i]);
if (it == m.end()) {
m.insert(pair<long double, long long int>(a1[i], 1));
} else
it->second = it->second + 1;
}
for (i = 0; i < a; i++) {
auto it = m.find(a1[i]);
cout << it->second << " ";
}
}
| 1,400 | CPP |
for i in range(int(input())):
n,k=map(int,input().split())
l=list(map(int,input().split()))
d=max(l)
for i in range(len(l)):
l[i]=abs(d-l[i])
if k%2!=0:
print(*l)
else:
a=max(l)
for i in range(len(l)):
l[i]=abs(a-l[i])
print(*l)
| 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long t;
cin >> t;
while (t--) {
long long n;
cin >> n;
if (n % 4 == 0)
cout << "YES"
<< "\n";
else
cout << "NO"
<< "\n";
}
return 0;
}
| 800 | CPP |
from collections import defaultdict
n, k = map(int, input().split())
s = input()
c = list(input().split())
d = defaultdict(int)
ans = 0
for x in c:
d[x] += 1
l = 0
for x in s:
if d[x] == 0:
ans += (l*(l+1))//2
l = 0
else:
l += 1
if l > 0:
ans += (l*(l+1))//2
print(ans) | 1,200 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long a[1000010], b[1000], d[1000010], p[1000010];
long long mn = 1e18, mx = -1e18, ans, cnt, sm = 1, n, m, cur;
bool ok, okk, u[1000010], uu[310][310], uk[1000010];
char ck[510][510], ch[100010];
int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
vector<long long> g[900010];
int main() {
long long k;
cin >> n >> m >> k;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
m--;
while (true) {
cnt++;
if (m - cnt >= 0) {
if (a[m - cnt] != 0 && a[m - cnt] <= k) {
cout << cnt * 10;
return 0;
}
}
if (m + cnt < n) {
if (a[m + cnt] != 0 && a[m + cnt] <= k) {
cout << cnt * 10;
return 0;
}
}
}
return 0;
}
| 800 | CPP |
#include <bits/stdc++.h>
using namespace std;
inline int read() {
int num = 0;
char c = getchar();
if (c == '-') return -read();
while (c >= '0' && c <= '9') {
num = (num << 3) + (num << 1) + c - '0';
c = getchar();
}
return num;
}
inline long long READ() {
long long num = 0;
char c = getchar();
if (c == '-') return -READ();
while (c >= '0' && c <= '9') {
num = (num << 3) + (num << 1) + c - '0';
c = getchar();
}
return num;
}
long long dp[100007], dp2[100007];
long long MAXV = 314000000;
int lgl[100007];
vector<vector<int> > fl[100007];
bool hwam[100007];
void uwm(long long& a) {
if (a > MAXV) a = MAXV;
}
long long dfsmin(int now) {
if (lgl[now] == 1) hwam[now] = 1;
if (lgl[now] == 2) return -1;
if (dp[now] != ((int)0x3f3f3f3f)) return dp[now];
lgl[now]++;
for (int i = 0; i < ((int)(fl[now]).size()); i++) {
long long ans = 0;
bool hwww = hwam[now];
for (int j = 0; j < ((int)(fl[now][i]).size()); j++) {
long long nowans;
if (fl[now][i][j] == -1)
nowans = 1;
else
nowans = dfsmin(fl[now][i][j]);
if (nowans == -1) {
ans = -1;
break;
}
ans += nowans;
uwm(ans);
}
if (ans != -1) {
uwm(ans);
if (dp[now] == -1)
dp[now] = ans;
else
dp[now] = min(dp[now], ans);
} else
hwam[now] = hwww;
}
lgl[now]--;
if (dp[now] == ((int)0x3f3f3f3f))
return dp[now] = -1;
else
return dp[now];
}
long long dfsmax(int now) {
if (lgl[now] == 2) return -1;
if (dp2[now] != -((int)0x3f3f3f3f)) return dp2[now];
lgl[now]++;
for (int i = 0; i < ((int)(fl[now]).size()); i++) {
long long ans = 0;
for (int j = 0; j < ((int)(fl[now][i]).size()); j++) {
long long nowans;
if (fl[now][i][j] == -1)
nowans = 1;
else
nowans = dfsmax(fl[now][i][j]);
if (nowans == -2)
ans = -2;
else if (nowans == -1) {
ans = -1;
break;
}
if (ans != -2) ans += nowans;
uwm(ans);
}
if (ans != -1 && ans != -2) {
uwm(ans);
if (dp2[now] != -2) dp2[now] = max(dp2[now], ans);
} else if (ans == -2)
dp2[now] = -2;
}
lgl[now]--;
if (hwam[now]) {
if (dp[now] != -1)
return dp2[now] = -2;
else
return dp2[now] = -1;
}
if (dp2[now] == -((int)0x3f3f3f3f)) return dp2[now] = -1;
return dp2[now];
}
int n, m;
int main() {
scanf("%d%d", &n, &m);
for (int i = 0; i < n; i++) {
int a, b;
scanf("%d%d", &a, &b);
fl[a].push_back(vector<int>(b));
for (int j = 0; j < b; j++)
scanf("%d", &fl[a][((int)(fl[a]).size()) - 1][j]);
}
memset((void*)lgl, 0, sizeof(lgl));
memset((void*)hwam, 0, sizeof(hwam));
for (int i = 0; i < 100007; i++) dp[i] = ((int)0x3f3f3f3f);
for (int i = 1; i <= m; i++)
if (dp[i] == ((int)0x3f3f3f3f)) dfsmin(i);
memset((void*)lgl, 0, sizeof(lgl));
for (int i = 0; i < 100007; i++) dp2[i] = -((int)0x3f3f3f3f);
for (int i = 1; i <= m; i++)
if (dp2[i] == -((int)0x3f3f3f3f)) dfsmax(i);
for (int i = 1; i <= m; i++) printf("%I64d %I64d\n", dp[i], dp2[i]);
return 0;
}
| 2,600 | CPP |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define x first
#define y second
#define PII pair<int,int>
#define LL long long
#define pb push_back
#define pqp priority_queue<PII,vector<PII>,greater<PII> >
#define pqi priority_queue<int,vector<int>,greater<int> >
#define PSS pair<string,string>
#define in insert
#define line inline
#define sort(s) sort(s.begin(),s.end());
#define reverse(s) reverse(s.begin(),s.end());
#define max_(s) *max_element(s.begin(), s.end())
#define V vector<int>
#define VV vector<V>
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int dx[]= {0,-1,0,1,0,0},dy[]= {-1,0,1,0,0,0},dz[] = {0,0,0,0,-1,1};
void solve()
{
int n,k; cin >> n >> k;
string s; cin >> s;
int star = -1,last,cnt = 0;
for(int i = 0; i < s.size(); i ++){
if(s[i] == '*'){
if(star == -1) star = i;
last = i;
}
}
if(last == star){
cout << 1 << endl;
return ;
}
for(int i = star; i + k < last;){
for(int j = i + k; j > i; j --){
if(s[j] == '*'){
i = j;
cnt ++;
break;
}
}
}
cout << cnt + 2 << endl;
}
signed main()
{
// IOS
// init();
// get_primes(N - 1);
int _; cin >> _;for(int i = 1; i <= _; i ++)
solve();
}
| 1,100 | CPP |
input();x=input()
print('NO' if x.count('SF')<=x.count('FS') else 'YES') | 800 | PYTHON3 |
import os
from io import BytesIO
# input = BytesIO(os.read(0, os.fstat(0).st_size)).readline
for i in range(int(input())):
a, b, c, r = map(int, input().split())
a, b = min(a, b), max(a, b)
left = max(c - r, a)
right = min(c + r, b)
if right >= a and left <= right:
print(b - a - (right - left))
else:
print(b - a)
| 900 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000000;
const int mod = 1000000007;
const double eps = 0.0000000001;
int n, m;
vector<vector<char> > board;
bool Try(int x1, int y1, int x2, int y2, int x3, int y3) {
if (x1 != n && y1 != n && x2 != n && y2 != n && x3 != n && y3 != n)
return false;
if (x1 > n || y1 > n || x2 > n || y2 > n || x3 > n || y3 > n) return false;
board.resize(n + 1);
for (int i = 0; i <= n; i++) {
board[i].resize(n + 1, '#');
}
if (x2 == n || y2 == n) {
swap(x1, x2);
swap(y1, y2);
}
if (x3 == n || y3 == n) {
swap(x1, x3);
swap(y1, y3);
}
if (x1 != n) {
swap(x1, y1);
}
m -= y1;
for (int i = 1; i <= y1; i++) {
for (int j = 1; j <= n; j++) {
board[i][j] = '1';
}
}
if (x2 < y2) {
swap(x2, y2);
}
if (x3 < y3) {
swap(x3, y3);
}
if (x2 == n && x3 == n) {
if (y2 + y3 != m) return false;
for (int i = y1 + 1; i <= y1 + y2; i++) {
for (int j = 1; j <= n; j++) {
board[i][j] = '2';
}
}
for (int i = y1 + y2 + 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
board[i][j] = '3';
}
}
return true;
}
if (x2 == m && x3 == m) {
if (y2 + y3 == n) {
for (int i = y1 + 1; i <= n; i++) {
for (int j = 1; j <= y2; j++) {
board[i][j] = '2';
}
}
for (int i = y1 + 1; i <= n; i++) {
for (int j = y2 + 1; j <= n; j++) {
board[i][j] = '3';
}
}
return true;
}
}
if (y2 == m && y3 == m) {
if (x2 + x3 != n) return false;
swap(x2, y2);
swap(x3, y3);
for (int i = y1 + 1; i <= n; i++) {
for (int j = 1; j <= y2; j++) {
board[i][j] = '2';
}
}
for (int i = y1 + 1; i <= n; i++) {
for (int j = y2 + 1; j <= n; j++) {
board[i][j] = '3';
}
}
return true;
}
if (x3 > y3) {
swap(x3, y3);
}
if (x2 == n && x3 == n) {
if (y2 + y3 != m) return false;
for (int i = y1 + 1; i <= y1 + y2; i++) {
for (int j = 1; j <= n; j++) {
board[i][j] = '2';
}
}
for (int i = y1 + y2 + 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
board[i][j] = '3';
}
}
return true;
}
if (x2 == m && x3 == m) {
if (y2 + y3 == n) {
for (int i = y1 + 1; i <= n; i++) {
for (int j = 1; j <= y2; j++) {
board[i][j] = '2';
}
}
for (int i = y1 + 1; i <= n; i++) {
for (int j = y2 + 1; j <= n; j++) {
board[i][j] = '3';
}
}
return true;
}
}
if (y2 == m && y3 == m) {
if (x2 + x3 != n) return false;
swap(x2, y2);
swap(x3, y3);
for (int i = y1 + 1; i <= n; i++) {
for (int j = 1; j <= y2; j++) {
board[i][j] = '2';
}
}
for (int i = y1 + 1; i <= n; i++) {
for (int j = y2 + 1; j <= n; j++) {
board[i][j] = '3';
}
}
return true;
}
return false;
}
void solution() {
vector<pair<int, int> > sizes(3);
int x, y;
int square = 0;
for (int i = 0; i < 3; i++) {
cin >> x >> y;
if (x < y) swap(x, y);
square += (x * y);
sizes[i] = make_pair(x, y);
}
n = -1;
for (int i = 0; i <= 500; i++) {
if (i * i == square) {
n = i;
break;
}
}
if (n == -1) {
cout << "-1\n";
return;
}
m = n;
bool ok = Try(sizes[0].first, sizes[0].second, sizes[1].first,
sizes[1].second, sizes[2].first, sizes[2].second);
if (!ok) {
cout << "-1\n";
return;
}
cout << n << "\n";
int ones = 0, twos = 0, thirds = 0;
int side_ones = 0, side_twos = 0, side_thirds = 0;
int side_ones_2, side_twos_2, side_thirds_2;
int k1, k2, k3;
k1 = 0, k2 = 0, k3 = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if (board[i][j] == '1') ones++;
if (board[i][j] == '2') twos++;
if (board[i][j] == '3') thirds++;
if (board[i][j] == '1') {
k1++;
} else {
k1 = min(k1, n);
if (k1 != 0) {
side_ones = max(side_ones, k1);
k1 = 0;
}
}
if (board[i][j] == '2') {
k2++;
} else {
k2 = min(k2, n);
if (k2 != 0) {
side_twos = max(side_twos, k2);
k2 = 0;
}
}
if (board[i][j] == '3') {
k3++;
} else {
k3 = min(k3, n);
if (k3 != 0) {
side_thirds = max(side_thirds, k3);
k3 = 0;
}
}
}
}
side_ones = max(side_ones, min(k1, n));
side_twos = max(side_twos, min(k2, n));
side_thirds = max(side_thirds, min(k3, n));
side_ones_2 = ones / side_ones;
side_twos_2 = twos / side_twos;
side_thirds_2 = thirds / side_thirds;
map<char, char> go;
vector<bool> was(3, false);
if (side_ones < side_ones_2) swap(side_ones, side_ones_2);
if (side_twos < side_twos_2) swap(side_twos, side_twos_2);
if (side_thirds < side_thirds_2) swap(side_thirds, side_thirds_2);
for (int i = 0; i < 3; i++) {
if (!was[0] && make_pair(side_ones, side_ones_2) == sizes[i]) {
go['1'] = char('A' + i);
was[0] = true;
} else if (!was[1] && make_pair(side_twos, side_twos_2) == sizes[i]) {
go['2'] = char('A' + i);
was[1] = true;
} else {
go['3'] = char('A' + i);
was[2] = true;
}
}
int Aa = 0, Bb = 0, Cc = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
cout << go[board[i][j]];
if (go[board[i][j]] == 'A') Aa = 1;
if (go[board[i][j]] == 'B') Bb = 1;
if (go[board[i][j]] == 'C') Cc = 1;
}
cout << "\n";
}
}
void include_file() {
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
}
int main() {
solution();
return 0;
}
| 1,700 | CPP |
n,v = map(int,input().split())
if v > n: print(n-1)
else: print((n-v-1)*(n-v+2)//2 + v) | 900 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int K, x, l1, l2, s[99], e[99], ac[99];
bool can(int s, int e, int ac, int L) {
if (L == 1 && (s != e || ac > 0)) return false;
if (L == 2 && s == 'A' && e == 'C' && ac < 1) return false;
if (L == 1) return ac == 0;
if (L == 2) return (ac == 0) || (s == 'A' && e == 'C' && ac == 1);
if (ac * 2 + 2 <= L) return true;
if (s == 'A' && ac * 2 + 1 <= L) return true;
if (e == 'C' && ac * 2 + 1 <= L) return true;
if (s == 'A' && e == 'C' && ac * 2 <= L) return true;
return false;
}
int equal(int s1, int e1, int ac1, int s2, int e2, int ac2) {
s[1] = s1;
e[1] = e1;
ac[1] = ac1;
s[2] = s2;
e[2] = e2;
ac[2] = ac2;
for (int i = 3; i <= K; i++) {
s[i] = s[i - 2];
e[i] = e[i - 1];
ac[i] = ac[i - 2] + ac[i - 1];
if (e[i - 2] == 'A' && s[i - 1] == 'C') ac[i]++;
if (ac[i] > x) return false;
}
return ac[K] == x;
}
void Write(int s, int e, int ac, int L) {
if (L == 1) {
printf("%c\n", s);
return;
}
if (L == 2) {
printf("%c%c\n", s, e);
return;
}
if (s == 'A' && e == 'C') {
if (ac == 0) {
printf("A");
for (int i = 1; i <= L - 2; i++) printf("B");
printf("C\n");
return;
}
if (ac == 1) {
printf("AC");
for (int i = 1; i <= L - 3; i++) printf("B");
printf("C\n");
return;
}
if (ac >= 2) {
printf("AC");
for (int i = 1; i <= ac - 2; i++) printf("AC");
for (int i = 1; i <= L - 2 * ac; i++) printf("B");
printf("AC\n");
return;
}
}
if (s == 'A') {
if (ac == 0) {
printf("A");
for (int i = 1; i <= L - 2; i++) printf("B");
printf("%c\n", e);
return;
} else {
printf("A");
if (ac) printf("C");
for (int i = 1; i <= ac - 1; i++) printf("AC");
for (int i = 1; i <= L - 2 * ac - 1; i++) printf("B");
printf("%c\n", e);
return;
}
}
if (e == 'C') {
if (ac == 0) {
printf("%c", s);
for (int i = 1; i <= L - 2; i++) printf("B");
printf("C\n");
return;
} else {
printf("%c", s);
for (int i = 1; i <= L - 2 * ac - 1; i++) printf("B");
for (int i = 1; i <= ac - 1; i++) printf("AC");
if (ac) printf("A");
printf("C\n");
return;
}
}
printf("%c", s);
for (int i = 1; i <= ac; i++) printf("AC");
for (int i = 1; i <= L - 2 * ac - 2; i++) printf("B");
printf("%c\n", e);
}
int main() {
scanf("%d%d%d%d", &K, &x, &l1, &l2);
for (int s1 = 'A'; s1 <= 'C'; s1++)
for (int e1 = 'A'; e1 <= 'C'; e1++)
for (int ac1 = 0; ac1 <= l1 / 2; ac1++)
if (can(s1, e1, ac1, l1))
for (int s2 = 'A'; s2 <= 'C'; s2++)
for (int e2 = 'A'; e2 <= 'C'; e2++)
for (int ac2 = 0; ac2 <= l2 / 2; ac2++)
if (can(s2, e2, ac2, l2))
if (equal(s1, e1, ac1, s2, e2, ac2)) {
Write(s1, e1, ac1, l1);
Write(s2, e2, ac2, l2);
return 0;
}
printf("Happy new year!\n");
return 0;
}
| 2,000 | CPP |
i1 = 0
j1 = 0
for i in range(5):
a = input().split()
if (a.count('1') == 1):
i1 = i
j1 = a.index('1')
break
print(abs(i1 - 2) + abs(j1 - 2)) | 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const double EPS = 1e-9;
const int MOD = 1e9 + 7;
template <class T>
inline T my_min(T a, T b) {
return a < b ? a : b;
}
template <class T>
inline T my_max(T a, T b) {
return a > b ? a : b;
}
template <class T>
inline void my_swap(T& a, T& b) {
T tmp = a;
a = b;
b = tmp;
}
template <class T>
inline T my_abs(T a) {
return (a > 0 ? a : -a);
}
const int max_size = 1e5 + 5;
int n;
int main() {
scanf("%d", &n);
cout << (n / 2) + 1 << "\n";
return 0;
}
| 800 | CPP |
n, k = input().split()
n = int(n)
k = int(k)
a = list(map(int, input().split()))
for i in range(1, n+1):
res = (1 + i) * i // 2
if res >= k:
k = k - (i - 1) * i // 2
print(a[k-1])
break | 1,000 | PYTHON3 |
n=int(input())
c=0
for i in range(n):
s=input()
if s=="++X" or s=="X++":
c+=1
else:
c-=1
print(c)
| 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n;
int ans = 0, furthest;
vector<int> adj[100000];
void DFS(int v, int p, int d) {
if (d > ans) {
ans = d;
furthest = v;
}
for (int i = 0; i < adj[v].size(); i++) {
int u = adj[v][i];
if (u == p) continue;
DFS(u, v, d + 1);
}
}
int main() {
int m;
cin >> n >> m;
for (int i = 0; i < n - 1; i++) {
int a, b;
cin >> a >> b;
adj[a - 1].push_back(b - 1);
adj[b - 1].push_back(a - 1);
}
DFS(0, -1, 0);
DFS(furthest, -1, 0);
cout << ans;
}
| 1,500 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
string tostr(const T& t) {
ostringstream os;
os << t;
return os.str();
}
long long big = 2000000000010LL;
bool winner(string& a, string& b, string& c) {
if (a == "rock" && b == "scissors" && c == "scissors") return true;
if (a == "paper" && b == "rock" && c == "rock") return true;
if (a == "scissors" && b == "paper" && c == "paper") return true;
return false;
}
int main() {
string f, m, s;
cin >> f >> m >> s;
if (winner(f, m, s))
cout << "F" << endl;
else if (winner(m, f, s))
cout << "M" << endl;
else if (winner(s, f, m))
cout << "S" << endl;
else
cout << "?" << endl;
return 0;
}
| 900 | CPP |
#include <bits/stdc++.h>
int main() {
int s[200][200], n, p, c, i, j;
c = 1;
s[0][0] = 1;
s[1][0] = 1;
scanf("%d", &n);
for (p = 2; c + p <= n; p++) {
for (i = 0; i < p; i++) s[i][p - 1] = s[p][i] = c + i + 1;
c += p;
}
printf("%d\n", p);
for (i = 0; i < p; i++) {
for (j = 0; j < p - 1; j++) printf("%d ", s[i][j]);
printf("\n");
}
return 0;
}
| 1,600 | CPP |
Subsets and Splits