solution
stringlengths 10
159k
| difficulty
int64 0
3.5k
| language
stringclasses 2
values |
|---|---|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long xr, sm;
cin >> xr >> sm;
if (xr > sm || xr % 2 != sm % 2) {
cout << -1;
return 0;
}
if (xr == 0 && sm == 0) {
cout << 0;
return 0;
}
if (xr == 0) {
cout << 2 << endl;
cout << sm / 2 << " " << sm / 2 << endl;
return 0;
}
if (sm == xr) {
cout << 1 << endl;
cout << sm;
return 0;
}
long long am = (sm + xr) / 2;
long long sc = sm - am;
if (sc > 0 && (am ^ sc) == xr) {
cout << 2 << endl << am << " " << sc;
return 0;
}
cout << 3 << endl;
cout << xr << " " << (sm - xr) / 2 << " " << (sm - xr) / 2;
}
| 1,700 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, flag;
int a[100008];
while (~scanf("%d", &n)) {
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
sort(a, a + n);
flag = 0;
for (int i = 0; i < n; i++) {
if (a[i] % a[0] == 0) {
flag = 1;
} else {
flag = 0;
printf("-1\n");
break;
}
}
if (flag == 1) {
printf("%d\n", a[0]);
}
}
return 0;
}
| 1,000 | CPP |
test_cases = int(input())
for _ in range (test_cases):
n = int(input())
first_sum = pow(2, n//2) - 2 + pow(2, n)
second_sum = pow(2, n) - pow(2, n//2)
print( abs(first_sum - second_sum)) | 800 | PYTHON3 |
ans = 1
for i in range(2, min(map(int, input().split())) + 1): ans *= i
print(ans) | 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int32_t main() {
ios_base::sync_with_stdio(0);
long long n, m;
cin >> n >> m;
vector<vector<long long>> colors(n);
for (long long i = 0; i < (n); ++i) {
long long s;
cin >> s;
colors[i].resize(s);
for (long long j = 0; j < (s); ++j) {
cin >> colors[i][j];
colors[i][j]--;
}
}
vector<vector<long long>> graph(n);
for (long long i = 0; i < (n - 1); ++i) {
long long t1, t2;
cin >> t1 >> t2;
t1--;
t2--;
graph[t1].push_back(t2);
graph[t2].push_back(t1);
}
vector<long long> cols(m);
vector<bool> vis(n);
function<void(long long)> dfs = [&](long long v) {
vis[v] = true;
long long idx = 1;
long long s = colors[v].size();
vector<bool> taken(s + 1);
for (long long col : colors[v]) {
if (cols[col]) {
if (cols[col] < taken.size()) {
taken[cols[col]] = true;
}
}
}
for (long long col : colors[v]) {
if (!cols[col]) {
while (taken[idx]) {
idx++;
}
cols[col] = idx;
taken[idx] = 1;
}
}
for (long long son : graph[v]) {
if (!vis[son]) {
dfs(son);
}
}
};
dfs(0);
long long res = 1;
for (long long i = 0; i < (m); ++i) {
cols[i] = max(cols[i], 1LL);
res = max(cols[i], res);
}
cout << res << "\n";
for (long long i = 0; i < (m); ++i) {
cout << cols[i] << " ";
}
return 0;
}
| 2,200 | CPP |
# Link to problem : https://codeforces.com/problemset/problem/948/A
# There is one case in which we cannot save the sheep which is SW
# In above case sheep and wolf are adjacent to each other and we cannot place a dog in between them
# But in all other case we can place a dog at '.' places
r,c = map(int, input().split())
grid = []
for i in range(r):
l = list(input())
grid.append(l)
def check(i, j, grid):
if i > 0:
if grid[i][j] == 'S' and grid[i - 1][j] == 'W':
return 'NO'
if grid[i][j] == 'S' and grid[i - 1][j] == '.':
grid[i - 1][j] = 'D'
if i < len(grid) - 1:
if grid[i][j] == 'S' and grid[i + 1][j] == 'W':
return 'NO'
if grid[i][j] == 'S' and grid[i + 1][j] == '.':
grid[i + 1][j] = 'D'
if j > 0:
if grid[i][j] == 'S' and grid[i][j - 1] == 'W':
return 'NO'
if grid[i][j] == 'S' and grid[i][j - 1] == '.':
grid[i][j - 1] = 'D'
if j < len(grid[0]) - 1:
if grid[i][j] == 'S' and grid[i][j + 1] == 'W':
return 'NO'
if grid[i][j] == 'S' and grid[i][j + 1] == '.':
grid[i][j + 1] = 'D'
return ''
def main():
for i in range(len(grid)):
for j in range(len(grid[0])):
if check(i, j, grid) == 'NO':
print('No')
return
print('Yes')
for i in range(len(grid)):
print(''.join(grid[i]))
if __name__ == "__main__":
main() | 900 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int arr[100];
int n;
cin >> n;
int ans = 0;
int ones = 0;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
arr[i] = a;
ones += a;
}
for (int i = 0; i < n; i++) {
for (int j = i; j < n; j++) {
int temp = 0;
for (int k = 0; k < j - i + 1; k++) {
temp += arr[k + i];
}
temp = ones - 2 * temp + j - i + 1;
if (temp > ans) {
ans = temp;
}
}
}
cout << ans;
}
| 1,200 | CPP |
import io
nancy = int(input())
lima = list(map(int, input().split()))
counter = 0
last = 0
for i in range(len(lima)-1, -1, -1):
if(last == 0):
counter += 1
lima[i] = max(lima[i], last-1)
last = lima[i]
print(counter) | 1,200 | PYTHON3 |
nx_str = input()
list_str = input()
nx_data = list(map(int, nx_str.split()))
list_data = list(map(int, list_str.split()))
x = nx_data[1]
n = nx_data[0]
num = 0
for i in range(n):
if list_data[i] < x:
num = num + 1
if x in list_data:
result_num = x - num + 1
else:
result_num = x - num
print(result_num)
| 1,000 | PYTHON3 |
for case in range(int(input())):
n = int(input())
a = [int(x) for x in input().split()]
new_a = [a[0]]
for i in range(1, n-1):
if (a[i] >= a[i-1] and a[i] > a[i+1]) or (a[i] <= a[i-1] and a[i] < a[i+1]):
new_a.append(a[i])
new_a.append(a[-1])
print(len(new_a))
print(*new_a) | 1,300 | PYTHON3 |
t = int(input())
while t!=0:
n,m,k = map(int,input().split())
list1 = list(map(int,input().split()))
mini = pow(10,9)+7
u=0
list2 = list()
k = min(k,m-1)
for i in range(m-1,-1,-1):
p = max(list1[i],list1[len(list1)-1-u])
list2.append(p)
u+=1
temp = list()
for i in range(k + 1):
temp.append(min(list2[i:i + m - k]))
print(max(temp))
t-=1 | 1,600 | PYTHON3 |
def solve(n):
ans = 0
temp = n
while n != 0:
bills = [100, 20, 10, 5, 1]
for b in bills:
if n >= b:
n %= b
ans += (temp - n) / b
temp = n
break
return int(ans)
n = int(input())
print(solve(n))
| 800 | PYTHON3 |
n, k = map(int, input().split())
s = input().strip('.#')
l = len(s) - 1
print('NO' if l % k or '#' in s[0:l:k] else 'YES') | 800 | PYTHON3 |
a = [int(i) for i in input().split()]
s = input()
r = 0
for c in s:
r+=a[int(c)-1]
print(r)
| 800 | PYTHON3 |
import sys
inp = sys.stdin.readline
ans = ""
for _ in range(int(inp())):
a, b, n, s = map(int, inp().split())
a_needed = (s//n)
if a >= a_needed:
ans += ("YES" if b >= (s%n) else "NO")+"\n"
else:
ans += ("YES" if b >= (s - a*n) else "NO")+"\n"
print(ans) | 1,000 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 9;
int n, ans1 = -1, ans2, par[N];
pair<int, int> m, p[N], tree[N * 2];
vector<pair<int, int> > v[N];
set<pair<int, int> > s;
pair<int, int> query(int l, int r) {
pair<int, int> res;
res.first = res.second = -1;
r++;
for (l += n, r += n; l < r; l >>= 1, r >>= 1) {
if (l & 1) {
if (tree[l].first > res.first) res = tree[l];
l++;
}
if (r & 1) {
if (tree[--r].first > res.first) res = tree[r];
}
}
return res;
}
void make_tree() {
for (int i = n - 1; i >= 1; i--) {
pair<int, int> p1 = tree[i * 2], p2 = tree[i * 2 + 1];
if (p1.first > p2.first)
tree[i] = p1;
else
tree[i] = p2;
}
}
int main() {
cin >> n;
for (long long i = 0; i < n; i++) {
scanf("%d%d", &p[i].first, &p[i].second);
;
p[i].first--, p[i].second--;
v[p[i].first].push_back(make_pair(p[i].second, i));
}
for (long long i = 0; i < n; i++) {
for (long long j = 0; j < v[i].size(); j++) s.insert(v[i][j]);
pair<int, int> u = *s.begin();
s.erase(u);
tree[i + n] = u;
par[u.second] = i;
}
make_tree();
for (long long i = 0; i < n; i++) {
m = query(p[i].first, par[i] - 1);
if (m.first >= par[i]) ans1 = i, ans2 = m.second;
}
if (ans1 == -1)
cout << "YES" << endl;
else
cout << "NO" << endl;
for (long long i = 0; i < n; i++) cout << par[i] + 1 << " ";
cout << endl;
if (ans1 != -1) {
swap(par[ans1], par[ans2]);
for (long long i = 0; i < n; i++) cout << par[i] + 1 << " ";
}
}
| 2,600 | CPP |
a = input()
a1 = int(a[0:2])*60 + int(a[3:])
b = input()
b1 = int(b[0:2])*60 + int(b[3:])
mid = (a1 + b1) >> 1
a2 = mid / 60
b2 = mid % 60
if a2 < 10:
str1 = '0' + str(int(a2)) + ':'
else:
str1 = str(int(a2)) + ':'
if b2 < 10:
str2 = '0' + str(int(b2))
else:
str2 = str(int(b2))
str = str1 + str2
print(str)
| 1,000 | PYTHON3 |
def test(l):
l1=[]
l2=[]
for i in range(len(l)):
if l[i]<0 and l[i] not in l2:
l2.append(l[i])
elif l[i]>0 and l[i] not in l1:
l1.append(l[i])
if len(l1)==0 or len(l2)==0:
return False
for x in l1:
if (x*(-1)) in l2:
return True
for x in l2:
if (x*(-1)) in l1:
return True
return False
n,m=input().strip().split(' ')
n,m=(int(n),int(m))
for t_0 in range(m):
list1=list(map(int,input().strip().split(' ')))
if test(list1[1:])==False:
print("YES")
exit()
print("NO") | 1,300 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
template <class T>
T ABS(T x) {
return x < 0 ? -x : x;
}
long long read() {
long long s = 0, w = 1;
char ch;
while ((ch = getchar()) < '0' || ch > '9')
if (ch == '-') w = -1;
while (ch >= '0' && ch <= '9')
s = (s << 3) + (s << 1) + (ch ^ 48), ch = getchar();
return s * w;
}
const long long maxn = 1e6 + 10;
string S[maxn], w;
char tmp[maxn];
long long v[maxn], dx[] = {0, 0, +1, -1}, dy[] = {+1, -1, 0, 0}, n, m;
bool onl(long long x, long long y) {
long long tot = 0;
for (long long i = 0; i < 4; i++) {
long long nx = x + dx[i], ny = y + dy[i];
if (nx && ny && nx <= n && ny <= m && S[nx][ny] != '#') {
if (!v[(nx - 1) * m + ny]) ++tot;
}
}
if (tot > 1) return 0;
return 1;
}
void bfs(long long X, long long Y) {
v[(X - 1) * m + Y] = 1;
queue<pair<long long, long long> > Q;
Q.push(make_pair(X, Y));
while (!Q.empty()) {
long long x = Q.front().first, y = Q.front().second;
Q.pop();
for (long long i = 0; i < 4; i++) {
long long nx = x + dx[i], ny = y + dy[i];
if (nx && ny && nx <= n && ny <= m && !v[(nx - 1) * m + ny] &&
S[nx][ny] != '#' && onl(nx, ny))
v[(nx - 1) * m + ny] = 1, Q.push(make_pair(nx, ny));
}
}
}
signed main() {
long long csa = read();
while (csa--) {
n = read(), m = read();
for (long long i = 1; i <= n; i++) scanf("%s", tmp), S[i] = " " + (w = tmp);
for (long long i = 1; i <= n; i++)
for (long long j = 1; j <= m; j++)
if (S[i][j] == 'L') bfs(i, j);
for (long long i = 1; i <= n; i++, cout << '\n')
for (long long j = 1; j <= m; j++)
if (S[i][j] == 'L')
cout << 'L';
else if (v[(i - 1) * m + j])
cout << '+';
else
cout << S[i][j];
for (long long i = 1; i <= n * m; i++) v[i] = 0;
}
return 0;
}
| 2,000 | CPP |
n=int(input())
if (n%2) == 0:
if n == 2:
print("NO")
else:
print("YES")
else:
print("NO")
| 800 | PYTHON3 |
t = int(input())
ans = [False for i in range(t)]
for i in range(t):
n = int(input())
a = [int(j) for j in input().split()]
a1 = [[0, -1] for j in range(5001)]
for j in range(n):
a1[a[j]][0] += 1
if a1[a[j]][1] == -1: a1[a[j]][1] = j
if a1[a[j]][0] > 1:
if j - a1[a[j]][1] > 1:
ans[i] = True
break
for i in ans:
if i == True: print('YES')
else: print('NO') | 1,100 | PYTHON3 |
#Problem E - Special Elements
a = int(input())
for _ in range(a):
b= int(input())
li = [0]*(b+1)
li1= list(map(int, input().split()))
for c in li1:
li[c] += 1
ans = 0
for i in range(b):
sum1= 0
for j in range(i,b):
sum1 += li1[j]
if i == j:
continue
elif sum1 <= b:
ans += li[sum1]
li[sum1] = 0
elif sum1 > b:
break
print(ans)
| 1,500 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e9 + 10, MAX = 2e5 + 1e4, MOD = 1e9 + 7, MAXL = 25;
void OUT(long double o, int x) {
cout << fixed << setprecision(x) << o;
return;
}
int a[MAX], cnt[20], cnt1[20], cnt2[20];
vector<pair<pair<int, int>, pair<int, int> > > v;
pair<int, int> f(pair<pair<int, int>, pair<int, int> > x,
pair<pair<int, int>, pair<int, int> > y) {
int z = 0, w = 0;
if (x.first.first == y.first.first)
z++;
else
cnt1[x.first.first]++, cnt2[y.first.first]++;
if (x.first.second == y.first.second)
z++;
else
cnt1[x.first.second]++, cnt2[y.first.second]++;
if (x.second.first == y.second.first)
z++;
else
cnt1[x.second.first]++, cnt2[y.second.first]++;
if (x.second.second == y.second.second)
z++;
else
cnt1[x.second.second]++, cnt2[y.second.second]++;
w += min(cnt1[x.first.first], cnt2[x.first.first]);
cnt1[x.first.first] = 0;
w += min(cnt1[x.first.second], cnt2[x.first.second]);
cnt1[x.first.second] = 0;
w += min(cnt1[x.second.first], cnt2[x.second.first]);
cnt1[x.second.first] = 0;
w += min(cnt1[x.second.second], cnt2[x.second.second]);
cnt1[x.second.second] = 0;
cnt2[y.first.first] = 0;
cnt2[y.first.second] = 0;
cnt2[y.second.first] = 0;
cnt2[y.second.second] = 0;
return {z, w};
}
int main() {
for (int i = 0; i <= 9; i++) {
cnt[i]++;
for (int j = 0; j <= 9; j++) {
cnt[j]++;
for (int k = 0; k <= 9; k++) {
cnt[k]++;
for (int h = 0; h <= 9; h++) {
cnt[h]++;
if ((cnt[i] == 1 && cnt[j] == 1) && (cnt[k] == 1 && cnt[h] == 1))
v.push_back({{i, j}, {k, h}});
cnt[h]--;
}
cnt[k]--;
}
cnt[j]--;
}
cnt[i]--;
}
while (v.size() > 1) {
pair<int, int> ma = {0, 0};
for (int i = 0; i < min(int(v.size()), 4); i++) {
int mi = INF;
for (int j = 0; j <= 4; j++) {
for (int k = 0; j + k <= 4; k++) {
int x = 0;
pair<int, int> p = {j, k};
for (pair<pair<int, int>, pair<int, int> > u : v) {
if (f(v[i], u) != p) x++;
}
mi = min(x, mi);
}
}
ma = max(ma, {mi, i});
}
cout << v[ma.second].first.first << v[ma.second].first.second
<< v[ma.second].second.first << v[ma.second].second.second << endl;
int x, y;
cin >> x >> y;
if (x == 4 && y == 0) return 0;
vector<pair<pair<int, int>, pair<int, int> > > q;
pair<int, int> p = {x, y};
for (pair<pair<int, int>, pair<int, int> > u : v) {
if (f(v[ma.second], u) == p) q.push_back(u);
}
v.clear();
for (pair<pair<int, int>, pair<int, int> > u : q) v.push_back(u);
}
cout << v[0].first.first << v[0].first.second << v[0].second.first
<< v[0].second.second;
return 0;
}
| 1,600 | CPP |
#include <bits/stdc++.h>
using namespace std;
struct node {
int v;
int id;
} e[(int)1e5 + 1000];
bool cmp(node a, node b) { return a.v < b.v; }
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
scanf("%d", &e[i].v);
e[i].id = i;
}
sort(e + 1, e + 1 + n, cmp);
vector<int> V1, V2;
long long sum1 = 0, sum2 = 0;
for (int i = 1; i <= n; i++) {
if (sum1 <= sum2) {
V1.push_back(e[i].id);
sum1 += e[i].v;
} else {
V2.push_back(e[i].id);
sum2 += e[i].v;
}
}
printf("%d\n", V1.size());
for (int i = 0; i <= V1.size() - 1; i++) {
printf("%d%c", V1[i], i == V1.size() - 1 ? '\n' : ' ');
}
printf("%d\n", V2.size());
for (int i = 0; i <= V2.size() - 1; i++) {
printf("%d%c", V2[i], i == V2.size() - 1 ? '\n' : ' ');
}
}
| 1,500 | CPP |
import math
for ii in range(int(input())):
n,m,k=map(int,input().split())
e=n//k
if e>=m:
print(m)
else:
x= math.ceil((m-e)/(k-1))
print(e-x) | 1,000 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll; //int:2*10**9
typedef long double ld;
typedef pair<ll,ll> P;
#define REP(i,n) for(ll i = 0; i<(ll)(n); i++)
#define FOR(i,a,b) for(ll i=(a);i<=(b);i++)
#define FORD(i,a,b) for(ll i=(a);i>=(b);i--)
#define pb push_back
#define MOD 1000000007 //998244353
#define PI 3.141592653
#define INF 100000000000000 //14
//cin.tie(0);cout.tie(0);ios::sync_with_stdio(false);
void solve() {
ll n; cin >> n;
string s, t; cin >> s >> t;
ll ocnt = 0; ll zcnt = 0;
vector<ll> lines = {0}; ll last = 0;
REP(i,n) {
if (s[i]=='1') ocnt++;
else zcnt++;
if (ocnt==zcnt) {
bool jud = true;
ll checker = 0;
FOR(j,last,i) {
if (j==last) {
if (s[last]==t[last]) checker=0;
else checker=1;
}
else {
if (checker && s[j]==t[j]) jud = false;
else if (checker==0 && s[j]!=t[j]) jud = false;
}
}
if (jud==false) {
cout << "NO" << endl;
return;
}
last = i+1;
}
}
FOR(i,last,n-1) {
if (s[i]!=t[i]) {
cout << "NO" << endl;
return;
}
}
cout << "YES" << endl;
return;
}
int main(){
ll t; cin >> t;
REP(i,t) solve();
return 0;
} | 1,200 | CPP |
n=int(input())
u=[int(i) for i in input().split()]
cnt=[0 for i in range(10)]
ans=0
for i in range(n):
cnt[u[i]-1]+=1
cm=max(cnt)
c0=cnt.count(0)
gen=cm-1
if (cnt.count(gen))==(10-c0-1):
ans=i+1
else:
temp=[]
for x in cnt:
if x!=0:
temp.append(x)
if len(set(temp))==2 and temp.count(1)==1:
ans=i+1
elif len(set(temp))==1 and temp.count(1)>0:
ans=i+1
print(ans) | 1,500 | PYTHON3 |
tc=int(input())
for _ in range(tc):
a=input()
setp=set()
x=y=ans=nx=ny=0
for c in a:
if c=='N':
nx=x+1
if c=='S':
nx=x-1
if c=='E':
ny=y+1
if c=='W':
ny=y-1
if (x,y,nx,ny) in setp or (nx,ny,x,y) in setp:
ans+=1
else:
ans+=5
setp.add((x,y,nx,ny))
x=nx
y=ny
print(ans) | 1,400 | PYTHON3 |
n=int(input())
l=list(map(int,input().split()))
ma=max(l)
mi=min(l)
pma=l.index(ma)
rma=pma+1
l2=l.copy()
l2.reverse()
pmi=l2.index(mi)
rmi=len(l)-pmi
s=pma+pmi
if rmi<rma:
s-=1
print(s) | 800 | PYTHON3 |
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:128777216")
using namespace std;
bool d[2][200000];
char a[100010];
char b[100010];
struct Pos {
int id;
int pos;
int t;
void init(int id, int pos, int t) {
this->id = id;
this->pos = pos;
this->t = t;
d[id][pos] = 1;
}
} st[300000];
int main() {
int n, k;
scanf("%d %d", &n, &k);
scanf("%s", a);
scanf("%s", b);
for (int i = 0; i < n; i++) {
if (a[i] == 'X') {
d[0][i] = 1;
}
if (b[i] == 'X') {
d[1][i] = 1;
}
}
st[0].init(0, 0, 0);
for (int d = 0, u = 1; d < u; d++) {
int id = st[d].id, pos = st[d].pos, t = st[d].t + 1;
if (pos < st[d].t) continue;
if (pos + k >= n) {
printf("YES");
return 0;
}
if (pos > 0 && !::d[id][pos - 1]) {
st[u++].init(id, pos - 1, t);
}
if (!::d[id][pos + 1]) {
st[u++].init(id, pos + 1, t);
}
if (!::d[id ^ 1][pos + k]) {
st[u++].init(id ^ 1, pos + k, t);
}
}
printf("NO");
return 0;
}
| 1,400 | CPP |
from collections import *
n = int(input())
a = list(map(int,input().split()))
o,e = 0,0
for i in a:
if(i%2 == 0):
e += 1
else:
o += 1
a.sort(reverse = True)
i = 0
ex,ox = min(o,e),min(o,e)
if(o > ox):
ox += 1
if(e > ex):
ex += 1
while(i < n and (ox or ex)):
if(ex and a[i]%2 == 0):
a[i] = 0
ex -= 1
if(ox and a[i]%2 == 1):
a[i] = 0
ox -= 1
i += 1
print(sum(a)) | 900 | PYTHON3 |
import heapq
n = int(input())
d = list(map(int,input().split()))
pq = [-d[0]]
heapq.heapify(pq)
ans = 0
for i in range(1,n):
temp = i - d[i]
heapq.heappush(pq,temp)
if heapq.nsmallest(1,pq)[0] < temp:
ans += temp - heapq.nsmallest(1,pq)[0]
heapq.heappushpop(pq,temp)
print(ans)
| 2,300 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10, mod = 1e9 + 7;
int a[maxn], b[maxn], c[maxn], vis[maxn], cur[maxn], x, d, n;
int getNextX() {
x = (1ll * x * 37 + 10007) % 1000000007;
return x;
}
void initAB() {
int i;
for (i = 0; i < n; i = i + 1) {
a[i] = i + 1;
}
for (i = 0; i < n; i = i + 1) {
swap(a[i], a[getNextX() % (i + 1)]);
}
for (i = 0; i < n; i = i + 1) {
if (i < d)
b[i] = 1;
else
b[i] = 0;
}
for (i = 0; i < n; i = i + 1) {
swap(b[i], b[getNextX() % (i + 1)]);
}
}
struct node {
int v, id;
node(int x, int y) { v = x, id = y; }
bool operator<(const node& t) const { return v < t.v; }
};
priority_queue<node> q;
int main() {
scanf("%d%d%d", &n, &d, &x);
initAB();
int cnt = 0;
for (int i = 0; i < n; i++)
if (b[i]) cur[cnt++] = i;
for (int i = 0; i < n; i++) q.push(node(a[i], i));
for (int i = 0; i < min(70, n); i++) {
node e = q.top();
q.pop();
for (int j = 0; j < cnt; j++)
if (e.id + cur[j] < n && !vis[e.id + cur[j]]) {
vis[e.id + cur[j]] = 1;
c[e.id + cur[j]] = e.v;
}
}
for (int i = 0; i < n; i++)
if (!vis[i]) {
for (int j = 0; j < cnt && cur[j] <= i; j++)
c[i] = max(c[i], a[i - cur[j]]);
}
for (int i = 0; i < n; i++) printf("%d\n", c[i]);
}
| 2,300 | CPP |
t = int(input())
for i in range(t):
n = int(input())
A = sorted(list(map(int, input().split())))
for i in range(n//2):
print(A[i+1],A[0]) | 1,000 | PYTHON3 |
n = int(input())
a = list(map(int, input().split()))
lastTime = dict()
rooms = set(a)
for i in range(n):
lastTime[a[i]] = i
m = rooms.pop()
for room in rooms:
if lastTime[room] < lastTime[m]:
m = room
print(m)
| 1,000 | PYTHON3 |
def findIndex(num, li, lo, hi):
while lo<hi:
mid = (lo + hi)>>1
if num < li[mid]: hi = mid
else : lo = mid + 1
return hi
# li = [1,2,3,5,6,7,8,9]
# num = 10
# print(findIndex(num,li, 0, len(li)-1))
n = int(input())
prices = sorted(map(int, input().split()))
# print(prices)
q = int(input())
for _ in range(q):
money = int(input())
options = findIndex(money, prices, 0, len(prices))
print(options)
| 1,100 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int con[1048578], lg[1048578], f[1048578];
long long a[1048578], sum[1048578];
bool check(int s) {
for (int t = (s - 1) & s; (t << 1) >= s && t; t = (t - 1) & s) {
long long tmp = abs(sum[t] - sum[s ^ t]);
if (tmp < con[s] && ((con[s] - tmp) & 1)) return 1;
}
return 0;
}
int main() {
int n, i, s, t, all;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%lld", &a[i]);
if (a[i] == 0) i--, n--;
}
all = (1 << n) - 1;
lg[0] = -1;
for (i = 1; i <= all; i++) {
con[i] = con[i >> 1] + (i & 1);
lg[i] = lg[i >> 1] + 1;
}
for (i = 1; i <= all; i++) sum[i] = sum[i - (i & -i)] + a[lg[i & -i]];
for (s = 1; s <= all; s++)
if (!f[s] && check(s)) {
int tmp = all ^ s;
f[s] = 1;
for (t = tmp; t; t = (t - 1) & tmp) f[s | t] = max(f[s | t], f[t] + 1);
}
printf("%d", n - f[all]);
}
| 3,100 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 5010, M = 50010, lpw = 1e9 + 7;
inline int max(int x, int y) { return x > y ? x : y; }
inline int min(int x, int y) { return x < y ? x : y; }
inline void swap(int &x, int &y) { x ^= y ^= x ^= y; }
int n, m, ans, f[N][N];
char s[N], t[N];
int main() {
scanf("%s%s", s + 1, t + 1);
n = strlen(s + 1);
m = strlen(t + 1);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) {
f[i][j] = f[i][j - 1];
if (s[i] == t[j]) f[i][j] = (f[i][j] + f[i - 1][j - 1] + 1) % lpw;
}
for (int i = 1; i <= n; i++) ans = (ans + f[i][m]) % lpw;
printf("%d\n", ans);
return 0;
}
| 1,700 | CPP |
#include <bits/stdc++.h>
using namespace std;
string S;
int l, r, ssiz, chuluk, pos;
int chk[26];
int main(void) {
cin >> S;
ssiz = S.size();
for (; l < ssiz && !chuluk;) {
while (r - l + 1 <= 26 && r < ssiz) {
if (S[r] == '?')
pos++;
else
chk[S[r] - 65]++;
r++;
}
if (r - l + 1 <= 26) break;
vector<char> isnt;
int cont = 0;
for (int i = 0; i < 26 && !cont; i++) {
if (chk[i] > 1) {
cont = 1;
}
if (!chk[i]) isnt.push_back(i + 65);
}
if (!cont) {
if (isnt.size() > pos)
cont = 1;
else {
for (int i = l; i < r; i++)
if (S[i] == '?') S[i] = isnt[--pos];
for (int i = 0; i < ssiz; i++) {
if (S[i] == '?')
printf("A");
else
printf("%c", S[i]);
}
chuluk = 1;
}
}
if (cont) {
S[l] == '?' ? pos-- : chk[S[l] - 65]--;
l++;
continue;
}
}
if (!chuluk) printf("-1");
}
| 1,300 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
priority_queue<int> q[N];
int fa[N];
int n;
void init() {
for (int i = 0; i <= n; i++) {
fa[i] = i;
while (!q[i].empty()) q[i].pop();
}
}
int find(int x) {
if (fa[x] != x) fa[x] = find(fa[x]);
return fa[x];
}
void merge(int a, int b) {
a = find(a);
b = find(b);
if (a != b) fa[a] = fa[b];
}
int tar[N];
int main() {
int m;
while (scanf("%d%d", &n, &m) == 2) {
init();
memset(tar, 0, sizeof(tar));
for (int i = 1; i <= n; i++) scanf("%d", tar + i);
for (int i = 0; i < m; i++) {
int u, v;
scanf("%d%d", &u, &v);
merge(u, v);
}
for (int i = 1; i <= n; i++) q[find(i)].push(tar[i]);
for (int i = 1; i <= n; i++) {
int temp = q[find(i)].top();
q[find(i)].pop();
printf("%d", temp);
i == n ? printf("\n") : printf(" ");
}
}
return 0;
}
| 1,700 | CPP |
#include <bits/stdc++.h>
using namespace std;
void solve() {
int t, n, m;
cin >> t;
for (int i = 0; i < t; i++) {
cin >> n >> m;
if (n == 1)
cout << 0 << '\n';
else if (n == 2)
cout << m << '\n';
else
cout << 1LL * m * 2 << '\n';
}
}
int main() {
ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
solve();
return 0;
}
| 800 | CPP |
#include <bits/stdc++.h>
using namespace std;
int dx[] = {1, 1, 0, -1, -1, -1, 0, 1};
int dy[] = {0, 1, 1, 1, 0, -1, -1, -1};
template <typename T>
void printV(vector<T> v) {
for (int i = 0; i < v.size(); i++) {
cout << v[i] << " ";
}
cout << endl;
}
int main() {
ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
int arr[26]{};
int x = n;
while (n--) {
string s;
cin >> s;
for (int i = 0; i < s.length(); i++) {
arr[s[i] - 'a']++;
}
}
int isPossible = 1;
for (int i = 0; i < 26; i++) {
if ((arr[i] % x) != 0) {
isPossible = 0;
break;
}
}
if (isPossible) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
return 0;
}
| 800 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, d = 0;
pair<int, int> a[110];
void nhap() {
cin >> n;
for (int i = 1; i <= n; i++) cin >> a[i].first >> a[i].second;
}
int main() {
nhap();
for (int i = 1; i <= n; i++)
if (a[i].second - a[i].first >= 2) d++;
cout << d;
return 0;
}
| 800 | CPP |
import math
t = int(input())
for _ in range(t):
n = int(input())
print(math.floor(n/2)+1) | 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int a[111111], n;
int gcd(int a, int b) {
if (b == 0) return a;
return gcd(b, a % b);
}
int main() {
cin >> n;
scanf("%d", &a[1]);
int x = a[1];
for (int i = 2; i <= n; i++) {
scanf("%d", &a[i]);
x = gcd(x, a[i]);
}
if (x > 1) {
cout << "YES\n"
<< "0" << endl;
return 0;
}
int sum = 0;
for (int i = 1; i <= n; i++) {
if (a[i] % 2 == 1 && a[i + 1] % 2 == 1) {
int t1 = a[i] - a[i + 1];
int t2 = a[i] + a[i + 1];
a[i] = t1;
a[i + 1] = t2;
sum += 1;
}
}
for (int i = 1; i <= n; i++)
if (a[i] % 2 == 1) {
if (i == 1) {
int t1 = -2 * a[i + 1];
int t2 = 2 * a[i];
a[i] = t1;
a[i + 1] = t2;
sum += 2;
} else {
int t1 = -2 * a[i];
int t2 = 2 * a[i - 1];
a[i - 1] = t1;
a[i] = t2;
sum += 2;
}
}
cout << "YES\n" << sum << endl;
return 0;
}
| 1,700 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <class T>
void re(T& x) {
cin >> x;
}
template <class T1, class T2>
void re(pair<T1, T2>& x) {
re(x.first);
re(x.second);
}
template <class T>
void re(vector<T>& x) {
for (long i = 0; i < x.size(); i++) {
re(x[i]);
}
}
template <class T>
void re(deque<T>& x) {
for (long i = 0; i < x.size(); i++) {
re(x[i]);
}
}
template <class T1, class T2>
pair<T1, T2> mp(T1& x, T2& z) {
return make_pair(x, z);
}
template <class T>
T cross(complex<T> x, complex<T> z) {
return (conj(x) * z).imag();
}
template <class T>
T dot(complex<T> x, complex<T> z) {
return (conj(x) * z).real();
}
vector<long long> x, z;
long long right1(long l, long r, long long v) {
if (x[l] > v) {
return -1;
}
if (l == r) {
return x[l];
}
long long z = r - l;
while (z & (z - 1)) {
z = z & (z - 1);
}
while (z) {
if (l + z <= r && x[l + z] <= v) {
l += z;
}
z /= 2;
}
return x[l];
}
long long right2(long l, long r, long long v) {
if (z[l] > v) {
return -1;
}
if (l == r) {
return z[l];
}
long long x = r - l;
while (x & (x - 1)) {
x = x & (x - 1);
}
while (x) {
if (l + x <= r && z[l + x] <= v) {
l += x;
}
x /= 2;
}
return z[l];
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long a, b, c, s, l, r, ans = 1e18;
cin >> a >> b;
c = a + b;
s = sqrt(a);
for (long long i = 1; i <= s; i++) {
if (a % i == 0) {
x.push_back(i);
}
}
s = sqrt(b);
for (long long i = 1; i <= s; i++) {
if (b % i == 0) {
z.push_back(i);
}
}
s = sqrt(c);
for (long long i = 1; i <= s; i++) {
if (c % i == 0) {
l = right1(0, x.size() - 1, i);
r = right2(0, z.size() - 1, i);
if (l != -1 && min(l, a / l) <= min(i, c / i) &&
max(l, a / l) <= max(i, c / i)) {
ans = min(ans, (i * 2) + ((c / i) * 2));
}
if (r != -1 && min(r, b / r) <= min(i, c / i) &&
max(r, b / r) <= max(i, c / i)) {
ans = min(ans, (i * 2) + ((c / i) * 2));
}
}
}
cout << ans << endl;
return 0;
}
| 2,000 | CPP |
s=input()
w="hello"
index=0
flag=0
for i in range(len(s)):
if (s[i]==w[index]):
index+=1
if index==5:
flag=1
break
if flag==1:
print("YES")
else:
print("NO")
| 1,000 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base ::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long n, j, i, k, a[311111];
cin >> n;
for (i = 0; i < n; i++) cin >> a[i];
sort(a, a + n);
i = 0;
j = n - 1;
long long sum = 0, cnt = 0;
while (i < j) {
k = a[i++] + a[j--];
sum += (k * k);
}
cout << sum;
}
| 900 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int64_t mod = 1e9 + 7;
vector<int64_t> keys;
vector<vector<int64_t>> g;
map<int64_t, vector<pair<int64_t, int64_t>>> store;
vector<int64_t> pow2((int64_t)5e5 + 1);
void dfs(int64_t v, map<int64_t, bool> &visited) {
visited[v] = true;
for (auto el : g[v]) {
if (!visited.count(el)) {
dfs(el, visited);
}
}
}
signed main() {
pow2[0] = 1;
for (int64_t i = 1; i < 5e5 + 1; i++) {
pow2[i] = pow2[i - 1] * 2 % mod;
}
ios::sync_with_stdio(false);
int64_t n, m;
int64_t k;
cin >> n >> m;
cin >> k;
keys.resize(n);
g.resize(n);
for (auto &el : keys) {
cin >> el;
}
for (int64_t i = 0; i < m; ++i) {
int64_t a, b;
cin >> a >> b;
a--, b--;
store[(keys[a] ^ keys[b])].push_back({a, b});
}
int64_t ans = (pow2[k] - store.size()) * pow2[n] % mod;
for (auto forbiddenKey : store) {
set<int64_t> vertices;
for (auto vertice : forbiddenKey.second) {
vertices.insert(vertice.first);
vertices.insert(vertice.second);
g[vertice.first].push_back(vertice.second);
g[vertice.second].push_back(vertice.first);
}
int64_t countCC = 0;
map<int64_t, bool> visited;
for (auto vertice : vertices) {
if (!visited.count(vertice)) {
dfs(vertice, visited);
countCC++;
}
}
ans += pow2[n - vertices.size() + countCC];
ans %= mod;
for (auto vertice : vertices) {
g[vertice].clear();
}
}
cout << ans;
return 0;
}
| 2,200 | CPP |
#include <bits/stdc++.h>
long long read() {
long long x = 0, f = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-') f = -1;
c = getchar();
}
while (c >= '0' && c <= '9') {
x = x * 10 + c - '0';
c = getchar();
}
return x * f;
}
using namespace std;
const long long maxn = 1e5 + 7;
const double eps = 1e-10;
const long long mod = 1e9 + 7;
long long n;
long long totA = 0, totB = 0;
long long casA[maxn * 2], casB[maxn * 2];
long long tot = 0;
struct Node {
long long set, score;
};
Node node[maxn];
bool cmp(Node a, Node b) {
if (a.set < b.set) return 1;
if (a.set == b.set && a.score < b.score) return 1;
return 0;
}
int32_t main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
cin >> n;
for (long long i = 1; i < 2 * maxn; i++)
casA[i] = casB[i] = 9223372036854775807;
bool flagA = 0, flagB = 0;
for (long long i = 1; i <= n; i++) {
long long x;
cin >> x;
if (x == 1)
casA[++totA] = i;
else
casB[++totB] = i;
if (i == n) {
if (x == 1)
flagA = 1;
else
flagB = 1;
}
}
for (long long i = n; i >= 1; i--) {
long long winA = 0, winB = 0, tarA = 0, tarB = 0;
long long now = 1;
bool flag = 1;
while (now <= n) {
if (casA[tarA + i] == 9223372036854775807 &&
casB[tarB + i] == 9223372036854775807) {
flag = 0;
break;
}
if (casA[tarA + i] < casB[tarB + i]) {
winA++;
tarA += i;
tarB = casA[tarA] - tarA;
now = casA[tarA] + 1;
} else {
winB++;
tarB += i;
tarA = casB[tarB] - tarB;
now = casB[tarB] + 1;
}
}
if (winA == winB) flag = 0;
if (winA > winB && flagB) flag = 0;
if (winA < winB && flagA) flag = 0;
if (flag) {
node[++tot].set = max(winA, winB);
node[tot].score = i;
}
}
sort(node, node + tot, cmp);
cout << tot << "\n";
if (tot) {
for (long long i = 1; i <= tot; i++)
cout << node[i].set << ' ' << node[i].score << "\n";
}
}
| 1,900 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, m, hno = 1, time = 0;
cin >> n >> m;
for (long long int i = 0; i < m; i++) {
long long int inp;
cin >> inp;
if (inp < hno) {
time += (n + 1 - hno) + (inp - 1);
} else
time += (inp - hno);
hno = inp;
}
cout << time;
return 0;
}
| 1,000 | CPP |
n,m,a=map(int,input().split(' '))
x=n//a
y=m//a
p=f=g=0
if n%a!=0:
p=1
g=y
if m%a!=0:
if p!=0:
f=x+1
else:
f=x
k=x*y+g+f
print(k)
| 1,000 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = (int)1e5 + 17;
const int MX = (int)1e6 + 17;
const int MOD = (int)1e9 + 7;
const long long oo = LLONG_MAX;
const int INF = INT_MAX;
const long double Pi = 3.14159265358979323846264338327950288419716939937510;
const int di[4] = {-1, 0, 1, 0};
const int dj[4] = {0, 1, 0, -1};
inline long long IN() {
long long x = 0, ch = getchar(), f = 1;
while (!isdigit(ch) && (ch != '-') && (ch != EOF)) ch = getchar();
if (ch == '-') {
f = -1;
ch = getchar();
}
while (isdigit(ch)) {
x = (x << 1) + (x << 3) + ch - '0';
ch = getchar();
}
return x * f;
}
inline void OUT(long long x) {
if (x < 0) putchar('-'), x = -x;
if (x >= 10)
OUT(x / 10), putchar(x % 10 + '0');
else
putchar(x + '0');
}
void IOI2017() {
freopen(
"partition"
".in",
"r", stdin);
freopen(
"partition"
".out",
"w", stdout);
}
string s;
int dp2[N], dp3[N];
set<string> ans;
int main() {
cin >> s;
dp2[(int)s.size()] = dp3[(int)s.size()] = 1;
for (int i = (int)s.size() - 2; i >= 5; i--) {
if (dp2[i + 2] && s.substr(i, 2) != s.substr(i + 2, 2) || dp3[i + 2])
dp2[i] = 1, ans.insert(s.substr(i, 2));
if (dp3[i + 3] && s.substr(i, 3) != s.substr(i + 3, 3) || dp2[i + 3])
dp3[i] = 1, ans.insert(s.substr(i, 3));
}
cout << (int)ans.size() << endl;
for (auto i : ans) cout << i << endl;
return 0;
}
| 1,800 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1005, MAXD = 1e4 + 10;
int n, dp[MAXN][MAXD];
long long sum[MAXN][MAXD];
vector<long long> d, p;
long long k, a[MAXN];
int prv[MAXN][MAXD];
long long GCD(long long a, long long b) { return !a ? b : GCD(b % a, a); }
int getind(long long val) {
return lower_bound(d.begin(), d.end(), val) - d.begin();
}
int main() {
cin >> n >> k;
if (k == 1) {
int ind = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] < a[ind]) ind = i;
}
cout << 1 << '\n' << ind + 1;
return 0;
}
for (long long i = 1; i * i <= k; i++) {
if (k % i == 0) {
d.push_back(i);
if (k / i != i) d.push_back(k / i);
}
}
long long tmp = k;
for (long long i = 2; i * i <= tmp; i++) {
if (tmp % i == 0) p.push_back(i);
while (tmp % i == 0) tmp /= i;
}
if (tmp != 1) p.push_back(tmp);
sort(d.begin(), d.end());
fill_n(dp[0], MAXD, 1e9);
dp[0][0] = 0;
for (int i = 1; i <= n; i++) cin >> a[i];
for (int i = 1; i <= n; i++) {
long long g = GCD(a[i], k);
for (int j = 0; j < d.size(); j++)
dp[i][j] = dp[i - 1][j], sum[i][j] = sum[i - 1][j];
for (int j = 0; j < d.size(); j++) {
int t = getind(GCD(k / g, d[j]) * g);
if (dp[i][t] > dp[i - 1][j] + 1)
prv[i][t] = j + 1, dp[i][t] = dp[i - 1][j] + 1,
sum[i][t] = sum[i - 1][j] + a[i];
if (dp[i][t] == dp[i - 1][j] + 1 && sum[i - 1][j] + a[i] < sum[i][t])
prv[i][t] = j + 1, sum[i][t] = sum[i - 1][j] + a[i];
}
}
if (dp[n][d.size() - 1] == 1e9)
cout << -1;
else {
cout << dp[n][d.size() - 1] << '\n';
int t = d.size() - 1, lv = n;
while (lv != 0) {
if (prv[lv][t] > 0) cout << lv << ' ', t = prv[lv][t] - 1;
lv--;
}
}
}
| 2,600 | CPP |
n=int(input())
b=input()
a=[]
p=[]
for i in range(n):
a.append(b[i])
c=0
h='I'
for j in range(n):
if j+1==n:
if a[j]==h:
c+=1
if a[j-1]!='R':
a[j]='R'
elif a[j-1]!='G':
a[j]='G'
else:
a[j]='B'
elif a[j]==h:
c+=1
if a[j-1]!='R' and a[j+1]!='R':
a[j]='R'
elif a[j-1]!='G' and a[j+1]!='G':
a[j]='G'
else:
a[j]='B'
h=a[j]
print(c)
for k in range(n):
print(a[k],end='')
#c=1
#for j in range(n-1):
# if b[j]==b[j+1]:
# c+=1
# else:
# p.append(c)
# c=1
#p.append(c)
#sump=0
#for k in range(len(p)):
# sump+=p[k]//2
| 1,400 | PYTHON3 |
def exec():
x=input()
if (len(x)>10):
print(x[0]+str((len(x)-2))+x[-1])
else:
print(x)
if __name__ == "__main__":
times=int(input())
for i in range(times):
exec() | 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const long long N = 2 * 1e5 + 100;
long long n, m, k, w, a[N], d[N], p[N], fa[N], vi[N];
long long tot, first[N], nxt[N * 2], point[N * 2], len[N * 2];
priority_queue<pair<long long, long long>, vector<pair<long long, long long> >,
greater<pair<long long, long long> > >
q;
struct node {
long long u, v, w;
} sh[N];
bool cmp(node a, node b) { return a.w < b.w; }
long long find(long long x) {
return (x == fa[x]) ? fa[x] : fa[x] = find(fa[x]);
}
inline long long read() {
long long f = 1, x = 0;
char s = getchar();
while (s < '0' || s > '9') {
if (s == '-') f = -1;
s = getchar();
}
while (s >= '0' && s <= '9') {
x = x * 10 + s - '0';
s = getchar();
}
return x * f;
}
inline void add_edge(long long x, long long y, long long z) {
nxt[++tot] = first[x];
first[x] = tot;
point[tot] = y;
len[tot] = z;
}
inline bool merge(long long a, long long b) {
long long fax = find(a), fay = find(b);
if (fax == fay) return 0;
fa[fax] = fay;
return 1;
}
signed main() {
tot = -1;
memset(first, -1, sizeof(first));
n = read();
m = read();
for (long long i = 1; i <= m; i++) {
long long u = read(), v = read(), w = read();
add_edge(u, v, w);
add_edge(v, u, w);
}
k = read();
for (long long i = 1; i <= k; i++) a[i] = read();
for (long long i = 1; i <= n; i++) d[i] = 1e18;
for (long long i = 1; i <= k; i++)
p[a[i]] = a[i], d[a[i]] = 0, q.push(make_pair(0, a[i]));
while (!q.empty()) {
long long x = q.top().second;
q.pop();
if (vi[x]) continue;
vi[x] = 1;
for (long long i = first[x]; i != -1; i = nxt[i]) {
long long u = point[i];
if (d[u] > d[x] + len[i]) {
d[u] = d[x] + len[i];
p[u] = p[x];
q.push(make_pair(d[u], u));
}
}
}
for (long long i = 0; i <= tot; i += 2) {
long long u = point[i], v = point[i ^ 1];
if (p[u] == p[v]) continue;
sh[++w] = (node){p[u], p[v], d[u] + d[v] + len[i]};
}
sort(sh + 1, sh + 1 + w, cmp);
for (long long i = 1; i <= n; i++) fa[i] = i;
long long ans = d[1];
for (long long i = 1; i <= w; i++)
if (merge(sh[i].u, sh[i].v)) ans += sh[i].w;
printf("%lld\n", ans);
}
| 2,600 | CPP |
w, h = (int(i) for i in input().split())
g = 4
for i in range(1, w):
g *= 2
g = g % 998244353
for i in range(1, h):
g *= 2
g = g % 998244353
print(g)
| 1,300 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
const int M = 3e5;
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++) cin >> a[i];
vector<int64_t> fen1(2 * M + 1), fen2(2 * M + 1);
int64_t pref = 0, s = 0, t = 0;
auto Sum = [](int i, vector<int64_t>& fen) -> int64_t {
int64_t r = 0;
while (i > 0) {
r += fen[i];
i -= i & (-i);
}
return r;
};
auto Upd = [](int i, vector<int64_t>& fen, int d) -> void {
while (i < (int)fen.size()) {
fen[i] += d;
i += i & (-i);
}
};
for (int i = 1; i <= n; i++) {
s += 1LL * a[i] * (i - 1) - Sum(a[i], fen1);
t += pref;
pref += a[i];
for (int j = 1; j * a[i] <= 300000; j++) {
t -= 1LL * (Sum((j + 1) * a[i] - 1, fen2) - Sum(j * a[i] - 1, fen2)) * j *
a[i];
Upd(a[i] * j, fen1, j * a[i]);
Upd(a[i] * (j + 1), fen1, -j * a[i]);
}
Upd(a[i], fen2, 1);
cout << s + t << " ";
}
return 0;
}
| 2,300 | CPP |
n,h = map(int, input().split())
a = list(map(int, input().split()))
k = n
for i in a:
if i > h:
k+=1
print(k) | 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100000 + 5;
const int maxe = maxn;
int psz;
struct Edge {
int u, v;
Edge *next;
} epool[maxe * 2], *e[maxn];
void add_edge(int u, int v) {
Edge *p = epool + psz++;
p->u = u;
p->v = v;
p->next = e[u];
e[u] = p;
}
int n, m;
bool g[10][10];
bool vis[maxn];
int cnt;
int head[maxn];
bool ring[maxn];
int id[maxn];
vector<int> vec[maxn];
void init() {
psz = 0;
memset(e, 0, sizeof(e));
memset(g, false, sizeof(g));
scanf("%d%d", &n, &m);
for (int i = 0; i < m; ++i) {
int u, v;
scanf("%d%d", &u, &v);
--u;
--v;
if (n <= 7) {
g[u][v] = g[v][u] = true;
} else {
add_edge(u, v);
add_edge(v, u);
}
}
}
bool find(int u, int f) {
vis[u] = true;
for (Edge *i = e[u]; i; i = i->next) {
int v = i->v;
if (v == f) continue;
if (vis[v]) {
head[cnt] = v;
ring[cnt] = true;
return true;
} else {
if (find(v, u)) return true;
}
}
head[cnt] = u;
ring[cnt] = false;
return true;
}
bool add(int u, int f, int idx) {
vis[u] = true;
vec[idx].push_back(u);
for (Edge *i = e[u]; i; i = i->next) {
int v = i->v;
if (v == f) continue;
if (v == head[idx]) return true;
if (add(v, u, idx)) return true;
}
return false;
}
void reorder(int i) {
vector<int> tmp;
for (int j = 0; j < vec[i].size(); j += 2) tmp.push_back(vec[i][j]);
for (int j = 1; j < vec[i].size(); j += 2) tmp.push_back(vec[i][j]);
if (tmp.size() % 2 == 0) swap(tmp[0], tmp[1]);
vec[i].assign(tmp.begin(), tmp.end());
}
void solve() {
if (n <= 7) {
int idx[7];
for (int i = 0; i < n; ++i) idx[i] = i;
do {
cnt = 0;
for (int i = 0; i < n; ++i) {
int x = idx[i], y = idx[(i + 1) % n];
cnt += !g[x][y];
}
if (cnt >= m) {
for (int i = 0; i < n; ++i) {
int x = idx[i], y = idx[(i + 1) % n];
if (g[x][y]) continue;
printf("%d %d\n", x + 1, y + 1);
if (!(--m)) return;
}
}
} while (next_permutation(idx, idx + n));
printf("-1\n");
return;
}
memset(vis, false, sizeof(vis));
for (int i = 0; i < n; ++i)
if (!vis[i]) {
find(i, -1);
vec[cnt].clear();
add(head[cnt], -1, cnt);
++cnt;
}
int large = 0;
for (int i = 0; i < cnt; ++i)
if (vec[i].size() > vec[large].size()) large = i;
reorder(large);
vector<int> tmp, res;
for (int i = 0; i < cnt; ++i)
if (i != large)
for (int j = 0; j < vec[i].size(); ++j) tmp.push_back(vec[i][j]);
for (int j = 0; j < vec[large].size(); ++j) {
res.push_back(vec[large][j]);
for (int i = j; i < tmp.size(); i += vec[large].size())
res.push_back(tmp[i]);
}
for (int i = 0; i < m; ++i) {
int x = i, y = (i + 1) % n;
printf("%d %d\n", res[x] + 1, res[y] + 1);
}
}
int main() {
init();
solve();
return 0;
}
| 2,400 | CPP |
#include <bits/stdc++.h>
using namespace std;
int num_children[666666];
int pars[666666];
vector<pair<int, int>> edges[666666];
int dfs(int par, int u, int k, int edge_cost, long long* min_sum,
long long* max_sum) {
pars[u] = par;
int ans = 1;
for (const pair<int, int>& vc : edges[u]) {
if (vc.first == par) continue;
ans += dfs(u, vc.first, k, vc.second, min_sum, max_sum);
}
num_children[u] = ans;
if (num_children[u] % 2 == 1) {
(*min_sum) += edge_cost;
}
long long x = min(k, min(ans, 2 * k - ans));
(*max_sum) += x * edge_cost;
return ans;
}
int main() {
int T;
cin >> T;
for (int t = 1; t <= T; t++) {
int k;
cin >> k;
for (int i = 1; i <= 2 * k; i++) edges[i].clear();
for (int i = 1; i <= 2 * k - 1; i++) {
int a, b, t;
cin >> a >> b >> t;
edges[a].push_back({b, t});
edges[b].push_back({a, t});
}
long long min_sum = 0;
long long max_sum = 0;
dfs(-1, 1, k, 0, &min_sum, &max_sum);
printf("%lld %lld\n", min_sum, max_sum);
}
}
| 2,000 | CPP |
#include <bits/stdc++.h>
using namespace std;
string a, b;
pair<int, int> process(string& s) {
int sum = 0, wildcard = 0;
for (auto c : s) {
if (c == '+') {
sum++;
} else if (c == '-') {
sum--;
} else {
wildcard++;
}
}
return {sum, wildcard};
}
int main() {
cin >> a >> b;
pair<int, int> info_a = process(a);
pair<int, int> info_b = process(b);
int diff = info_a.first - info_b.first;
int wild = info_b.second, res = 0;
for (int mask = 0; mask < (1 << wild); mask++) {
int sum = 0;
for (int i = 1; i <= wild; i++) {
if (mask & (1 << (i - 1))) {
sum++;
} else {
sum--;
}
}
if (sum == diff) {
res++;
}
}
printf("%.9lf\n", (double)res / (1 << wild));
return 0;
}
| 1,300 | CPP |
#include <bits/stdc++.h>
using namespace std;
mt19937 rnd(228);
struct pt {
int x, y;
};
pt operator-(const pt &a, const pt &b) { return {a.x - b.x, a.y - b.y}; }
pt operator+(const pt &a, const pt &b) { return {a.x + b.x, a.y + b.y}; }
long long operator*(const pt &a, const pt &b) {
return a.x * (long long)b.y - a.y * (long long)b.x;
}
long long len(const pt &p) {
return p.x * (long long)p.x + p.y * (long long)p.y;
}
pt s;
const int N = 300 + 7;
int ok[N][N];
long long dp[N][N];
vector<pt> f;
pt mn;
bool operator<(const pt &a, const pt &b) {
if ((a - s) * (b - s) != 0) {
return (a - s) * (b - s) < 0;
} else {
return len(a - s) < len(b - s);
}
}
long long sq(const pt &a, const pt &b, const pt &c) {
return abs((c - a) * (b - a));
}
bool in(const pt &who, const pt &a, const pt &b, const pt &c) {
return sq(a, b, c) == sq(a, b, who) + sq(a, c, who) + sq(b, c, who);
}
int main() {
int n;
cin >> n;
vector<pt> e;
for (int i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
e.push_back({x, y});
}
long long ans = 0;
for (int i = 0; i < n; i++) {
f.clear();
for (int j = 0; j < n; j++) {
if (e[j].x > e[i].x || (e[j].x == e[i].x && e[j].y > e[i].y)) {
f.push_back(e[j]);
}
}
s = e[i];
sort(f.begin(), f.end());
int k = f.size();
for (int i = 0; i < k; i++) {
for (int j = i + 1; j < k; j++) {
ok[i][j] = 0;
}
}
for (int i = 0; i < k; i++) {
for (int j = i + 1; j < k; j++) {
ok[i][j] = 1;
}
}
vector<pair<int, int> > e;
for (int i = 0; i < k; i++) {
for (int j = i + 1; j < k; j++) {
e.push_back({i, j});
}
}
mn = {-1, 1000000000};
sort(e.begin(), e.end(), [](pair<int, int> a, pair<int, int> b) {
pt x = f[a.second] - f[a.first];
pt y = f[b.second] - f[b.first];
if (x * mn == 0) {
if (y * mn == 0) {
return len(x) < len(y);
} else {
return y * mn < 0;
}
}
if (y * mn == 0) {
return x * mn > 0;
}
if (x * mn < 0 && y * mn < 0) {
if (x * y == 0) {
return len(x) < len(y);
}
return x * y < 0;
} else if (x * mn > 0 && y * mn > 0) {
if (x * y == 0) {
return len(x) < len(y);
}
return x * y < 0;
} else {
return x * mn > 0;
}
});
for (int i = 0; i < k; i++) {
for (int j = 0; j < 4; j++) {
dp[i][j] = 0;
}
}
for (int i = 0; i < k; i++) dp[i][0] = 1;
vector<vector<int> > was(n);
for (auto c : e) {
int i = c.first, go = c.second;
for (int j = 0; j < 3; j++) {
dp[go][j + 1] += dp[i][j] * (long long)ok[i][go];
}
}
for (int i = 0; i < k; i++) {
ans += dp[i][3];
}
}
cout << ans << '\n';
}
| 2,900 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%i", &n);
int arr[n];
for (int i = 0; i < n; i++) {
int a;
scanf("%i", &a);
arr[i] = a;
}
string ans = "";
bool flag = true;
int s = 0;
while (true) {
bool done = true;
for (int i = 0; i < n && done; i++) {
if (arr[i] > 0) done = false;
}
if (done) break;
if (flag) {
for (int i = 0; i < n; i++) {
if (arr[i] > 0 && (s == 0 || (s > 0 && ans[s - 1] != 'P'))) {
arr[i]--;
ans += 'P';
s++;
}
if (i < n - 1) {
ans += 'R';
s++;
}
}
flag = false;
} else {
for (int i = n - 1; i >= 0; i--) {
if (arr[i] > 0 && (s == 0 || (s > 0 && ans[s - 1] != 'P'))) {
arr[i]--;
ans += 'P';
s++;
}
if (i > 0) {
ans += 'L';
s++;
}
}
flag = true;
}
}
cout << ans << endl;
}
| 1,200 | CPP |
n , x = map(int,input().split())
p = 0
for i in range(1,n+1):
if x%i==0 and x//i<=n:
p+=1
print(p)
| 1,000 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long x;
cin >> x;
long long i = 0;
while (x) {
if (x & 1) {
i++;
}
x = x / 2;
}
cout << i;
}
| 1,000 | CPP |
#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) {
if (!b) return a;
return gcd(b, a % b);
}
int n, k;
int a[105], b[105];
int dp[105][200015];
void ck(int &x, int y) {
if (x == -1 || x < y) x = y;
}
int main() {
scanf("%d%d", &n, &k);
for (int i = (1); i <= (n); ++i) scanf("%d", &a[i]);
for (int i = (1); i <= (n); ++i) scanf("%d", &b[i]);
memset(dp, -1, sizeof(dp));
dp[0][100000] = 0;
for (int i = (1); i <= (n); ++i) {
for (int j = (0); j <= (200002); ++j) {
if (dp[i - 1][j] == -1) continue;
ck(dp[i][j], dp[i - 1][j]);
ck(dp[i][j + a[i] - k * b[i]], dp[i - 1][j] + a[i]);
}
}
if (dp[n][100000] != 0)
printf("%d\n", dp[n][100000]);
else
printf("-1\n");
return 0;
}
| 1,900 | CPP |
testCases= int(input())
for _ in range(testCases):
n, k= map(int, input().split())
addition= 0
odd= 1
count= 0
if((n% 2!= 0) and (k% 2== 0)):
print('NO')
elif((n% 2== 0) and (k% 2!= 0)):
print('NO')
else:
minimumSum= k**2
if((minimumSum<= n) and (minimumSum% 2== n% 2)):
print('YES')
else:
print('NO')
| 1,100 | PYTHON3 |
i = input().split()
n = int(i[0])
m = int(i[1])
k = int(i[2])
res = 'No'
if m>=n and k>=n:
res = 'Yes'
print(res) | 800 | PYTHON3 |
n = int(input())
k = 0
while n:
n -= int(max(str(n)))
k += 1
print(k)
| 1,100 | PYTHON3 |
n = int(input())
arr = list(map(int,input().split()))
# arr = [15, 20, 30, 40, 50, 60, 70, 80, 90]
def minMinute(arr):
t = 0
for i in range (len(arr)):
if arr[i] - t > 15:
return min(90,t+15)
else:
t = arr[i]
return min(t+15, 90)
print(minMinute(arr)) | 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int a[101];
int main() {
ios_base::sync_with_stdio(0);
cin >> a[1] >> a[2] >> a[3];
int ans = 0;
for (int i = 1; i <= 1001; i++) {
if (i <= a[1] && i + 1 <= a[2] && i + 2 <= a[3]) {
ans = max(ans, i + i + i + 3);
}
}
cout << ans;
return 0;
}
| 800 | CPP |
for _ in range(int(input())):
ans = "YES"
n = int(input())
arr = list(map(int, input().split()))
if n&1:
for x,y in zip(arr[:-1], arr[1:]):
if y <= x:
break
else:
ans = "NO"
print(ans) | 1,100 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 3e5 + 5;
const int mod = 1e9 + 7;
long long qpow(long long a, long long b) {
long long ans = 1;
a %= mod;
assert(b >= 0);
for (; b; b >>= 1) {
if (b & 1) ans = ans * a % mod;
a = a * a % mod;
}
return ans;
}
long long gcd(long long a, long long b) { return b > 0 ? gcd(b, a % b) : a; }
int n, m, T;
int id[maxn];
vector<int> g[maxn];
bool vis[10][10];
int gao() {
int x = 0;
memset(vis, 0, sizeof vis);
for (int i = 1; i <= n; i++) {
for (auto v : g[i]) {
if (vis[id[i]][id[v]]) continue;
vis[id[i]][id[v]] = vis[id[v]][id[i]] = 1;
x++;
}
}
return x;
}
int cal(int t) {
int res = 0, num = 0;
for (int i = 1; i <= n; i++) {
if (i != t) id[i] = ++num;
}
for (int i = 1; i <= 6; i++) {
id[t] = i;
res = max(res, gao());
}
return res;
}
int main() {
cin >> n >> m;
for (int i = 0; i < m; i++) {
int x, y;
scanf("%d%d", &x, &y);
g[x].push_back(y);
g[y].push_back(x);
}
int ans = 0;
if (n <= 6) {
ans = m;
} else {
for (int i = 1; i <= n; i++) {
ans = max(ans, cal(i));
}
}
cout << ans << endl;
return 0;
}
| 1,700 | CPP |
a=input()
b="hello"
k=0
m=0
for i in b:
a=a[k::]
#print(a)
try:
k=a.index(i)
if(i=='l'):
k=k+1
if i in a:
pass
else:
m=1
print('NO')
break
except:
m=1
print('NO')
break
if(m==0):
print('YES')
| 1,000 | PYTHON3 |
# Author : code_marshal
n,m=map(int,input().split());i=j=0
a=list(map(int,input().split()))
b=list(map(int,input().split()))
while i<n and j<m:
if b[j]>=a[i]:i+=1
j+=1
print (n-i)
| 1,200 | PYTHON3 |
import sys
reader = (line.rstrip() for line in sys.stdin)
t = int(next(reader))
modulo = 10 ** 9 + 7
for _ in range(t):
x = int(next(reader))
s = [int(i) for i in next(reader)]
l = 0
total = len(s)
while l < x:
l += 1
k = s[l-1]
if len(s) < x:
n = len(s)
for _ in range(k - 1):
s.extend(s[l:n])
total = len(s)
else:
total += (k - 1) * (total - l)
total %= modulo
print(total) | 1,700 | PYTHON3 |
input()
line = input()
wasm = -1
last0 = 0
last1 = -1
curs = 0
err = False
for i in range(len(line)):
if line[i]=='(':
curs+=1
else:
curs-=1
if curs == 0:
last0=i
if curs == 1:
last1=i
if curs < 0:
if wasm == -1:
wasm=i
if curs < -2:
err = True
break
if err:
print(0)
elif wasm == -1:
if curs != 2:
print(0)
else:
print(int((len(line)-max(last0,last1))/2))
else:
if curs != -2:
print(0)
else:
print(int(wasm/2) + 1) | 1,900 | PYTHON3 |
for y in range(int(input())):
n=int(input())
lst=list(map(int,input().split()))
cnt=0
for i in range(n-1):
if lst[i]>lst[i+1]:
cnt+=(lst[i]-lst[i+1])
if cnt<=lst[0]:
print('YES')
else:
print('NO') | 1,800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int s, a, b, c, t;
int main() {
scanf("%d%d%d%d", &s, &a, &b, &c);
t = a + b + c;
if (t == 0)
printf("0.0 0.0 0.0\n");
else
printf("%.15f %.15f %.15f\n", (double)s * a / t, (double)s * b / t,
(double)s * c / t);
return 0;
}
| 1,800 | CPP |
#include <bits/stdc++.h>
using namespace std;
bool is_prime(long long a) {
for (long long i = 2; i <= (a / i); i++) {
if (a % i == 0) {
return 0;
}
}
return 1;
}
long long tonmoy(long long p, long long q, long long a) {
long long x = p;
long long y = q;
if (a == 1) {
return 1;
}
while (p % q == 0) {
p /= a;
}
return p;
}
int main() {
int n;
cin >> n;
string a;
int b;
map<string, int> m;
map<string, int> m2;
vector<pair<string, int> > v;
while (n--) {
cin >> a >> b;
m[a] += b;
v.push_back(make_pair(a, b));
}
map<string, int>::iterator it;
int best = 0;
for (it = m.begin(); it != m.end(); it++) {
best = max(best, it->second);
}
for (int i = 0; i < v.size(); i++) {
m2[v[i].first] += v[i].second;
if (m2[v[i].first] >= best && m[v[i].first] == best) {
cout << v[i].first << endl;
return 0;
}
}
}
| 1,500 | CPP |
t = int(input())
for i in range(t):
l = list(map(int, input().split()))
l.sort()
if l[0] == l[1] and l[1]!=l[2]:
print("NO")
continue
elif l[0]!=l[1] and l[1]!=l[2]:
print("NO")
continue
print("YES")
if l[0] == l[1] and l[1] == l[2]:
print(l[0], l[0], l[0])
elif l[1] == l[2]:
print(l[0], l[0], l[1])
| 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long GCD(long long a, long long b) { return b != 0 ? GCD(b, a % b) : a; }
long long LCM(long long a, long long b) { return a * (b / GCD(a, b)); }
long long Pow(long long n, long long e) {
if (e == 0) return 1;
if (e == 1)
return n;
else if (e & 1) {
long long t = Pow(n, e / 2);
return n * t * t;
} else {
long long t = Pow(n, e / 2);
return t * t;
}
}
long long start[100005], endd[100005], cntS[100005], cntE[100005], res[100005];
int main() {
int N, M, K;
scanf("%d %d %d", &N, &M, &K);
for (int i = 0, max_ = (M); i < max_; ++i) {
int a, b, c;
scanf("%d %d %d", &a, &b, &c);
--a;
--b;
start[a] += c;
endd[b] += c + (b - a);
++cntS[a];
++cntE[b];
}
long long curr = 0;
int cnt = 0;
for (int i = 0, max_ = (N); i < max_; ++i) {
curr += start[i];
cnt += cntS[i];
res[i] = curr;
curr -= endd[i];
cnt -= cntE[i];
curr += cnt;
}
long long sum = 0;
for (int i = 0, max_ = (K); i < max_; ++i) {
int b;
scanf("%d", &b);
--b;
sum += res[b];
}
printf("%I64d\n", sum);
return 0;
}
| 1,600 | CPP |
def CostOfHeating(c, sum):
t = sum // c
cost = sum % c * (t + 1)**2 + (c - sum % c) * t**2
return cost
def main():
outl = []
for i in range(int(input())):
inl = input().split()
outl.append(CostOfHeating(int(inl[0]), int(inl[1])))
for i in outl:
print(i)
if __name__ == '__main__':
main() | 1,000 | PYTHON3 |
n= int(input())
s= str(input())
count=0
x=1
for i in s:
if int(i)%2==0:
count= count+ s.index(i)+x
x= x+ len(s[: s.index(i)])+1
s= s[s.index(i)+1:]
print(count) | 800 | PYTHON3 |
a, m = map(int, input().split())
s = set()
s.add(a)
while True:
a = (2 * a) % m
if a in s:
print("No")
exit(0)
if a == 0:
print("Yes")
exit(0)
s.add(a)
| 1,400 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
struct edge {
int u, v, c, p;
} s[501000];
int n, m;
int f[501000], ff[501000];
void Union(int a, int b) {
int t = f[a] + f[b];
if (f[a] > f[b]) swap(a, b);
f[a] = t;
f[b] = a;
}
int root(int u) {
if (f[u] < 0) return u;
return f[u] = root(f[u]);
}
int tcase, now[501000];
int root2(int u) {
if (now[u] != tcase) now[u] = tcase, ff[u] = f[u];
if (ff[u] < 0) return u;
return ff[u] = root2(ff[u]);
}
void Union2(int a, int b) {
int t = ff[a] + ff[b];
if (ff[a] > ff[b]) swap(a, b);
ff[a] = t;
ff[b] = a;
}
vector<pair<int, int> > qc[501000];
vector<int> e[501000];
int q;
bool query[501000];
void init() {
int k, id;
cin >> q;
for (int i = 0; i < q; ++i) {
cin >> k;
query[i] = true;
while (k--) {
cin >> id;
qc[s[id].c].push_back(pair<int, int>(i, id));
}
}
}
void solve() {
tcase = 0;
for (int i = 1; i <= n; ++i) f[i] = -1;
for (int cost = 1; cost <= 5e5; ++cost) {
sort(qc[cost].begin(), qc[cost].end());
for (int i = 0; i < qc[cost].size(); ++i) {
if (!i || qc[cost][i].first != qc[cost][i - 1].first) tcase++;
int id = qc[cost][i].second;
int a = root2(s[id].u);
int b = root2(s[id].v);
if (a == b) {
query[qc[cost][i].first] = false;
} else
Union2(a, b);
}
for (int id : e[cost]) {
int a = root(s[id].u);
int b = root(s[id].v);
if (a != b) Union(a, b);
}
}
for (int i = 0; i < q; ++i) {
if (query[i])
cout << "YES\n";
else
cout << "NO\n";
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
;
cin >> n >> m;
for (int i = 1; i <= m; ++i) {
cin >> s[i].u >> s[i].v >> s[i].c;
e[s[i].c].push_back(i);
}
init();
solve();
}
| 2,300 | CPP |
n = int(input())
s = input()
max = 0
val = 0
for i in range(n - 1):
sub = s[i] + s[i + 1]
val=0
for j in range(n - 1):
if s[j] + s[j + 1] == sub:
val += 1
if val > max:
max = val
ans = sub
print(ans)
| 900 | PYTHON3 |
a=input().lower()
b=input().lower()
if(a==b):
print(0)
elif(a>b):
print(1)
else:
print(-1) | 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long int fact(long long int n) {
long long int ans = 1;
for (long long int i = 2; i <= n; i++)
ans = (ans % 1000000007 * i % 1000000007) % 1000000007;
return ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long int t;
cin >> t;
while (t--) {
long long int n;
cin >> n;
cout << (n % 1000000007 * fact(2 * n - 1) % 1000000007) % 1000000007
<< endl;
}
}
| 800 | CPP |
#include <bits/stdc++.h>
using namespace std;
bool f1(pair<int, int> a, pair<int, int> b) { return a.first < b.first; }
bool f2(pair<int, int> a, pair<int, int> b) { return a.second < b.second; }
int main() {
int tmp;
int n;
cin >> n;
pair<int, int> tmp2;
pair<int, int> a[300005];
for (int i = 0; i < n; i++) {
cin >> tmp;
tmp2.first = tmp;
tmp2.second = i;
a[i] = tmp2;
}
stable_sort(a, a + n, f1);
tmp2 = a[0];
tmp = tmp2.first;
for (int i = 1; i < n; i++) {
if (a[i].first > tmp) {
tmp2 = a[i];
tmp = tmp2.first;
continue;
} else {
a[i].first = ++tmp;
}
}
sort(a, a + n, f2);
for (int i = 0; i < n; i++) {
cout << a[i].first << ' ';
}
cout << endl;
}
| 1,400 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int a[n], b[n], man = 0, sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] < 0) {
b[man] = abs(a[i]);
man++;
}
a[i] = abs(a[i]);
sum += a[i];
}
sort(a, a + n);
if (((k - man) % 2 == 1) && (k > man)) {
k--;
sum -= 2 * a[0];
}
int t = man - k;
sort(b, b + man);
for (int i = 0; i < t; i++) sum -= 2 * b[i];
cout << sum << endl;
}
| 1,200 | CPP |
#include <bits/stdc++.h>
using namespace std;
struct Event {
int l, r, ind;
Event() : l(), r(), ind() {}
Event(int _l, int _r, int _ind) : l(_l), r(_r), ind(_ind) {}
};
const int N = 4005;
const int T = 33000;
const int SIZE = (1 << 15);
int n, p, q;
int cost[N], happy[N];
int query_money[T];
int query_res[T];
vector<int> queries[T];
struct Knapsack {
int dp[N][N];
int size;
vector<pair<int *, int>> history;
vector<int> snapshots;
Knapsack() : dp(), size() {}
void change(int *ptr, int val) {
history.push_back(make_pair(ptr, *ptr));
*ptr = val;
}
void undo() {
int *ptr = history.back().first;
int val = history.back().second;
*ptr = val;
history.pop_back();
}
void snapshot() { snapshots.push_back((int)history.size()); }
void recover() {
while ((int)history.size() > snapshots.back()) undo();
snapshots.pop_back();
}
void add(int ind) {
0;
change(&size, size + 1);
for (int i = 0; i < N; i++) {
int old_sum = i - cost[ind];
int val = max((old_sum < 0 ? 0 : dp[size - 1][old_sum] + happy[ind]),
dp[size - 1][i]);
change(&dp[size][i], val);
}
}
int get(int money) { return dp[size][money]; }
void dump() {
0;
for (int i = 0; i <= size; i++) {
for (int j = 0; j < 10; j++) 0;
0;
}
}
};
Knapsack knapsack;
bool intersects(int a, int b, int c, int d) {
int x = max(a, c);
int y = min(b, d);
return x <= y;
}
void solve(int l, int r, vector<Event> &events) {
knapsack.snapshot();
for (Event e : events)
if (e.l <= l && r <= e.r) knapsack.add(e.ind);
if (l == r) {
for (int query : queries[l]) {
query_res[query] = knapsack.get(query_money[query]);
}
} else {
int m = (l + r) / 2;
vector<Event> left, right;
for (Event e : events) {
if (e.l <= l && r <= e.r) continue;
if (intersects(l, m, e.l, e.r)) left.push_back(e);
if (intersects(m + 1, r, e.l, e.r)) right.push_back(e);
}
solve(l, m, left);
solve(m + 1, r, right);
}
knapsack.recover();
}
void solve() {
vector<Event> events;
scanf("%d%d", &n, &p);
for (int i = 0; i < n; i++) {
int time;
scanf("%d%d%d", &cost[i], &happy[i], &time);
events.push_back(Event(time, time + p - 1, i));
}
scanf("%d", &q);
for (int i = 0; i < q; i++) {
int time;
scanf("%d%d", &time, &query_money[i]);
queries[time].push_back(i);
}
solve(0, SIZE - 1, events);
for (int i = 0; i < q; i++) printf("%d\n", query_res[i]);
}
int main() {
solve();
0;
return 0;
}
| 2,700 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
;
string s;
getline(cin, s);
long long int prev = 0;
long long int cnt = 0;
for (long long int i = 1; i <= s.length(); i++) {
if (s[i - 1] == 'F') {
cnt++;
long long int a = i - cnt;
if (prev == 0 || prev < a)
prev = a;
else
prev++;
}
}
cout << prev << '\n';
return 0;
}
| 2,000 | CPP |
N = int(input())
for _ in range(N):
a = [ord(s) for s in input().strip()]
b = [ord(s) for s in input().strip()]
na = len(a)
nb = len(b)
da = []
sa = []
pre = -1
for ai in a:
if pre == ai:
da[-1] += 1
else:
da.append(0)
sa.append(ai)
pre = ai
db = []
sb = []
pre = -1
for bi in b:
if pre == bi:
db[-1] += 1
else:
db.append(0)
sb.append(bi)
pre = bi
#print(da, db, sa, sb)
if sa == sb and all(ai <= bi for ai, bi in zip(da, db)):
print('YES')
else:
print('NO') | 1,200 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
void GO_FAST() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
void AMMAR(int n, int b[1000]) {
for (int i = 0; i < n * 2 + 1; ++i) b[i] = 0;
}
int main() {
GO_FAST();
int b[1000], t, n, x;
cin >> t;
for (int i = 0; i < t; ++i) {
cin >> n;
AMMAR(n, b);
for (int j = 0; j < n * 2; ++j) {
cin >> x;
if (b[x] == 0) {
cout << x << " ";
b[x] = 1;
} else
continue;
}
cout << endl;
AMMAR(n, b);
}
}
| 800 | CPP |
n = int(input())
lis = list(map(int, input().split()))
taxi = 0
n3 = lis.count(3)
n2 = lis.count(2)
n1 = lis.count(1)
n4 = lis.count(4)
taxi += n4 + n3 + n2 // 2
if n3 > n1:
if n2 % 2 != 0:
taxi += 1
else:
n1 -= n3
if n2 % 2 == 0:
taxi += n1 // 4
n1 %= 4
if n1 != 0:
taxi += 1
else:
taxi += n1 // 4
n1 %= 4
if n1 < 3:
taxi += 1
else:
taxi += 2
print(taxi)
| 1,100 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const double PI =
3.141592653589793238462643383279502884197169399375105820974944592307816406286208998628034825342117067982148086513282306647093844609550582231725359408128481117450284102701938521105559644622948954930381964428810975665933446128475648233786783165271201909145648566923460348610454326648213393607260249141273724587006606315588174881520920962829254091715364367892590360011330530548820466521384146951941511609433057270365759591953092186117381932611793105118548074462379962749567351885752724891227938183011949129833673362440656643086021394946395224737190702179860943702770539217176293176752384674818467669405132000568127145263560827785771342757789609173637178721468440901224953430146549585371050792279689258923542019956112129021960864034418159813629774771309960518707211349999998372978049951059731732816096318595024459455346908302642522308253344685035261931188171010003137838752886587533208381420617177669147303598253490428755468731159562863882353787593751957781857780532171226806613001927876611195909216420198938095257201065485863278865936153381827968230301952;
const long long INF = 1e18;
long long gcd(long long x, long long y) { return (y == 0 ? x : gcd(y, x % y)); }
long long lcm(long long a, long long b) { return a * (b / gcd(a, b)); }
bool isprime(long long u) {
for (long long i = 2; i <= (int)sqrt(u); i++) {
if (u % i == 0) return 0;
}
return 1;
}
int main() {
vector<long long> x;
vector<long long> h;
int n, i, r, nb = 1;
cin >> n;
for (i = 0; i < n; i++) {
cin >> r;
x.push_back(r);
cin >> r;
h.push_back(r);
}
x.push_back(INF);
for (i = 1; i < n; i++) {
if (x[i] - x[i - 1] > h[i])
nb++;
else if (x[i + 1] - x[i] > h[i]) {
nb++;
x[i] += h[i];
}
}
cout << nb;
return 0;
}
| 1,500 | CPP |
# from queue import Queue
n, m = map(int, input().split())
arr = [None]*n
for i in range(n):
arr[i] = list(input())
r1, c1 = map(lambda x: int(x) - 1, input().split())
r2, c2 = map(lambda x: int(x) - 1, input().split())
def bfs(maze, x, y, r2, c2):
q = [(x, y)]
path = [[None]*len(maze[0]) for i in range(len(maze))]
path[x][y] = (x,y)
DIR = [(1, 0), (-1, 0), (0, 1), (0, -1)]
while len(q) != 0:
nextLevel = []
for x,y in q:
for dx, dy in DIR:
new_x, new_y = x + dx, y + dy
if 0 <= new_x < len(maze) and 0 <= new_y < len(maze[0]) and path[new_x][new_y] == None and maze[new_x][new_y] == '.':
path[new_x][new_y] = (x,y)
nextLevel.append((new_x, new_y))
# When maze[r2][c2] == 'X'
if new_x == r2 and new_y == c2 and path[new_x][new_y] == None:
path[new_x][new_y] = (x,y)
nextLevel.append((new_x, new_y))
q = nextLevel
return path
def printPath(arr, path, sx, sy, fx, fy):
b = []
while True:
b.append((fx, fy))
(fx, fy) = path[fx][fy]
if fx == sx and fy == sy:
break
# Crack the ice that we went through
for i in range(len(b)-1, -1, -1):
u,v = b[i]
arr[u][v] = 'X'
path = bfs(arr, r1, c1, r2, c2)
directions = [(1, 0), (-1, 0), (0, 1), (0, -1)]
# print(path)
answer = 'NO'
if n == 1 and m == 1:
answer = 'NO'
elif r1 == r2 and c1 == c2:
for dx, dy in directions:
new_x, new_y = r2 + dx, c2 + dy
if 0 <= new_x < n and 0 <= new_y < m and arr[new_x][new_y] == '.':
answer = 'YES'
break
elif path[r2][c2] != None:
if arr[r2][c2] == 'X':
answer = 'YES'
else:
printPath(arr, path, r1, c1, r2, c2)
for dx, dy in directions:
new_x, new_y = r2 + dx, c2 + dy
if 0 <= new_x < n and 0 <= new_y < m and arr[new_x][new_y] == '.':
answer = 'YES'
break
print(answer) | 2,000 | PYTHON3 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.