text stringlengths 49 983k |
|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k, i, h[100000];
cin >> n >> k;
for (i = 0; i < n; i++) cin >> h[i];
i = 1;
while (k > i) {
k = k - i;
i++;
}
cout << h[k - 1];
}
|
#include <bits/stdc++.h>
int a[100005];
int main() {
int n;
long long k;
scanf("%d%I64d", &n, &k);
for (int i = 1; i <= n; ++i) {
scanf("%d", a + i);
}
long long m = (long long)sqrt(2.0 * k);
long long tmp;
for (int i = std::max(1ll, m - 5); i <= m + 5; ++i) {
tmp = (1 + i) * 1ll * i / 2;
if (tmp >= k) {
m = i;
if (tmp > k) {
m--;
tmp = (1 + m) * m / 2;
}
break;
}
}
if (tmp == k) {
printf("%d\n", a[m]);
} else {
int p = k - tmp;
printf("%d\n", a[p]);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a[100002], x;
unsigned int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++) cin >> a[i];
for (unsigned int i = 1; i <= n; i++) {
if (i * (i + 1) / 2 >= k) {
x = i * (i + 1) / 2 - k;
cout << a[i - x];
break;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int const siz = 1e9, bound = 7e5, mod = siz + 9;
long long const oo = 1e18;
int aa[bound];
int main() {
int n, k;
scanf("%d", &n), scanf("%d", &k);
for (int(i) = 0; (i) < (n); (i)++) scanf("%d", &aa[i]);
int l = 0, r = n, mid, rob;
while (l <= r) {
mid = (l + r) >> 1;
if ((long long)mid * (mid + 1) / 2 >= k) {
rob = mid;
r = mid - 1;
} else
l = mid + 1;
}
long long cur = (long long)(rob - 1) * rob / 2 + 1;
int idn = 0;
while (cur < k) {
cur++;
idn++;
}
printf("%d\n", aa[idn]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin >> n;
long long int k;
cin >> k;
long long int a[n];
for (long long int i = 0; i < n; i++) cin >> a[i];
long long int i;
if (k == 1) {
cout << a[0];
} else {
for (i = 1; i <= n; i++) {
long long int z = i;
z *= (z + 1);
z /= 2;
if (z >= k) {
break;
}
}
long long int h = i - 1;
i = i * h;
i /= 2;
cout << a[k - i - 1];
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long n, k, i, a[100005], s[100005];
cin >> n >> k;
s[0] = 0;
for (i = 1; i <= n; ++i) {
cin >> a[i];
s[i] = s[i - 1] + i;
}
if (k == s[n]) {
cout << a[n];
return 0;
}
for (i = 1; i <= n; ++i) {
if (k > s[i] && k < s[i + 1]) {
cout << a[k - s[i]];
return 0;
} else if (k == s[i]) {
cout << a[i];
return 0;
}
}
return 0;
}
|
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:66777216")
using namespace std;
int main() {
int n, k, i;
cin >> n >> k;
--k;
for (i = 1; i <= n; ++i) {
if (k < i) {
break;
}
k -= i;
}
int a[300000];
for (int j = 0; j < n; ++j) {
cin >> a[j];
}
cout << a[k] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1.0);
const long long INF = 2e18;
void print(int a[], int n) {
for (int i = 0; i < n; i++) cout << a[i] << " ";
cout << "\n";
}
int main() {
int n, x;
cin >> n >> x;
int a[n];
for (int i = 0; i < (n); i++) cin >> a[i];
int i = 1, y = x;
while (y - i > 0) y -= i, i++;
cout << a[y - 1] << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a[100009];
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = 1; i <= n; i++) {
if (k <= i)
break;
else
k -= i;
}
cout << a[k] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long n, k, ans, a[2333333];
long long sum(int ccd) { return (ccd * (1 + ccd)) / 2; }
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) cin >> a[i];
for (int i = 1; i <= n; i++) {
if (k > i)
k -= i;
else {
cout << a[k];
return 0;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9, mod = 1e9 + 7, N = 3e5;
const long long linf = 1e18;
long long n, k, m;
int a[N];
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
for (long long i = 1; i <= n; i++) {
if (m + i >= k) {
k -= m;
cout << a[k];
return 0;
}
m += i;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, k;
cin >> n >> k;
long long int a[n + 10];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
long long int cnt = 1, temp, sum = 0;
while (1) {
temp = sum;
if (cnt % 2 == 0) {
sum = (cnt / 2) * (cnt + 1);
} else {
sum = ((cnt + 1) / 2) * cnt;
}
if (sum == k) {
cout << a[cnt] << endl;
return 0;
} else if (sum > k) {
long long int res = k - temp;
cout << a[res] << endl;
return 0;
}
cnt++;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
std::ios::sync_with_stdio(false);
long long int n, k;
cin >> n >> k;
vector<long long int> vec(n);
for (int i = 0; i < n; i++) cin >> vec[i];
long long int ans = 0, idx = 1;
while (k > idx) {
k -= idx;
idx++;
}
cout << vec[k - 1] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k, i;
cin >> n >> k;
long long a[n];
for (i = 0; i < n; i++) {
cin >> a[i];
}
i = 1;
while (true) {
long long t = i * (i + 1) / 2;
if (t >= k) {
cout << a[k - (i - 1) * i / 2 - 1];
exit(0);
}
i++;
}
return 0;
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V>
void __print(const pair<T, V> &x) {
cerr << '{';
__print(x.first);
cerr << ',';
__print(x.second);
cerr << '}';
}
template <typename T>
void __print(const T &x) {
int f = 0;
cerr << '{';
for (auto &i : x) cerr << (f++ ? "," : ""), __print(i);
cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V>
void _print(T t, V... v) {
__print(t);
if (sizeof...(v)) cerr << ", ";
_print(v...);
}
void swap(long long int &x, long long int &y) {
long long int temp = y;
y = x;
x = temp;
}
long long int powa(long long int a, long long int b,
long long int m = 1000000007) {
if (b == 0)
return 1ll;
else if (b == 1)
return a;
else {
long long int x = powa(a, b / 2, m);
x *= x;
x %= m;
if (b % 2) {
x *= a;
x %= m;
}
return x;
}
}
string dectobin(long long int n) {
string s = bitset<64>(n).to_string();
const auto loc1 = s.find('1');
if (loc1 != string::npos) return s.substr(loc1);
return "0";
}
template <class avgType>
avgType avg(avgType a, avgType b) {
return (a + b) / 2;
}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng64(chrono::steady_clock::now().time_since_epoch().count());
int randInt() { return rng() % INT_MAX; }
long long int randLL() { return rng64() % LLONG_MAX; }
vector<int> hashmods = {1000000007, 1000000009, 1000000021,
1000000033, 1000000087, 1000000093};
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long int n, k;
cin >> n >> k;
long long int arr[n];
for (long long int i = 0; i < n; ++i) {
cin >> arr[i];
}
long long int ans = 1;
while (k > ans) {
k -= ans;
ans++;
}
cout << arr[k - 1] << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long int n, k;
cin >> n >> k;
long int prev = 1, len = 1, next = 1;
while (!(k <= next && k >= prev)) {
prev = next + 1;
len = len + 1;
next = prev + len - 1;
}
k = k - (prev - 1);
for (long int i = 1; i <= n; i++) {
long int x;
cin >> x;
if (i == k) cout << x << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
long long arr[n + 10], mul = 1, total = 0;
for (int i = 0; i < n; i++) {
cin >> arr[i];
total += ((i + 1));
}
for (int i = 0; i < total; i++) {
if (k - (i + 1) > 0) {
k = k - (i + 1);
} else {
cout << arr[k - 1] << endl;
break;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int id[100100];
int n;
unsigned long long k;
int main() {
ios ::sync_with_stdio(false);
cin.tie(0);
cin >> n >> k;
for (int i = 1; i <= n; i++) cin >> id[i];
unsigned long long x = 2 * k;
unsigned long long h = (unsigned long long)sqrt(x);
if (h * (h + 1) / 2 > k) h--;
k -= (h * (h + 1) / 2);
if (!k)
cout << id[h];
else
cout << id[k];
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long N, M;
cin >> N >> M;
vector<long long> arr(N);
for (long long i = 0; i < N; ++i) cin >> arr[i];
long long idx = 0, i = 1;
while (idx < M) {
idx += i;
i++;
}
cout << arr[M - (idx - i + 1) - 1] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
const long long N = 1000;
int32_t main() {
long long n;
cin >> n;
long long k;
cin >> k;
vector<long long> a(n);
for (long long i = 0; i < n; i++) {
cin >> a[i];
}
long long bound = 0;
for (long long i = 1;; i++) {
long long temp = (i * (i - 1)) / 2 + 1;
if (temp > k) {
bound = i - 1;
bound = (bound * (bound - 1)) / 2 + 1;
break;
}
}
k -= bound;
for (long long i = 0; i < n; i++) {
if (k == 0) {
cout << a[i] << "\n";
break;
} else {
k--;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const double PI = acos(-1.0);
const int N = 100010;
vector<long long> sum;
int v[N];
int main(void) {
int n;
long long k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
scanf("%d", v + i);
}
sum.push_back(0);
for (int i = 1; i <= n; i++) {
sum.push_back(sum[i - 1] + (i * 1LL));
}
sum.push_back(LLONG_MAX);
int q = upper_bound(sum.begin(), sum.end(), k) - sum.begin() - 1;
if (k == sum[q]) {
printf("%d\n", v[q - 1]);
} else
printf("%d\n", v[k - sum[q] - 1]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[111111];
int main() {
int n, k;
scanf("%d%d", &n, &k);
for (int i = 0; i < n; i++) scanf("%d", &a[i]);
--k;
for (int i = 1;; i++) {
if (k < i) {
cout << a[k];
return 0;
}
k -= i;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
;
int a, b;
cin >> a >> b;
int arr[a + 1];
for (int i = 1; i <= a; i++) {
cin >> arr[i];
}
int i = 1;
for (i = 1; i <= a; i++) {
if (b > 0)
b -= i;
else {
b += i;
cout << arr[b - 1];
break;
}
}
if (b <= 0) {
b += i;
cout << arr[b - 1];
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long N, n, i, j, k, d, K, ara[100005], s = 0;
cin >> N >> K;
for (i = 1; i <= N; i++) cin >> ara[i];
for (i = 1; i <= N; i++) {
if (s + i >= K) break;
s += i;
}
cout << ara[K - s] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
vector<int> ids;
for (int i = 0; i < n; i++) {
int t;
cin >> t;
ids.push_back(t);
}
int last = 0;
for (int i = 1; i <= n + 1; i++) {
int t;
long long ki = (long long)i * (i + 1) / 2;
if (ki >= k) {
last = i - 1;
break;
}
}
k -= (long long)last * (last + 1) / 2;
cout << ids[k - 1] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[100000];
int k;
int n;
int sum = 0;
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
if (k > i + 1) {
k -= i + 1;
} else {
cout << a[k - 1];
break;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k, a[100005];
cin >> n >> k;
for (int i = 1; i <= n; i++) cin >> a[i];
long long cur = 1;
while (true) {
if (cur * (cur + 1) / 2 <= k)
cur++;
else
break;
}
if (cur * (cur + 1) / 2 > k) cur--;
if (k == cur * (cur + 1) / 2)
cout << a[cur];
else
cout << a[k - cur * (cur + 1) / 2];
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int a[n];
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
long long s = 0;
k--;
for (int i = 0; i < n; ++i) {
s += i;
if (s > k) {
s -= i;
break;
}
}
k = k - s;
cout << a[k] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int v[100010];
int main(void) {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> v[i];
}
int i = 0;
while (k - (i + 1) > 0) {
k -= i + 1;
i++;
}
cout << v[k];
return 0;
}
|
#include <bits/stdc++.h>
const unsigned long long inf = 1LL << 61;
const double eps = 1e-5;
using namespace std;
priority_queue<int, vector<int>, greater<int> > pq;
struct Node {
int x, y;
};
struct cmp {
bool operator()(Node a, Node b) {
if (a.x == b.x) return a.y > b.y;
return a.x > b.x;
}
};
bool cmp(int a, int b) { return a > b; }
int a[100100];
int main() {
int n;
long long k;
while (cin >> n >> k) {
for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
long long tmp;
long long x;
for (x = 1;; x++) {
tmp = x * (1 + x) / 2;
if (tmp >= k) break;
}
k -= x * (x - 1) / 2;
cout << a[k] << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, i, k, j;
int a[100010];
scanf("%d%d", &n, &k);
for (i = 1; i <= n; i++) scanf("%d", &a[i]);
int c = 1;
while (k > c && c <= n) {
k -= c;
c++;
}
k = k % n;
if (k == 0) k = n;
printf("%d", a[k]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long x, y, ay7aga, natg;
map<int, long long> mp;
vector<int> v;
cin >> x >> y;
int arr[x + 1];
for (long long i = 1; i <= x; i++) {
cin >> ay7aga;
if (y == 1 && i == 1) {
v.push_back(ay7aga);
}
mp[ay7aga] = ((i + 1) * (i / 2.0));
arr[i] = ay7aga;
if (y <= mp[ay7aga]) {
natg = y - mp[arr[i - 1]];
natg = arr[natg];
if (v.empty()) v.push_back(natg);
}
}
cout << v[0];
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k, i, j, a[100009], sum;
cin >> n >> k;
for (i = 0; i < n; i++) cin >> a[i];
for (i = 1; i < n; i++) {
sum = (i * (i + 1)) / 2;
if (sum >= k) break;
}
i--;
sum = (i * (i + 1)) / 2;
k -= sum;
cout << a[k - 1] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
long long k;
cin >> n >> k;
int a[100000];
for (int i = 0; i < n; i++) cin >> a[i];
long long j = 1;
while (true) {
if ((j * (j + 1) / 2) > k) break;
j++;
}
j--;
int m = k - j * (j + 1) / 2;
if (m == 0) m = j;
m--;
cout << a[m];
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int getInt() {
int x;
scanf("%d", &x);
return x;
}
long long getLongLong() {
long long x;
scanf("%I64d", &x);
return x;
}
double getDouble() {
double x;
scanf("%lf", &x);
return x;
}
char getChar() {
char x;
scanf("%c", &x);
return x;
}
template <typename t>
t abs(t a) {
if (a >= 0) return a;
return -a;
}
vector<string> split(const string& s, char c) {
vector<string> v;
stringstream ss(s);
string x;
while (getline(ss, x, c)) v.emplace_back(x);
return move(v);
}
void err(vector<string>::iterator it) {}
template <typename T, typename... Args>
void err(vector<string>::iterator it, T a, Args... args) {
cerr << it->substr((*it)[0] == ' ', it->length()) << " = " << a << " ";
err(++it, args...);
}
int amain() {
ios_base::sync_with_stdio(false);
cin.tie(0);
;
int n;
cin >> n;
int mx = (n / 7) * 2;
int t = n % 7;
if (t > 2)
mx += 2;
else
mx += t;
int mn = (n / 7) * 2;
if (t == 6) mn++;
cout << mn << " " << mx;
return 0;
}
int a[100005];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
;
long long int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) cin >> a[i + 1];
long long int i;
for (i = 1; i <= n; i++) {
if (((i * i + i) / 2) == k) {
cout << a[i];
return 0;
}
if (((i * i + i) / 2) > k) {
i--;
break;
}
}
k -= (i * i + i) / 2;
if (k == 0) k++;
cout << a[k];
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, i;
long long k, b[100000];
cin >> n >> k;
for (i = 0; i < n; i++) {
scanf("%I64d", &b[i]);
}
for (i = 0; i < n; i++) {
if (k > i + 1)
k -= i + 1;
else {
cout << b[k - 1];
return 0;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
int a[maxn], n, m, b[maxn];
int k;
long long sum[maxn];
int main() {
while (scanf("%d %d", &n, &k) != EOF) {
memset(sum, 0LL, sizeof(sum));
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
b[i] = i;
sum[i] = sum[i - 1] + b[i];
}
int pos = lower_bound(sum + 1, sum + n + 1, k) - sum;
long long tmp = sum[pos] - k;
printf("%d\n", a[pos - tmp]);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, k, x, i = 1;
vector<int> v;
int main() {
for (cin >> k >> k; cin >> x;) v.push_back(x);
for (; k > i; i++) k -= i;
cout << v[k - 1];
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 300000;
int i, n, a[N], k;
int main() {
scanf("%d%d", &n, &k);
for (i = 1; i <= n; i++) scanf("%d", &a[i]);
for (i = 1; i <= n; i++)
if (i >= k)
break;
else
k -= i;
printf("%d\n", a[k]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, k, x = 0, y = 0;
cin >> n >> k;
long long int a[n + 1];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
long long int i = 1;
for (i = 1; i <= n, x < k; i++) {
x += i;
}
long long int diff = x - k;
if (i - diff > 1)
cout << a[i - diff - 1] << endl;
else
cout << a[i - diff] << endl;
return 0;
}
|
#include <bits/stdc++.h>
int main() {
long long int safa[1000000], i, n, j, k, m;
scanf("%d%d", &n, &m);
for (i = 1; i <= n; i++) {
scanf("%d", &safa[i]);
}
for (i = 1; i < m; i++) {
m -= i;
}
printf("%d", safa[m]);
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T>
bool umin(T& a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T>
bool umax(T& a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
const int N = 1e5 + 7;
const int INF = 1e9 + 7;
int a, b, c, d[N], n, m;
long long tot;
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) scanf("%d", &d[i]);
for (int i = 1; i <= n; i++) {
tot += i;
if (tot >= m) {
tot -= i;
printf("%d\n", d[m - tot]);
return 0;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, a1[100000], a, k, x;
cin >> n;
cin >> k;
a = 1;
x = 1;
for (int i = 0; i < n; i++) cin >> a1[i];
while (a < k) {
x++;
a += x;
}
k = k - (a - x);
cout << a1[k - 1];
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 7;
const int M = 2e6 + 7;
const int lim = 2e5;
const int mod = 998244353;
const int inf = 0x3f3f3f3f;
int a[N];
int main() {
int n, k, t = 1, sum = 0, ans;
scanf("%d%d", &n, &k);
while (k > t) k -= t, t++;
for (int i = 1, x; i <= n; i++) {
scanf("%d", &x);
if (i == k) ans = x;
}
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
unsigned long long n, k, a[100000 + 10000];
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (unsigned long long i = 1; i <= n; i++) {
if ((i * (i + 1)) / 2 >= k) {
if (k == ((i * (i - 1)) / 2)) {
cout << a[i - 1];
return 0;
} else {
cout << a[k - ((i * (i - 1)) / 2)];
return 0;
}
}
}
}
|
#include <bits/stdc++.h>
#pragma warning(disable : 4996)
using namespace std;
int n, m, a[100009];
int main() {
scanf("%d%d", &n, &m), m--;
for (int i = 0; i < n; i++) scanf("%d", &a[i]);
for (int i = 1; i <= n + 1; i++) {
int r = 1LL * i * (i + 1) / 2;
if (r > m) {
int s = 1LL * i * (i - 1) / 2;
printf("%d\n", a[m - s]);
break;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, k;
cin >> n >> k;
long long int A[n];
for (int i = 0; i < n; i++) {
cin >> A[i];
}
long long int zz;
long long int i;
for (i = 1; i <= n; i++) {
zz = i * (i + 1) / 2;
if (k - zz <= i + 1) {
break;
}
}
if (k - zz == 0)
cout << A[i - 1] << endl;
else
cout << A[k - zz - 1] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n = 0;
long long int k = 0;
long long int output = 0;
long long int counter = 0;
cin >> n >> k;
long long int arr[n + 1];
for (long long int i = 1; i <= n; i++) {
cin >> arr[i];
counter = counter + i;
if (counter >= k) {
counter = counter - i;
k = k - counter;
output = arr[k];
break;
}
}
cout << output;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int long long n, k;
cin >> n >> k;
vector<int> arr, xr;
for (long long i = 0; i < n; i++) {
long long x;
cin >> x;
arr.push_back(x);
}
long long sum = 0, sumprv = 0;
long long i;
for (i = 0; i < n; i++) {
sumprv = sum;
sum += i + 1;
if (sum >= k) break;
}
long long r = k - sumprv;
cout << arr[r - 1];
}
|
#include <bits/stdc++.h>
int main() {
long long n, k, a[100001], i, s, c, d;
while (~scanf("%lld%lld", &n, &k)) {
s = 0;
c = 0;
for (i = 1; i <= n; i++) {
scanf("%lld", &a[i]);
}
while (s < k) {
c++;
s += c;
}
s = s - c;
d = k - s;
printf("%lld\n", a[d]);
}
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename P, typename Q>
ostream& operator<<(ostream& os, pair<P, Q> p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
int main(int argc, char* argv[]) {
int n, k;
while (scanf("%d%d", &n, &k) == 2) {
vector<int> v;
for (int i = 0; i < n; ++i) {
int m;
scanf("%d", &m);
v.push_back(m);
}
long long int sum = 0;
for (int i = 0; i < n; ++i) {
long long int s = sum + i + 1;
if (k <= s) {
printf("%d\n", v[k - sum - 1]);
break;
}
sum = s;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
struct IO {
IO() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
} _;
long long n, m, len, k, t, a, b;
long long arr[100001];
int main() {
cin >> n >> k;
for (long long i = 0; i < n; i++) cin >> arr[i];
long long x = 0;
while ((x + 1) * (x + 2) / 2 <= k - 1) x++;
long long idx = x * (x + 1) / 2;
cout << arr[k - idx - 1] << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
int n, arr[100009], z = 1;
long long m;
int main() {
scanf("%d%lld", &n, &m);
for (int i = 1; i <= n; i++) scanf("%d", arr + i);
while (m > 0) {
if (m - z == 0)
printf("%d", arr[z]);
else if (m - z < 0)
printf("%d", arr[m]);
m -= z;
z++;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long hitung[100005];
long long data[100005];
int main() {
int n, k;
ios::sync_with_stdio(0);
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> data[i];
}
hitung[1] = 1;
for (int i = 2; i <= n; i++) hitung[i] = hitung[i - 1] + i;
int up = lower_bound(hitung + 1, hitung + n + 1, k) - hitung;
int jadi = hitung[up] - up;
int pos = k - jadi;
cout << data[pos] << '\n';
}
|
#include <bits/stdc++.h>
const int MYDD = 1e5 + 1103;
int robot[MYDD];
int main() {
int n, k;
while (scanf("%d%d", &n, &k) != EOF) {
for (int j = 1; j <= n; j++) scanf("%d", &robot[j]);
for (int i = 1; i <= n; i++) {
if (k - i > 0)
k = k - i;
else
break;
}
printf("%d\n", robot[k]);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 100;
long long ans[maxn];
int main() {
long long n, m;
scanf("%I64d%I64d", &n, &m);
for (int i = 1; i <= n; ++i) scanf("%d", &ans[i]);
int res1 = 0;
for (int i = 1; i <= n; i++) {
if ((long long)i * (1 + i) / 2 > m) {
res1 = i;
break;
} else if ((long long)i * (1 + i) / 2 == m) {
cout << ans[i] << endl;
return 0;
}
}
cout << ans[(long long)m - res1 * (res1 - 1) / 2] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
const int N = 100010;
int m[100010];
int main() {
int n;
long long k;
scanf("%d%I64d", &n, &k);
m[0] = 0;
for (int i = 1; i < n + 1; i++) scanf("%d", &m[i]);
int ans = 0;
int pos = -1;
for (long long i = 1; i <= n; i++) {
long long x = i * (i + 1) / 2;
if (k == x) {
printf("%d\n", m[i]);
return 0;
} else if (k > x) {
long long y = (i + 1) * (i + 2) / 2;
if (k < y) {
int ans = k - x;
printf("%d\n", m[ans]);
return 0;
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k;
while (~scanf("%lld %lld", &n, &k)) {
long long i = 1;
while (i * (i + 1) / 2 <= k) ++i;
--i;
int rest = k - i * (i + 1) / 2;
int pos;
if (rest == 0)
pos = i;
else
pos = rest;
int ans;
for (int i = 1; i <= n; ++i) {
scanf("%d", &rest);
if (i == pos) ans = rest;
}
printf("%d\n", ans);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, k, id[100100];
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> id[i];
if (i < k)
k -= i;
else {
cout << id[k];
return 0;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[100001];
int main() {
ios_base::sync_with_stdio(0);
int n, k;
long long sum = 0;
cin >> n >> k;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
sum += i;
if (sum >= k) {
for (int j = i; j >= 1; --j) {
if (sum == k) {
cout << a[j];
return 0;
}
sum--;
}
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int a[100000];
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) cin >> a[i];
int i = 1;
while (k > i) {
k -= i++;
}
cout << a[--k];
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int intf = 0x3f3f3f3f;
int a[100000];
int main() {
int n, k;
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
if (k > i) k -= i;
}
printf("%d\n", a[k]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long b[100001];
long long k;
int n;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) cin >> b[i];
long long now = 0, cas = 1;
while (now < k) {
now += cas;
cas++;
}
cout << b[k - (now - cas + 2) + 1] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, i, *mas;
cin >> N >> K;
mas = new int[N];
for (i = 0; i < N; i++) cin >> mas[i];
int otv = 0;
i = 1;
while (otv < K) {
otv += i;
i++;
}
i--;
cout << mas[i - otv + K - 1];
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int n, k, id[100000], i;
scanf("%d%d", &n, &k);
for (i = 0; i < n; ++i) {
scanf("%d", &id[i]);
}
for (i = 1; k > i; ++i) {
k -= i;
}
printf("%d", id[k - 1]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
long long n, k;
cin >> n >> k;
vector<int> ids(n + 1);
for (int i = 1; i <= n; i++) cin >> ids[i];
long long val = 0;
for (int i = (1 << 30); i >= 1; i >>= 1) {
if ((val + i) * (val + i + 1) / 2 < k) {
val += i;
}
}
int res = k - (val) * (val + 1) / 2;
cout << ids[res] << '\n';
}
int main() {
ios::sync_with_stdio(0);
cin.tie(nullptr);
int t = 1;
while (t--) {
solve();
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long n, i, nr = 0, j, k, m, s, Max, x, Min = 10000000000;
bool in = 0;
long long v[1000000];
int main() {
cin >> n >> k;
for (i = 0; i < n; i++) {
cin >> v[i];
}
nr = 1;
while (k > nr) {
k = k - nr;
nr++;
}
cout << v[k - 1];
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using namespace std::chrono;
template <typename T>
void print(string name, vector<T>& v) {
if (name.size()) cout << name << ": ";
int s = (int)v.size();
for (int i = (int)(0); i < (int)(s); ++i) cout << v[i] << " ";
cout << endl;
}
template <typename T>
void print(vector<T>& v) {
print("", v);
}
int main() {
int test_cases = 1;
ios::sync_with_stdio(false);
for (int test_case = (int)(0); test_case < (int)(test_cases); ++test_case) {
long long n, k;
cin >> n >> k;
vector<long long> id(n + 1);
for (int i = (int)(1); i <= (int)(n); ++i) cin >> id[i];
double delta = sqrt(1.0 + 8 * k);
double p2 = (delta - 1) / 2;
long long p = (long long)p2;
long long j = k - p * (p + 1) / 2;
if (j == 0) j = p;
cout << id[j] << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, c;
int k;
(cin >> n);
;
(cin >> k);
;
k--;
vector<long long> x(n);
for (auto i = (0); i < (n); i++) (cin >> x[i]);
;
c = (int)floor(sqrt((double)k * 2.0 + 0.25) - 0.5);
k = abs(k - (c * (c + 1) / 2));
cout << x[k] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<long long> id;
long long n, k, m, p, c = 0, ct = 0;
cin >> n >> k;
if (n == 1) {
long long t;
cin >> t;
cout << t << endl;
} else if (n == 2) {
for (long long x = 0; x < n; x++) {
long long i;
cin >> i;
id.push_back(i);
}
if (k == 1)
cout << id[0] << endl;
else if (k == 2)
cout << id[0] << endl;
else
cout << id[1] << endl;
} else {
for (long long x = 0; x < n; x++) {
long long i;
cin >> i;
id.push_back(i);
}
while (1) {
c++;
m = (c * (c + 1)) / 2;
if (k <= m) {
if (k == m) {
cout << id[c - 1] << endl;
ct++;
} else {
long long o = ((c - 1) * c) / 2;
if (k % o != 0) {
p = k % o;
} else {
p = c - 1;
}
}
break;
}
}
if (ct == 0) cout << id[p - 1] << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, k;
int a[100100];
cin >> n >> k;
for (int i = 0; i < n; i++) cin >> a[i];
long long int num = 0;
int temp;
for (int i = 1;; i++) {
num = num + i;
if (num >= k) {
temp = i;
num = num - i;
break;
}
}
cout << a[(k - num) - 1];
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
long long k;
cin >> n >> k;
int a[n + 1];
for (int i = 1; i <= n; i++) cin >> a[i];
for (int i = 1; i <= n; i++) {
if (k > i)
k = k - i;
else {
cout << a[k];
return 0;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ifstream fi("input.txt");
long long n, k, j = 0, p = 0, temp = 0;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; i++) cin >> a[i];
while (j < k) {
temp++;
p = j;
j += temp;
}
cout << a[k - p - 1];
}
|
#include <bits/stdc++.h>
using namespace std;
long long int fun(long long int x) { return (x * (x + 1)) / 2; }
int main() {
long long int n, k, ck = 0, num;
cin >> n >> k;
long long int a[n + 1];
for (long long int i = 1; i <= n; i++) {
cin >> a[i];
if ((fun(i) >= k && fun(i - 1) < k) && ck == 0) {
num = i;
ck = 1;
}
}
long long int calc = k - fun(num - 1);
cout << a[calc];
}
|
#include <bits/stdc++.h>
int main() {
long long int n, q, i, j, k;
long long int c = 0, p = 0;
scanf("%llu%llu", &n, &k);
long long int a[n];
for (i = 0; i < n; i++) scanf("%llu", &a[i]);
for (i = 0; i < n; i++) {
if (p + i + 1 < k) {
p += i + 1;
continue;
}
q = i;
}
printf("%llu", a[k - p - 1]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int n;
long long k, a[100005];
scanf("%d %I64d", &n, &k);
for (int i = 1; i <= n; i++) scanf("%I64d", a + i);
k *= 2;
long long x = floor((sqrt(1.0 + 4.0 * k) - 1.0) / 2.0);
k -= x * (x + 1);
k /= 2;
if (k == 0) k = x;
printf("%I64d\n", a[k]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int s[100005];
int main() {
int n, m;
while (cin >> n >> m) {
for (int j = 1; j <= n; j++) scanf("%d", &s[j]);
int i = 1, sum = 1;
if (sum < m)
for (i = 2;; i++) {
if (sum >= m) {
i--;
break;
}
sum += i;
}
i--;
int sum1 = (1 + i) * i / 2;
cout << s[m - sum1] << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long n, k;
cin >> n >> k;
long long ans;
if (k == 1) {
cin >> ans;
cout << ans;
} else {
for (int i = 1; i < k; i++) {
k -= i;
}
for (int i = 1; i <= k; i++) {
cin >> ans;
}
cout << ans;
}
return 0;
}
|
#include <bits/stdc++.h>
const int inf = (1 << 30);
using namespace std;
long long n, k, a[111111];
int main() {
ios_base ::sync_with_stdio(0);
cin >> n >> k;
for (int i = 1; i <= n; i++) cin >> a[i];
for (long long i = 1; i <= n; i++) {
if (i * (i + 1) / 2 < k) continue;
cout << a[k - (i - 1) * i / 2];
return 0;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int A[100007];
int main() {
int n, k, p;
scanf("%d", &n);
scanf("%d", &k);
for (int i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
for (int i = 1; i <= n; i++) {
if (k > i) {
k = k - i;
}
}
cout << A[k - 1] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
long long n, k, x;
int main(void) {
cin >> n >> k;
long long cont = 0;
vector<long long> v;
for (int i = 0; i < n; ++i) {
cin >> x;
v.push_back(x);
if (cont + v.size() >= k) {
for (int j = 0; j < v.size(); ++j) {
cont++;
if (cont == k) {
cout << v[j] << "\n";
return 0;
}
}
} else
cont += v.size();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<int> v;
int k;
inline long long count(const long long ed) { return (ed * (ed + 1) / 2); }
int bs() {
long long st = 1, ed = v.size(), best = -1;
while (st <= ed) {
long long mid = st + (ed - st) / 2;
if (count(mid) >= k) {
best = mid;
ed = mid - 1;
} else
st = mid + 1;
}
return best;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n >> k;
v.resize(n);
for (int &i : v) {
cin >> i;
}
long long robot = bs();
int idx = k - count(robot - 1);
cout << v[idx - 1] << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxx = 1e5 + 10;
int a[maxx];
int main() {
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++) cin >> a[i];
for (int i = 1; i <= n; i++) {
if (k > i) {
k -= i;
} else
break;
}
cout << a[k] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int SET(int n, int pos) { return n = n | (1 << pos); }
int RESET(int n, int pos) { return n = n & ~(1 << pos); }
int CHECK(int n, int pos) { return (bool)(n & (1 << pos)); }
int bigMod(int n, int power, int MOD) {
if (power == 0) return 1;
if (power % 2 == 0) {
int ret = bigMod(n, power / 2, MOD);
return ((ret % MOD) * (ret % MOD)) % MOD;
} else
return ((n % MOD) * (bigMod(n, power - 1, MOD) % MOD)) % MOD;
}
int modInverse(int n, int MOD) { return bigMod(n, MOD - 2, MOD); }
int POW(int x, int y) {
int res = 1;
for (; y;) {
if ((y & 1)) {
res *= x;
}
x *= x;
y >>= 1;
}
return res;
}
int inverse(int x) {
double p = ((double)1.0) / x;
return (p) + 1e-9;
}
int gcd(int a, int b) {
while (b) b ^= a ^= b ^= a %= b;
return a;
}
int nC2(int n) { return n * (n - 1) / 2; }
int MOD(int n, int mod) {
if (n >= 0)
return n % mod;
else if (-n == mod)
return 0;
else
return mod + (n % mod);
}
vector<int> vec[1000001], ans[1000001];
int vis[1000001];
int ara[1000001];
int ind[1000001];
int n, m;
bool ok = true;
void foo(int u, int num) {
vis[u] = 1;
for (int i = 0; i < vec[u].size(); i++) {
int v = vec[u][i];
if (!vis[v]) {
ans[num].push_back(ara[v]);
ind[v] = num;
foo(v, num);
}
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
for (int i = 1; i <= n; i++) {
cin >> ara[i];
}
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
vec[a].push_back(b);
vec[b].push_back(a);
}
int level = 1;
for (int i = 1; i <= n; i++) {
if (!vis[i]) {
ans[level].push_back(ara[i]);
ind[i] = level;
foo(i, level);
level++;
}
}
for (int i = 1; i <= n; i++) {
sort(ans[i].begin(), ans[i].end());
}
for (int i = 1; i <= n; i++) {
cout << ans[ind[i]].back() << " ";
ans[ind[i]].pop_back();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T gcd(T a, T b) {
while (b) {
a %= b;
swap(a, b);
}
return a;
}
inline int nxt() {
int wow;
scanf("%d", &wow);
return wow;
}
inline long long int lxt() {
long long int wow;
scanf("%lld", &wow);
return wow;
}
vector<int> v[1000002], temp;
int a[1000002], visited[1000002], ans[1000002];
bool comp(int x, int y) { return x > y; }
void dfs(int s) {
visited[s] = 1;
temp.push_back(s);
for (int i = 0; i < v[s].size(); i++) {
int t = v[s][i];
if (visited[t] == 0) dfs(t);
}
}
int main() {
int n = nxt(), m = nxt();
for (int i = 1; i <= n; i++) a[i] = nxt();
for (int i = 0; i < m; i++) {
int x = nxt(), y = nxt();
v[x].push_back(y);
v[y].push_back(x);
}
for (int i = 1; i <= n; i++) {
if (visited[i] == 0) dfs(i);
sort(temp.begin(), temp.end(), comp);
vector<int> vara;
for (int i = 0; i < temp.size(); i++) {
vara.push_back(a[temp[i]]);
}
sort(vara.begin(), vara.end());
for (int i = 0; i < temp.size(); i++) {
ans[temp[i]] = vara[i];
}
temp.clear();
}
for (int i = 1; i <= n; i++) cout << ans[i] << ' ';
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
const long long OO = (long long)1e18;
const int dx[] = {0, 1, 0, -1, 1, -1, 1, -1};
const int dy[] = {1, 0, -1, 0, 1, -1, -1, 1};
long long gcd(long long a, long long b) {
if (b == 0) {
return a;
}
return gcd(b, a % b);
}
long long fast_power(long long base, long long power) {
if (power == 1) return base;
if (power % 2 == 0)
return fast_power((base * base), power / 2);
else
return (base * fast_power((base * base), power / 2));
}
void Qalbaz() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cout << fixed << setprecision(1);
}
vector<vector<int> > adj;
int cnt;
vector<int> vis, vvv, vv, vec;
void dfs(int u) {
vis[u] = 1;
vvv.push_back(u);
vv.push_back(vec[u]);
int v;
for (int i = 0; i < adj[u].size(); i++) {
v = adj[u][i];
if (vis[v] == 0) {
dfs(v);
}
}
}
int main() {
Qalbaz();
int n, m, u, v;
cin >> n >> m;
adj.resize(n + 1);
vec.resize(n + 1);
for (int i = 1; i <= n; i++) cin >> vec[i];
for (int i = 0; i < m; i++) {
cin >> u >> v;
adj[u].push_back(v);
adj[v].push_back(u);
}
vis.resize(n + 1);
for (int i = 1; i <= n; i++) {
if (vis[i] == 0) {
vv.clear();
vvv.clear();
dfs(i);
sort(vv.begin(), vv.end());
sort(vvv.begin(), vvv.end());
for (int j = 0, k = vv.size() - 1; k >= 0 && j < vv.size(); j++, k--)
vec[vvv[j]] = vv[k], cnt++;
}
}
for (int i = 0; i < n; i++) cout << vec[i + 1] << " ";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 5;
int A[maxn];
bool used[maxn];
vector<int> G[maxn];
int n, m;
void dfs(int u, vector<int> &pos, vector<int> &val) {
used[u] = true;
pos.push_back(u);
val.push_back(A[u]);
for (auto v : G[u]) {
if (!used[v]) {
dfs(v, pos, val);
}
}
}
int main(void) {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++) {
scanf("%d", &A[i]);
}
for (int i = 0; i < m; i++) {
int u, v;
scanf("%d%d", &u, &v);
G[u].push_back(v);
G[v].push_back(u);
}
for (int i = 1; i <= n; i++) {
vector<int> pos, val;
if (!used[i]) {
dfs(i, pos, val);
sort(val.begin(), val.end(), greater<int>());
sort(pos.begin(), pos.end());
for (int i = 0; i < (int)pos.size(); i++) {
A[pos[i]] = val[i];
}
}
}
for (int i = 1; i <= n; i++) {
printf("%d%c", A[i], i == n ? '\n' : ' ');
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1000005;
int n, m;
int a[N];
int col[N], color = 0;
vector<int> g[N];
vector<int> pos[N];
vector<int> num[N];
void paint(int v) {
col[v] = color;
pos[color].push_back(v);
num[color].push_back(a[v]);
for (int i = 0; i < g[v].size(); ++i) {
int to = g[v][i];
if (col[to] == -1) paint(to);
}
}
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; ++i) scanf("%d", &a[i]);
for (int i = 1; i <= m; ++i) {
int u, v;
scanf("%d%d", &u, &v);
g[u].push_back(v);
g[v].push_back(u);
}
memset(col, -1, sizeof col);
for (int i = 1; i <= n; ++i)
if (col[i] == -1) {
++color;
paint(i);
}
for (int i = 1; i <= color; ++i) {
sort(pos[i].begin(), pos[i].end());
sort(num[i].begin(), num[i].end());
reverse(num[i].begin(), num[i].end());
for (int j = 0; j < pos[i].size(); ++j) {
int index = pos[i][j];
a[index] = num[i][j];
}
}
for (int i = 1; i <= n; ++i) printf("%d ", a[i]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 2000210;
inline int scan() {
char c = getchar();
int x = 0;
while (c < '0' || c > '9') {
c = getchar();
}
while (c >= '0' && c <= '9') {
x = (x << 1) + (x << 3) + c - '0';
c = getchar();
}
return x;
}
long long int n, m;
long long int a[N];
long long int parent[N];
long long int sz[N];
void reset() {
for (long long int i = 0; i <= n; i++) parent[i] = i, sz[i] = 1;
}
long long int findparent(long long int x) {
if (x != parent[x]) return findparent(parent[x]);
return parent[x];
}
void merge(long long int x, long long int y) {
x = findparent(x);
y = findparent(y);
if (sz[x] < sz[y]) swap(x, y);
sz[x] += sz[y];
parent[y] = x;
}
vector<long long int> g[N];
vector<long long int> l[N];
bool comp1(long long int x, long long int y) { return x < y; }
bool comp2(long long int x, long long int y) { return x > y; }
long long int minparent = INT_MAX, maxparent = INT_MIN;
int main() {
scanf("%lld %lld", &n, &m);
for (long long int i = 1; i <= n; i++) scanf("%lld", &a[i]);
reset();
while (m--) {
long long int a, b;
scanf("%lld %lld", &a, &b);
merge(a, b);
}
for (long long int i = 1; i <= n; i++) {
g[findparent(i)].push_back(i);
l[findparent(i)].push_back(a[i]);
minparent = min(minparent, parent[i]);
maxparent = max(maxparent, parent[i]);
}
for (long long int i = 1; i <= n; i++) {
if (findparent(i) == i) {
sort(l[i].begin(), l[i].end(), comp2);
sort(g[i].begin(), g[i].end(), comp1);
for (long long int j = 0; j < g[i].size(); j++) {
a[g[i][j]] = l[i][j];
}
}
}
for (long long int i = 1; i <= n; i++) printf("%lld ", a[i]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1000010;
const int MOD = 1e9 + 7;
double const pi = acos(-1);
void fre() { freopen("in.txt", "r", stdin); }
int a[N];
int pre[N];
vector<int> ans[N];
vector<int> root;
int vis[N];
int pos[N];
int find(int x) {
if (x == pre[x]) return x;
return pre[x] = find(pre[x]);
}
int main() {
std::ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
for (int i = 1; i <= n; i++) {
cin >> a[i];
pre[i] = i;
}
while (m--) {
int x, y;
cin >> x >> y;
x = find(x), y = find(y);
if (x != y) pre[x] = y;
}
for (int i = 1; i <= n; i++) {
int x = find(i);
ans[x].push_back(a[i]);
if (!vis[x]) {
root.push_back(x);
vis[x] = true;
}
}
for (int i = 0; i < (int)root.size(); i++) {
sort(ans[root[i]].rbegin(), ans[root[i]].rend());
}
for (int i = 1; i < n; i++) {
cout << ans[find(i)][pos[find(i)]++] << " ";
}
cout << ans[find(n)][pos[find(n)]] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline void gn(T &x) {
x = 0;
T f = 1;
char ch = getchar();
while (!isdigit(ch)) {
if (ch == '-') f = -1;
ch = getchar();
}
while (isdigit(ch)) {
x = x * 10 + ch - '0';
ch = getchar();
}
x *= f;
}
template <typename T>
inline void gt(T x) {
if (!x) return;
gt(x / 10);
putchar(x % 10 + '0');
}
const int N = 1000005;
int t, n, m, cnt;
int MOD = 1e9 + 7;
int a[N], f[N];
vector<int> G[N];
int find(int x) { return f[x] == x ? x : f[x] = find(f[x]); }
void UN(int l, int r) {
int a = find(l), b = find(r);
if (a != b) f[a] = b;
}
int main() {
int i, j, k, l, r, x, y, z;
for (i = 1; i < N; i++) f[i] = i;
gn(n);
gn(m);
for (i = 1; i <= n; i++) gn(a[i]);
for (i = 1; i <= m; i++) {
gn(l);
gn(r);
UN(l, r);
}
for (i = 1; i <= n; i++) G[find(i)].push_back(a[i]);
for (i = 1; i <= n; i++) sort(G[i].begin(), G[i].end());
for (i = 1; i <= n; i++) {
printf("%d ", G[f[i]].back()), G[f[i]].pop_back();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, m;
scanf("%lld%lld", &n, &m);
vector<long long int> p(n + 1);
for (int i = 1; i <= n; i++) scanf("%lld", &p[i]);
vector<set<long long int>> adj(n + 1);
for (int i = 0; i < m; i++) {
long long int s, d;
scanf("%lld%lld", &s, &d);
adj[s].insert(d);
adj[d].insert(s);
}
vector<long long int> answer_vec(n + 1);
vector<long long int> visited(n + 1);
queue<long long int> q;
for (int i = 1; i <= n; i++) {
if (!visited[i]) {
set<long long int> posns, values;
posns.clear();
values.clear();
q.push(i);
visited[i] = 1;
posns.insert(i);
values.insert(p[i]);
while (!q.empty()) {
long long int top = q.front();
q.pop();
for (auto it : adj[top]) {
if (!visited[it]) {
visited[it] = 1;
q.push(it);
posns.insert(it);
values.insert(p[it]);
}
}
}
auto it2 = posns.begin();
for (auto it1 = values.rbegin();
it1 != values.rend() && it2 != posns.end(); it1++, it2++) {
answer_vec[*it2] = *it1;
}
}
}
for (int i = 1; i <= n; i++) printf("%lld ", answer_vec[i]);
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e6 + 10;
int b[MAXN];
vector<int> a[MAXN], d, c;
bool mark[MAXN];
void dfs(int v) {
mark[v] = true;
c.push_back(v);
d.push_back(b[v]);
for (int i = 0; i < a[v].size(); i++)
if (mark[a[v][i]] == false) dfs(a[v][i]);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, m;
cin >> n >> m;
for (int i = 0; i < n; i++) cin >> b[i];
int x, y;
for (int i = 0; i < m; i++) {
cin >> x >> y;
x--;
y--;
a[x].push_back(y);
a[y].push_back(x);
}
for (int i = 0; i < n; i++) {
c.clear();
d.clear();
if (mark[i] == false) dfs(i);
sort(c.begin(), c.end());
sort(d.begin(), d.end());
reverse(d.begin(), d.end());
for (int j = 0; j < c.size(); j++) b[c[j]] = d[j];
}
for (int i = 0; i < n; i++) cout << b[i] << ' ';
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<vector<int> > AdjList;
bool visited[1000005];
int arr[1000005];
vector<pair<int, int> > elem;
void dfs(int u) {
visited[u] = true;
elem.push_back(pair<int, int>(arr[u], u));
for (int i = 0; i < AdjList[u].size(); i++) {
int v = AdjList[u][i];
if (!visited[v]) {
dfs(v);
}
}
}
bool comp1(pair<int, int> x, pair<int, int> y) { return x.first < y.first; }
bool comp2(pair<int, int> x, pair<int, int> y) { return x.second < y.second; }
int ans[1000005];
int main(int argc, char** argv) {
int n, m;
scanf("%d", &n);
AdjList.resize(n + 1);
scanf("%d", &m);
for (int i = 1; i <= n; i++) {
scanf("%d", &arr[i]);
}
for (int i = 0; i < m; i++) {
int x, y;
scanf("%d", &x);
scanf("%d", &y);
AdjList[x].push_back(y);
AdjList[y].push_back(x);
}
memset(visited, 0, sizeof visited);
for (int i = 1; i <= n; i++) {
elem.clear();
if (!visited[i]) {
dfs(i);
sort(elem.begin(), elem.end(), comp2);
vector<pair<int, int> > hp = elem;
sort(elem.begin(), elem.end(), comp1);
for (int i = 0; i < elem.size(); i++)
ans[hp[i].second] = elem[elem.size() - i - 1].first;
}
}
for (int i = 1; i <= n; i++) cout << ans[i] << " ";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const double eps = 1e-8;
const int mod = 1000000007;
const double pi = acos(-1);
inline void gn(long long &x) {
int sg = 1;
char c;
while (((c = getchar()) < '0' || c > '9') && c != '-')
;
c == '-' ? (sg = -1, x = 0) : (x = c - '0');
while ((c = getchar()) >= '0' && c <= '9') x = x * 10 + c - '0';
x *= sg;
}
inline void gn(int &x) {
long long t;
gn(t);
x = t;
}
inline void gn(unsigned long long &x) {
long long t;
gn(t);
x = t;
}
int gcd(int a, int b) { return a ? gcd(b % a, a) : b; }
long long powmod(long long a, long long x, long long mod) {
long long t = 1ll;
while (x) {
if (x & 1) t = t * a % mod;
a = a * a % mod;
x >>= 1;
}
return t;
}
const int maxn = 1e6 + 100;
vector<int> v[maxn];
int f[maxn];
int ite[maxn] = {0};
int find(int x) {
if (x == f[x]) return x;
return find(f[x]);
}
void add(int a, int b) {
a = find(a);
b = find(b);
f[a] = b;
}
bool cmp(int &a, int &b) { return b < a; }
int numb[maxn];
int main() {
int n, m;
scanf("%d %d", &n, &m);
for (int i = (1); i <= (n); i++) gn(numb[i]), f[i] = i;
int a, b;
for (int i = (1); i <= (m); i++) {
scanf("%d %d", &a, &b);
add(a, b);
}
for (int i = (1); i <= (n); i++) v[find(f[i])].push_back(numb[i]);
for (int i = (1); i <= (n); i++) sort(v[i].begin(), v[i].end(), cmp);
for (int i = (1); i <= (n); i++) {
int f = find(i);
printf("%d ", v[f][ite[f]++]);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 2e6 + 5;
int a[N], b[N];
priority_queue<int> q1[1000000], q2[1000000];
vector<vector<int>> v;
bool vis[N];
void DFS(int node, int here) {
if (vis[node]) return;
vis[node] = true;
q1[here].push(a[node]);
q2[here].push(node * -1);
for (int i = 0; i < v[node].size(); i++) {
int p = v[node][i];
DFS(p, here);
}
}
int main() {
int n, m;
cin >> n >> m;
v.resize(n + 3);
memset(vis, false, sizeof(vis));
for (int i = 0; i < n; i++) scanf("%d", &a[i]);
int c = 0;
for (int i = 0; i < m; i++) {
int a, b;
scanf("%d%d", &a, &b);
a--;
b--;
v[a].push_back(b);
v[b].push_back(a);
}
for (int i = 0; i < n; i++) {
if (!vis[i]) DFS(i, c);
c++;
}
for (int i = 0; i < c; i++) {
while (!q1[i].empty()) {
a[q2[i].top() * -1] = q1[i].top();
q2[i].pop();
q1[i].pop();
}
}
for (int i = 0; i < n; i++) cout << a[i] << " ";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAX = 1e6 + 5;
int A[MAX];
int par[MAX], chi[MAX];
int num[MAX], num_value[MAX];
int vis[MAX];
int n, m;
void init() {
for (int i = 1; i <= n; i++) par[i] = i, chi[i] = i;
}
int findpar(int x) { return x == par[x] ? x : findpar(par[x]); }
int findchi(int x) { return x == chi[x] ? x : findchi(chi[x]); }
void insert(int x, int y) {
int nx = findpar(x);
int ny = findpar(y);
if (nx == ny) return;
int cy = findchi(y);
par[nx] = cy;
chi[cy] = nx;
}
void sort() {
int i;
for (i = 1; i <= n; i++) {
if (vis[i] == 0) {
int x = findchi(i);
int cnt = 1;
while (1) {
num[cnt] = x;
num_value[cnt++] = A[x];
vis[x] = 1;
if (x == par[x]) break;
x = par[x];
}
sort(num + 1, num + cnt);
sort(num_value + 1, num_value + cnt, greater<int>());
for (int j = 1; j < cnt; j++) A[num[j]] = num_value[j];
}
}
}
int main() {
while (~scanf("%d%d", &n, &m)) {
init();
for (int i = 1; i <= n; i++) scanf("%d", &A[i]);
int x, y;
while (m--) {
scanf("%d%d", &x, &y);
insert(x, y);
}
sort();
for (int i = 1; i <= n; i++) {
if (i != 1)
printf(" %d", A[i]);
else
printf("%d", A[i]);
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int Mod = 1e9 + 7;
long long int maxi;
class DSU {
public:
int connected;
std::vector<int> par;
std::vector<int> siz;
DSU(int n) {
for (int i = 0; i <= n; i++) {
par.push_back(i);
siz.push_back(1);
}
connected = n;
}
int getPar(int n) {
if (n != par[n]) {
par[n] = getPar(par[n]);
}
return par[n];
}
void unite(int x, int y) {
int par_x = getPar(x);
int par_y = getPar(y);
if (par_x == par_y) return;
connected--;
if (siz[par_x] > siz[par_y]) {
siz[par_x] += siz[par_y];
par[par_y] = par_x;
} else {
siz[par_y] += siz[par_x];
par[par_x] = par_y;
}
return;
}
};
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
long long int n, u, v, m, i, i1, i2, temp, par;
cin >> n >> m;
long long int ind[n + 1], a[n + 1];
DSU dsu(n + 1);
for (i = 1; i <= n; i++) {
cin >> a[i];
ind[a[i]] = i;
}
for (i = 0; i < m; i++) {
cin >> u >> v;
dsu.unite(u, v);
}
map<int, vector<int> > mp;
for (i = 1; i <= n; i++) {
par = dsu.getPar(i);
mp[par].push_back(a[i]);
}
for (auto &p : mp) {
sort(p.second.begin(), p.second.end());
}
for (i = 1; i <= n; i++) {
par = dsu.getPar(i);
cout << mp[par].back() << " ";
mp[par].pop_back();
}
}
|
#include <bits/stdc++.h>
using namespace std;
int a[1000006], n, m, fa[1000006], sz[1000006];
vector<int> v[1000006];
inline int find(int x) { return fa[x] == x ? x : fa[x] = find(fa[x]); }
int main() {
int i, j, x, y;
scanf("%d%d", &n, &m);
for (i = 1; i <= n; ++i) scanf("%d", a + i), fa[i] = i;
for (i = 1; i <= m; ++i) {
int x, y;
scanf("%d%d", &x, &y);
fa[find(x)] = find(y);
}
for (i = 1; i <= n; ++i) v[find(i)].push_back(a[i]);
for (i = 1; i <= n; ++i) sort(v[i].begin(), v[i].end()), sz[i] = v[i].size();
for (i = 1; i <= n; ++i) printf("%d ", v[find(i)][--sz[find(i)]]);
}
|
#include <bits/stdc++.h>
using namespace std;
int p[1000005];
vector<int> mpp[1000005];
int vis[1000005];
vector<int> pos, ele;
void dfs(int u, int par) {
vis[u] = 1;
ele.push_back(p[u]);
pos.push_back(u);
for (auto v : mpp[u])
if (v != par)
if (!vis[v]) dfs(v, u);
}
int main() {
int n, m, u, v;
scanf("%d%d", &n, &m);
for (int i = (1); i <= (n); ++i) scanf("%d", p + i);
for (int i = (1); i <= (m); ++i) {
scanf("%d%d", &u, &v);
mpp[u].push_back(v);
mpp[v].push_back(u);
}
memset(vis, 0, sizeof(vis));
for (int i = (1); i <= (n); ++i)
if (!vis[i]) {
pos.clear(), ele.clear();
dfs(i, -1);
sort(pos.begin(), pos.end());
sort(ele.begin(), ele.end(), [](int a, int b) { return a > b; });
for (int j = (0); j <= (pos.size() - 1); ++j) p[pos[j]] = ele[j];
}
for (int i = (1); i <= (n); ++i) printf("%d ", p[i]);
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.