solution
stringlengths 10
983k
| difficulty
int64 0
25
| language
stringclasses 2
values |
|---|---|---|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 10;
int arr[maxn];
int pre[maxn * 2];
int cnt[maxn], mx;
int c[maxn], cw[maxn];
int n, tp;
int is(int val) { return val == mx ? 1 : 0; }
void ins(int x) {
--cw[c[x]];
++c[x];
++cw[c[x]];
tp = max(tp, c[x]);
}
void del(int x) {
--cw[c[x]];
--c[x];
++cw[c[x]];
if (!cw[tp]) --tp;
}
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &arr[i]);
++cnt[arr[i]];
if (cnt[arr[i]] > cnt[mx]) {
mx = arr[i];
}
}
if (cnt[mx] == n) {
printf("0\n");
return 0;
}
int lim = cnt[mx] < 512 ? cnt[mx] : 512;
int ans = 0;
for (int i = 1; i <= n; i++) {
if (i == mx || cnt[i] < 512) continue;
fill(pre, pre + 2 * n + 1, n + 1);
pre[n] = 1;
int sum = n;
for (int j = 1; j <= n; j++) {
sum += (arr[j] == mx ? -1 : (arr[j] == i ? 1 : 0));
ans = max(ans, j - pre[sum] + 1);
if (pre[sum] == n + 1) pre[sum] = j + 1;
}
}
assert(ans <= n);
for (int i = 1; i <= lim; i++) {
fill(c + 1, c + 1 + n, 0);
fill(cw + 1, cw + 1 + n, 0);
cw[0] = n;
tp = 0;
for (int j = 1, k = 1, x = 0; j <= n; j++) {
while (k <= n && x + is(arr[k]) <= i) {
ins(arr[k]);
x += is(arr[k]);
++k;
}
if (cw[tp] >= 2) ans = max(ans, k - j);
del(arr[j]);
x -= is(arr[j]);
}
}
printf("%d\n", ans);
return 0;
}
| 12 | CPP |
S=input()
print(sum([1 if S[i]!=S[i+1]else 0 for i in range(len(S)-1)])) | 0 | PYTHON3 |
v = str(input())
k = set(list(v))
if len(k) % 2 == 0 :
print('CHAT WITH HER!')
else :
print('IGNORE HIM!')
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long num_cards;
vector<long long> valid_colors;
map<long long, long> colormap;
map<long long, long> front_colormap;
bool hasNoFlipNecessary() {
for (map<long long, long>::const_iterator it = front_colormap.begin();
it != front_colormap.end(); it++) {
if (it->second >= long((num_cards + 1) / 2)) {
return true;
}
}
return false;
}
void findValidColors() {
for (map<long long, long>::const_iterator it = colormap.begin();
it != colormap.end(); it++) {
if (it->second >= long((num_cards + 1) / 2)) {
valid_colors.push_back(it->first);
}
}
return;
}
bool isImpossible() {
if (valid_colors.size() == 0) {
return true;
}
return false;
}
long calcMinFlipsForOne(long long color) {
long num_fronts = front_colormap[color];
long num_flips = long((num_cards + 1) / 2) - num_fronts;
return num_flips;
}
long calcMinFlipsForAll() {
long curr_min = 100001;
for (long i = 0; i < valid_colors.size(); i++) {
curr_min = min(calcMinFlipsForOne(valid_colors[i]), curr_min);
}
return curr_min;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cin >> num_cards;
for (long i = 0; i < num_cards; i++) {
long long tempa, tempb;
cin >> tempa >> tempb;
if (tempa == tempb) {
front_colormap[tempa]++;
colormap[tempa]++;
} else {
front_colormap[tempa]++;
colormap[tempa]++;
colormap[tempb]++;
}
}
if (hasNoFlipNecessary()) {
cout << "0"
<< "\n";
return 0;
}
findValidColors();
if (isImpossible()) {
cout << "-1"
<< "\n";
return 0;
}
cout << calcMinFlipsForAll() << "\n";
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
int main() {
int y, w;
scanf("%d%d", &y, &w);
if (y >= w) {
if (y == 1)
printf("1/1");
else if (y == 2)
printf("5/6");
else if (y == 3)
printf("2/3");
else if (y == 4)
printf("1/2");
else if (y == 5)
printf("1/3");
else if (y == 6)
printf("1/6");
} else if (w > y) {
if (w == 2)
printf("5/6");
else if (w == 3)
printf("2/3");
else if (w == 4)
printf("1/2");
else if (w == 5)
printf("1/3");
else if (w == 6)
printf("1/6");
}
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,K,ans;
cin>>N>>K;
ans=(N+K-3)/(K-1);
cout<<ans<<endl;
}
| 0 | CPP |
a,b=map(int,input().split())
a1,a2,a3,b1,b2,b3=0,0,0,0,0,0
while a%2==0:
a1+=1
a=a//2
while a%3==0:
a2+=1
a=a//3
while a%5==0:
a3+=1
a=a//5
while b%2==0:
b1+=1
b=b//2
while b%3==0:
b2+=1
b=b//3
while b%5==0:
b3+=1
b=b//5
if a!=b:
print(-1)
else:
print(abs(a1-b1)+abs(a2-b2)+abs(a3-b3)) | 8 | PYTHON3 |
#include <cstdio>
#include <algorithm>
using namespace std;
typedef long long int ll;
int main(){
int n,k;
while(1){
scanf("%d %d",&n,&k);
if(n==0) return 0;
int a[n];
for(int i=0;i<n;i++) scanf("%d",&a[i]);
ll bgs=0,temp=0;
for(int i=0;i<k;i++) temp+=a[i];
bgs=temp;
for(int i=1;i<=n-k;i++){
temp=temp-a[i-1]+a[i+k-1];
bgs=max(bgs,temp);
}
printf("%lld\n",bgs);
}
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, pre = 0, x, total = 0;
cin >> n;
for (int a = 0; a < n; a++) cin >> x, total += abs(x - pre), pre = x;
cout << total + n + (n - 1) << endl;
return 0;
}
| 8 | CPP |
for t in range(int(input())):
n = int(input())
A = [int(i) for i in input().split()]
B = [int(i) for i in input().split()]
l = []
for i in range(n):
if(B[i] == 0):
l.append(A[i])
l.sort(reverse=True)
j = 0
for i in range(n):
if(B[i] == 0):
A[i] = l[j]
j += 1
print(*A) | 8 | PYTHON3 |
from fractions import gcd
n, m, z = map(int, input().split())
print(z // ((n * m) // gcd(n, m)))
| 7 | PYTHON3 |
words = []
n = int(input())
while n != 0:
word = str(input())
words.append(word)
n -= 1
for x in words:
if len(x) > 10:
print(x[0] + str(len(x) - 2) + x[len(x) - 1])
else:
print(x)
| 7 | PYTHON3 |
import math
def calcAmount(a,b, c):
count = c
while a > 0:
if b == 1:
b += 1
count += 1
a = math.floor(a/b)
count += 1
return count
if __name__ == "__main__":
t = input()
l = []
for i in range(int(t)):
st = input()
a, b = st.split(" ")
a, b = int(a), int(b)
c = 0
numBefore = calcAmount(a,b,0)
numNow = calcAmount(a,b+1, 1)
while numBefore >= numNow:
b += 1
c += 1
numBefore = numNow
numNow = calcAmount(a,b,c)
if numBefore < numNow:
l.append(numBefore)
else:
l.append(numNow)
[print(x) for x in l]
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
int n, a[maxn];
void main_slove() {
cin >> n;
int idx = 0, mxx = 0;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
if (mxx < a[i]) {
mxx = a[i];
idx = i;
}
}
for (int i = idx; i >= 2; --i) {
if (a[i] < a[i - 1]) {
puts("NO");
return;
}
}
for (int i = idx; i <= n; ++i) {
if (a[i] < a[i + 1]) {
puts("NO");
return;
}
}
puts("YES");
return;
}
signed main() {
main_slove();
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
#pragma GCC optimize(2)
using namespace std;
const int INF = 1e9 + 7;
const int N = 2e5 + 7;
const int M = 5e6 + 7;
int a[N], cnt[N], pre[N], suf[N];
vector<int> f;
int getP(int x) { return upper_bound(f.begin(), f.end(), x) - f.begin(); }
signed main() {
ios::sync_with_stdio(false);
int n, m, l, r;
cin >> n >> m;
for (int i = 1; i <= n; i++) {
cin >> l >> r;
cnt[l]++;
cnt[r + 1]--;
}
for (int i = 1; i <= m; i++) a[i] = a[i - 1] + cnt[i];
f.clear();
for (int i = 1; i <= m; i++) {
if (f.size() == 0 || *f.rbegin() <= a[i])
f.push_back(a[i]);
else
f[getP(a[i])] = a[i];
pre[i] = f.size();
}
f.clear();
for (int i = m; i; --i) {
if (f.size() == 0 || *f.rbegin() <= a[i])
f.push_back(a[i]);
else
f[getP(a[i])] = a[i];
suf[i] = f.size();
}
int ans = 0;
for (int i = 1; i <= m; i++) ans = max(ans, pre[i] + suf[i + 1]);
cout << ans << "\n";
return 0;
}
| 9 | CPP |
#include <bits/stdc++.h>
using namespace std;
struct crew {
string name;
string gender;
int key;
int ro;
};
bool serial(crew a, crew b) {
if (a.key != b.key) {
return a.key < b.key;
}
return (a.ro < b.ro);
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
long long t, r = 1, r1 = 0, r2 = 0, k = 0, a, b, c = 1, m, d = 0, n, e, f,
x = 0, g, p = 0, q = 0, y = 0, z = 0;
vector<long long> v;
vector<long long> u;
set<long long> s;
std::vector<int>::iterator it;
string s1, s2, s3, s4;
cin >> n;
crew oop[n];
for (int i = 0; i < n; i++) {
cin >> oop[i].name >> oop[i].gender;
s1 = oop[i].gender;
;
if (s1 == "rat") {
oop[i].key = 1;
}
if (s1 == "woman") {
oop[i].key = 2;
}
if (s1 == "child") {
oop[i].key = 2;
}
if (s1 == "man") {
oop[i].key = 3;
}
if (s1 == "captain") {
oop[i].key = 4;
}
oop[i].ro = i;
}
sort(oop, oop + n, serial);
for (int i = 0; i < n; i++) {
cout << oop[i].name << endl;
}
}
| 7 | CPP |
import os
import sys
from io import BytesIO, IOBase
def main():
pass
# region fastio
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
# endregion
if __name__ == "__main__":
main()
def test():
n, t = map(int, input().split())
a = list(map(int, input().split()))
c = True
r = []
for i in a:
if i < t / 2:
r += [1]
elif i > t / 2:
r += [0]
else:
if c:
r += [1]
c = False
else:
r += [0]
c = True
print(*r)
t = int(input())
for _ in range(t):
test()
| 8 | PYTHON3 |
n, m = map(int, input(" ").split())
print (n*m) | 0 | PYTHON3 |
n = int(input())
a = sorted(map(int, input().split()))
b = sorted(map(int, input().split()))
A, B = 0, 0
for i in range(2 * n):
if i % 2 == 0:
if not b or a and a[-1] >= b[-1]:
A += a[-1]
del a[-1]
else:
del b[-1]
else:
if not a or b and b[-1] >= a[-1]:
B += b[-1]
del b[-1]
else:
del a[-1]
print(A - B)
| 9 | PYTHON3 |
print(str(pow(5,int(input()),100 ))[-2:]) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int cnt[322], cur = 0;
string s;
stack<int> t;
int main() {
cin >> s;
for (int i = 0; i < s.size(); i++) cnt[s[i]]++;
for (int i = 'a'; i <= 'z'; i++) {
while (t.size() && t.top() <= i) {
cout << char(t.top());
t.pop();
}
while (cnt[i]) {
cnt[s[cur]]--;
if (s[cur] != i)
t.push(s[cur]);
else
cout << char(i);
cur++;
}
}
while (t.size()) {
cout << char(t.top());
t.pop();
}
return 0;
}
| 9 | CPP |
#!/usr/bin/python3
maxim = 0
c = 0
n = int(input())
for i in range(n):
a, b = map(int, input().split())
c += b - a
maxim = max(maxim, c)
print(maxim)
| 7 | PYTHON3 |
import io, os
import sys
input=sys.stdin.readline
t=int(input())
for i in range(t):
xa,ya,za=map(int,input().split())
xb,yb,zb=map(int,input().split())
ans=0
pq=min(za,yb)
ans+=pq*2
za-=pq
yb-=pq
pq1=min(zb,za)
zb-=pq1
pq2=min(zb,xa)
zb-=pq2
pq3=min(ya,yb)
ya-=pq3
pq4=min(ya,xb)
ya-=pq4
ans-=min(ya,zb)*2
print(ans) | 8 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
;
int n;
string s;
cin >> n >> s;
int c = 0, b = 0, a = 0, d = 1;
for (int i = 0; i < n; i++) {
if ((s[i] - 48) != c) {
a++;
}
if ((s[i] - 48 != d)) {
b++;
}
c = (c + 1) % 2;
d = (d + 1) % 2;
}
cout << min(a, b) << endl;
return 0;
}
| 10 | CPP |
import sys
input = sys.stdin.readline
N, x = map(int, input().split())
a = list(map(int, input().split()))
res = float("inf")
t = [float("inf")] * N
for k in range(N + 1):
for i in range(N):
t[(i + k) % N] = min(t[(i + k) % N], a[i])
res = min(res, sum(t) + k * x)
print(res)
| 0 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 200;
const long long inf = 2e18, mod = 1e9 + 7;
struct node {
int key, prior, cnt, sum;
node* l;
node* r;
node(int KEY = 0, int PRIOR = 0, int CNT = 1) {
key = KEY;
sum = cnt = CNT;
prior = PRIOR;
l = r = NULL;
}
};
typedef node* pnode;
int getSum(pnode t) { return (t ? t->sum : 0); }
inline void update(pnode& t) {
if (t) t->sum = getSum(t->l) + getSum(t->r) + t->cnt;
}
void split(pnode t, int key, pnode& l, pnode& r) {
if (!t)
l = r = NULL;
else if (key < t->key)
split(t->l, key, l, t->l), r = t;
else
split(t->r, key, t->r, r), l = t;
update(t);
}
void addVal(pnode& t, int key) {
if (t->key == key)
t->cnt++;
else if (key < t->key)
addVal(t->l, key);
else
addVal(t->r, key);
update(t);
}
void insert(pnode& t, pnode it) {
if (!t)
t = it;
else if (it->prior > t->prior) {
split(t, it->key, it->l, it->r), t = it;
} else
insert((it->key < t->key ? t->l : t->r), it);
update(t);
}
void merge(pnode& t, pnode& l, pnode& r) {
if (!l || !r)
t = (l ? l : r);
else if (l->prior > r->prior)
merge(l->r, l->r, r), t = l;
else
merge(r->l, l, r->l), t = r;
update(t);
}
void erase(pnode& t, int key) {
if (!t) return;
if (t->key == key)
merge(t, t->l, t->r);
else
erase((key < t->key ? t->l : t->r), key);
update(t);
}
int query(pnode t, int key) {
if (!t) return 0;
if (key < t->key)
return query(t->l, key);
else if (key == t->key)
return getSum(t->l);
else
return getSum(t->l) + t->cnt + query(t->r, key);
}
void print(pnode t) {
if (!t) return;
cerr << "P " << t->key << ' ' << t->sum << endl;
print(t->l);
print(t->r);
}
node treapNodes[maxn];
pnode TREAP;
set<int> st;
int n, T, cool[maxn];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
srand(time(NULL));
for (int i = 0; i < maxn; i++) treapNodes[i].prior = rand() % mod;
cin >> n >> T;
for (int i = 0; i < n; i++) cin >> cool[i];
for (int i = 0; i < n; i++) cool[i] = max(0, cool[i] - i - 1);
int ind = 0, ans = 0;
for (int i = 0; i < n; i++) {
treapNodes[ind].key = cool[i];
if (st.find(cool[i]) == st.end()) {
insert(TREAP, treapNodes + ind);
st.insert(cool[i]);
} else {
addVal(TREAP, cool[i]);
}
ind++;
ans = max(ans, query(TREAP, T - i - 1));
}
cout << ans << endl;
}
| 10 | CPP |
import sys
input = sys.stdin.readline
############ ---- Input Functions ---- ############
def inp(): # read integer input
return(int(input()))
def inlt(): # read list integer input
return(list(map(int,input().split())))
def insr(): # read list of chars
s = input()
return(list(s[:len(s) - 1]))
def invr(): # space seperated intefer inputs
return(map(int,input().split()))
def bool_to_str(flag):
if flag:
return "YES"
else:
return "NO"
tests = inp()
for i in range(tests):
abcd = inlt()
print(abcd[1], abcd[2], abcd[2])
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, y, z, xsum(0), ysum(0), zsum(0);
cin >> n;
while (n--) {
cin >> x >> y >> z;
xsum += x;
ysum += y;
zsum += z;
}
if (xsum == 0 && ysum == 0 && zsum == 0) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define ALL(n) begin(n),end(n)
#define INF ((1<<30)-1)
#define LINF (1LL<<60)
#define EPS (1e-10)
typedef long long Int;
typedef pair<Int, Int> P;
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int xp1,yp1,xp2,yp2;
int q;
cin>>xp1>>yp1>>xp2>>yp2;
cin>>q;
auto va = P(xp2-xp1,yp2-yp1);
for(int i=0; i<q; i++){
int x,y;
cin>>x>>y;
auto vb=P(x-xp1,y-yp1);
Int vab=va.first*vb.first+va.second*vb.second;
Int vaa=va.first*va.first+va.second*va.second;
pair<double,double> oh;
oh.first=(double)va.first*vab/vaa;
oh.second=(double)va.second*vab/vaa;
double xans=oh.first+xp1/1.000000000;
double yans=oh.second+yp1/1.000000000;
cout<<std::fixed << std::setprecision(15)<<xans<<" "<<std::fixed << std::setprecision(15)<<yans<<endl;
}
return 0;
}
| 0 | CPP |
s=str(input())
print(min(s.count('B'),s.count('l'),s.count('b'),s.count('s'),s.count('r'),s.count('a')//2,s.count('u')//2))
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,M,C;
cin >> N >> M >> C;
int sum,cou=0;
vector<int> B(M);
for(int i=0;i<M;i++)
cin >> B.at(i);
for(int i=0;i<N;i++){
sum=C;
for(int j=0;j<M;j++){
int a; cin >> a;
sum += a*B.at(j);
}
if(sum>0)
cou++;
}
cout << cou;
} | 0 | CPP |
#include <bits/stdc++.h>
using ll = long long;
const int N = 1010;
const ll MAX = (ll)1e18;
int n;
int rand(int n) { return rand() % n; }
ll ask(int id, ll pos) {
printf("? %d %lld\n", id + 1, pos);
fflush(stdout);
ll ret;
scanf("%lld", &ret);
return ret;
}
ll left[N], right[N];
void solve(std::vector<int> vec, ll l, ll r, ll l_value, ll r_value) {
if ((int)vec.size() == 1) {
left[vec[0]] = l;
right[vec[0]] = r;
return;
}
ll diff = (r_value - l_value) / vec.size();
ll target;
if (vec.size() % 2 == 0) {
target = (l_value + r_value) / 2;
} else {
target = (l_value + r_value - diff) / 2;
}
int target_sit = ((int)vec.size() + 1) / 2;
std::vector<int> small, big, possible = vec;
ll cur_l = l, cur_r = r;
while (true) {
int pos = possible[rand(possible.size())];
std::vector<std::pair<ll, int>> value;
ll l1 = cur_l, r1 = cur_r;
while (l1 < r1) {
ll mid = (l1 + r1) / 2;
if (ask(pos, mid) >= target) {
r1 = mid;
} else {
l1 = mid + 1;
}
}
for (auto u : possible) {
value.emplace_back(ask(u, l1), u);
}
std::sort(value.begin(), value.end());
int sit = target_sit - (int)small.size();
if (value[sit].first < target) {
std::vector<int> npossible;
for (auto p : value) {
if (p.first >= target) {
big.push_back(p.second);
} else {
npossible.push_back(p.second);
}
}
possible = npossible;
cur_l = l1 + 1;
} else if (value[sit].first > target) {
std::vector<int> npossible;
for (auto p : value) {
if (p.first <= target) {
small.push_back(p.second);
} else {
npossible.push_back(p.second);
}
}
possible = npossible;
cur_r = l1 - 1;
} else {
for (int i = 0; i < sit; ++i) {
small.push_back(value[i].second);
}
for (int i = sit; i < (int)value.size(); ++i) {
big.push_back(value[i].second);
}
solve(small, l1, r, target, r_value);
solve(big, l, l1, l_value, target);
break;
}
}
}
int main() {
srand((unsigned)time(nullptr));
ll l;
scanf("%d%lld", &n, &l);
std::vector<int> vec(n);
for (int i = 0; i < n; ++i) {
vec[i] = i;
}
solve(vec, 0, MAX, 0, l);
puts("!");
for (int i = 0; i < n; ++i) {
printf("%lld %lld\n", left[i], right[i]);
}
return 0;
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
#define int long long
multiset<int> LS, RS;
int L[100010], R[100010];
signed main(){
int n, fl = 0, fr = 0, ans = 0;
scanf("%lld", &n);
for(int i = 0;i < n;i++)scanf("%lld%lld", &L[i], &R[i]);
LS.insert(-1e17);
RS.insert(1e17);
for(int i = 0;i < n;i++){
fl -= R[i]-L[i];
fr += R[i-1]-L[i-1];
if(L[i] < *LS.rbegin()+fl){
ans += *LS.rbegin()+fl-L[i];
RS.insert(*LS.rbegin()+fl-fr);
LS.erase(LS.find(*LS.rbegin()));
LS.insert(L[i]-fl);
LS.insert(L[i]-fl);
}else if(*RS.begin()+fr < L[i]){
ans += L[i]-(*RS.begin()+fr);
LS.insert(*RS.begin()+fr-fl);
RS.erase(RS.begin());
RS.insert(L[i]-fr);
RS.insert(L[i]-fr);
}else{
LS.insert(L[i]-fl);
RS.insert(L[i]-fr);
}
}
printf("%lld\n", ans);
return 0;
} | 0 | CPP |
n, p = int(input()), list(map(int, input().split()))
presents = [0]*(n+1)
for i in range(n):
presents[p[i]] = i+1
for i in range(1, n+1):
print(presents[i], end=' ') | 7 | PYTHON3 |
a = str(input())
print(a[0].upper()+a[1::]) | 7 | PYTHON3 |
#include <iostream>
#include <string>
using namespace std;
int main() {
string s; cin >> s;
long long b = 0, ans = 0;
for (char c : s) {
if (c == 'B') ++b;
else ans += b;
}
cout << ans << endl;
return 0;
} | 0 | CPP |
import sys
import math
import random
# sys.stdin = open("actext.txt", "r")
# mod = 998244353
# mod = 1000000007
# cook your dish here
def solve(s):
pass
t = int(input())
for tt in range(t):
n = int(input())
arr = list(map(int,input().split()))
arr.sort()
if(n==1):
arr.reverse()
print(*arr)
else:
# print(arr)
i = 1
while(i<(2*n-1)):
arr[i],arr[i+1] = arr[i+1],arr[i]
i+=2
print(*arr)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int a[2345678];
int main() {
int n, i, j, k, l, m;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
sort(a, a + n);
int mini = 2000000009, tot = 0;
for (i = 1; i < n; i++) {
j = abs(a[i] - a[i - 1]);
mini = min(mini, j);
}
for (i = 1; i < n; i++) {
if (a[i] - a[i - 1] == mini) tot++;
}
cout << mini << " " << tot;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(0);
long long n, k;
cin >> n >> k;
if (k > n / 2) k = n / 2;
long long ans = k * k + 2 * (n - 2 * k) * k + k * (k - 1);
cout << ans;
return 0;
}
| 8 | CPP |
x, y, z = 0, 0, 0
n = int(input())
for i in range(n):
x1, y1, z1 = input().split()
x1, y1, z1 = int(x1), int(y1), int(z1)
x += x1
y += y1
z += z1
if x == y == z == 0:
print("YES")
else:
print("NO")
# 1506620454126
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
class UnionFind {
private:
std::vector<int> disj;
std::vector<int> rank;
public:
UnionFind(int n) : disj(n), rank(n) {
for (int i = 0; i < n; ++i) {
disj[i] = i;
rank[i] = 0;
}
}
int root(int x) {
if (disj[x] == x) {
return x;
}
return disj[x] = root(disj[x]);
}
void unite(int x, int y) {
x = root(x);
y = root(y);
if (x == y) {
return;
}
if (rank[x] < rank[y]) {
disj[x] = y;
} else {
disj[y] = x;
if (rank[x] == rank[y]) {
++rank[x];
}
}
}
bool is_same_set(int x, int y) { return root(x) == root(y); }
};
const int N = 500100;
vector<int> g[N];
const int B = 19;
int bin[B][N];
bool vis[N];
long long int dat[B][N];
map<pair<int, int>, long long int> determ;
const long long int inf = 1e18;
int dep[N];
void dfs(int v, int par, int d = 0) {
vis[v] = true;
bin[0][v] = par == -1 ? v : par;
dep[v] = d;
if (determ.count(pair<int, int>(v, par))) {
dat[0][v] = determ[pair<int, int>(v, par)];
}
for (int w : g[v]) {
if (w == par) continue;
dfs(w, v, d + 1);
}
}
int lca(int x, int y) {
if (dep[x] > dep[y]) swap(x, y);
for (int b = B - 1; b >= 0; --b) {
if (dep[y] - dep[x] >= 1 << b) {
y = bin[b][y];
}
}
assert(dep[x] == dep[y]);
if (x == y) return x;
for (int b = B - 1; b >= 0; --b) {
if (bin[b][x] != bin[b][y]) {
x = bin[b][x];
y = bin[b][y];
}
}
assert(bin[0][x] == bin[0][y] && x != y);
return bin[0][x];
}
void upd(int des, int anc, long long int x) {
int d = dep[des] - dep[anc];
for (int b = B - 1; b >= 0; --b) {
if (d >= 1 << b) {
dat[b][des] = min(dat[b][des], x);
d -= 1 << b;
des = bin[b][des];
}
}
}
int main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k, m;
cin >> n >> k >> m;
UnionFind uf(n);
for (int i = (int)(0); i < (int)(k); i++) {
int ga, gb;
cin >> ga >> gb;
ga--, gb--;
g[ga].push_back(gb);
g[gb].push_back(ga);
uf.unite(ga, gb);
}
vector<pair<long long int, pair<int, int> > > es;
for (int i = (int)(0); i < (int)(m); i++) {
int a, b;
long long int w;
cin >> a >> b >> w;
a--, b--;
es.push_back(pair<long long int, pair<int, int> >(w, pair<int, int>(a, b)));
}
sort(es.begin(), es.end());
vector<pair<long long int, pair<int, int> > > es_nxt;
for (pair<long long int, pair<int, int> > e : es) {
long long int w = e.first;
int a = e.second.first, b = e.second.second;
if (uf.is_same_set(a, b)) {
es_nxt.push_back(e);
continue;
}
uf.unite(a, b);
determ[pair<int, int>(a, b)] = w;
determ[pair<int, int>(b, a)] = w;
g[a].push_back(b);
g[b].push_back(a);
}
for (int i = (int)(0); i < (int)(n); i++) {
for (int j = (int)(0); j < (int)(B); j++) {
bin[j][i] = i;
dat[j][i] = inf;
}
}
dfs(0, -1);
for (int b = (int)(1); b < (int)(B); b++) {
for (int i = (int)(0); i < (int)(n); i++) {
bin[b][i] = bin[b - 1][bin[b - 1][i]];
}
}
long long int tot = 0;
for (pair<long long int, pair<int, int> > e : es_nxt) {
long long int w = e.first;
int a = e.second.first, b = e.second.second;
int l = lca(a, b);
upd(a, l, w);
upd(b, l, w);
}
for (int b = B - 1; b >= 1; --b) {
for (int i = (int)(0); i < (int)(n); i++) {
dat[b - 1][i] = min(dat[b - 1][i], dat[b][i]);
int u = bin[b - 1][i];
dat[b - 1][u] = min(dat[b - 1][u], dat[b][i]);
}
}
for (int i = (int)(0); i < (int)(n); i++) {
if (bin[0][i] == i) continue;
if (determ.count(pair<int, int>(i, bin[0][i]))) continue;
if (dat[0][i] >= inf) {
cout << -1 << "\n";
return 0;
}
tot += dat[0][i];
}
cout << tot << "\n";
}
| 12 | CPP |
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:16777216")
using namespace std;
int main() {
string s;
getline(cin, s);
long long dig[5000];
long long sign[5000];
for (long long i = 0; i < (int)s.size(); i++) {
if (i % 2 == 0) {
dig[i / 2 + 1] = s[i] - '0';
} else {
if (s[i] == '+')
sign[i / 2 + 1] = 0;
else
sign[i / 2 + 1] = 1;
}
}
sign[0] = 0;
long long value[5000];
for (long long i = 0; i < (int)5000; i++) value[i] = 0;
long long l = s.size() / 2 + 1;
long long a = 0;
long long b = 0;
sign[0] = 0;
sign[l] = 0;
for (long long i = 1; i <= (int)l; i++) {
if (sign[i - 1] == 0) {
a = value[i - 1];
b = dig[i];
} else {
b *= dig[i];
}
if (sign[i] == 0) {
value[i] = a + b;
}
}
sign[l] = 0;
long long ans = value[l];
dig[0] = 0;
for (long long i = 0; i < (int)l + 1; i++) {
if (i > 0)
if (sign[i - 1] == 0) {
a = value[i - 1];
b = dig[i];
} else {
b *= dig[i];
}
long long e = sign[i - 1];
long long waer = i;
long long asrgqeg = 0;
if (i == 0) {
a = 0;
b = 1;
}
if (sign[i] == 1 || i == 0) {
long long aa = 0;
long long bb = dig[i + 1];
for (long long j = i + 2; j <= l; j++) {
if (sign[j - 1] == 0) {
aa += bb;
bb = dig[j];
} else {
bb *= dig[j];
}
if ((sign[j] == 1 && sign[j - 1] == 0) || j == l) {
long long c = b * (aa + bb);
long long d = j + 1;
while (sign[d - 1] == 1) {
c *= dig[d];
d++;
}
if (c + a + value[l] - value[d - 1] > ans)
ans = c + a + value[l] - value[d - 1];
}
long long gh = 0;
}
long long gh = 0;
}
}
cout << ans;
return 0;
}
| 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
int n, m, k;
vector<int> g[2009];
bool vis[2009];
void dfs(int i) {
vis[i] = 1;
for (auto j : g[i]) {
if (!vis[j]) dfs(j);
}
}
int main() {
cin >> n >> m >> k;
for (int i = 0; i + k - 1 < n; ++i) {
int a = i, b = i + k - 1;
while (a <= b) {
g[a].push_back(b);
g[b].push_back(a);
a++;
b--;
}
}
int c = 0;
int ans = 1;
for (int i = 0; i < n; ++i) {
if (!vis[i]) {
dfs(i);
c++;
}
}
for (int i = 0; i < c; ++i) {
ans = ((long long)ans * m) % mod;
}
cout << ans;
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
int main() {
int64_t P, Q;
std::cin >> P >> Q;
int64_t N;
std::cin >> N;
for (int64_t i = 0; i < N; i++) {
int64_t A;
std::cin >> A;
if (P / A < Q || P < Q * A) {
std::cout << "NO" << std::endl;
return 0;
}
P -= Q * A;
std::swap(P, Q);
}
if (Q == 0) {
std::cout << "YES" << std::endl;
} else {
std::cout << "NO" << std::endl;
}
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main(){
int N,X,Y; cin >> N >> X >> Y;
int count[2002]={};
for(int i=1; i<=N-1; i++){
for(int j=i+1; j<=N; j++){
count[min(j-i,abs(X-i)+1+abs(Y-j))]++;
}
}
for(int k=1; k<=N-1; k++) cout << count[k] << endl;
} | 0 | CPP |
n = int(input())
s = input()
flag = 0
sum = 0
l = []
t = 0
for i in range(0, n):
if flag == 0:
tmp = s[i]
if s[i] == 'B':
t += 1
sum += 1
flag = 1
else:
if s[i] == 'B':
if tmp == 'W':
t += 1
sum += 1
else:
if tmp == 'B':
l.append(sum)
sum = 0
tmp = s[i]
if not sum == 0:
l.append(sum)
if t == 0:
print(0)
else:
str1 = ''
for i in range(0, len(l)-1):
str1 = str1 + str(l[i]) + ' '
str1 = str1 + str(l[len(l)-1])
print(t)
print(str1)
| 7 | PYTHON3 |
from sys import stdin, stdout
# 3 5 4 0 2 1
# 6
# 1
# 3
# 4
# 0 1 5
#
#
#
# 0 1 2 3 4 5
# 6
# 5
# 4
# 3
# 2
# 1
# 0 5 2 3 4 1
# (0 5 2 3 4) 6
if __name__ == '__main__':
def replace_by_MEX(n, a):
dic = {}
s = set()
res = []
for i in range(n):
if a[i] not in dic:
dic[a[i]] = 1
else:
dic[a[i]] += 1
if a[i] != i:
s.add(i)
while len(s) > 0:
m = MEX(dic)
idx = -1
if n == MEX(dic):
idx = next(iter(s))
else:
idx = m
s.remove(idx)
res.append(idx + 1)
dic[a[idx]] -= 1
a[idx] = m
dic[m] = 1
#print(a)
return res
def MEX(dic):
mex = 0
while mex in dic and dic[mex] > 0:
mex += 1
return mex
t = int(stdin.readline())
for i in range(t):
n = int(stdin.readline())
a = list(map(int, stdin.readline().split()))
res = replace_by_MEX(n, a)
stdout.write(str(len(res)) + '\n')
stdout.write(" ".join(map(str, res)) + '\n')
| 10 | PYTHON3 |
t = int(input())
for _ in range (t):
n = int(input())
toDelete,rem = divmod (n,4)
if rem == 0:
s = "9"*(n-toDelete) + "8"*toDelete
else:
s = "9"*(n-toDelete-1) + "8"*(toDelete+1)
print (s) | 8 | PYTHON3 |
#include <cstdio>
int main(){
int a,b,c;
int sum;
char grade;
while(1){
scanf("%d%d%d",&a,&b,&c);
if(a+b+c==-3) break;
if(a==-1||b==-1) grade = 'F';
else{
sum = a+b;
if(sum<30) grade = 'F';
else if(sum<50){
if(c>=50) grade = 'C';
else grade = 'D';
}
else if(sum<65) grade = 'C';
else if(sum<80) grade = 'B';
else grade = 'A';
}
printf("%c\n",grade);
}
} | 0 | CPP |
from itertools import combinations
for _ in range(int(input())):
n=int(input())
l=list(map(int,input().split()))
f=0
for i in range(n):
if(l[i] in l[i+2:]):
print("YES")
break
else:
print("NO") | 8 | PYTHON3 |
s = [int(x) for x in input().split()]
print([-1, sum(s)//5][sum(s)%5==0 and sum(s)>0]) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n;
char s[80];
int posv[80], posk[80], posa[80], sumv[80], sumk[80], suma[80], cnta, cntv,
cntk;
int dp[80][80][80][2];
int main() {
scanf("%d", &n);
scanf(" %s", s + 1);
for (int i = 1; i < (n + 1); i++) {
suma[i] = suma[i - 1];
sumv[i] = sumv[i - 1];
sumk[i] = sumk[i - 1];
if (s[i] == 'V') {
sumv[i] += 1;
cntv++;
posv[cntv] = i;
} else if (s[i] == 'K') {
sumk[i] += 1;
cntk++;
posk[cntk] = i;
} else {
suma[i] += 1;
cnta++;
posa[cnta] = i;
}
}
memset(dp, 0x3f3f3f3f, sizeof(dp));
dp[0][0][0][0] = 0;
for (int i = 0; i < (cntv + 1); i++) {
for (int j = 0; j < (cntk + 1); j++) {
for (int k = 0; k < (cnta + 1); k++) {
int pos = i + j + k + 1;
if (i < cntv) {
dp[i + 1][j][k][1] =
min(dp[i + 1][j][k][1], dp[i][j][k][0] +
max(0, sumk[posv[i + 1]] - j) +
max(0, suma[posv[i + 1]] - k));
dp[i + 1][j][k][1] =
min(dp[i + 1][j][k][1], dp[i][j][k][1] +
max(0, sumk[posv[i + 1]] - j) +
max(0, suma[posv[i + 1]] - k));
}
if (j < cntk)
dp[i][j + 1][k][0] =
min(dp[i][j + 1][k][0], dp[i][j][k][0] +
max(0, sumv[posk[j + 1]] - i) +
max(0, suma[posk[j + 1]] - k));
if (k < cnta) {
dp[i][j][k + 1][0] =
min(dp[i][j][k + 1][0], dp[i][j][k][0] +
max(0, sumv[posa[k + 1]] - i) +
max(0, sumk[posa[k + 1]] - j));
dp[i][j][k + 1][0] =
min(dp[i][j][k + 1][0], dp[i][j][k][1] +
max(0, sumv[posa[k + 1]] - i) +
max(0, sumk[posa[k + 1]] - j));
}
}
}
}
printf("%d\n", min(dp[cntv][cntk][cnta][1], dp[cntv][cntk][cnta][0]));
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
printf("%d\n", n % 2);
return 0;
}
| 7 | CPP |
#include "bits/stdc++.h"
#define REP(i,num) for(int i=0;i<(num);++i)
#define ALL(c) c.begin(),c.end()
#define PRINTALL(c) for(auto& x:c){cout<<x<<' ';}cout<<endl;
#define PAIRCOMP(c,comp) [](const pair<ll,ll>& lhs,const pair<ll,ll>& rhs){return lhs.c comp rhs.c;}
using namespace std;
using ll = long long;
constexpr ll atcoder_mod = 1e9+7;
template<typename T=int>
T in(){T x; cin >> x; return (x);}
template<typename T=int,typename C=vector<T>>
C vecin(int N){C x(N);REP(i,N){x[i]=in<T>();}return move(x);}
void vout(){cout << endl;}
template<typename Head,typename... Tail>
void vout(Head&& h,Tail&&... t){cout << ' ' << h;vout(forward<Tail>(t)...);}
void out(){cout << endl;}
template<typename Head,typename... Tail>
void out(Head&& h,Tail&&... t){cout << h;vout(forward<Tail>(t)...);}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int N=in(),Q=in();
vector<queue<int>> S(N);
REP(i,Q){
int q=in();
int t=in();
if(!q){
S[t].push(in());
}
else if(q==1){
if(!S[t].empty()) out(S[t].front());
}
else{
if(!S[t].empty()) S[t].pop();
}
}
return 0;
}
| 0 | CPP |
import sys
import math
from collections import defaultdict,Counter,deque
# input=sys.stdin.readline
# def print(x):
# sys.stdout.write(str(x)+"\n")
import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
# sys.stdout=open("CP1/output.txt",'w')
# sys.stdin=open("CP1/input.txt",'r')
# mod=pow(10,9)+7
for i in range(1):
n=int(input())
a=list(map(int,input().split()))
l=[]
for j in range(n):
l.append([a[j],j])
l.sort()
dp=[[10**9,0] for j in range(n+1)]
dp[0][0]=0
for j in range(n-2):
cur=dp[j][0]+l[j+2][0]-l[j][0]
if dp[j+3][0]>cur:
dp[j+3]=[cur,j-1]
if j+4<=n:
cur=dp[j][0]+l[j+3][0]-l[j][0]
if dp[j+4][0]>cur:
dp[j+4]=[cur,j-1]
if j+5<=n:
cur=dp[j][0]+l[j+4][0]-l[j][0]
if dp[j+5][0]>cur:
dp[j+5]=[cur,j-1]
j=n-1
p=1
# print(dp)
while j>0:
for k in range(j,dp[j+1][1],-1):
a[l[k][1]]=p
p+=1
j=dp[j+1][1]
print(dp[n][0],p-1)
print(*a)
| 11 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
bool ok(int x)
{
int o=((int) (sqrt(x)+0.5));
return (o*o==x || (o-1)*(o-1)==x || (o+1)*(o+1)==x);
}
int32_t main()
{
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int t;
cin>>t;
while(t--)
{
int x;
cin>>x;
if((x%2==0 && ok(x)) || ok(2*x))
{
cout<<"YES"<<endl;
}
else
{
cout<<"NO"<<endl;
}
}
return 0;
}
| 8 | CPP |
n = int(input())
for i in range(n):
word = str(input())
if len(word) <= 10:
print(word)
else:
answer = word[0] + str(len(word) - 2) + word[-1]
print(answer) | 7 | PYTHON3 |
import math
t = int(input())
for _ in range(0, t):
n, d = map(int, input().split())
for i in range(0, int(pow(d, 1/2))):
if((i+math.ceil(d/(i+1))) <= n):
print("YES")
break
if(i == int(pow(d, 1/2))-1):
print("NO") | 7 | PYTHON3 |
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
vector<string> s(3);
cin>>s[0]>>s[1]>>s[2];
int cur = 0;
while(1){
if(s[cur].empty()){
cout << (char)('A' +cur)<< endl;
return 0;
}
char tmp = s[cur][0];
s[cur].erase(s[cur].begin());
cur = tmp - 'a';
}
}
| 0 | CPP |
n,m,z=map(int,input().split())
c=0
a=n
b=m
for i in range(1,z+1):
if n+a==i:
n=n+a
if m+b==i:
m=m+b
if n==m and (n==i or m==i) :
c+=1
print(c) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long read() {
long long k = 0, f = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-') f = -1;
c = getchar();
}
while (c >= '0' && c <= '9') k = k * 10 + c - 48, c = getchar();
return k * f;
}
struct zzz {
int f, t, nex;
} e[1000010 << 1];
int head[1000010], tot;
void add(int x, int y) {
e[++tot].t = y;
e[tot].f = x;
e[tot].nex = head[x];
head[x] = tot;
}
int vis[1000010], dfn[1000010], low[1000010], colnum, belong[1000010], deth,
s[1000010], top;
int in[1000010];
void Tarjan(int x) {
low[x] = dfn[x] = ++deth;
s[++top] = x;
vis[x] = 1;
for (int i = head[x]; i; i = e[i].nex) {
if (!dfn[e[i].t]) {
Tarjan(e[i].t);
low[x] = min(low[x], low[e[i].t]);
} else if (vis[e[i].t])
low[x] = min(low[x], dfn[e[i].t]);
}
if (dfn[x] == low[x]) {
++colnum;
int k = 0;
do {
k = s[top--];
belong[k] = colnum;
vis[k] = 0;
} while (k != x);
}
}
int main() {
int t = read();
while (t--) {
int n = read(), m = read();
tot = top = deth = colnum = 0;
for (int i = 1; i <= n; ++i)
head[i] = vis[i] = low[i] = belong[i] = dfn[i] = in[i] = 0;
for (int i = 1; i <= m; ++i) {
int x = read(), y = read();
if (x == y) continue;
add(x, y);
}
for (int i = 1; i <= n; ++i)
if (!dfn[i]) Tarjan(i);
if (colnum == 1)
printf("NO\n");
else {
int cnt = tot, pos = 0;
for (int i = 1; i <= cnt; ++i)
if (belong[e[i].f] != belong[e[i].t]) ++in[belong[e[i].t]];
for (int i = 1; i <= colnum; ++i)
if (!in[i]) pos = i;
int num = 0;
for (int i = 1; i <= n; ++i)
if (belong[i] == pos) ++num;
printf("YES\n%d %d\n", n - num, num);
for (int i = 1; i <= n; ++i)
if (belong[i] != pos) printf("%d ", i);
printf("\n");
for (int i = 1; i <= n; ++i)
if (belong[i] == pos) printf("%d ", i);
}
}
return 0;
}
| 12 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 8;
pair<int, int> ps[N];
int main() {
for (int i = 0; i < N; i++) scanf("%d%d", &ps[i].first, &ps[i].second);
sort(ps, ps + N);
if (ps[0].first < ps[3].first && ps[3].first < ps[5].first &&
ps[0].first == ps[1].first && ps[1].first == ps[2].first &&
ps[3].first == ps[4].first && ps[5].first == ps[6].first &&
ps[6].first == ps[7].first && ps[0].second < ps[1].second &&
ps[1].second < ps[2].second && ps[0].second == ps[3].second &&
ps[3].second == ps[5].second && ps[1].second == ps[6].second &&
ps[2].second == ps[4].second && ps[4].second == ps[7].second)
puts("respectable");
else
puts("ugly");
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
char str[5010];
struct node {
int num_a;
int num_b;
} num[5010];
int main() {
scanf("%s", str + 1);
int len = strlen(str + 1);
int temp_a, temp_b;
for (int i = 1; i <= len; i++) {
temp_a = temp_b = 0;
if (str[i] == 'a') temp_a = 1;
if (str[i] == 'b') temp_b = 1;
num[i].num_a = num[i - 1].num_a + temp_a;
num[i].num_b = num[i - 1].num_b + temp_b;
}
int ans = 1;
for (int j = len; j >= 1; j--) {
for (int i = 1; i <= j; i++) {
int temp = 1;
temp = max(temp, num[len].num_b - num[j - 1].num_b + num[j].num_a);
temp = max(temp, num[j].num_a + num[len].num_b - num[j - 1].num_b);
if (i != j) {
temp = num[i].num_a + num[j].num_b - num[i - 1].num_b + num[len].num_a -
num[j - 1].num_a;
}
ans = max(ans, temp);
}
}
ans = max(num[len].num_a, ans);
ans = max(num[len].num_b, ans);
printf("%d\n", ans);
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
char a[10];
int main() {
scanf("%s", &a);
int i, ans = 1;
for (i = 1; i < 7; i++)
if (a[i] == '1')
ans += 10;
else
ans += a[i] - 48;
cout << ans;
return 0;
}
| 12 | CPP |
x = list(map(int, input().split(" ")))
v1 = max(3*x[0]/10, x[0]-(x[0]/250)*x[2])
v2 = max(3*x[1]/10, x[1]-(x[1]/250)*x[3])
if(v1 == v2):
print("Tie")
elif(v1 > v2):
print("Misha")
else:
print("Vasya")
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a.at(i);
ll dp=1000;
rep(i,n-1){
if(a.at(i) <= a.at(i+1)){
dp = (dp/a.at(i)) * a.at(i+1)+dp%a.at(i);
}
}
cout << dp << endl;
}
| 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
int p[3001], h[3001];
int main() {
int n, m, i, j, k, hcnt, t, x;
cin >> n;
for (i = 1; i <= n; i++) cin >> p[i];
cin >> m;
for (hcnt = 0, i = 1; i <= n; i++) {
if (h[i] == 0) {
h[i] = i;
for (j = p[i]; j != i; j = p[j]) h[j] = i;
hcnt++;
}
}
if (n - hcnt == m)
cout << 0 << endl;
else if (n - hcnt > m) {
i = n - hcnt - m;
cout << i << endl;
while (i--) {
for (j = 1; p[j] == j; j++)
;
for (k = j, x = p[j]; p[k] != j; k = p[k])
if (p[k] < x) x = p[k];
cout << j << " " << x << " ";
t = p[j];
p[j] = p[x];
p[x] = t;
}
cout << endl;
} else {
i = m + hcnt - n;
cout << i << endl;
while (i--) {
for (j = 1; j <= n; j++) h[j] = 0;
for (h[1] = 1, j = p[1]; j != 1; j = p[j]) h[j] = 1;
for (j = 1; h[j] == 1; j++)
;
cout << "1 " << j << " ";
t = p[j];
p[j] = p[1];
p[1] = t;
}
cout << endl;
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if (n == 0) {
puts("a");
return 0;
}
char c = 'a';
while (n) {
int sum = 0;
int cur = 1;
while (sum <= n) {
sum += cur;
cur++;
}
cur--;
for (int i = 1; i <= cur; i++) {
printf("%c", c);
}
cur--;
for (int i = 1; i <= cur; i++) n -= i;
c++;
}
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
inline void read(int &x) {
int f = 1;
x = 0;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-') f = -1;
ch = getchar();
}
while ('0' <= ch && ch <= '9') {
x = x * 10 + ch - '0';
ch = getchar();
}
x *= f;
}
const int maxn = 101000;
vector<unsigned> mor[maxn];
int les[maxn];
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
int n, m;
read(n), read(m);
for (int i = 1; i <= m; i += 1) {
int x, y;
read(x), read(y);
if (x > y) swap(x, y);
mor[x].push_back(y), ++les[y];
}
unsigned ans = 0;
for (int i = 1; i <= n; i += 1) {
ans += (les[i]) * (mor[i].size());
}
int q;
read(q);
cout << ans << '\n';
while (q--) {
int x;
read(x);
ans -= (les[x]) * (mor[x].size());
for (auto j : mor[x]) {
ans += (les[j]) - (mor[j].size()) - 1;
mor[j].push_back(x);
--les[j];
++les[x];
}
mor[x].clear();
cout << ans << '\n';
}
return 0;
}
| 12 | CPP |
import math
x=input().split()
n=int(x[0])
m=int(x[1])
a=int(x[2])
x=math.ceil(n/a)*math.ceil(m/a)
print(x) | 7 | PYTHON3 |
def solve():
pairwise = [[dist(a[i], a[j]) for i in range(n)] for j in range(n)]
if max([max(i) for i in pairwise]) > 2:
return -1
elif max([max(i) for i in pairwise]) < 2:
return a[0]
possible = None
#for p in pairwise:
# print(*p)
for i in range(n):
for j in range(i):
if pairwise[i][j] == 2:
ss = get_possible(a[i], a[j])
possible = update_pos(possible, ss)
ps = []
for p in possible:
pos = True
for s in a:
if dist(p, s) > 1:
pos = False
if pos:
ps.append(p)
if ps:
return ps[0]
else:
return -1
def dist(s1, s2):
r = 0
for k in range(m):
if s1[k] != s2[k]:
r+=1
return r
def update_pos(possible, ss):
r = []
if possible == None:
r = ss
else:
for s in ss:
if s in possible:
r.append(s)
return r
def get_possible(s1, s2):
r1 = []
r2 = []
first = True
for k in range(m):
if s1[k] == s2[k]:
r1.append(s1[k])
r2.append(s1[k])
elif s1[k] != s2[k] and first:
r1.append(s1[k])
r2.append(s2[k])
first = False
else:
r2.append(s1[k])
r1.append(s2[k])
return ["".join(r1), "".join(r2)]
t = int(input())
for _ in range(t):
n, m = map(int, input().split())
a = [input() for _ in range(n)]
print(solve())
| 12 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
char a[100000 + 10];
int main() {
int i, j, k, m, n;
cin >> a;
int len = strlen(a);
m = 0;
for (int i = 0; i < len; i++) {
int t = a[i] - '0' + 0;
m = ((m * 10) % 4 + t % 4) % 4;
}
if (!m)
cout << 4 << endl;
else
cout << 0 << endl;
return 0;
}
| 8 | CPP |
t=int(input())
while(t):
t-=1
n=int(input())
l=list(map(int,input().split()))
kkk=0
k=[]
gg=[]
c=0
if min(l)==max(l):
print("NO")
else:
print("YES")
for i in range(0,n):
if l[i]!=l[kkk]:
print(i+1,' ',kkk+1)
if c==0:
gg.append(i)
c+=1
elif l[i]==l[kkk] and i!=kkk:
k.append(i)
for ii in k:
print(ii+1," ",gg[0]+1)
| 10 | PYTHON3 |
def solve(n,d):
if n == 1:
return "YES"
parity = d[0] % 2
for i in range(1,n):
curr = d[i] % 2
if curr != parity:
return "NO"
return "YES"
def main():
t = int(input())
for i in range(t):
n = int(input())
d = input()
d = [int(i) for i in d.split()]
ans = solve(n,d)
print(ans)
main() | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t = 1;
cin >> t;
while (t--) {
int n;
cin >> n;
int b[n], count = 0;
for (int i = 0; i < n; ++i) {
cin >> b[i];
}
int c[n];
c[0] = 1;
c[n - 1] = 1;
count += 2;
for (int i = 1; i < n - 1; ++i) {
if (b[i] > b[i - 1] && b[i] < b[i + 1]) {
c[i] = 0;
} else if (b[i] < b[i - 1] && b[i] > b[i + 1]) {
c[i] = 0;
} else {
c[i] = 1;
count++;
}
}
cout << count << '\n';
for (int i = 0; i < n; ++i) {
if (c[i] == 1) {
cout << b[i] << " ";
}
}
cout << '\n';
}
}
| 8 | CPP |
#include<iostream>
#include<map>
#include<cstdlib>
using namespace std;
char s[1234567];
char *p;
typedef map<map<char,int>,int> E;
E exp();
E mul(){
while(*p==' '){
p++;
}
if(isdigit(*p)){
E e;
e[map<char,int>()]=strtol(p,&p,10);
return e;
}else if(*p=='('){
p++;
auto r=exp();
while(*p==' '){
p++;
}
p++;
return r;
}else{
char c=*p;
p++;
while(*p==' '){
p++;
}
int pw;
if(*p!='^'){
pw=1;
}else{
p++;
pw=strtol(p,&p,10);
}
map<char,int> v;
v[c]=pw;
E e;
e[v]=1;
return e;
}
}
E term(){
auto l=mul();
for(;;){
while(*p==' '){
p++;
}
if(!isalnum(*p)&&*p!='(')break;
auto lo=l;
l.clear();
auto r=mul();
for(auto &e:lo){
for(auto &f:r){
map<char,int> v;
for(auto &ee:e.first){
v[ee.first]+=ee.second;
}
for(auto &ff:f.first){
v[ff.first]+=ff.second;
}
l[v]+=e.second*f.second;
}
}
}
return l;
}
E exp(){
auto l=term();
for(;;){
while(*p==' '){
p++;
}
int f;
if(*p=='+'){
f=1;
}else if(*p=='-'){
f=-1;
}else{
break;
}
p++;
auto r=term();
for(auto &e:r){
l[e.first]+=f*e.second;
}
}
return l;
}
E startexp(){
p=s;
auto r=exp();
for(auto it=r.begin();it!=r.end();){
if(it->second==0){
it=r.erase(it);
}else{
it++;
}
}
// for(auto e:r){
// cout<<e.second;
// for(auto f:e.first){
// cout<<f.first<<f.second;
// }
// cout<<'*';
// }
// cout<<endl;
return r;
}
int main(){
while(cin.getline(s,sizeof s),s[0]!='.'){
auto ans=startexp();
while(cin.getline(s,sizeof s),s[0]!='.'){
auto c=startexp();
cout<<((ans==c)?"yes":"no")<<endl;
}
cout<<"."<<endl;
}
} | 0 | CPP |
def main():
for _ in range(int(input())):
s = input()
ok = True
ans = []
j = -1
idx = {}
for i in range(len(s)):
if s[i] not in ans:
if j == len(ans) - 2:
ans.append(s[i])
j += 1
elif j == -1:
ans = [s[i]] + ans
else:
ok = False
else:
if j > -1:
if ans[j - 1 + 1] == s[i]:
j -= 1
continue
if j < len(ans) - 1 - 1:
if ans[j + 1 + 1] == s[i]:
j += 1
continue
ok = False
if ok:
for i in range(97, 97 + 26):
if chr(i) not in ans:
ans.append(chr(i))
print('YES')
print("".join(ans))
else:
print('NO')
main() | 9 | PYTHON3 |
def kth_string(n,k):
i = 1
while (k > (i*(i-1)/2)):
i+=1
string = "a" * n
string = string[:n-i] + "b" + string[n-i+1:]
# string[n-i] = "b"
diff = k - (i-1)*(i-2)//2
if diff == 0:
# string[n-i+1] = "b"
string = string[:n-i+1] + "b" + string[n-i+2:]
else:
# string[n-diff] = "b"
string = string[:n-diff] + "b" + string[n-diff+1:]
return string
if __name__ == "__main__":
t = int(input())
for _ in range(t):
n,k = map(int,input().split())
print(kth_string(n,k))
| 8 | PYTHON3 |
import math
import os
import random
import re
import sys
t = int(input())
a = input()
c = 0
for x in range(1,t):
if a[x-1] == a[x]:
c = c + 1
print(c) | 7 | PYTHON3 |
import math
nxy = input()
numeri = input()
l1 = list(map(int, nxy.rstrip().split()))
ai = list(map(int, numeri.rstrip().split()))
bi = sorted(ai)
n = l1[0]
x = l1[1]
y = l1[2]
cont = 1
if y >= x:
accessibili = [i < x+1 for i in bi]
num = math.ceil(accessibili.count(True)/2)
print(num)
else:
print(n) | 9 | PYTHON3 |
def main():
n = int(input())
a = int(input())
b = int(input())
c = int(input())
if n == 1:
print("0")
elif n == 2:
print(min(a, b))
else:
print(min(a, b) + (n - 2) * min(a, min(b, c)))
if __name__ == '__main__':
main()
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
long long t[n - k + 1], ordenado[n - k + 1];
long long a[n], b[n];
for (long long i = 0; i < n; i++) {
cin >> a[i];
b[i] = a[i];
}
for (long long i = 1; i < n; i++) {
b[i] = b[i] + b[i - 1];
}
t[0] = b[k - 1];
for (long long i = 1; i < n - k + 1; i++) {
t[i] = b[i + k - 1] - b[i - 1];
}
long long maximo = 0, a1, a2, actual = 0;
for (long long i = n - k; i >= 0; i--) {
if (t[i] >= actual) {
ordenado[i] = t[i];
actual = t[i];
} else {
ordenado[i] = actual;
}
}
for (long long i = 0; i <= n - 2 * k; i++) {
if (t[i] + ordenado[k + i] > maximo) {
a1 = i;
maximo = t[i] + ordenado[k + i];
}
}
maximo = 0;
for (long long i = n - k; i >= a1 + k; i--) {
if (t[a1] + t[i] >= maximo) {
a2 = i;
maximo = t[a1] + t[i];
}
}
cout << a1 + 1 << ' ' << a2 + 1 << endl;
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
void rm(bool ok[4], vector<string>& r, int y, int x) {
if (0 <= y && y < r.size() && 0 <= x && x < r[y].size())
if ('a' <= r[y][x] && r[y][x] <= 'd') ok[r[y][x] - 'a'] = 0;
}
int main() {
int H, W;
cin >> H >> W;
vector<string> b(H);
for (int i = 0; i < H; ++i) cin >> b[i];
vector<string> r = b;
for (int y = 0; y < H; ++y)
for (int x = 0; x < W; ++x)
if (r[y][x] != '.') r[y][x] = 'e';
for (int y = 0; y < H; ++y)
for (int x = 0; x < W; ++x)
if (b[y][x] == 'b') {
cout << "NO" << endl;
return 0;
} else if (b[y][x] == 'w') {
bool ok[4] = {1, 1, 1, 1};
if (x + 2 < W && b[y][x + 1] == 'b' && b[y][x + 2] == 'w') {
b[y][x] = b[y][x + 1] = b[y][x + 2] = '.';
rm(ok, r, y - 1, x + 0);
rm(ok, r, y - 1, x + 1);
rm(ok, r, y - 1, x + 2);
rm(ok, r, y, x - 1);
rm(ok, r, y, x + 3);
rm(ok, r, y + 1, x + 0);
rm(ok, r, y + 1, x + 1);
rm(ok, r, y + 1, x + 2);
for (char c = 'a'; c <= 'd'; ++c)
if (ok[c - 'a']) {
r[y][x] = r[y][x + 1] = r[y][x + 2] = c;
break;
}
} else if (y + 2 < H && b[y + 1][x] == 'b' && b[y + 2][x] == 'w') {
b[y][x] = b[y + 1][x] = b[y + 2][x] = '.';
rm(ok, r, y + 0, x - 1);
rm(ok, r, y + 1, x - 1);
rm(ok, r, y + 2, x - 1);
rm(ok, r, y - 1, x);
rm(ok, r, y + 3, x);
rm(ok, r, y + 0, x + 1);
rm(ok, r, y + 1, x + 1);
rm(ok, r, y + 2, x + 1);
for (char c = 'a'; c <= 'd'; ++c)
if (ok[c - 'a']) {
r[y][x] = r[y + 1][x] = r[y + 2][x] = c;
break;
}
} else {
cout << "NO" << endl;
return 0;
}
}
cout << "YES" << endl;
for (int y = 0; y < H; ++y) cout << r[y] << endl;
}
| 16 | CPP |
#include<bits/stdc++.h>
using namespace std;
int main(void){
long long a;double b;cin>>a>>b;
a*=(int)(b*100+0.5);
cout<<a/100<<endl;
return 0;
}
| 0 | CPP |
#include"bits/stdc++.h"
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
int A[100005];
int sum = 0;
for (int i = 1; i <= N; i++)
{
cin >> A[i];
}
for (int i = 0; i <= N; i++) {
sum += abs(A[i] - A[i+1]);
}
for (int i = 1; i <= N; i++)
{
int ans = sum - abs(A[i-1] - A[i]) - abs(A[i] - A[i + 1]) + abs(A[i - 1] - A[i + 1]);
cout << ans << endl;
}
return 0;
} | 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long n, l, r, k, c, i;
string s;
int main() {
ios_base::sync_with_stdio(0);
cin >> n;
if (n == 0) {
cout << "a"
<< "\n";
return 0;
}
while (n > 0) {
l = 1;
r = 100000;
k++;
while (l < r) {
c = (l + r) / 2;
if (c * (c - 1) / 2 > n)
r = c;
else
l = c + 1;
}
if (l * (l - 1) / 2 > n) l--;
n -= (l * (l - 1) / 2);
for (i = 1; i <= l; i++) s += char(96 + k);
}
cout << s << "\n";
return 0;
}
| 9 | CPP |
r,b=map(int,input().split())
mn=min(r,b)
mx=max(r,b)
print(mn,(mx-mn)//2,end=" ")
| 7 | PYTHON3 |
for i in range(int(input())):
n,c0,c1,h=map(int,input().split(' '))
st=list(input())
y=st.count('0')
z=st.count('1')
a=c0*y+c1*z
if y<=z:
x=h*y
ans1=c1*n+x
x2=h*z
ans2=c0*n+x2
finans=min(ans1,ans2)
print(min(a,finans))
elif z<=y:
x=h*z
ans1=c0*n+x
x2=h*y
ans2=c1*n+x2
finans=min(ans1,ans2)
print(min(a,finans)) | 7 | PYTHON3 |
#include<cstdio>
#include<cmath>
#include<algorithm>
#define neko 100010
#define f(i,a,b) for(register int i=(a);i<=(b);i=-(~(i)))
int n,m,t,ciru,cirv,ans,tp,flag;
struct node
{int v,nex;}e[neko<<1];
typedef int arr[neko];
arr num,dep,head,fa,s;
void add(int x,int y)
{
e[++t].v=y,e[t].nex=head[x],head[x]=t;
e[++t].v=x,e[t].nex=head[y],head[y]=t;
}
void dfs(int u)
{
num[u]=((dep[u]=dep[fa[u]]+1)&1)?1:-1;
for(register int i=head[u],v=e[i].v;i;i=e[i].nex,v=e[i].v)
{
if(v^fa[u])
{
if(dep[v]){if(!flag)ciru=u,cirv=v,flag=1;}
else fa[v]=u,dfs(v),num[u]+=num[v];
}
}
}
void solve_odd()
{
if(num[1]&1){ans=-1;return;}
int fix=-num[1]/2,x;
ans=abs(fix);
for(x=ciru;x;x=fa[x])num[x]+=fix;
for(x=cirv;x;x=fa[x])num[x]+=fix;
f(i,1,n)ans+=abs(num[i]);
}
void solve_even()
{
if(num[1]){ans=-1;return;}
for(int x=ciru;x^cirv;x=fa[x])s[++tp]=num[x],dep[x]=0;
//网上一些Solution没flag标记，可能最终会导致最后找到的那条环边一定是从上往下的，所以他们写的从cirv跳到ciru才是正确的。
int mid=(tp+1)>>1,now;
std::nth_element(s+1,s+mid,s+tp+1);
if(tp&1)now=s[mid];
else now=(s[mid]+s[mid+1])/2;
ans=abs(now);
f(i,1,n)if(dep[i])ans+=abs(num[i]);
f(i,1,tp)ans+=abs(s[i]-now);
}
int main()
{
int x,y;
scanf("%d%d",&n,&m);
f(i,1,m)scanf("%d%d",&x,&y),add(x,y);
dfs(1);
if(m==n-1)if(num[1])ans=-1;else f(i,1,n)ans+=abs(num[i]);
else if((dep[ciru]-dep[cirv]+1)&1)solve_odd();
else solve_even();
int xx[10]={0,1,4,2,3};
return printf("%d\n",ans),0;
} | 0 | CPP |
from sys import stdin, stdout
from bisect import bisect_right
def find(arr, N):
c=0
while(N>1):
k=bisect_right(arr,N)-1
N-=arr[k]
c+=1
return c
def main():
r=0
arr=[2,]
for i in range(2,10**6):
arr.append(arr[-1]+i*2+i-1)
for _ in range(int(stdin.readline())):
print(find(arr, int(stdin.readline())))
main() | 8 | PYTHON3 |
def read_ints():
return map(int, input().split())
d, time = read_ints()
minTime = [0] * d
maxTime = [0] * d
for i in range(d):
minTime[i], maxTime[i] = read_ints()
if sum(minTime) <= time <= sum(maxTime):
print("YES")
solution = []
dr = time - sum(minTime)
for i in range(d):
di = min(dr, maxTime[i] - minTime[i])
dr -= di
solution.append(str(minTime[i] + di))
print(" ".join(solution))
else:
print("NO")
| 8 | PYTHON3 |
import sys,os,io
import math,bisect,operator
inf,mod = float('inf'),10**9+7
# sys.setrecursionlimit(10 ** 6)
from itertools import groupby,accumulate
from heapq import heapify,heappop,heappush
from collections import deque,Counter,defaultdict
input = iter(sys.stdin.buffer.read().decode().splitlines()).__next__
Neo = lambda : list(map(int,input().split()))
n, = Neo()
A = Neo()
d = Counter(A)
a,r = 0,0
for i in d.values():
a += i//4
r += i//2
q, = Neo()
for i in range(q):
p,q = input().split()
q = int(q)
if p == '+':
a -= d[q]//4
r -= d[q]//2
d[q] += 1
a += d[q]//4
r += d[q]//2
else:
a -= d[q]//4
r -= d[q]//2
d[q] -= 1
a += d[q]//4
r += d[q]//2
if a > 1 or (a == 1 and r > 3):
print('YES')
else:
print('NO')
| 8 | PYTHON3 |
from math import floor
n = int(input())
print(abs(n - floor(n/4)*4 - 1), 'B' if (n-2) % 4 == 0 else 'A') | 7 | PYTHON3 |
a,b=[int(x) for x in input().split()]
p=[int(x) for x in input().split()]
f=[0]*b
count=0
for i in p:
if i not in f:
f.insert(0,i)
f.pop()
print(len(f)-f.count(0))
for i in f:
if i!=0:
print(i,end=' ') | 8 | PYTHON3 |
#include <cstdio>
int n,x,t;
int main(){
scanf("%d%d%d",&n,&x,&t);
printf("%d\n",((n+x-1)/x)*t);
return 0;
}
| 0 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long pl, pr, vl, vr, k;
vector<long long> lu;
void init() {
for (int l = 1; l <= 10; l++) {
for (int mask = 0; mask < (1 << l); mask++) {
long long num = 0;
for (int i = 0; i < l; i++) {
if (mask & (1 << i))
num = num * 10 + 4;
else
num = num * 10 + 7;
}
lu.push_back(num);
}
}
lu.push_back(1);
sort(lu.begin(), lu.end());
}
vector<bool> used;
int main() {
cin >> pl >> pr >> vl >> vr >> k;
init();
used.resize(lu.size());
double ans = 0.0;
for (int i = 0; i + 1 < lu.size(); i++) {
long long l = lu[i] + 1, r = lu[i + 1] - 1;
l = max(pl, l), r = min(r, pr);
if (l <= r) {
int j = i - k;
if (j >= 0) {
long long nl = lu[j] + 1, nr = lu[j + 1];
if (j == 0) nl = 1;
nl = max(vl, nl), nr = min(nr, vr);
long long q = 0;
if (nr >= nl) {
q = nr - nl + 1;
used[j] = 1;
}
ans += 1.0 * (r - l + 1) * q;
}
}
l = lu[i] + 1, r = lu[i + 1] - 1;
if (i == 0) l = 1;
l = max(pl, l), r = min(r, pr);
if (l <= r) {
int j = i + k;
if (j + 1 < lu.size()) {
long long nl = lu[j], nr = lu[j + 1] - 1;
nl = max(vl, nl), nr = min(nr, vr);
long long q = 0;
if (nr >= nl) {
q = nr - nl + 1;
used[j] = 1;
}
ans += 1.0 * (r - l + 1) * q;
}
}
}
for (int i = 1; i < lu.size(); i++) {
if (lu[i] <= pr && lu[i] >= pl) {
int j = i + k - 1;
if (j + 1 < lu.size()) {
long long nl = lu[j], nr = lu[j + 1] - 1;
nl = max(vl, nl), nr = min(nr, vr);
long long q = 0;
if (nr >= nl) {
q = nr - nl + 1;
used[j] = 1;
}
ans += 1.0 * q;
}
j = i - k;
if (j >= 0) {
long long nl = lu[j] + 1, nr = lu[j + 1];
if (j == 0) nl = 1;
nl = max(vl, nl), nr = min(nr, vr);
long long q = 0;
if (nr >= nl) {
if (nr == lu[i]) nr--;
if (nr >= nl) {
q = nr - nl + 1;
used[j] = 1;
}
}
ans += 1.0 * q;
}
}
}
printf("%.12lf\n", ans / (pr - pl + 1) / (vr - vl + 1));
return 0;
}
| 8 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1 << 18;
const int lbt = 998244353;
int rev(int a);
void ntt(int *a, int k, int *ans, bool rev);
void juanji(int *a, int *b, int *c, int n, int m, int top);
void trans(int *a, int n, int d, int *ans);
void stirling(int n, int *ans);
int comb(int n, int m);
int n, a, b;
int s[maxn];
int fac[maxn], rfac[maxn];
int main() {
scanf("%d%d%d", &n, &a, &b);
fac[0] = rfac[0] = 1;
for (int i = 1; i <= n; i++) {
fac[i] = (long long)i * fac[i - 1] % lbt;
}
rfac[n] = rev(fac[n]);
for (int i = n; i >= 1; i--) {
rfac[i - 1] = (long long)i * rfac[i] % lbt;
}
if (a == 0 || b == 0 || a + b - 2 > n - 1) {
printf("0");
return 0;
}
stirling(n - 1, s);
int ans = (long long)s[a + b - 2] * comb(a + b - 2, a - 1) % lbt;
printf("%d", ans);
return 0;
}
int fast_pow(int a, int t) {
int ans = 1;
for (int i = 31; i >= 0; i--) {
ans = (long long)ans * ans % lbt;
if (t >> i & 1) ans = (long long)a * ans % lbt;
}
return ans;
}
void ntt(int *a, int k, int *ans, bool rev) {
static int bit_rev[maxn];
static int rev3 = ::rev(3);
int n = 1 << k;
for (int i = 0; i < n; i++) {
bit_rev[i] = (bit_rev[i >> 1] >> 1) | ((i & 1) << k - 1);
}
for (int i = 0; i < n; i++) {
ans[bit_rev[i]] = a[i];
}
for (int t = 1; t <= k; t++) {
int w_n = fast_pow(rev ? rev3 : 3, (lbt - 1) / (1 << t));
for (int i = 0; i < n; i += (1 << t)) {
int w = 1;
for (int j = i; j < i + (1 << t - 1); j++) {
int ans0 = ans[j];
int ans1 = ans[j + (1 << t - 1)];
ans[j] = (ans0 + (long long)w * ans1) % lbt;
ans[j + (1 << t - 1)] = (ans0 + (long long)(lbt - w) * ans1) % lbt;
w = (long long)w_n * w % lbt;
}
}
}
if (rev) {
int rn = ::rev(n);
for (int i = 0; i < n; i++) {
ans[i] = (long long)rn * ans[i] % lbt;
}
}
}
void juanji(int *a, int *b, int *c, int n, int m, int top) {
static int fa[maxn], fb[maxn];
int k = 0;
while ((1 << k) < n + m + 1) k++;
ntt(a, k, fa, 0);
ntt(b, k, fb, 0);
for (int i = 0; i < (1 << k); i++) fa[i] = (long long)fa[i] * fb[i] % lbt;
ntt(fa, k, c, 1);
for (int i = top + 1; i < (1 << k); i++) c[i] = 0;
}
void trans(int *a, int n, int d, int *ans) {
static int A[maxn], B[maxn];
int k = 0;
while ((1 << k) < 2 * n + 1) k++;
for (int i = 0; i < (1 << k); i++) A[i] = B[i] = 0;
int powd = 1;
for (int i = 0; i <= n; i++) {
A[i] = (long long)fac[i] * powd % lbt * a[i] % lbt;
powd = (long long)powd * d % lbt;
}
for (int i = 0; i <= n; i++) {
B[i] = rfac[n - i];
}
juanji(A, B, A, n, n, 2 * n);
int rd = rev(d);
powd = 1;
for (int i = 0; i <= n; i++) {
ans[i] = (long long)rfac[i] * powd % lbt * A[n + i] % lbt;
powd = (long long)powd * rd % lbt;
}
}
void stirling(int n, int *ans) {
static int tmp[maxn];
ans[0] = 1;
int cur = 0;
for (int i = 31; i >= 0; i--) {
if (cur) {
trans(ans, cur, cur, tmp);
juanji(ans, tmp, ans, cur, cur, 2 * cur);
cur *= 2;
}
if (n >> i & 1) {
for (int j = cur + 1; j >= 1; j--) {
ans[j] = (ans[j - 1] + (long long)cur * ans[j]) % lbt;
}
ans[0] = (long long)cur * ans[0] % lbt;
cur++;
}
}
}
int comb(int n, int m) {
if (n < 0 || m < 0 || m > n) return 0;
return (long long)fac[n] * rfac[m] % lbt * rfac[n - m] % lbt;
}
int d, x, y;
void gcd(int a, int b) {
if (!b) {
d = a;
x = 1;
y = 0;
return;
}
gcd(b, a % b);
int t = x;
x = y;
y = t - a / b * y;
}
int rev(int a) {
gcd(a, lbt);
if (x < 0) x += lbt;
return x;
}
| 13 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long gen(int order) {
long long sum = 0;
while (order != 0) {
sum = (sum * 10) + 9;
order--;
}
return sum;
}
int main() {
long long l, r;
cin >> l >> r;
long long p = l, k = r;
int order = 0, sorder = 0;
while (k != 0) {
k = k / 10;
order++;
}
while (p != 0) {
p = p / 10;
sorder++;
}
if (sorder == order) {
long long max = gen(order);
if ((max - 1) / 2 <= r && l <= (max - 1) / 2) {
long long ans = ((max + 1) / 2) * ((max - 1) / 2);
cout << ans;
} else {
long long max = gen(order);
if (r < (max - 1) / 2) {
long long ans = r * (max - r);
cout << ans;
} else {
long long ans = l * (max - l);
cout << ans;
}
}
} else {
long long max = gen(order);
long long smax = gen(order - 1);
if (r >= (max - 1) / 2) {
long long ans = ((max + 1) / 2) * ((max - 1) / 2);
cout << ans;
} else {
if (l <= (smax + 1) / 2) {
if ((smax + 1) * (smax - 1) / 4 > r * (max - r)) {
cout << (smax + 1) * (smax - 1) / 4;
} else {
cout << r * (max - r);
}
} else {
if (l * (smax - l) > r * (max - r)) {
cout << l * (smax - l);
} else {
cout << r * (max - r);
}
}
}
}
}
| 7 | CPP |
def maxRepeating(str):
n = len(str)
count = 0
res = str[0]
output=[]
first=0
second=0
answer=0
cur_count = 1
for i in range(n):
if (i < n-1 and
str[i] == str[i + 1]):
cur_count += 1
else:
if cur_count > count:
res = str[i]
if i==(n-1) and str[i-1]=='0':
if str[i]=='1':
output.append(1)
elif str[i]=='1':
output.append(cur_count)
cur_count = 1
output=sorted(output,reverse=True)
if len(output)==0:
return 0
else:
for i in range(0,len(output),2):
first=first+output[i]
return first
t=int(input())
for tests in range(t):
word=input()
print(maxRepeating(word)) | 8 | PYTHON3 |
#include <algorithm>
#include <array>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define REP(i, n) for (int i = 0; (i) < int(n); ++ (i))
#define REP3(i, m, n) for (int i = (m); (i) < int(n); ++ (i))
#define REP_R(i, n) for (int i = (n) - 1; (i) >= 0; -- (i))
#define REP3R(i, m, n) for (int i = (n) - 1; (i) >= int(m); -- (i))
#define ALL(x) begin(x), end(x)
#define dump(x) cerr << #x " = " << x << endl
#define unittest_name_helper(counter) unittest_ ## counter
#define unittest_name(counter) unittest_name_helper(counter)
#define unittest __attribute__((constructor)) void unittest_name(__COUNTER__) ()
using ll = long long;
using namespace std;
const int inf = 1e9+7;
struct starry_sky_tree {
int n;
vector<int> a, b; // add, min
explicit starry_sky_tree(int a_n) {
n = pow(2, ceil(log2(a_n)));
a.resize(2 * n - 1); // fill 0, unit of add
b.resize(2 * n - 1); // fill 0, unit of add
}
void range_add(int l, int r, int z) {
range_add(0, 0, n, l, r, z);
}
void range_add(int i, int il, int ir, int l, int r, int z) {
if (l <= il and ir <= r) {
a[i] += z;
b[i] += z;
} else if (ir <= l or r <= il) {
// nop
} else {
range_add(2 * i + 1, il, (il + ir) / 2, l, r, z);
range_add(2 * i + 2, (il + ir) / 2, ir, l, r, z);
b[i] = a[i] + min(b[2 * i + 1], b[2 * i + 2]); // min
}
}
int range_min(int l, int r) {
return range_min(0, 0, n, l, r);
}
int range_min(int i, int il, int ir, int l, int r) {
if (l <= il and ir <= r) {
return b[i];
} else if (ir <= l or r <= il) {
return inf; // unit of min
} else {
return a[i] + min( // min
range_min(2 * i + 1, il, (il + ir) / 2, l, r),
range_min(2 * i + 2, (il + ir) / 2, ir, l, r));
}
}
};
template <typename UnaryPredicate>
ll binsearch(ll l, ll r, UnaryPredicate p) { // [l, r), p is monotone
assert (l < r);
-- l;
while (r - l > 1) {
ll m = (l + r) / 2;
(p(m) ? r : l) = m;
}
return r; // = min { x in [l, r) | p(x) }, or r
}
int parentoi(char c) { return c == '(' ? + 1 : - 1; }
int main() {
int n, queries; cin >> n >> queries;
string s; cin >> s;
starry_sky_tree nest(n);
starry_sky_tree lparen(n);
REP (i, n) {
nest.range_add(i, n, parentoi(s[i]));
if (s[i] == '(') lparen.range_add(i, i + 1, 1);
}
auto flip = [&](int i) {
nest.range_add(i, n, - parentoi(s[i]));
if (s[i] == '(') lparen.range_add(i, i + 1, -1);
s[i] = (s[i] == '(' ? ')' : '(');
nest.range_add(i, n, parentoi(s[i]));
if (s[i] == '(') lparen.range_add(i, i + 1, 1);
};
while (queries --) {
int q; cin >> q; -- q;
flip(q);
int result = -1;
if (s[q] == '(') {
result = binsearch(0, n, [&](int i) {
return nest.range_min(i, n) >= 2;
});
} else {
result = binsearch(0, n, [&](int i) {
return lparen.range_min(0, i + 1) == 0;
});
}
cout << result + 1 << endl;
flip(result);
}
return 0;
} | 0 | CPP |
Subsets and Splits