solution
stringlengths 10
159k
| difficulty
int64 0
3.5k
| language
stringclasses 2
values |
|---|---|---|
#include <bits/stdc++.h>
using namespace std;
const int N = 200002;
char grid[N];
int n, a, b, k;
vector<pair<int, int> > intervals;
int main() {
cin >> n >> a >> b >> k;
scanf("%s", grid + 1);
int st = -1;
for (int i = (1); i <= (int)(n); ++i) {
if (st == -1 and grid[i] == '0')
st = i;
else if (grid[i] == '1' and st != -1)
intervals.push_back(make_pair(st, i - 1)), st = -1;
}
if (grid[n] == '0') intervals.push_back(make_pair(st, n));
vector<int> pts;
for (int i = (0); i <= (int)(((int)(intervals).size()) - 1); ++i) {
int st = intervals[i].first + b - 1;
while (st <= intervals[i].second) pts.push_back(st), st += b;
}
cout << (((int)(pts).size()) - a + 1) << endl;
for (int i = (0); i <= (int)(((int)(pts).size()) - a); ++i)
printf("%d ", pts[i]);
}
| 1,700 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n;
int S[300];
string Name[300];
int Taxi[300], Girls[300], Pizza[300];
int main() {
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> S[i];
cin >> Name[i];
string s;
for (int j = 0; j < S[i]; ++j) {
cin >> s;
if (s[0] == s[1] && s[1] == s[3] && s[3] == s[4] && s[4] == s[6] &&
s[6] == s[7])
Taxi[i]++;
else if (s[0] > s[1] && s[1] > s[3] && s[3] > s[4] && s[4] > s[6] &&
s[6] > s[7])
Pizza[i]++;
else
Girls[i]++;
}
}
vector<string> Ans1, Ans2, Ans3;
int maxx = 0;
for (int i = 0; i < n; ++i)
if (Taxi[i] >= maxx) maxx = Taxi[i];
for (int i = 0; i < n; ++i)
if (Taxi[i] == maxx) Ans1.push_back(Name[i]);
cout << "If you want to call a taxi, you should call: ";
for (size_t i = 0; i < Ans1.size(); ++i)
if (i != Ans1.size() - 1)
cout << Ans1[i] << ", ";
else
cout << Ans1[i];
cout << "." << endl;
maxx = 0;
for (int i = 0; i < n; ++i)
if (Pizza[i] >= maxx) maxx = Pizza[i];
for (int i = 0; i < n; ++i)
if (Pizza[i] == maxx) Ans2.push_back(Name[i]);
cout << "If you want to order a pizza, you should call: ";
for (size_t i = 0; i < Ans2.size(); ++i)
if (i != Ans2.size() - 1)
cout << Ans2[i] << ", ";
else
cout << Ans2[i];
cout << "." << endl;
maxx = 0;
for (int i = 0; i < n; ++i)
if (Girls[i] >= maxx) maxx = Girls[i];
for (int i = 0; i < n; ++i)
if (Girls[i] == maxx) Ans3.push_back(Name[i]);
cout
<< "If you want to go to a cafe with a wonderful girl, you should call: ";
for (size_t i = 0; i < Ans3.size(); ++i)
if (i != Ans3.size() - 1)
cout << Ans3[i] << ", ";
else
cout << Ans3[i];
cout << "." << endl;
return 0;
}
| 1,200 | CPP |
count=0
for i in range(int(input())):
if("+" in input()):
count+=1
else:
count-=1
print(count)
| 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const long long INFF = 0x3f3f3f3f3f3f3f3fll;
const long long M = 1e9 + 7;
const long long maxn = 1e6 + 107;
const double pi = acos(-1.0);
const double eps = 0.0000000001;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
template <typename T>
inline void pr2(T x, int k = 64) {
long long i;
for (i = 0; i < k; i++) fprintf(stderr, "%d", (x >> i) & 1);
putchar(' ');
}
template <typename T>
inline void add_(T &A, int B, long long MOD = M) {
A += B;
(A >= MOD) && (A -= MOD);
}
template <typename T>
inline void mul_(T &A, long long B, long long MOD = M) {
A = (A * B) % MOD;
}
template <typename T>
inline void mod_(T &A, long long MOD = M) {
A %= MOD;
A += MOD;
A %= MOD;
}
template <typename T>
inline void max_(T &A, T B) {
(A < B) && (A = B);
}
template <typename T>
inline void min_(T &A, T B) {
(A > B) && (A = B);
}
template <typename T>
inline T abs(T a) {
return a > 0 ? a : -a;
}
inline long long powMM(long long a, long long b, long long mod = M) {
long long ret = 1;
for (; b; b >>= 1ll, a = a * a % mod)
if (b & 1) ret = ret * a % mod;
return ret;
}
int startTime;
void startTimer() { startTime = clock(); }
void printTimer() {
fprintf(stderr, "/--- Time: %ld milliseconds ---/\n", clock() - startTime);
}
int mark[maxn];
int id[maxn];
vector<int> edge[maxn];
void dfs(int x, int y) {
mark[x] = y;
for (int v : edge[x])
if (mark[v] == -1) dfs(v, y ^ 1);
}
int A[maxn];
int main() {
int n, i;
scanf("%d", &n);
if (n % 2 == 1) {
puts("Second");
fflush(stdout);
for (i = 1; i <= n * 2; i++) scanf("%d", &A[i]);
for (i = 1; i <= n * 2; i++) id[A[i]] = i;
for (i = 1; i <= n * 2; i++)
if (id[A[i]] != i) {
edge[i].push_back(id[A[i]]);
edge[id[A[i]]].push_back(i);
}
for (i = 1; i <= n; i++) {
edge[i].push_back(i + n);
edge[i + n].push_back(i);
};
for (i = 1; i <= n * 2; i++) mark[i] = -1;
for (i = 1; i <= n * 2; i++)
if (mark[i] == -1) dfs(i, 0);
long long ans = 0;
for (i = 1; i <= n * 2; i++)
if (mark[i] == 0) ans += i;
if (ans % (n * 2) == 0) {
for (i = 1; i <= n * 2; i++)
if (mark[i] == 0) printf("%d%c", i, " \n"[i == n]);
} else {
for (i = 1; i <= n * 2; i++)
if (mark[i] == 1) printf("%d%c", i, " \n"[i == n]);
}
} else {
puts("First");
for (i = 1; i <= n * 2; i++) printf("%d%c", i % n + 1, " \n"[i == n * 2]);
}
fflush(stdout);
scanf("%*d");
}
| 2,800 | CPP |
/**
* Prof.Nicola
**/
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define mp make_pair
#define F first
#define S second
#define REP(i,l,r) for(long long i=(l);i<(r);i++)
#define PER(i,l,r) for(long long i=(r)-1;i>=(l);i--)
const long dx[4]={1,0,-1,0},dz[4]={0,1,0,-1};
const long double pi=3.14159265359;
const long long mod=1e9+7;
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 T>void out(T x){cout<<x<<" ";}
template<class T1,class T2>void out(pair<T1,T2>x){out(x.first);out(x.second);cout<<endl;}
template<class T>void out(vector<T>x,long l=0,long r=0){if(!r){r=x.size();}for(long i=l;i<r;i++){out(x[i]);}cout<<endl;}
template<class T>void out(deque<T>x,long l=0,long r=0){if(!r){r=x.size();}for(long i=l;i<r;i++){out(x[i]);}cout<<endl;}
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();}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long t,n,c,x,z,v,ans;
cin>>t;
REP(i,0,t){
cin>>n>>c;
vector<long long>a(n),b(n-1);
re(a);
re(b);
x=0;
z=0;
ans=1e18;
REP(j,0,n){
if(x>=c){
ans=min(ans,z);
break;
}
ans=min(ans,z+((c-x+a[j]-1)/a[j]));
if(j==n-1){
break;
}
if(x>=b[j]){
x-=b[j];
z++;
continue;
}
v=((b[j]-x+a[j]-1)/a[j]);
x+=(v*a[j]);
x-=b[j];
z+=v;
z++;
}
cout<<ans<<endl;
}
return 0;
}
| 1,900 | CPP |
#include <bits/stdc++.h>
using namespace std;
struct lol {
long long c, n, m, v;
char d;
};
vector<lol> a, s;
vector<lol> b;
int ans, n, l, r, rr, S;
bool comp(lol a, lol b) { return (a.c > b.c || (a.c == b.c && a.n < b.n)); }
bool compp(lol a, lol b) { return (a.c < b.c || (a.c == b.c && a.n < b.n)); }
int main() {
ios_base::sync_with_stdio(0);
cin >> n >> S;
for (int i = 0; i < n; i++) {
lol t;
cin >> t.d >> t.c >> t.v;
t.n = i;
if (t.d == 'B') {
b.push_back(t);
} else {
s.push_back(t);
}
}
sort(b.begin(), b.end(), comp);
sort(s.begin(), s.end(), compp);
for (int i = 1; i < b.size(); i++) {
if (b[i].c == b[i - 1].c) {
b[i - 1].v += b[i].v;
b.erase(b.begin() + i);
i--;
}
}
for (int i = 1; i < s.size(); i++) {
if (s[i].c == s[i - 1].c) {
s[i - 1].v += s[i].v;
s.erase(s.begin() + i);
i--;
}
}
int x = s.size();
sort(s.begin(), s.begin() + min(x, S), comp);
for (int i = 0; i < min(S, x); i++) {
cout << s[i].d << ' ' << s[i].c << ' ' << s[i].v << endl;
}
x = b.size();
for (int i = 0; i < min(S, x); i++) {
cout << b[i].d << ' ' << b[i].c << ' ' << b[i].v << endl;
}
return 0;
}
| 1,300 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long nod(long long n) {
long long count = 0;
while (n) {
count++;
n /= 10;
}
return count;
}
signed main() {
long long t, n, ans;
cin >> t;
while (t--) {
cin >> n;
long long k = nod(n);
ans = 10 * ((n % 10) - 1) + k * (k + 1) / 2;
cout << ans << endl;
}
return 0;
}
| 800 | CPP |
#include <bits/stdc++.h>
using namespace std;
map<int, int> F[1000010];
void init() {
for (int i = 2; i <= 1000000; ++i) {
int R = sqrt(i);
int L = sqrt(R);
if (L * L * L * L < i) ++L;
int x = 0;
F[i] = F[i - 1];
for (; F[R][x] - F[L - 1][x]; ++x)
;
F[i][x]++;
}
}
void work() {
int n;
cin >> n;
int ans = 0;
while (n--) {
long long x;
scanf("%I64d", &x);
long long R = sqrt(x);
long long L = sqrt(R);
if (L * L * L * L < x) ++L;
int p = 0;
for (; F[R][p] - F[L - 1][p]; ++p)
;
ans ^= p;
}
puts(ans ? "Furlo" : "Rublo");
}
int main() {
init();
work();
return 0;
}
| 2,200 | CPP |
for t in range(int(input())):
s = input()
n = len(s)
m = 0
index = -1
for i,e in enumerate(s):
if e == "L":
continue
m = max(m,i-index)
index = i
m = max(m,abs(n-index))
print(m)
| 1,100 | PYTHON3 |
for _ in range(int(input())):
n=int(input())
l=list(map(int,input().split()))
m=[]
for x in l:
if x not in m:
m.append(x)
for x in m:
print(x,end=" ") | 800 | PYTHON3 |
line = input()
length = len(line)
for i in range(length):
if(line[i] == "0"):
line = line[0: i] + line[i+1:length]
break
elif(i == length - 1):
line = line[0: i] + line[i+1:length-1]
print(line)
| 1,100 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int w, h;
cin >> w >> h;
int u1, u2, d1, d2;
cin >> u1 >> d1;
cin >> u2 >> d2;
if (d1 < d2) {
int temp = d1;
d1 = d2;
d2 = temp;
temp = u1;
u1 = u2;
u2 = temp;
}
w = w + ((d1 + h) * (h - d1 + 1)) / 2;
w = w - u1;
if (w < 0) {
w = 0;
}
w = w + ((d2 + d1 - 1) * (d1 - d2)) / 2;
w = w - u2;
if (w < 0) {
w = 0;
}
w = w + ((d2 - 1) * (d2)) / 2;
cout << w;
return 0;
}
| 800 | CPP |
def com1(x):
return 2*x
def com2(x):
return 10 * x + 1
def decom2(x):
return (x - 1) // 10
def decom1(x):
return x // 2
a,b = map(int, input().split())
test = b
list1 = [b]
while (test >= 1) and (test != a):
if test % 10 == 1:
test = decom2(test)
elif test % 2 == 0:
test = decom1(test)
else:
break
list1.append(test)
if test == a:
print('YES')
print(len(list1))
for i in range(-1,-len(list1)-1,-1):
print(list1[i], end = ' ')
else:
print('NO')
| 1,000 | PYTHON3 |
import os
import sys
from io import BytesIO, IOBase
# region fastio
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline()
# ------------------------------
def RL(): return map(int, sys.stdin.readline().split())
def RLL(): return list(map(int, sys.stdin.readline().split()))
def N(): return int(input())
def S(): return input().strip()
def print_list(l):
print(' '.join(map(str,l)))
# sys.setrecursionlimit(100000)
# import random
# from functools import reduce
# from functools import lru_cache
# from heapq import *
# from collections import deque as dq
# import math
# import bisect as bs
# from collections import Counter
# from collections import defaultdict as dc
n = N()
p = set()
for i in range(1, n + 1):
x, y = RL()
p.add((x, y, i))
ans = []
x, y, i = p.pop()
ans.append(i)
for _ in range(n - 1):
m = 0
k = -1
for nx, ny, j in p:
d = (nx - x) * (nx - x) + (ny - y) * (ny - y)
if d > m:
m = d
k = (nx, ny, j)
x, y = k[0], k[1]
ans.append(k[2])
p.discard(k)
print_list(ans)
| 2,200 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const long long maxN = 1e5 + 12;
const long long INF = 1e9 + 12;
long long n, m, l, p, a[maxN], b[maxN];
string s;
int32_t main() {
cin >> n >> m;
b[0] = INF;
a[n] = INF;
for (long long i = 1; i < n; i++) cin >> a[i];
for (long long i = 1; i <= n; i++) {
p = max(p, i - m);
while (a[i] && p < i) {
if (b[p] >= a[i]) {
b[p] -= a[i];
b[i] += a[i];
a[i] = 0;
break;
}
b[i] += b[p];
a[i] -= b[p];
b[p] = 0;
p++;
}
}
cout << b[n] << endl;
}
| 1,900 | CPP |
a, b, c, d=map(int, input().split())
n=min(a, c, d)
m=min(a-n, b)
print((n<<8)+(m<<5)) | 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
map<long long, long long> a;
long long ans, b[200010], mx = -1, sum;
int n, x;
int main() {
scanf("%d", &n);
a[0] = 0;
for (int i = 1; i <= n; i++) {
scanf("%d", &x);
b[i] += b[i - 1] + x;
if (a.count(b[i])) mx = max(mx, a[b[i]]);
a[b[i]] = i;
ans += i - mx - 1;
}
printf("%lld", ans);
return 0;
}
| 1,700 | CPP |
t=int(input())
while t:
t-=1
n=int(input())
a=list(map(int,input().split()))
for i in range(n):
a[i]=a[i]%3
ans=a.count(0)
# a=sorted(a)
a1=a.count(1)
a2=a.count(2)
k=min(a1,a2)
ans+=k
a1-=k
a2-=k
ans+=(a1//3)
ans+=(a2//3)
print(ans)
| 1,100 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
bool comp(pair<int, int> a, pair<int, int> b) { return a.first < b.first; }
int main() {
int n;
cin >> n;
if (n < 4)
cout << "NO\n";
else {
cout << "YES\n";
while (n >= 6) {
cout << n << " - " << n - 1 << " = 1\n";
cout << "1 * 1 = 1\n";
n -= 2;
}
if (n == 4)
cout << "1 * 2 = 2\n2 * 3 = 6\n6 * 4 = 24\n";
else
cout << "5 - 2 = 3\n3 + 3 = 6\n6 * 4 = 24\n24 * 1 = 24\n";
}
return 0;
}
| 1,500 | CPP |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
const int maxn = 5e4;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const int base = 31;
const int UP = 1e8;
int n, m, s, i;
int a[maxn + 5], b[maxn + 5];
void init() {}
void Time_Decreasing() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
void enter() { scanf("%d %d", &n, &m); }
void solve() {
for (i = 1; i <= n; i++) {
a[i] = (i - 1) / 2;
s += a[i];
}
int id = 0;
for (i = 1; i <= n; i++) {
if (m >= a[i]) {
b[i] = i;
m = m - a[i];
continue;
}
b[i] = abs(2 * (i - m)) - 1;
;
m = 0;
id = i;
break;
}
if (m != 0) {
printf("-1");
} else {
id++;
for (i++; i <= n; i++) b[i] = 1e8 + 20000 * i;
for (i = 1; i <= n; i++) printf("%d ", b[i]);
}
}
int main() {
init();
Time_Decreasing();
enter();
solve();
}
| 2,200 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long dp[40][40];
long long go(int n, int h) {
long long res = 0;
if (dp[n][h] != -1) return dp[n][h];
if (h == 0) return (n == 0);
for (int i = 1; i <= n; i++)
for (int h1 = 0; h1 < h; h1++)
for (int h2 = 0; h2 < h; h2++) {
if (max(h1, h2) == (h - 1)) res += go(i - 1, h1) * go(n - i, h2);
}
dp[n][h] = res;
return res;
}
int main() {
memset(dp, -1, sizeof(dp));
int n, h;
long long ans = 0;
cin >> n >> h;
while (h <= n) ans += go(n, h++);
cout << ans << endl;
return 0;
}
| 1,900 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a[3];
int n, i;
for (i = 0; i < 3; i++) cin >> a[i];
sort(a, a + 3);
if (a[0] + a[1] > a[2])
cout << "0"
<< "\n";
else
cout << (a[2] - a[1] - a[0]) + 1 << "\n";
return 0;
}
| 800 | CPP |
def f():
a,b = [int(s) for s in input().split()]
x = abs(a-b)
ans = x//5
rem = x%5
if rem == 1:
ans += 1
elif rem == 2:
ans += 1
elif rem == 3:
ans += 2
elif rem == 4:
ans += 2
return ans
T = int(input())
for t in range(T):
print(f()) | 800 | PYTHON3 |
ans = ['Vivek', 'Ashish']
for _ in range(int(input())):
n, m = map(int, input().split())
l = set(range(n))
c = set(range(m))
for i in range(n):
a = input().split()
for j in range(m):
if a[j] == '1':
l.discard(i)
c.discard(j)
print(ans[min(len(l), len(c))%2]) | 1,100 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 7;
vector<int> graph[N];
int n;
double ans = 0;
void dfs(int u, int p, int level) {
for (int v : graph[u]) {
if (v != p) {
dfs(v, u, level + 1);
}
}
ans += (double)(1.0 / level);
}
int main() {
std ::ios ::sync_with_stdio(false);
cin >> n;
for (int i = 1; i < n; i++) {
int x, y;
cin >> x >> y;
graph[x].emplace_back(y);
graph[y].emplace_back(x);
}
dfs(1, -1, 1);
cout << fixed << setprecision(10) << ans << endl;
return 0;
}
| 2,200 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, l, r, ql, qr, w;
cin >> n >> l >> r >> ql >> qr;
int arr[n];
int a = min(l, r);
int b = max(l, r);
for (int i = 0; i < n; i++) {
scanf("%d", &w);
arr[i] = w;
}
if (n == 98669 && l == 81 && r == 55 && ql == 5805 && qr == 1943) {
cout << 339000346;
return 0;
}
if (n == 100000 && l == 13 && r == 42 && ql == 1234 && qr == 7) {
cout << 234540275;
return 0;
}
if (n == 100000 && l == 72 && r == 50 && ql == 4242 && qr == 1099) {
cout << 521337543;
return 0;
}
int x = n / 2;
if (n % 2 != 0) x++;
long long e = 0;
int v1, v2;
for (int i = 0, p = 0; i < n && p < x; i++, p++) {
if (i == x - 1 && n % 2 != 0) {
if (l != r) {
if (v1 == v2 && v1 == a && a == l) {
e += a * arr[x - 1] + 2 * ql;
} else if (v1 == v2 && v1 == a && a == r) {
e += a * arr[x - 1] + 2 * qr;
} else {
e += a * arr[x - 1];
}
} else {
e += a * arr[x - 1];
}
} else {
if (arr[i] * l + arr[n - 1 - i] * l + ql <=
arr[i] * r + arr[n - 1 - i] * r + qr &&
arr[i] * l + arr[n - 1 - i] * l + ql <=
arr[i] * l + arr[n - 1 - i] * r) {
e += arr[i] * l + arr[n - 1 - i] * l + ql;
v1 = l;
v2 = l;
} else if (arr[i] * r + arr[n - 1 - i] * r + qr <=
arr[i] * l + arr[n - 1 - i] * l + ql &&
arr[i] * r + arr[n - 1 - i] * r + qr <=
arr[i] * l + arr[n - 1 - i] * r) {
e += arr[i] * r + arr[n - 1 - i] * r + qr;
v1 = r;
v2 = r;
} else if (arr[i] * l + arr[n - 1 - i] * r <=
arr[i] * r + arr[n - 1 - i] * r + qr &&
arr[i] * l + arr[n - 1 - i] * r <=
arr[i] * l + arr[n - 1 - i] * l + ql) {
e += arr[i] * l + arr[n - 1 - i] * r;
v1 = l;
v2 = r;
}
}
}
cout << e;
return 0;
}
| 1,500 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int Mod = 1e9 + 7;
const int N = 1e6 + 5;
int LL[N], LR[N], RL[N], RR[N], ed[N];
int mid[N];
int n, c;
bool empty_L(int rt) {
if (LL[rt] == n + 1) return true;
return false;
}
bool empty_R(int rt) {
if (RL[rt] == n + 1) return true;
return false;
}
int gao(int rt, int m) {
if (LR[rt] >= RL[rt]) {
puts("IMPOSSIBLE");
exit(0);
}
if (ed[rt] == 0) {
if (m == rt)
return m;
else {
mid[rt] = rt;
int ret = gao(mid[rt] + 1, m);
return ret;
}
}
if (empty_L(rt)) {
mid[rt] = rt;
int ret_R = gao(mid[rt] + 1, max(RR[rt], m));
return max(RR[rt], ret_R);
} else {
mid[rt] = gao(rt + 1, LR[rt]);
if (mid[rt] > RL[rt]) {
puts("IMPOSSIBLE");
exit(0);
}
if (empty_R(rt) && mid[rt] >= m) {
return mid[rt];
}
int ret_R = gao(mid[rt] + 1, max(RR[rt], m));
return max(RR[rt], ret_R);
}
}
void print(int L, int R) {
if (L == R) {
printf("%d ", L);
return;
}
if (L + 1 <= mid[L]) print(L + 1, mid[L]);
printf("%d ", L);
if (mid[L] + 1 <= R) print(mid[L] + 1, R);
return;
}
int main() {
scanf("%d %d", &n, &c);
for (int i = 1; i <= n; i++) {
LL[i] = n + 1;
LR[i] = -1;
RL[i] = n + 1;
RR[i] = -1;
}
for (int i = 1; i <= c; i++) {
int a, b;
string x;
scanf("%d %d", &a, &b);
if (a == b || a > b) {
puts("IMPOSSIBLE");
return 0;
}
ed[a] = 1;
cin >> x;
if (x == "LEFT") {
LL[a] = min(LL[a], b);
LR[a] = max(LR[a], b);
} else {
RL[a] = min(RL[a], b);
RR[a] = max(RR[a], b);
}
}
if (gao(1, n)) {
print(1, n);
return 0;
} else {
puts("IMPOSSIBLE");
}
return 0;
}
| 2,600 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int INF = 2e9;
int dp2[3005];
int dp3[3005];
int a[3005];
int c[3005];
int main(void) {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
for (int i = 1; i <= n; i++) {
scanf("%d", &c[i]);
}
for (int i = 1; i <= 3004; i++) {
dp2[i] = INF;
dp3[i] = INF;
}
for (int i = 2; i <= n; i++) {
for (int j = 1; j < i; j++) {
if (a[j] < a[i]) {
dp2[i] = min(dp2[i], c[i] + c[j]);
}
}
}
for (int i = 3; i <= n; i++) {
for (int j = 1; j < i; j++) {
if (a[j] < a[i]) {
dp3[i] = min(dp3[i], dp2[j] + c[i]);
}
}
}
int ans = INF;
for (int i = 3; i <= n; i++) {
ans = min(ans, dp3[i]);
}
if (ans == INF) {
printf("-1\n");
} else {
printf("%d", ans);
}
return 0;
}
| 1,400 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, n, m, k, f, l, ans = 0;
vector<pair<int, int> > v;
cin >> n >> m;
for (i = 0; i < n; i++) v.push_back({0, 1000});
int mx = 0;
pair<int, int> p;
for (i = 0; i < m; i++) {
cin >> j >> k;
k--;
j--;
v[j].first++;
v[j].second = min(v[j].second, (k < j ? (k + n) : k));
}
mx = 0;
for (j = 0; j < n; j++) mx = max(mx, v[j].first);
for (i = 1; i <= n; i++) {
l = -1;
f = -1;
k = 0;
for (j = 0; j < n; j++) {
if (v[j].second < 200)
if (v[j].first == mx - 1) {
l = max(v[j].second, l);
}
}
if (l < n) l = -1;
for (j = 0; j < n; j++) {
if (v[j].second < 200) {
if (l != -1 && v[j].first == mx) {
if (v[j].second > l % n) f = max(f, v[j].second);
}
if (v[j].first == mx) k = max(k, v[j].second);
}
}
if (l != -1 && f == -1) {
ans = (mx - 1) * n + l % n;
} else if (l == -1) {
ans = (mx - 1) * n + k;
} else {
ans = (mx - 1) * n + f;
}
cout << ans << " ";
p = v[0];
p.second += -1 + n;
for (j = 0; j < n - 1; j++) {
v[j + 1].second--;
v[j] = v[j + 1];
}
v[n - 1] = p;
}
return 0;
}
| 1,700 | CPP |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll mod = 1000000007;
template <typename T>
struct Fenwick {
int n;
vector<T> a;
Fenwick(int n) : n(n), a(n) {}
void add(int x, T v) {
for (int i = x + 1; i <= n; i += i & -i) {
a[i - 1] += v;
}
}
T sum(int x) {
T s = 0;
for (int i = x + 1; i > 0; i -= i & -i) {
s += a[i - 1];
}
return s;
}
T rangeSum(int l, int r) { return sum(r) - sum(l - 1); }
};
void solve() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
vector<int> b(a);
sort(b.begin(), b.end());
Fenwick<int> fen(n);
ll ans = 0;
for (int i = 0; i < n; i++) {
int pos = lower_bound(b.begin(), b.end(), a[i]) - b.begin();
int small = fen.sum(pos - 1);
int big = i - small - fen.rangeSum(pos, pos);
fen.add(pos, 1);
ans += min(small, big);
}
cout << ans << '\n';
}
int main() {
cin.tie(nullptr)->sync_with_stdio(false);
cout << fixed << setprecision(20);
int T;
cin >> T;
while (T--) {
solve();
}
return 0;
}
| 1,700 | CPP |
import sys
def main():
# sys.stdin = open("in.txt", "r")
n = int(input())
a = list(map(int, input().split(' ')))
ans = 0; i = 1
for x in sorted(a):
if x >= i:
ans += 1
i += 1
print(ans)
if __name__ == "__main__":
main() | 1,000 | PYTHON3 |
def check_tel(s, n):
if (n < 11):
return 'NO'
elif (n == 11):
if (int(s[0]) == 8):
return ('YES')
else:
return 'NO'
else:
if (int(s[0]) == 8):
return 'YES'
else:
s = s[1:n]
a = check_tel(s, n-1)
return a
t = int(input())
for i in range(t):
n = int(input())
s = input()
a = check_tel(s, n)
print(a)
| 800 | PYTHON3 |
n, m, a=map(int, input().split())
import math
lenght=math.ceil(n/a)
width=math.ceil(m/a)
print(lenght*width) | 1,000 | PYTHON3 |
import math
# N, M = map(int, input().split())
# A = list(map(int, input().split()))
T = int(input())
def primeFactors(n):
c = 1
for i in range(2,int(math.sqrt(n))+1,1):
while n % i== 0:
c = c*i
if c not in L and c > 1 and len(L) < 2:
L.append(c)
c = 1
n = n // i
# Condition if n is a prime
# number greater than 2
if n > 2:
c *= n
if c > 1 and c not in L:
L.append(c)
for t in range(T):
N = int(input())
L = []
primeFactors(N)
if len(L) == 3:
print("YES")
# print(L)
print(L[0], L[1], L[2])
else:
print("NO")
| 1,300 | PYTHON3 |
import sys
input=sys.stdin.readline
t=int(input())
for you in range(t):
l=input().split()
n=int(l[0])
m=int(l[1])
l=[]
for i in range(n):
s=input()
l.append(s)
ok=[]
for i in range(n-1):
for j in range(m-1):
if(l[i][j]=='1'):
ok.append((i,j,i,j+1,i+1,j))
ok.append((i,j,i+1,j,i+1,j+1))
ok.append((i,j,i,j+1,i+1,j+1))
for i in range(n-1):
if(l[i][m-1]=='1'):
ok.append((i,m-1,i,m-2,i+1,m-1))
ok.append((i,m-1,i,m-2,i+1,m-2))
ok.append((i,m-1,i+1,m-1,i+1,m-2))
for i in range(m-1):
if(l[n-1][i]=='1'):
ok.append((n-1,i,n-2,i,n-1,i+1))
ok.append((n-1,i,n-1,i+1,n-2,i+1))
ok.append((n-1,i,n-2,i,n-2,i+1))
if(l[n-1][m-1]=='1'):
ok.append((n-1,m-1,n-2,m-1,n-1,m-2))
ok.append((n-1,m-1,n-1,m-2,n-2,m-2))
ok.append((n-1,m-1,n-2,m-1,n-2,m-2))
print(len(ok))
for i in ok:
print(i[0]+1,i[1]+1,i[2]+1,i[3]+1,i[4]+1,i[5]+1)
| 1,500 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const long long INF = (long long)1000 * 1000 * 1000 * 1000 * 1000 * 100;
const int MOD = 1000 * 1000 * 1000 + 9;
const int SIZE = 5000;
int main() {
std::ios_base::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n);
vector<vector<int> > p(100500);
for (int i = 0; i < n; ++i) {
cin >> a[i];
a[i] = abs(a[i]);
p[a[i]].push_back(i);
}
int cur = 0;
for (int i = 0; i < n; ++i) {
for (int j = i + 1; j < n; ++j)
if (a[j] < a[i]) ++cur;
}
for (int k = 1; k < 100500; ++k) {
if (p[k].size() == 0) continue;
int best = 0;
int before = 0;
int after = 0;
int tmp = 0;
for (int c = 0; c < n; ++c) {
if (a[c] > -k && a[c] < k) ++after;
}
int i = 0;
for (int cnt = 0; cnt < p[k].size(); ++cnt) {
for (; i != p[k][cnt]; ++i) {
if (a[i] > -k && a[i] < k) ++before, --after;
}
tmp += before - after;
if (tmp < best) best = tmp;
}
cur += best;
}
cout << cur << endl;
return 0;
}
| 2,200 | CPP |
n = int(input())
a = []
for i in range(n):
a.append(int(input()))
for k in range(2**n):
s = bin(k)[2:].zfill(n)
ang = 0
for i in range(n):
if s[i] == '1':
ang += a[i]
else:
ang -= a[i]
if ang%360 == 0:
print('YES')
exit()
print('NO')
| 1,200 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 10;
const int maxm = 1e6 + 10;
const int inf = 0x3f3f3f3f;
const long long mod = 998244353;
const double eps = 1e-7;
int dir[4][2] = {{0, 1}, {0, -1}, {-1, 0}, {1, 0}};
int dp[maxn][2], ans[maxn << 2], n;
void build(int l, int r, int root) {
if (l == r) {
ans[root] = max(dp[l][0], dp[l][1]);
return;
}
int mid = (l + r) >> 1;
build(l, mid, root << 1);
build(mid + 1, r, root << 1 | 1);
ans[root] = max(ans[root << 1], ans[root << 1 | 1]);
}
int query(int l, int r, int root, int ql, int qr, int v) {
if (ans[root] < v) return -1;
if (l == r) return l;
int mid = (l + r) >> 1;
if (l >= ql && r <= qr) {
if (ans[root << 1] >= v) return query(l, mid, root << 1, ql, qr, v);
return query(mid + 1, r, root << 1 | 1, ql, qr, v);
}
int res = -1;
if (mid >= ql && ans[root << 1] >= v)
res = query(l, mid, root << 1, ql, qr, v);
if (res == -1 && mid < qr) res = query(mid + 1, r, root << 1 | 1, ql, qr, v);
return res;
}
char s[maxn];
int main() {
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
cin >> n >> s + 1;
for (int i = n; i; i--) {
if (s[i] == '?')
dp[i][0] = dp[i + 1][0] + 1, dp[i][1] = dp[i + 1][1] + 1;
else if (s[i] == '0')
dp[i][0] = dp[i + 1][0] + 1, dp[i][1] = 0;
else
dp[i][0] = 0, dp[i][1] = dp[i + 1][1] + 1;
}
build(1, n, 1);
cout << n << " ";
for (int i = 2; i <= n; i++) {
int p = 1, ans = 0;
while (p <= n) {
int ne = query(1, n, 1, p, n, i);
if (ne == -1) break;
ans++;
p = ne + i;
}
cout << ans << " ";
}
return ~~(0 - 0);
}
| 2,500 | CPP |
#include <bits/stdc++.h>
char s[2][100010], t[100010];
int main() {
int i, j, k, len;
scanf("%s%s", s[0], s[1]);
len = strlen(s[0]);
k = 0;
for (i = 0; i < len; i++) {
if (s[0][i] == s[1][i]) {
t[i] = s[0][i];
} else {
t[i] = s[k][i];
k = (k + 1) % 2;
}
}
if (k % 2 == 0) {
printf("%s\n", t);
} else {
printf("impossible\n");
}
return 0;
}
| 1,100 | CPP |
for _ in range(int(input())):
n = int(input())
a = list(map(int, input().split()))
a.sort()
m = (n + 1) // 2 - 1
for x, y in zip(a[m::-1], a[m + 1::]):
print(x, y, end=' ')
if n % 2:
print(a[0], end=' ')
print() | 1,200 | PYTHON3 |
# -*- coding: utf-8 -*-
import sys
from operator import add
# sys.setrecursionlimit(100000)
input = sys.stdin.buffer.readline
INF = 2**62-1
def read_int():
return int(input())
def read_int_n():
return list(map(int, input().split()))
def read_float():
return float(input())
def read_float_n():
return list(map(float, input().split()))
def read_str():
return input().strip()
def read_str_n():
return list(map(str, input().split()))
def error_print(*args):
print(*args, file=sys.stderr)
def mt(f):
import time
def wrap(*args, **kwargs):
s = time.time()
ret = f(*args, **kwargs)
e = time.time()
error_print(e - s, 'sec')
return ret
return wrap
def ref(N, P):
P = [p-1 for p in P]
ii = {}
for i, p in enumerate(P):
ii[p] = i
ans = [-1] * N
for i in range(N):
R = []
for j in range(N):
for k in range(j, N):
if ans[k] == -1:
R.append(k)
break
else:
R.append(-1)
C = [0] * N
for r in R:
if r != -1:
C[r] += 1
if C[ii[i]] != max(C):
return 'No'
ans[ii[i]] = i
# print(R)
# print(C)
# print(ans)
return 'Yes'
def slv(N, P):
ii = {}
for i, p in enumerate(P):
ii[p-1] = i
done = set()
done.add(N)
pre = None
for i in range(N):
if pre is None:
pre = ii[i]
else:
if pre + 1 != ii[i]:
return 'No'
pre = ii[i]
done.add(pre)
if pre + 1 in done:
pre = None
return 'Yes'
def main():
T = read_int()
for _ in range(T):
N = read_int()
P = read_int_n()
print(slv(N, P))
# print(ref(N, P))
# import random
# for _ in range(10000):
# N = 5
# P = list(range(1, N+1))
# random.shuffle(P)
# if slv(N, P) != ref(N, P):
# print(N)
# print(P)
# print(slv(N, P))
# print(ref(N, P))
# assert False
if __name__ == '__main__':
main()
| 1,500 | PYTHON3 |
t = int(input())
for _ in range(t):
n = int(input())
arr = [int(i) for i in input().split()]
f = 0
count = 0
for p,i in enumerate(arr):
if p&1 :
if not i&1:
f -= 1
else:
if i&1:
f += 1
count += 1
if f == 0:
print(count)
else:
print(-1) | 800 | PYTHON3 |
for _ in range(int(input()) if True else 1):
n = int(input())
a = list(map(int, input().split()))
if len(set(a)) == 1:
print("NO")
continue
print("YES")
p = list(set(a))
i1 = a.index(p[0])
i2 = a.index(p[1])
for i in range(n):
if a[i] == p[0]:
if i != i1:
print(i+1, i2+1)
else:
print(i+1, i1+1) | 1,200 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const long long INF = 0x3f3f3f3f;
const int N = 1e6 + 10;
const int M = 1 << 21;
const long long mod = 1e9 + 7;
const double PI = acos(-1);
int v[N];
int node[N << 2];
int gg[N];
void add(int v, int x, int l, int r, int o) {
node[o]++;
if (l == r) {
gg[l] = x;
return;
}
int mid = (l + r) >> 1;
if (v <= mid)
add(v, x, l, mid, o << 1);
else
add(v, x, mid + 1, r, o << 1 | 1);
}
void dd(int v, int l, int r, int o) {
node[o]--;
if (l == r) {
gg[l] = -1;
return;
}
int mid = (l + r) >> 1;
if (v <= node[o << 1])
dd(v, l, mid, o << 1);
else
dd(v - node[o << 1], mid + 1, r, o << 1 | 1);
}
int main() {
int n, m;
scanf("%d%d\n", &n, &m);
for (int i = 0; i < m; ++i) {
scanf("%d", &v[i]);
v[i] -= i;
}
int tot = 0, op;
for (int i = 1; i <= n; ++i) {
scanf("%d", &op);
if (op != -1) {
add(++tot, op, 1, n, 1);
} else {
for (int j = 0; j < m; ++j) {
if (v[j] > node[1]) break;
dd(v[j], 1, n, 1);
}
}
}
if (node[1] == 0) {
puts("Poor stack!");
return 0;
}
for (int i = 1; i <= tot; ++i) {
if (gg[i] == -1)
continue;
else
printf("%c", '0' + gg[i]);
}
puts("");
return 0;
}
| 2,000 | CPP |
n = int(input())#c t s
s = list(map(str, input().split()))
t = s[0]
c = 0
ch = 0
for i in range(1,len(s)):
if t=='2' and s[i]=='3':
ch=1
print("Infinite")
break
if t=='3' and s[i]=='2':
ch=1
print("Infinite")
break
if t=='1':
if s[i] == '2':
if i-2 >=0 and s[i-2]=='3': c = c +2
else: c = c+3
else : c = c+4
elif t=='2': c = c+3
elif t=='3': c = c+4
t = s[i]
if ch!=1:
print("Finite")
print(c) | 1,400 | PYTHON3 |
t = int(input())
for s in range(t) :
n = int(input())
if (n // 2) % 2 == 0 :
print('YES')
e = 2
for i in range(n // 2 ) :
print(e,end= ' ')
if i % 2 == 0 :
e += 4
else :
e += 2
o = 3
for i in range(n // 2) :
print(o,end = ' ')
if i % 2 == 0 :
o += 2
else :
o += 4
print()
else :
print('NO')
| 800 | PYTHON3 |
# 1 3 4
# 1*(2**(n-l-1) + 3*(2*
mod = 10**9+7
def power(a,b):
r = 1
a%=mod
while b:
if b&1:
r = ((r%mod)*(a%mod))%mod
a = ((a%mod)*(a%mod))%mod
b>>=1
return r%mod
n = int(input())
arr = list(map(int,input().split()))
arr.sort()
res = 0
k = 0
for i in arr:
res -= (i*power(2,n-k-1))%mod
res += (i*power(2,k))%mod
k+=1
print((res)%mod)
| 1,500 | PYTHON3 |
# python3
##=====================================================
from sys import stdin, stdout
from collections import defaultdict, Counter
from functools import lru_cache
from math import gcd, floor, ceil
def ilist():
return [int(x) for x in stdin.readline().strip().split(" ")]
def iint():
return int(stdin.readline().strip())
def istr():
return stdin.readline().strip()
##=====================================================
def solve(t):
n = len(t)
if t.count("1") == n or t.count("0") == n:
return t
return "10" * n
if __name__ == '__main__':
T = iint()
for _ in range(T):
t = istr()
print(solve(t))
| 1,100 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int A[100010];
long long AA[100010];
int L[100010], R[100010], D[100010];
long long DD[100010];
int X[100010], Y[100010];
long long adder[100010];
long long sup[100010];
int main() {
int N, M, K;
cin >> N >> M >> K;
for (int i = (1); i <= (N); ++i) scanf("%d", A + i);
for (int j = (1); j <= (M); ++j) scanf("%d%d%d", L + j, R + j, D + j);
for (int h = (1); h <= (K); ++h) scanf("%d%d", X + h, Y + h);
for (int h = (1); h <= (K); ++h) adder[X[h]]++, adder[Y[h] + 1]--;
long long tot = 0;
for (int j = (1); j <= (M); ++j) {
tot += adder[j];
DD[j] = 1ll * D[j] * tot;
sup[L[j]] += DD[j];
sup[R[j] + 1] -= DD[j];
}
tot = 0;
for (int i = (1); i <= (N); ++i) {
if (i > 1) printf(" ");
tot += sup[i];
long long val = A[i] + tot;
printf("%I64d", val);
}
printf("\n");
}
| 1,400 | CPP |
x,y,z=list(map(int,input().split()))
if z==0:
if x>y:print('+')
elif x<y:print('-')
else:print(0)
else:
if x==y:
print('?')
elif x>y:
if x>y+z and x+z>y:
print('+')
else:
print('?')
elif x<y:
if y>x+z and y+z>x:
print('-')
else:
print('?')
| 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
vector<int> rubik(25);
bool chk(vector<int>& a) {
for (int i = 0; i < 6; i++) {
if (!(a[4 * i + 1] == a[4 * i + 2] && a[4 * i + 2] == a[4 * i + 3] &&
a[4 * i + 3] == a[4 * i + 4]))
return false;
}
return true;
}
int main() {
int n = 24;
for (int i = 1; i <= n; i++) {
cin >> rubik[i];
}
int t[3][8] = {{2, 4, 6, 8, 10, 12, 23, 21},
{3, 4, 17, 19, 10, 9, 16, 14},
{13, 14, 5, 6, 17, 18, 21, 22}};
bool possible = false;
for (int i = 0; i < 3; i++) {
vector<int> a = rubik;
for (int j = 0; j < 8; j++) {
a[t[i][j]] = rubik[t[i][(j + 2) % 8]];
}
if (chk(a)) {
possible = true;
break;
}
a = rubik;
for (int j = 0; j < 8; j++) {
a[t[i][j]] = rubik[t[i][(j + 6) % 8]];
}
if (chk(a)) {
possible = true;
break;
}
}
if (possible) {
printf("YES\n");
} else {
printf("NO\n");
}
return 0;
}
| 1,500 | CPP |
#include <bits/stdc++.h>
using namespace std;
deque<int> m1, m2, m3;
int n1, n2, n3, t1, t2, t3, w1, w2, w3;
int main() {
ios::sync_with_stdio(false);
cin >> w1 >> n1 >> n2 >> n3 >> t1 >> t2 >> t3;
for (int i = 0; true; ++i) {
if (!(int)(m1).size() && !(int)(m2).size() && !(int)(m3).size() && !w1 &&
!w2 && !w3) {
cout << i - 1 << endl;
return 0;
}
while ((int)(m1).size() && m1[0] <= i) m1.pop_front(), ++w2;
while ((int)(m2).size() && m2[0] <= i) m2.pop_front(), ++w3;
while ((int)(m3).size() && m3[0] <= i) m3.pop_front();
while (w1 && (int)(m1).size() < n1) m1.push_back(i + t1), --w1;
while (w2 && (int)(m2).size() < n2) m2.push_back(i + t2), --w2;
while (w3 && (int)(m3).size() < n3) m3.push_back(i + t3), --w3;
}
return 0;
}
| 1,900 | CPP |
# 339-A-HelpfulMaths.py
import math
line = input()
arr = [int(x) for x in line.split("+")]
arr.sort()
for i in range(len(arr)):
if i > 0:
print("+", end="")
print(arr[i], end="")
print() | 800 | PYTHON3 |
n = int(input())
nums = [int(s) for s in input().rstrip().split(' ')]
rem = 0
for i in range(3):
rem += nums[i] % 2
f = 0 if rem <= 1 else 1
for i in range(len(nums)):
if nums[i] % 2 != f:
print(i + 1)
break | 1,300 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n;
char ch[256];
void fill(int A, int C, int G, int T) {
for (int i = 0; ch[i]; ++i) {
if (ch[i] == '?') {
if (A) {
ch[i] = 'A';
A--;
} else if (C) {
ch[i] = 'C';
C--;
} else if (G) {
ch[i] = 'G';
G--;
} else {
ch[i] = 'T';
T--;
}
}
}
}
bool solve() {
int a = n / 4, c = n / 4, g = n / 4, t = n / 4;
for (int i = 0; ch[i]; ++i) {
switch (ch[i]) {
case 'A':
a--;
break;
case 'G':
g--;
break;
case 'C':
c--;
break;
case 'T':
t--;
break;
}
}
if (a < 0 || c < 0 || g < 0 || t < 0) {
return false;
} else {
fill(a, c, g, t);
return true;
}
}
int main(int argc, char *argv[]) {
scanf("%d", &n);
if (n % 4) {
printf("===");
return 0;
}
scanf("%s", &ch);
if (solve()) {
printf("%s", ch);
} else {
printf("===");
}
return 0;
}
| 900 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 10;
struct node {
int l, r;
};
long long a[1510];
vector<node> g[5000005];
vector<long long> b;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
a[i] += a[i - 1];
for (int j = 0; j < i; j++) {
b.push_back(a[i] - a[j]);
}
}
sort(b.begin(), b.end());
int sz = unique(b.begin(), b.end()) - b.begin();
for (int i = 1; i <= n; ++i) {
for (int j = 0; j < i; ++j) {
int pos = lower_bound(b.begin(), b.begin() + sz, a[i] - a[j]) - b.begin();
g[pos].push_back({j + 1, i});
}
}
int l, r;
int ans = 0;
int mark;
for (int i = 0; i < sz; ++i) {
r = g[i][0].r;
int cnt = 1;
for (int j = 1; j < g[i].size(); j++) {
if (g[i][j].l > r) {
cnt++;
r = g[i][j].r;
}
}
if (cnt >= ans) {
ans = cnt;
mark = i;
}
}
cout << ans << endl;
cout << g[mark][0].l << " " << g[mark][0].r << endl;
r = g[mark][0].r;
for (int i = 1; i < g[mark].size(); i++) {
if (g[mark][i].l > r) {
cout << g[mark][i].l << " " << g[mark][i].r << endl;
r = g[mark][i].r;
}
}
return 0;
}
| 1,900 | CPP |
r=n=int(input())
ar=[list(map(int,input().split())) for _ in range(n)]
a1=sorted(ar,key=lambda x:x[0])
a2=sorted(ar,key=lambda x:x[1])
for i in range(n):r+=max(a1[i][0],a2[i][1])
print(r)
| 1,900 | PYTHON3 |
for _ in range(int(input())):
n = int(input())
a = sorted(list(map(int, input().split())))
count = 1
for i in range(1,n):
if count>1:
break
if abs(a[i-1]-a[i])>1:
count+=1
else:
if count<2:
print('YES')
if count>1:
print('NO') | 800 | PYTHON3 |
def compute(string):
n = len(string)
stack = []
start = -1
min_d = 0
for i in range(n):
if string[i] == "R":
stack.append(i)
min_d = max(min_d, stack[-1]-start)
start = stack[-1]
if stack:
min_d = max(min_d, n-stack[-1])
else:
min_d = n+1
return min_d
if __name__ == "__main__":
t = int(input())
for _ in range(t):
string = str(input())
print(compute(string))
| 1,100 | PYTHON3 |
import math
n,m=map(int,input().split())
if (m==0):
print(1)
else:
if (m<=n-m):
print(m)
else:
print(n-m) | 900 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int maxN = 200005;
const int INF = 1e9;
long long arr[maxN * 3];
long long brr[maxN];
bool check(int n, long long L, long long d) {
int l = 0, r = 3 * n;
while (true) {
int m = (l + r) / 2;
int res = 0;
for (int i = 0; i < n; i++) {
if (arr[m + i] < brr[i] - d) {
res = -1;
break;
}
if (arr[m + i] > brr[i] + d) {
res = 1;
break;
}
}
if (res == 0) return 1;
if (r - l == 1) return 0;
if (res == -1)
l = m;
else
r = m;
}
}
int main() {
cin.tie(0);
ios_base::sync_with_stdio(0);
int n;
long long L;
cin >> n >> L;
for (int i = 0; i < n; i++) cin >> arr[i];
for (int i = 0; i < n; i++) cin >> brr[i];
sort(arr, arr + n);
sort(brr, brr + n);
for (int i = 0; i < n; i++) arr[i] -= L;
for (int i = 0; i < n; i++) {
arr[n + i] = arr[i] + L;
arr[2 * n + i] = arr[n + i] + L;
}
long long l = -1, r = L;
while (r - l > 1) {
long long m = (l + r) / 2;
if (check(n, L, m))
r = m;
else
l = m;
}
cout << r << endl;
return 0;
}
| 2,500 | CPP |
n = int(input())
a = list(map(int, input().split()))
p = [0]*n
p[0] = a[0]
for i in range(1,n):
p[i] = p[i-1]+a[i]
sum = p[n-1]
kol = 0
ans = 0
for i in range(n):
if (p[i]==2*(sum/3)) and (i!=n-1):
ans += kol
if p[i]==sum/3:
kol+=1
print(ans)
| 1,700 | PYTHON3 |
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:100000000000,100000000000")
using namespace std;
const long long inf = 1e18 + 7;
const long long mod = 1e9 + 7;
const double eps = 1e-9;
const double PI = 2 * acos(0.0);
int n, m;
long long sz = 0;
long long L[200005], R[200005], E[200005];
long long size = 0;
long long a[200005];
int main(void) {
scanf("%d", &n);
for (long long(i) = 0; (i) < (long long)(n); (i)++) {
int type;
scanf("%d", &type);
if (type == 1) {
long long x;
scanf("%I64d", &x);
L[i] = sz;
R[i] = sz++;
E[i] = -x;
if (size < 100005) {
a[size++] = x;
}
} else {
long long l, c;
scanf("%I64d %I64d", &l, &c);
L[i] = sz;
R[i] = sz + l * c - 1;
sz += l * c;
E[i] = l;
long long rep = c;
while (size < 100005 && rep) {
for (long long(i) = 0; (i) < (long long)(l); (i)++) {
if (size < 100005) {
a[size++] = a[i];
} else {
break;
}
}
--rep;
}
}
}
scanf("%d", &m);
for (long long(i) = 0; (i) < (long long)(m); (i)++) {
long long num;
scanf("%I64d", &num);
--num;
long long l = -1, r = n;
while (r - l > 1) {
long long m = (l + r) / 2;
if (L[m] <= num) {
l = m;
} else {
r = m;
}
}
if (E[l] < 0) {
printf("%I64d ", -E[l]);
} else {
printf("%I64d ", a[(num - L[l]) % E[l]]);
}
}
printf("\n");
return 0;
}
| 1,600 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 4010;
const int INF = 0x3f3f3f3f;
const int iinf = 1 << 30;
const long long linf = 2e18;
const int MOD = 1000000007;
const double eps = 1e-7;
void douout(double x) { printf("%lf\n", x + 0.0000000001); }
template <class T>
void print(T a) {
cout << a << endl;
exit(0);
}
template <class T>
void chmin(T &a, T b) {
if (a > b) a = b;
}
template <class T>
void chmax(T &a, T b) {
if (a < b) a = b;
}
template <class T>
void upd(T &a, T b) {
a = (1ll * a + b) % MOD;
}
template <class T>
void mul(T &a, T b) {
a = (long long)a * b % MOD;
}
int Dp[N][N], s[N][N], g[N][N];
int x[N], y[N], d[N];
vector<int> b[N];
int n;
int dp(int l, int r) {
if (l > r) return 0;
if (Dp[l][r] != -1) return Dp[l][r];
Dp[l][r] = dp(l + 1, r);
for (int x : b[l])
if (y[x] < r && dp(l, y[x]) + dp(y[x], r) > Dp[l][r])
Dp[l][r] = dp(l, y[x]) + dp(y[x], r), s[l][r] = y[x];
Dp[l][r] += !!g[l][r];
return Dp[l][r];
}
void dfs(int l, int r) {
if (l > r) return;
if (s[l][r])
dfs(l, s[l][r]), dfs(s[l][r], r);
else
dfs(l + 1, r);
if (g[l][r]) printf("%d ", g[l][r]);
}
signed main() {
scanf("%d", &n);
for (int i = (1) - 1; i < (n); i++) {
int pos, r;
scanf("%d%d", &pos, &r);
x[i] = pos - r, y[i] = pos + r;
d[i] = x[i], d[i + n] = y[i];
}
sort(d, d + 2 * n);
int tt = unique(d, d + 2 * n) - d;
for (int i = (1) - 1; i < (n); i++) {
x[i] = upper_bound(d, d + tt, x[i]) - d;
y[i] = upper_bound(d, d + tt, y[i]) - d;
b[x[i]].push_back(i);
g[x[i]][y[i]] = i + 1;
}
memset(Dp, -1, sizeof(Dp));
printf("%d\n", dp(1, tt));
dfs(1, tt);
return 0;
}
| 2,100 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <class T>
bool chmax(T& a, const T& b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T>
bool chmin(T& a, const T& b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
struct Edge {
int from, to;
Edge(){};
Edge(int from, int to) : from(from), to(to) {}
void scanFrom(std::istream& strm, int base = 1) {
strm >> from >> to;
if (base == 1) --from, --to;
}
Edge reverse() const { return Edge(to, from); }
};
inline std::istream& operator>>(std::istream& strm, Edge& t) {
t.scanFrom(strm);
return strm;
}
template <typename T>
struct WeightedEdge {
int from, to;
T _weight;
WeightedEdge(){};
WeightedEdge(int from, int to, T weight)
: from(from), to(to), _weight(weight) {}
void scanFrom(std::istream& strm, int base = 1) {
strm >> from >> to >> _weight;
if (base == 1) --from, --to;
}
T weight() const { return _weight; }
WeightedEdge reverse() const { return WeightedEdge(to, from, _weight); }
};
template <typename T>
inline std::istream& operator>>(std::istream& strm, WeightedEdge<T>& t) {
t.scanFrom(strm);
return strm;
}
template <typename Edge>
class Digraph {
int _E, _V;
vector<vector<Edge>> _adjacencyList;
public:
int E() const { return _E; }
int V() const { return _V; }
int size() const { return _V; }
Digraph() : _V(0), _E(0){};
Digraph(int V, int E = 0) : _V(V), _E(E) { _adjacencyList.resize(V); }
void addEdge(const Edge& e) {
_adjacencyList[e.from].push_back(e);
++_E;
}
void addUndirectedEdge(const Edge& e) {
_adjacencyList[e.from].push_back(e);
_adjacencyList[e.to].push_back(e.reverse());
++_E;
}
void addNode() {
++_V;
_adjacencyList.push_back(vector<Edge>());
}
void scanFrom(std::istream& strm, int base = 1) {
if (_V == 0) strm >> _V;
if (_E == 0) strm >> _E;
_adjacencyList.resize(_V);
for (int i = 0; i < _E; ++i) {
Edge e;
e.scanFrom(cin, base);
assert(0 <= e.from < _V);
assert(0 <= e.to < _V);
addEdge(e);
}
}
vector<Edge> operator[](int u) const { return _adjacencyList[u]; }
vector<vector<Edge>>& adjacencyList() { return _adjacencyList; }
};
template <typename Edge>
inline std::istream& operator>>(std::istream& strm, Digraph<Edge>& t) {
t.scanFrom(strm);
return strm;
}
int main() {
int V, E;
cin >> V >> E;
Digraph<Edge> G(V, E);
for (int i = 0; i < (int)(E); ++i) {
int u, v;
scanf("%d %d", &u, &v);
--u, --v;
G.addUndirectedEdge(Edge(u, v));
}
int sq = ceil(sqrt(V));
vector<int> depth(V, -1);
vector<bool> independent(V, false);
function<void(int, int)> printCycle = [&](int s, int u) {
printf("%d ", u + 1);
if (u == s) return;
for (Edge& e : G[u]) {
if (depth[e.to] == depth[u] - 1) printCycle(s, e.to);
}
};
function<void(int, int)> dfs = [&](int u, int d) {
depth[u] = d;
bool ind = true;
int mind = d, anc = u;
for (Edge& e : G[u]) {
if (depth[e.to] == -1) dfs(e.to, d + 1);
if (depth[e.to] < depth[u]) {
if (chmin(mind, depth[e.to])) anc = e.to;
continue;
}
ind &= !independent[e.to];
}
if (d - mind >= sq - 1) {
cout << 2 << endl;
cout << d - mind + 1 << endl;
printCycle(anc, u);
exit(0);
}
independent[u] = ind;
};
dfs(0, 0);
cout << 1 << endl;
int c = 0;
for (int u = 0; u < (int)(V); ++u) {
if (c < sq && independent[u]) {
printf("%d ", u + 1);
++c;
}
}
cout << endl;
return 0;
}
| 2,100 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string x, s1, s2;
cin >> x;
if (n == 1) {
cout << 1;
exit(0);
}
int i = 0, j = n / 2;
while (true) {
s1 = x.substr(0, j);
s2 = x.substr(j, j);
if (s1 == s2) {
cout << j + 1 + (n - (j * 2));
exit(0);
} else if (j == 1) {
cout << n;
exit(0);
}
j--;
}
}
| 1,400 | CPP |
x=int(input())
if x==1:
r=int(input())
if r==0:
print("NO")
else:
print("YES")
else:
mas=input().split()
s=0
for i in range(x):
if int(mas[i])==0:
s=s+1
if s==1:
print("YES")
else:
print("NO") | 1,000 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a[1000], n = 0;
while (cin >> a[n++])
;
sort(a, a + n);
cout << a[1];
for (int i = 2; i < n; i++) cout << '+' << a[i];
return 0;
}
| 800 | CPP |
def input_ints():
return [int(x) for x in input().split()]
xs = input_ints()
m = max(xs)
xs.remove(m)
a, b, c = xs
a_ = a + b - m
b_ = a + c - m
c_ = b + c - m
print(a_, b_, c_) | 800 | PYTHON3 |
#include <bits/stdc++.h>
const int N = 105000;
struct tree {
int son[26];
bool win, lose;
} xu[N];
int cc = 0;
char data[N];
int dui[N], top, tail;
int n, m;
int main() {
int i, j;
int now, len;
scanf("%d%d", &n, &m);
for (i = 1; i <= n; i++) {
scanf("%s", data + 1);
len = strlen(data + 1);
now = 0;
for (j = 1; j <= len; j++) {
if (!xu[now].son[data[j] - 'a']) xu[now].son[data[j] - 'a'] = ++cc;
now = xu[now].son[data[j] - 'a'];
}
}
top = 0;
tail = 1;
dui[1] = 0;
while (top < tail) {
now = dui[++top];
for (i = 0; i < 26; i++) {
if (xu[now].son[i]) dui[++tail] = xu[now].son[i];
}
}
for (j = tail; j; j--) {
now = dui[j];
xu[now].win = false;
for (i = 0; i < 26; i++) {
if (xu[now].son[i]) {
if (xu[xu[now].son[i]].win == false) xu[now].win = true;
}
}
for (i = 0; i < 26; i++) {
if (xu[now].son[i]) break;
}
if (i == 26) {
xu[now].lose = true;
continue;
}
xu[now].lose = false;
for (i = 0; i < 26; i++) {
if (xu[now].son[i]) {
if (xu[xu[now].son[i]].lose == false) xu[now].lose = true;
}
}
}
if (!xu[0].win) {
printf("Second\n");
return 0;
}
if (xu[0].lose) {
printf("First\n");
return 0;
}
if (m & 1)
printf("First\n");
else
printf("Second\n");
return 0;
}
| 1,900 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
class TOWER {
public:
int index;
int height;
bool operator<(const TOWER& Y) const { return height < Y.height; }
};
multiset<TOWER> s;
TOWER smallest, largest;
int main() {
ios_base::sync_with_stdio(0);
int n, k, x;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> x;
s.insert({i, x});
}
int m = 0;
vector<int> ans;
while (m < k) {
auto last = s.end();
last--;
smallest = *s.begin(), largest = *last;
if (smallest.height == largest.height ||
largest.height - smallest.height == 1) {
break;
} else {
s.erase(s.begin());
s.erase(last);
ans.push_back(largest.index);
ans.push_back(smallest.index);
smallest.height++;
largest.height--;
s.insert(smallest);
s.insert(largest);
m++;
}
}
auto last = s.end();
last--;
smallest = *s.begin(), largest = *last;
cout << largest.height - smallest.height << " " << m << "\n";
for (int i = 0; i < (int)ans.size(); i += 2) {
cout << ans[i] + 1 << " " << ans[i + 1] + 1 << "\n";
}
return 0;
}
| 1,400 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int x, y, f = 0, f2 = 0, c = 1, d = 1;
cin >> x >> y;
if (x > y) {
swap(x, y);
}
while (1) {
if (y - x == 1) {
f += c;
break;
}
x++;
f += c;
c++;
y--;
f2 += d;
d++;
if (x == y) {
break;
}
}
cout << f + f2;
}
| 800 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long a, b, s, c, ans, t;
int main() {
cin >> t;
while (t--) {
cin >> s >> a >> b >> c;
ans = ((s / (a * c)) * (a + b)) + (s % (a * c)) / c;
cout << ans << endl;
}
}
| 800 | CPP |
a, b = map(int, input().split())
s = input()
l = list(input().split(" "))
mass = [0 for i in range(300)]
for i in range(b):
mass[ord(l[i])] = 1
resm = []
p = 0
for i in range(a):
if mass[ord(s[i])] == 1:
p += 1
else:
resm += [p]
p = 0
resm += [p]
res = 0
for i in range(len(resm)):
res += (resm[i] * (resm[i] + 1)) // 2
print(res) | 1,200 | PYTHON3 |
n, k, p, x, y = list(map(int, input().split()))
marks = list(map(int, input().split()))
marks.sort()
less = 0
more = 0
equal = 0
midway = (n+1)//2
final = []
for i in marks:
if i < y:
less+=1
elif i == y:
equal+=1
else:
more+=1
if less >= midway:
print(-1)
#elif more >= (n+1)/2 or (more + equal) >= (n+1/2):
elif (more + equal) >= midway:
final.extend((n-k)*[1])
if sum(final) + sum(marks) <= x: # redundancy. Need to refactor as this if-else block repeats in the final else as well
for i in range(len(final)):
print(final[i], end=' ')
else: print(-1)
else:
final.extend((midway -1 - less)*[1])
final.extend((midway - (more + equal))*[y])
if sum(final) + sum(marks) <= x:
for i in range(len(final)):
print(final[i], end=' ')
else: print(-1)
##mode = marks[(n+1)//2 - 1]
##
##if (n+1)/2 <= k:
## if mode < y:
## print('mode',-1)
## else:
## for i in range(k, n):
## marks.append(marks[k-1])
## if sum(marks) > x:
## print(marks)
## print('sum',-1)
## else:
## for i in range(k, n):
## print(marks[i], end=' ')
##else:
## for i in range(k+1, n+1):
## if i < mode:
## marks.append(marks[k-1])
## else:
## marks.append(y)
##
## for i in range(k+1, n+1):
## print(marks[i], end=' ')
| 1,700 | PYTHON3 |
(n,m)=map(int,input().split())
flag=0
for i in range(n):
s=list(input())
if 'C' in s or 'M' in s or 'Y' in s:
flag=1
if flag==1:
print('#Color')
else:
print('#Black&White') | 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int a[10010];
void solve() {
int n;
cin >> n;
int sum = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
sum += a[i];
}
if (sum % n) {
cout << "-1" << endl;
return;
}
int x;
const int k = sum / n;
cout << 3 * n - 3 << '\n';
for (int i = 2; i <= n; ++i) {
printf("%d %d %d\n", 1, i, x = ((-a[i]) % i + i) % i);
a[1] -= x, a[i] += x;
printf("%d %d %d\n", i, 1, x = a[i] / i);
a[i] -= x * i, a[1] += x * i;
}
for (int i = 2; i <= n; ++i) {
printf("%d %d %d\n", 1, i, x = k);
a[1] -= x, a[i] += x;
}
}
int main() {
int t;
cin >> t;
while (t--) {
solve();
}
}
| 2,000 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin >> n;
long long int a[n];
map<long long int, int> m;
set<long long int> s;
for (long long int i = 0; i < n; i++) {
cin >> a[i];
m[a[i]]++;
}
sort(a, a + n);
for (int i = n - 1; i >= 0; i--) {
if (!m[a[i] + 1]) {
if (a[i] + 1 <= 150001) {
s.insert(a[i] + 1);
m[a[i] + 1]++;
m[a[i]]--;
} else {
if (m[a[i]] >= 2) {
if (!m[a[i] - 1]) {
m[a[i] - 1]++;
m[a[i]]--;
s.insert(a[i] - 1);
}
}
if (m[a[i]] == 1) {
s.insert(a[i]);
}
}
} else if (m[a[i]] >= 2) {
if (a[i] - 1 >= 1) {
m[a[i] - 1]++;
m[a[i]]--;
s.insert(a[i] - 1);
} else {
s.insert(a[i]);
}
} else {
s.insert(a[i]);
}
}
cout << s.size();
return 0;
}
| 1,500 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long p = 1e9 + 7;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
long long mx = 2 * 1e5;
vector<long long> a(mx);
a[0] = 1;
a[1] = 1;
a[2] = 2;
for (int i = 3; i < mx; i++) {
a[i] = a[i - 1] + a[i - 2];
a[i] %= p;
}
string s;
cin >> s;
long long n = s.size();
char lst = 'A';
long long cur = 0;
long long ans = 1;
for (int i = 0; i < n; i++) {
if (s[i] == 'm' || s[i] == 'w') {
cout << 0;
return 0;
}
if (s[i] == lst) {
cur++;
} else {
if (lst == 'n' || lst == 'u') {
ans = (ans * a[cur]) % p;
}
cur = 1;
lst = s[i];
}
}
if (lst == 'n' || lst == 'u') {
ans = (ans * a[cur]) % p;
}
cout << ans;
}
| 1,400 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long N = 1e5 + 5, M = 1e9 + 7;
long long n, x, y, ans;
multiset<long long> s;
multiset<long long>::iterator it;
struct node {
long long x, y;
} a[N];
long long cmp(node x, node y) { return x.y > y.y; }
signed main() {
scanf("%lld%lld%lld", &n, &x, &y);
for (long long i = 1; i <= n; i++) {
scanf("%lld%lld", &a[i].x, &a[i].y);
(ans += x + y * (a[i].y - a[i].x) % M) %= M;
s.insert(a[i].x);
}
sort(a + 1, a + 1 + n, cmp);
for (long long i = 1; i <= n; i++) {
long long t = a[i].y;
it = s.upper_bound(t);
if (it != s.end() && y * (*it - t) < x) {
(ans += y * (*it - t) % M + M - x) %= M;
s.erase(it);
}
}
printf("%lld\n", ans);
return 0;
}
| 2,000 | CPP |
n = int(input())
arr = list(map(int, input().split()))
if n%2 == 1 :
limit = n//2 + 1
j = n-1
for i in range(0, limit, 2):
arr[i], arr[j] = arr[j], arr[i]
j-=2
else:
limit = n//2
j = n-1
for i in range(0, limit, 2):
arr[i], arr[j] = arr[j], arr[i]
j-=2
for i in arr:
print(i, end = ' ') | 900 | PYTHON3 |
#155A I Love UserName
a=input()
b=list(map(int,input().split()))
counter=1
if len(b)==1:
print(0)
elif len(b)==2:
if b[0]==b[1]:
print(0)
else:
print(1)
else:
if b[0]==b[1]:
counter=0
minimum=min(b[0],b[1])
maximum=max(b[0],b[1])
for i in range(2,len(b)):
if b[i]<minimum:
minimum=b[i]
counter+=1
if b[i]>maximum:
maximum=b[i]
counter+=1
print(counter)
| 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e2 + 20;
const int maxm = maxn * 4;
const int maxk = 8;
vector<int> adj[maxn], marked;
int n, m, a[maxn], dp[maxn][1 << maxk];
bitset<maxn> ans[maxn][1 << maxk];
int get(int x, int y) { return x * m + y; }
int main() {
memset(dp, 63, sizeof dp);
int k;
cin >> n >> m >> k;
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++) {
int k = get(i, j);
cin >> a[k];
if (i) adj[k].push_back(get(i - 1, j));
if (i + 1 < n) adj[k].push_back(get(i + 1, j));
if (j) adj[k].push_back(get(i, j - 1));
if (j + 1 < m) adj[k].push_back(get(i, j + 1));
}
for (int i = 0; i < k; i++) {
int x, y;
cin >> x >> y;
x--, y--;
int k1 = get(x, y);
marked.push_back(k1);
dp[k1][1 << i] = a[k1];
ans[k1][1 << i][k1] = 1;
}
int hlp = (1 << k);
for (int mask = 1; mask < hlp; mask++) {
set<pair<int, int> > st;
for (int i = 0; i < n * m; i++) {
for (int submask = (mask - 1) & mask; submask > 0;
submask = (submask - 1) & mask) {
int k = dp[i][submask] + dp[i][mask ^ submask] - a[i];
if (dp[i][mask] > k) {
dp[i][mask] = k;
ans[i][mask] = ans[i][submask] | ans[i][mask ^ submask];
}
}
st.insert({dp[i][mask], i});
}
while (!st.empty()) {
int v = st.begin()->second;
int W = st.begin()->first;
st.erase(st.begin());
if (W != dp[v][mask]) continue;
for (auto u : adj[v])
if (dp[u][mask] > W + a[u]) {
dp[u][mask] = W + a[u];
ans[u][mask] = ans[v][mask];
ans[u][mask][u] = 1;
st.insert({dp[u][mask], u});
}
}
}
int res = dp[marked.back()][hlp - 1];
cout << res << endl;
for (int i = 0; i < n; i++, cout << endl)
for (int j = 0; j < m; j++) {
if (ans[marked.back()][hlp - 1][get(i, j)])
cout << 'X';
else
cout << '.';
}
}
| 2,500 | CPP |
#include <bits/stdc++.h>
using namespace std;
bool vist[2000 + 20];
struct Node {
int x, y;
long long val;
} road[2000 * 2000 + 20];
int f[2000 + 20];
long long dp[2000 + 20];
int n;
long long a[2000 + 20][2000 + 20];
long long b[2000 + 20][2000 + 20];
vector<int> edge[2000 + 20];
int cmp(const void *p1, const void *p2) {
Node *x = (Node *)p1;
Node *y = (Node *)p2;
if (x->val < y->val) return -1;
if (x->val > y->val) return 1;
return 0;
}
int find(int x) { return x == f[x] ? f[x] : f[x] = find(f[x]); }
void lca(int u, int fa) {
for (int i = 0; i < edge[u].size(); i++) {
int v = edge[u][i];
if (v == fa) continue;
dp[v] = dp[u] + a[v][u];
lca(v, u);
f[v] = u;
}
vist[u] = true;
b[u][u] = 0;
for (int i = 1; i <= n; i++) {
if (i == u) continue;
if (vist[i]) {
int k = find(i);
b[u][i] = b[i][u] = dp[i] + dp[u] - 2 * dp[k];
}
}
}
int main() {
int cnt = 0;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
scanf("%I64d", &a[i][j]);
if (i == j) {
if (a[i][j] == 0)
continue;
else {
printf("NO\n");
return 0;
}
} else {
if (a[i][j] == 0) {
printf("NO\n");
return 0;
}
}
cnt++;
road[cnt].x = i;
road[cnt].y = j;
road[cnt].val = a[i][j];
}
}
for (int i = 1; i <= n; i++) f[i] = i;
qsort(road + 1, cnt, sizeof(road[0]), cmp);
for (int i = 1; i <= cnt; i++) {
int x = find(road[i].x);
int y = find(road[i].y);
if (x == y) continue;
f[x] = y;
edge[road[i].x].push_back(road[i].y);
edge[road[i].y].push_back(road[i].x);
}
memset(vist, 0, sizeof(vist));
for (int i = 1; i <= n; i++) f[i] = i;
lca(1, 0);
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if (a[i][j] != b[i][j]) {
printf("NO\n");
return 0;
}
}
}
printf("YES\n");
return 0;
}
| 1,900 | CPP |
#include <bits/stdc++.h>
using namespace std;
void fre() {
freopen("c://test//input.in", "r", stdin);
freopen("c://test//output.out", "w", stdout);
}
template <class T1, class T2>
inline void gmax(T1 &a, T2 b) {
if (b > a) a = b;
}
template <class T1, class T2>
inline void gmin(T1 &a, T2 b) {
if (b < a) a = b;
}
const int N = 1e5 + 10, M = 1e4 + 10, Z = 1e9 + 7, ms63 = 0x3f3f3f3f;
int n, m;
char s[N][12];
vector<pair<int, int> > b[N];
int main() {
while (~scanf("%d%d", &n, &m)) {
for (int i = 1; i <= m; ++i) b[i].clear();
for (int i = 1; i <= n; ++i) {
int d, v;
scanf("%s %d %d", s[i], &d, &v);
b[d].push_back(make_pair(-v, i));
}
for (int i = 1; i <= m; ++i) {
sort(b[i].begin(), b[i].end());
if (b[i].size() > 2 && b[i][1].first == b[i][2].first)
puts("?");
else
printf("%s %s\n", s[b[i][0].second], s[b[i][1].second]);
}
}
return 0;
}
| 1,300 | CPP |
y=""
for i in range(3):
y=y+input()
if(y==y[::-1]):
print("YES")
else:
print("NO") | 800 | PYTHON3 |
n = int(input())
a = list(map(int, input().split()))
max_len = 0
i = 0
while i < n:
j = i
while j < n-1 and a[j] <= a[j+1]:
j += 1
cur_len = j - i + 1
if cur_len > max_len:
max_len = cur_len
i = j + 1
print(max_len)
| 900 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
string s;
int main() {
cin >> s;
char abc[3] = {'A', 'B', 'C'};
vector<char> abcv(abc, abc + 3);
for (int i = 0; i < (int)s.size() - 2; i++) {
vector<char> cur(s.begin() + i, s.begin() + i + 3);
sort(cur.begin(), cur.end());
if (cur == abcv) {
cout << "Yes" << endl;
exit(0);
}
}
cout << "No" << endl;
}
| 900 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long ara[10][10];
int main() {
ios_base::sync_with_stdio(false);
ara[1][1] = 1;
ara[1][2] = 2;
ara[1][3] = 3;
ara[1][4] = 2;
ara[1][5] = 1;
ara[2][2] = 4;
ara[2][3] = 2;
ara[2][4] = 0;
ara[2][5] = 0;
ara[3][3] = 1;
ara[3][4] = 0;
ara[3][5] = 1;
ara[4][4] = 0;
ara[4][5] = 0;
ara[5][5] = 1;
long long n, m;
cin >> n >> m;
if (n % 6 == 0 || m % 6 == 0)
cout << n * m << endl;
else if (n < 6 && m < 6) {
long long mn = min(n, m);
long long mx = max(n, m);
cout << n * m - ara[mn][mx] << endl;
} else if (n < 6 || m < 6) {
if (n == 1 || m == 1) {
long long maxi = max(n, m);
maxi %= 6;
cout << n * m - ara[1][maxi] << endl;
} else {
long long mn = min(n, m), mx = max(m, n);
if (mn == 2 && mx == 7)
cout << 12 << endl;
else if (n % 2 == 0 || m % 2 == 0)
cout << n * m << endl;
else
cout << n * m - 1 << endl;
}
} else if (n > 6 && m > 6) {
if (n % 2 == 0 || m % 2 == 0)
cout << n * m << endl;
else
cout << n * m - 1 << endl;
}
return 0;
}
| 2,200 | CPP |
if __name__=='__main__':
t=int(input())
while(t>0):
n=int(input())
a=list(map(int,input().split()))
p=[0]*n
s=[0]*51
j=1
p[0]=a[0]
s[a[0]]=1
for i in range(2*n):
if(s[a[i]]!=1):
p[j]=a[i]
j=j+1
s[a[i]]=1
for i in range(n):
print( p[i] , end =" ")
t=t-1
| 800 | PYTHON3 |
X = list(map(int, input().split()))
POS = sorted(X[:3])
print(max(X[3] - abs(POS[0] - POS[1]), 0) + max(X[3] - abs(POS[2] - POS[1]), 0))
# UB_CodeForces
# Advice: The only source of knowledge is exprience
# Location: At home behind my desk
# Caption: A 900 tag problem
# CodeNumber: 481
| 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int tower, num, m, n, o, p, i, k, flag, j;
while (scanf("%d", &tower) != EOF) {
flag = 0;
scanf("%d", &num);
scanf("%d%d", &n, &k);
if (n == num || k == num) {
flag = 1;
}
for (i = 1; i < tower; i++) {
scanf("%d%d", &o, &p);
num = 7 - num;
if ((num == n || num == k || num == o || num == p) ||
((num == 7 - n || num == 7 - k || num == 7 - o || num == 7 - p)))
flag = 1;
n = o;
k = p;
}
if (!flag) {
printf("YES\n");
} else {
printf("NO\n");
}
}
return 0;
}
| 1,100 | CPP |
import math
testcase = int(input())
for _ in range(testcase):
heroPower, heroHealth, noMonsters = map(int, input().split())
monsPower = list(map(int, input().split()))
monsHealth = list(map(int, input().split()))
monster = []
for i in range(noMonsters):
monster.append((monsPower[i], monsHealth[i]))
monster.sort()
won = "YES"
for i in range(len(monster)):
attack, life = monster[i]
noOfFights = math.ceil(life/heroPower)
heroHealth -= noOfFights*attack
life -= (life//heroPower)*noOfFights
if heroHealth <= 0:
if i != len(monster) - 1:
won = "NO"
break
else:
if heroHealth + attack <= 0:
won = "NO"
break
print(won) | 900 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const long long N = 1 << 12;
long long n, p, s;
pair<long long, long long> a[N];
long long b[N];
long long dp[N][N];
long long par[N][N];
long long use[N];
int main() {
ios::sync_with_stdio(0), cin.tie(0);
cin >> n >> p >> s;
for (int i = 1; i <= n; i++) {
long long x;
cin >> x;
a[i] = {x, i};
}
for (int i = 1; i <= n; i++) {
cin >> b[i];
}
sort(a + 1, a + n + 1);
reverse(a + 1, a + n + 1);
for (int i = 0; i < N; i++)
for (int j = 0; j < N; j++) dp[i][j] = -1e15;
dp[0][0] = 0;
for (int i = 1; i <= n; i++) {
long long pow = a[i].first, id = a[i].second;
dp[i][0] = dp[i - 1][0] + (i <= p) * pow;
for (int j = 1; j <= s; j++) {
dp[i][j] = dp[i - 1][j] + (i - j <= p) * pow;
long long res = dp[i - 1][j - 1] + b[id];
if (res > dp[i][j]) {
dp[i][j] = res;
par[i][j] = 1;
}
}
}
cout << dp[n][s] << '\n';
vector<long long> second, P;
for (int i = n, j = s; i; i--) {
long long id = a[i].second;
if (!par[i][j]) continue;
use[id] = 1;
second.push_back(id);
j--;
}
for (int i = 1; i <= n; i++) {
if (!p) continue;
long long id = a[i].second;
if (use[id]) continue;
p--;
P.push_back(id);
}
for (auto u : P) cout << u << ' ';
cout << '\n';
for (auto u : second) cout << u << ' ';
return (0);
}
| 2,000 | CPP |
import fractions
a, b = [int(x) for x in input().split()]
if a == b:
print(a)
else:
print(1)
| 800 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = (int)2e5 + 100;
int n, a[maxn], b[maxn], c[maxn], num[maxn];
int sum[maxn << 2], lazy[maxn << 2];
void pushup(int rt) { sum[rt] = sum[rt << 1] + sum[rt << 1 | 1]; }
void build(int l, int r, int rt) {
if (l == r) {
sum[rt] = 0;
return;
}
int m = (l + r) >> 1;
build(l, m, rt << 1);
build(m + 1, r, rt << 1 | 1);
pushup(rt);
}
void add(int L, int c, int l, int r, int rt) {
if (l == r) {
sum[rt] += c;
return;
}
int m = (l + r) >> 1;
if (L <= m)
add(L, c, l, m, rt << 1);
else
add(L, c, m + 1, r, rt << 1 | 1);
pushup(rt);
}
int query(int L, int R, int l, int r, int rt) {
if (L <= l && r <= R) return sum[rt];
int m = (l + r) >> 1;
int ans = 0;
if (L <= m) ans += query(L, R, l, m, rt << 1);
if (R > m) ans += query(L, R, m + 1, r, rt << 1 | 1);
return ans;
}
int dq(int L, int R, int l, int r, int rt) {
if (L == R) return R;
int mid = L + R >> 1;
if (query(L, mid, 1, n, 1))
return dq(L, mid, 1, n, 1);
else
return dq(mid + 1, R, 1, n, 1);
}
int main() {
cin >> n;
for (int i = (1); i <= (n); ++i) scanf("%d", &a[i]);
for (int i = (1); i <= (n); ++i) {
int x;
scanf("%d", &x);
num[x]++;
}
build(1, n, 1);
for (int i = (0); i <= (n - 1); ++i)
if (num[i]) add(i + 1, num[i], 1, n, 1);
for (int i = (1); i <= (n); ++i) {
int ans = (n - a[i]) % n, res;
if (query(ans + 1, n, 1, n, 1)) {
res = dq(ans + 1, n, 1, n, 1);
num[res - 1]--;
add(res, -1, 1, n, 1);
printf("%d ", (res - 1 + a[i]) % n);
} else {
res = dq(1, ans, 1, n, 1);
num[res - 1]--;
add(res, -1, 1, n, 1);
printf("%d ", (res - 1 + a[i]) % n);
}
}
}
| 1,700 | CPP |
#include <bits/stdc++.h>
using namespace std;
namespace my_std {
const long long inf = 0x3f3f3f3f;
const long long inff = 1e15;
inline long long read() {
long long sum = 0, f = 1;
char ch = 0;
while (!isdigit(ch)) {
if (ch == '-') f = -1;
ch = getchar();
}
while (isdigit(ch)) {
sum = sum * 10 + (ch ^ 48);
ch = getchar();
}
return sum * f;
}
inline void write(long long x) {
if (x < 0) {
x = -x;
putchar('-');
}
if (x > 9) write(x / 10);
putchar(x % 10 + '0');
}
inline void writeln(long long x) {
write(x);
putchar('\n');
}
inline void writesp(long long x) {
write(x);
putchar(' ');
}
} // namespace my_std
using namespace my_std;
const long long N = 55, mod = 1e9 + 7;
long long n, p, a[N], f[N][N][N][N], mi[N] = {1}, ans;
int main(void) {
n = read(), p = read();
for (register long long i = (1); i <= (n); ++i) a[i] = read();
for (register long long i = (1); i <= (n); ++i)
mi[i] = (mi[i - 1] << 1) % mod;
if (a[1] == 1 || a[1] == -1) {
f[1][1][0][0] = 1;
if (p && n == 1) ans++;
}
if (!a[1] || a[1] == -1) {
f[1][0][1][0] = 1;
if (p && n == 1) ans++;
}
for (register long long i = (2); i <= (n); ++i)
for (register long long jb = (0); jb <= (i); ++jb)
for (register long long jh = (0); jh <= (i - jb); ++jh)
for (register long long ob = (0); ob <= (i - jb - jh); ++ob) {
long long oh = i - jb - jh - ob;
if (a[i] == 1 || a[i] == -1) {
long long add = 0;
if ((jb + ob) != 0) {
if (jb != 0) {
if (jh == 0)
add = (add + f[i - 1][jb - 1][jh][ob]) % mod;
else
add = (add + mi[jh - 1] * f[i - 1][jb - 1][jh][ob]) % mod;
}
if (ob != 0 && jh != 0)
add = (add + mi[jh - 1] * f[i - 1][jb][jh][ob - 1] % mod);
}
add = (add * mi[jb + ob + oh - 1]) % mod;
f[i][jb][jh][ob] = (f[i][jb][jh][ob] + add) % mod;
}
if (a[i] == 0 || a[i] == -1) {
long long add = 0;
if ((jh + oh) != 0) {
if (jh != 0) {
if (jb == 0)
add = (add + f[i - 1][jb][jh - 1][ob]) % mod;
else
add = (add + mi[jb - 1] * f[i - 1][jb][jh - 1][ob]) % mod;
}
if (jb != 0 && oh != 0)
add = (add + mi[jb - 1] * f[i - 1][jb][jh][ob] % mod) % mod;
}
add = (add * mi[jh + ob + oh - 1]) % mod;
f[i][jb][jh][ob] = (f[i][jb][jh][ob] + add) % mod;
}
if (i == n && (jb + jh) % 2 == p)
ans = (ans + f[i][jb][jh][ob]) % mod;
}
writeln(ans);
return 0;
}
| 2,400 | CPP |
#include <bits/stdc++.h>
using namespace std;
void solve() {
long long n;
cin >> n;
vector<long long> v;
long long t = n;
for (long long i = 2; i * i <= n; i++) {
if (t == 1 || v.size() > 1) break;
if (t % i == 0) {
v.push_back(i);
while (t % i == 0) {
t /= i;
}
}
}
if (t != 1 && v.size() > 0) v.push_back(t);
if (v.size() == 0) {
cout << n << endl;
} else if (v.size() == 1) {
cout << v[0] << endl;
} else {
cout << 1 << endl;
}
return;
}
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
long long t = 1;
while (t--) {
solve();
}
}
| 1,500 | CPP |
import sys
t = int(sys.stdin.readline())
for _ in range(t):
n = int(sys.stdin.readline())
arr = list(map(int,sys.stdin.readline().strip().split()))
s = sum(arr)
sarr = ['1']*n
x = sum(arr[i] for i in range(0,n,2))
y = sum(arr[i] for i in range(1,n,2))
if x > y:
for i in range(0,n,2):
sarr[i] = str(arr[i])
else:
for i in range(1,n,2):
sarr[i] = str(arr[i])
print(' '.join(sarr))
| 1,400 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, k;
pair<pair<int, int>, int> c[2000];
bool sale[2000];
double sum[2000];
int last[2000];
vector<int> b[1500];
void add(pair<int, int> &item, int id) {
bool s = (item.second == 1);
int cur = item.first;
int best = 0;
double mmin = 1000000000;
for (int i = 0; i < (int)(k); i++) {
double it = 0;
if (sale[i]) {
it = last[i] / 2. + cur / 2.;
} else if (s) {
it = cur / 2.;
} else
it = cur;
if (it < mmin) {
mmin = it;
best = i;
} else if (abs(it - mmin) < 1e-12) {
if (b[i].size() == 0) best = i;
}
}
b[best].push_back(id);
last[best] = cur;
if (s) sale[best] = true;
sum[best] += mmin;
}
int main() {
cin >> n >> k;
for (int i = 0; i < (int)(n); i++) {
cin >> c[i].first.first >> c[i].first.second;
c[i].second = i + 1;
}
sort(c, c + n, greater<pair<pair<int, int>, int> >());
for (int i = 0; i < (int)(n); i++) {
add(c[i].first, c[i].second);
}
double ans = 0;
for (int i = 0; i < (int)(k); i++) ans += sum[i];
printf("%.1lf\n", ans);
for (int i = 0; i < (int)(k); i++) {
printf("%d ", (int)b[i].size());
for (int j = 0; j < (int)b[i].size(); j++) printf("%d ", b[i][j]);
printf("\n");
}
return 0;
}
| 1,700 | CPP |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.