solution
stringlengths 10
159k
| difficulty
int64 0
3.5k
| language
stringclasses 2
values |
|---|---|---|
import sys
lines = sys.stdin.readlines()
n = int(lines[0].strip())
arr = list(map(int, lines[1].strip().split(" ")))
arr.append(arr[-1])
res = []
maxChange = 0
left = 0
for i in range(1, n+1):
if arr[i] == arr[i-1]:
L = i - left
res += [arr[left]]*(L//2) + [arr[i-1]]*(L-L//2)
maxChange = max(maxChange, (L-1)//2)
left = i
print(maxChange)
print(" ".join(map(str, res)))
| 1,700 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
char vis[2005][2005];
long long a[1000005];
long long temp2[1005][1005];
long long n, m, k, p;
vector<pair<long long, long long>> ans;
bool check(double time) {
double energy = 0;
for (long long i = 0; i < n; i++) {
double pp = 0;
energy += max(pp, ans[i].first * time - ans[i].second);
}
if (energy <= p * time)
return 1;
else
return 0;
}
double binsearch(double l, double h) {
long long count = 1000;
while (count--) {
double mid = (l + h) / 2;
if (check(mid)) {
l = mid;
} else
h = mid;
}
return l;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
cin >> n >> p;
long long sum = 0;
for (long long i = 0; i < n; i++) {
long long x, y;
cin >> x >> y;
sum += x;
ans.push_back(make_pair(x, y));
}
if (p >= sum) {
cout << -1;
return 0;
}
double ans = binsearch(0, 1e18);
cout << fixed << setprecision(4) << ans << "\n";
return 0;
}
| 1,800 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
bool iIn1, iIn2, iIn3, iIn4;
cin >> iIn1 >> iIn2 >> iIn3 >> iIn4;
int s = ((iIn1 ^ iIn2) & (iIn3 | iIn4)) ^ ((iIn2 & iIn3) | (iIn1 ^ iIn4));
cout << s;
return 0;
}
| 2,000 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, m = 0x80000000;
cin >> n;
for (int i = 1; i < n; ++i) {
cin >> x;
m = max(m, x);
}
cin >> x;
cout << (max(m, x) ^ x);
return 0;
}
| 1,800 | CPP |
import sys
input=sys.stdin.readline
from math import *
import bisect as bs
t=int(input())
while t>0:
t-=1
n=int(input())
z=2
for i in range(2,100):
if n%(2**i-1)==0:
z=i
break
print(n//(2**z-1)) | 900 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
bool isprime(long long n) {
if (n == 1) return false;
if (n == 2) return true;
for (long long i = 2; i <= sqrt(n); i++) {
if (n % i == 0) {
return false;
}
}
return true;
}
long long poww(long long b, long long e) {
if (e == 0)
return 1;
else if (e % 2 == 0) {
long long a = pow(b, e / 2);
return a * a;
} else {
long long a = pow(b, e / 2);
return b * a * a;
}
}
long long powm(long long x, long long y, long long m = 1000000007) {
x = x % m;
long long res = 1;
while (y) {
if (y & 1) res = res * x;
res %= m;
y = y >> 1;
x = x * x;
x %= m;
}
return res;
}
long long modInverse(long long a, long long m = 1000000007) {
return powm(a, m - 2, m);
}
void print(vector<long long> v) {
for (long long i = 0; i < v.size(); i++) {
cout << v[i] << " ";
}
}
void print(long long arr[]) {
long long size = *(&arr + 1) - arr;
for (long long i = 0; i < size; i++) {
cout << arr[i] << " ";
}
}
string to_bin(long long n) {
string res = "";
long long i = 0;
while (n > 0) {
if (n % 2 == 1) {
res = res + '1';
} else {
res = res + '0';
}
n /= 2;
i++;
}
reverse(res.begin(), res.end());
return res;
}
long long to_dec(string second) {
long long n = second.size(), ans = 0, temp = 1;
for (long long i = n - 1; i >= 0; i--) {
long long x = second[i] - '0';
ans += x * temp;
temp *= 2;
}
return ans;
}
void result(bool first) {
if (first)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
long long fun(vector<long long> arr, long long n, long long h) {
long long ans = 0;
sort(arr.begin(), arr.end(), greater<long long>());
long long ex = -1;
if (n % 2 == 1) ex = arr[n - 1];
long long h1 = h, h2 = h;
for (long long i = 0; i < n - 1; i += 2) {
long long x = arr[i];
long long y = INT_MAX;
long long mx = max(arr[i], arr[i + 1]);
long long mn = min(arr[i], arr[i + 1]);
if (mx <= h1) {
ans += 2;
h1 -= mx;
h2 -= mx;
} else {
if (mn <= h1) {
h1 -= mn;
h2 -= mn;
ans++;
break;
}
}
}
if (ex != -1 && ans == n - 1) {
if (ex <= h2) {
ans++;
}
}
return ans == n;
}
void solve() {
long long n, h;
cin >> n >> h;
long long arr[n];
for (long long i = 0; i < n; i++) {
cin >> arr[i];
}
long long ans = 0;
vector<long long> temp;
for (long long i = 0; i < n; i++) {
temp.push_back(arr[i]);
if (fun(temp, i + 1, h)) {
ans = max(ans, i + 1);
}
}
cout << ans << endl;
}
int32_t main() {
ios_base::sync_with_stdio();
cin.tie(0);
cout.tie(0);
solve();
}
| 1,300 | CPP |
import math
def maxMedian(nums, n, k):
x = math.ceil(n/2)
medians = []
flag = 0
i = (n*k)-1
if n%2==0:
while len(medians)!=k and i>=0:
flag += 1
if flag==x+1:
medians.append(nums[i])
flag = 0
i -= 1
else:
while len(medians)!=k and i>=0:
flag += 1
if flag==x:
medians.append(nums[i])
flag = 0
i -= 1
return(sum(medians))
t = int(input())
for _ in range(t):
n, k = map(int, input().split())
nums = list(map(int, input().split()))
print(maxMedian(nums, n, k)) | 900 | PYTHON3 |
n,a,b=map(int,input().split())
s=list(map(int,input().split()))
k=(s[0]*a)/b
l=s[0]
s.sort()
z=s.index(l)
#print(z)
s=s[:z]+s[z+1:]
s.insert(0,l)
#print(s)
j=n-1
ans=0
val=sum(s)
#print(val,k)
while(val>k):
val-=s[j]
ans+=1
j-=1
print(ans)
| 1,000 | PYTHON3 |
a = str(input())
a = a.replace('+', '')
a = sorted(a)
b = ''
for _ in a:
b += _ + '+'
print(b[:-1])
| 800 | PYTHON3 |
T = int(input())
for case in range(T):
i = int(input())
#s = input()
#m,n = [int(x) for x in input().split()]
ls1 = [int(x) for x in input().split()]
ls2 = [int(x) for x in input().split()]
base = [False] * 2
if ls1[0] != ls2[0]:
print("NO")
continue
if ls1[0] == -1:
base[0] = True
elif ls1[0] == 1:
base[1] = True
flag = False
for x, y in zip(ls1[1:],ls2[1:]):
if y > x and base[1] == False:
print("NO")
flag = True
break
if y < x and base[0] == False:
print("NO")
flag = True
break
if x == -1:
base[0] = True
elif x == 1:
base[1] = True
flag = False
if flag:
continue
print("YES")
| 1,100 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int miu[2000005];
bool p[2000005];
int pows[2000005];
const int modo = 1000000007;
int power(int x, int y) {
if (y == 0) return 1;
int t = power(x, y / 2);
t = (long long)t * t % modo;
if (y % 2 == 1) t = (long long)t * x % modo;
return t;
}
int ans1[2000005];
int main() {
int i;
miu[1] = 1;
for (i = 2; i <= 2000000; i++) {
miu[i] = 1;
}
for (i = 2; i <= 2000000; i++) {
if (!p[i]) {
int j;
for (j = i; j <= 2000000; j += i) {
p[j] = true;
miu[j] *= -1;
if ((j / i) % i == 0) miu[j] = 0;
}
}
}
int n, k;
scanf("%d%d", &n, &k);
for (i = 1; i <= k; i++) {
pows[i] = power(i, n);
}
int j;
for (j = 1; j <= k; j++) {
if (miu[j] == 0) continue;
int i;
for (i = j; i <= k; i += j) {
ans1[i] = (ans1[i] + miu[j] * (pows[i / j] - pows[i / j - 1])) % modo;
}
}
int tot_ans = 0;
for (i = 1; i <= k; i++) {
ans1[i] = ((ans1[i - 1] + ans1[i]) % modo + modo) % modo;
tot_ans = (tot_ans + (ans1[i] ^ i)) % modo;
}
printf("%d\n", tot_ans);
return 0;
}
| 2,300 | CPP |
n,t = map(int,input().split())
A=[[0 for i in range(11)] for i in range(12)]
A[0][0] = t
index = 1
result = 0
while 1:
#print(index)
temp = 0
for i in range(index):
if(A[index-1][i]>=1):
result+=1
temp = A[index-1][i]
temp -=1
A[index][i]+=temp/2
A[index][i+1]+=temp/2
if index == n:
break
index+=1
print(result)
| 1,500 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
typedef struct node {
long long int x, y, sz;
} nod;
nod ds[1012][1012];
const int N = 1000011;
long long int a[1012][1012];
bool vs[1012][1012];
bool ismr[1012][1012];
typedef struct box {
long long int i, j, v;
} bx;
bx t[N];
pair<long long int, long long int> findp(long long int x, long long int y) {
while (1) {
long long int tmpx = x, tmpy = y;
x = ds[tmpx][tmpy].x, y = ds[tmpx][tmpy].y;
if (x == ds[x][y].x && y == ds[x][y].y) break;
}
return make_pair(x, y);
}
bool check(long long int ux, long long int uy, long long int vx,
long long int vy) {
return findp(ux, uy) == findp(vy, vy);
}
void join(long long int ux, long long int uy, long long int vx,
long long int vy) {
pair<long long int, long long int> pu, pv;
pu = findp(ux, uy);
pv = findp(vx, vy);
if (pv != pu) {
if (ds[pu.first][pu.second].sz > ds[pv.first][pv.second].sz) {
ds[pu.first][pu.second].sz += ds[pv.first][pv.second].sz;
ds[pv.first][pv.second].x = pu.first;
ds[pv.first][pv.second].y = pu.second;
ds[pv.first][pv.second].sz = 0;
} else {
ds[pv.first][pv.second].sz += ds[pu.first][pu.second].sz;
ds[pu.first][pu.second].x = pv.first;
ds[pu.first][pu.second].y = pv.second;
ds[pu.first][pu.second].sz = 0;
}
}
}
void init(long long int n, long long int m) {
long long int i, j;
for (i = 0; i <= n + 1; i++) {
for (j = 0; j <= m + 1; j++) {
ds[i][j].x = i;
ds[i][j].y = j;
ds[i][j].sz = 1;
}
}
}
bool comp(bx A, bx B) { return A.v < B.v; }
int AX[4] = {-1, 0, 1, 0};
int AY[4] = {0, 1, 0, -1};
long long int m, n, cp, cnt, ct;
pair<long long int, long long int> stat;
bool isValid(long long int x, long long int y) {
if (x >= 1 && x <= n && y >= 1 && y <= m && ismr[x][y] == 1) return 1;
return 0;
}
void dfs(long long int x, long long int y) {
long long int i, add = 0;
vs[x][y] = 1;
if (ct >= cnt)
a[x][y] = 0;
else if (a[x][y] >= cp && ct < cnt)
a[x][y] = cp, ct++;
else if (a[x][y] < cp)
a[x][y] = 0;
for (i = 0; i < 4; ++i) {
if (isValid(x + AX[i], y + AY[i]) && vs[x + AX[i]][y + AY[i]] == 0)
dfs(x + AX[i], y + AY[i]);
}
}
int main() {
long long int i, j, k, it = 0, tmp;
scanf("%lld", &n), scanf("%lld", &m), scanf("%lld", &k);
init(n, m);
for (i = 1; i < n + 1; ++i) {
for (j = 1; j < m + 1; ++j) {
scanf("%lld", &a[i][j]);
t[it].i = i;
t[it].j = j;
t[it++].v = a[i][j];
}
}
sort(t, t + it, comp);
reverse(t, t + it);
pair<long long int, long long int> r;
bool found = 0;
for (i = 0; i < it; ++i) {
long long int x = t[i].i, y = t[i].j, v = t[i].v;
if (ismr[x + 1][y]) join(x, y, x + 1, y);
if (ismr[x - 1][y]) join(x, y, x - 1, y);
if (ismr[x][y + 1]) join(x, y, x, y + 1);
if (ismr[x][y - 1]) join(x, y, x, y - 1);
pair<long long int, long long int> p = findp(x, y);
ismr[x][y] = 1;
if (k % v == 0 && ds[p.first][p.second].sz >= k / v) {
r = make_pair(x, y);
found = 1;
cnt = k / v;
cp = v;
break;
}
}
if (found == 0)
printf("NO\n");
else {
printf("YES\n");
ct = 0;
dfs(r.first, r.second);
for (i = 1; i < n + 1; ++i) {
for (j = 1; j < m + 1; ++j) {
if (vs[i][j] == 0) a[i][j] = 0;
}
}
for (i = 1; i < n + 1; ++i) {
for (j = 1; j < m + 1; ++j) printf("%lld ", a[i][j]);
printf("\n");
}
}
return 0;
}
| 2,000 | CPP |
# coding: utf-8
# In[13]:
n,L,a = list(map(int,input().split()))
l1=[]
br=0
d=0
for i in range(n):
l1.append(list(map(int,input().split())))
if(n==0):
print(int(L/a))
else:
for i in l1:
br=br+int((i[0]-d)/a)
d=i[0]+i[1]
if(d<L):
br=br+int((L-d)/a)
print(br)
| 1,000 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, qx, qy, kx, ky, cx, cy;
scanf("%d %d %d %d %d %d %d", &n, &qx, &qy, &kx, &ky, &cx, &cy);
if ((qx > kx && qx < cx) || (qx < kx && qx > cx)) {
printf("NO");
} else if ((qy > ky && qy < cy) || (qy < ky && qy > cy)) {
printf("NO");
} else {
printf("YES");
}
}
| 1,000 | CPP |
s=input()
q=int(input())
for t in range(q) :
l,r,k=map(int,input().split())
k%=(r-l+1)
l-=1
a=s[0:l]
b=s[l:r-k]
c=s[r-k:r]
d=s[r:len(s)]
s=a+c+b+d
print(s) | 1,300 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V>
void __print(const pair<T, V> &x) {
cerr << '{';
__print(x.first);
cerr << ',';
__print(x.second);
cerr << '}';
}
template <typename T>
void __print(const T &x) {
int f = 0;
cerr << '{';
for (auto &i : x) cerr << (f++ ? "," : ""), __print(i);
cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V>
void _print(T t, V... v) {
__print(t);
if (sizeof...(v)) cerr << ", ";
_print(v...);
}
void solve() {
long long n, m, k;
cin >> n >> m >> k;
string s, t;
cin >> s >> t;
long long ans = 0;
long long dp[k + 1][n + 1][m + 1];
memset(dp, 0, sizeof dp);
for (long long i = 1; i <= k; ++i) {
long long cur[n + 1][m + 1];
memset(cur, 0, sizeof cur);
for (long long j = 1; j <= n; ++j) {
for (long long x = 1; x <= m; ++x) {
if (s[j - 1] == t[x - 1]) cur[j][x] = 1 + cur[j - 1][x - 1];
}
}
for (long long j = 1; j <= n; ++j) {
for (long long x = 1; x <= m; ++x) {
long long len = cur[j][x];
dp[i][j][x] = max({len + dp[i - 1][j - len][x - len], dp[i][j - 1][x],
dp[i][j][x - 1]});
}
}
}
cout << dp[k][n][m] << '\n';
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
;
long long t = 1;
while (t--) solve();
}
| 1,900 | CPP |
a=input()
c=0
s=0
n=0
i=0
while((c==0 or s==0 or n==0) and i<len(a)):
if(a[i]>='A' and a[i]<='Z'):
c=1
if(a[i]>='a' and a[i]<='z'):
s=1
if(a[i]>='0' and a[i]<='9'):
n=1
i=i+1
if(c==0 or s==0 or n==0 or len(a)<5):
print("Too weak")
else:
print("Correct") | 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, d[60], f[60][60], c[60][60], ans[60][60][60], res, dp[60][60][60], x, y,
z, crs, pp[60], qq[60];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%d", &d[i]);
for (int i = 0; i <= n; i++) c[i][0] = 1;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % 1000000007;
pp[0] = 1;
for (int i = 1; i <= n; i++) pp[i] = 1LL * pp[i - 1] * i % 1000000007;
qq[0] = 1;
for (int i = 1; i <= n; i++)
qq[i] = 1LL * qq[i - 1] * ((1000000007 + 1) / 2) % 1000000007;
f[0][0] = 1;
for (int i = 2; i <= n; i++)
f[i][0] = 1LL * f[i - 2][0] * (i - 1) % 1000000007;
for (int j = 1; j <= n; j++) {
for (int i = 0; i <= n; i++) {
if (!i) {
if (j >= 3) f[0][j] = 1LL * c[j - 1][2] * f[2][j - 3] % 1000000007;
} else {
if (i >= 2) {
f[i][j] = 1LL * i * (j - 1) * f[i][j - 2] % 1000000007;
f[i][j] = (f[i][j] + 1LL * f[i - 2][j - 1] * c[i][2] % 1000000007) %
1000000007;
f[i][j] =
(f[i][j] + 1LL * f[i + 2][j - 3] * c[j - 1][2] % 1000000007) %
1000000007;
}
}
}
}
for (int l = 0; l <= n; l++)
for (int i = 0; i <= n; i++)
for (int j = 0; j <= n; j++) {
for (int s = 0; 2 * s <= l && s <= j; s++) {
for (int t = 0; 2 * s + t <= l && t <= i; t++) {
if (l - s - t > j)
continue;
else {
z = 1LL * c[i][t] * c[j][s] % 1000000007;
z = 1LL * z * c[j - s][l - 2 * s - t] % 1000000007;
z = 1LL * z * f[i + l - 2 * s - 2 * t][j + s + t - l] %
1000000007;
z = 1LL * z * pp[l] % 1000000007;
z = 1LL * z * qq[s] % 1000000007;
ans[i][j][l] += z;
ans[i][j][l] %= 1000000007;
}
}
}
}
dp[1][1][d[1]] = 1;
for (int i = 2; i <= n; i++) {
for (int j = i; j <= n; j++) {
x = 0, y = 0;
for (int s = i; s <= j; s++) {
if (d[s] == 2)
x++;
else
y++;
}
for (int l = 0; l <= n; l++) {
crs = ans[x][y][l];
z = 0;
for (int po = i - 1; po >= 1; po--) {
z += dp[po][i - 1][j - i + 1];
z %= 1000000007;
}
dp[i][j][l] = 1LL * z * crs % 1000000007;
}
}
}
for (int i = 1; i <= n; i++) res = (res + dp[i][n][0]) % 1000000007;
printf("%d", res);
}
| 2,600 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 5005;
int cnt[27][27][N];
int main() {
srand(time(NULL));
string s;
cin >> s;
int n = int(s.size());
s = s + s;
for (int i = 0; i < n; i++)
for (int dis = 1; dis < n; dis++)
cnt[int(s[i] - 'a')][int(s[i + dis] - 'a')][dis]++;
int ans = 0;
for (int x = 0; x < 26; x++) {
int curans = 0;
for (int dis = 1; dis < n; dis++) {
int cntA = 0;
for (int y = 0; y < 26; y++)
if (cnt[x][y][dis] == 1) cntA++;
if (cntA > curans) curans = cntA;
}
ans += curans;
}
printf("%.9lf", double(ans) / double(n));
return 0;
}
| 1,600 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x1, x2, y1, y2;
cin >> x1 >> y1 >> x2 >> y2;
int x3 = abs(x2 - x1);
int y3 = abs(y2 - y1);
int r = min(x3, y3);
r += max(x3, y3) - r;
cout << r;
}
| 800 | CPP |
n, p, k = [int(x) for x in input().split()]
start = p-k if p-k > 0 else 1
end = p+k if p+k < n else n
if start != 1:
print('<< ', end='')
for i in range(start, end+1):
if i == p:
print(f'({p}) ', end='')
else:
print(f'{i} ', end='')
if end != n:
print('>>', end='')
| 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, l, d;
cin >> n >> d >> l;
int odd = (n + 1) / 2, even = n / 2;
if (odd > d + (l * even) || odd * l < d + even) {
cout << "-1";
return 0;
}
int *arr = new int[n + 1];
for (int i = 0; i < n + 1; i++) arr[i] = 1;
if (odd < d + even) {
int val = abs(odd - d - even), i = 1;
while (val > 0) {
if (arr[i] == l) {
i += 2;
} else {
arr[i]++;
val--;
}
}
} else if (odd > d + even) {
int val = odd - d - even, i = 2;
while (val > 0) {
if (arr[i] == l) {
i += 2;
} else {
arr[i]++;
val--;
}
}
}
for (int i = 1; i < n + 1; i++) {
cout << arr[i] << " ";
}
return 0;
}
| 1,500 | CPP |
a=int(input())
print("YES" if (not(a%2) and a>3) else "NO") | 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
namespace jyy {
const int mod = 998244353, N = 600010;
const double eps = 1e-8;
inline int read() {
static int x = 0, f = 1;
x = 0, f = 1;
static char ch = getchar();
while (ch < '0' || ch > '9') {
(ch == '-') ? f *= -1 : f;
ch = getchar();
}
while (ch >= '0' && ch <= '9') x = x * 10 + int(ch - 48), ch = getchar();
return x * f;
}
inline void fw(int x) {
if (x < 0) putchar('-'), x = -x;
x >= 10 ? fw(x / 10), 1 : 0;
putchar(char(x % 10 + 48));
}
inline int qmo(int x) { return x + ((x >> 31) & mod); }
inline int ksm(int x, int y) {
int tmp = 1;
for (; y; y >>= 1, x = 1ll * x * x % mod)
if (y & 1) tmp = 1ll * tmp * x % mod;
return tmp;
}
inline int inv(int x) { return ksm(x, mod - 2); }
int tot, head[N], fa[N];
struct edge {
int to, next;
} dat[N * 2];
void add_edge(int x, int y) { dat[++tot] = (edge){y, head[x]}, head[x] = tot; }
inline int find(int x) { return fa[x] ? fa[x] = find(fa[x]) : x; }
inline int merge(int x, int y) {
return find(x) != find(y) ? fa[find(x)] = find(y), 0 : 1;
}
inline int low(int x) { return x & -x; }
int ifac[N], fac[N];
inline void init(int x) {
fac[0] = ifac[0] = 1;
for (int i = 1; i <= x; i++) fac[i] = 1ll * fac[i - 1] * i % mod;
ifac[x] = inv(fac[x]);
for (int i = x - 1; i >= 1; i--) ifac[i] = 1ll * ifac[i + 1] * (i + 1) % mod;
}
inline int C(int x, int y) {
return (x < y || y < 0 || x < 0)
? 0
: 1ll * fac[x] * ifac[y] % mod * ifac[x - y] % mod;
}
} // namespace jyy
using namespace jyy;
int pd[N], n, R[N], a[N], vis[N], dep[N], m, b[N];
char c[N];
void dfs(int x, int f) {
vis[x] = 1;
dep[x] = dep[f] + 1;
fa[x] = f;
for (int i = head[x]; i; i = dat[i].next) {
int t = dat[i].to;
if (t == f || vis[t]) continue;
dfs(t, x);
}
}
void work(int x, int y) {
deque<int> q1, q2;
while (dep[x] > dep[y]) q1.push_back(x), x = fa[x];
while (dep[x] < dep[y]) q2.push_front(y), y = fa[y];
while (x != y) q1.push_back(x), q2.push_front(y), x = fa[x], y = fa[y];
q1.push_back(x);
cout << q1.size() + q2.size() << endl;
while (q1.size()) printf("%d ", q1.front()), q1.pop_front();
while (q2.size()) printf("%d ", q2.front()), q2.pop_front();
puts("");
}
void solve() {
n = read(), m = read();
for (int i = 1, x, y; i <= m; i++)
x = read(), y = read(), add_edge(x, y), add_edge(y, x);
dfs(1, 0);
int q = read();
for (int i = 1; i <= q; i++) {
a[i] = read(), b[i] = read();
pd[a[i]] ^= 1;
pd[b[i]] ^= 1;
}
int cnt = 0;
for (int i = 1; i <= n; i++) cnt += pd[i];
if (cnt) {
puts("NO");
cout << cnt / 2 << endl;
return;
}
puts("YES");
for (int i = 1; i <= q; i++) {
work(a[i], b[i]);
}
}
int main() {
int T = 1;
while (T--) solve();
}
| 2,200 | CPP |
#include <bits/stdc++.h>
using namespace std;
vector<int> v[100001];
int c[100001];
int n;
int m;
int dsu[100001];
int F(int x) {
if (dsu[x] < 0)
return x;
else {
dsu[x] = F(dsu[x]);
return dsu[x];
}
}
void U(int x, int y) {
x = F(x);
y = F(y);
if (x == y) return;
if (dsu[x] < dsu[y]) swap(x, y);
dsu[x] += dsu[y];
dsu[y] = x;
}
bool as = false;
void topo(int q) {
c[q] = 1;
for (int i = 0; i < v[q].size(); ++i) {
if (!c[v[q][i]]) {
topo(v[q][i]);
} else if (c[v[q][i]] == 1) {
as = true;
}
}
c[q] = -1;
}
vector<int> be[100001];
int main() {
ios_base::sync_with_stdio(false);
cin >> n >> m;
for (int i = 1; i <= n; ++i) dsu[i] = -1;
for (int i = 1; i <= m; ++i) {
int x, y;
cin >> x >> y;
U(x, y);
v[x].push_back(y);
}
int cur = 0;
for (int i = 1; i <= n; ++i) {
be[F(i)].push_back(i);
}
for (int j = 1; j <= n; ++j) {
if (!be[j].size()) continue;
for (int i = 0; i < be[j].size(); ++i) {
if (!c[be[j][i]]) topo(be[j][i]);
}
cur += (-dsu[F(be[j][0])]);
if (!as) --cur;
as = false;
}
cout << cur;
}
| 2,200 | CPP |
a = [int(n) for n in input().split()]
print(max(0,int((((a[2]*(a[2]+1))/2)*a[0])-a[1]))) | 800 | PYTHON3 |
n=int(input())
num=[int(x) for x in input()]
ok=1
for i in num:
if i==4 or i==7:
pass
else:
ok=0
s1=0
s2=0
for i in range(0,n//2):
s1+=num[i]
for i in range(n//2,n):
s2+=num[i]
if s1!=s2:
ok=0
if ok==1:
print("YES")
else:
print("NO") | 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e3, MOD = (1e9) + 7;
int n, m, k, A[N + 9][N + 9], row[N + 9], col[N + 9], x, y;
char c;
void init() {
for (int i = 0; i < N + 5; ++i) row[i] = col[i] = i;
}
int main() {
scanf("%d%d%d", &n, &m, &k);
init();
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= m; ++j) scanf("%d", &A[i][j]);
}
for (int i = 0; i < k; ++i) {
cin.ignore();
scanf("%c %d %d", &c, &x, &y);
switch (c) {
case 'c':
swap(col[x], col[y]);
break;
case 'r':
swap(row[x], row[y]);
break;
case 'g':
printf("%d\n", A[row[x]][col[y]]);
}
}
return 0;
}
| 1,300 | CPP |
name=len({*input()})
if name%2 == 0:
print("CHAT WITH HER!")
else:
print("IGNORE HIM!")
| 800 | PYTHON3 |
n, m, sx, sy = map(int,input().split())
print(sx,'',sy)
x = sx
y = sy
for i in range(1,sy):
print(sx,'',sy-i)
for i in range(sy+1,m+1):
print(sx,'',i)
for i in range(1,sx):
x = sx-i
for j in range(1,m+1):
y = 0
if i%2==1:
y = m+1-j
else:
y = j
print(x,'',y)
st = 0
if sx%2==0:
st = 0
else:
st = 1
for i in range(sx+1,n+1):
x = i
for j in range(1,m+1):
y = 0
if st%2==0:
y = j
else:
y = m+1-j
print(x,'',y)
st+=1
| 1,100 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
constexpr int inf = 1e9;
constexpr int N = 3000 + 5;
void solve() {
int n;
cin >> n;
vector<int> arr(n);
for (int i = 0; i < n; i++) cin >> arr[i];
auto get = [&](int curr, int last) {
int best = 1e9;
if (curr >= last) best = curr;
int prev = 0, f = 1000;
for (int i = 0; i < 4; i++) {
for (int j = 0; j < 10; j++) {
int now = prev + (curr % f) + (j * f);
if (now >= last) best = min(best, now);
}
prev = curr - curr % f;
f /= 10;
}
return best;
};
arr[0] = get(arr[0], 1000);
if (arr[0] == inf) {
cout << "No solution\n";
return;
}
for (int i = 1; i < n; i++) {
arr[i] = get(arr[i], arr[i - 1]);
if (arr[i] == inf) {
cout << "No solution\n";
return;
}
}
if (arr[n - 1] > 2011) {
cout << "No solution\n";
return;
}
for (int a : arr) cout << a << "\n";
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
;
std::cout << std::fixed << std::setprecision(20);
;
int t = 1;
for (int i = 1; i <= t; i++) {
solve();
}
}
| 1,700 | CPP |
for _ in range(int(input())):
n=int(input())
l=list(map(int,input().split()))
s=0
for i in l:
if i%2==0:
s+=1
if s==n:
print("YES")
else:
print("NO") | 800 | PYTHON3 |
kl = int(input())
for l in range(kl):
n = int(input())
# a=[[0 for j in range(n+1)] for i in range(n)]
N = set(range(1, n + 1))
G = set(range(1, n + 1))
for kn in range(n):
sc, pr = 0, 0
for i in input().split():
sc += 1
if sc == 1 or pr:
continue
if int(i) in G:
pr = 1
G.remove(int(i))
N.remove(kn + 1)
if len(G) > 0:
print('IMPROVE')
for i in N:
print(i, '', end='')
break
for i in G:
print(i)
break
else:
print('OPTIMAL') | 1,200 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 3010;
int n = 0, m;
int p[maxn], c[maxn];
vector<int> vec[maxn];
int cnt[maxn];
bool cmp(int x, int y) { return c[x] < c[y]; }
int vis[maxn];
vector<pair<int, int> > v;
int main() {
long long Ans = 1e18;
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) {
scanf("%d%d", &p[i], &c[i]);
v.push_back(make_pair(c[i], p[i]));
}
sort(v.begin(), v.end());
for (int i = 1; i <= n; i++) {
p[i] = v[i - 1].second;
c[i] = v[i - 1].first;
vec[p[i]].push_back(i);
}
for (int i = 1; i <= m; i++) sort(vec[i].begin(), vec[i].end(), cmp);
for (int i = 1; i <= n; i++) {
long long ans = 0;
for (int j = 1; j <= m; j++) cnt[j] = 0;
for (int j = 1; j <= n; j++) vis[j] = 0;
for (int j = 1; j <= n; j++) cnt[p[j]]++;
for (int j = 2; j <= m; j++) {
int tmp = 0;
while (cnt[j] >= i) {
cnt[j]--;
vis[vec[j][tmp]] = 1;
ans += c[vec[j][tmp]];
++cnt[1];
++tmp;
}
}
for (int j = 1; j <= n; j++) {
if (p[j] == 1) continue;
if (!vis[j]) {
if (cnt[1] < i) {
cnt[1]++;
ans += c[j];
}
}
}
if (cnt[1] >= i) {
Ans = min(Ans, ans);
}
}
cout << Ans << endl;
return 0;
}
| 1,700 | CPP |
n = int(input())
a = list(map(int, input().split()))
m = max(a)
ls = 0
mx = 0
for i, e in enumerate(a):
if a[ls] != e:
ls = i
if e == m:
mx = max(mx, i - ls + 1)
print(mx)
| 1,100 | PYTHON3 |
for ii in range(int(input())):
n=int(input())
a = sorted(list(map(int, input().split())))
co,di,x=0,0,0
for jj in range(2,n):
di+=a[jj-2]
x+=di
co-=a[jj]*(jj-1)
print(co+x) | 1,400 | PYTHON3 |
b=int(input())
g=int(input())
n=int(input())
if n>b and n>g:
x=b+g-n
print(x+1)
else:
print(min(b,g,n)+1) | 1,100 | PYTHON3 |
n=int(input())
if(n%4==1):
print(0,"A")
if(n%4==2):
print(1,"B")
if(n%4==0):
print(1,"A")
if(n%4==3):
print(2,"A") | 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1005;
long long query(int t, int i, int j, int k) {
long long ret = 0;
printf("%d %d %d %d\n", t, i, j, k);
fflush(stdout);
scanf("%lld", &ret);
return ret;
}
long long Sign[N], Sqr[N], Sign2[N], Pri[N];
long long Pos[N], Neg[N];
int tmpp[N];
int n, ptot = 1, ntot = 1;
bool cmp(const int AA, const int BB) {
if (Pri[AA] != Pri[BB]) return Pri[AA] < Pri[BB];
if (Pri[AA] & 1) return Sqr[AA] < Sqr[BB];
return Sqr[AA] > Sqr[BB];
}
int main() {
scanf("%d", &n);
for (int i = 3; i <= n; i++) Sign[i] = query(2, 1, 2, i);
for (int i = 3; i <= n; i++) Sqr[i] = query(1, 1, 2, i);
long long PosMax = 0ll, NegMax = 0ll, pmax = 0, nmax = 0;
for (int i = 3; i <= n; i++) {
if (Sign[i] == 1 && Sqr[i] > PosMax) pmax = i, PosMax = Sqr[i];
if (Sign[i] == -1 && Sqr[i] > NegMax) nmax = i, NegMax = Sqr[i];
}
if (PosMax) {
for (int i = 3; i <= n; i++) {
if (Sign[i] == 1 && i != pmax) {
int tmp = (int)query(2, pmax, 1, i);
if (tmp == -1)
Pri[i] = 4;
else
Pri[i] = 3;
}
}
Pri[pmax] = 4;
}
if (NegMax) {
for (int i = 3; i <= n; i++) {
if (Sign[i] == -1 && i != nmax) {
int tmp = (int)query(2, nmax, 1, i);
if (tmp == -1)
Pri[i] = 2;
else
Pri[i] = 1;
}
}
Pri[nmax] = 1;
}
Pri[1] = 1, Pri[2] = 3;
for (int i = 1; i <= n; i++) tmpp[i] = i;
sort(tmpp + 1, tmpp + n + 1, cmp);
printf("0");
for (int i = 1; i <= n; i++) printf(" %d", tmpp[i]);
puts("");
return 0;
}
| 2,300 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 7;
const int inf = 0x3f3f3f3f;
const long long INF = 0x3f3f3f3f3f3f3f3f;
const int mod = 1e9 + 7;
const double eps = 1e-8;
const double PI = acos(-1);
template <class T, class S>
inline void add(T& a, S b) {
a += b;
if (a >= mod) a -= mod;
}
template <class T, class S>
inline void sub(T& a, S b) {
a -= b;
if (a < 0) a += mod;
}
template <class T, class S>
inline bool chkmax(T& a, S b) {
return a < b ? a = b, true : false;
}
template <class T, class S>
inline bool chkmin(T& a, S b) {
return a > b ? a = b, true : false;
}
struct Bit {
long long a[N];
void init() { memset(a, 0, sizeof(a)); }
void modify(int x, int v) {
for (int i = x; i < N; i += i & -i) a[i] += v;
}
long long sum(int x) {
long long ans = 0;
for (int i = x; i; i -= i & -i) ans += a[i];
return ans;
}
long long query(int L, int R) {
if (L > R) return 0;
return sum(R) - sum(L - 1);
}
};
int n, a[N];
Bit bit;
long long totinv;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
totinv += bit.query(a[i] + 1, n);
bit.modify(a[i], 1);
}
bit.init();
long long ret1 = 0, ret2 = 0;
for (long long i = 1; i <= n; i++) {
ret1 += (n - i + 1) * bit.query(a[i] + 1, n);
bit.modify(a[i], i);
}
double tmp1 = 2.0 * ret1 / n / (n + 1);
for (long long i = 1; i <= n; i++) {
long long cnt = n - i + 1;
ret2 += i * (i - 1) / 2 * cnt;
}
double tmp2 = 1.0 * ret2 / n / (n + 1);
printf("%.12f\n", totinv - tmp1 + tmp2);
return 0;
}
| 2,400 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9;
int main() {
int n, k;
scanf("%d %d", &n, &k);
vector<int> a(n);
vector<int> next(n, inf);
vector<int> p(n, -1);
for (int i = 0; i < n; ++i) {
scanf("%d", &a[i]);
--a[i];
if (p[a[i]] != -1) {
next[p[a[i]]] = i;
}
p[a[i]] = i;
}
set<pair<int, int>> q;
set<int> q2;
int ans = 0;
for (int i = 0; i < n; ++i) {
int cur = a[i];
if (q2.find(cur) != q2.end()) {
q2.erase(cur);
q.erase({-i, cur});
} else
++ans;
if (q2.size() >= k) {
int v = q.begin()->second;
q2.erase(v);
q.erase(q.begin());
}
q2.insert(cur);
q.insert({-next[i], cur});
}
printf("%d", ans);
return 0;
}
| 1,800 | CPP |
from itertools import count
import sys
from array import array # noqa: F401
import typing as Tp # noqa: F401
def input():
return sys.stdin.buffer.readline().decode('utf-8')
def output(*args):
sys.stdout.buffer.write(
('\n'.join(map(str, args)) + '\n').encode('utf-8')
)
def main():
from collections import Counter
t = int(input())
ans_a = [''] * t
for ti in range(t):
n = int(input())
a = list(map(int, input().split()))
cnt = Counter(a)
ans = sum(v * (v - 1) * (v - 2) * (v - 3) // 24 for v in cnt.values() if v >= 4)
for i in range(n - 1):
left = [0] * (n + 1)
pair = 0
for j in range(i + 1, n):
if a[j] != a[i]:
pair -= left[a[j]] * (cnt[a[j]] - left[a[j]])
left[a[j]] += 1
pair += left[a[j]] * (cnt[a[j]] - left[a[j]])
else:
ans += pair
cnt[a[i]] -= 1
ans_a[ti] = str(ans)
output(*ans_a)
if __name__ == '__main__':
main()
| 1,900 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const long long maxn = 4194305;
long long d[maxn];
unordered_set<long long> p;
long long sl(long long m) {
if (d[m]) return 0;
d[m] = 1;
long long m2 = 0;
for (long long i = 0; i < 22; i++) {
if ((1LL << i) & m) sl(m - (1LL << i));
if (!((1LL << i) & m)) m2 |= (1LL << i);
}
if (p.find(m) != p.end()) sl(m2);
return 0;
}
int main(void) {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long n, m, c = 0;
cin >> n >> m;
std::vector<long long> v(m);
for (long long i = 0; i < m; i++) cin >> v[i];
for (long long i = 0; i < m; i++) p.insert(v[i]);
for (long long i = 0; i < m; i++) {
c += (!d[v[i]]);
sl(v[i]);
}
cout << c << '\n';
}
| 2,500 | CPP |
import sys
sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def SI(): return sys.stdin.readline()[:-1]
def main():
def ok(aa):
mn=min(aa)
for a in aa:
if (a-mn)&1:return False
return True
t=II()
for _ in range(t):
II()
if ok(LI()):print("YES")
else:print("NO")
main() | 900 | PYTHON3 |
def cipher(s,le):
s2=""
i=1
x=0
while(x<le):
s2+=s[x]
x=x+i
i+=1
print(s2)
l=int(input())
a=input()
cipher(a,l)
| 800 | PYTHON3 |
n = int(input())
mn = 1e12
mx = 0
for i in input().split(" "):
a = int(i)
if a < mn:
mn = a
if a > mx:
mx = a
print(mx - mn + 1 - n)
| 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 7;
bool Prime[N];
int p[N >> 3], mu[N], tot;
void minit(int x) {
mu[1] = 1;
for (int i = 2, iE = x; i <= iE; i++) {
if (!Prime[i]) p[++tot] = i, mu[i] = -1;
for (int j = 1; p[j] * i <= x && j <= tot; j++) {
Prime[p[j] * i] = 1;
if (i % p[j] == 0) {
mu[i * p[j]] = 0;
break;
}
mu[i * p[j]] = -mu[i];
}
}
}
long long n, f[N], ans;
long double qpow(long double x, int y) {
long double res = 1;
for (; y; x = x * x, y >>= 1)
if (y & 1) res *= x;
return res;
}
long long get(int x) {
long long l = floor(pow(n, 1.0L / x)) - 1, mid = l + 1, r = l + 2;
if (qpow(r, x) <= (long double)n) return r;
if (qpow(mid, x) <= (long double)n) return mid;
return l;
}
void Main() {
ans = 0;
scanf("%lld", &n);
for (int i = 59, iE = 1; i >= iE; i--) f[i] = get(i) - 1, ans += f[i] * mu[i];
printf("%lld\n", ans);
}
int main() {
minit(1111);
int T;
scanf("%d", &T);
while (T--) Main();
return 0;
}
| 2,400 | CPP |
s=input()
ref='hello'
ini=0
flag=0
for i in s:
if i=='h' and ini==0:
rp=1
ini=1
if ini==1 and i==ref[rp]:
if rp+1<=4:rp+=1
if ini==1 and (rp==4 and ref[rp]==i):
print('YES')
flag=1
break
if flag==0:
print('NO') | 1,000 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long n, x[2], y[2], res;
struct line {
long long s, a, b;
};
vector<line> dir1, dir2;
bitset<5002> B[5001];
bool is_cut(line x, line y) {
return x.a <= y.s && y.s <= x.b && y.a <= x.s && x.s <= y.b;
}
void Solve() {
cin >> n;
for (long long j = 1, _b = n; j <= _b; j++) {
for (long long i = 0, _b = 2; i < _b; i++) cin >> x[i] >> y[i];
if (x[0] == x[1])
dir1.push_back({x[0], min(y[0], y[1]), max(y[0], y[1])});
else
dir2.push_back({y[0], min(x[0], x[1]), max(x[0], x[1])});
}
if (dir1.size() > dir2.size()) swap(dir1, dir2);
for (long long i = 0, _b = dir1.size(); i < _b; i++)
for (long long j = 0, _b = dir2.size(); j < _b; j++) {
B[i].set(j, is_cut(dir1[i], dir2[j]));
}
for (long long i = 0, _b = dir1.size(); i < _b; i++)
for (long long j = 0, _b = i; j < _b; j++) {
long long tmp = (B[i] & B[j]).count();
res += tmp * (tmp - 1) / 2;
}
cout << res;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int Test_numbers = 1;
while (Test_numbers--) Solve();
return 0;
}
| 2,200 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, m;
int a[1111];
int b[1111];
int c[1111];
int vis[1111];
int pos[5];
int cntp;
int main() {
scanf("%d", &n);
bool flag = 0;
for (int i = 1; i <= n; ++i) {
scanf("%d", &a[i]);
vis[a[i]]++;
}
for (int i = 1; i <= n; ++i) {
scanf("%d", &b[i]);
if (a[i] != b[i]) {
pos[++cntp] = i;
}
}
int dvis;
for (int i = 1; i <= n; ++i)
if (!vis[i]) {
dvis = i;
break;
}
if (cntp == 1) {
a[pos[1]] = dvis;
} else {
if (b[pos[1]] == dvis && vis[a[pos[1]]] > 1)
a[pos[1]] = dvis;
else
a[pos[2]] = dvis;
}
for (int i = 1; i <= n; ++i) printf("%d ", a[i]);
return 0;
}
| 1,300 | CPP |
# TAIWAN NUMBER ONE!!!!!!!!!!!!!!!!!!!
# TAIWAN NUMBER ONE!!!!!!!!!!!!!!!!!!!
# TAIWAN NUMBER ONE!!!!!!!!!!!!!!!!!!!
# TAIWAN NUMBER ONE!!!!!!!!!!!!!!!!!!!
# TAIWAN NUMBER ONE!!!!!!!!!!!!!!!!!!!
# TAIWAN NUMBER ONE!!!!!!!!!!!!!!!!!!!
# TAIWAN NUMBER ONE!!!!!!!!!!!!!!!!!!!
from sys import stdin, stdout
import collections
#T = int(input())
#s = input()
N = int(input())
arr = [int(x) for x in stdin.readline().split()]
seq = collections.Counter(arr)
seq = list(seq.values())
seq.sort(reverse=True)
L = 0
first = 0
res = 0
for i in range(len(seq)):
if i==0:
L = 1
first = seq[i]
else:
if first==1:
break
if seq[i]>=first//2:
L += 1
first = first//2
else:
#break
L += 1
first = seq[i]
s = first*(2**L-1)
#print(s)
res = max(res,s)
print(res) | 1,800 | PYTHON3 |
#https://codeforces.com/problemset/problem/721/A
num_squares = int(input())
values = input()
answer = ""
counter = 0
row_counter = 0
for current_index in range(num_squares):
if values[current_index] == "B":
counter += 1
elif counter > 0:
answer += str(counter) + " "
row_counter += 1
counter = 0
if counter > 0:
row_counter += 1
answer += str(counter)
print (row_counter)
print (answer)
| 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
vector<int> dis[200005];
long long ans[200005];
long long num[200005 << 2];
int value[200005];
int pos[200005];
int n;
struct node {
int l, r, pos;
bool operator<(node temp) const { return r < temp.r; }
} data[200005];
inline int lowbit(int x) { return x & (-x); }
inline void update(int x, int v) {
while (x > 0) {
num[x] += v;
x -= lowbit(x);
}
}
inline long long query(int x) {
long long ans = 0;
while (x <= n) {
ans += num[x];
x += lowbit(x);
}
return ans;
}
int main() {
int m;
cin >> n >> m;
for (int i = 1; i <= n; i++) {
scanf("%d", &value[i]);
pos[value[i]] = i;
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j * j <= value[i]; j++) {
if (value[i] % j == 0) {
if (pos[j] <= pos[value[i]]) dis[value[i]].push_back(j);
if (value[i] != j && pos[value[i]] <= pos[j])
dis[j].push_back(value[i]);
if (j * j == value[i]) continue;
int k = value[i] / j;
if (pos[k] <= pos[value[i]]) dis[value[i]].push_back(k);
if (value[i] != k && pos[value[i]] <= pos[k])
dis[k].push_back(value[i]);
}
}
}
for (int i = 0; i < m; i++) {
scanf("%d%d", &data[i].l, &data[i].r);
data[i].pos = i;
}
sort(data, data + m);
int p = 0;
for (int i = 1; i <= n; i++) {
int len = dis[value[i]].size();
for (int j = 0; j < len; j++) {
int k = dis[value[i]][j];
update(pos[k], 1);
}
while (data[p].r == i && p < m) {
ans[data[p].pos] = query(data[p].l);
p++;
}
}
for (int i = 0; i < m; i++) {
printf("%I64d\n", ans[i]);
}
}
| 2,200 | CPP |
n,m,k=map(int,input().split())
p=list(map(int,input().split()))
s=list(map(int,input().split()))
c=list(map(int,input().split()))
d=[]
count=0
y=0
for i in range(m):
ma=0
for j in range(n):
if s[j]==i+1:
if p[j]>ma:
ma=p[j]
y=j
d.append(y+1)
for i in c:
if i not in d:
count+=1
print(count)
| 1,100 | PYTHON3 |
import sys,bisect
from sys import stdin,stdout
def li():
return list(map(int,stdin.readline().split()))
def mp():
return map(int,stdin.readline().split())
def solve():
n,m=mp()
d={i:[] for i in range(1,n+1)}
for _ in range(m):
l=li()
x=l[0]
if x>1:
for i in range(1,x):
d[l[i]].append(l[i+1])
d[l[i+1]].append(l[i])
ans=[-1 for i in range(n+1)]
vi=[-1 for i in range(n+1)]
for i in range(1,n+1):
if vi[i]==-1:
vi[i]=i
stack=[i]
ans[i]=1
while stack:
a=stack.pop()
for x in d[a]:
if vi[x]==-1:
ans[i]+=1
vi[x]=i
stack.append(x)
print(' '.join((str(ans[vi[i]]) for i in range(1,n+1))))
for _ in range(1):
solve()
| 1,400 | PYTHON3 |
#include <bits/stdc++.h>
struct Mock {
Mock(int n, const std::string &s) : n(n), s(s) {}
std::vector<std::string> ask(int l, int r) {
if (l > r) {
return {};
}
std::vector<std::string> substrings;
for (int i = l - 1; i < r; ++i) {
for (int j = 1; i + j <= r; ++j) {
auto ss = s.substr(i, j);
std::shuffle(ss.begin(), ss.end(), gen);
substrings.push_back(ss);
}
}
std::shuffle(substrings.begin(), substrings.end(), gen);
return substrings;
}
void out(const std::string &t) { assert(s == t); }
int n;
private:
std::string s;
std::mt19937 gen;
};
struct IO {
IO() { scanf("%d", &n); }
std::vector<std::string> ask(int l, int r) {
if (l > r) {
return {};
}
printf("? %d %d\n", l, r);
fflush(stdout);
std::vector<char> buf(r - l + 2);
std::vector<std::string> substrings;
int size = (r - l + 2) * (r - l + 1) / 2;
for (int i = 0; i < size; ++i) {
scanf("%s", buf.data());
substrings.push_back(buf.data());
}
return substrings;
}
void out(const std::string &t) {
printf("! %s\n", t.c_str());
fflush(stdout);
}
int n;
};
static const int C = 26;
using Count = std::array<int, C>;
Count toCount(const std::string &s) {
Count result;
memset(result.data(), 0, sizeof(result));
for (char c : s) {
result[c - 'a']++;
}
return result;
}
template <typename IO>
std::string solve(IO &io) {
int n = io.n;
if (n == 1) {
return io.ask(1, 1)[0];
}
int n2 = n >> 1;
std::vector<int> s(n, 0);
{
std::map<Count, int> halfs;
for (auto &&s : io.ask(1, n2)) {
halfs[toCount(s)]++;
}
for (auto &&s : io.ask(2, n2)) {
halfs[toCount(s)]--;
}
std::vector<std::pair<int, Count>> counts;
for (auto &&kv : halfs) {
if (kv.second) {
int size = 0;
for (int c : kv.first) {
size += c;
}
counts.emplace_back(size, kv.first);
}
}
std::sort(counts.begin(), counts.end());
assert(static_cast<int>(counts.size()) == n2);
for (int i = 0; i < n2; ++i) {
auto count = counts[i].second;
for (int j = 0; j < i; ++j) {
count[s[j]]--;
}
while (!count[s[i]]) {
s[i]++;
}
}
}
{
std::vector<Count> counts(n + 1);
for (auto &&s : io.ask(1, n)) {
auto count = toCount(s);
for (int j = 0; j < C; ++j) {
counts[s.length()][j] += count[j];
}
}
for (int i = n + 1 >> 1; i >= 1; --i) {
auto count = counts[i];
for (int j = 0; j < C; ++j) {
count[j] -= counts[i - 1][j];
}
int left = i - 1, right = n - i;
for (int j = left; j < right; ++j) {
count[s[j]]--;
}
while (!count[s[right]]) {
s[right]++;
}
}
}
std::string buf(n, ' ');
for (int i = 0; i < n; ++i) {
buf[i] = 'a' + s[i];
}
return buf;
}
int main() {
IO io;
io.out(solve(io));
}
| 2,800 | CPP |
import sys
def input():
return sys.stdin.readline().rstrip()
def input_split():
return [int(i) for i in input().split()]
testCases = int(input())
answers = []
for _ in range(testCases):
#take input
n = int(input())
arr = input_split()
x,y,z = arr[0], arr[1], arr[-1]
if x +y > z:
ans = -1
else:
ans = "1 2 {}".format(n)
answers.append(ans)
print(*answers, sep = '\n')
| 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, m, g[110][110], minR[110], c[110];
bool solve() {
for (int j = 1, st; j <= m; j++) {
st = g[1][j] - minR[1];
for (int i = 1; i <= n; i++) {
if (st != g[i][j] - minR[i]) return false;
}
c[j] = st;
}
return true;
}
int main() {
memset(minR, 0x3f, sizeof(minR));
scanf("%d %d", &n, &m);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) {
scanf("%d", &g[i][j]);
minR[i] = min(minR[i], g[i][j]);
}
if (solve() == false)
printf("-1");
else {
if (n > m) {
int tmp = 0x3f3f3f3f;
for (int i = 1; i <= n; i++) tmp = min(tmp, minR[i]);
for (int i = 1; i <= n; i++) minR[i] -= tmp;
for (int j = 1; j <= m; j++) c[j] += tmp;
}
int cnt = 0;
for (int i = 1; i <= n; i++) cnt += minR[i];
for (int j = 1; j <= m; j++) cnt += c[j];
printf("%d\n", cnt);
for (int i = 1; i <= n; i++)
for (int k = 0; k < minR[i]; k++) printf("row %d\n", i);
for (int j = 1; j <= m; j++)
for (int k = 0; k < c[j]; k++) printf("col %d\n", j);
}
}
| 1,700 | CPP |
n,k=[int(i) for i in input().split()]
z=n+n-1+n+1
if k>n-k:
print(z+n-k)
else:
print(z+k-1)
| 1,000 | PYTHON3 |
t = input()
m = list(map(int, input().split()))
m.sort()
i, j = 0, 1
current_max = 0
while i < len(m) - 1 and j < len(m):
if abs(m[i] - m[j]) <= 5:
j += 1
else:
if j - i> current_max:
current_max = j - i
i += 1
j -= 1
if j <= i:
j = i + 1
if j - i>= len(m) - i:
break
if j - i > current_max:
current_max = j - i
print(current_max)
| 1,200 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
string s[N];
int c[N];
bool isPalindrome[N];
priority_queue<int> pq[N];
int k, n;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> k >> n;
vector<string> zip;
for (int(i) = (1); (i) <= (k); ++(i)) {
cin >> s[i] >> c[i];
zip.push_back(s[i]);
}
sort(zip.begin(), zip.end());
zip.resize(unique(zip.begin(), zip.end()) - zip.begin());
vector<string> revZIP;
for (auto u : zip) {
reverse(u.begin(), u.end());
revZIP.push_back(u);
reverse(u.begin(), u.end());
}
for (int(i) = (1); (i) <= (k); ++(i)) {
int pos = lower_bound(zip.begin(), zip.end(), s[i]) - zip.begin();
pq[pos].push(c[i]);
}
long long res = 0, minNeg = 0, maxCore = 0;
for (int i = 0; i < zip.size(); ++i) {
if (zip[i] == revZIP[i]) {
while (pq[i].size() >= 2) {
int u = pq[i].top();
pq[i].pop();
int v = pq[i].top();
pq[i].pop();
if (v > 0)
res += u + v;
else {
if (u + v > 0) {
res += u + v;
minNeg = min(minNeg, 1LL * v);
} else {
if (u > 0) pq[i].push(u);
}
break;
}
}
} else {
int pos = lower_bound(zip.begin(), zip.end(), revZIP[i]) - zip.begin();
if (pos >= zip.size() || revZIP[i] != zip[pos]) continue;
while (pq[i].size() && pq[pos].size()) {
int u = pq[i].top(), v = pq[pos].top();
if (u + v > 0) {
res += u + v;
pq[i].pop();
pq[pos].pop();
} else
break;
}
}
}
for (int i = 0; i < zip.size(); ++i) {
if (zip[i] == revZIP[i] && pq[i].size()) {
maxCore = max(maxCore, 1LL * pq[i].top());
}
}
cout << max(res - minNeg, res + maxCore) << '\n';
}
| 2,100 | CPP |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
const int N = (int)2e5 + 5;
int _ = 1;
int n, m, k;
void work() {
scanf("%d%d%d", &n, &m, &k);
int num = n / m + (n % m != 0);
int sum = num * (n % m);
priority_queue<pii, vector<pii>, greater<pii> > q;
for (int i = 1; i <= n; i++) q.push({0, i});
while (k--) {
vector<pii> app;
for (int i = 1; i <= sum; i++) {
if (i % num == 1) printf("%d ", num);
pii node = q.top();
q.pop();
printf("%d ", node.second);
app.push_back({node.first + 1, node.second});
if (i % num == 0) printf("\n");
}
for (int i = 1; !q.empty(); i++) {
if (i % (n / m) == 1) printf("%d ", n / m);
if (i % (n / m) == 0) printf("\n");
pii node = q.top();
q.pop();
printf("%d ", node.second);
app.push_back({node.first, node.second});
}
for (auto i : app) q.push(i);
}
printf("\n");
}
int main() {
scanf("%d", &_);
while (_--) {
work();
}
return 0;
}
| 2,000 | CPP |
N, M, K = map(int, input().strip().split())
holes = set(int(x) for x in input().strip().split())
pos = 1
if pos not in holes:
for i in range(K):
a, b = map(int, input().strip().split())
if pos == a:
pos = b
elif pos == b:
pos = a
if pos in holes:
break
print(pos)
| 1,300 | PYTHON3 |
#include <bits/stdc++.h>
int inp() {
char c = getchar();
while (c < '0' || c > '9') c = getchar();
int sum = 0;
while (c >= '0' && c <= '9') {
sum = sum * 10 + c - '0';
c = getchar();
}
return sum;
}
int head[200010], nxt[400010], end[400010], size[200010];
double w[200010], value[400010];
int cou = 0;
void link(int a, int b, int v) {
nxt[++cou] = head[a];
head[a] = cou;
end[cou] = b;
value[cou] = v;
}
double sum, _f, f[200010];
void _dfs(int cur, int last, double dis) {
sum += pow(dis, 1.5) * w[cur];
_f += 1.5 * pow(dis, 0.5) * w[cur];
for (int x = head[cur]; x != -1; x = nxt[x])
if (end[x] != last) _dfs(end[x], cur, dis + value[x]);
}
bool used[200010];
int tot, root, min;
void dfs0(int cur, int last) {
size[cur] = 1;
int max = 0;
for (int x = head[cur]; x != -1; x = nxt[x]) {
if (end[x] != last && !used[end[x]]) {
dfs0(end[x], cur);
max = std::max(max, size[end[x]]);
size[cur] += size[end[x]];
}
}
max = std::max(max, tot - size[cur]);
if (max < min) {
min = max;
root = cur;
}
}
int rt;
double ans = 1e22;
int dfs(int cur) {
dfs0(cur, 0);
tot = size[cur];
min = 2147483647;
dfs0(cur, 0);
cur = root;
used[cur] = true;
double fsum = 0;
sum = 0;
for (int x = head[cur]; x != -1; x = nxt[x]) {
_f = 0;
_dfs(end[x], cur, value[x]);
f[end[x]] = _f;
fsum += _f;
}
if (sum < ans) {
ans = sum;
rt = cur;
}
for (int x = head[cur]; x != -1; x = nxt[x])
if (fsum - (f[end[x]] * 2.0) < 0 && !used[end[x]]) return dfs(end[x]);
return cur;
}
int main() {
memset(head, -1, sizeof(head));
int n = inp();
for (int i = 1; i <= n; i++) w[i] = inp();
for (int i = 1; i < n; i++) {
int u = inp();
int v = inp();
int w = inp();
link(u, v, w);
link(v, u, w);
}
dfs(1);
printf("%d %.10lf\n", rt, ans);
}
| 3,000 | CPP |
a, b, c = list(map(int, input().split()))
def nod(q, w):
while w > 0:
u = q % w
q = w
w = u
return q
t = 1
count = 0
while c > 0:
t = (t + 1) % 2
if t == 0:
c -= nod(a, c)
else:
c -= nod(b, c)
count += 1
if count % 2 == 0:
print(1)
else:
print(0) | 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 101010;
pair<long long, long long> operator+(const pair<long long, long long>& a,
const pair<long long, long long>& b) {
return {a.first + b.first, a.second + b.second};
}
pair<long long, long long> operator-(const pair<long long, long long>& a,
const pair<long long, long long>& b) {
return {a.first - b.first, a.second - b.second};
}
long long sqr(long long x) { return x * x; }
long long norm(const pair<long long, long long>& a) {
return sqr(a.first) + sqr(a.second);
}
void scan(pair<long long, long long>& tp) {
scanf("%lld%lld", &tp.first, &tp.second);
}
int n, sgn[N], ord[N];
pair<long long, long long> p[N], cur;
const long long LIM = 1500000LL * 1500000LL;
void output() {
for (int i = 0; i < n; i++) printf("%d%c", sgn[i], " \n"[i + 1 == n]);
exit(0);
}
void go(int ptr) {
if (ptr == n) {
if (norm(cur) <= LIM) output();
return;
}
int i = ord[ptr];
int si = 1;
if (norm(cur - p[i]) < norm(cur + p[i])) si = -1;
for (int _ = 0; _ < 2; _++, si = -si) {
sgn[i] = si;
if (si == 1)
cur = cur + p[i];
else
cur = cur - p[i];
go(ptr + 1);
if (si == 1)
cur = cur - p[i];
else
cur = cur + p[i];
}
}
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) scan(p[i]);
for (int i = 0; i < n; i++) ord[i] = i;
random_shuffle(ord, ord + n);
go(0);
}
| 2,300 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long mpre[100100], mpos[100100];
int n;
map<long long, long long> m;
map<long long, long long>::iterator it;
long long fpow(long long a, long long b) {
long long acm = 1;
if (!b) return acm;
acm = fpow(a, b / 2);
acm = (acm * acm) % 1000000007;
if (b % 2) acm = (acm * a) % 1000000007;
return acm % 1000000007;
}
long long fsum(long long num) {
return ((((num + 1) * num) / 2) % (1000000007 - 1));
}
int main() {
cin >> n;
long long a;
for (int i = 0; i < n; i++) {
scanf("%I64d", &a);
m[a]++;
}
for (int i = 0; i < 100100; i++) {
mpre[i] = 1;
mpos[i] = 1;
}
int ind = 1;
for (it = m.begin(); it != m.end(); it++, ind++) {
mpre[ind] = (mpre[ind - 1] * (it->second + 1)) % (1000000007 - 1);
}
for (it--, ind--;; it--, ind--) {
mpos[ind] = (mpos[ind + 1] * (it->second + 1)) % (1000000007 - 1);
if (it == m.begin()) break;
}
long long acm, res = 1;
ind = 1;
for (it = m.begin(); it != m.end(); it++, ind++) {
acm = (fsum(it->second) *
((mpre[ind - 1] * mpos[ind + 1]) % (1000000007 - 1))) %
(1000000007 - 1);
res = (res * fpow(it->first, acm)) % 1000000007;
}
cout << res % 1000000007 << endl;
return 0;
}
| 2,000 | CPP |
#include <bits/stdc++.h>
using namespace std;
bool isPrime(long long int n) {
if (n <= 1) return false;
if (n <= 3) return true;
if (n % 2 == 0 || n % 3 == 0) return false;
long long int p = sqrt(n);
for (int i = 5; i <= p; i += 6)
if (n % i == 0 || n % (i + 2) == 0) return false;
return true;
}
long long int b2d(string n) {
string num = n;
long long int dec_value = 0;
long long int base = 1;
long long int len = num.length();
for (int i = len - 1; i >= 0; i--) {
if (num[i] == '1') dec_value += base;
base = base * 2;
}
return dec_value;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t = 1;
cin >> t;
while (t--) {
long long int n;
cin >> n;
long long int a[n];
for (long long i = 0; i < n; i++) cin >> a[i];
int f = 0;
long long int i = n - 2;
if (a[n - 2] >= a[n - 1]) {
while (i >= 0 && a[i] >= a[i + 1]) {
i--;
}
while (i >= 0 && a[i] <= a[i + 1]) {
i--;
}
cout << i + 1 << endl;
} else {
while (i >= 0 && a[i] <= a[i + 1]) {
i--;
}
cout << i + 1 << endl;
}
}
}
| 1,200 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.sync_with_stdio(0);
cin.tie(0);
cout << fixed << setprecision(10);
int N, M;
cin >> N >> M;
vector<vector<int> > adj(2 * N);
vector<vector<int> > cap(2 * N, vector<int>(2 * N, 0));
vector<vector<int> > cost(2 * N, vector<int>(2 * N, 0));
for (int i = 0; i < N; i++) {
adj[2 * i].push_back(2 * i + 1);
adj[2 * i + 1].push_back(2 * i);
cap[2 * i][2 * i + 1] = N;
}
for (int i = 0; i < M; i++) {
int from, to, w;
cin >> from >> to >> w;
if (from == N || to == 1 || from == to) continue;
from = 2 * (from - 1) + 1, to = 2 * (to - 1);
adj[from].push_back(to);
adj[to].push_back(from);
cost[from][to] = w;
cost[to][from] = -w;
cap[from][to] = 1;
}
N *= 2;
vector<int> path_len_seq;
for (int f = 0; f < N; f++) {
vector<int> d(N, 1234567890);
d[0] = 0;
vector<int> m(N, 2);
static deque<int> q;
q.push_back(0);
vector<int> p(N, -1);
while (!q.empty()) {
int u = q.front();
q.pop_front();
m[u] = 0;
for (int v : adj[u]) {
if (cap[u][v] > 0 && d[v] > d[u] + cost[u][v]) {
d[v] = d[u] + cost[u][v];
p[v] = u;
if (m[v] == 2) {
m[v] = 1;
q.push_back(v);
} else if (m[v] == 0) {
m[v] = 1;
q.push_front(v);
}
}
}
}
if (d[N - 1] == 1234567890) break;
path_len_seq.push_back(d[N - 1]);
int cur = N - 1;
while (cur) {
cap[p[cur]][cur]--;
cap[cur][p[cur]]++;
cur = p[cur];
}
}
int Q;
cin >> Q;
for (int q = 0, x; q < Q; q++) {
cin >> x;
double ans = 0, sum = 0;
for (int i = 0; i < (int)path_len_seq.size(); i++) {
sum += path_len_seq[i];
double l = (x + sum) / (i + 1);
if (i + 1 == (int)path_len_seq.size() || path_len_seq[i + 1] + 1e-4 > l)
if (path_len_seq[i] < l + 1e-4) ans = max(ans, l);
}
cout << ans << "\n";
}
}
| 3,100 | CPP |
def g(x,y):
if x==0 or y==0:
return max(x,y)
return min(x,y)
n,m=list(map(int,input().split()))
i=1
while m>=g(i%n,n):
m-=g(i%n,n)
i+=1
print(m) | 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1000 * 100 + 10;
map<pair<int, int>, int> m;
long long Max[maxn];
long long par[maxn];
long long dp[maxn];
int n;
long long v[maxn], c[maxn], l[maxn], r[maxn];
int main() {
ios_base::sync_with_stdio(false);
cin >> n;
for (int i = 1; i <= n; ++i) cin >> v[i] >> c[i] >> l[i] >> r[i];
int cur = 1;
for (int i = 1; i <= n; ++i)
if (l[i] == 0) {
dp[i] = v[i];
if (m.find(pair<int, int>(c[i] + l[i], r[i])) != m.end()) {
int ind = m[pair<int, int>(c[i] + l[i], r[i])];
if (dp[Max[ind]] < dp[i]) Max[ind] = i;
} else {
m[pair<int, int>(c[i] + l[i], r[i])] = cur++;
int ind = cur - 1;
Max[ind] = i;
}
} else {
if (m.find(pair<int, int>(l[i], c[i] + r[i])) != m.end()) {
int ind = Max[m[pair<int, int>(l[i], c[i] + r[i])]];
par[i] = ind;
dp[i] = dp[ind] + v[i];
if (m.find(pair<int, int>(c[i] + l[i], r[i])) != m.end()) {
int ind_ = m[pair<int, int>(c[i] + l[i], r[i])];
if (dp[Max[ind_]] < dp[i]) Max[ind_] = i;
} else {
m[pair<int, int>(c[i] + l[i], r[i])] = cur++;
ind = cur - 1;
Max[ind] = i;
}
} else
;
}
long long ans = 0;
for (int i = 1; i <= n; ++i)
if (r[i] == 0)
if (dp[i] > dp[ans]) ans = i;
vector<int> Ans;
for (int i = ans; i != 0; i = par[i]) Ans.push_back(i);
cout << Ans.size() << endl;
for (int i = Ans.size() - 1; i >= 0; --i) cout << Ans[i] << " ";
cout << endl;
return 0;
}
| 2,400 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int MAX = 1005;
const int oo = 1 << 25;
int N, sum, zero;
vector<int> vec;
int dp[MAX][9];
void write(int n, int m) {
while (n) {
if (1 + dp[n - 1][(m - vec[n - 1] + 9) % 9] >= dp[n - 1][m]) {
cout << vec[n - 1];
m = (m - vec[n - 1] + 9) % 9;
}
n--;
}
}
int main() {
cin >> N;
for (int i = 0; i < N; i++) {
int x;
cin >> x;
if (x)
vec.push_back(x);
else
zero++;
}
if (!zero) {
cout << "-1" << endl;
return 0;
}
int n = int(vec.size());
sort(vec.begin(), vec.end());
for (int j = 1; j < 9; j++) dp[0][j] = -oo;
for (int i = 1; i <= n; i++)
for (int j = 0; j < 9; j++)
dp[i][j] = max(dp[i - 1][j], 1 + dp[i - 1][(j - vec[i - 1] + 9) % 9]);
if (dp[n][0] == 0) {
cout << "0" << endl;
return 0;
}
write(n, 0);
while (zero--) cout << 0;
cout << endl;
return 0;
}
| 1,000 | CPP |
from sys import stdin,stdout
from collections import defaultdict
import math
for _ in range(int(input())):
s=input()
l=[]
f=0
c=0
for i in range(len(s)):
if s[i]=='1':
if f==0:
f=1
c+=1
else:
c+=1
else:
if f==1:
l.append(c)
c=0
f=0
if f==1:
l.append(c)
c=0
f=0
l.sort(reverse=True)
ans=0
for i in range(len(l)):
if i%2==0:
ans+=l[i]
print(ans)
| 800 | PYTHON3 |
#include <iostream>
using namespace std;
int x = (ios::sync_with_stdio(false), cin.tie(0), cout.tie(0), 0);
int main() {
int T;
cin >> T;
while (T--) {
int n;
cin >> n;
int cnt = 0;
int f, l;
for (int i = 1; i <= n; i++) {
cin >> l;
if (l != i) {
cnt = 1;
}
if (i == 1) {
f = l;
}
}
if (f == n && l == 1) {
cout << 3 << endl;
}
else if (f != 1 && l != n) {
cout << 2 << endl;
}else {
cout << cnt << endl;
}
}
return 0;
} | 900 | CPP |
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
cin >> n;
vector<long long> v(n);
for (int i = 0; i < n; i++) cin >> v[i];
vector<long long> nums(31, 0);
for (auto j : v) {
for (long long i = 0; i <= 30; i++) {
if ((j >> i) & (1)) nums[i]++;
}
}
long long curr = n;
long long last = n % 2 == 0;
for (int i = 30; i >= 0; i--) {
if (!nums[i]) continue;
long long l = nums[i] / 2;
long long r = nums[i] / 2;
if (nums[i] % 2) l++;
if (l % 2 == 1 && r % 2 == 0) {
cout << "WIN\n";
return;
}
if (l % 2 == 0 && r % 2 == 1 && last) {
cout << "WIN\n";
return;
}
if (l % 2 == r % 2) continue;
cout << "LOSE\n";
return;
}
cout << "DRAW"
<< "\n";
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t = 1;
cin >> t;
for (int i = 1; i <= t; i++) {
solve();
}
return 0;
}
| 1,900 | CPP |
#include <bits/stdc++.h>
using namespace std;
unsigned long long fact[20];
set<string> seti;
int c0[10], c[10];
void sol1(string s, int c[]) {
for (int i = 0; i < 10; i++) c[i] = 0;
for (int i = 0; i < s.length(); i++) c[s[i] - 48]++;
}
unsigned long long sol2() {
unsigned long long ans = fact[accumulate(c, c + 10, 0)];
for (int i = 0; i < 10; i++) ans /= fact[c[i]];
return ans;
}
unsigned long long sol3(string s) {
sol1(s, c);
for (int i = 0; i < 10; i++)
if (c0[i] && !c[i]) return 0;
sort(s.begin(), s.end());
if (seti.count(s)) return 0;
seti.insert(s);
unsigned long long ans = sol2();
if (c[0] > 0) {
c[0]--;
ans -= sol2();
}
return ans;
}
int main() {
fact[0] = 1;
for (int i = 1; i < 20; i++) fact[i] = i * fact[i - 1];
string s;
cin >> s;
int x = s.length();
sol1(s, c0);
unsigned long long ans = 0;
for (int i = 1; i <= (1 << x); i++) {
string w;
for (int j = 0; j < x; j++)
if (i & (1 << j)) w += s[j];
ans += sol3(w);
}
cout << ans;
return 0;
}
| 1,800 | CPP |
n = [int(i) for i in input().split()]
a = 0
for i in range(2,9,3):
if (n[0]*i)%n[1] == 0:
a += (n[0]*i)//n[1]
else:
a += (n[0]*i)//n[1] +1
print(a) | 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
double tick() {
static clock_t oldt, newt = clock();
double diff = 1.0 * (newt - oldt) / CLOCKS_PER_SEC;
oldt = newt;
return diff;
}
long long mod(long long n, long long m = 1000000007) {
if (n < 0) {
return (m - abs(n) % m) % m;
} else
return n % m;
}
long long power(long long a, long long n) {
if (n == 0) return 1;
if (n == 1) return a;
if (n == 2) return a * a;
if (n & 1) {
n--;
return a * power(power(a, 2), n / 2);
} else
return power(power(a, 2), n / 2);
}
vector<long long> isPrime(1000001, true), prime, spf(1000001);
void sieve(long long n) {
isPrime[0] = isPrime[1] = false;
for (long long i = 2; i < n; i++) {
if (isPrime[i]) {
prime.push_back(i);
spf[i] = i;
}
for (long long j = 0;
j < prime.size() && i * prime[j] < n && prime[j] <= spf[i]; j++) {
isPrime[i * prime[j]] = false;
spf[i * prime[j]] = prime[j];
}
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long t = 1;
while (t--) {
long long n;
cin >> n;
vector<long long> dp;
long long i = 1;
while (i * (i + 1) / 2 <= n) {
dp.push_back(i);
i++;
}
long long& x = dp[int(dp.size()) - 1];
if (x * (x + 1) / 2 < n) {
x += n - (x * (x + 1) / 2);
}
cout << int(dp.size()) << '\n';
for (auto& i : dp) cout << i << ' ';
cout << '\n';
}
cerr << "\nExecution time: " << tick() * 1000 << " ms" << '\n';
return 0;
}
| 1,000 | CPP |
#include <bits/stdc++.h>
using namespace std;
int a[10], b[100010], n;
int main() {
for (int i = 1; i <= 6; i++) scanf("%d", &a[i]);
sort(a + 1, a + 7);
scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%d", &b[i]);
sort(b + 1, b + n + 1);
int L = 0, R = 1e9;
while (L < R) {
int mid = (L + R) >> 1;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= 6; j++) {
int Min = b[i] - a[j], Max = Min + mid, l = 1;
for (int k = 1; k <= 6; k++)
if (b[l] < a[k] + Min)
break;
else
l = upper_bound(b + 1, b + n + 1, a[k] + Max) - b;
if (l > n) {
R = mid;
goto Next;
}
}
L = mid + 1;
Next:;
}
printf("%d\n", R);
return 0;
}
| 1,900 | CPP |
w,h=map(int,input().split())
u,d=map(int,input().split())
v,e=map(int,input().split())
while h:
w+=h
if h==d:
w=max(0,w-u)
if h==e:
w=max(0,w-v)
h-=1
print(w)
| 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
vector<int> s(4);
for (int& x : s) cin >> x;
if (min(s[0], s[1]) > max(s[2], s[3]) || max(s[0], s[1]) < min(s[2], s[3]))
cout << "NO\n";
else
cout << "YES\n";
}
} | 800 | CPP |
txt1 = input()
txt2 = input()
if txt2 == txt1[::-1]:
print("YES")
else:
print("NO")
| 800 | PYTHON3 |
t = int(input())
for i in range(t):
sizes = input().split()
a = input().split()
for k in range(int(sizes[0])):
a[k] = int(a[k])
b = input().split()
for k in range(int(sizes[1])):
b[k] = int(b[k])
found = False
k = 0
while k < len(a) and not found:
if a[k] in b:
print("YES")
print(1, a[k])
found = True
k += 1
if not found:
print("NO")
| 800 | PYTHON3 |
def main(a, b):
x1, y1, z1 = a
x2, y2, z2 = b
plus = min(z1, y2)
minus = z2 - min(z2, (z1 - plus + x1))
ans = (plus - minus) * 2
print(ans)
t = int(input())
for i in range(2 * t):
if i % 2 == 0:
a = list(map(int, input().split()))
else:
b = list(map(int, input().split()))
main(a, b) | 1,100 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, Q, d;
cin >> n >> d >> Q;
while (Q--) {
int x, y;
cin >> x >> y;
if (y >= x - d && y <= x + d && x >= d - y && x <= 2 * n - d - y)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
}
| 1,100 | CPP |
n = int(input())
if(n%2 == 0):
print(-1)
else:
for i in range(n):
print(i, end = " ")
print('\n')
for i in range(n):
print(i, end = " ")
print("\n")
for i in range(n):
print(((i+i)%n), end = " ")
| 1,300 | PYTHON3 |
q = int(input())
for i in range (q):
a,b,n,s = input().split(" ")
a , b , n ,s = int (a), int(b) , int(n ), int(s)
if s%n <=b and a*n+b>= s :
print("YES")
else :
print("NO")
| 1,000 | PYTHON3 |
cnt = lambda s, x: s.count(x)
ii = lambda: int(input())
si = lambda: input()
f = lambda: map(int, input().split())
dgl = lambda: list(map(int, input()))
il = lambda: list(map(int, input().split()))
n=ii()
l=il()[::-1]
l1=[l[0]]
for i in range(1,n):
if l1[-1]>l[i]:
l1.append(l[i])
else:
l1.append(max(0,min(l[i],l1[-1]-1)))
print(sum(l1)) | 1,000 | PYTHON3 |
for i in range(int(input())):
n = int(input())
a = list(map(int, input().split()))
possible = []
used = set()
for j in range(n):
used.add(a[j])
for j in range(n, 0, -1):
if j not in used:
possible.append(j)
ans = [a[0]]
breaki = False
for j in range(1, n):
if a[j] == a[j - 1]:
if possible[-1] < a[j]:
ans.append(possible.pop())
else:
breaki = True
break
elif a[j] < a[j - 1]:
breaki = True
break
else:
ans.append(a[j])
if breaki:
print(-1)
else:
print(" ".join(map(str, ans)))
| 1,200 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 22;
int n, m, A[1 << MAXN];
bool seen[1 << MAXN][3];
bool isOrig[1 << MAXN];
int inverse(int x) { return ((1 << n) - 1) ^ x; }
void dfs(int x, int type) {
if (seen[x][type] || (type == 1 && !isOrig[x])) return;
seen[x][type] = true;
if (type == 1) {
dfs(x, 2);
} else {
dfs(inverse(x), 1);
for (int i = 0; i < n; i++) {
if (!(x & (1 << i))) {
dfs(x | (1 << i), 2);
}
}
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> A[i];
isOrig[A[i]] = true;
}
int ans = 0;
for (int i = 0; i < m; i++) {
if (!seen[A[i]][1]) {
dfs(A[i], 1);
ans++;
}
}
cout << ans << '\n';
return 0;
}
| 2,500 | CPP |
#include <bits/stdc++.h>
const int N(500010), MOD(1000003);
int x[N], y[N];
char map[N];
int fail(int &a, int b) {
if (a != -1 && a != b % 2) return 1;
a = b % 2;
return 0;
}
int answer() {
int a, b, n, m, i, j;
scanf("%d%d", &n, &m);
memset(x, 255, sizeof(x));
memset(y, 255, sizeof(y));
for (i = 0; i != n; ++i) {
scanf("%s", map);
for (j = 0; j != m; ++j) {
if (map[j] == '.') continue;
if (map[j] == '1') {
a = j;
b = i;
}
if (map[j] == '2') {
a = j;
b = i + 1;
}
if (map[j] == '3') {
a = j + 1;
b = i + 1;
}
if (map[j] == '4') {
a = j + 1;
b = i;
}
if (fail(x[i], a)) return 0;
if (fail(y[j], b)) return 0;
}
}
int ret(1);
for (i = 0; i != n; ++i)
if (x[i] == -1) ret = (ret * 2) % MOD;
for (i = 0; i != m; ++i)
if (y[i] == -1) ret = (ret * 2) % MOD;
return ret;
}
int main() {
printf("%d\n", answer());
return 0;
}
| 2,200 | CPP |
#include <algorithm>
#include <iostream>
using namespace std;
int binarySearch(int arr[], int l, int r, int x);
int printIntersection(int arr1[], int arr2[], int m, int n)
{
int count=0;
if (m > n) {
int* tempp = arr1;
arr1 = arr2;
arr2 = tempp;
int temp = m;
m = n;
n = temp;
}
sort(arr1, arr1 + m);
for (int i = 0; i < n; i++)
if (binarySearch(arr1, 0, m - 1, arr2[i]) != -1)
//cout << arr2[i] << " ";
count++;
return count;
}
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r - l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, mid - 1, x);
return binarySearch(arr, mid + 1, r, x);
}
return -1;
}
/* Driver program to test above function */
int main()
{
int t;cin>>t;
int arr1[104];
int arr2[104];
while(t--){
int m,n;
cin>>m>>n;
for(int i=0;i<m;i++){
cin>>arr1[i];
}
for(int i=0;i<n;i++){
cin>>arr2[i];
}
sort(arr1, arr1 + m);
sort(arr2, arr2 + n);
//cout << "nIntersection of two arrays is \n";
cout<<printIntersection(arr1, arr2, m, n);
cout<<endl;
}
return 0;
} | 800 | CPP |
#include <bits/stdc++.h>
int main() {
int n;
scanf("%d", &n);
int k = 0;
int g = 0;
for (int i = 0; i < n; i++) {
scanf("%d", &k);
if (k == 1) {
g = 1;
}
}
if (g == 1)
printf("-1\n");
else
printf("1\n");
}
| 1,000 | CPP |
t=int(input())
while t>0:
n,k=map(int,input().split())
if k>n:
print(k-n)
elif n%2==k%2:
print(0)
else:
print(1)
t-=1
| 900 | PYTHON3 |
for _ in range(int(input())):
n = int(input());b = list(map(int,input().split()));next = dict();prev = dict();curr = b[0];next[curr] = "!";prev[curr] = "!";fine = True
for i in b:
if i>curr:
if next[curr] == "!":next[curr] = i;prev[i] = curr;next[i] = "!"
elif next[curr]<i:fine = False;break
elif next[curr]>i:prev[next[curr]] = i;next[i] = next[curr];next[curr] = i;prev[i] = curr
elif i<curr:
if prev[curr] == "!":prev[curr] = i;prev[i] = "!";next[i] = curr
elif i<prev[curr]:fine = False;break
elif i>prev[curr]:next[prev[curr]] = i;prev[i] = prev[curr];prev[curr] = i;next[i] = curr
curr = i
print("YES") if fine else print("NO") | 2,000 | PYTHON3 |
n1, n2, k1, k2 = map(int, input().split())
print(['First', 'Second'][n1<=n2]) | 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int a[1000001];
int a2[1000001];
int main(int argc, char const *argv[]) {
map<int, int> map1;
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
a[arr[i]]++;
}
int mx = -1e9 - 1;
for (int i = 0; i < 1000001; i++) mx = max(mx, a[i]);
for (int i = 0; i < n; i++) {
a2[arr[i]]++;
if (a2[arr[i]] == mx) {
cout << arr[i] << endl;
return 0;
}
}
return 0;
}
| 1,000 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long answer = 0;
long long gcd(long long a, long long b) {
if (b != 0) answer += a / b;
return b ? gcd(b, a % b) : a;
}
void solution() {
long long a, b;
cin >> a >> b;
gcd(a, b);
cout << answer << "\n";
}
int main() {
solution();
return 0;
}
| 1,600 | CPP |
#include <bits/stdc++.h>
const int N = 2e5 + 10;
int mod, n, a, b, good;
std::pair<int, int> set[N];
std::pair<int, int> make_pair(int i, int j) {
return {std::min(i, j), std::max(i, j)};
}
int main() {
scanf("%d%d", &mod, &n);
for (int i = 0; i < n; i++) {
scanf("%d%d", &a, &b);
set[i] = make_pair(a - 1, b - 1);
}
std::sort(set, set + n);
for (int k = 1; k < mod; k++) {
if (mod % k) continue;
good = true;
for (auto p = set; p != set + n; p++)
if (!std::binary_search(
set, set + n,
make_pair((p->first + k) % mod, (p->second + k) % mod))) {
good = false;
break;
}
if (good) {
printf("yes\n");
return 0;
}
}
printf("no\n");
return 0;
}
| 1,900 | CPP |