solution
stringlengths 10
159k
| difficulty
int64 0
3.5k
| language
stringclasses 2
values |
|---|---|---|
#include <bits/stdc++.h>
using namespace std;
const int N = 10001;
int n, c[N], b[N], w[N], l, r, cnt, sum;
bitset<N> f, g, t;
int main() {
scanf("%d%d%d", &n, &l, &r);
for (int i = 1; i <= n; i++) scanf("%d", &w[i]);
for (int i = 1; i <= n; i++) {
scanf("%d", &b[i]);
if (b[i]) c[++cnt] = w[i], sum += w[i];
}
sort(c + 1, c + 1 + cnt);
f[0] = 1;
for (int i = 1; i <= n; i++)
if (!b[i]) f |= f << w[i];
for (int i = cnt; i >= 1; i--) {
g |= g << c[i];
g |= f;
f |= f << c[i];
sum -= c[i];
t = g;
t <<= 10000 - r + sum;
t >>= 10000 - r + sum + l;
if (t.count()) {
printf("%d\n", i);
return 0;
}
}
puts("0");
return 0;
}
| 2,700 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int a, b, x, y, z, s = 0;
cin >> a >> b >> x >> y >> z;
x = (2 * x) + y;
z = (3 * z) + y;
if (a < x) {
s += x - a;
}
if (b < z) {
s += z - b;
}
cout << s << endl;
}
| 800 | CPP |
# dic= {}
# def tree(i,count=0):
# # dic[i] = []
# count+=1
# u,v = [int(x) for x in input().strip().split()]
# if count<=2:
# if u not in dic and v not in dic:
# count+=1
# dic[u] = []
# dic[i].append(u)
# dic[i].append(v)
# tree(u,count)
# tree(v,count)
# else:
# tree(i,count)
# else:
# return -1
# def add_left(i,count=0):
class Node:
def __init__(self, data):
self.left = None
self.right = None
self.data = data
def add_left(self, data):
self.left = data
def add_right(self, data):
self.right = data
n,m = [int(x) for x in input().strip().split()]
u,v = [int(x) for x in input().strip().split()]
tree1 = Node(u)
tree2 = Node(v)
dic1 = {}
dic1[u] = 1
dic2 = {}
dic3 = {}
dic3[u]=1
dic4 = {}
dic4[v]=1
dic2[v] = 1
count1=0
count2=0
count3=0
count4=0
for _ in range(m-1):
u,v = [int(x) for x in input().strip().split()]
if u not in dic1 and v not in dic1:
tree1.add_left(u)
dic1[u] = 1
count1+=1
if u not in dic3 and v not in dic3:
tree1.add_right(v)
dic3[v]=1
count2+=1
if u not in dic2 and v not in dic2:
tree2.add_left(u)
dic2[u]=1
count3+=1
if u not in dic4 and v not in dic4:
tree2.add_right(v)
dic4[v]=1
count4+=1
# print(count1,count2, count3, count4)
res = min(count1,count2, count3, count4)
if res>1:
print("NO")
else:
print("YES") | 1,500 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-10;
const int inf = 1000000000;
const int N = 500005;
const int mo = 1000000000 + 7;
double a[N], b[N];
int n, m, q;
double first, second;
double r1 = 1e30, r2 = 0;
double cal(int i, double l) {
double xx = a[i] + (a[i + 1] - a[i]) * l;
double yy = b[i] + (b[i + 1] - b[i]) * l;
double z = xx * xx + yy * yy;
r1 = min(r1, z);
r2 = max(r2, z);
return z;
}
void work() {
int n;
cin >> n;
cin >> first >> second;
for (int i = 0; i < n; ++i) {
cin >> a[i] >> b[i];
a[i] -= first;
b[i] -= second;
}
a[n] = a[0];
b[n] = b[0];
for (int i = 0; i < n; ++i) {
double l = 0, r = 1;
for (int j = 0; j < 100; ++j) {
double len = (r - l) * 0.48;
double ll = l + len;
double rr = r - len;
if (cal(i, ll) > cal(i, rr))
r = rr;
else
l = ll;
}
l = 0, r = 1;
for (int j = 0; j < 100; ++j) {
double len = (r - l) * 0.48;
double ll = l + len;
double rr = r - len;
if (cal(i, ll) < cal(i, rr))
r = rr;
else
l = ll;
}
}
double pi = acos(-1.);
printf("%.14f\n", (r2 - r1) * pi);
}
int main() {
srand(time(0));
work();
return 0;
}
| 1,900 | CPP |
#include <bits/stdc++.h>
using namespace std;
struct Edge {
int u, v, d;
};
vector<Edge> edges;
vector<int> G[110];
int f[110][110][27];
int dfs(int i, int j, int last) {
if (f[i][j][last] != -1) return f[i][j][last];
if (i == j) return f[i][j][last] = 1;
int leni = G[i].size();
for (int p1 = 0; p1 < leni; p1++) {
Edge x = edges[G[i][p1]];
if (x.d < last) continue;
if (dfs(j, x.v, x.d) == 1) return f[i][j][last] = 0;
}
return f[i][j][last] = 1;
}
int main() {
int n, m;
scanf("%d%d", &n, &m);
for (int i = 1; i <= m; i++) {
int x, y;
char c;
scanf("%d%d %c", &x, &y, &c);
edges.push_back((Edge){x, y, c - 'a'});
G[x].push_back(edges.size() - 1);
}
memset(f, -1, sizeof(f));
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
f[i][j][0] = dfs(i, j, 0);
printf("%c", f[i][j][0] == 0 ? 'A' : 'B');
}
printf("\n");
}
return 0;
}
| 1,700 | CPP |
#include <bits/stdc++.h>
using namespace std;
using pll = pair<long long, long long>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
long long gcd_helper(long long a, long long b) {
if (a % b == 0)
return b;
else
return gcd_helper(b, a % b);
}
long long gcd(long long a, long long b) {
if (a < 0) a *= -1;
if (b < 0) b *= -1;
if (a < b) swap(a, b);
if (b == 0) return a;
return gcd_helper(a, b);
}
long long powr(long long a, long long b, long long M) {
if (b == 0) return 1;
if (a == 0) return 0;
long long ret = 1;
while (b) {
if (b & 1) {
ret *= a;
ret %= M;
}
a = (a * a) % M;
b /= 2;
}
return ret;
}
long long find(long long x, vector<long long> &p) {
if (p[x] != x) p[x] = find(p[x], p);
return p[x];
}
void unite(long long x, long long y, vector<long long> &p,
vector<long long> &sz) {
long long px = find(x, p);
long long py = find(y, p);
if (sz[px] < sz[py]) {
swap(px, py);
swap(x, y);
}
p[py] = px;
sz[px] += sz[py];
}
long long q = 0;
long long queryMachine(long long i, long long j) {
assert(q < 4269);
q++;
long long x;
cout << "? " << i << " " << j << endl;
cin >> x;
assert(x != -1);
return x;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long n;
cin >> n;
long long i = 1, j = 2, k = 3;
long long ij = queryMachine(i, j);
long long jk, ik, x, y;
while (k <= n) {
jk = queryMachine(j, k);
if (ij < jk) {
k++;
} else if (ij > jk) {
ij = jk;
i = k;
k++;
} else {
j = k;
k++;
ij = queryMachine(i, j);
}
}
vector<long long> p(n + 1, -1), idx;
for (long long a = (1); a < (n + 1); a += 1) {
if (a != i && a != j) {
idx.push_back(a);
}
}
shuffle(idx.begin(), idx.end(), rng);
long long zero = -1;
for (long long a = 0; a < (idx.size()); a++) {
ik = queryMachine(i, idx[a]);
jk = queryMachine(j, idx[a]);
if (ik == jk) continue;
if (ik < jk)
zero = i;
else
zero = j;
break;
}
assert(zero != -1);
p[zero] = 0;
if (zero != j)
p[j] = ij;
else
p[i] = ij;
for (long long a = (1); a < (n + 1); a += 1) {
if (a == i || a == j) continue;
p[a] = queryMachine(zero, a);
}
cout << "!";
for (long long a = (1); a < (n + 1); a += 1) cout << " " << p[a];
cout << endl;
return 0;
}
| 2,700 | CPP |
input_length = int(input())
res = 'EASY'
j = input()
if j.count("1") > 0:
res = "HARD"
print(res)
| 800 | PYTHON3 |
n, m = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
ans = a[n - 1] - a[0]
for i in range(1, m - n + 1) :
ans = min(ans, a[i + n - 1] - a[i])
print(ans)
| 900 | PYTHON3 |
for _ in range(int(input())):
n=int(input())
k=(n+3)//4
print((n-k)*"9"+k*"8") | 1,000 | PYTHON3 |
n,x=map(int,input().split())
a=set(map(int,input().split()))
s=int(x in a)
for i in range(x):
if not i in a:s+=1
print(s) | 1,000 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
struct edge {
int a, b;
int w;
bool operator<(edge const& e) const { return w < e.w; }
};
int n, m;
int p[1500];
bool has[1500];
edge e[10 * 1500];
int ans;
int get(int a) { return (a == p[a] ? a : p[a] = get(p[a])); }
void unite(int a, int b) { p[get(a)] = p[get(b)]; }
int main() {
cin >> n;
for (int q, i = 0; i < n; ++i) {
cin >> q;
p[i] = i;
}
cin >> m;
for (int i = 0; i < m; ++i) {
cin >> e[i].a >> e[i].b >> e[i].w;
--e[i].a;
--e[i].b;
}
sort(e, e + m);
for (int i = 0; i < m; ++i) {
if (!has[e[i].b]) {
if (get(e[i].a) != get(e[i].b)) {
unite(e[i].a, e[i].b);
ans += e[i].w;
has[e[i].b] = true;
}
}
}
int cnt = 0;
for (int i = 0; i < n; ++i) {
cnt += (i == p[i]);
}
cout << (cnt > 1 ? -1 : ans);
return 0;
}
| 1,500 | CPP |
from collections import Counter
for _ in range(int(input())):
n = int(input())
a = list(map(int , input().split()))
c = Counter(a)
d = list(sorted(c.items()))
ans=0
current = 1
bulk=0
for i in range(len(d)):
bulk+=d[i][1]
if current+bulk-1>=d[i][0]:
current+=bulk
ans=i+1
bulk=0
print(current)
| 1,000 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-10;
const int oo = ~0u >> 2, mo = (int)1e9 + 7;
const int mn = 21000, ml = 200, mm = mn / ml + 3;
const string dic = "CS";
struct Block {
long long r[ml], d[ml];
} rec[mm][mm];
long long f[mn];
bool g[ml][ml];
int a[mn], b[mn];
int n, m, p;
string Path;
int get(int x, int y) {
int row = x / ml, col = y / ml, sx = row * ml, sy = col * ml;
if (x == sx) return rec[row][col].r[y - sy];
if (y == sy) return rec[row][col].d[x - sx];
return -oo;
}
void Gen(int n, int m) {
do {
int row = n / ml, col = m / ml;
int sx = row * ml, sy = col * ml;
for (int i = sx; i <= n; ++i)
for (int j = sy; j <= m; ++j) {
int l(-oo), u(-oo),
t = (a[i] + b[j] >= p ? a[i] + b[j] - p : a[i] + b[j]);
if (j)
if (j == sy) {
if (i == sx) l = get(i, j - 1);
} else
l = f[j - 1];
if (i)
if (i == sx) {
if (j == sy) u = get(i - 1, j);
} else
u = f[j];
if (i == sx || j == sy)
f[j] = get(i, j);
else
(f[j] = max(f[j], f[j - 1])), f[j] += t;
if (l + t == f[j] || (l == -oo && u + t != f[j]))
g[i - sx][j - sy] = 1;
else if (u + t == f[j] || (u == -oo && l + t != f[j]))
g[i - sx][j - sy] = 0;
}
while (n >= sx && m >= sy) {
if (!n && !m) return;
int t = g[n - sx][m - sy];
Path = dic[t] + Path;
if (t)
--m;
else
--n;
}
} while (n >= 0 && m >= 0);
}
int main() {
scanf("%d%d%d", &n, &m, &p);
for (int i = 0; i <= n - 1; ++i) {
scanf("%d", a + i);
a[i] %= p;
}
for (int i = 0; i <= m - 1; ++i) {
scanf("%d", b + i);
b[i] %= p;
}
for (int i = 0; i <= n - 1; ++i) {
for (int j = 0; j <= m - 1; ++j) {
if (j) (f[j] = max(f[j], f[j - 1]));
f[j] += (a[i] + b[j] >= p ? a[i] + b[j] - p : a[i] + b[j]);
}
int row = i / ml, col = i % ml;
if (!(i % ml))
for (int j = 0; j <= m - 1; ++j) rec[row][j / ml].r[j % ml] = f[j];
for (int j = 0; j < m; j += ml) rec[row][j / ml].d[col] = f[j];
}
cout << f[m - 1] << endl;
Gen(n - 1, m - 1);
cout << Path << endl;
}
| 2,500 | CPP |
def calc(a, b):
return bin(a ^ b).count("1")
n, m, k = map(int, input().split())
a = [int(input()) for _ in range(m)]
x = int(input())
ans = 0
for e in a:
if calc(e, x) <= k:
ans += 1
print(ans)
| 1,100 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
void shows(stack<char> gs) {
stack<char> g = gs;
while (!g.empty()) {
cout << '\t' << g.top();
g.pop();
}
cout << '\n';
}
int main() {
string s, u;
cin >> s;
int arr[26] = {0};
for (int i = 0; i < s.length(); i++) {
arr[s[i] - 'a']++;
}
stack<char> t;
for (int i = 0; i < s.length();) {
int min = int(s[i]) - int('a');
char min_char[1];
for (int j = 0; j < min; j++) {
if (arr[j] > 0) {
min = j;
break;
}
}
min_char[0] = char(min + int('a'));
if (!t.empty() && t.top() <= min_char[0]) {
u += t.top();
t.pop();
} else {
int k;
for (k = i; s[k] != min_char[0]; k++) {
t.push(s[k]);
arr[s[k] - 'a']--;
}
u += s[k];
i = k + 1;
arr[s[k] - 'a']--;
}
}
while (!t.empty()) {
u += t.top();
t.pop();
}
cout << u << endl;
}
| 1,700 | CPP |
from sys import stdin
n=int(stdin.readline())
a=list(map(int,stdin.readline().rstrip().split()))
a.sort()
count=1
sum1=a[-1]
for i in range(n-2,-1,-1):
if sum1>sum(a[0:i+1]):
break
else:
sum1+=a[i]
count+=1
print(count) | 900 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int a[300005];
int main() {
int n;
while (~scanf("%d", &n)) {
int ans = 1, x, j = n;
printf("1");
for (int i = 0; i < n; i++) {
scanf("%d", &x);
a[x] = 1;
ans++;
while (a[j] && j) {
j--;
ans--;
}
printf(" %d", ans);
}
printf("\n");
}
}
| 1,500 | CPP |
n, m = map(int, input().split())
t = list(map(int, input().split()))
sums = [t[0]] * n
print(0, end=' ')
for i in range(1, n):
sums[i] = sums[i-1] + t[i]
diff = 0
if sums[i] > m:
tmp_sum = sums[i]
while(tmp_sum > m):
diff += 1
tmp_sum -= t[i - diff]
print(diff, end=' ')
t[:i+1] = sorted(t[:i+1])
| 1,200 | PYTHON3 |
#!/usr/bin/python
a,b=input().split()
ans = 0
a = int(a)
b = int(b)
m1 = bin(a)[2::]
m2 = bin(b)[2::]
if(len(m1) == len(m2)):
ans = int(ans)
m3 = ['1' for x in range(len(m1))]
for w in range(1,len(m1)):
m3[w] = '0'
str1 = ''.join(m3)
if(int(str1,2)>=a and int(str1,2) <= b):
ans += 1
m3[w] = '1'
else:
ans = ((len(m2) - len(m1) - 1)*(len(m1) + len(m2) -2))/2
ans = int(ans)
m3 = ['1' for x in range(len(m1))]
m4 = ['1' for x in range(len(m2))]
for w in range(1,len(m1)):
m3[w] = '0'
str1 = ''.join(m3)
if(int(str1,2)>=a):
ans += 1
m3[w] = '1'
for w in range(1,len(m2)):
m4[w] = '0'
str1 = ''.join(m4)
if(int(str1,2)<=b):
ans += 1
m4[w] = '1'
print(ans)
| 1,300 | PYTHON3 |
#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
/*{{{*/
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<string>
#include<iostream>
#include<sstream>
#include<set>
#include<map>
#include<queue>
#include<bitset>
#include<vector>
#include<limits.h>
#include<assert.h>
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define REP(I, N) for (int I = 0; I < (N); ++I)
#define REPP(I, A, B) for (int I = (A); I < (B); ++I)
#define FOR(I, A, B) for (int I = (A); I <= (B); ++I)
#define FORS(I, S) for (int I = 0; S[I]; ++I)
#define RS(X) scanf("%s", (X))
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
#define CASET int ___T; scanf("%d", &___T); for(int cs=1;cs<=___T;cs++)
#define MP make_pair
#define PB emplace_back
#define MS0(X) memset((X), 0, sizeof((X)))
#define MS1(X) memset((X), -1, sizeof((X)))
#define LEN(X) strlen(X)
#define F first
#define S second
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef long double LD;
typedef pair<int,int> PII;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<PII> VPII;
typedef pair<LL,LL> PLL;
typedef vector<PLL> VPLL;
template<class T> void _R(T &x) { cin >> x; }
void _R(int &x) { scanf("%d", &x); }
void _R(int64_t &x) { scanf("%lld", &x); }
void _R(double &x) { scanf("%lf", &x); }
void _R(char &x) { scanf(" %c", &x); }
void _R(char *x) { scanf("%s", x); }
void R() {}
template<class T, class... U> void R(T &head, U &... tail) { _R(head); R(tail...); }
template<class T> void _W(const T &x) { cout << x; }
void _W(const int &x) { printf("%d", x); }
void _W(const int64_t &x) { printf("%lld", x); }
void _W(const double &x) { printf("%.16f", x); }
void _W(const char &x) { putchar(x); }
void _W(const char *x) { printf("%s", x); }
template<class T,class U> void _W(const pair<T,U> &x) {_W(x.F); putchar(' '); _W(x.S);}
template<class T> void _W(const vector<T> &x) { for (auto i = x.begin(); i != x.end(); _W(*i++)) if (i != x.cbegin()) putchar(' '); }
void W() {}
template<class T, class... U> void W(const T &head, const U &... tail) { _W(head); putchar(sizeof...(tail) ? ' ' : '\n'); W(tail...); }
#ifdef HOME
#define DEBUG(...) {printf("[DEBUG] ");W(__VA_ARGS__);}
#else
#define DEBUG(...)
#endif
int MOD = 1e9+7;
void ADD(LL& x,LL v){x=(x+v)%MOD;if(x<0)x+=MOD;}
/*}}}*/
namespace io {
const int SIZE = 1e7 + 10;
char inbuff[SIZE];
char *l, *r;
inline void init() {
l = inbuff;
r = inbuff + fread(inbuff, 1, SIZE, stdin);
}
inline char gc() {
if (l == r) init();
return (l != r) ? *(l++) : EOF;
}
void read(int &x) {
x = 0; char ch = gc();
while(!isdigit(ch)) ch = gc();
while(isdigit(ch)) x = x * 10 + ch - '0', ch = gc();
}
} using io::read;
const int SIZE = 600;
const LL INF=1e18;
LL dis[SIZE][SIZE];
int n,m;
LL an[SIZE],tmp[SIZE];
void solve(int st){
REP(i,n)an[i]=INF;
an[st]=0;
bitset<SIZE>u;
REP(i,n-1){
LL mi=INF;
int now=-1;
REP(j,n){
if(!u[j]&&an[j]<mi){
now=j;
mi=an[j];
}
}
u[now]=1;
int pos=an[now]%n;
REP(j,n){
tmp[pos]=an[now]+dis[now][j];
pos++;
if(pos==n){pos=0;}
}
REP(j,n-1){
tmp[j+1]=min(tmp[j+1],tmp[j]+1);
}
tmp[0]=min(tmp[0],tmp[n-1]+1);
REP(j,n-1){
tmp[j+1]=min(tmp[j+1],tmp[j]+1);
}
tmp[0]=min(tmp[0],tmp[n-1]+1);
REP(j,n){
if(an[j]>tmp[j]){
an[j]=tmp[j];
}
}
}
W(VL(an,an+n));
}
void solve() {
REP(i,n)solve(i);
}
void input() {
read(n);
read(m);
REP(i,n)REP(j,n){
dis[i][j]=INF;
}
REP(i,m){
int x,y,v;
read(x);
read(y);
read(v);
dis[x][y]=v;
}
}
int main(){
input();
solve();
return 0;
}
| 2,500 | CPP |
#include <bits/stdc++.h>
using namespace std;
bool is_prime(long long n) {
for (long long i = 2; i * i <= n; ++i) {
if (n % i == 0) {
return false;
}
}
return true;
}
vector<long long> fact(long long n) {
n = abs(n);
vector<long long> ans;
for (int i = 1; i * i <= n; i++) {
if (n % i == 0) {
ans.push_back(i);
ans.push_back(n / i);
}
}
return ans;
}
inline long long getPow(long long a, long long b) {
long long res = 1ll, tp = a;
while (b) {
if (b & 1ll) {
res *= tp;
}
tp *= tp;
b >>= 1ll;
}
return res;
}
long long vec_mult(long long x1, long long y1, long long x2, long long y2,
long long x3, long long y3) {
return abs((x2 - x1) * (y3 - y1) - (y2 - y1) * (x3 - x1));
}
void ok() {
cout << "YES" << endl;
exit(0);
}
void no() {
cout << "NO" << endl;
exit(0);
}
inline long long nxt() {
long long x;
cin >> x;
return x;
}
const long long N = 3e5 + 5, inf = 8e18;
int days[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
long long n = nxt();
vector<vector<long long>> g(n);
for (int i = 1; i < n; i++) {
long long t1 = nxt() - 1, t2 = nxt() - 1;
g[t1].push_back(t2);
g[t2].push_back(t1);
}
map<long long, long long> mp;
for (auto x : g) {
if (x.size() == 2) {
no();
}
}
ok();
return 0;
}
| 1,600 | CPP |
l=list(input())
l1=[]
s=""
for i in range(len(l)):
if(l[i]!='+'):
l1.append(l[i])
l1.sort()
for i in range(len(l1)-1):
print(l1[i],end="+")
print(l1[len(l1)-1]) | 800 | PYTHON3 |
totalInp = int(input())
totalList = input().split(" ")
compDict = {}
for i in range(totalInp):
compDict[totalList[i]] = i
totalQNum = int(input())
totalQList = input().split(" ")
vTotal = 0
pTotal = 0
for i in totalQList:
vTotal += (compDict[i]+1)
pTotal += (totalInp-compDict[i])
print(str(vTotal)+" "+str(pTotal)) | 1,100 | PYTHON3 |
for _ in range(int(input())):
n = int(input())
if n==1:
print(-1)
continue
print(2,end="")
for i in range(n-1):
print(3,end="")
print() | 1,000 | PYTHON3 |
n = int(input())
a = [0] * n
s = input()
k = 0
z = {'R': 0, 'G': 1, 'B': 2}
p = {0: 'R', 1: 'G', 2: 'B'}
r = {'RG': 2, 'RB': 1, 'GR': 2, 'GB': 0, 'BG': 0, 'BR': 1, 'RR': 1, 'GG': 2, 'BB': 1}
a[0] = z[s[0]]
for i in range(1, len(s) - 1):
a[i] = z[s[i]]
# print(a)
if a[i] == a[i-1]:
first = a[i]
second = r[s[i-1] + s[i+1]]
# print('lol')
k += 1
a[i] = second
# print(a)
# print('--------')
if n >= 2:
a[-1] = z[s[-1]]
if a[-1] == a[-2]:
k += 1
a[-1] = (a[-1] + 1) % 3
print(k)
for i in range(n):
print(p[a[i]], end='') | 1,300 | PYTHON3 |
def rs(): return input().strip()
def ri(): return int(input())
def ria(): return list(map(int, input().split()))
def ia_to_s(a): return ' '.join([str(s) for s in a])
import itertools
from functools import lru_cache
def powerset(iterable, low=0, high=None):
"powerset([1,2,3]) --> () (1,) (2,) (3,) (1,2) (1,3) (2,3) (1,2,3)"
s = list(iterable)
if high is None:
high = len(s)+1
return itertools.chain.from_iterable(itertools.combinations(s, r) for r in range(low, high))
def solve(d):
ans = 0
n = len(d)
indices = list(range(n))
subsets = list(powerset(indices, 1))
m = len(subsets)
for to_take in powerset(subsets):
a = [0] * n
ok = True
for i in range(len(to_take)):
for j in range(len(to_take[i])):
a[to_take[i][j]] += 1
if a[to_take[i][j]] > d[to_take[i][j]]:
ok = False
break
if ok:
ans = max(ans, len(to_take))
return ans
def main():
for _ in range(ri()):
a, b, c = ria()
print(solve([a, b, c]))
if __name__ == '__main__':
main()
| 900 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
struct cc {
int V, ads, match_com, index;
cc(){};
cc(int V, int ads, int match_com, int index)
: V(V), ads(ads), match_com(match_com), index(index){};
bool operator<(const cc &a) const {
return ads > a.ads || (ads == a.ads && V < a.V);
}
};
struct cm {
int V, match_soc;
};
cc socs[200005];
cm coms[200005];
priority_queue<cc> que;
multimap<int, int> Map;
multimap<int, int>::iterator it;
int ans_coms, ans_ads;
int main() {
int com, soc;
scanf("%d %d", &com, &soc);
for (int i = 1; i <= com; ++i) {
scanf("%d", &coms[i].V);
coms[i].match_soc = 0;
Map.insert(pair<int, int>(coms[i].V, i));
}
for (int i = 1; i <= soc; ++i) {
scanf("%d", &socs[i].V);
socs[i].ads = socs[i].match_com = 0;
socs[i].index = i;
que.push(socs[i]);
}
while (!que.empty()) {
cc cct = que.top();
que.pop();
it = Map.find(cct.V);
if (it != Map.end()) {
coms[(*it).second].match_soc = cct.index;
socs[cct.index].ads = cct.ads;
ans_coms++;
ans_ads += cct.ads;
Map.erase(it);
} else {
if (cct.V == 1) continue;
cct.V = (cct.V + 1) >> 1;
cct.ads++;
que.push(cct);
}
}
printf("%d %d\n", ans_coms, ans_ads);
for (int i = 1; i < soc; ++i) printf("%d ", socs[i].ads);
printf("%d\n", socs[soc].ads);
for (int i = 1; i <= com; ++i) printf("%d ", coms[i].match_soc);
return 0;
}
| 2,100 | CPP |
n = int(input(""))
l = list(map(int, str(input("")).split(" ")))
count = 0
max = 0
min = 0
for i in range(n-1):
if l[i+1] > l[max]:
count += 1
max = i+1
elif l[i+1] < l[min]:
count += 1
min = i+1
print(count)
| 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int num[110];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> num[i];
}
sort(num, num + n);
int cnt = 0;
for (int i = 0; i < n; i += 2) {
cnt += (num[i + 1] - num[i]);
}
cout << cnt;
return 0;
}
| 800 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long a1 = 0, a2;
long long ans = 0;
for (long long i = 1; i <= n; i++) {
cin >> a2;
if (a2 > a1) {
ans += (a2 - a1) * (n - a2 + 1);
}
if (a2 < a1) {
ans += a2 * (a1 - a2);
}
a1 = a2;
}
cout << ans;
return 0;
}
| 2,100 | CPP |
n = input()
a = list(map(int,input().split()[::-1]))
c = [a[0]]
for i,v in enumerate(a[1:]):
b = max([min([c[i]-1,v]),0])
if b == 0:
break
c.append(b)
print(sum(c)) | 1,000 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int N = 1e6 + 5;
const int M = 1e9 + 7;
const int INF = 0x3f3f3f3f;
const double pi = acos(-1.0);
int read() {
int a = 0;
int d = 1;
char c;
while (c = getchar(), c < '0' || c > '9')
if (c == '-') d = -1;
a = a * 10 + c - 48;
while (c = getchar(), c >= '0' && c <= '9') a = a * 10 + c - 48;
a *= d;
return a;
}
int n, m;
int ffa[N];
int cnt[N];
int lg[N] = {-1};
int fa[N][30];
int dep[N];
vector<vector<int> > edge(N);
vector<pair<int, int> > ask;
void init() {
for (int i = 1; i <= n; i++) {
ffa[i] = i;
lg[i] = lg[i >> 1] + 1;
}
}
int findset(int x) {
if (x == ffa[x])
return x;
else
return ffa[x] = findset(ffa[x]);
}
void unionset(int x, int y) { ffa[findset(x)] = findset(y); }
void dfs(int u, int from) {
fa[u][0] = from;
dep[u] = dep[from] + 1;
for (int i = 1; i <= lg[dep[u]]; i++) fa[u][i] = fa[fa[u][i - 1]][i - 1];
for (int i = 0; i < edge[u].size(); i++) {
int v = edge[u][i];
if (v != from) dfs(v, u);
}
}
int lca(int x, int y) {
if (dep[x] < dep[y]) swap(x, y);
while (dep[x] > dep[y]) x = fa[x][lg[dep[x] - dep[y]]];
if (x == y) return x;
for (int i = lg[dep[x] - 1]; i >= 0; i--)
if (fa[x][i] != fa[y][i]) x = fa[x][i], y = fa[y][i];
return fa[x][0];
}
signed main() {
n = read();
m = read();
init();
for (int i = 1; i <= m; i++) {
int x = read();
int y = read();
if (findset(x) == findset(y)) continue;
edge[x].push_back(y);
edge[y].push_back(x);
unionset(x, y);
}
int q = read();
while (q--) {
int x = read();
int y = read();
cnt[x]++;
cnt[y]++;
ask.push_back(make_pair(x, y));
}
int tot = 0;
for (int i = 1; i <= n; i++)
if (cnt[i] & 1) tot++;
if (tot) {
puts("NO");
printf("%d\n", tot >> 1);
} else {
puts("YES");
dfs(1, 0);
for (int i = 0; i < ask.size(); i++) {
int x = ask[i].first;
int y = ask[i].second;
int lc = lca(x, y);
printf("%d\n", dep[x] + dep[y] - dep[lc] * 2 + 1);
int now = x;
while (now != lc) {
printf("%d ", now);
now = fa[now][0];
}
printf("%d ", lc);
stack<int> st;
now = y;
while (now != lc) {
st.push(now);
now = fa[now][0];
}
while (!st.empty()) {
printf("%d ", st.top());
st.pop();
}
printf("\n");
}
}
return 0;
}
| 2,200 | CPP |
t = int(input())
e = []
o = []
ans = ""
for i in range(t):
n = int(input())
if n < 4:
print(-1)
else:
for i in range(1, n + 1):
if i % 2 == 0 and (i != 2 and i != 4):
e.append(i)
elif i != 2 and i != 4:
o.append(i)
for c in o[::-1]:
ans += str(c) + " "
ans += "4 2 "
for c in e:
ans += str(c) + " "
print(ans)
e = []
o = []
ans = "" | 1,600 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
void fast_io() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
void solve() {
long long n, a;
cin >> n;
a = n;
if (n - 30 <= 0)
cout << "NO\n";
else {
cout << "YES\n";
n = n - 30;
if (n == 6 || n == 10 || n == 14) {
cout << "6"
<< " "
<< "10"
<< " "
<< "15"
<< " " << a - 31 << "\n";
} else
cout << "6"
<< " "
<< "10"
<< " "
<< "14"
<< " " << a - 30 << "\n";
}
}
int32_t main() {
fast_io();
long long t;
cin >> t;
while (t--) {
solve();
}
return 0;
}
| 800 | CPP |
#include <bits/stdc++.h>
using namespace std;
void solve() {
long long n, m;
cin >> n >> m;
long long arr[m];
for (long long i = 0; i < m; i++) {
cin >> arr[i];
}
long long suff[m + 1];
suff[m] = 0;
for (long long i = m - 1; i >= 0; i--) {
suff[i] = suff[i + 1] + arr[i];
}
if (suff[0] < n) {
cout << -1;
return;
}
vector<long long> ans;
long long idx = 0;
for (long long i = 1; i <= n and idx < m; i++) {
if (arr[idx] + i - 1 > n) {
cout << -1;
return;
}
if (suff[idx] + i - 1 >= n) {
ans.push_back(i);
idx++;
}
}
for (long long i = 0; i < m; i++) {
cout << ans[i] << " ";
}
}
int main() {
int t = 1;
while (t--) {
solve();
}
}
| 1,800 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
int h = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
for (int j = n - 1; j > i; j--) {
if (a[i] > a[j]) {
int t = a[i];
a[i] = a[j];
a[j] = t;
}
}
}
for (int i = 1; i < n; i++) {
if (a[i] > a[0]) {
cout << a[i];
h++;
break;
}
}
if (h == 0) {
cout << "NO";
}
return 0;
}
| 800 | CPP |
t=1
t=int(input())
for i in range(t):
n=int(input())
a=list(map(int, input().split()))
b=list(map(int, input().split()))
needm=0
need=[0 for i in range(n)]
needb=0
for i in range(n):
if a[i]>b[i]:
needm+=a[i]-b[i]
need[i]-=a[i]-b[i]
if a[i]<b[i]:
needb+=b[i]-a[i]
need[i]+=b[i]-a[i]
if needm!=needb:
print(-1)
else:
print(needb)
for i in range(needb):
nm=True
nb=True
ans=[0, 0]
for j in range(n):
if need[j]<0 and nm:
ans[0]=j+1
need[j]+=1
nm=False
elif need[j]>0 and nb:
ans[1]=j+1
need[j]-=1
nb=False
if not nm and not nb:
break
print(*ans) | 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
void debug_out(T t) {
cerr << t;
}
template <typename A, typename B>
void debug_out(pair<A, B> u) {
cerr << "(" << u.first << " " << u.second << ")";
}
template <typename T>
void debug_out(vector<T> t) {
int sz = t.size();
for (int i = 0; i < sz; i++) {
debug_out(t[i]);
if (i != sz - 1) cerr << ", ";
}
}
template <typename T>
void debug_out(vector<vector<T>> t) {
int sz = t.size();
for (int i = 0; i < sz; i++) {
debug_out(t[i]);
if (i != sz - 1) cerr << endl;
}
}
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
debug_out(H);
cerr << " ";
debug_out(T...);
}
template <typename T>
void debug_out(set<T> a) {
vector<T> _a;
for (T t : a) _a.push_back(t);
debug_out(_a);
}
class segtree {
public:
struct node {
int val = 0;
int ad = 0;
int sz = 1;
void apply(int l, int r, int v) {
val += v;
ad += v;
}
};
node unite(const node &a, const node &b) const {
node res;
res.val = min(a.val, b.val);
res.sz = a.sz + b.sz;
return res;
}
inline void push(int x, int l, int r) {
int y = (l + r) >> 1;
int z = x + ((y - l + 1) << 1);
if (tree[x].ad != 0) {
tree[x + 1].apply(l, y, tree[x].ad);
tree[z].apply(y + 1, r, tree[x].ad);
tree[x].ad = 0;
}
}
inline void pull(int x, int z) { tree[x] = unite(tree[x + 1], tree[z]); }
int n;
vector<node> tree;
void build(int x, int l, int r) {
if (l == r) {
return;
}
int y = (l + r) >> 1;
int z = x + ((y - l + 1) << 1);
build(x + 1, l, y);
build(z, y + 1, r);
pull(x, z);
}
template <typename M, typename... T>
void build(int x, int l, int r, const vector<M> &v, const T &...t) {
if (l == r) {
tree[x].apply(l, r, v[l], t...);
return;
}
int y = (l + r) >> 1;
int z = x + ((y - l + 1) << 1);
build(x + 1, l, y, v, t...);
build(z, y + 1, r, v, t...);
pull(x, z);
}
template <typename M, typename... T>
segtree(const vector<M> &v, const T &...t) {
n = v.size();
assert(n > 0);
tree.resize(2 * n - 1);
build(0, 0, n - 1, v, t...);
}
segtree(int _n) : n(_n) {
assert(n > 0);
tree.resize(2 * n - 1);
build(0, 0, n - 1);
}
segtree(){};
node get(int x, int l, int r, int ll, int rr) {
if (ll <= l && r <= rr) {
return tree[x];
}
int y = (l + r) >> 1;
int z = x + ((y - l + 1) << 1);
push(x, l, r);
node res{};
if (rr <= y) {
res = get(x + 1, l, y, ll, rr);
} else {
if (ll > y) {
res = get(z, y + 1, r, ll, rr);
} else {
res = unite(get(x + 1, l, y, ll, rr), get(z, y + 1, r, ll, rr));
}
}
pull(x, z);
return res;
}
node get(int ll, int rr) {
assert(0 <= ll && ll <= rr && rr <= n - 1);
return get(0, 0, n - 1, ll, rr);
}
node get(int p) {
assert(0 <= p && p <= n - 1);
return get(0, 0, n - 1, p, p);
}
template <typename... M>
void modify(int x, int l, int r, int ll, int rr, const M &...v) {
if (ll <= l && r <= rr) {
tree[x].apply(l, r, v...);
return;
}
int y = (l + r) >> 1;
int z = x + ((y - l + 1) << 1);
push(x, l, r);
if (ll <= y) {
modify(x + 1, l, y, ll, rr, v...);
}
if (rr > y) {
modify(z, y + 1, r, ll, rr, v...);
}
pull(x, z);
}
template <typename... M>
void modify(int ll, int rr, const M &...v) {
assert(0 <= ll && ll <= rr && rr <= n - 1);
modify(0, 0, n - 1, ll, rr, v...);
}
int find_first_knowingly(int x, int l, int r,
const function<bool(const node &)> &f) {
if (l == r) {
return l;
}
push(x, l, r);
int y = (l + r) >> 1;
int z = x + ((y - l + 1) << 1);
int res;
if (f(tree[x + 1])) {
res = find_first_knowingly(x + 1, l, y, f);
} else {
res = find_first_knowingly(z, y + 1, r, f);
}
pull(x, z);
return res;
}
int find_first(int x, int l, int r, int ll, int rr,
const function<bool(const node &)> &f) {
if (ll <= l && r <= rr) {
if (!f(tree[x])) {
return -1;
}
return find_first_knowingly(x, l, r, f);
}
push(x, l, r);
int y = (l + r) >> 1;
int z = x + ((y - l + 1) << 1);
int res = -1;
if (ll <= y) {
res = find_first(x + 1, l, y, ll, rr, f);
}
if (rr > y && res == -1) {
res = find_first(z, y + 1, r, ll, rr, f);
}
pull(x, z);
return res;
}
int find_first(int ll, int rr, const function<bool(const node &)> &f) {
assert(0 <= ll && ll <= rr && rr <= n - 1);
return find_first(0, 0, n - 1, ll, rr, f);
}
int find_last_knowingly(int x, int l, int r,
const function<bool(const node &)> &f) {
if (l == r) {
return l;
}
push(x, l, r);
int y = (l + r) >> 1;
int z = x + ((y - l + 1) << 1);
int res;
if (f(tree[z])) {
res = find_last_knowingly(z, y + 1, r, f);
} else {
res = find_last_knowingly(x + 1, l, y, f);
}
pull(x, z);
return res;
}
int find_last(int x, int l, int r, int ll, int rr,
const function<bool(const node &)> &f) {
if (ll <= l && r <= rr) {
if (!f(tree[x])) {
return -1;
}
return find_last_knowingly(x, l, r, f);
}
push(x, l, r);
int y = (l + r) >> 1;
int z = x + ((y - l + 1) << 1);
int res = -1;
if (rr > y) {
res = find_last(z, y + 1, r, ll, rr, f);
}
if (ll <= y && res == -1) {
res = find_last(x + 1, l, y, ll, rr, f);
}
pull(x, z);
return res;
}
int find_last(int ll, int rr, const function<bool(const node &)> &f) {
assert(0 <= ll && ll <= rr && rr <= n - 1);
return find_last(0, 0, n - 1, ll, rr, f);
}
};
int tt;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> tt;
while (tt--) {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int zeros = count(a.begin(), a.end(), 0);
int p = zeros / 2;
int lf = 0, rt = zeros;
vector<vector<pair<int, int>>> segs(n);
for (int i = 0; i < n; i++) {
if (a[i] == 0) {
lf++;
rt--;
continue;
}
int rr = min(p, lf);
int ll = p + 1 - min(p, rt);
segs[a[i] - 1].push_back({ll - 1, rr - 1});
}
vector<pair<int, int>> g;
for (int i = 0; i < n; i++) {
int l = -1, r = p;
for (auto j : segs[i]) {
assert(j.first == 0 || j.second == p - 1);
if (j.first == 0) l = max(l, j.second);
if (j.second == p - 1) r = min(r, j.first);
}
if (l >= r - 1) {
g.push_back({p, p});
} else {
g.push_back({l + 1, p - r});
}
}
sort(g.begin(), g.end());
int bound = 0;
int cur = 0;
while (true) {
while (cur < (int)g.size() && g[cur].first <= bound) cur++;
if (cur == (int)g.size()) break;
cur++;
bound++;
}
if (bound == p) {
cout << p << "\n";
continue;
}
multiset<int> ret;
vector<vector<int>> add(bound);
for (auto i : g)
if (min(i.first, bound) > 0)
add[min(i.first - 1, bound - 1)].push_back(i.second);
vector<int> rev;
for (int i = bound - 1; i >= 0; i--) {
for (int j : add[i]) ret.insert(j);
assert(ret.size());
rev.push_back(*ret.begin());
ret.erase(ret.begin());
}
sort(rev.begin(), rev.end());
vector<int> foo(p);
iota(foo.begin(), foo.end(), 0);
segtree st(foo);
for (auto i : g) {
if (i.second > 0) st.modify(0, i.second - 1, 1);
}
for (int i : rev) {
if (i > 0) st.modify(0, i - 1, -1);
}
int res = bound;
for (int sz = bound; sz >= 0; sz--) {
int cnt = 0;
int pos = INT_MAX;
int bb = st.find_first(0, p - sz - 1, [&](const segtree::node &a) {
int v = min(pos - a.sz, a.val - (cnt + a.sz));
if (v >= 0) {
cnt += a.sz;
pos = v;
return false;
}
return true;
});
res = max(res, sz + cnt);
if (sz == 0) break;
if (rev[sz - 1] > 0) st.modify(0, rev[sz - 1] - 1, 1);
}
cout << res << "\n";
}
return 0;
}
| 3,300 | CPP |
s = input()
if s.count('4') + s.count('7') == 4 or s.count('4') + s.count('7') == 7:
print('YES')
else:
print('NO') | 800 | PYTHON3 |
cts = int(input())
cods = list(map(int, input().split(" ")))
for i in range(cts):
cst = []
if i == 0:
cst.append(str(abs(cods[1]-cods[0])))
cst.append(str(abs(cods[-1] - cods[0])))
elif i == len(cods)-1:
cst.append(str(abs(cods[-2] - cods[-1])))
cst.append(str(abs(cods[0] - cods[-1])))
else:
cst.append(str(min(abs(cods[i-1] - cods[i]), abs(cods[i+1] - cods[i]))))
cst.append(str(max(abs(cods[0] - cods[i]), abs(cods[-1] - cods[i]))))
print(" ".join(cst))
| 900 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
inline int in() {
int x;
scanf("%d", &x);
return x;
}
constexpr int N = 1e5 + 7;
vector<pair<int, int> > e;
int n, fi[N], se[N], w[N];
vector<pair<int, int> > g[N];
int cnt = 1;
int sz[N], par[N], val[N];
long long ans[N];
inline int find(int x) {
if (par[x] == x) return x;
return par[x] = find(par[x]);
}
inline void Union(int x, int y) {
sz[find(y)] += sz[find(x)];
par[find(x)] = find(y);
}
inline int dfs1(int x) {
if (val[x]) return 0;
val[x] = sz[x];
for (auto i : g[x]) val[x] += dfs1(i.first);
return val[x];
}
inline void dfs2(int x, int all, int yal) {
if (!val[x]) return;
if (yal != -1) ans[yal] = ((all - val[x]) * 2ll * val[x]);
val[x] = 0;
for (auto i : g[x]) dfs2(i.first, all, i.second);
g[x].clear();
}
int32_t main() {
n = in();
for (int i = 0; i < n - 1; i++) {
fi[i] = in() - 1, se[i] = in() - 1, w[i] = in(), par[i] = i, sz[i] = 1;
e.push_back({w[i], i});
}
par[n - 1] = n - 1, sz[n - 1] = 1;
sort(e.begin(), e.end());
int l = 0;
while (l < ((int)e.size())) {
int r = l;
vector<int> o;
while (r < ((int)e.size()) && e[r].first == e[l].first) r++;
for (int i = l; i < r; i++) {
int x = i;
i = e[i].second;
o.push_back(find(fi[i]));
g[find(fi[i])].push_back({find(se[i]), i});
g[find(se[i])].push_back({find(fi[i]), i});
i = x;
}
for (auto i : o)
if (dfs1(i) != 0) dfs2(i, val[i], -1);
for (int i = l; i < r; i++) Union(fi[e[i].second], se[e[i].second]);
l = r;
}
long long mx = *max_element(ans, ans + n);
vector<int> ANS;
for (int i = 0; i < n - 1; i++)
if (ans[i] == mx) ANS.push_back(i + 1);
cout << mx << ' ' << ((int)ANS.size()) << endl;
for (auto i : ANS) printf("%d ", i);
}
| 2,300 | CPP |
def solve():
n = int(input())
arr = [[0 for x in range(n)] for x in range(n)]
for i in range(n-1):
arr[i][i] = 15
arr[i+1][i] = 8
arr[n-1][n-1] = 15
arr[0][n-1] = 8
for x in range(n):
for y in range(n):
print(arr[x][y], end = " ")
print()
return
def main():
t = int(input())
for i in range(t):
solve()
return
main()
| 900 | PYTHON3 |
n = int(input())
min_meat_cost = float("inf")
ans = 0
for i in range(n):
duff_meat, meat_cost = list(map(int, input().split()))
min_meat_cost = min(min_meat_cost, meat_cost)
ans += duff_meat * min_meat_cost
print(ans) | 900 | PYTHON3 |
width = 0
friends = []
n, h = input().split()
h = int(h)
friends = input().split()
for i in friends:
if int(i) > h:
width += 2
else:
width += 1
print(width)
| 800 | PYTHON3 |
def solve(k,vals):
#maximum = -sys.maxint-1 float('-inf')
maximum =float('-inf')
curr = -1
for i in range(0,len(vals)):
if(vals[i][1]>k):
curr = vals[i][0] - (vals[i][1]-k)
else:
curr = vals[i][0]
maximum = max(curr,maximum)
return maximum
if __name__ == "__main__":
n,k = map(int,input().split(" "))
vals = list()
_n = 0
while(_n < n):
f,t = map(int,input().split(" "))
vals.append([f,t])
_n+=1
print(solve(k,vals))
"""
2 5
3 3
4 5
4
""" | 900 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long int modPow(long long int a, long long int b) {
long long int x;
for (x = 1; b > 0; b /= 2, a = (a * a) % 1000000007)
if (b % 2 == 1) x = (x * a) % 1000000007;
return x % 1000000007;
}
string convertInt(int number) {
stringstream ss;
ss << number;
return ss.str();
}
int convertString(string s) {
int num;
stringstream sstr(s);
sstr >> num;
return num;
}
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
vector<pair<long long int, long long int> > ar;
set<long long int> check, check2;
int pred(pair<long long int, long long int> a,
pair<long long int, long long int> b) {
if (a.first == b.first)
return a.second < b.second;
else
return a.first < b.first;
}
int exist(long long int a, long long int b) {
for (int i = 0; i < 8; i++)
if (ar[i].first == a && ar[i].second == b) return 1;
return 0;
}
int main() {
ar.resize(8);
for (int i = 0; i < 8; i++) {
cin >> ar[i].first >> ar[i].second;
}
sort(ar.begin(), ar.end(), pred);
for (int i = 0; i < 8; i++) check.insert(ar[i].first);
if (check.size() != 3) {
cout << "ugly";
return 0;
}
for (int i = 0; i < 8; i++) check2.insert(ar[i].second);
if (check2.size() != 3) {
cout << "ugly";
return 0;
}
int i = 0, j = 0;
for (set<long long int>::iterator it1 = check.begin(); it1 != check.end();
it1++) {
j = 0;
for (set<long long int>::iterator it2 = check2.begin(); it2 != check2.end();
it2++) {
if (i == 1 && j == 1) {
if (exist(*it1, *it2)) {
cout << "ugly";
return 0;
}
} else {
if (!exist(*it1, *it2)) {
cout << "ugly";
return 0;
}
}
j++;
}
i++;
}
cout << "respectable";
cin >> i;
return 0;
}
| 1,400 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = (int)1e6 + 10, mod = (int)1e9 + 7;
int q, last, sz;
char s[N];
struct state {
int len, link, next[26], cnt;
};
vector<state> st;
vector<bool> vis;
vector<int> adj[2 * N];
void sa_init() {
st.resize(2 * N);
vis.resize(2 * N);
st[0].link = -1;
st[0].len = 0;
last = 0;
sz = 1;
}
void sa_extend(char ch) {
int c = ch - 'a';
int cur = sz++;
st[cur].len = st[last].len + 1;
int p = last;
while (p != -1 && !st[p].next[c]) {
st[p].next[c] = cur;
p = st[p].link;
}
if (p == -1)
st[cur].link = 0;
else {
int q = st[p].next[c];
if (st[q].len == st[p].len + 1)
st[cur].link = q;
else {
int clone = sz++;
st[clone] = st[q];
st[clone].cnt = 0;
st[clone].len = st[p].len + 1;
while (p != -1 && st[p].next[c] == q) {
st[p].next[c] = clone;
p = st[p].link;
}
st[q].link = st[cur].link = clone;
}
}
last = cur;
st[cur].cnt = 1;
}
void dfs(int u) {
for (int v : adj[u]) {
dfs(v);
st[u].cnt += st[v].cnt;
}
}
int main() {
sa_init();
char x;
while ((x = getchar()) != '\n') sa_extend(x);
for (int i = 1; i < sz; i++) adj[st[i].link].push_back(i);
dfs(0);
scanf("%d", &q);
for (int i = 0; i < q; i++) {
scanf("%s", &s);
vector<int> v;
int n = strlen(s);
int l = 0, len = 0, u = 0, ans = 0;
for (int j = 0; j < n; j++) {
while (len < n) {
int c = s[l] - 'a';
if (!st[u].next[c]) break;
u = st[u].next[c];
l++, len++;
if (l == n) l = 0;
}
if (len == n) {
if (!vis[u]) ans += st[u].cnt;
vis[u] = 1;
v.push_back(u);
}
if (u) {
if (st[st[u].link].len == len - 1) {
u = st[u].link;
}
len--;
} else
l = (l + 1) % n;
}
for (int a : v) vis[a] = 0;
printf("%d\n", ans);
}
return 0;
}
| 2,700 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int MOD(1000000009);
int n, m;
int pos;
char seq[11];
int des[101][26], nxt[101], q[100], depth[101], lEnd[101], dp[1001][101][10];
int Insert(const char* const p) {
int l, now(0);
for (l = 0; p[l]; ++l)
if (des[now][p[l] - 'A'])
now = des[now][p[l] - 'A'];
else {
des[now][p[l] - 'A'] = ++pos;
depth[pos] = l + 1;
now = pos;
}
lEnd[now] = l;
return l;
}
void Build(void) {
int l(0), r(0), now;
for (int i = 0; i < 26; ++i) des[0][i] && (q[r++] = des[0][i]);
while (l < r) {
now = q[l];
for (int i = 0; i < 26; ++i) {
int& t(des[now][i]);
if (t) {
nxt[t] = des[nxt[now]][i];
q[r++] = t;
} else
t = des[nxt[now]][i];
}
++l;
}
for (int i = 0; i < r; ++i) {
int t(q[i]);
lEnd[t] < lEnd[nxt[t]] && (lEnd[t] = lEnd[nxt[t]]);
}
return;
}
int main() {
int maxl(0), t1, t2, t3, ans(0);
scanf("%d%d", &n, &m);
for (int i = 0; i < m; ++i) {
scanf("%s", seq);
t1 = Insert(seq);
maxl < t1 && (maxl = t1);
}
Build();
dp[0][0][0] = 1;
for (int l = 1; l <= n; ++l)
for (int stat = 0; stat <= pos; ++stat)
for (int rem = 0; rem < maxl; ++rem) {
if (!dp[l - 1][stat][rem]) continue;
for (int c = 0; c < 26; ++c) {
t1 = des[stat][c];
if (!t1) continue;
t2 = depth[t1];
if (!lEnd[stat] && t2 < rem + 1) continue;
t3 = lEnd[t1] >= rem + 1 ? 0 : rem + 1;
if (t3 == maxl) continue;
dp[l][t1][t3] += dp[l - 1][stat][rem];
dp[l][t1][t3] >= MOD && (dp[l][t1][t3] -= MOD);
}
}
for (int i = 0; i <= pos; ++i)
if (lEnd[i]) {
ans += dp[n][i][0];
ans >= MOD && (ans -= MOD);
}
printf("%d\n", ans);
return 0;
}
| 2,500 | CPP |
def text(s):
if(s == 1):
return "one"
elif(s == 2):
return "two"
elif(s == 3):
return "three"
elif(s == 4):
return "four"
elif(s == 5):
return "five"
elif(s == 6):
return "six"
elif(s == 7):
return "seven"
elif(s == 8):
return "eight"
elif(s == 9):
return "nine"
elif(s == 10):
return "ten"
elif(s == 11):
return "eleven"
elif(s == 12):
return "twelve"
elif(s == 13):
return "thirteen"
elif(s == 14):
return "fourteen"
elif(s == 15):
return "fifteen"
elif(s == 16):
return "sixteen"
elif(s == 17):
return "seventeen"
elif(s == 18):
return "eighteen"
elif(s == 19):
return "nineteen"
elif(s == 20):
return "twenty"
elif(s == 30):
return "thirty"
elif(s == 40):
return "forty"
elif(s == 50):
return "fifty"
elif(s == 60):
return "sixty"
elif(s == 70):
return "seventy"
elif(s == 80):
return "eighty"
else:
return "ninety"
s = int(input())
if(s == 0):
print("zero")
elif(1 <= s <= 20):
print(text(s))
else:
n = s % 10
x = s - n
if(n != 0):
print(text(x) + "-" + text(n))
else:
print(text(x)) | 1,000 | PYTHON3 |
n=int(input())
lst=[int(x) for x in input().split()]
nmax=1
counter=1
for i in range(0,n-1):
if lst[i]<=lst[i+1]:
counter+=1
else:
counter=1
if counter>nmax:
nmax=counter
print(nmax) | 900 | PYTHON3 |
n = int(input())
p = list(map(int, input().split()))
q = list(map(int, input().split()))
p_set = set(p[1:])
q_set = set(q[1:])
# if p[0] == 0:
# p_set.remove(0)
# if q[0] == 0:
# q_set.remove(0)
if n == len(p_set|q_set):
print ("I become the guy.")
else:
print("Oh, my keyboard!") | 800 | PYTHON3 |
x = input()
u = str(x)
y = x.lower()
y = y.replace('a', '')
y = y.replace("o", "")
y = y.replace("y", "")
y = y.replace("e" , "")
y = y.replace("u", "")
y = y.replace("i", "")
num = []
num.append("")
for a in range(len(y)):
num.append(str(y[a]))
print(*num, sep=".") | 1,000 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, i, j, cnt = 0;
bool flag = true;
cin >> n >> m;
int a[n][m];
for (i = 0; i < n; i++) {
if (i % 2 != 0) {
cnt++;
}
for (j = 0; j < m; j++) {
if (i % 2 == 0) {
cout << '#';
} else if (j == m - 1 and cnt % 2 != 0) {
cout << '#';
} else if (j == 0 and cnt % 2 == 0) {
cout << '#';
} else {
cout << '.';
}
}
cout << endl;
}
}
| 800 | CPP |
i = int(input())
for k in range(i):
a,b = map(int, input().split())
if a==b:
print(0)
continue
dif = abs(a-b)
steps = 0
steps += int(dif/10)
if dif%10:
steps+=1
print(steps) | 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
inline int read() {
int 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 << 3) + (x << 1) + (c ^ 48);
c = getchar();
}
return f == 1 ? x : -x;
}
inline void print(int x) {
if (x < 0) putchar('-'), x = ~x + 1;
if (x >= 10) print(x / 10);
putchar((x % 10) | 48);
}
int phi[10000010];
int f[10000010];
int cnt[10000010];
int g[10000010];
int n;
bool vis[10000010];
int prime[10000010];
long long ans;
int tot;
int main() {
n = read();
phi[1] = 1;
for (int i = 2; i <= n; ++i) {
if (!vis[i]) prime[++tot] = i, phi[i] = i - 1, f[i] = i;
for (int j = 1; j <= tot && 1ll * prime[j] * i <= n; ++j) {
f[i * prime[j]] = prime[j];
vis[i * prime[j]]++;
if (i % prime[j] == 0) {
phi[i * prime[j]] = phi[i] * prime[j];
break;
} else
phi[i * prime[j]] = phi[i] * (prime[j] - 1);
}
ans -= phi[i];
}
ans += (1ll * n * (n - 1) >> 1);
long long tmp = 0;
for (int i = 2; i <= n; ++i) ++cnt[f[i]];
for (int i = 2; i <= n; ++i) g[i] = g[i - 1] + cnt[i];
for (int i = 1; i <= tot; ++i) {
tmp += 1ll * cnt[prime[i]] * (g[n / prime[i]]);
}
for (int i = 1; i <= n; ++i) {
if (i * i <= n) {
tmp -= cnt[i];
} else
break;
}
tmp >>= 1;
tmp -= ans;
long long all = 1ll * n * (n - 1) >> 1;
all -= n - 1;
int k = n - 1;
for (int i = 1; i <= tot; ++i) {
if (prime[i] > (n >> 1)) {
all -= k - 1;
--k;
}
}
printf("%lld\n", ans + 2ll * tmp + 3ll * (all - tmp - ans));
}
| 2,700 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long int inv[32][2];
void rec(vector<int>& a, int b) {
if (b < 0 || a.size() == 0) return;
int c[2] = {0};
vector<int> v[2];
for (int x : a) {
int val;
if ((x & (1 << b)) > 0)
val = 1;
else
val = 0;
if (val == 0)
inv[b][0] += c[1];
else
inv[b][1] += c[0];
c[val]++;
v[val].push_back(x);
}
rec(v[0], b - 1);
rec(v[1], b - 1);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
rec(a, 30);
long long int x = 0, ans = 0;
for (int i = 0; i <= 30; i++) {
ans += min(inv[i][0], inv[i][1]);
if (inv[i][0] > inv[i][1]) x += (1 << i);
}
cout << ans << " " << x << "\n";
}
| 2,000 | CPP |
#include <bits/stdc++.h>
const int maxk = 10;
const long long INF = 1e18;
struct node {
int p, wp;
bool operator<(const node &tmp) const { return p < tmp.p; }
};
struct node ai[35];
int n, id[1 << maxk], x, k, q, ci[maxk], num, S[105];
long long f[105][105][32], dp[30][105], g[105];
inline void read(int &now) {
char Cget;
now = 0;
int if_z = 1;
while (!isdigit(Cget = getchar()))
if (Cget == '-') if_z = -1;
while (isdigit(Cget)) {
now = now * 10 + Cget - '0';
Cget = getchar();
}
now *= if_z;
}
inline int count(int s) {
int res = 0;
while (s > 0) {
if (s & 1) ++res;
s >>= 1;
}
return res;
}
int main() {
read(x);
read(k);
read(n);
read(q);
for (int i = 1; i <= k; i++) read(ci[i]);
for (int i = 0; i < (1 << k); i++)
if (count(i) == x) {
id[i] = ++num;
S[num] = i;
}
for (int i = 1; i <= num; i++)
for (int v = 1; v <= num; v++)
for (int e = 0; e <= 30; e++) f[i][v][e] = INF;
for (int i = 1, s, s_; i <= num; i++) {
s = S[i];
if (s & 1) {
s_ = s >> 1;
for (int v = 0; v < k; v++)
if (!(s_ & (1 << v))) f[id[s]][id[s_ | (1 << v)]][0] = ci[v + 1];
} else
f[id[s]][id[s >> 1]][0] = 0;
}
for (int i = 1; i <= 30; i++)
for (int s = 1; s <= num; s++)
for (int t = 1; t <= num; t++)
for (int e = 1; e <= num; e++)
if (f[s][e][i - 1] != INF && f[e][t][i - 1] != INF &&
f[s][e][i - 1] + f[e][t][i - 1] < f[s][t][i])
f[s][t][i] = f[s][e][i - 1] + f[e][t][i - 1];
for (int i = 1; i <= q; i++) {
read(ai[i].p);
read(ai[i].wp);
}
std::sort(ai + 1, ai + q + 1);
ai[0].p = 1;
long long tmpans = 0;
while (ai[q].p > n - x + 1 && q > 0) tmpans += ai[q--].wp;
if (ai[q].p < n - x + 1) {
ai[++q].p = n - x + 1;
ai[q].wp = 0;
}
memset(dp, 0x3f, sizeof(dp));
dp[0][1] = 0;
for (int i = 1; i <= q; i++) {
int tmp = ai[i].p - ai[i - 1].p;
for (int v = 1; v <= num; v++) dp[i][v] = dp[i - 1][v];
for (int v = 0; v <= 30; v++)
if ((1 << v) & tmp) {
memset(g, 0x3f, sizeof(g));
for (int e = 1; e <= num; e++)
for (int z = 1; z <= num; z++)
if (dp[i][e] <= INF && f[e][z][v] <= INF)
g[z] = std::min(dp[i][e] + f[e][z][v], g[z]);
for (int e = 1; e <= num; e++) dp[i][e] = g[e];
}
for (int v = 1; v <= num; v++) {
int s = S[v];
if ((s & 1) && dp[i][v] < INF) dp[i][v] += ai[i].wp;
}
}
std::cout << dp[q][1] + tmpans;
return 0;
}
| 2,900 | CPP |
n,q = map(int, input().split())
arr = list(map(int, input().split()))
qs = [0 for a in arr]
for i in range(q):
qa,qb = map(int,input().split())
qs[qa-1]+=1
if qb < n:
qs[qb]-=1
current_val = 0
for i in range(n):
current_val+=qs[i]
qs[i]=current_val
arr.sort()
nums = sorted(qs)
total = 0
for n,a in zip(arr,nums):
total+=n*a
print(total)
| 1,500 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const long long N = 1e3 + 5;
long long arr[N], range[2][N];
class DPhysicalEducationAndBuns {
public:
long long n, minele, res_diff;
bool check(long long buns) {
for (long long i = 0; i < n; i++) {
range[0][i] = arr[i] - buns;
range[1][i] = arr[i] + buns;
}
for (long long diff = 0;
diff < (range[1][n - 1] - range[0][0]) / (n - 1) + 2; diff++) {
long long mi = range[0][0], ma = range[1][0];
for (long long i = 1; i <= n - 1; i++)
mi = max(mi, range[0][i] - i * diff),
ma = min(ma, range[1][i] - i * diff);
minele = mi;
res_diff = diff;
if (mi <= ma) return true;
}
return false;
}
void solve(std::istream& in, std::ostream& out) {
in >> n;
for (long long i = 0; i < n; i++) in >> arr[i];
sort(arr, arr + n);
long long low = 0, high = 1e4 + 5, res = -1;
while (low <= high) {
long long mid = (low + high) >> 1;
if (check(mid))
res = mid, high = mid - 1;
else
low = mid + 1;
}
check(res);
out << res << '\n';
out << minele << ' ' << res_diff;
}
};
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
DPhysicalEducationAndBuns solver;
std::istream& in(std::cin);
std::ostream& out(std::cout);
solver.solve(in, out);
return 0;
}
| 0 | CPP |
import sys
readline = sys.stdin.readline
MOD = 998244353
N = int(readline())
wants = [tuple(map(int, readline().split()))[1:] for _ in range(N)]
Q = [0]*(10**6+1)
P = [0]*(10**6+1)
for i in range(N):
k = len(wants[i])
kinv = pow(k, MOD-2, MOD)
for w in wants[i]:
P[w] += 1
Q[w] = (Q[w] + kinv)%MOD
res = 0
for i in range(10**6+1):
res = (res+P[i]*Q[i])%MOD
print(pow(N**2, MOD-2, MOD)*res%MOD) | 1,700 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
if (fopen("input.in", "r")) {
freopen("input.in", "r", stdin);
freopen("output.out", "w", stdout);
}
int n;
cin >> n;
int qs[n];
for (int i = 0; i < n; i++) {
cin >> qs[i];
}
long long c = 0;
vector<int> os[n];
int a;
cin >> a;
for (int i = 0; i < a; i++) {
int t, y, u;
cin >> t >> y >> u;
os[y - 1].push_back(u);
}
int f = 0;
for (int i = 0; i < n; i++) {
int m = 1e7;
for (int j = 0; j < os[i].size(); j++) {
if (os[i][j] < m) m = os[i][j];
}
if (m != 1e7)
c += m;
else
f++;
if (f == 2) {
cout << -1;
return 0;
}
}
cout << c;
}
| 1,500 | CPP |
#include <bits/stdc++.h>
using namespace std;
struct MCMF {
struct Edge {
int to, cap, cost, rev;
Edge(int to, int cap, int cost) : to(to), cap(cap), cost(cost) {}
};
vector<Edge> G[3000];
int N, src, sink, work[3000], dist[3000];
bool chk[3000];
MCMF(int N, int src, int sink) : N(N), src(src), sink(sink) {}
void add_edge(int f, int t, int cap, int cost) {
G[f].emplace_back(t, cap, cost);
G[t].emplace_back(f, 0, -cost);
G[f].back().rev = G[t].size() - 1;
G[t].back().rev = G[f].size() - 1;
}
void add_edge_from_source(int t, int cap, int cost) {
add_edge(src, t, cap, cost);
}
void add_edge_to_sink(int f, int cap, int cost) {
add_edge(f, sink, cap, cost);
}
void prep() {
int temp;
queue<int> Q;
priority_queue<pair<int, int>> PQ;
memset(dist, 0x7f, sizeof(dist));
memset(chk, 0, sizeof(chk));
dist[src] = 0;
Q.push(src);
while (!Q.empty()) {
int c = Q.front();
Q.pop();
chk[c] = false;
for (auto &e : G[c])
if (e.cap > 0 && dist[e.to] > dist[c] + e.cost) {
dist[e.to] = dist[c] + e.cost;
if (!chk[e.to]) {
chk[e.to] = true;
Q.push(e.to);
}
}
}
temp = dist[sink] - dist[src];
for (int i = 0; i < N; i++)
for (auto &e : G[i]) e.cost += dist[i] - dist[e.to];
memset(dist, 0x7f, sizeof(dist));
dist[src] = 0;
PQ.emplace(0, src);
while (!PQ.empty()) {
auto [t, c] = PQ.top();
PQ.pop();
if (-t != dist[c]) continue;
for (auto &e : G[c])
if (e.cap > 0 && dist[e.to] > dist[c] + e.cost) {
dist[e.to] = dist[c] + e.cost;
PQ.emplace(-dist[e.to], e.to);
}
}
for (int i = 0; i < N; i++) dist[i] += temp;
}
int dfs(int c, int MF = 0x7fffffff) {
int flow;
chk[c] = true;
if (c == sink) return MF;
for (int &i = work[c]; i < G[c].size(); i++) {
auto &e = G[c][i];
if (!chk[e.to] && e.cap > 0 && dist[e.to] == dist[c] + e.cost &&
(flow = dfs(e.to, min(e.cap, MF)))) {
e.cap -= flow;
G[e.to][e.rev].cap += flow;
return flow;
}
}
return 0;
}
int flow() {
int ret = 0;
for (prep(); memset(work, 0, sizeof(work)); memset(chk, 0, sizeof(chk))) {
int M = 0x7fffffff;
while (int temp = dfs(src)) {
ret += dist[sink] * temp;
memset(chk, 0, sizeof(chk));
}
for (int i = 0; i < N; i++)
if (chk[i])
for (auto &e : G[i])
if (e.cap > 0 && !chk[e.to])
M = min(M, dist[i] + e.cost - dist[e.to]);
if (M == 0x7fffffff) break;
for (int i = 0; i < N; i++)
if (!chk[i]) dist[i] += M;
}
return ret;
}
};
int ans[50][50], P[50][50], V[50][50];
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
((void)0);
((void)0);
((void)0);
int N, M, T, cnt = 0;
cin >> N >> M;
T = N * (N - 1) / 2;
MCMF mf(T + N + 2, T + N, T + N + 1);
memset(P, -1, sizeof(P));
for (int i = 0; i < N; i++) {
for (int j = 0; j < i; j++) mf.add_edge_from_source(V[j][i] = cnt++, 1, 0);
for (int j = 1; j < N; j++) mf.add_edge_to_sink(T + i, 1, 2 * j - 1);
}
while (M--) {
int a, b;
cin >> a >> b;
--a;
--b;
mf.add_edge(V[min(a, b)][max(a, b)], T + a, 1, 0);
ans[a][b] = 1;
}
for (int i = 0; i < N; i++)
for (int j = 0; j < i; j++)
if (mf.G[V[j][i]].size() == 1) {
P[j][i] = mf.G[T + j].size();
mf.add_edge(V[j][i], T + j, 1, 0);
P[i][j] = mf.G[T + i].size();
mf.add_edge(V[j][i], T + i, 1, 0);
}
mf.flow();
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
if (P[i][j] == -1)
cout << ans[i][j];
else
cout << mf.G[T + i][P[i][j]].cap;
}
cout << '\n';
}
return 0;
}
| 2,700 | CPP |
a1, a2, a3, a4 = map(int, input().split())
s = input()
a = b = c = d = 0
for i in s:
if i == "1":
a += 1
elif i == "2":
b += 1
elif i == "3":
c += 1
elif i == "4":
d += 1
print(a1 * a + a2 * b + a3 * c + a4 * d)
| 800 | PYTHON3 |
a,b = map(int,input().rstrip().split())
t = True
i = 0
while True:
i += 1
if t:
a -= i
if a < 0:
break
else:
b -= i
if b < 0:
break
t = not t
if t:
print("Vladik")
else:
print("Valera")
| 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int l, a[10000 + 5], f[100 + 5][100 + 5];
string st;
int main() {
cin >> st;
l = st.size();
for (int i = 0; i < st.size(); i++) a[i + 1] = st[i] - 48;
f[3][3] = 1;
f[4][6] = 1;
f[5][9] = 1;
f[7][7] = 1;
f[8][0] = 1;
f[3][3] = 1;
f[6][4] = 1;
f[9][5] = 1;
f[7][7] = 1;
f[0][8] = 1;
for (int i = 1; i <= l / 2 + 1; i++)
if (f[a[i]][a[l - i + 1]] == 0) {
cout << "No";
return 0;
}
cout << "Yes";
return 0;
}
| 1,900 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, m;
char mp[100][100];
bool use1[100], use2[100];
int main() {
cin >> n >> m;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> mp[i][j];
}
}
for (int i = 0; i < n; i++) {
string s1 = "", s2 = "";
for (int j = 0; j < m; j++) {
s1 += mp[i][j];
}
if (use1[i]) continue;
for (int j = 0; j < m; j++) {
if (mp[i][j] == '#') {
if (use2[j]) {
cout << "NO";
return 0;
}
use2[j] = 1;
}
}
for (int j = 0; j < n; j++) {
for (int k = 0; k < m; k++) {
s2 += mp[j][k];
}
if (s1 == s2) {
use1[j] = 1;
}
s2 = "";
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
if (mp[i][j] == '#' && use2[j] == 0 && use1[i] == 0) {
cout << "NO";
return 0;
}
}
}
cout << "YES";
return 0;
}
| 1,300 | CPP |
n=int(input())
l=input().split()
l1=l.count('5')
if(l1>=9 and n-l1>0):
l2=l1%9
l3=l1-l2
for i in range(l3):
print('5',end="")
for i in range(n-l1):
print('0',end="")
elif(n-l1>0):
print('0')
else:
print('-1')
| 1,000 | PYTHON3 |
x, y, m = map(int, input().split())
x, y = min(x, y), max(x, y)
if y >= m:
print(0)
elif y <= 0:
print(-1)
else:
c = 0
while y < m:
q = (2 * y - x) // y
c += q
x, y = y, x + q * y
print(c)
| 1,600 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long n;
cin >> n;
string s1 = "", s = "ROYGBIV";
long d = n / 7, rem = n % 7;
while (d--) {
s1 += s;
}
switch (rem) {
case 1:
s1 += "G";
break;
case 2:
s1 += "GB";
break;
case 3:
s1 += "YGB";
break;
case 4:
s1 += "YGBI";
break;
case 5:
s1 += "OYGBI";
break;
case 6:
s1 += "OYGBIV";
break;
}
cout << s1;
}
| 1,200 | CPP |
#include <bits/stdc++.h>
using namespace std;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
long long n, k;
cin >> n >> k;
long long a[k + 1];
for (long long i = 1; i <= k; ++i) cin >> a[i];
long long now = 1;
set<long long> out;
for (long long i = 1; i <= k; ++i) {
long long p = now;
a[i] %= n - out.size();
while (a[i]--) {
++p;
if (p > n) p = 1;
while (out.count(p)) {
++p;
if (p > n) p = 1;
}
}
out.insert(p);
cout << p << ' ';
now = p + 1;
if (now > n) now = 1;
while (out.count(now)) {
++now;
if (now > n) now = 1;
}
}
return 0;
}
| 1,300 | CPP |
l, r = [int(x) for x in input().split()]
print("YES")
for i in range(l, r, 2):
print(i, i + 1)
| 1,000 | PYTHON3 |
t=int(input())
for q in range(t):
n=int(input())
if n%2==0:
x=n//2
print('1'*x)
else:
x=(n-3)//2
print('7'+'1'*x) | 900 | PYTHON3 |
#include <bits/stdc++.h>
namespace IO {
char gc() { return getchar(); }
template <typename Tp>
bool get1(Tp &x) {
bool neg = 0;
char c = gc();
while (c != EOF && (c < '0' || c > '9') && c != '-') c = gc();
if (c == '-') c = gc(), neg = 1;
if (c == EOF) return false;
x = 0;
for (; c >= '0' && c <= '9'; c = gc()) x = x * 10 + c - '0';
if (neg) x = -x;
return true;
}
template <typename Tp>
void printendl(Tp x) {
if (x < 0) putchar('-'), x = -x;
static short a[40], sz;
sz = 0;
while (x > 0) a[sz++] = x % 10, x /= 10;
if (sz == 0) putchar('0');
for (int i = sz - 1; i >= 0; i--) putchar('0' + a[i]);
puts("");
}
} // namespace IO
using IO::get1;
using IO::printendl;
const int inf = 0x3f3f3f3f;
const long long Linf = 1ll << 61;
const int maxn = 100111;
const int mod = 998244353;
int qpow(int x, int y) {
int ret = 1;
while (y) {
if (y & 1) ret = 1ll * ret * x % mod;
x = 1ll * x * x % mod;
y >>= 1;
}
return ret;
}
inline void add(int &x, int y) {
x += y;
if (x >= mod) x -= mod;
}
int n, m, tot, coef;
long long a[111], b[111];
int cnt[111], ans[111];
void work() {
long long now = 0;
cnt[0] = 1;
for (int i = 1; i < (1 << tot); i++) {
now ^= a[__builtin_ctz(i)];
cnt[__builtin_popcountll(now)]++;
}
}
int main() {
get1(n) && get1(m);
coef = 1;
while (n--) {
long long x;
get1(x);
for (int i = 0; i < tot; i++)
if (a[i] & -a[i] & x) x ^= a[i];
if (!x) {
add(coef, coef);
continue;
}
for (int i = 0; i < tot; i++)
if (a[i] & x & -x) a[i] ^= x;
a[tot++] = x;
}
if (tot <= m / 2) {
work();
for (int i = 0; i <= m; i++) ans[i] = 1ll * cnt[i] * coef % mod;
} else {
static int seq[111], have[111], c[111][111], ntot;
for (int i = 0; i <= m; i++) {
c[i][0] = 1;
for (int j = 1; j <= m; j++)
c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % mod;
}
for (int i = 0; i < tot; i++) have[__builtin_ctzll(a[i])] = 1;
for (int i = 0; i < m; i++)
if (!have[i]) {
seq[ntot++] = i;
if (coef & 1) coef += mod;
coef >>= 1;
}
for (int i = 0; i < ntot; i++) {
b[i] = 1ll << m - i;
for (int j = 0; j < tot; j++)
if ((a[j] >> seq[i]) & 1) b[i] |= 1ll << j;
}
tot = ntot;
memcpy(a, b, sizeof(a));
work();
for (int i = 0; i <= m; i++) {
for (int j = 0; j <= m; j++) {
int sum = 0;
for (int k = 0; k <= j; k++) {
int now = 1ll * c[j][k] * c[m - j][i - k] % mod;
if (k % 2 == 0)
add(sum, now);
else
add(sum, mod - now);
}
add(ans[i], 1ll * sum * cnt[j] % mod);
}
ans[i] = 1ll * ans[i] * coef % mod;
}
}
for (int i = 0; i <= m; i++) printf("%d%c", ans[i], i == m ? '\n' : ' ');
return 0;
}
| 2,700 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int p[100002], n, i;
cin >> n;
for (i = 1; i < n; i++) {
cin >> p[i];
}
sort(p + 1, p + n);
for (i = 1; i < n; i++) {
if (p[i] != i) {
cout << i << endl;
return 0;
}
}
cout << n << endl;
return 0;
}
| 800 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
int n, p[N], dp[N][2][2];
array<int, 3> pre[N][2][2];
void reset(int a[][2]) {
for (int i = 0; i < 2; i++)
for (int j = 0; j < 2; j++) a[i][j] = INT_MAX;
}
inline bool Min(int &x, int y) {
if (x > y) {
x = y;
return true;
}
return false;
}
void echo(int a, int b, int c) {
if (!a) return;
echo(pre[a][b][c][0], pre[a][b][c][1], pre[a][b][c][2]);
printf("%d%c", (c ? -p[a] : p[a]), " \n"[a == n]);
}
void solve() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) scanf("%d", p + i);
reset(dp[1]);
dp[1][0][0] = -n;
dp[1][0][1] = -n;
for (int i = 2; i <= n; i++) {
reset(dp[i]);
for (int j = 0; j < 2; j++)
for (int k = 0; k < 2; k++) {
if (dp[i - 1][j][k] == INT_MAX) continue;
int x = p[i - 1], y = dp[i - 1][j][k];
if (k) x = -x;
if (j) swap(x, y);
if (p[i] >= x) {
if (Min(dp[i][0][0], y)) {
pre[i][0][0] = {i - 1, j, k};
}
} else if (p[i] >= y) {
if (Min(dp[i][1][0], x)) {
pre[i][1][0] = {i - 1, j, k};
}
}
if (-p[i] >= x) {
if (Min(dp[i][0][1], y)) {
pre[i][0][1] = {i - 1, j, k};
}
} else if (-p[i] >= y) {
if (Min(dp[i][1][1], x)) {
pre[i][1][1] = {i - 1, j, k};
}
}
}
}
for (int i = 0; i < 2; i++)
for (int j = 0; j < 2; j++) {
if (dp[n][i][j] < INT_MAX) {
puts("YES");
echo(n, i, j);
return;
}
}
puts("NO");
}
int main() {
int _;
scanf("%d", &_);
while (_--) solve();
return 0;
}
| 2,800 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, m;
int main() {
cin >> n >> m;
if (m == 3) {
switch (n) {
case 3:
cout << "0 0\n3 0\n0 3";
break;
case 4:
cout << "0 0\n3 0\n0 3\n 1 1";
break;
case 5:
case 6:
cout << "-1";
break;
}
return 0;
}
for (int i = 0; i < m; i++) cout << i - m << ' ' << i * i << endl;
for (int i = 1; i <= n - m; i++)
cout << i << ' ' << -(n - m - i) * (n - m - i) - 1 << endl;
return 0;
}
| 2,300 | CPP |
#include <bits/stdc++.h>
using namespace std;
int k = 29, x1, x2, x3, t;
int ans1, ans2;
int main() {
bool ok = false;
while (k >= 0) {
if (!ok) {
printf("? %d %d\n", 0 + ans1, 0 + ans2);
fflush(stdout);
scanf("%d", &x1);
ok = 1;
}
printf("? %d %d\n", (1 << k) + ans1, (1 << k) + ans2);
fflush(stdout);
scanf("%d", &x2);
if (x1 == x2) {
if (x1 == 1) {
printf("? %d %d\n", 0 + ans1, (1 << k) + ans2);
fflush(stdout);
scanf("%d", &x3);
} else {
printf("? %d %d\n", ans1 + (1 << k), ans2 + 0);
fflush(stdout);
scanf("%d", &x3);
}
if (x1 == 0) {
if (x3 == 1)
;
else
ans1 |= (1 << k), ans2 |= (1 << k);
t = x1;
} else {
if (x3 != x2)
;
else
ans1 |= (1 << k), ans2 |= (1 << k);
t = x1;
}
} else {
if (x1 == -1 && x2 == 1) {
printf("? %d %d\n", 0 + ans1, (1 << k) + ans2);
ans2 |= (1 << k);
fflush(stdout);
scanf("%d", &x3);
t = x3;
} else {
printf("? %d %d\n", (1 << k) + ans1, 0 + ans2);
ans1 |= (1 << k);
fflush(stdout);
scanf("%d", &x3);
t = x3;
}
}
k--;
x1 = t;
}
printf("! %d %d\n", ans1, ans2);
fflush(stdout);
return 0;
}
| 2,000 | CPP |
for _ in range(int(input())):
l, r = map(int, input().split())
v = 2
while True:
ans = l * v
if ans <= r and (l is not ans):
print(l, ans)
break
elif ans > r:
l += 1
v = l
continue
v += 1 | 800 | PYTHON3 |
t = int(input())
for _ in range(t):
n, m, k = map(int, input().split())
row = list(map(int, input().split()))
flag = True
for i in range(n-1):
if row[i] >= row[i+1]:
m += min(row[i], k+row[i]-row[i+1])
elif row[i+1]-row[i] <= k:
m += min(row[i], row[i]-(row[i+1]-k))
elif (row[i+1]-k)-row[i] <= m:
m -= (row[i+1]-k)-row[i]
else:
flag = False
break
print("YES") if flag else print("NO")
| 1,200 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, temp;
long long tot = 0;
vector<long long> nums(21, 0);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> temp;
nums[temp + 10]++;
}
for (int i = 0; i < 10; i++) {
tot += (nums[i] * nums[20 - i]);
}
if (nums[10] > 0)
;
tot += ((nums[10] * (nums[10] - 1)) / 2);
cout << tot << endl;
return 0;
}
| 1,200 | CPP |
n = int(input())
a = input()
cnt = 0
for i in range(n):
if a[i] == '(':
cnt += 1
r = 0
if cnt == (n>>1):
cnt = 0
i = 0
while i < n:
if a[i] == ')':
cnt -= 1
else:
cnt += 1
if cnt < 0:
for j in range(i+1, n):
if a[j] == ')':
cnt -= 1
else:
cnt += 1
if not cnt:
r += j - i + 1
i = j
break
i += 1
if cnt:
print(-1)
else:
print(r)
else:
print(-1)
| 1,300 | PYTHON3 |
#!/usr/bin/env python3
import os
import sys
from _io import BytesIO
class FastI:
def __init__(self):
self.stream = BytesIO()
self.newlines = 0
def read(self, b=b'\n'):
while b:
b, ptr = os.read(0, (1 << 13) + os.fstat(0).st_size), self.stream.tell()
self.stream.seek(0, 2), self.steram.write(b), self.stream.seek(ptr)
return self.stream.read() if self.stream.tell() else self.stream.getvalue()
def readline(self, b=b'\n'):
while b and self.newlines == 0:
b, ptr = os.read(0, (1 << 13) + os.fstat(0).st_size), self.stream.tell()
self.stream.seek(0, 2), self.stream.write(b), self.stream.seek(ptr)
self.newlines += b.count(b'\n')
self.newlines -= bool(b)
return self.stream.readline()
def readnumbers(self, var=int):
""" Read numbers till EOF. Use var to change type. """
numbers, b = [], self.read()
num, sign = var(0), 1
for char in b:
if char >= b'0' [0]:
num = 10 * num + char - 48
elif char == b'-' [0]:
sign = -1
elif char != b'\r' [0]:
if char == b'\n'[0]:
self.newlines -= 1
numbers.append(sign * num)
num, sign = var(0), 1
if b and b[-1] >= b'0' [0]:
numbers.append(sign * num)
return numbers
def _readnumbers(self, n, var=int):
ptr = self.stream.tell()
self.stream.seek(0, 2)
buffsize = self.stream.tell()
self.stream.seek(ptr)
A = []
num, sign = var(0), 1
while len(A) != n:
# If at end of current buffer
if ptr == buffsize:
s, _ptr = os.read(0, (1 << 13) + os.fstat(0).st_size), self.stream.tell()
self.stream.seek(0, 2), self.stream.write(s), self.stream.seek(_ptr)
buffsize += len(s)
self.newlines += s.count(b'\n') + (not s)
if ptr == buffsize:
break
for i, c in enumerate(self.stream.read(min(19, buffsize - ptr))):
if c >= b'0' [0]:
num = num * 10 + c - 48
elif c == b'-' [0]:
sign = -1
elif c != b'\r' [0]: # whitespace
if c == b'\n' [0]:
self.newlines -= 1
A.append(sign * num)
num, sign = var(0), 1
if len(A) == n:
break
ptr += i + 1
if ptr == buffsize and (self.stream.seek(-1, 2) or True) and self.stream.read(1)[0] >= b'0' [0]:
self.newlines -= 1
A.append(sign * num)
assert (n == -1 or len(A) == n)
self.stream.seek(ptr)
return A
class FastO:
def __init__(self):
stream = BytesIO()
self.flush = lambda: os.write(1, stream.getvalue()) and not stream.truncate(0) and stream.seek(0)
self.write = lambda s: stream.write(s.encode())
sys.stdin, sys.stdout = FastI(), FastO()
input, flush = sys.stdin.readline, sys.stdout.flush
def main():
n, m = map(int, input().split())
c = [0] * n
a = [sys.stdin._readnumbers(2) + [i] for i in range(n)]
for _ in range(m):
x, y = map(int, input().split())
s = min(a[x - 1][0] + a[y - 1][1], a[x - 1][1] + a[y - 1][0])
c[x - 1] -= s
c[y - 1] -= s
a.sort(key=lambda x: x[1] - x[0])
sum_x = sum(i[0] for i in a)
sum_y = 0
for i in range(n):
sum_x -= a[i][0]
c[a[i][2]] += sum_x + ((n - i - 1) * a[i][1]) + sum_y + (i * a[i][0])
sum_y += a[i][1]
print(*c)
if __name__ == '__main__':
main()
| 1,900 | PYTHON3 |
#include <bits/stdc++.h>
int main() {
int flag = 0, i, l;
char str[110000];
scanf("%s", str);
l = strlen(str);
for (i = 0; i <= l / 2; i++) {
if (str[i] != 'A' && str[i] != 'H' && str[i] != 'I' && str[i] != 'M' &&
str[i] != 'O' && str[i] != 'T' && str[i] != 'U' && str[i] != 'V' &&
str[i] != 'W' && str[i] != 'X' && str[i] != 'Y') {
flag = 1;
break;
}
if (str[i] != str[l - 1 - i]) {
flag = 1;
break;
}
}
if (flag)
printf("NO\n");
else
printf("YES\n");
return 0;
}
| 1,000 | CPP |
x = int(input())
if(x%2==0 and x!=2):
print("YES")
else:
print("No")
| 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const long long N = 3e5;
const long long M = 1e4;
const long long mod = 998244353;
const long long inf = 1e9;
long long read() {
long long s = 0;
register bool neg = 0;
register char c = getchar();
for (; c < '0' || c > '9'; c = getchar()) neg |= (c == '-');
for (; c >= '0' && c <= '9'; s = s * 10 + (c ^ 48), c = getchar())
;
s = (neg ? -s : s);
return s;
}
long long a, b, head[N + 5], V[N + 5][21], F[N + 5][21], f[N + 5], g[N + 5],
top, p[N + 5], dep[N + 5];
struct road {
long long lst, v, w;
} s[N * 2 + 5];
void add(long long l1, long long l2, long long l3) {
s[++top] = (road){head[l1], l2, l3};
head[l1] = top;
}
void dfs(long long n, long long fa, long long _w) {
dep[n] = dep[fa] + 1;
F[n][0] = fa;
for (long long i = (1); i <= (20); ++i) F[n][i] = F[F[n][i - 1]][i - 1];
f[n] = p[n];
for (long long i = head[n]; i; i = s[i].lst) {
long long v = s[i].v, w = s[i].w;
if (v == fa) continue;
dfs(v, n, w);
f[n] += max(0ll, f[v] - 2 * w);
}
V[n][0] = f[n] - max(0ll, f[n] - 2 * _w) - _w;
}
void Dfs(long long n, long long fa) {
for (long long i = (1); i <= (20); ++i)
V[n][i] = V[n][i - 1] + V[F[n][i - 1]][i - 1];
for (long long i = head[n]; i; i = s[i].lst) {
long long v = s[i].v, w = s[i].w;
if (v == fa) continue;
g[v] = max(0ll, f[n] + g[n] - max(0ll, f[v] - 2 * w) - 2 * w);
Dfs(v, n);
}
}
long long LCA(long long n, long long m) {
if (dep[n] < dep[m]) swap(n, m);
long long val = 0;
for (long long i = (20); i >= (0); --i)
if (dep[F[n][i]] >= dep[m]) val += V[n][i], n = F[n][i];
if (n == m) return val + f[n] + g[n];
for (long long i = (20); i >= (0); --i)
if (F[n][i] != F[m][i]) {
val += V[n][i] + V[m][i];
n = F[n][i], m = F[m][i];
}
long long lca = F[n][0];
return val + f[lca] + g[lca] + V[n][0] + V[m][0];
}
signed main() {
a = read();
b = read();
for (long long i = (1); i <= (a); ++i) p[i] = read();
long long x, y, z;
for (long long i = (1); i <= (a - 1); ++i) {
x = read();
y = read();
z = read();
add(x, y, z);
add(y, x, z);
}
dfs(1, 0, 0);
Dfs(1, 0);
for (long long i = (1); i <= (b); ++i) {
x = read();
y = read();
printf("%lld\n", LCA(x, y));
}
return 0;
}
| 2,700 | CPP |
m, s = map(int, input().split())
if 9 * m < s: print(-1, -1); exit()
if s == 0 and m > 1: print(-1, -1); exit()
if m == 1: print(s, s); exit()
if m == s / 9: print('9' * (s // 9), '9' * (s // 9)); exit()
st, nd = '', ''
if not s % 9:
n1 = s // 9
if m == n1 + 1:
st += '18' + '9' * (n1 - 1)
nd += '9' * n1 + '0'
else:
n3 = m - n1 - 1
st += '1' + '0' * n3 + '8' + '9' * (n1 - 1)
nd += '9' * n1 + '0' * (n3 + 1)
else:
n1 = s // 9
n2 = s % 9
if m == n1 + 1:
st += str(n2) + '9' * n1
nd += '9' * n1 + str(n2)
else:
if m == n1 + 2:
st += '1' + str(n2 - 1) + '9' * n1
nd += '9' * n1 + str(n2) + '0'
else:
n3 = m - n1 - 1
st += '1' + '0' * (n3 - 1) + str(n2 - 1) + '9' * n1
nd += '9' * n1 + str(n2) + '0' * n3
print(st + ' ' + nd) | 1,400 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
const int NN = 4040040;
const int MM = 303;
int n, m, q;
int a[MM][MM];
int root[MM * MM];
int ans[NN];
int sz[MM * MM];
vector<pii> add[NN], del[NN];
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
bool in(int first, int second) {
return 1 <= first && first <= n && 1 <= second && second <= m;
}
int find_root(int u) { return root[u] == u ? u : root[u] = find_root(root[u]); }
int merge(int a, int b) {
int aa = find_root(a);
int bb = find_root(b);
if (aa == bb) return 0;
if (sz[aa] > sz[bb]) swap(aa, bb);
sz[bb] += sz[aa];
root[aa] = bb;
return 1;
}
void update(vector<pii> vec, int val) {
for (int i = 0; i <= n; i++)
for (int j = 0; j <= m; j++) a[i][j] = 0;
for (int i = 0; i <= n * m; i++) root[i] = i, sz[i] = 1;
for (auto p : vec) {
int res = 1;
int first = p.first / m + 1;
int second = p.first % m + 1;
a[first][second] = 1;
for (int i = 0; i < 4; i++) {
int xx = first + dx[i];
int yy = second + dy[i];
if (in(xx, yy) && a[xx][yy] == 1)
res -= merge((xx - 1) * m + yy - 1, (first - 1) * m + second - 1);
}
ans[p.second] += res * val;
}
}
int main() {
cin >> n >> m >> q;
int mx = 1;
for (int i = 1; i <= q; i++) {
int first, second, c;
scanf("%d %d %d", &first, &second, &c);
if (a[first][second] == c) continue;
mx = c;
add[c].push_back(pii((first - 1) * m + second - 1, i));
del[a[first][second]].push_back(pii((first - 1) * m + second - 1, i));
a[first][second] = c;
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
del[a[i][j]].push_back(pii((i - 1) * m + j - 1, q + 1));
}
}
for (int i = 0; i <= mx; i++) reverse(del[i].begin(), del[i].end());
for (int i = 0; i <= mx; i++) update(add[i], 1);
for (int i = 0; i <= mx; i++) update(del[i], -1);
int res = 1;
for (int i = 1; i <= q; i++) {
res += ans[i];
printf("%d\n", res);
}
}
| 2,800 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
const long long mod = (long long)998244353;
long long pot[N], cnt[N], s[N], s2[N], sp[N], dp[N];
vector<int> q21joe21i[N];
int m;
long long fpot(long long x, long long y) {
if (!y) return 1;
long long pa = fpot(x, y / 2);
if (y & 1) return ((pa * pa) % mod) * x % mod;
return pa * pa % mod;
}
int32_t main() {
pot[0] = 1;
for (int i = 1; i < N; i++) {
pot[i] = (pot[i - 1] * 2) % mod;
for (int j = i; j < N; j += i) q21joe21i[j].push_back(i);
}
scanf("%d", &m);
for (int i = 0; i < m; i++) {
long long a, b;
scanf("%lld%lld", &a, &b);
long long sq = a * a % mod * b % mod;
long long sq2 = a * a % mod * (b * (b - 1) % mod) % mod;
for (auto w : q21joe21i[a]) {
cnt[w] += b;
sp[w] = (sp[w] + sq2 + (((2 * a * b) % mod) * s[w])) % mod;
s[w] = (s[w] + a * b) % mod;
s2[w] = (s2[w] + sq) % mod;
}
}
for (int i = N - 1; i >= 0; i--) {
if (cnt[i]) {
long long t = cnt[i];
long long fa = (t > 2 ? fpot(2, t - 3) : 0),
af = (t > 1 ? fpot(2, t - 2) : 0);
if (t > 1) {
dp[i] = (dp[i] + (((af * ((t - 1) % mod)) % mod) * s2[i]) % mod) % mod;
dp[i] = (dp[i] + (af * sp[i]) % mod) % mod;
}
if (t > 2) {
dp[i] = (dp[i] + (((fa * ((t - 2) % mod)) % mod) * sp[i]) % mod) % mod;
}
for (int j = 2 * i; j < N; j += i) {
dp[i] = ((dp[i] - dp[j]) % mod + mod) % mod;
}
}
}
printf("%lld\n", dp[1]);
}
| 2,800 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
int a, b;
cin >> a >> b;
if (a == b) {
cout << "infinity";
return 0;
}
if (a < b) {
cout << 0;
return 0;
}
int u = 0;
int i = a - b;
for (int j = 1; j <= sqrt(i); j++) {
if ((i % j) == 0) {
if ((a % j) == b) u++;
if (j == sqrt(i)) continue;
if ((a % (i / j)) == b) u++;
}
}
cout << u;
}
| 1,600 | CPP |
import sys
input=sys.stdin.readline
n=int(input())
a=[int(i) for i in input().split() if i!='\n']
a.sort()
ans=[0]*(n)
j=0
for i in range(1,n,2):
ans[i]=a[j]
j+=1
for i in range(n):
if ans[i]==0:
ans[i]=a[j]
j+=1
count=0
for i in range(1,n-1):
if ans[i-1]>ans[i] and ans[i+1]>ans[i]:
count+=1
print(count)
print(*ans)
| 1,500 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, f[110000], tot[110000], ans = 110000, t;
char s[110000];
int main() {
scanf("%d", &n);
scanf("%s", s);
for (int i = 0; i < n; i++) {
if (!f[s[i]]) t++;
f[s[i]] = 1;
}
memset(tot, 0, sizeof(tot));
int st = 0, ed = 1;
tot[s[0]] = 1;
while (ed <= n) {
int cnt = 0;
for (char i = 'a'; i <= 'z'; i++)
if (tot[i]) cnt++;
for (char i = 'A'; i <= 'Z'; i++)
if (tot[i]) cnt++;
if (cnt < t) {
tot[s[ed]]++;
ed++;
} else {
ans = min(ans, ed - st);
tot[s[st]]--;
st++;
}
}
cout << ans << endl;
}
| 1,500 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 10;
struct dot {
long long x, y;
} p[N];
long long cross(dot a, dot b) { return a.x * b.y - a.y * b.x; }
long long a[N], b[N], n, d[N], r;
bool comp(dot a, dot b) {
if (a.x == b.x) return a.y > b.y;
return a.x > b.x;
}
dot operator-(dot a, dot b) { return (dot){a.x - b.x, a.y - b.y}; }
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
int x, y;
scanf("%d%d", &x, &y);
p[i].x = x;
p[i].y = y - (long long)x * x;
}
sort(p + 1, p + n + 1, comp);
d[r = 1] = 1;
for (int i = 2; i <= n; i++) {
if (p[i].x == p[i - 1].x) continue;
while (r > 1 && cross(p[d[r - 1]] - p[d[r]], p[i] - p[d[r]]) >= 0) r--;
d[++r] = i;
}
cout << r - 1 << endl;
}
| 2,400 | CPP |
#include <bits/stdc++.h>
using namespace std;
vector<int> v;
int main() {
int n;
cin >> n;
int i;
for (i = 1; i <= n; i++) {
int x;
cin >> x;
v.push_back(x);
}
sort(v.begin(), v.end());
int t = 10;
int cnt = 0;
int p = 0;
for (int x : v) {
if (t + x <= 720) {
t += x;
cnt++;
if (t > 360) p += t - 360;
}
}
cout << cnt << " " << p << "\n";
return 0;
}
| 1,800 | CPP |
#include <bits/stdc++.h>
int main() {
int n;
unsigned long long int ans = 1, tmp = 1;
scanf("%d", &n);
for (int i = n + 4; i > n - 1; --i) tmp *= i;
tmp /= 120;
ans *= tmp;
tmp = 1;
for (int i = n + 2; i > n - 1; --i) tmp *= i;
tmp /= 6;
ans *= tmp;
printf("%I64u\n", ans);
return 0;
}
| 1,600 | CPP |
#include <bits/stdc++.h>
using namespace std;
void solve() {
int k, cnt1 = 0, cnt2 = 0;
cin >> k;
while (k--) {
int x, y;
cin >> x >> y;
if (x > 0)
++cnt1;
else
++cnt2;
}
if ((cnt1 >= 1 && cnt2 <= 1) || (cnt2 >= 1 && cnt1 <= 1))
cout << "Yes" << endl;
else
cout << "No" << endl;
return;
}
int main() {
int t = 1;
while (t--) solve();
return 0;
}
| 800 | CPP |
r,d=map(int,input().split())
r-=d
n=int(input())
k=0
for _ in range(n):
x,y,h=map(int,input().split())
l=(x**2+y**2)**(1/2)
if l-h>=r and l+h<=r+d:
k+=1
print(k) | 1,100 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
double dis(double x, double y, double x2, double y2) {
return sqrt((x - x2) * (x - x2) + (y - y2) * (y - y2));
}
long long Mod(long long x) {
long long M = 1e9 + 7;
return (x % M + M) % M;
}
long long gcd(long long a, long long b) { return (b == 0 ? a : gcd(b, a % b)); }
long long lcm(long long a, long long b) { return (a * (b / gcd(a, b))); }
long long bigmod(long long b, long long p, long long m) {
if (p == 0) return 1;
if (p % 2 == 0) {
long long temp = bigmod(b, p / 2, m);
return (temp * temp) % m;
}
return (bigmod(b, p - 1, m) * (b % m)) % m;
}
vector<vector<int> > v;
vector<bool> visited;
int dfs(int node) {
visited[node] = 1;
for (int i = 0; i < (int)v[node].size(); i++) {
if (!visited[v[node][i]]) dfs(v[node][i]);
}
}
int connectedcomponenetscnt(int head) {
int cnt = 0;
for (int i = 1; i < 500; i++) {
if (!visited[i]) {
dfs(i);
cnt++;
}
}
return cnt;
}
int main() {
int n, m;
string s;
cin >> n >> m;
char a[n][m];
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++) cin >> a[i][j];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
int yes = 1;
for (int k = 0; k < n; k++)
if (k != i && a[k][j] == a[i][j]) yes = 0;
for (int k = 0; k < m; k++)
if (k != j && a[i][k] == a[i][j]) yes = 0;
if (yes) s += a[i][j];
}
}
cout << s;
}
| 1,100 | CPP |
#include <bits/stdc++.h>
const int MAXN = 1000005;
const int MAXL = 6000005;
const int MAXLOGN = 21;
int n, r, c;
int totl;
char str[MAXL];
int id[MAXL];
int pos[MAXN];
int next[MAXN];
int goright[MAXLOGN][MAXN];
void init() {
scanf("%d%d%d\n", &n, &r, &c);
++c;
fgets(str, MAXL, stdin);
int now = 0;
for (int i = 0; i < n; ++i) {
pos[i] = now;
while (true) {
id[now] = i;
++now;
if (str[now - 1] == ' ' || str[now - 1] == '\n') break;
}
}
totl = now;
id[totl] = n;
pos[n] = totl;
}
void solve() {
for (int i = 0; i < n; ++i) {
int nx = pos[i] + c;
if (nx > totl) nx = totl;
next[i] = id[nx];
}
next[n] = n;
for (int i = 0; i <= n; ++i) goright[0][i] = next[i];
for (int i = 1; i < MAXLOGN; ++i)
for (int j = 0; j <= n; ++j)
goright[i][j] = goright[i - 1][goright[i - 1][j]];
int ans = -1;
int ansp;
for (int i = 0; i < n; ++i) {
int xx = i;
for (int j = 0; j < MAXLOGN; ++j)
if ((r >> j) & 1) xx = goright[j][xx];
if (xx - i > ans) {
ans = xx - i;
ansp = i;
}
}
for (int i = 0, x = ansp; i < r; ++i) {
int y = next[x];
if (x == y) break;
printf("%.*s\n", pos[y] - pos[x] - 1, str + pos[x]);
x = y;
}
}
int main() {
init();
solve();
return 0;
}
| 2,100 | CPP |
t = int(input())
for _ in range(t):
a,b,c,n = map(int, input().split(' '))
l = [a,b,c]
l.sort()
n = n - (l[-1]-l[0])
n = n - (l[-1]-l[1])
if n<0 or n%3!=0:
print('NO')
else:
print('YES') | 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
long long count = 0;
for (int i = 0; i < n; i++) {
if (s[i] == 'B') count += pow(2, i);
}
cout << count << endl;
return 0;
}
| 0 | CPP |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.