solution
stringlengths 10
983k
| difficulty
int64 0
25
| language
stringclasses 2
values |
|---|---|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
int T;
cin >> T;
while (T--) {
int n, C = 1;
cin >> n;
int a[n + 1];
set<pair<int, pair<int, int>>> f;
f.insert({-n, {1, n}});
while (f.size()) {
auto q = (*f.begin()).second;
f.erase(f.begin());
int b = q.first, e = q.second, l = e - b + 1, m = (b + e) / 2;
if (l <= 0) continue;
a[m] = C++;
f.insert({-(m - b), {b, m - 1}});
f.insert({-(e - m), {m + 1, e}});
}
for (int i = 1; i <= n; ++i) cout << a[i] << " ";
cout << endl;
}
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int Gcd(int a, int b) { return b == 0 ? a : Gcd(b, a % b); }
int main() {
long long ans = 0;
int n, m;
cin >> n >> m;
int gcd = 0;
for (int i = 0; i < n; i++) {
int num;
cin >> num;
gcd = Gcd(gcd, num - 1);
}
while (gcd % 2 == 0) gcd = gcd >> 1;
for (int i = 1; i * i <= gcd; i++) {
if (!(gcd % i)) {
for (int j = i; j < m; j = j << 1) ans += m - j;
if (i * i < gcd)
for (int j = gcd / i; j < m; j = j << 1) ans += m - j;
}
}
cout << ans << endl;
}
| 11 | CPP |
def problemA(arr,n):
count0 = 0
for i in range(n):
if(arr[i]==0):
count0 +=1
count1 = n-count0
if(count0>=count1):
return n//2,[0]*(n//2)
else:
if((n//2)%2==0):
return n//2,[1]*(n//2)
else:
return (n//2)+1,[1]*((n//2)+1)
if __name__ == '__main__':
testCases = input()
for i in range(int(testCases)):
n = int(input())
arr = list(map(int,input().split(" ")))
nans,ans = problemA(arr,n)
print(nans)
print(" ".join([str(i) for i in ans]))
| 7 | PYTHON3 |
#include <bits/stdc++.h>
long s[100001][2], data[100001];
int main() {
long i, n, max = 1;
scanf("%ld", &n);
for (i = 1; i <= n; i++) scanf("%ld", &data[i]);
memset(s, 0, sizeof(s));
s[1][0] = 1;
s[1][1] = 1;
s[0][0] = 0;
s[0][1] = 0;
for (i = 2; i <= n; i++) {
if (data[i] > data[i - 1]) {
s[i][0] = s[i - 1][0] + 1;
s[i][1] = s[i - 1][1] + 1;
}
if (s[i][0] == 0) s[i][0] = 1;
if (s[i][1] < 2) s[i][1] = 2;
if (data[i] - data[i - 2] > 1)
if (s[i - 2][0] + 2 > s[i][1]) s[i][1] = s[i - 2][0] + 2;
}
for (i = 1; i <= n - 1; i++) {
if (s[i][1] > max) max = s[i][1];
if (s[i][0] + 1 > max) max = s[i][0] + 1;
}
if (s[n][1] > max) max = s[n][1];
printf("%ld", max);
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 100;
const double eps = 1e-9;
int n, m, d[N], cnt = 0;
double k, w, ost = 0, req;
vector<pair<int, double> > ans[N];
int main() {
cin >> n >> w >> m;
k = (double)(n * w) / m;
ost = w;
for (int i = 0; i < m; i++) {
req = k;
while (req > eps) {
if (abs(ost - req) < eps || ost - req > eps) {
ost -= req;
ans[i].push_back(make_pair(cnt + 1, req));
req = 0;
} else {
if (ost > eps) {
ans[i].push_back(make_pair(cnt + 1, ost));
req -= ost;
}
cnt++;
ans[i].push_back(make_pair(cnt + 1, min(w, req)));
ost = w - min(w, req);
req -= min(w, req);
}
}
}
for (int i = 0; i < m; i++)
for (int j = 0; j < ans[i].size(); j++) d[ans[i][j].first]++;
for (int i = 1; i <= n; i++)
if (d[i] > 2) {
cout << "NO";
return 0;
}
cout << "YES" << endl;
for (int i = 0; i < m; cout << endl, i++)
for (int j = 0; j < ans[i].size(); j++)
printf("%d %.6lf ", ans[i][j].first, ans[i][j].second);
return 0;
}
| 8 | CPP |
#include <iostream>
#include <cstring>
using namespace std;
long long n,k;
char s[105];
long long p[105],cnt=1;
long long ans=0;
int main()
{
cin>>s;
cin>>k;
n=strlen(s);
p[1]=1;
for(int i=1;i<n;i++)
{
if(s[i]==s[i-1])
p[cnt]++;
else
p[++cnt]++;
}
if(s[0]!=s[n-1])
{
for(int i=1;i<=cnt;i++)
ans+=k*(p[i]/2);
cout<<ans<<endl;
}
else
{
if(cnt==1)
cout<<k*n/2<<endl;
else
{
for(int i=2;i<cnt;i++)
ans+=k*(p[i]/2);
ans+=p[1]/2+p[cnt]/2;
ans+=(p[1]+p[cnt])/2*(k-1);
cout<<ans<<endl;
}
}
return 0;
}
| 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int mol = 475;
int a[30];
int p, x, y;
bool check(int xx) {
int i = (xx / 50) % mol;
for (int j = 1; j <= 25; j++) {
i = (i * 96 + 42) % mol;
a[j] = 26 + i;
if (p == a[j]) return 1;
}
return 0;
}
int main() {
while (~scanf("%d %d %d", &p, &x, &y)) {
int i, Max = 1000000;
for (i = 0; i <= 100000; i++) {
if (check(x + i * 50)) {
Max = min((i + 1) / 2, Max);
}
}
for (i = 0; x - i * 50 >= y; i++) {
if (check(x - i * 50)) {
Max = 0;
}
}
printf("%d\n", Max);
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n;
int dfs(long x=0, int a=0, int b=0, int c=0)
{
if (x > n) return 0;
int res = a*b*c;
x *= 10;
res += dfs(x+3, 1, b, c);
res += dfs(x+5, a, 1, c);
res += dfs(x+7, a, b, 1);
return res;
}
int main()
{
cin >> n;
cout << dfs() << endl;
} | 0 | CPP |
import sys, os
from math import sqrt, gcd, ceil, log, floor
from bisect import bisect, bisect_left
from collections import defaultdict, Counter, deque
from heapq import heapify, heappush, heappop
input = sys.stdin.readline
read = lambda: list(map(int, input().strip().split()))
# read_f = lambda file: list(map(int, file.readline().strip().split()))
MOD = 998244353
def main():
# file1 = open("input.txt", "r")
# t = int(file1.readline().strip())
for _ in range(int(input())):
n = int(input())
a = read(); b = read(); c = read()
ans = [a[0]]
for i in range(1, n):
last = ans[-1]
for j in (a[i], b[i], c[i]):
if last != j:ans.append(j); break
for i in (a[-1], b[-1], c[-1]):
if i != ans[-2] and i != ans[0]:ans[-1] = i
print(*ans)
# file = open("output.txt", "w")
# file.write(("").join(ans[:-1]))
# # for i in ans:
# # file.write(str(i)+"\n")
# file.close()
if __name__ == "__main__":
main() | 7 | PYTHON3 |
#include <cstdio>
#include <algorithm>
using namespace std;
typedef long long ll;
ll x[1000],y[1000],z[1000],a[1000],ans;
int n,m;
int main(){
scanf("%d%d",&n,&m);
for(int i=0;i<n;i++)scanf("%lld%lld%lld",&x[i],&y[i],&z[i]);
ans=0;
for(int cas=0;cas<8;cas++){
for(int i=0;i<n;i++){
a[i]=0;
a[i]+=cas&1?x[i]:-x[i];
a[i]+=cas&2?y[i]:-y[i];
a[i]+=cas&4?z[i]:-z[i];
}
sort(a,a+n);
ll mx=0;
for(int i=n-m;i<n;i++)mx+=a[i];
ans=max(ans,mx);
}
printf("%lld\n",ans);
} | 0 | CPP |
n=int(input())
s=[]
b=[]
count=0
for i in range(n):
s = input()
s = list(map(int, s.split()))
b.append(s)
for i in range(len(b)):
for j in range(len(b)):
if(b[i][0]==b[j][1]):
count=count+1
print(count)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N,d;
set<int> mochi;
for (cin >> N; N; N--) {
cin >> d;
mochi.insert(d);
}
cout << mochi.size();
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
bool cmp(pair<long long int, char> p1, pair<long long int, char> p2) {
return p1.first > p2.first;
}
long long int mod = 1000000007;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long int n;
cin >> n;
long long int p[n + 1], a[n + 2], i, j;
for (i = 1; i <= n; i++) {
cin >> p[i];
a[i] = 0;
}
for (i = 1; i <= n; i++) {
a[i + 1] = (((2 * a[i] - a[p[i]]) % mod) + mod) % mod + 2;
a[i + 1] = a[i + 1] % mod;
}
cout << a[n + 1] << "\n";
}
| 10 | CPP |
#lol
temmie = [0,1,1,1,2,1,2,1,5,2,2,1,5,1,2,1,14,1,5,1,5,2,2,1,15,2,2,5,4,1,4,1,51,1,2,1,14,1,2,2,14,1,6,1,4,2,2,1,52,2,5,1,5,1,15,2,13,2,2,1,13,1,2,4,267,1,4,1,5,1,4,1,50,1,2,3,4,1,6,1,52,15,2,1,15,1,2,1,12,1,10,1,4,2]
toby = int(input())
print(temmie[toby]) | 12 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int t, n, x, y, ans, a[200010][205];
bool ok;
vector<int> v[205];
int main() {
cin >> t;
while (t--) {
cin >> n;
for (int i = (0); i < (205); i++) v[i].clear();
ans = 0;
for (int i = (1); i < (n + 1); i++) {
cin >> x;
for (int j = (0); j < (205); j++) a[i][j] = a[i - 1][j] + (x - 1 == j);
v[x - 1].push_back(i);
}
for (int i = (0); i < (205); i++) ans = max(ans, (int)v[i].size());
for (int i = (0); i < (205); i++) {
for (int j = (0); j < (v[i].size() / 2); j++) {
x = v[i][j], y = v[i][v[i].size() - j - 1];
for (int k = (0); k < (205); k++) {
if (i == k) continue;
ans = max(ans, 2 * (j + 1) + a[y][k] - a[x][k]);
}
}
}
cout << ans << '\n';
}
return 0;
}
| 8 | CPP |
st = input()
w = int(st)
if w>2 :
if w%2 == 0 :
print("YES")
else :
print("NO")
else :
print("NO") | 7 | PYTHON3 |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll mod=1e9+7;
vector<ll> tfact(1e7+1,-1);
ll n,k;
ll mpow(ll x, ll n){
ll ans = 1;
while(n != 0){
if(n&1) ans = ans*x % mod;
x = x*x % mod;
n = n >> 1;
}
return ans;
}
ll fact(ll n) {
if(tfact[n]<0) {
if(n==0) {
tfact[n]=1;
}
else {
tfact[n]=fact(n-1)*n%mod;
}
}
return tfact[n];
}
ll comb(ll n, ll k) {
return fact(n)*mpow(fact(k),mod-2)%mod*mpow(fact(n-k),mod-2)%mod;
}
int main() {
cin >> n >> k;
vector<ll> x(n);
for(int i=0;i<n;i++) {
cin >> x.at(i);
}
sort(x.rbegin(),x.rend());
ll pans=0;
ll mans=0;
for(int i=0;i<=n-k;i++) {
pans = (pans + x.at(i)*comb(n-1-i,k-1)%mod)%mod;
mans = (mod+mans - x.at(n-1-i)*comb(n-1-i,k-1)%mod)%mod;
}
ll ans =(mod+pans+mans)%mod;
cout << ans << endl;
} | 0 | CPP |
t = int(input())
for i in range(0,t):
t2 = int(input())
position = {}
max_x = 0
for x in range(0, t2):
x, y = map(int,input().split())
if position.get(x,0) != 0:
res_list = position[x]
res_list.append(y)
position[x] = res_list
else:
position[x] = [y]
max_x = max(max_x, x)
movement = ""
res_x = 0
res_y = [0]
for x in range(0, max_x + 1):
res_list2 = position.get(x, 0)
if res_list2 != 0:
U_num = max(res_list2) - max(res_y)
R_num = x - res_x
res_x = x
movement += 'R' * R_num
movement += 'U' * U_num
if min(res_list2) < max(res_y):
print("NO")
break
else:
res_y = res_list2
else:
print('YES')
print(movement)
| 8 | PYTHON3 |
from sys import stdin, stdout
n = int(stdin.readline().rstrip())
nameDict = {}
for _ in range(n):
s = stdin.readline().rstrip().split()
name = s[0]
if name not in nameDict:
nameDict[name]=set()
for number in s[2:]:
nameDict[name].add(number)
for name in nameDict.keys():
rem=set()
for no1 in nameDict[name]:
for no2 in nameDict[name]:
if no1==no2:
continue
l1 = len(no1)
l2 = len(no2)
if l1<l2 and no2[-l1:]==no1:
rem.add(no1)
for no in rem:
nameDict[name].remove(no)
print(len(nameDict.keys()))
for name in nameDict.keys():
print(' '.join([name,str(len(nameDict[name]))]+list(nameDict[name])))
| 9 | PYTHON3 |
n = int(input())
alh = 'qwertyuiopasdfghjklmnbvcxz'
s = input()
a = [0] * 28
for i in s:
a[alh.index(i)] += 1
k = 0
for i in a:
if i > 1:
k = 1
if k == 1 or n == 1:
print("Yes")
else:
print("No")
| 7 | PYTHON3 |
n, a = int(input())+1, 0
d = [0]*n
for i in range(1, n):
for j in range(i, n, i):
d[j] += 1
for i in range(1, n-1):
a = (2*a+d[i]) % 998244353
print(a+d[n-1])
| 8 | PYTHON3 |
#include<bits/stdc++.h>
using namespace std;
long long mod = 998244353;
long long inv[3000009];
long long f[3000009];
long long F[3000009];
long long C(long long m, long long n){
if(n > m || n < 0)return 0;
return (f[m]*F[n]%mod)*F[m-n]%mod;
}
int main(){
long long n,a,b;
long long ans = 0;
long long k;
cin>>n>>a>>b>>k;
inv[0] = 1;
inv[1] = 1;
for(long long i= 2; i <= n; i++)
inv[i] = (inv[mod % i])*(mod - mod/i)% mod;
f[0] = 1;
F[0] = 1;
for(long long i = 1; i <= n; i++){
f[i] = f[i-1]*(i)%mod;
F[i] = F[i-1]*(inv[i])%mod;
}
for(long long i = 0;i <= n; i++){
if((k - i*a)%b) continue;
long long x= i;
long long y = (k-i*a)/b;
ans = (ans + C(n,x)*C(n,y))%mod;
}
cout<<ans<<endl;
}
| 0 | CPP |
import sys
from math import pi, sin, cos
input = sys.stdin.readline
t = int(input())
for i in range(t):
n = 2 * int(input())
R = 1 / (2 * sin(pi / n))
r = R * cos(pi / n)
print(2 * r)
| 9 | PYTHON3 |
#include<iostream>
#include <algorithm>
using namespace std;
int main()
{
int A[3],B[2];
cin>>A[0]>>A[1]>>A[2];
cin>>B[0]>>B[1];
sort(A,A+3);
sort(B,B+2);
cout<<A[0]+B[0]-50<<endl;
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int inf = INT_MAX;
int main() {
int n, m;
scanf("%d %d", &n, &m);
vector<int> s(n), length(n), t(n), by_s(n), by_t(n), by(n), day(n);
for (int i = 0; i < n; ++i) {
scanf("%d %d %d", &s[i], &length[i], &t[i]);
by_s[i] = by_t[i] = i;
}
vector<int> f(1 << n, inf);
vector<pair<int, int>> from(1 << n);
f[0] = 1;
sort(by_s.begin(), by_s.end(),
[&](const int &x, const int &y) { return s[x] < s[y]; });
sort(by_t.begin(), by_t.end(),
[&](const int &x, const int &y) { return t[x] < t[y]; });
for (int i = 0; i < 1 << n; ++i) {
if (f[i] != inf) {
int pointer = 0, value = f[i];
for (auto j : by_t) {
if (!(i >> j & 1)) {
while (pointer < n && value + t[j] >= s[by_s[pointer]]) {
int p = by_s[pointer++];
if ((i >> p & 1) || value >= s[p]) {
value = max(value, s[p] + length[p]);
}
}
if (value + t[j] < s[j] && f[i | 1 << j] > value + t[j]) {
f[i | 1 << j] = value + t[j];
from[i | 1 << j] = make_pair(j, value);
}
}
}
}
}
function<void(int, int)> rec = [&](int x, int type) {
if (!x) {
return;
}
int i = from[x].first;
by[i] = type;
day[i] = from[x].second;
rec(x ^ 1 << i, type);
};
if (m == 1) {
if (f[(1 << n) - 1] != inf) {
puts("YES");
rec((1 << n) - 1, 1);
for (int i = 0; i < n; ++i) {
printf("%d %d\n", by[i], day[i]);
}
} else {
puts("NO");
}
} else {
int p = -1;
for (int i = 0; i < (1 << n); ++i) {
if (f[i] != inf && f[(1 << n) - 1 ^ i] != inf) {
p = i;
break;
}
}
if (!~p) {
puts("NO");
} else {
puts("YES");
rec(p, 1);
rec((1 << n) - 1 ^ p, 2);
for (int i = 0; i < n; ++i) {
printf("%d %d\n", by[i], day[i]);
}
}
}
return 0;
}
| 12 | CPP |
def main():
mod = 10**9+7
fact = [1, 1]
for i in range(2, 200000):
fact.append(fact[-1]*i % mod)
n = int(input())
ab = [list(map(int, input().split())) for _ in [0]*(n-1)]
g = [[] for _ in [0]*n]
[g[a-1].append(b-1) for a, b in ab]
[g[b-1].append(a-1) for a, b in ab]
g2 = [set(i) for i in g]
child = [1]*n # 子の数
q = [-1, 0]
while len(q) > 1: # DFS
i = q[-1]
if g2[i]:
j = g2[i].pop()
g2[j].remove(i)
q.append(j)
else:
q.pop()
if len(q) > 1:
child[q[-1]] += child[i]
rank = [(j, i) for i, j in enumerate(child)]
rank = [j for i, j in sorted(rank)]
dp = [1]*n
for i in rank:
c = child[i]
ans = fact[c-1]
temp = 1
for j in g[i]:
if child[j] < c:
ans = ans*dp[j] % mod
temp = temp*fact[child[j]] % mod
dp[i] = ans*pow(temp, mod-2, mod) % mod
dp2 = [0]*n
dp2[0] = dp[0]
g2 = [set(i) for i in g]
q = [-1, 0]
while len(q) > 1: # DFS
i = q[-1]
if g2[i]:
j = g2[i].pop()
c = child[j]
temp = fact[n-c]*fact[c-1]
dp2[j] = dp2[i]*(fact[c]*fact[n-c-1])*pow(temp, mod-2, mod) % mod
g2[j].remove(i)
q.append(j)
else:
q.pop()
if len(q) > 1:
child[q[-1]] += child[i]
for i in dp2:
print(i)
main() | 0 | PYTHON3 |
n = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
m1 = -1
m2 = -1
for i in B:
if i > m1:
m2 = m1
m1 = i
elif i > m2:
m2 = i
if sum(A) <= m1 + m2:
print("YES")
else:
print("NO")
| 7 | PYTHON3 |
n,m=map(int,input().split())
s=[list(map(int,input().split())) for i in range(n)]
sign=[-1,1]
ans=0
for i in sign:
for j in sign:
for k in sign:
lis=[0]*n
for l in range(n):
lis[l]=i*s[l][0]+j*s[l][1]+k*s[l][2]
lis.sort(reverse=True)
a=sum(lis[:m])
ans=max(ans,a)
print(ans) | 0 | PYTHON3 |
import sys
try:
sys.stdin = open('input.txt', 'r')
sys.stdout = open('output.txt', 'w')
except:
pass
input = sys.stdin.readline
for tt in range(int(input())):
m,n = map(int,input().split())
if n==2 and m==2:
print("YES")
elif n==1 or m==1:
print("YES")
else:
print("NO") | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 10, LOGN = 20;
const long long INF = 1e18;
vector<pair<int, int> > G[MAXN];
struct UnionFind {
vector<int> f;
void init(int n) {
f.clear();
f.insert(f.begin(), n, -1);
}
int comp(int x) { return f[x] == -1 ? x : f[x] = comp(f[x]); }
bool join(int i, int j) {
bool con = comp(i) == comp(j);
if (!con) f[comp(i)] = comp(j);
return con;
}
} uf;
int N, f[MAXN][LOGN], L[MAXN];
long long C[MAXN];
void dfs(int v, int fa = -1, long long c = 0, int lvl = 0) {
f[v][0] = fa, L[v] = lvl, C[v] = c;
for (auto e : G[v]) {
int u = e.first, cc = e.second;
if (u != fa) dfs(u, v, c + cc, lvl + 1);
}
}
void build() {
for (int k = int(0); k < int(LOGN - 1); k++)
for (int i = int(0); i < int(N); i++)
if (f[i][k] != -1) f[i][k + 1] = f[f[i][k]][k];
}
int climb(int a, int d) {
if (!d) return a;
for (int i = int((31 - __builtin_clz(L[a])) + 1 - 1); i >= int(0); i--)
if (1 << i <= d) a = f[a][i], d -= 1 << i;
return a;
}
int lca(int a, int b) {
if (L[a] < L[b]) swap(a, b);
a = climb(a, L[a] - L[b]);
if (a == b) return a;
for (int i = int((31 - __builtin_clz(L[a])) + 1 - 1); i >= int(0); i--)
if (f[a][i] != f[b][i]) a = f[a][i], b = f[b][i];
return f[a][0];
}
long long dist(int a, int b) { return C[a] + C[b] - 2 * C[lca(a, b)]; }
const int MAXE = 50;
int ha[MAXN], cnt = 1;
long long distG[MAXE][MAXE], distAG[MAXN][MAXE];
int deha[MAXE];
inline void go(int u) {
if (ha[u] == 0) {
ha[u] = cnt;
deha[cnt] = u;
cnt++;
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
fill(distG[0], distG[MAXE], INF);
int m;
cin >> N >> m;
uf.init(N);
for (int _ = int(0); _ < int(m); _++) {
int u, v;
long long d;
cin >> u >> v >> d;
u--;
v--;
if (uf.comp(u) != uf.comp(v)) {
uf.join(u, v);
G[u].emplace_back(v, d);
G[v].emplace_back(u, d);
} else {
go(u);
go(v);
int nu = ha[u], nv = ha[v];
distG[nu][nv] = distG[nv][nu] = min(distG[nu][nv], d);
}
}
dfs(0);
build();
for (int i = int(1); i < int(cnt); i++)
for (int j = int(1); j < int(cnt); j++)
distG[i][j] = min(distG[i][j], dist(deha[i], deha[j]));
for (int k = int(1); k < int(cnt); k++)
for (int i = int(1); i < int(cnt); i++)
for (int j = int(1); j < int(cnt); j++)
distG[i][j] = min(distG[i][j], distG[i][k] + distG[k][j]);
for (int i = int(0); i < int(N); i++)
for (int j = int(1); j < int(cnt); j++) distAG[i][j] = dist(i, deha[j]);
int q;
cin >> q;
while (q--) {
int u, v;
cin >> u >> v;
u--;
v--;
long long ans = dist(u, v);
for (int i = int(1); i < int(cnt); i++)
for (int j = int(1); j < int(cnt); j++) {
ans = min(ans, distAG[u][i] + distAG[v][j] + distG[i][j]);
}
cout << ans << '\n';
}
return 0;
}
| 12 | CPP |
#include <bits/stdc++.h>
using namespace std;
int ri() {
int x;
if (scanf(" %d", &x) == EOF) return -1;
return x;
}
long long int rl() {
long long int x;
if (cin >> x) return x;
return -1;
}
string rs() {
string s;
if (cin >> s) return s;
return "";
}
const long long int mod = 998244353;
struct SingleCase {
int n, k;
vector<int> B;
bool solveCase() {
n = ri();
if (n < 0) return false;
k = ri();
map<int, int> A;
for (int i = 0; i < n; ++i) A[ri()] = i;
for (int i = 0; i < k; ++i) B.push_back(A[ri()]);
long long int ret = solve();
cout << ret << endl;
return true;
}
long long int solve() {
long long int ret = 1;
set<int> S;
for (int i = 0; i < n; ++i) S.insert(i);
set<int> T;
for (auto x : B) T.insert(x);
for (auto x : B) {
auto it = S.find(x);
long long int y = lower(S, it);
long long int z = upper(S, it);
int yGood = (y >= 0) && !T.count(y);
int zGood = (z >= 0) && !T.count(z);
int choices = yGood + zGood;
if (choices == 0) return 0;
ret = ret * choices % mod;
if (yGood) {
S.erase(y);
} else if (zGood) {
S.erase(z);
}
T.erase(x);
}
return ret;
}
int lower(const set<int>& S, set<int>::iterator it) {
if (it != S.begin()) return *(--it);
return -1;
}
int upper(const set<int>& S, set<int>::iterator it) {
if (++it != S.end()) return *it;
return -1;
}
};
int main() {
int cases = ri();
while (SingleCase().solveCase()) {
};
return 0;
}
| 8 | CPP |
#include<bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define ins insert
#define pq priority_queue
#define minele min_element
#define maxele max_element
#define lb lower_bound //first pos >= val
#define ub upper_bound // first pos > val
#define cnt_bit __builtin_popcount
#define debug(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,fma")
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
int d4x[4] = {1, 0, -1, 0}; int d4y[4] = {0, 1, 0, -1};
int d8x[8] = {0, 1, 1, 1, 0, -1, -1, -1};
int d8y[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll oo = 1e18;
const ll maxN = 1e6;
/* Author : Le Ngoc Bao Anh, 10A5, LQD High School for Gifted Student */
void maximize(int &a, int b) {
a = max(a, b);
}
void minimize(int &a, int b) {
a = min(a, b);
}
struct Data {
ll r, c;
} a[maxN];
void solve() {
int n;
ll ans = 0;
cin >> n;
for(int i = 1; i <= n; i++) cin >> a[i].r;
for(int i = 1; i <= n; i++) cin >> a[i].c;
sort(a + 1, a + 1 + n, [&](Data a_, Data b_) {return a_.r < b_.r;});
int r = 1, c = 1;
for(int i = 1; i <= n; i++) {
ll needr = a[i].r - r, needc = a[i].c - c;
//needr >= needc
if(!needr && !needc) continue;
//after 1 move, r always increase, r + c is always odd
if((r + c) % 2 == 0) {
if(needr == needc) {
ans += needr;
r = a[i].r, c = a[i].c;
continue;
}
r++; needr--;
ans += (needr - needc + 1) / 2;
} else {
ans += (needr - needc + 1) / 2;
}
r = a[i].r, c = a[i].c;
}
cout << ans << endl;
}
/*
6
3 4 7 10 11 12
3 4 6 9 9 10
*/
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
//freopen("input.inp", "r", stdin);
ll tc, ddd = 0;
cin >> tc;
while(tc--) {
//ddd++;
//cout << "Case #" << ddd << ": ";
solve();
}
}
| 12 | CPP |
s=input()
t=input()
c=0
for i in range(min(len(s),len(t))):
if s[-1-i]==t[-1-i]:
c+=1
else:
break
print(len(s)+len(t)-2*c)
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<pair<int, int>> v;
vector<int> vec;
int n, x, y;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x >> y;
v.push_back(pair<int, int>(x, y));
}
int count = 1;
int p = v[0].second, k = v[0].first;
for (int i = 1; i < v.size(); i++) {
if (p == v[i].second && k == v[i].first)
count++;
else {
p = v[i].second;
k = v[i].first;
count = 1;
}
vec.push_back(count);
}
sort(vec.begin(), vec.end());
if (vec.size() == 0) {
cout << count << endl;
} else
cout << vec[vec.size() - 1] << endl;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
int w,h;
cin >> w>>h;
vector<vector<int>>pq(w+h,vector<int>(2));
vector<int>p(w);
rep(i,w){
cin>>p.at(i);
pq.at(i).at(0)=p.at(i);
pq.at(i).at(1)=1;
}
vector<int>q(h);
rep(i,h){
cin>>q.at(i);
pq.at(i+w).at(0)=q.at(i);
pq.at(i+w).at(1)=2;
}
sort(pq.begin(),pq.end());
long ans=0;
long a=w+1;
long b=h+1;
rep(i,w+h){
if(pq.at(i).at(1)==1){
ans+=pq.at(i).at(0)*b;
a--;
}
else{
ans+=pq.at(i).at(0)*a;
b--;
}
}
cout<<ans<<endl;
}
| 0 | CPP |
a = int(input())
for _ in range(a):
x =int(input())
li = [1]*x
print(*li)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
int lcm(int a, int b) { return ((a * b) / gcd(a, b)); }
bool isPrime(long long n) {
if (n <= 1) return 0;
if (n <= 3) return 1;
if (n % 2 == 0)
return 0;
else {
for (long long i = 5; i * i <= n; i += 2) {
if (n % i == 0) return 0;
}
return 1;
}
}
template <class T>
inline T bigmod(T p, T e, T M) {
long long ret = 1;
for (; e > 0; e >>= 1) {
if (e & 1) ret = (ret * p) % M;
p = (p * p) % M;
}
return (T)ret;
}
template <class T>
inline T gcd(T a, T b) {
if (b == 0) return a;
return gcd(b, a % b);
}
template <class T>
inline T modinverse(T a, T M) {
return bigmod(a, M - 2, M);
}
using namespace std;
long long a[200005], sum = 0;
long long num[100];
map<long long, long long> ss;
int main() {
long long i, j, k, l, m, n, r;
cin >> n >> l >> r;
if (n == 0) {
cout << 0;
return 0;
}
if (n == 1) {
cout << 1;
return 0;
}
long long fl = 0;
long long x = n;
long long c = 1;
vector<long long> arr;
while (x != 1) {
if (x % 2 == 0) {
arr.push_back(c);
}
x /= 2;
c++;
}
for (auto it : arr) {
it = c - it;
num[it] = 1;
}
x = 1;
long long countt = 0;
for (j = l; j <= r; j++) {
x = 1;
long long fl = 0;
for (i = 1; i <= 51; i++) {
x *= 2;
if (j % x == 0) {
if (num[i] != 1)
fl = 0;
else
fl = 1;
}
}
if (fl == 0) countt++;
}
cout << countt;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int a[100005], n, s, l, range[100005];
struct node {
int ans;
} tree[4 * 100005];
node merge(node l, node r) {
node res;
res.ans = min(l.ans, r.ans);
return res;
}
void build(int v, int start, int end) {
if (start == end)
tree[v].ans = 1e9;
else {
int mid = (start + end) >> 1;
build(2 * v, start, mid);
build(2 * v + 1, mid + 1, end);
tree[v] = merge(tree[2 * v], tree[2 * v + 1]);
}
}
node query(int v, int start, int end, int l, int r) {
if (r < 0 or r < l) return tree[4 * 100004];
if (l == start and r == end) return tree[v];
int mid = (start + end) >> 1;
if (r <= mid) return query(2 * v, start, mid, l, r);
if (l > mid) return query(2 * v + 1, mid + 1, end, l, r);
return merge(query(2 * v, start, mid, l, mid),
query(2 * v + 1, mid + 1, end, mid + 1, r));
}
void update(int v, int start, int end, int idx, int val) {
if (start > idx or end < idx) return;
if (start == end) {
tree[v].ans = val;
return;
}
int mid = (start + end) >> 1;
update(2 * v, start, mid, idx, val);
update(2 * v + 1, mid + 1, end, idx, val);
tree[v] = merge(tree[2 * v], tree[2 * v + 1]);
}
multiset<int> bag;
bool check() {
int x = *bag.begin();
int y = *bag.rbegin();
return (y - x <= s);
}
int main() {
scanf("%d", &n);
scanf("%d", &s);
scanf("%d", &l);
tree[0].ans = 0, tree[4 * 100004].ans = 1e9;
build(1, 1, n);
int L = 1;
for (int(i) = (1); (i) <= (n); (i)++) {
scanf("%d", &a[i]);
bag.insert(a[i]);
while (!check()) {
bag.erase(bag.find(a[L]));
L += 1;
}
if (i - L + 1 >= l)
range[i] = i - L + 1;
else
range[i] = 0;
}
for (int(i) = (1); (i) <= (n); (i)++) {
int val;
if (range[i] == i)
update(1, 1, n, i, 1);
else
val = query(1, 1, n, i - range[i], i - l).ans + 1,
update(1, 1, n, i, val);
}
int ret = query(1, 1, n, n, n).ans;
if (ret > n)
printf("%d\n", -1);
else
printf("%d\n", ret);
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main()
{
set<int> s;
int t;
for(int i=0;i<6;i++)
{
cin>>t;
if(!s.count(t)) s.insert(t);
else s.erase(t);
}
if(s.size()==0 || s.size()==2) cout<<"YES\n";
else cout<<"NO\n";
return 0;
} | 0 | CPP |
# from sys import stdout
from bisect import bisect_left as bs
from math import log as lg
log = lambda *x: print(*x)
def cin(*fn, def_fn=str):
i,r = 0,[]
if fn: def_fn=fn[0]
for c in input().split(' '):
r+=[(fn[i] if len(fn)>i else def_fn) (c)]
i+=1
return r
n, = cin(int)
mx,u = 1,{'polycarp': 1}
for i in range(n):
n1,r,n2 = cin(str)
n1,n2 = n1.lower(),n2.lower()
u[n1] = 1+u[n2]
mx = max(u[n1], mx)
log(mx)
| 7 | PYTHON3 |
a=int(input())
for i in range(a):
b=input()
d=[]
c=len(b)
if(c==2):
print(b)
else:
k=0
for j in range(0,c):
if(k==0):
d.append(b[j])
k=1
else:
k=0
d.append(b[c-1])
print("".join(d)) | 7 | PYTHON3 |
import math
x1 = int(input())
for i in range(x1):
n = int(input())
m=0
c =(math.sqrt(n))
d=int((math.sqrt(n)))
if n==1:
print(0)
elif n==2:
print(1)
elif n==3 or n==4:
print(2)
elif c-d>0.5:
print(d*2)
elif (c-d)==0:
print(d*2-2)
else:
print(d*2-1)
| 9 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e6 + 5;
int Case;
namespace G {
int n, m;
int hed[N], to[N], nxt[N], cnt;
int deg[N], u[N], v[N], d[N], vis[N], par[N], del[N];
bool vis2[N];
inline void adde(int u, int v) {
del[cnt + 1] = 0;
++cnt;
to[cnt] = v, nxt[cnt] = hed[u];
hed[u] = cnt;
}
inline void read() {
cnt = 1;
cin >> n >> m;
for (int i = 1; i <= m; i++) {
scanf("%d%d", &u[i], &v[i]);
deg[u[i]]++, deg[v[i]]++;
}
}
inline void output(vector<int> del) {
vector<bool> ans(n + 1, 0);
if ((int)del.size() == n) {
puts("No");
} else {
puts("Yes");
printf("%d\n", n - (int)del.size());
for (size_t i = 0; i < del.size(); i++) ans[del[i]] = 1;
for (int i = 1; i <= n; i++) {
if (!ans[i]) printf("%d ", i);
}
puts("");
}
}
vector<int> ret;
int rt, Rt[N], dep[N];
inline void dfs(int x, int pre) {
dep[x] = dep[pre] + 1;
Rt[x] = rt;
par[x] = pre;
vis[x] = 1;
int T = 0;
for (int i = hed[x]; i; i = nxt[i]) {
int v = to[i];
if (v == pre) continue;
if (vis[v]) {
if (dep[v] < dep[x]) {
if (!ret.size()) {
if (!T)
T = v;
else if (dep[v] > dep[T])
T = v;
}
}
}
}
if (T) {
int cur = x;
ret.push_back(cur);
while (cur != T) {
cur = par[cur];
ret.push_back(cur);
}
}
for (int i = hed[x]; i; i = nxt[i]) {
int v = to[i];
if (!vis[v]) {
dfs(v, x);
}
}
}
vector<int> getpath(int x, int y) {
bool tag = 0;
if (dep[x] < dep[y]) swap(x, y), tag = 1;
vector<int> a, b;
while (dep[x] > dep[y]) {
a.push_back(x);
x = par[x];
}
while (x != y) {
a.push_back(x), b.push_back(y);
x = par[x], y = par[y];
}
a.push_back(x);
reverse(b.begin(), b.end());
for (size_t i = 0; i < b.size(); i++) a.push_back(b[i]);
if (tag) reverse(a.begin(), a.end());
return a;
}
bool sx[N], sy[N];
void Answer(int x, vector<int> path, int y) {
for (int i = 1; i <= n; i++) sx[i] = sy[i] = 0;
for (int i = 1; i <= m; i++) {
if (u[i] == x) sx[v[i]] = 1;
if (u[i] == y) sy[v[i]] = 1;
}
for (int i = 0; i < (int)path.size(); i++)
if (sy[path[i]]) {
path.resize(i + 1);
break;
}
vector<int> s;
for (int i = (int)path.size() - 1; ~i; i--) {
s.push_back(path[i]);
if (sx[path[i]]) break;
}
s.push_back(x), s.push_back(y);
output(s);
}
vector<pair<int, int> > s[N];
vector<int> RRR;
int delnode[N];
inline int DF(int x, int pre) {
if (sx[x]) {
RRR.push_back(x);
return x;
}
int T = 0;
for (int i = hed[x]; i; i = nxt[i])
if (to[i] != pre && !delnode[to[i]]) {
int ret = DF(to[i], x);
if (ret > 0) {
T = 1;
break;
}
}
if (T) RRR.push_back(x);
return T;
}
void Sol(int nd1, int cnt0) {
for (int i = 1; i <= n; i++) sx[i] = 0;
for (int i = 1; i <= m; i++)
if (u[i] == cnt0) sx[v[i]] = 1;
RRR.push_back(nd1);
int R = 2;
if (sx[nd1]) R--;
for (int i = hed[nd1]; i; i = nxt[i]) {
int v = to[i];
if (DF(v, nd1)) R--;
if (!R) break;
}
}
inline void solve() {
int BLOCKS = 0;
for (int i = 1; i <= n; i++) {
if (deg[i] % 3 == 0) {
output(vector<int>(1, i));
return;
}
}
for (int i = 1; i <= m; i++) {
if (deg[u[i]] % 3 == 1 && deg[v[i]] % 3 == 1) {
vector<int> r(2, 0);
r[0] = u[i], r[1] = v[i];
output(r);
return;
}
if (deg[u[i]] % 3 == 2 && deg[v[i]] % 3 == 2) {
adde(u[i], v[i]), adde(v[i], u[i]);
d[u[i]]++, d[v[i]]++;
}
}
ret.clear();
for (int i = 1; i <= n; i++)
if (deg[i] % 3 == 2 && !vis[i]) {
BLOCKS++;
rt = i;
dfs(i, 0);
}
if (ret.size()) {
output(ret);
return;
}
vector<int> cnt1;
for (int i = 1; i <= n; i++)
if (deg[i] % 3 == 1) cnt1.push_back(i);
if ((int)cnt1.size() > 1) {
for (int i = 1; i <= m; i++) {
if (deg[u[i]] % 3 == 2 && deg[v[i]] % 3 == 1) swap(u[i], v[i]);
if (deg[u[i]] % 3 == 1 && deg[v[i]] % 3 == 2) {
int r = Rt[v[i]];
s[r].push_back(pair<int, int>(u[i], v[i]));
}
}
for (int i = 1; i <= n; i++)
if (s[i].size()) {
sort(s[i].begin(), s[i].end());
for (int j = 1; j < (int)s[i].size(); j++) {
if (s[i][j].first != s[i][j - 1].first) {
vector<int> ret = getpath(s[i][j].second, s[i][j - 1].second);
Answer(s[i][j].first, ret, s[i][j - 1].first);
return;
}
}
}
} else {
RRR.clear();
for (int i = 1; i <= m; i++)
if (deg[u[i]] % 3 == 2 && deg[v[i]] % 3 == 1) swap(u[i], v[i]);
for (int i = 1; i <= n; i++) sx[i] = 0, delnode[i] = 0, vis2[i] = 0;
for (int i = 1; i <= m; i++)
if (u[i] == cnt1[0]) sx[v[i]] = 1;
RRR.push_back(cnt1[0]);
for (int i = 1; i <= n; i++) vis2[i] = 0;
int T = 2;
for (int i = 1; i <= n; i++)
if (deg[i] % 3 == 2) {
if (!vis2[Rt[i]]) {
vis2[Rt[i]] = 1, Sol(i, cnt1[0]), T--;
}
if (T == 0) {
break;
}
}
output(RRR);
return;
}
}
void clear() {
for (int i = 1; i <= n; i++)
dep[i] = Rt[i] = par[i] = vis[i] = hed[i] = 0, d[i] = deg[i] = 0;
cnt = 1;
for (int i = 1; i <= n; i++) s[i].clear();
}
} // namespace G
int main() {
int T;
cin >> T;
while (T--) {
Case++;
G::read();
G::solve();
G::clear();
}
}
| 12 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k, s;
cin >> n >> k >> s;
long long num = s / k;
long long oneplus = s % k;
if (num >= n || k > s) {
cout << "NO" << endl;
return 0;
} else if (oneplus != 0 && (num + 1) >= n) {
cout << "NO" << endl;
return 0;
}
long long prev = 1;
cout << "YES" << endl;
for (int i = 1; i <= oneplus; i++) {
if ((prev + num + 1) > n)
prev = prev - (num + 1);
else
prev = prev + (num + 1);
cout << prev << " ";
}
k -= oneplus;
for (int i = 1; i <= k; i++) {
if ((prev + num) > n)
prev = prev - num;
else
prev = prev + num;
cout << prev << " ";
}
return 0;
}
| 10 | CPP |
#http://codeforces.com/contest/601/problem/A
import sys
from collections import deque
n, m = map(int, input().split())
g = set()
for i in range(m):
x, y = map(int, input().split())
x -= 1
y -= 1
g |= {(x, y), (y, x)}
cut = (0, n-1) in g
q = deque()
q.append(0)
d = [-1] * n
d[0] = 0
while len(q):
x = q.popleft()
for y in range(n):
if cut ^ ((x, y) in g) and (d[y] == -1 or d[y] > d[x] + 1):
d[y] = d[x] + 1
q.append(y)
print(d[n-1])
| 7 | PYTHON3 |
for _ in range(int(input())):
n=int(input())
a=[int(i) for i in input().split()]
ans=0
summ=0
for i in range(n):
ans^=a[i]
summ+=a[i]
summ+=ans
print(2)
print(ans,summ)
| 9 | PYTHON3 |
#include <stdio.h>
int main() {
int n,a,max,min;
max = (-999999999);
scanf("%d", &n);
scanf("%d", &min);
for (int i = 0; i < n-1; i++){
scanf("%d", &a);
max = max >= a-min ? max : a-min;
min = min <= a ? min : a;
}
printf("%d\n", max);
}
| 0 | CPP |
n=int(input())
a=input().split()
z={}
ans=['A']*n
for x in a:
if x in z.keys():
z[x]+=1
else:
z[x]=1
kb,ka=0,0
for i,x in enumerate(a):
if z[x]==1:
if ka>kb:
kb+=1
ans[i]='B'
else:
ka+=1
ans[i]='A'
if ka>kb:
for i,x in enumerate(a):
if z[x]>2:
ans[i]='B'
kb+=1
break
if ka==kb:
print("YES")
print(''.join(ans))
else:
print("NO")
| 9 | PYTHON3 |
n, m = map(int, input().split(" "))
points = []
pointOfBoundary = []
for i in range(n):
l, r = map(int, input().split(" "))
for j in range(l, r + 1):
points.append(j)
for i in range(1, m + 1):
if i not in points:
pointOfBoundary.append(i)
length = len(pointOfBoundary)
print(length)
if length != 0:
if length == 1:
print(pointOfBoundary[0])
else:
for i in range(0, length - 1):
print(pointOfBoundary[i], end = ' ')
print(pointOfBoundary[-1])
| 7 | PYTHON3 |
#include <bits/stdc++.h>
#pragma GCC Optimize("Ofast");
using namespace std;
int main(int argc, char const *argv[]) {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cerr.tie(NULL);
cout.tie(NULL);
;
int tests = 1;
while (tests--) {
int N;
cin >> N;
vector<int> arr(N);
for (auto &it : arr) cin >> it;
long long sum = 0;
for (int i = 0; i < N; ++i) sum += arr[i];
if (sum % 3) {
cout << 0 << "\n";
} else {
sum /= 3;
long long suffixSum = 0;
vector<int> count(N, 0);
for (int i = N - 1; i >= 0; --i) {
suffixSum += arr[i];
if (suffixSum == sum) count[i] = 1;
}
for (int i = N - 2; i >= 0; --i) {
count[i] += count[i + 1];
}
suffixSum = 0;
long long ans = 0;
for (int i = 0; i < N - 2; ++i) {
suffixSum += arr[i];
if (suffixSum == sum) ans += count[i + 2];
}
cout << ans << "\n";
}
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline T qmin(const T &a, const T &b) {
return a < b ? a : b;
}
template <typename T>
inline T qmax(const T &a, const T &b) {
return a > b ? a : b;
}
template <typename T>
inline void getmin(T &a, const T &b) {
if (a > b) a = b;
}
template <typename T>
inline void getmax(T &a, const T &b) {
if (a < b) a = b;
}
inline void fileio(string s) {
freopen((s + ".in").c_str(), "r", stdin);
freopen((s + ".out").c_str(), "w", stdout);
}
const int inf = (int)1e9 + 7;
const long long linf = (long long)1e17 + 7;
const int N = 1e5 + 7;
int u[N], v[N], w[N], nxt[N];
int head[N];
long long dist[N];
int n, m, q, tot;
priority_queue<pair<long long, int>, vector<pair<long long, int> >,
greater<pair<long long, int> > >
pq;
inline void init() {
pq.push(make_pair(0, 1));
for (register int i = (2); i <= (n); ++i) dist[i] = linf;
while (!pq.empty()) {
pair<long long, int> p = pq.top();
pq.pop();
int u = p.second;
long long d = p.first;
if (dist[u] != d) continue;
for (int e = head[u]; e; e = nxt[e]) {
if (dist[v[e]] <= dist[u] + w[e]) continue;
dist[v[e]] = dist[u] + w[e];
pq.push(make_pair(dist[v[e]], v[e]));
}
}
for (register int i = (1); i <= (m); ++i) w[i] -= dist[v[i]] - dist[u[i]];
}
vector<int> pos[1000006];
int tmp[N];
inline void upd() {
if (!tot) return;
for (register int i = (2); i <= (n); ++i) tmp[i] = inf;
for (register int i = (0); i <= (tot); ++i) pos[i].clear();
pos[0].push_back(1);
for (register int cur = (0); cur <= (tot); ++cur) {
for (register int i = 0; i < (pos[cur].size()); ++i) {
int u = pos[cur][i];
if (tmp[u] != cur) continue;
for (int e = head[u]; e; e = nxt[e]) {
if (tmp[v[e]] <= cur + w[e]) continue;
tmp[v[e]] = cur + w[e];
if (tmp[v[e]] <= tot) pos[tmp[v[e]]].push_back(v[e]);
}
}
}
tot = 0;
for (register int i = (1); i <= (m); ++i) w[i] -= tmp[v[i]] - tmp[u[i]];
for (register int i = (2); i <= (n); ++i)
if (tmp[i] != inf) dist[i] += tmp[i];
}
int main() {
scanf("%d%d%d", &n, &m, &q);
for (register int i = (1); i <= (m); ++i) {
scanf("%d%d%d", u + i, v + i, w + i);
nxt[i] = head[u[i]];
head[u[i]] = i;
}
init();
while (q--) {
int tp;
scanf("%d", &tp);
if (tp == 1) {
int u;
scanf("%d", &u);
upd();
printf("%lld\n", dist[u] == linf ? -1 : dist[u]);
} else if (tp == 2) {
int num, c;
scanf("%d", &num);
tot += num;
while (num--) {
scanf("%d", &c);
++w[c];
}
} else
assert(false);
}
return 0;
}
| 10 | CPP |
n,m=(int(i) for i in input().split())
l=[i for i in range(1,m+1)]
for i in range(n):
l1,r1=(int(i) for i in input().split())
for j in range(l1,r1+1):
if(j in l):
l.remove(j)
print(len(l))
print(*l) | 7 | PYTHON3 |
for i in range(int(input())):
a, b = map(int, input().split())
if a == 1 or b == 1:
print(pow(b, 2))
else:
ans = [0]*a
while(b != 0):
for i in range(a):
if b == 0:
break
else:
ans[i] += 1
b -= 1
count = 0
for i in range(len(ans)):
count += pow(ans[i], 2)
print(count)
| 7 | PYTHON3 |
n,m = map(int , input().split())
l = [int(i) for i in input().split()] ; sumans = sum(l[:m]) ; temp = sumans
j = m
for i in range(1,n-m+1):
temp += l[j]
temp -= l[i-1]
sumans += temp
j+=1
print(sumans/(n-m+1))
| 8 | PYTHON3 |
Valor=0
for i in range(int(input())):
palabra = str(input())
if palabra.count('+') > 1: Valor +=1
else: Valor -=1
print(Valor)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
int t, n, m, x, y;
vector<int> s[N], v[N];
queue<pair<int, int>> Q;
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
bool check(int x, int y) {
int cnt = 0;
for (int i = 0; i < 4; i++) {
int a = x + dx[i], b = y + dy[i];
if (a >= 1 && a <= n && b >= 1 && b <= m) {
if (s[a][b] != 1) continue;
if (!v[a][b]) cnt++;
}
}
return cnt <= 1;
}
int main() {
cin >> t;
while (t--) {
cin >> n >> m;
for (int i = 1; i <= n; i++)
s[i].clear(), v[i].clear(), s[i].resize(m + 1), v[i].resize(m + 1);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) {
char c;
cin >> c;
if (c == 'L')
x = i, y = j;
else if (c == '#')
s[i][j] = 2;
else
s[i][j] = 1;
}
Q.push({x, y});
v[x][y] = 1;
while (Q.size()) {
auto k = Q.front();
Q.pop();
int a = k.first, b = k.second;
for (int i = 0; i < 4; i++) {
int A = a + dx[i], B = b + dy[i];
if (A >= 1 && A <= n && B >= 1 && B <= m) {
if (v[A][B] || s[A][B] == 2) continue;
if (check(A, B)) {
v[A][B] = 1;
Q.push({A, B});
}
}
}
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
if (i == x && j == y)
cout << 'L';
else {
if (v[i][j])
cout << '+';
else if (s[i][j] == 2)
cout << '#';
else
cout << '.';
}
}
cout << '\n';
}
}
return 0;
}
| 11 | CPP |
#include<vector>
#include<list>
#include<algorithm>
#include<iostream>
#include<string>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
int f(int r[],int t[],int s[],int d[],int n,int c,int m){
int i;
int l=m;
if(d[c]<m){
d[c]=m;
for(i=c+1;i<n;i++){
if(r[i]<r[c]&&t[i]<t[c])
l=max(l,f(r,t,s,d,n,i,m+1));
}
return l;
}else
return 0;
}
int main(){
int h,i;
int m,n,o,r[200],t[200],s[200],d[200];
for(;;){
cin>>m;
if(m==0)
break;
for(i=0;i<m;i++){
cin>>t[i]>>r[i];
s[i]=r[i]*r[i]*t[i];
}
cin>>n;
for(;i<m+n;i++){
cin>>t[i]>>r[i];
s[i]=r[i]*r[i]*t[i];
}
do{
h=0;
for(i=1;i<m+n;i++){
if(s[i-1]<s[i]){
swap(s[i-1],s[i]);
swap(t[i-1],t[i]);
swap(r[i-1],r[i]);
h=1;
}
}
}while(h);
o=0;
memset(d,0,sizeof(d));
for(i=0;i<m+n;i++)
o=max(o,f(r,t,s,d,m+n,i,1));
cout<<o<<endl;
}
return 0;
}
| 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x;
cin >> n >> x;
long long sumIce = x;
int leaveChild = 0;
for (int i = 0; i < n; i++) {
char a;
int giveIce;
cin >> a >> giveIce;
if (a == '+') {
sumIce += giveIce;
} else {
if (sumIce >= giveIce) {
sumIce -= giveIce;
} else {
leaveChild++;
}
}
}
cout << sumIce << " " << leaveChild << endl;
return 0;
}
| 7 | CPP |
n = int(input())
a = [int(i) for i in input().split()]
a.sort()
u = [False] * n
uc = 0
b = []
while uc < n:
p = -1
for i in range(n):
if (not u[i]) and (a[i] != p):
b += [a[i]]
u[i] = True
uc += 1
p = a[i]
#print(b)
c = 0
for i in range(1, n):
if b[i] > b[i - 1]:
c += 1
print(c)
| 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e18 + 10;
const int inf = 1e9 + 10, dx[] = {0, 0, 1, -1, 1, -1, 1, -1},
dy[] = {1, -1, 0, 0, 1, 1, -1, -1};
long long MOD = 1e9 + 7;
long double eps = 1e-7, pi = acos(-1);
const int MAX = 100100;
int n;
long double r, x[1010], y[1010], a, b, c, delta;
bool get_y(long double x1, long double y1, long double x2, long double &y2) {
a = 1.0;
b = -2.0 * y1;
c = y1 * y1 + pow(x1 - x2, 2) - 4 * r * r;
if (b * b < 4 * c) return 0;
delta = sqrt(b * b - 4 * a * c);
long double ans1 = (-b - delta) / (2.0 * a);
long double ans2 = (-b + delta) / (2.0 * a);
y2 = max(ans1, ans2);
}
int main() {
ios_base::sync_with_stdio(0);
cin >> n >> r;
for (int i = 0; i < n; i++) {
cin >> x[i];
}
y[0] = r;
cout << setprecision(10) << fixed << y[0] << " ";
for (int i = 1; i < n; i++) {
long double y2 = -1, ans = -1;
int all_test = 0;
for (int j = 0; j < i; j++) {
all_test += get_y(x[j], y[j], x[i], y2);
ans = max(ans, y2);
}
if (all_test == 0)
y[i] = r;
else
y[i] = ans;
cout << y[i] << " ";
}
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
map<int, int> N;
for (int i = 1; i < n + 1; i++) {
int tmp;
cin >> tmp;
N[tmp] = i;
}
int M[11] = {-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1};
for (int i = 1; i < m + 1; i++) {
int tmp;
cin >> tmp;
if (N[tmp]) M[N[tmp]] = tmp;
}
for (int i = 1; i < n + 1; i++) {
if (M[i] != -1) cout << M[i] << ' ';
}
return 0;
}
| 7 | CPP |
import sys
input=sys.stdin.readline
from queue import Queue
#sys.setrecursionlimit(10**8)
t=1
import math
def bfs(a,i,dis,vis):
vis[i]=1
s=0;e=0
pp=[0 for i in range(n+5)]
pp[0]=i
while s!=e+1:
z= pp[s]
s+=1
vis[z]=1
for j in a[z]:
if vis[j]==0:
dis[j]=min(dis[j],dis[z]+1)
e+=1
pp[e]=j
vis[j]=1
#print(s,e,pp)
while t>0:
t-=1
n=int(input())
b=[int(x) for x in input().split()]
a=[[] for i in range(n+1)]
for i in range(n):
x=i+1
y=b[i]
if i!=n-1:
a[i+1].append(i+2)
if i!=0:
a[i+1].append(i)
if x==y:
continue
a[x].append(y)
#a[y].append(x)
vis=[0 for i in range(n+1)]
dis=[i-1 for i in range(n+1)]
bfs(a,1,dis,vis)
for i in range(1,n+1):
print(dis[i],end=" ") | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long num = 0, ans = 0;
while (num * 10 + 9 <= n + n - 1) num = num * 10 + 9;
for (long long i = num; i <= n + n - 1; i += num + 1) {
ans += (i - max(1ll, i - n) * 2 + 1) / 2;
}
cout << ans << endl;
return 0;
}
| 10 | CPP |
from math import ceil
class Solution:
def __init__(self):
self.r, self.x, self.y, self.x_, self.y_ = [int(x) for x in input().split()]
def solve_and_print(self):
print(ceil(((abs(self.x_-self.x)**2 + abs(self.y_-self.y)**2)**0.5)/(self.r<<1)))
if __name__ == "__main__":
Solution().solve_and_print() | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, m, b;
int ans = 0, ans2;
int main() {
cin >> n >> m >> b;
ans2 = b * n;
while (n > 1) {
int x = n / 2;
ans += (x * 2 * m);
ans += x;
n = (n / 2) + n % 2;
}
cout << ans << " " << ans2 << endl;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 10;
priority_queue<pair<int, int> > que;
vector<pair<int, int> > vc[N];
int vis[N], l[N], r[N];
vector<int> ans;
int main() {
int n, k, mx = -1;
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++) {
cin >> l[i] >> r[i];
mx = max(mx, r[i]);
vc[l[i]].push_back({1, i});
vc[r[i] + 1].push_back({-1, i});
}
int nw = 0;
for (int i = 1; i <= mx; i++) {
for (int j = 0; j < vc[i].size(); j++) {
if (vis[vc[i][j].second]) continue;
nw += vc[i][j].first;
if (vc[i][j].first == -1)
vis[vc[i][j].second] = 1;
else
que.push({r[vc[i][j].second], vc[i][j].second});
}
while (nw > k) {
pair<int, int> pii = que.top();
que.pop();
if (pii.first >= i && vis[pii.second] == 0) {
ans.push_back(pii.second);
vis[pii.second] = 1;
nw--;
}
}
}
printf("%d\n", ans.size());
sort(ans.begin(), ans.end());
for (int i = 0; i < ans.size(); i++) {
printf("%d ", ans[i]);
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, m;
char p[1000007], q[1000007], s[1000007];
pair<int, int> f[1000007], pf[1000007];
struct seg {
int a, k, len;
};
vector<seg> G, x, y;
void dp() {
for (int i = 1; i <= n; i++) f[i] = make_pair(2000000007, 0);
f[0] = make_pair(0, 0);
for (int i = 1; i <= n; i++) {
x.clear(), y.clear();
for (int j = 0; j < (int)G.size(); j++)
if (G[j].a > 1 && s[G[j].a - 1] == s[i])
x.push_back((seg){G[j].a - 1, G[j].k, G[j].len});
int r = -n;
for (int j = 0; j < (int)x.size(); j++) {
if (x[j].a - x[j].k == r)
y.push_back(x[j]);
else {
y.push_back((seg){x[j].a, x[j].a - r, 1});
if (x[j].len > 1)
y.push_back((seg){x[j].a + x[j].k, x[j].k, x[j].len - 1});
}
r = x[j].a + x[j].k * (x[j].len - 1);
}
if (i > 1 && s[i - 1] == s[i]) {
y.push_back((seg){i - 1, i - r - 1, 1});
r = i - 1;
}
y.push_back((seg){i, i - r, 1});
G.clear();
seg t = y[0];
for (int j = 1; j < (int)y.size(); j++)
if (t.k == y[j].k)
t.len += y[j].len;
else {
G.push_back(t);
t = y[j];
}
G.push_back(t);
if (s[i] == s[i - 1]) f[i] = make_pair(f[i - 2].first, i - 2);
for (int j = 0; j < (int)G.size(); j++) {
int rx = G[j].a + G[j].k * (G[j].len - 1);
pair<int, int> now = make_pair(f[rx - 1].first + 1, rx - 1);
if (G[j].len > 1) now = min(now, pf[G[j].a - G[j].k]);
if (G[j].a >= G[j].k) pf[G[j].a - G[j].k] = now;
if (i % 2 == 0) f[i] = min(f[i], now);
}
}
}
int main() {
scanf("%s", p + 1);
scanf("%s", q + 1);
m = strlen(p + 1);
for (int i = 1; i <= 2 * m; i++)
if (i % 2 == 1)
s[i] = p[i / 2 + 1];
else
s[i] = q[i / 2];
n = 2 * m;
dp();
if (f[n].first > m)
printf("%d\n", -1);
else {
printf("%d\n", f[n].first);
int now = n;
while (now > 0) {
int pos = f[now].second;
if (pos < now - 2) printf("%d %d\n", pos / 2 + 1, now / 2);
now = pos;
}
}
return 0;
}
| 11 | CPP |
from sys import setrecursionlimit
setrecursionlimit(10**6)
from collections import deque
import heapq
import functools
def IntInput(): return int(input())
def M_IntInput(): return map(int,input().split())
def M_StrInput(): return map(int,input().split())
def IntArrayInput(): return list(map(int,input().split()))
def modInverse(p,a,m): return ((p%m)*pow(a%m,m-2,m))%m
def compare(item1, item2): return item2[0] - item1[0] if item1[0]!=item2[0] else item1[1] - item2[1]
# -----------------------Anshul Raj------------------------ #
def DFS(s,n,paths,answer):
visited = [False] * (n+1)
stack = []
stack.append(s)
visited[s] = True
DFSArray = []
while stack:
s = stack.pop()
DFSArray.append(s)
flag = 0
for i in paths[s]:
if visited[i] == False:
flag=1
stack.append(i)
visited[i] = True
if not flag:
# print("Leaf ->",s)
answer[s-1][1]=0
# print(answer)
# print("DFS -->",DFSArray)
while DFSArray!=[]:
s = DFSArray.pop()
if answer[s-1][1]<0:
answer[s-1][1] = 0
for i in paths[s]:
# print("child",s,i,answer[i-1][1])
if answer[i-1][1]>=0:
answer[s-1][1] += answer[i-1][1]+1
# print("childCount -->",s,answer[s-1][1])
return answer
def BFS(s,n,paths,answer):
visited = [False] * (n+1)
answer[s-1][0] = 0
queue = deque()
queue.append(s)
visited[s] = True
while queue:
s = deque.popleft(queue)
for i in paths[s]:
if visited[i] == False:
queue.append(i)
answer[i-1][0] = answer[s-1][0] + 1
visited[i] = True
return answer
n,k = M_IntInput()
paths = {}
AnswerArray = [[-1,-1] for i in range(n)]
for _ in range(n-1):
u,v = M_IntInput()
if u in paths: paths[u].append(v)
else: paths[u] = [v]
if v in paths: paths[v].append(u)
else: paths[v] = [u]
if k==n:
print(0)
elif k==n-1:
print(n-1)
else:
AnswerArray = BFS(1,n,paths,AnswerArray)
AnswerArray = DFS(1,n,paths,AnswerArray)
# print(AnswerArray)
AnswerArray.sort(key=lambda x: x[0] - x[1],reverse = True)
# print(AnswerArray)
ans = 0
for i in range(k):
ans += AnswerArray[i][0] - AnswerArray[i][1]
print(ans) | 9 | PYTHON3 |
s = input()
t = input()
u = ''
for i in range (len(s)):
u+=s[len(s)-i-1]
if (t==u):
print ('YES')
else:
print ('NO') | 7 | PYTHON3 |
#include <stdio.h>
int main(void){
int i,l=0;
char s[11],a[11]={};
scanf("%s",s);
for (i=0;s[i];i++){
if (s[i]=='B'){
if (l){
l--;
a[l]='\0';
}
}else{
a[l]=s[i];
l++;
}
}
printf("%s\n",a);
return 0;
} | 0 | CPP |
#include <iostream>
#include <cstdio>
#define MN 42
typedef long long ll;
ll s[MN][MN][MN], f[MN][MN][MN], g[MN][MN][MN][MN];
int a[MN][MN];
int main()
{
int n; scanf("%d", &n); n *= 2;
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++) scanf("%1d", &a[i][j]);
for(int len = 1; len <= n; len++)
for(int l = 1; l + len - 1 <= n; l++)
{
int r = l + len - 1;
if(l == r) f[l][r][l] = 1;
for(int i = l; i <= r; i++)
{
for(int j = i + 1; j <= r; j++)
{
if(!g[l][i][j][r]) continue;
for(int k = i + 1; k < j; k++)
f[l][r][k] += f[i + 1][j - 1][k] * g[l][i][j][r];
}
}
for(int k = l; k <= r; k++)
{
if(!f[l][r][k]) continue;
for(int k2 = 1; k2 <= n; k2++)
if(a[k2][k]) s[l][r][k2] += f[l][r][k];
}
for(int LEN = 1; LEN <= len; LEN++)
for(int L = 1; L + LEN - 1 < l; L++)
{
int R = L + LEN - 1;
for(int k = L; k <= R; k++)
g[L][R][l][r] += f[L][R][k] * s[l][r][k];
}
for(int LEN = 1; LEN < len; LEN++)
for(int L = r + 1; L + LEN - 1 <= n; L++)
{
int R = L + LEN - 1;
for(int k = L; k <= R; k++)
g[l][r][L][R] += f[L][R][k] * s[l][r][k];
}
}
ll ans = 0;
for(int k = 2; k <= n; k++) if(a[1][k]) ans += f[2][n][k];
printf("%lld\n", ans);
} | 0 | CPP |
numbers = [int(i)for i in input().split()]
n = numbers[0]
k = numbers[1]
letters = "abcdefghijklmnopqrstuvwxyz"
reps = n//k
remains = n%k
if n<26:
password=letters[0:n+1]
new_password = (password[0:k]*(reps))+password[0:remains]
print(new_password)
else:
reps1 = n//26
remains1 = n%26
password = letters[0:26]*reps1 + letters[0:remains1]
new_password = (password[0:k]*(reps))+password[0:remains]
print(new_password)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 0;
const int LOGN = 0;
const int MOD = 1e9 + 7;
const int INF = 1e9 + 10;
long long N, Q;
long long x;
long long f(long long x) {
if (x & 1) return (x + 1) >> 1;
long long id = N - (x >> 1);
while (!(id & 1)) id /= 2;
--id;
id /= 2;
return N - id;
}
void read() {
cin >> N >> Q;
while (Q--) {
cin >> x;
cout << f(x) << "\n";
}
return;
}
int main() { read(); }
| 8 | CPP |
N = int(input())
K = 0
k = 0
while K < N:
k += 1
K += k
while N > 0:
if N >= k:
print(k)
N -= k
k -= 1 | 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, count;
cin >> n;
if (n % 2 != 0)
count = 0;
else {
if (n % 4 == 0)
count = n / 4 - 1;
else
count = n / 4;
}
cout << count;
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
const int N = 1e5 + 10;
char s[N];
int a[N], n, q;
int sum[4 * N];
void up(int id, int l, int r, int pos, int val, int ty) {
if (l == r) {
if (ty == 1) {
sum[id] = (1 << val);
} else
sum[id] = 0;
return;
}
int mid = l + r >> 1;
if (pos <= mid)
up(id << 1, l, mid, pos, val, ty);
else
up(id << 1 | 1, mid + 1, r, pos, val, ty);
sum[id] = sum[id << 1] | sum[id << 1 | 1];
}
int qu(int id, int l, int r, int ql, int qr) {
if (ql <= l && r <= qr) {
return sum[id];
}
int mid = l + r >> 1;
int ans = 0;
if (ql <= mid) ans |= qu(id << 1, l, mid, ql, qr);
if (qr > mid) ans |= qu(id << 1 | 1, mid + 1, r, ql, qr);
return ans;
}
int cal(int x) {
int ans = 0;
while (x) {
if (x & 1) ans++;
x = x / 2;
}
return ans;
}
int main() {
scanf("%s", s + 1);
n = strlen(s + 1);
scanf("%d", &q);
for (int i = 1; i <= n; ++i) {
up(1, 1, n, i, s[i] - 'a', 1);
}
while (q--) {
int ty;
scanf("%d", &ty);
if (ty == 2) {
int l, r;
scanf("%d%d", &l, &r);
int ans = qu(1, 1, n, l, r);
printf("%d\n", cal(ans));
} else {
int pos;
char c[5];
scanf("%d%s", &pos, c);
int val = c[0] - 'a';
up(1, 1, n, pos, val, 2);
up(1, 1, n, pos, val, 1);
}
}
}
| 10 | CPP |
#include<bits/stdc++.h>
using namespace std;
int s[1005],n,k,sum;
int main()
{
scanf("%d%d",&n,&k);
for(int i=0;i<n;i++)
scanf("%d",&s[i]);
sort(s,s+n);
for(int i=0;i<k;i++)
sum+=s[i];
printf("%d",sum);
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5, mod = 1000000007;
int main() {
int n, m, t;
scanf("%d", &t);
while (t--) {
scanf("%d", &n);
long long ans = 1;
for (int i = 3; i <= n * 2; i++) {
ans = ans * i % mod;
}
printf("%lld\n", ans);
}
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
v.push_back(a);
}
if (n == 0) {
cout << "YES" << endl;
cout << 1 << endl;
cout << 1 << endl;
cout << 3 << endl;
cout << 3 << endl;
return 0;
}
if (n == 1) {
int val1 = v[0];
int val2 = v[0] + 1;
int val3 = val1 * 4 - val2;
int val4 = val1 * 3;
cout << "YES" << endl;
cout << val2 << endl;
cout << val3 << endl;
cout << val4 << endl;
} else if (n == 4) {
sort(v.begin(), v.end());
if (v[0] * 3 == v[3] && v[1] + v[2] == v[0] * 4)
cout << "YES" << endl;
else
cout << "NO" << endl;
} else if (n == 2) {
int val1 = v[0];
int val2 = v[1];
if (val1 > val2) swap(val1, val2);
int val4 = val1 * 3;
int val3 = val1 * 4 - val2;
int mn = min(val2, val3);
int mx = max(val2, val3);
if (mn >= val1 && mx <= val4) {
cout << "YES" << endl;
cout << val3 << endl;
cout << val4 << endl;
return 0;
}
if (val2 % 3 == 0 && val2 / 3 == val1) {
int now1 = val1 + 1;
int now2 = val1 * 4 - now1;
mn = min(now1, now2);
mx = max(now1, now2);
if (mn >= val1 && mx <= val2) {
cout << "YES" << endl;
cout << now1 << endl;
cout << now2 << endl;
return 0;
}
}
if (val2 % 3 == 0) {
int now1 = val2 / 3;
int temp = now1 * 4;
int now2 = temp - val1;
mn = min(val1, now2);
mx = max(val1, now2);
if (mn >= now1 && mx <= val2) {
cout << "YES" << endl;
cout << now1 << endl;
cout << now2 << endl;
return 0;
}
}
if ((val1 + val2) % 4 == 0) {
int now1 = (val1 + val2) / 4;
int now4 = now1 * 3;
mn = min(val2, val1);
mx = max(val2, val1);
if (mn >= now1 && mx <= now4) {
cout << "YES" << endl;
cout << now1 << endl;
cout << now4 << endl;
return 0;
}
}
cout << "NO" << endl;
} else if (n == 3) {
sort(v.begin(), v.end());
if ((v[1] + v[2]) % 4 == 0 && ((v[1] + v[2]) / 4) == v[0] &&
v[0] * 3 >= v[2]) {
cout << "YES" << endl;
cout << v[0] * 3 << endl;
return 0;
}
if (v[2] % 3 == 0 && v[2] / 3 == v[0]) {
int now2 = v[0] * 4 - v[1];
int mn = min(now2, v[1]);
int mx = max(now2, v[1]);
if (mn >= v[0] && mx <= v[2]) {
cout << "YES" << endl;
cout << now2 << endl;
return 0;
}
}
if (v[2] % 3 == 0) {
int now1 = v[2] / 3;
if (v[0] + v[1] == now1 * 4) {
cout << "YES" << endl;
cout << now1 << endl;
return 0;
}
}
cout << "NO" << endl;
}
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
long double m, n, ans;
long double dp[100000 + 1];
int main() {
cin >> m >> n;
ans = 0;
long double total = pow(m, n);
for (int ii = 1; ii < m; ii++) {
ans += pow((double)ii / m, n);
}
ans = (m)-ans;
cout << setprecision(5) << ans << endl;
}
| 7 | CPP |
t = int(input())
for _ in range(t):
n = int(input())
s = list(input())
temp = 0
if n>=11:
for i in range(n-10, n):
if s[i]=='8':
temp+=1
if n<11 or '8' not in s or (temp>0 and s[:n-10].count('8')==0):
print("NO")
else:
print("YES") | 7 | PYTHON3 |
from collections import defaultdict
from math import ceil
t = int(input())
for _ in range(t):
n = int(input())
s = list(map(int,input()))
s = [c for c in s if c%2]
if len(s)<= 1:
print (-1)
else:
print ("".join(str(x) for x in s[:2]))
| 7 | PYTHON3 |
listlength = input()
listlength = int(listlength)
x = input().split(' ')
x = list(map(int, x))
a = []
def build_list(a):
amax = 0
current = 0
for i in range(listlength):
current = amax + x[i]
a.append(current)
if current > amax:
amax = current
return a
print(*build_list(a), sep = " ") | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
inline int read() {
int x = 0, f = 1;
char c = getchar();
while (!isdigit(c)) {
if (c == -1) f = -1;
c = getchar();
}
while (isdigit(c)) {
x = (x << 3) + (x << 1) + (c ^ 48);
c = getchar();
}
return x * f;
}
struct node {
int x, v;
} L[21], R[21];
inline int cmp1(const node &a, const node &b) { return a.x < b.x; }
inline int cmp2(const node &a, const node &b) { return a.x > b.x; }
const int maxn = 100010;
struct tree {
long long ans;
int l[20], r[20];
} t[maxn << 2], now;
int nowl, x;
int n, m;
int a[maxn], sum[22];
int bit[21];
tree merge(const tree &a, const tree &b, int l, int r, int mid) {
tree c;
c.ans = a.ans + b.ans;
for (int i = 0; i <= 19; ++i) {
L[i].x = b.l[i];
L[i].v = bit[i];
R[i].x = a.r[i];
R[i].v = bit[i];
}
sort(L, L + 20, cmp1);
if (L[0].x != mid + 1)
L[20].x = mid + 1, L[20].v = 0;
else
L[20].x = n + 1;
for (int i = 0; i < 19; ++i)
if (L[i].x == L[i + 1].x) L[i + 1].v |= L[i].v, L[i].x = n + 1;
sort(L, L + 21, cmp1);
sum[0] = L[0].v;
for (int i = 1; i <= 20; ++i) sum[i] = sum[i - 1] | L[i].v;
sort(R, R + 20, cmp2);
if (R[0].x != mid)
R[20].x = mid, R[20].v = 0;
else
R[20].x = 0;
for (int i = 0; i < 19; ++i)
if (R[i].x == R[i + 1].x) R[i + 1].v |= R[i].v, R[i].x = 0;
sort(R, R + 21, cmp2);
int i = 0, j = 20;
while (j >= 0 && R[j].x == 0) --j;
R[j + 1].x = l - 1;
j = 20;
while (j >= 0 && L[j].x == n + 1) --j;
L[j + 1].x = r;
int nowsum = 0;
while (i <= 20 && j >= 0) {
if (R[i].x == l - 1) break;
nowsum |= R[i].v;
while (j > 0 && (nowsum | sum[j - 1]) >= x) --j;
if ((nowsum | sum[j]) >= x)
c.ans += 1LL * (r - L[j].x + 1) * (R[i].x - R[i + 1].x);
++i;
}
for (int I = 0; I < 20; ++I) {
c.l[I] = min(a.l[I], b.l[I]);
c.r[I] = max(a.r[I], b.r[I]);
}
return c;
}
void build(int o, int l, int r) {
if (l == r) {
for (int i = 0; i <= 19; ++i) {
if (a[l] & (1 << i))
t[o].l[i] = t[o].r[i] = l;
else
t[o].l[i] = n + 1, t[o].r[i] = 0;
}
t[o].ans = (a[l] >= x);
return;
}
int mid = (l + r) >> 1;
build(o << 1, l, mid);
build(o << 1 | 1, mid + 1, r);
t[o] = merge(t[o << 1], t[o << 1 | 1], l, r, mid);
}
void upt(int o, int l, int r, int p, int v) {
if (l == r) {
for (int i = 0; i <= 19; ++i) {
if (v & (1 << i))
t[o].l[i] = t[o].r[i] = l;
else
t[o].l[i] = n + 1, t[o].r[i] = 0;
}
t[o].ans = (v >= x);
return;
}
int mid = (l + r) >> 1;
if (p <= mid)
upt(o << 1, l, mid, p, v);
else
upt(o << 1 | 1, mid + 1, r, p, v);
t[o] = merge(t[o << 1], t[o << 1 | 1], l, r, mid);
}
void que(int o, int l, int r, int X, int Y) {
if (X <= l && r <= Y) {
if (now.ans == -1)
now = t[o];
else
now = merge(now, t[o], nowl, r, l - 1);
return;
}
int mid = (l + r) >> 1;
if (X <= mid) que(o << 1, l, mid, X, Y);
if (Y > mid) que(o << 1 | 1, mid + 1, r, X, Y);
}
int main() {
n = read();
m = read();
x = read();
for (int i = 1; i <= n; ++i) a[i] = read();
for (int i = 0; i <= 21; ++i) bit[i] = (1 << i);
build(1, 1, n);
for (int i = 1; i <= m; ++i) {
int opt = read();
if (opt == 1) {
int X = read(), v = read();
upt(1, 1, n, X, v);
} else {
int l = read(), r = read();
nowl = l;
now.ans = -1;
for (int j = 0; j < 20; ++j) now.l[j] = n + 1, now.r[j] = 0;
que(1, 1, n, l, r);
printf("%lld\n", now.ans);
}
}
return 0;
}
| 12 | CPP |
a=input()
count=0
for i in a:
if(i=="4" or i=="7"):
count+=1
if(count==4 or count==7):
print("YES")
else:
print("NO")
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main () {
ll n;
cin>>n;
ll a[300005],b[300005];
for(int i=0;i<n;i++){int x;
cin>>x;
a[x-1]++;
}
sort(a,a+n,greater<int>());
int j=n-1;
ll sum=0;
for(int i=1;i<=n;i++){
while(j>=0 && a[j]<i){
sum+=a[j];
j--;
}
b[i]= sum/i +(j+1);
}
j=n;
for(int i=1;i<=n;++i){
while(j>=1 && b[j]<i) {
j--;
}
cout<<j<<"\n";
}
} | 0 | CPP |
d,l={},[input() for i in range(int(input()))]
for i in l:
if i in d.keys(): d[i]+=1
else: d[i]=1
for i in l[::-1]:
if d[i]>0: print(i);d[i]=0 | 8 | PYTHON3 |
#include <iostream>
using namespace std;
typedef long long int ll;
#define rd(t,n) for (int i = 0; i < n; i++)cin>>t[i]
int main()
{
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n,m;cin>>n>>m;
ll t[m];rd(t,m);
sort(t,t+m);
ll d[m];d[0]=0;
for (int i = 1; i < m; i++)d[i]=t[i]-t[i-1];
sort(d,d+m);
ll s=0;
for (int i = 0; i <= m-n; i++)s+=d[i];
cout<<s;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<pair<int, int> > v(n);
for (int i = 0; i < n; ++i) {
cin >> v[i].first;
v[i].first = -v[i].first;
v[i].second = i;
}
sort(v.begin() + 1, v.end());
int pos = 1;
vector<pair<int, int> > ans;
for (int i = 0; i < n && pos < n; ++i) {
if (v[i].first == 0) {
cout << "-1\n";
return 0;
}
for (int j = 0; j < -v[i].first && pos < n; ++j)
ans.push_back({v[i].second + 1, v[pos].second + 1}), ++pos;
}
cout << ans.size() << endl;
for (int i = 0; i < ans.size(); ++i)
cout << ans[i].first << ' ' << ans[i].second << endl;
return 0;
}
| 8 | CPP |
import io,os
input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline
class segment_tree(object):
def merge(self,num,minimum):
return min(minimum,num)
def __init__(self,n,initial):
self.n = n
self.arr = [0]*(2*n)
self.lazy = [0]*(n)
self.layer = n.bit_length() + 1
for i in range(2*n-1,n-1,-1):
self.arr[i] = initial[i-n]
for i in range(n-1,-1,-1):
self.arr[i] = self.merge(self.arr[2*i],self.arr[2*i+1])
def rebuild(self,index):
index = index >> 1
while index>0:
self.arr[index] = self.merge(self.arr[index<<1],self.arr[index<<1|1]) + self.lazy[index]
index = index >> 1
def addtarget(self,index,target):
self.arr[index] += target
if index<self.n: self.lazy[index] += target
def changetotarget(self,index,target):
self.arr[index] = target
if index<self.n: self.lazy[index] = target
def update(self,left,right,target):
i,j = self.n+left, self.n+right+1
i0,j0 = i,j
while i<j:
if i&1:
self.addtarget(i,target)
i += 1
if j&1:
j -= 1
self.addtarget(j,target)
i = i >> 1
j = j >> 1
# if i==j:
# self.arr[i] += target
# if j<self.n: self.lazy[i] += target
self.rebuild(i0)
self.rebuild(j0-1)
def pushdown(self,index):
for move in range(self.layer,0,-1):
father = index >> move
if father<1 or father>=self.n: continue
if self.lazy[father]==0: continue
child = father << 1
self.arr[child] += self.lazy[father]
self.arr[child+1] += self.lazy[father]
if child < self.n: self.lazy[child] += self.lazy[father]
if child+1 < self.n: self.lazy[child+1] += self.lazy[father]
self.lazy[father] = 0
def query(self,left,right):
i,j = self.n+left, self.n+right+1
output = 2147483647 # initial output should be changed if you want to change the merge function
self.pushdown(i)
self.pushdown(j-1)
while i<j:
if i&1:
output = self.merge(self.arr[i],output)
i += 1
if j&1:
j -= 1
output = self.merge(self.arr[j],output)
i = i >> 1
j = j >> 1
return output
def main(t):
n,m = map(int,input().split())
segments = []
for _ in range(n):
front,rear,w = map(int,input().split())
segments.append([w,front-1,rear-1])
segments = sorted(segments)
over = segment_tree(m-1,[0]*(m-1))
front = 0
ans = 2147483647
flag = False
for i in range(n):
# print(i)
over.update(segments[i][1],segments[i][2]-1,1)
if not flag and over.query(0,m-2)>0:
flag = True
if flag:
while over.query( segments[front][1], segments[front][2] - 1) > 1:
front += 1
over.update(segments[front-1][1],segments[front-1][2]-1,-1)
# for p in range(segments[front-1][1],segments[front-1][2]):
# over.addnum(p,-1)
ans = min(ans,segments[i][0]-segments[front][0])
print(ans)
T = 1
t = 1
while t<=T:
main(t)
t += 1
| 11 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int T = 1;
cin >> T;
while (T--) {
string s, t;
cin >> s >> t;
vector<int> a(26);
for (char c : s) {
a[c - 'a']++;
}
if (t == "abc" && a[0] && a[1] && a[2]) {
while (a[0]--) cout << "a";
while (a[2]--) cout << "c";
while (a[1]--) cout << "b";
for (int i = 3; i < 26; i++) {
while (a[i]--) cout << (char)(i + 'a');
}
} else {
sort(s.begin(), s.end());
cout << s;
}
cout << '\n';
}
return 0;
}
| 7 | CPP |
n = int(input())
f, s = 0, 0
for i, j in zip(input(), input()):
if i == '1' and i != j:
f += 1
elif j == '1' and j != i:
s += 1
print(s // f + 1) if f != 0 else print(-1) | 7 | PYTHON3 |
for _ in range(int(input())):
n = int(input())
a = list(map(int, input().split()))
c = {}
for j, i in enumerate(a):
c[i] = c.get(i, []) + [j+1]
x = list(c.values())
if len(x) == 1:
print('NO')
continue
print('YES')
s = x[0].pop(0)
for i in x[1]:
print(s, i)
for i in range(len(x)):
if i == 1:
continue
for j in x[i]:
print(x[1][0], j)
| 10 | PYTHON3 |
s=str(input())
cnt=0
for ch in s:
if ch is 'a':
cnt=cnt+1
mx=2*cnt-1
ans=min(mx,len(s))
print(ans)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
for (int k = 1; k <= n / 2; k++) {
cout << k << " " << n + 1 - k << " ";
}
if (n % 2 == 1) cout << (n + 1) / 2 << endl;
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, n, top, temp;
int stack[101101];
cin >> n;
top = 0;
stack[0] = -1;
for (i = 0; i < n; i++) {
cin >> temp;
if (temp > stack[top]) {
stack[++top] = temp;
} else {
int low = 1, high = top;
int mid;
while (low <= high) {
mid = (low + high) / 2;
if (temp > stack[mid]) {
low = mid + 1;
} else {
high = mid - 1;
}
}
stack[low] = temp;
}
}
cout << top << endl;
return 0;
}
| 8 | CPP |
n = int(input())
sum = 0
for i in range(n):
count = 0
arr = list(map(int,input().split()))
for j in range(len(arr)):
if(arr[j] == 1):
count += 1
if(count >= 2):
sum += 1
print(sum) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, w;
int a[300005], b[300005];
vector<int> v;
map<int, int> mp;
int cnt = 0;
int c[300005], d[300005], order[300005], stored[2 * 300005];
int idx[8 * 300005];
long long sum[8 * 300005];
void add(int i, int low, int high, int x, int delta) {
if (low == high) {
idx[i] += delta;
sum[i] += stored[low] * delta;
return;
}
int mid = (low + high) >> 1;
if (x <= mid)
add(2 * i, low, mid, x, delta);
else
add(2 * i + 1, mid + 1, high, x, delta);
idx[i] = idx[2 * i] + idx[2 * i + 1];
sum[i] = sum[2 * i] + sum[2 * i + 1];
}
long long calc(int i, int low, int high, int x) {
if (x > idx[i]) return 1LL << 60;
if (low == high)
return 1LL * x * stored[low];
else if (x <= idx[2 * i])
return calc(2 * i, low, (low + high) >> 1, x);
else
return calc(2 * i + 1, 1 + (low + high) / 2, high, x - idx[2 * i]) +
sum[2 * i];
}
bool cmp(int x, int y) { return b[x] < b[y]; }
bool cmp2(int x, int y) { return d[x] < d[y]; }
int main() {
scanf("%d %d", &n, &w);
for (int i = 0; i < n; i++) {
scanf("%d %d", &a[i], &b[i]);
v.push_back(a[i]);
v.push_back(b[i] - a[i]);
}
sort(v.begin(), v.end());
for (int i = 0; i < v.size(); i++) {
if (!i || v[i] > v[i - 1]) {
stored[cnt] = v[i];
mp[v[i]] = cnt;
cnt++;
}
}
for (int i = 0; i < n; i++) order[i] = i;
sort(order, order + n, cmp);
for (int i = 0; i < n; i++) {
int u = order[i];
}
long long tmp = 0;
for (int i = 0; i < n; i++) add(1, 0, cnt - 1, mp[a[i]], 1);
long long ret = calc(1, 0, cnt - 1, w);
int pos = 0;
for (int i = 0; i < n; i++) {
int j = w - i - 1;
if (j < 0) break;
int u = order[i];
add(1, 0, cnt - 1, mp[a[u]], -1);
tmp += a[u];
add(1, 0, cnt - 1, mp[b[u] - a[u]], 1);
long long tmp2 = calc(1, 0, cnt - 1, w - i - 1);
if (tmp2 + tmp < ret) {
ret = tmp2 + tmp;
pos = i + 1;
}
}
cout << ret << endl;
for (int i = 0; i < pos; i++) c[order[i]] = 1;
for (int i = 0; i < n; i++) d[i] = (c[i] == 0) ? a[i] : (b[i] - a[i]);
sort(order, order + n, cmp2);
for (int i = 0; i < w - pos; i++) c[order[i]]++;
for (int i = 0; i < n; i++) printf("%d", c[i]);
printf("\n");
}
| 11 | CPP |
n = int(input())
s = input()
for i in range(1, n + 1, 1):
if n % i == 0:
x = s[:i]
y = s[i:]
s = x[:: -1] + y
print(s) | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main(){
string w; cin >> w;
string s;
int cnt = 0;
while(cin >> s){
if(s == "END_OF_TEXT") break;
transform(s.begin(), s.end(), s.begin(), ::tolower);
if(s == w) cnt++;
}
cout << cnt << endl;
}
| 0 | CPP |
Subsets and Splits