solution stringlengths 11 983k | difficulty int64 0 21 | language stringclasses 2
values |
|---|---|---|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
const int N = 2e5 + 20;
int n, s[N], a[N], fen[N];
inline void add(int p, int val) {
for (p++; p < N; p += p & -p) fen[p] += val;
}
inline int get(int p) {
int sum = 0;
for (; p; p -= p & -p) su... | 10 | CPP |
def sumsegtree(l,seg,st,en,x):
if st==en:
seg[x]=l[st]
else:
mid=(st+en)>>1
sumsegtree(l,seg,st,mid,2*x)
sumsegtree(l,seg,mid+1,en,2*x+1)
seg[x]=seg[2*x]+seg[2*x+1]
def query(seg,st,en,val,x):
if st==en:
return seg[x]
mid=(st+en)>>1
if seg[2*x]>=val:
... | 10 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const long long N = 3e5;
long long n, t[N], a[N], res[N];
set<long long> st;
void upd(long long i) {
long long d = i;
for (i; i < N; i |= i + 1) t[i] += d;
}
long long sum(long long l, long long r) {
long long s = 0;
for (; r >= 0; r &= r + 1, r--) s += t[r];
l--;... | 10 | CPP |
# https://codeforces.com/contest/1208/problem/D
from sys import stdin, stdout
input = stdin.readline
print = stdout.write
# For every i from N to 1, let's say the value of the si is x.
# So it means there are k smallest unused numbers whose sum is x.
# We simply put the (k+1)st number in the output permutation at th... | 10 | PYTHON3 |
#include <bits/stdc++.h>
using std::size_t;
template <typename T, typename Op = std::plus<T>>
class SegmentTree {
std::vector<T> arr;
int n;
Op op;
public:
template <class InputIterator>
SegmentTree(size_t n_, InputIterator begin);
SegmentTree(size_t n_, const T& value = T());
const T& operator[](size_t... | 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10, eps = 1e-10;
int n;
long long a[N];
long long tree[N];
int ans[N];
long long sum(int x) {
long long res = 0;
while (x) {
res += tree[x];
x -= (x & (-x));
}
return res;
}
void add(int x, long long sum) {
while (x <= n) {
tree[x] ... | 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n;
long long IM = -999999999999;
typedef struct nde {
int ll;
int rl;
long long val;
int pos;
long long prv;
struct nde* l;
struct nde* r;
struct nde* pr;
} prt;
prt* getnew() {
prt* p = new prt();
p->prv = 0;
return p;
}
prt* createTree(long long ... | 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
void ECHO(string _s) {
cout << endl;
(void)_s;
}
template <typename T, typename... Args>
void ECHO(string _s, T x, Args... args) {
int _i;
string _s2 = "";
for (_i = 0; _i < (int)(_s).size(); ++_i) {
if (_s[_i] == ',') break;
if (_s[_i] != ' ') _s2 += _s[_... | 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long power(long long a, long long b) {
long long res = 1;
a = a % 1000000007;
while (b > 0) {
if (b & 1) {
res = (res * a) % 1000000007;
b--;
}
a = (a * a) % 1000000007;
b >>= 1;
}
return res;
}
long long fermat_inv(long long y) { ... | 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 200005;
const long long inf = 1e11;
struct Node {
int l, r, num;
long long tag;
long long val;
} node[4 * maxn];
long long a[maxn];
int ans[maxn];
void up(int no) {
if (node[no << 1].val < node[no << 1 | 1].val) {
node[no].val = node[no << 1].va... | 10 | CPP |
NN = 18
BIT=[0]*(2**NN+1)
def addbit(i, x):
while i <= 2**NN:
BIT[i] += x
i += i & (-i)
def getsum(i):
ret = 0
while i != 0:
ret += BIT[i]
i -= i&(-i)
return ret
def searchbit(x):
l, sl = 0, 0
d = 2**(NN-1)
while d:
m = l + d
sm = sl + BIT[m... | 10 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const long long maxN = 2 * 100224;
struct BIT {
long long data[maxN] = {0};
void update(long long idx, long long val) {
while (idx < maxN) {
data[idx] += val;
idx += idx & -idx;
}
}
void update(long long l, long long r, long long val) {
updat... | 10 | CPP |
#include <bits/stdc++.h>
struct BIT {
int n;
long long a[200005];
int lowbit(int x) { return x & -x; }
void build(int size) { n = size; }
void update(int x, int val) {
for (; x <= n; x += lowbit(x)) a[x] += val;
}
long long query(int x) {
long long ret = 0;
for (; x; x -= lowbit(x)) ret += a[x... | 10 | CPP |
# ---------------------------iye ha aam zindegi---------------------------------------------
import math
import heapq, bisect
import sys
from collections import deque, defaultdict
from fractions import Fraction
import sys
mod = 10 ** 9 + 7
mod1 = 998244353
# ------------------------------warmup------------------------... | 10 | PYTHON3 |
import sys
input = sys.stdin.readline
class SegTree(object):
"""docstring for SegTree"""
def __init__(self, n, arr):
self.n = n
self.arr = arr
self.tree = [0 for i in range(2*n)]
def construct(self): # Construction
for i in range(self.n):
self.tree[n+i] = self.arr[i]
for i in range(n-1,0,-1):
self.t... | 10 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long n, s[200005], tree[800005], lazy[800005], ans[200005];
void pushdown(long long ind, long long l, long long r) {
if (l != r && lazy[ind] != 0) {
lazy[2 * ind] += lazy[ind];
tree[2 * ind] += lazy[ind];
lazy[2 * ind + 1] += lazy[ind];
tree[2 * ind +... | 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
bool cur1;
int n;
int ans[200005];
long long S[200005];
struct Bittree {
long long sum[200005];
inline void update(int x, int v) {
while (x <= n) {
sum[x] += v;
x += x & (-x);
}
}
inline long long query(int x) {
long long res = 0;
while (... | 10 | CPP |
#include <bits/stdc++.h>
#pragma comment(linker, "/stack:200000000")
using namespace std;
void redirectIO() {
ios::sync_with_stdio(false);
cin.tie(0);
}
long long mVal[1100000];
long long upd[1100000];
long long s[210000];
void refr(int a) { mVal[a] = mVal[a * 2] + mVal[a * 2 + 1] + upd[a]; }
void push(int a) {
m... | 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long int N = 1e13 + 7;
long long int n;
vector<long long int> s(200004), p(200004), lazy(800004);
vector<long long int> tree(800004);
void build(long long int node, long long int l, long long int r) {
if (l == r) {
tree[node] = s[l];
return;
}
long long i... | 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long double EPS = 1e-9, PI = acos(-1.);
const int INF = 0x3f3f3f3f, MOD = 1e9 + 7;
const long long LINF = 0x3f3f3f3f3f3f3f3f;
const int N = 2e5 + 5;
int n;
long long mi[4 * N], pos[4 * N], v[N], lz[4 * N];
void build(int p, int l, int r) {
if (l == r) {
mi[p] = ... | 10 | CPP |
from sys import stdin,stdout
def update(L,C,l,r,rt):
if l==r:
tree[rt]+=C
return
mid=(l+r)//2
if L<=mid:
update(L,C,l,mid,rt<<1)
else:
update(L,C,mid+1,r,rt<<1|1)
tree[rt]=tree[rt<<1]+tree[rt<<1|1]
def query(s,l,r,rt):
if l==r:
return l
mid=(l+r)//2
... | 10 | PYTHON3 |
#include <bits/stdc++.h>
long long int min2(long long int a, long long int b) { return a > b ? a : b; }
long long int max2(long long int a, long long int b) { return a < b ? a : b; }
class node {
public:
int left, right;
long long int num, min;
bool isMinLeft;
bool willPropagate;
node *leftchild, *rightchild... | 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e18;
const double EPS = 1e-9;
const long long MOD = (long long)(1e9 + 7);
const long long MAXV = (long long)(2e5 + 10);
const long long MAXE = (long long)(1e6 + 10);
long long seg[MAXV * 4];
long long lazy[MAXV * 4];
long long A[MAXV * 4];
void build(... | 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long INF = ~0ull >> 1;
long long _min[2000005 * 5], add[2000005 * 5];
int n;
long long s[2000005];
int ans[2000005];
void pushup(int o) { _min[o] = min(_min[o << 1], _min[o << 1 | 1]); }
void pushdown(int o) {
if (add[o]) {
add[o << 1] += add[o];
add[o ... | 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long N = 2e5 + 10;
const long long INF = 0x3f3f3f3f3f3f3f3f;
long long n, tag[N << 2], ans[N], pos;
long long a[N], val[N << 2];
inline void pushup(long long o) { val[o] = min(val[o << 1], val[o << 1 | 1]); }
inline void apply(long long o, long long x) { val[o] +... | 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long a[3000000], tree[4 * 3000000], ans[4 * 3000000];
int n;
void update(int indx, int left, int right, int pos, long long val) {
if (left > pos || right < pos) return;
if (left == right) {
tree[indx] += val;
return;
}
int mid = (left + right) >> 1;
u... | 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long power(long long a, long long b, long long m) {
a %= m;
long long ret = 1;
while (b) {
if (b & 1) ret = ((ret % m) * (a % m)) % m;
a = ((a % m) * (a % m)) % m;
b >>= 1;
}
return ret;
}
const int N = 2e5 + 5;
long long n, bit[N + 3], a[N + 2], ... | 10 | CPP |
#include <bits/stdc++.h>
const long long inf = 0x3f3f3f3f;
const long long inn = 0x80808080;
using namespace std;
const long long maxm = 2e5 + 5;
long long mi[maxm << 2];
long long laz[maxm << 2];
long long p[maxm];
long long n;
void pushup(long long node) { mi[node] = min(mi[node * 2], mi[node * 2 + 1]); }
void pushdo... | 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long a, b, c, d, i, e, f, g, n, m, k, l, A[200005], B[200005], mid, le, ri,
BITree[4000005], ans, fix[200005];
long long getSum(long long index) {
long long sum = 0;
while (index > 0) {
sum += BITree[index];
index -= index & (-index);
}
return sum;
... | 10 | CPP |
from sys import stdin,stdout
class Tree(object):
def __init__(self,n):
self.tree=[0]*(4*n+10)
def update(self,L,C,l,r,rt):
if l==r:
self.tree[rt]+=C
return
mid=(l+r)//2
if L<=mid:
self.update(L,C,l,mid,rt<<1)
else:
self.upd... | 10 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
pair<long long, long long> tree[4 * 200005 + 1];
long long lo[4 * 200005 + 1], hi[4 * 200005 + 1], a[200005],
delta[4 * 200005 + 1], ans[200005];
void init(long long i, long long a, long long b) {
lo[i] = a;
hi[i] = b;
if (a == b) return;
long long m = (a + b) /... | 10 | CPP |
#include <bits/stdc++.h>
#pragma GCC optimize "03"
using namespace std;
const long long int N = 2e5 + 5;
const long long int mod = 1e9 + 7;
const long long int inf = 1e18 + 9;
long long int a[N];
long long int t[4 * N], lzy[4 * N];
void build(long long int nd, long long int s, long long int e) {
if (s == e)
t[nd]... | 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long double EPS = 1e-9, PI = acos(-1.);
const int INF = 0x3f3f3f3f, MOD = 1e9 + 7;
const long long LINF = 0x3f3f3f3f3f3f3f3f;
const int N = 2e5 + 5;
int n, ans[N];
long long mi[4 * N], pos[4 * N], v[N], lz[4 * N];
void build(int p, int l, int r) {
if (l == r) {
... | 10 | CPP |
class DualBIT():
def __init__(self, n):
self.n = n
self.bit = [0] * (n + 1)
def get(self, i):
'''i番目の要素を取得'''
i = i + 1
s = 0
while i <= self.n:
s += self.bit[i]
i += i & -i
return s
def _add(self, i, x):
while i > 0:
... | 10 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const long long N = 1e6 + 5;
long long n, a[N], c[N], p[N];
inline long long read() {
long long ret = 0, f = 0;
char c = getchar();
while (!isdigit(c)) {
if (c == '-') f = 1;
c = getchar();
}
while (isdigit(c)) {
ret = ret * 10 + c - 48;
c = getcha... | 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
long long n = 1, n2, s[200010], ans[200010], dat[800010];
void INIT(long long k, long long lb, long long ub) {
if (lb == ub) return;
INIT(k * 2 + 1, lb, (lb + ub) / 2);
INIT(k * 2 + 2, (lb + ub) / 2 + 1, ub);
dat[k] = dat[k * 2 + 1] + ... | 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 200200;
long long mn[4 * maxn], ps[4 * maxn], ls[4 * maxn];
void push(int i, int l, int r) {
if (ls[i]) {
mn[i] += ls[i];
if (l != r) {
ls[2 * i] += ls[i];
ls[2 * i + 1] += ls[i];
}
ls[i] = 0;
}
}
void pull(int i) {
long lo... | 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline void read(T &x) {
bool b = 0;
char c;
while (!isdigit(c = getchar()) && c != '-')
;
if (c == '-') c = getchar(), b = 1;
x = c - 48;
while (isdigit(c = getchar())) x = (x << 3) + (x << 1) + c - 48;
if (b) x = -x;
}
template <typ... | 10 | CPP |
# TAIWAN NUMBER ONE!!!!!!!!!!!!!!!!!!!
# TAIWAN NUMBER ONE!!!!!!!!!!!!!!!!!!!
# TAIWAN NUMBER ONE!!!!!!!!!!!!!!!!!!!
from sys import stdin, stdout
from collections import defaultdict
from collections import deque
import math
import copy
#T = int(input())
N = int(input())
#s1 = input()
#s2 = input()
#N,Q = [int(x) for... | 10 | PYTHON3 |
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
const int N = 2e5 + 5, M = 2 * N + 5;
int n;
long long tree[1 << 19], a[N];
void build(int i, int l, int r) {
if (l == r) {
tree[i] = l;
return;
}
int mid = (l + r) / 2;
build(i * 2, l, mid);
build(i * 2 + 1, mid + 1, r);
tree[... | 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long n;
long long a[200007];
long long bit[200007];
long long ans[200007];
long long query(long long id) {
long long res = 0;
while (id) {
res += bit[id];
id -= (id & (-id));
}
return res;
}
void add(long long id, long long val) {
while (id <= n) {
... | 10 | CPP |
# class SegmentTree(): # adapted from https://www.geeksforgeeks.org/segment-tree-efficient-implementation/
# def __init__(self,arr,func,initialRes=0):
# self.f=func
# self.N=len(arr)
# self.tree=[0 for _ in range(2*self.N)]
# self.initialRes=initialRes
# for i in range(self.... | 10 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, const char* argv[]) {
int n;
cin >> n;
vector<int> v(n);
for (int i = 0; i < n; ++i) {
cin >> v[i];
}
vector<int> v2 = v;
sort(v.rbegin(), v.rend());
int m;
cin >> m;
for (int i = 0; i < m; ++i) {
int k, ind;
cin >> k >> in... | 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
vector<int> s[110][110], answer[110];
long long dp[110][110];
long long val[110];
int arr[110];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> arr[i];
}
for (int i = 1; i <= n; ++i) {
for (... | 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
class SegmentTree {
public:
vector<vector<long long> > a;
long long n;
SegmentTree(vector<long long>& arr) {
n = arr.size();
a.resize(4 * n);
build(1, 0, arr.size(), arr);
}
void build(long long v, long long vl, long long vr, vector<long long>& arr) {... | 10 | CPP |
def min_s(a, k):
res = a.copy()
for i in range(len(a) - k):
m = min(res)
res.reverse()
res.remove(m)
res.reverse()
return res
n = int(input())
a = [int(x) for x in input().split()]
m = int(input())
for _ in range(m):
k, pos = [int(x) for x in input().split()]
l = m... | 10 | PYTHON3 |
n = int(input())
arr = list(map(int, input().split()))
q = int(input())
qs = []
for i in range(q):
a, b = map(int, input().split())
qs.append([a, b - 1, i])
qs.sort()
ret = []
used = [0 for i in range(n)]
ans = [-1 for i in range(q)]
for z in range(q):
l, pos, o = qs[z]
while len(ret) < l:
mx ... | 10 | PYTHON3 |
n = int(input())
a = list(map(int, input().split()))
a1 = sorted(a, key=lambda x: -x)
q = int(input())
for i in range(q):
k, pos = map(int, input().split())
pos -= 1
notused = {}
for j in a1[:k]:
if j in notused:
notused[j] += 1
else:
notused[j] = 1
for j in a... | 10 | PYTHON3 |
n = int(input())
line = list(map(int, input().split()))
m = int(input())
for _ in range(m):
k, pos = map(int, input().split())
lf = line[:]
while len(lf) > k:
j = -1
x = min(lf)
while j > -len(lf)-1:
if lf[j] == x:
del lf[j]
if len(lf) == k... | 10 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const long long int mod = 1e9 + 7;
const long double error = 2e-6;
const long double PI = acosl(-1);
inline long long int MOD(long long int x, long long int m = mod) {
long long int y = x % m;
return (y >= 0) ? y : y + m;
}
const int inf = 1e9;
const long long int infl ... | 10 | CPP |
n = int(input())
arr = list(map(int, input().split()))
arr = [(i, num) for num, i in enumerate(arr)]
arr.sort(key=lambda x: (-x[0], x[1]))
m = int(input())
for q in range(m):
k, pos = tuple(map(int, input().split()))
now = []
for i in arr:
if len(now) == k:
break
now.append(i)... | 10 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long a[105], ans[105], b[105];
signed main() {
long long n, i;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
b[i] = a[i];
}
long long m;
cin >> m;
while (m--) {
long long k, t = 0, c = 0, pos;
cin >> k >> pos;
sort(b, b + n);
me... | 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<pair<int, int>> ps(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
ps[i] = make_pair(a[i], i);
}
sort(ps.begin(), ps.end(), [](pair<int, int>& a, pair<int, int>& b) {
if (a.first == b.first) {
... | 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
inline void amin(T &a, U b) {
a = (a > b ? b : a);
}
template <typename T, typename U>
inline void amax(T &a, U b) {
a = (a > b ? a : b);
}
const int N = (1 << 21) + 5;
int fenw[N];
void update(int i, int val) {
for (; i < N; i += i &... | 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e9;
bool cmp(pair<int, int> a, pair<int, int> b) {
return a.first > b.first || (a.first == b.first && a.second < b.second);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vector<pair<int, int>>... | 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
vector<pair<int, int>> v;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
v.push_back({-a[i], i});
}
sort(v.begin(), v.end());
int m;
cin >> m;
for (int i = 0; i < m; i++) ... | 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int a[200001];
pair<int, int> aTmp[200001];
int b[200001];
int kthLargest(int n, int k) {
vector<int> c(n);
for (int i = 0; i < n; ++i) {
c[i] = b[i];
}
sort(c.begin(), c.end());
return c[k - 1];
}
int main() {
std::ios::sync_with_stdio(false);
cin.tie(0);... | 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
bool comp(const pair<int, int>& a, const pair<int, int>& b) {
if (a.first == b.first)
return a.second > b.second;
else
return a.first < b.first;
}
int main() {
int n;
cin >> n;
vector<pair<int, int>> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i].fi... | 10 | CPP |
n = int(input())
a = list(map(int, input().split()))
m = int(input())
x = [[a[i], i] for i in range(n)]
x.sort(key = lambda x: x[0], reverse = True)
for _i in range(m):
k, p = map(int, input().split())
print(sorted(x[:k], key = lambda x: x[1])[p - 1][0])
| 10 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base ::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++) cin >> a[i];
vector<int> aS = a;
sort(aS.rbegin(), aS.rend());
int m;
cin >> m;
while (m--) {
int k... | 10 | CPP |
n = int(input())
data = list(map(int, input().split()))
m = int(input())
for _ in range(m):
k, pos = map(int, input().split())
s = data[:]
ans = []
for i in range(k):
x = s.index(max(s))
ans.append(x)
s[x] = -1
ans.sort()
print(data[ans[pos - 1]])
| 10 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
bool cmp(int a, int b) { return a > b; }
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int n, m;
cin >> n;
vector<int> a(n), a_f(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
a_f[i] = a[i];
}
sort(a_f.begin(), a_f.end(), cmp);
... | 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> arr(n);
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
int m;
cin >> m;
while (m--) {
int k, pos;
cin >> k >> pos;
pos--;
vector<vector<int>> ans(k);
vector<long long> sums(k);
int last = ... | 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long n, m, k;
pair<long long, long long> arr[200000];
bool cmp(pair<long long, long long> a, pair<long long, long long> b) {
if (a.first == b.first) return a.second < b.second;
return a.first > b.first;
}
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
c... | 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long int ivalue(string s) {
long long int x = 0;
stringstream obj(s);
obj >> x;
return x;
}
const long long int M = 1e9 + 7;
const long long int N = 1e5 + 5;
const long long int inf = 2e18;
long long int mod(long long int x) { return (x % M); }
long long int mo... | 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long n, m, a1, b1;
cin >> n;
vector<int> a(n);
priority_queue<pair<int, int>> y;
for (int i = 0; i < n; i++) {
cin >> a[i];
y.push({a[i], -i});
}
vector<vector<int>> e(n);
for ... | 10 | CPP |
n=int(input())
a=[int(i) for i in input().split()]
b=sorted(a)
c=[]
c.append(a)
for i in range(1,n+1):
k=len(c[i-1])-1-c[i-1][::-1].index(b[i-1])
c.append(c[i-1][0:k]+c[i-1][k+1::])
m=int(input())
for i in range (m):
k,pos=map(int,input().split())
print (c[len(c)-k-1][pos-1])
| 10 | PYTHON3 |
import math
def getFirstSetBitPos(n):
return math.log2(n & -n) + 1
def find_div(x):
ls=[]
for i in range(2,int(x**0.5)+1):
if x%i==0:
ls.append(i)
if i!=x//i:
ls.append(x//i)
return sorted(ls)
from collections import Counter
#for _ in range(1):
n = int(input())
#arr = list(map(int, input().split()))
... | 10 | PYTHON3 |
#include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimization("03")
#pragma GCC optimization("unroll-loops")
using namespace std;
const int maxn = 200001;
const int maxe = 20;
int a[maxn], b[maxn], c, k, pa[maxn], x, y, q, sol, d, d2, mod = 1000000007, j;
int m, n;
char h;
set<int> se;
string s;
pair<int... | 10 | CPP |
def mergesort(l, r, arr, pos):
if r - l == 1:
return arr, pos
m = (l + r) // 2
arr, pos = mergesort(l, m, arr, pos)
arr, pos = mergesort(m, r, arr, pos)
c = [0 for i in range(r)]
d = [0 for i in range(r)]
poi_a = l
poi_b = m
for i in range(l, r):
if poi_a == m:
... | 10 | PYTHON3 |
n = int(input())
a = [int(i) for i in input().split()]
b = [(a[i], n - i) for i in range(n)]
b.sort(reverse=True)
b = [(b[i][0], n - b[i][1]) for i in range(n)]
m = int(input())
for qu in range(m):
k, p = map(int, input().split())
c = b[:k]
c.sort(key = lambda x: x[1])
print(c[p-1][0])
| 10 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
bool compare(pair<int, int> p1, pair<int, int> p2) {
if (p1.first == p2.first) {
if (p1.second < p2.second)
return true;
else
return false;
} else if (p1.first < p2.first)
return false;
else
return true;
}
int main() {
ios_base::sync_with... | 10 | CPP |
import sys as _sys
def main():
t = 1
for i_t in range(t):
n, = _read_ints()
a = tuple(_read_ints())
m, = _read_ints()
queries = (tuple(_read_ints()) for i_query in range(m))
result = process_queries(a, queries)
print(*result, sep='\n')
def _read_line():
re... | 10 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
void itval(istream_iterator<string> it) {}
template <typename T, typename... Args>
void itval(istream_iterator<string> it, T a, Args... args) {
cerr << *it << " = " << a << endl;
itval(++it, args...);
}
template <typename T>
inline void print(T x) {
cout << x << "\n";... | 10 | CPP |
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx")
#pragma GCC optimize("unroll-loops")
using namespace std;
using ll = long long;
using ld = long double;
using db = double;
using str = string;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using pd = ... | 10 | CPP |
"""
Author - Satwik Tiwari .
18th Feb , 2021 - Thursday
"""
#===============================================================================================
#importing some useful libraries.
from __future__ import division, print_function
from fractions import Fraction
import sys
import os
from io import Byt... | 10 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using ii = pair<int, int>;
using vii = vector<ii>;
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vii a(n);
for (int i = 0; i < (n); i++) cin >> a[i].first, a[i].second ... | 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
mt19937 rnd(time(0));
bool comp(pair<int, int> &a, pair<int, int> &b) {
return a.first < b.first || (a.first == b.first && a.second > b.second);
}
int main() {
int n;
cin >> n;
vector<int> g(n);
vector<pair<int, int> > v(n);
for (int i = 0; i < n; i++) {
cin... | 10 | CPP |
import sys
from collections import defaultdict
n=int(sys.stdin.readline())
arr=list(map(int,sys.stdin.readline().split()))
l=[i for i in arr]
for i in range(n):
arr[i]=[arr[i],-i]
arr.sort()
dic=defaultdict(list)
'''for i in range(1,n+1):
dic[i]=dic[i-1]+[-arr[n-i][1]]
dic[i].sort()'''
#print(dic,'dic')
z=l... | 10 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e9 * 10;
long long arr[200];
vector<pair<long long, long long>> sortedVec, vec2;
bool comp(pair<long long, long long> a, pair<long long, long long> b) {
if (a.first > b.first) return true;
if (b.first > a.first) return false;
if (a.second > b.se... | 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
struct hash_pair {
template <class T1, class T2>
size_t operator()(const pair<T1, T2>& p) const {
auto hash1 = hash<T1>{}(p.first);
auto hash2 = hash<T2>{}(p.second);
return hash1 ^ hash2;
}
};
long long int gcd(long long int a, long long int b) {
if (a ... | 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
bool cmp(pair<int, int>& a, pair<int, int>& b) {
if (a.first > b.first)
return true;
else if (a.first == b.first)
return a.second < b.second;
return false;
}
bool cmp2(pair<int, int>& a, pair<int, int>& b) { return a.second < b.second; }
void solve() {
int n... | 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
bool comp(pair<int, int> p1, pair<int, int> p2) {
if (p1.first != p2.first)
return p2.first > p1.first;
else
return p2.second < p1.second;
}
void solve() {
int n, x;
cin >> n;
vector<pair<int, int>> v(n);
for (int i = 0; i < n; i++) {
cin >> x;
v... | 10 | CPP |
#include <bits/stdc++.h>
const int LG = 21;
const int N = 400005;
const long long MOD = 1e9 + 7;
const long long INF = 1e9;
const long long INFLL = 1e18;
using namespace std;
int cx[4] = {-1, 0, 1, 0};
int cy[4] = {0, -1, 0, 1};
string Yes[2] = {"No", "Yes"};
string YES[2] = {"NO", "YES"};
long long inq(long long x, lo... | 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
string gh = "here";
bool cmp(pair<int, int> a, pair<int, int> b) {
if (a.first > b.first) {
return true;
} else if (a.first == b.first and a.second < b.second) {
return true;
}
return false;
}
bool cmp2(pair<int, int> a, pair<int, int> b) {
if (a.second < ... | 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
constexpr int N = 200000;
int fen[N + 1];
void add(int x) {
++x;
while (x <= N) {
++fen[x];
x += x & -x;
}
}
int kth(int k) {
int x = 0;
for (int i = 18; i >= 0; --i)
if (x + (1 << i) <= N && fen[x + (1 << i)] <= k) {
x += (1 << i);
k -= fe... | 10 | CPP |
# Legends Always Come Up with Solution
# Author: Manvir Singh
import os
import sys
from io import BytesIO, IOBase
class SortedList:
def __init__(self, iterable=None, _load=200):
"""Initialize sorted list instance."""
if iterable is None:
iterable = []
values = sorted(iterable)
... | 10 | PYTHON3 |
n=int(input())
a=[int(x) for x in input().split()]
b = [[] for i in range(n + 3)]
for g in range(1, n + 1):
k = g
cnt = 0
mm = 10 ** 10
m = 0
for i in range(n):
if len(b[g]) != 0:
mm = min(b[g])
if cnt == k:
if a[i] > mm:
for j in range(k - 1, ... | 10 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int MAX = 1e5 + 9;
const long long mod = 1e9 + 7;
vector<bool> prime(MAX, 1);
vector<int> spf(MAX, 1);
vector<int> primes;
void sieve() {
prime[0] = prime[1] = 0;
spf[2] = 2;
for (long long i = 4; i < MAX; i += 2) {
spf[i] = 2;
prime[i] = 0;
}
primes... | 10 | CPP |
def main():
n = int(input())
a = list(enumerate(map(int, (input().split()))))
a.sort(key = lambda item: (item[1], -item[0]))
#print(a)
m = int(input())
for i in range(m):
k, pos = map(int, input().split())
s = a[-k:]
s = sorted(s)
print(s[pos - 1][1])
main() | 10 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
void ios1() {
ios_base::sync_with_stdio(0);
cout.tie(0);
cin.tie(0);
}
bool cmd(pair<long long, int> a, pair<long long, int> b) {
if (a.first > b.first)
return 0;
else if (a.first < b.first)
return 1;
else
return (a.second > b.second);
}
int main() {... | 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
bool mycomp1(pair<int, int> a, pair<int, int> b) {
if (a.first != b.first) {
return (a.first < b.first);
} else {
return (a.second > b.second);
}
}
bool mycomp2(pair<int, int> a, pair<int, int> b) {
return (a.second < b.second);
}
void solve() {
int n, m;
... | 10 | CPP |
n = int(input())
aa = [int(i) for i in input().split()]
dic = {}
for i in range(0,n):
if aa[i] not in dic:
dic[aa[i]] = [i]
else:
dic[aa[i]].append(i)
ll = sorted(dic)[::-1]
m = int(input())
for _ in range(0,m):
k,pos = map(int,input().split())
ans = []
for i in range(0,len(ll)):
... | 10 | PYTHON3 |
n = int(input())
a = list(map(int, input().split()))
u = sorted(a)
m = int(input())
ans = []
for _ in range(m):
k, pos = map(int, input().split())
d = []
p = []
s = u[n - k:]
for i in range(n):
if len(d) == k:
break
for j in range(len(s)):
if s[j] == a[i]:
... | 10 | PYTHON3 |
n = int(input())
a = list(map(int, input().split()))
a1 = sorted(a, key=lambda x: -x)
m = int(input())
for i in range(m):
k, p = list(map(int, input().split()))
c = {}
c1 = {}
s = []
for j in range(n+1):
s.append({})
pos = {}
for j in range(n):
c[a1[j]] = 0
c1[a1[j]] ... | 10 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
set<pair<int, int> > t;
int a[200105];
vector<pair<int, int> > vec[200105];
int ans[200105];
int seg[200105 << 2];
void build(int t, int i, int j) {
if (i == j) {
seg[t] = 1;
return;
}
int left = t << 1, right = left | 1, mid = (i + j) >> 1;
build(left, i, m... | 10 | CPP |
def main():
import os
from io import BytesIO
input = BytesIO(os.read(0, os.fstat(0).st_size)).readline
n = int(input())
a = [(int(el), -ind) for ind, el in enumerate(input().split())]
a.sort(reverse=True)
for i in range(int(input())):
x, y = map(int, input().split())
t = sort... | 10 | PYTHON3 |
from collections import defaultdict
n=int(input())
a=[int(x) for x in input().split()]
b=sorted(a,reverse=True)
for _ in range(int(input())):
k,pos=map(int,input().split())
d=defaultdict(int)
for i in range(k):
d[b[i]]+=1
count=0
num=-1
for x in a:
if d[x]:
d[x]-=1
count+=1
if count==pos:
num=x
... | 10 | PYTHON3 |
#Code by Sounak, IIESTS
#------------------------------warmup----------------------------
import os
import sys
import math
from io import BytesIO, IOBase
from fractions import Fraction
from collections import defaultdict
from itertools import permutations
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
... | 10 | PYTHON3 |
#include <bits/stdc++.h>
const long long MAX = 2e5 + 5;
using namespace std;
long long fen[MAX], a[MAX];
bool cnt[MAX];
bool compare(const pair<long long, long long> &x,
const pair<long long, long long> &y) {
if (x.second == y.second) return x.first < y.first;
return x.second > y.second;
}
void f_inser... | 10 | CPP |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.