text stringlengths 49 983k |
|---|
#include <bits/stdc++.h>
using namespace std;
const int MX = 5005;
int ans[MX], cnt[MX], D[MX];
int main() {
int N, M, a, b, c, d, x;
scanf("%d%d", &N, &M);
if (N == 4 || M <= N) return !printf("-1");
scanf("%d%d%d%d", &a, &b, &c, &d);
for (int i = 1; i <= N; i++) {
if (i == a || i == b || i == c || i == d) continue;
x = i;
break;
}
printf("%d %d %d %d ", a, c, x, d);
for (int i = 1; i <= N; i++) {
if (i == a || i == b || i == c || i == d || i == x) continue;
printf("%d ", i);
}
printf("%d\n", b);
printf("%d ", c);
for (int i = x - 1; i >= 1; i--) {
if (i == a || i == b || i == c || i == d) continue;
printf("%d ", i);
}
printf("%d %d %d ", a, x, b);
for (int i = N; i >= x + 1; i--) {
if (i == a || i == b || i == c || i == d) continue;
printf("%d ", i);
}
printf("%d", d);
}
|
#include <bits/stdc++.h>
int main() {
int n, k;
scanf("%d %d", &n, &k);
if (n == 4 || k <= n) {
printf("-1\n");
return 0;
}
int a, b, c, d;
scanf("%d %d %d %d", &a, &b, &c, &d);
printf("%d %d ", a, c);
for (int i = 1; i <= n; i++)
if (i != a && i != b && i != c && i != d) printf("%d ", i);
printf("%d %d\n", d, b);
printf("%d %d ", c, a);
for (int i = 1; i <= n; i++)
if (i != a && i != b && i != c && i != d) printf("%d ", i);
printf("%d %d", b, d);
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m;
int x[1010], tot;
int a[10];
int main() {
cin >> n >> m;
for (int i = 1; i <= 4; i++) cin >> a[i];
for (int i = 1; i <= n; i++) {
int flag = 1;
for (int j = 1; j <= 4; j++)
if (i == a[j]) flag = 0;
if (flag) x[++tot] = i;
}
if (n <= 4 || m <= n) {
cout << -1 << endl;
return 0;
}
cout << a[1] << " " << a[3] << " ";
for (int i = 1; i <= tot; i++) cout << x[i] << " ";
cout << a[4] << " " << a[2] << endl;
cout << a[3] << " " << a[1] << " ";
for (int i = 1; i <= tot; i++) cout << x[i] << " ";
cout << a[2] << " " << a[4] << endl;
return 0;
}
|
#include <bits/stdc++.h>
int v[1010];
int main() {
int n, k;
scanf("%d%d", &n, &k);
if (n < 5 || n + 1 > k) {
puts("-1");
return 0;
}
int a, b, c, d;
scanf("%d%d%d%d", &a, &b, &c, &d);
int sz = 0;
v[++sz] = a;
v[++sz] = c;
for (int i = 1; i <= n; ++i) {
if (i != a && i != b && i != c && i != d) {
v[++sz] = i;
if (sz == 3) {
v[++sz] = d;
}
}
}
v[++sz] = b;
for (int i = 1; i <= n; ++i) {
printf("%d ", v[i]);
}
puts("");
printf("%d %d %d ", v[2], v[1], v[3]);
for (int i = n; i >= 4; --i) printf("%d ", v[i]);
puts("");
}
|
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 4e18;
const int MAX_LOG = 21;
const int MAX_N = (1 << 17);
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, k, a, b, c, d;
cin >> n >> k >> a >> b >> c >> d;
if (n < 5 || k < n + 1) {
cout << -1 << endl;
} else {
int arr[n];
arr[0] = a, arr[n - 1] = b, arr[1] = c, arr[n - 2] = d;
vector<bool> taken(n + 1);
taken[a] = taken[b] = taken[c] = taken[d] = true;
int id = 1;
for (int i = 2; i < n - 2; i++) {
while (taken[id]) {
id++;
}
arr[i] = id;
taken[id] = true;
}
for (int i = 0; i < n; i++) {
cout << arr[i] << " ";
}
cout << endl;
vector<int> v;
v.push_back(c);
v.push_back(a);
v.push_back(arr[2]);
for (int i = 3; i <= n - 3; i++) {
v.push_back(arr[i]);
}
v.push_back(b);
v.push_back(d);
for (int x : v) {
cout << x << " ";
}
cout << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int i, n, k, a, b, c, d;
cin >> n >> k;
cin >> a >> b >> c >> d;
if (k < n + 1 || n == 4)
cout << -1 << endl;
else {
cout << a << " " << c << " ";
for (i = 1; i <= n; i++) {
if (i != a && i != b && i != c && i != d) cout << i << " ";
}
cout << d << " " << b << endl;
cout << c << " " << a << " ";
for (i = 1; i <= n; i++) {
if (i != a && i != b && i != c && i != d) cout << i << " ";
}
cout << b << " " << d << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
int a, b, c, d;
cin >> n >> k >> a >> b >> c >> d;
if (n == 4 || k < n + 1) {
cout << -1;
return 0;
}
cout << a << " ";
cout << d << " ";
for (int i = 1; i <= n; i++)
if (i != a && i != b && i != c && i != d) cout << i << " ";
cout << c << " ";
cout << b << "\n";
cout << c << " ";
cout << b << " ";
for (int i = n; i >= 1; i--)
if (i != a && i != b && i != c && i != d) cout << i << " ";
cout << a << " ";
cout << d;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 34;
int a, b, c, d, n, k;
int p[N], len;
string s;
int main() {
cin >> n >> k;
cin >> a >> b >> c >> d;
if (n == 4 || k < n + 1) {
cout << "-1";
return 0;
}
for (int i = 1; i <= n; i++)
if (i != a && i != b && i != c && i != d) p[len++] = i;
cout << a << " " << d;
for (int i = 0; i < len; i++) cout << " " << p[i];
cout << " " << c << " " << b << "\n";
cout << c << " " << b << " ";
for (int i = len - 1; i >= 0; i--) cout << p[i] << " ";
cout << a << " " << d << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1000 + 5;
int n, k;
int v[N];
int a, b, c, d;
bool ok() {
for (int i = 1; i <= n; i++) {
if (v[i] == a)
if (v[i - 1] == b || v[i + 1] == b) return 0;
if (v[i] == c)
if (v[i - 1] == d || v[i + 1] == d) return 0;
}
return 1;
}
int ans[N], p = 0;
map<pair<int, int>, int> mp;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> n >> k;
cin >> a >> b >> c >> d;
v[1] = a;
v[n] = b;
int cnt = 1;
for (int i = 2; i < n; i++) {
while (cnt == a || cnt == b) cnt++;
v[i] = cnt++;
}
bool este = 0;
for (int i = 1; i <= 1000; i++) {
random_shuffle(v + 2, v + n);
if (ok()) {
este = 1;
break;
}
}
if (este == 0 || k < n + 1) {
cout << "-1\n";
return 0;
}
int p1, p2;
for (int i = 1; i <= n; i++) {
if (v[i] == c) p1 = i;
if (v[i] == d) p2 = i;
}
bool s = 0;
if (p1 > p2) {
swap(p1, p2);
s = 1;
}
for (int i = p1; i >= 1; i--) ans[++p] = v[i];
for (int i = p1 + 1; i < p2; i++) ans[++p] = v[i];
for (int i = n; i >= p2; i--) ans[++p] = v[i];
if (s) reverse(ans + 1, ans + n + 1);
for (int i = 1; i <= n; i++) cout << v[i] << " ";
cout << "\n";
for (int i = 1; i <= n; i++) cout << ans[i] << " ";
cout << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 100010;
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int n, k;
cin >> n >> k;
if (k <= n || n < 5) {
cout << -1;
return 0;
}
int a, b, c, d;
cin >> a >> b >> c >> d;
vector<int> p1, p2;
set<pair<int, int> > e;
p1.push_back(a);
p1.push_back(c);
for (int i = 1; i <= n; i++) {
if (i != a && i != c && i != b && i != d) p1.push_back(i);
}
p1.push_back(d);
p1.push_back(b);
p2.push_back(c);
p2.push_back(a);
for (int i = 1; i <= n; i++) {
if (i != a && i != b && i != c && i != d) p2.push_back(i);
}
p2.push_back(b);
p2.push_back(d);
for (int i = 0; i < n; i++) cout << p1[i] << " ";
cout << "\n";
for (int i = 0; i < n; i++) cout << p2[i] << " ";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, a, b, c, d;
scanf("%d%d%d%d%d%d", &n, &k, &a, &b, &c, &d);
if (k <= n || n <= 4) {
puts("-1");
return 0;
}
for (int rep = 0; rep < 2; ++rep) {
printf("%d %d ", a, c);
for (int i = 1; i <= n; ++i)
if (i != a && i != b && i != c && i != d) printf("%d ", i);
printf("%d %d\n", d, b);
swap(a, c);
swap(b, d);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
inline int nxt() {
int first;
scanf("%d", &first);
return first;
}
int main() {
int n = nxt();
int k = nxt();
vector<int> v(4);
for (int i = 0; i < 4; i++) v[i] = nxt();
vector<int> others;
for (int i = 1; i <= n; i++) {
bool ok = true;
for (int j = 0; j < 4; j++) {
if (v[j] == i) ok = false;
}
if (ok) others.push_back(i);
}
if (n == 4) {
puts("-1");
return 0;
} else {
if (k >= n + 1) {
cout << v[0] << " " << v[2] << " ";
for (auto first : others) cout << first << " ";
cout << v[3] << " " << v[1] << "\n";
cout << v[2] << " " << v[0] << " ";
for (auto first : others) cout << first << " ";
cout << v[1] << " " << v[3] << "\n";
} else
puts("-1");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long INV2 = 500000004;
long long INV6 = 166666668;
long long power(long long a, long long b, long long c) {
long long x = 1, y = a;
while (b > 0) {
if (b & 1) x = (x * y) % c;
y = (y * y) % c;
b /= 2;
}
return x % c;
}
int dx[] = {0, -1, 0, 1};
int dy[] = {-1, 0, 1, 0};
int dr[] = {1, 1, 0, -1, -1, -1, 0, 1};
int dc[] = {0, 1, 1, 1, 0, -1, -1, -1};
int main() {
int n, k;
scanf("%d%d", &n, &k);
int a, b, c, d;
scanf("%d%d%d", &a, &b, &c), scanf("%d", &d);
if (k <= n || n < 5) {
printf("-1\n");
return 0;
} else {
vector<int> aux;
for (int i = 1; i <= n; ++i) {
if (i == a || i == b || i == c || i == d) {
continue;
}
aux.push_back(i);
}
if (n == 5) {
printf("%d %d %d %d %d\n", a, d, aux[0], c, b);
printf("%d %d %d %d %d\n", c, b, aux[0], a, d);
return 0;
}
printf("%d ", a);
for (int i = 0; i < aux.size() - 1; ++i) {
printf("%d ", aux[i]);
}
int sz = aux.size();
printf("%d %d %d %d\n", d, aux[sz - 1], c, b);
printf("%d %d ", c, b);
for (int i = sz - 2; i >= 0; --i) {
printf("%d ", aux[i]);
}
printf("%d %d %d\n", a, aux[sz - 1], d);
}
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int n, k, a, b, c, d;
std::scanf("%d%d%d%d%d%d", &n, &k, &a, &b, &c, &d);
if (4 < n && n - 1 + 2 <= k) {
std::printf("%d %d", a, c);
for (int i(1); i <= n; ++i) {
if (i == a || i == b || i == c || i == d) continue;
std::printf(" %d", i);
}
std::printf(" %d %d\n", d, b);
std::printf("%d %d", c, a);
for (int i(1); i <= n; ++i) {
if (i == a || i == b || i == c || i == d) continue;
std::printf(" %d", i);
}
std::printf(" %d %d\n", b, d);
} else {
std::puts("-1");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long double pi = acos(-1.0);
const long double eps = 1e-8;
const int INF = 1E9;
const int MAXN = 5050;
int n, k, a[4];
int path[MAXN], used[MAXN];
int main() {
cin >> n >> k;
if (n == 4) {
cout << -1 << '\n';
return 0;
}
if (k < n + 1) {
cout << -1 << '\n';
return 0;
}
for (int i = 0; i < (int)(4); i++) {
cin >> a[i];
a[i]--;
used[a[i]] = 1;
}
path[0] = a[0];
path[1] = a[2];
path[n - 2] = a[3];
path[n - 1] = a[1];
int ptr = 0;
for (int i = 2; i < n - 2; i++) {
while (ptr < n && used[ptr]) ptr++;
assert(ptr < n);
path[i] = ptr;
used[ptr] = 1;
ptr++;
}
for (int i = 0; i < (int)(n); i++) cout << path[i] + 1 << " \n"[i == n - 1];
cout << path[1] + 1 << ' ' << path[0] + 1 << ' ';
for (int i = 2; i < n - 2; i++) cout << path[i] + 1 << ' ';
cout << path[n - 1] + 1 << ' ' << path[n - 2] + 1 << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k, a, b, c, d, in1, in2;
cin >> n >> k >> a >> b >> c >> d;
long long e = n - 1;
if (a != c) e++;
if (b != d) e++;
if (e > k || n <= 4)
cout << -1 << endl;
else {
if (a == c && b == d) {
cout << a << " ";
for (long long i = 1; i <= n; i++)
if (i != a && i != b) cout << i << " ";
cout << b << endl << c << " ";
for (long long i = 1; i <= n; i++)
if (i != a && i != b) cout << i << " ";
cout << d << endl;
} else if (a != c && b == d) {
cout << a << " " << c << " ";
for (long long i = 1; i <= n; i++)
if (i != a && i != b && i != c) cout << i << " ";
cout << b << endl << c << " " << a << " ";
for (long long i = 1; i <= n; i++)
if (i != a && i != b && i != c) cout << i << " ";
cout << d << endl;
} else if (a == c && b != d) {
cout << a << " ";
for (long long i = 1; i <= n; i++)
if (i != a && i != b && i != d) cout << i << " ";
cout << d << " " << b << endl << c << " ";
for (long long i = 1; i <= n; i++)
if (i != a && i != b && i != d) cout << i << " ";
cout << b << " " << d << endl;
} else {
cout << a << " " << c << " ";
for (long long i = 1; i <= n; i++)
if (i != a && i != b && i != d && i != c) cout << i << " ";
cout << d << " " << b << endl << c << " " << a << " ";
for (long long i = 1; i <= n; i++)
if (i != a && i != b && i != d && i != c) cout << i << " ";
cout << b << " " << d << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int cn = 1e4;
int pc, pd, n, x[cn], z[cn], r;
void pcbpd() {
r = 0;
for (int i = pc; i < n; i++, r++) x[r] = z[i];
for (int i = pc - 1; i > pd; i--, r++) x[r] = z[i];
for (int i = 0; i <= pd; i++, r++) x[r] = z[i];
}
void pcmpd() {
r = 0;
for (int i = pc; i >= 0; i--, r++) x[r] = z[i];
for (int i = pc + 1; i < pd; i++, r++) x[r] = z[i];
for (int i = n - 1; i >= pd; i--, r++) x[r] = z[i];
}
int main() {
int k, a, b, c, d, t = 1;
cin >> n >> k >> a >> b >> c >> d;
if (k < n + 1 || n == 4) {
cout << -1;
return 0;
}
for (int i = 2; i < n - 2; i++) {
while (t == a || t == b || t == c || t == d) ++t;
z[i] = t;
++t;
}
z[1] = c;
z[n - 2] = d;
z[0] = a;
z[n - 1] = b;
for (int i = 0; i < n; i++) {
if (z[i] == c)
pc = i;
else if (z[i] == d)
pd = i;
}
int j = 0, f = 0;
if (pc > pd) {
pcbpd();
for (int i = 0; i < n - 1; i++)
if (x[i] == a && x[i + 1] == b) {
swap(pc, pd);
pcmpd();
f = 1;
}
} else {
pcmpd();
for (int i = 0; i < n - 1; i++)
if (x[i] == a && x[i + 1] == b) {
swap(pc, pd);
pcbpd();
f = 1;
}
}
if (f)
for (int i = 0; i < n / 2; i++) swap(x[i], x[n - i - 1]);
for (int i = 0; i < n; i++) cout << z[i] << ' ';
cout << '\n';
for (int i = 0; i < n; i++) cout << x[i] << ' ';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool deb = false;
int i;
const int N = 100011;
int g[N];
int ans1[N], ans2[N];
int main() {
int i, j, n, k;
scanf("%d", &n), scanf("%d", &k);
int a, b, c, d;
scanf("%d", &a), scanf("%d", &b), scanf("%d", &c), scanf("%d", &d);
if (k < n + 1 || n == 4) {
printf("%d\n", -1);
return 0;
}
g[1] = a;
g[2] = c;
g[n] = b, g[n - 1] = d;
j = 3;
for (i = 1; i < n + 1; ++i) {
if (i == a || i == b || i == c || i == d) continue;
if (g[j] == 0) g[j] = i, j++;
}
for (i = 1; i < n + 1; ++i) printf("%d ", g[i]);
printf("\n");
printf("%d ", g[2]), printf("%d ", g[1]);
for (i = 3; i < n - 1; ++i) {
printf("%d ", g[i]);
}
printf("%d ", g[n]), printf("%d\n", g[n - 1]);
return 0;
}
|
#include <bits/stdc++.h>
const bool debugging = 1;
const long long mod = 1e9 + 7;
using namespace std;
template <class T>
ostream &operator<<(ostream &os, vector<T> V) {
for (auto v : V) {
os << v << " ";
}
return os << "";
}
template <class T>
ostream &operator<<(ostream &os, vector<vector<T>> V) {
for (long long i = 0; i < V.size(); i++) {
for (long long j = 0; j < V[i].size(); j++) {
os << V[i][j] << " ";
}
os << "\n";
}
return os << "";
}
template <class T>
ostream &operator<<(ostream &os, set<T> S) {
for (auto s : S) {
os << s << " ";
}
return os << "";
}
template <class L, class R>
ostream &operator<<(ostream &os, pair<L, R> P) {
return os << P.first << " " << P.second;
}
template <class L, class R>
ostream &operator<<(ostream &os, map<L, R> M) {
os << "\n";
for (auto m : M) {
os << m << "\n";
}
return os << "";
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long N, K;
cin >> N >> K;
long long a, b, c, d;
cin >> a >> b >> c >> d;
set<long long> vals;
for (long long i = 1; i <= N; i++) {
vals.insert(i);
}
vals.erase(a);
vals.erase(b);
vals.erase(c);
vals.erase(d);
if (N == 4) {
cout << -1 << "\n";
} else {
if (K >= N + 1) {
cout << a << " " << c << " " << vals << d << " " << b << "\n";
cout << c << " " << a << " " << vals << b << " " << d << "\n";
} else {
cout << -1 << "\n";
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int worker() {
int n, k;
scanf("%d%d", &n, &k);
int a, b, c, d;
scanf("%d%d%d%d", &a, &b, &c, &d);
if (n == 4) return -1;
if (k < (n + 1)) return -1;
vector<int> arr1;
int i;
int posc, posd;
for (i = 1; i <= n; i++) {
if (i == a) continue;
if (i == b) continue;
if (i == c) posc = arr1.size();
if (i == d) posd = arr1.size();
arr1.push_back(i);
}
int p1 = min(posc, posd);
int p2 = max(posc, posd);
if (p2 - p1 == 1) {
if (p1 != 0) {
swap(arr1[p1], arr1[p1 - 1]);
p1--;
} else {
swap(arr1[p2], arr1[p2 + 1]);
p2++;
}
}
printf("%d ", a);
for (i = 0; i < arr1.size(); i++) printf("%d ", arr1[i]);
printf("%d\n", b);
vector<int> ans;
for (i = p1; i >= 0; i--) ans.push_back(arr1[i]);
ans.push_back(a);
for (i = p1 + 1; i < p2; i++) ans.push_back(arr1[i]);
ans.push_back(b);
for (i = n - 3; i >= p2; i--) ans.push_back(arr1[i]);
if (arr1[p1] == d) reverse(ans.begin(), ans.end());
for (i = 0; i < ans.size(); i++) printf("%d ", ans[i]);
printf("\n");
return 0;
}
int main() {
int a = worker();
if (a == -1) cout << a << endl;
int xx;
cin >> xx;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const double PI = acos(-1.0);
const double EPS = 1e-10;
inline int readint() {
int sum = 0;
char c = getchar();
bool f = 0;
while (c < '0' || c > '9') {
if (c == '-') f = 1;
c = getchar();
}
while (c >= '0' && c <= '9') {
sum = sum * 10 + c - '0';
c = getchar();
}
if (f) return -sum;
return sum;
}
inline long long readLL() {
long long sum = 0;
char c = getchar();
bool f = 0;
while (c < '0' || c > '9') {
if (c == '-') f = 1;
c = getchar();
}
while (c >= '0' && c <= '9') {
sum = sum * 10 + c - '0';
c = getchar();
}
if (f) return -sum;
return sum;
}
int x[1005], y[1005];
bool v[1005];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
int a, b, c, d;
cin >> a >> b >> c >> d;
if (k < n + 1 || k > n * (n - 1) / 2 - 2 || n == 4) {
cout << "-1" << endl;
return 0;
}
x[1] = a;
x[2] = c;
x[4] = d;
x[n] = b;
y[1] = c;
y[2] = a;
y[4] = b;
y[n] = d;
v[a] = v[c] = v[d] = v[b] = true;
int j = 1;
while (v[j]) j++;
x[3] = y[3] = j;
j++;
for (int i = 5; i < n; i++) {
while (v[j]) j++;
x[i] = j++;
y[n + 4 - i] = x[i];
}
for (int i = 1; i <= n; i++) cout << x[i] << " ";
cout << endl;
for (int i = 1; i <= n; i++) cout << y[i] << " ";
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, k, i, j, a, b, c, d;
bool mark[100002];
int main() {
cin >> n >> k;
cin >> a >> b >> c >> d;
mark[a] = mark[b] = mark[c] = mark[d] = true;
if (k < n - 1 + 2 && n > 4) {
cout << -1 << endl;
return 0;
}
if (n == 4) {
cout << -1 << endl;
return 0;
}
printf("%d %d ", a, c);
for (i = 1; i <= n; i++) {
if (mark[i]) continue;
printf("%d ", i);
}
printf("%d %d\n", d, b);
printf("%d %d ", c, a);
for (i = 1; i <= n; i++) {
if (mark[i]) continue;
printf("%d ", i);
}
printf("%d %d\n", b, d);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int path[1003];
int d1[1003];
int d2[1003];
bitset<1003> used1;
bitset<1003> used2;
bitset<1003> mp[1003];
int a, b, c, d;
inline bool check(int i, int j) {
if ((i == a && j == b) || (i == b && j == a)) return false;
if ((i == c && j == d) || (i == d && j == c)) return false;
return true;
}
int main() {
int n, m;
cin >> n >> m;
cin >> a >> b >> c >> d;
used1[a] = 1;
used1[b] = 1;
used2[c] = 1;
used2[d] = 1;
d1[1] = a;
d1[n] = b;
d2[1] = c;
d2[n] = d;
int am = 0;
for (int i = 2; i < n; i++) {
pair<int, int> pr;
if (!used1[d2[i - 1]] && !used2[d1[i - 1]]) {
used1[d2[i - 1]] = 1;
used2[d1[i - 1]] = 1;
d1[i] = d2[i - 1];
d2[i] = d1[i - 1];
continue;
}
for (int j = n; j >= 1; j--) {
if (used1[j]) continue;
if (!check(d1[i - 1], j)) continue;
if (!used2[j] && check(d2[i - 1], j)) {
d1[i] = j;
d2[i] = j;
used1[j] = 1;
used2[j] = 1;
break;
}
if (pr.first != 0) continue;
for (int k = 1; k <= n; k++) {
if (used2[k]) continue;
if (!check(d2[i - 1], j)) continue;
pr.first = j;
pr.second = k;
break;
}
}
if (d1[i] == 0) {
d1[i] = pr.first;
d2[i] = pr.second;
used1[pr.first] = 1;
used2[pr.second] = 1;
}
}
for (int i = 2; i <= n; i++) {
am += !(mp[d1[i]][d1[i - 1]]);
mp[d1[i]][d1[i - 1]] = 1;
mp[d1[i - 1]][d1[i]] = 1;
}
for (int i = 2; i <= n; i++) {
am += !(mp[d2[i]][d2[i - 1]]);
mp[d2[i]][d2[i - 1]] = 1;
mp[d2[i - 1]][d2[i]] = 1;
}
if (am > m || (d1[n - 1] == 0 || d2[n - 1] == 0)) {
printf("%d\n", -1);
return 0;
}
for (int i = 1; i <= n; i++) printf("%d ", d1[i]);
printf("\n");
for (int i = 1; i <= n; i++) printf("%d ", d2[i]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
const long long N = 200005;
int dx[] = {-1, 0, 1, 0, 1, 1, -1, -1};
int dy[] = {0, -1, 0, 1, 1, -1, 1, -1};
long long powmod(long long a, long long b) {
long long res = 1;
a %= mod;
assert(b >= 0);
for (; b; b >>= 1) {
if (b & 1) res = res * a % mod;
a = a * a % mod;
}
return res;
}
long long powb(long long a, long long b) {
long long res = 1;
a;
assert(b >= 0);
for (; b; b >>= 1) {
if (b & 1) res = res * a;
a = a * a;
}
return res;
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, k;
cin >> n >> k;
int a[4];
for (int i = 0; i < 4; i++) cin >> a[i];
if (n == 4 || k <= n) {
cout << "-1";
return 0;
}
vector<int> path;
for (int i = 1; i <= n; i++) {
bool ok = true;
for (int j = 0; j < 4; j++)
if (i == a[j]) ok = false;
;
if (ok) path.push_back(i);
}
cout << a[0] << " " << a[2] << " ";
for (auto i : path) cout << i << " ";
cout << a[3] << " " << a[1] << "\n";
cout << a[2] << " " << a[0] << " ";
for (auto i : path) cout << i << " ";
cout << a[1] << " " << a[3] << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int a, b, c, d;
cin >> a >> b >> c >> d;
int m;
if (n == 4)
m = 4;
else
m = n - 1 + 2;
if (m > k || n == 4) {
cout << -1 << endl;
return 0;
}
set<int> s;
for (int i = 1; i <= n; i++) s.insert(i);
s.erase(a);
s.erase(b);
s.erase(c);
s.erase(d);
cout << a << " " << c << " ";
for (int v : s) cout << v << " ";
cout << d << " " << b << endl;
cout << c << " " << a << " ";
for (int v : s) cout << v << " ";
cout << b << " " << d << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1010;
int n, k, a, b, c, d, ans[N];
int main() {
scanf("%d %d %d %d %d %d", &n, &k, &a, &b, &c, &d);
if (k < n + 1 || n == 4) return printf("-1\n"), 0;
for (int i = 1; i <= n; i++)
if (i != a && i != b && i != c && i != d) ans[++ans[0]] = i;
printf("%d %d ", a, c);
for (int i = 1; i <= n - 4; i++) printf("%d ", ans[i]);
printf("%d %d\n%d %d ", d, b, c, a);
for (int i = 1; i <= n - 4; i++) printf("%d ", ans[i]);
printf("%d %d", b, d);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
int a, b, c, d;
scanf("%d %d %d %d %d %d", &n, &k, &a, &b, &c, &d);
if (n == 4 || k < n + 1) {
printf("-1\n");
return 0;
}
vector<int> others;
for (int i = 1; i <= n; ++i) {
if (i != a && i != b && i != c && i != d) {
others.push_back(i);
}
}
printf("%d %d ", a, c);
for (auto &i : others) {
printf("%d ", i);
}
printf("%d %d\n", d, b);
printf("%d %d ", c, a);
for (auto &i : others) {
printf("%d ", i);
}
printf("%d %d\n", b, d);
return 0;
}
|
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:256000000")
using namespace std;
int main() {
int n, k;
scanf("%d %d", &n, &k);
if (n == 4 || k <= n) {
cout << -1;
return 0;
}
int a, b, c, d;
scanf("%d %d %d %d", &a, &b, &c, &d);
printf("%d %d ", a, c);
for (int i = 1; i <= n; i++)
if (i != a && i != b && i != c && i != d) printf("%d ", i);
printf("%d %d\n", d, b);
printf("%d %d ", c, a);
for (int i = 1; i <= n; i++)
if (i != a && i != b && i != c && i != d) printf("%d ", i);
printf("%d %d\n", b, d);
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const ll mod = 1e9 + 7;
const double eps = DBL_EPSILON;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, k, a, b, c, d;
cin >> n >> k >> a >> b >> c >> d;
if (k < n + 1 || n == 4) {
puts("-1");
return 0;
}
vector<int> ans;
for (int i = 1; i <= n; i++) {
if (i != a && i != b && i != c && i != d) ans.push_back(i);
}
cout << a << " " << c << " ";
for (int i = 0; i < ans.size(); i++) cout << ans[i] << " ";
cout << d << " " << b << endl;
cout << c << " " << a << " ";
for (int i = 0; i < ans.size(); i++) cout << ans[i] << " ";
cout << b << " " << d << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int i, n, k, a, b, c, d;
cin >> n >> k;
cin >> a >> b >> c >> d;
if (k <= n) {
cout << "-1\n";
return 0;
}
if (n <= 4) {
cout << "-1";
return 0;
}
cout << a << ' ' << c << ' ';
for (int i = 1; i <= n; ++i) {
if (i != a && i != b && i != c && i != d) {
cout << i << ' ';
}
}
cout << d << ' ' << b << '\n';
cout << c << ' ' << a << ' ';
for (int i = 1; i <= n; ++i) {
if (i != a && i != b && i != c && i != d) {
cout << i << ' ';
}
}
cout << b << ' ' << d << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T>
T gcd(T a, T b) {
return b ? gcd(b, a % b) : a;
}
const double EPS = 1e-9;
const double PI = acos(-1.);
const int INF = 1e9;
const int MAXN = 2e5 + 5;
const long long MOD = 1e9 + 7;
void output_path(int n, int a, int b, int c, int d) {
cout << a << " " << c << " ";
for (int i = (1); i <= (int)(n); i++) {
if (i != a && i != b && i != c && i != d) {
cout << i << " ";
}
}
cout << d << " " << b << endl;
}
void solve() {
int n, k, a, b, c, d;
cin >> n >> k >> a >> b >> c >> d;
if (n == 4 || k <= n) {
cout << -1 << endl;
return;
}
output_path(n, a, b, c, d);
output_path(n, c, d, a, b);
}
int main() {
int t = 1;
while (t--) {
solve();
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int s1, s2;
int t1, t2;
cin >> s1 >> t1 >> s2 >> t2;
if (n == 4 || m < n + 1) {
cout << -1 << endl;
return 0;
}
vector<int> v;
for (int i = 1; i <= n; i++) {
if (i != s1 && i != s2 && i != t1 && i != t2) {
v.push_back(i);
}
}
cout << s1 << " " << s2;
for (auto i : v) cout << " " << i;
cout << " " << t2 << " " << t1 << endl;
cout << s2 << " " << s1;
for (auto i : v) cout << " " << i;
cout << " " << t1 << " " << t2 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int fof[1005];
int fos[1005];
int mat[1005][1005];
bool isit[1005];
int main() {
int n, k;
scanf("%d %d", &n, &k);
int i;
int a, b, c, d;
scanf("%d %d %d %d", &a, &b, &c, &d);
memset(isit, false, sizeof(isit));
fof[1] = a;
fof[n] = b;
isit[a] = true;
isit[b] = true;
fof[2] = c;
fof[n - 1] = d;
isit[c] = true;
isit[d] = true;
int j = 3;
while (1) {
if (j >= (n - 1)) break;
for (i = 1; i <= n; i++) {
if (isit[i] == false) {
isit[i] = true;
fof[j] = i;
break;
}
}
j++;
}
memset(isit, false, sizeof(isit));
fos[1] = c;
fos[n] = d;
isit[c] = true;
isit[d] = true;
fos[2] = a;
fos[n - 1] = b;
isit[a] = true;
isit[b] = true;
j = 3;
while (1) {
if (j >= (n - 1)) break;
for (i = 1; i <= n; i++) {
if (isit[i] == false) {
isit[i] = true;
fos[j] = i;
break;
}
}
j++;
}
bool flag = true;
for (i = 1; i < n; i++) {
if (fof[i] == c) {
if (fof[i + 1] == d) {
flag = false;
break;
}
} else if (fof[i] == d) {
if (fof[i + 1] == c) {
flag = false;
break;
}
}
}
for (i = 1; i < n; i++) {
if (fos[i] == a) {
if (fos[i + 1] == b) {
flag = false;
break;
}
} else if (fos[i] == b) {
if (fos[i + 1] == a) {
flag = false;
break;
}
}
}
for (i = 1; i <= n; i++) {
for (j = 1; j <= n; j++) {
mat[i][j] = 0;
}
}
for (i = 1; i < n; i++) {
int minn = min(fof[i], fof[i + 1]);
int maxx = max(fof[i], fof[i + 1]);
mat[minn][maxx] = 1;
}
for (i = 1; i < n; i++) {
int minn = min(fos[i], fos[i + 1]);
int maxx = max(fos[i], fos[i + 1]);
mat[minn][maxx] = 1;
}
int cnt = 0;
for (i = 1; i <= n; i++) {
for (j = 1; j <= n; j++) {
if (mat[i][j] == 1) {
cnt++;
}
}
}
if (cnt <= k) {
} else {
flag = false;
}
if (flag == false) {
printf("-1\n");
} else {
for (i = 1; i <= n; i++) {
printf("%d ", fof[i]);
}
printf("\n");
for (i = 1; i <= n; i++) {
printf("%d ", fos[i]);
}
printf("\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <class C>
constexpr int sz(const C &c) {
return int(c.size());
}
constexpr const char nl = '\n', sp = ' ';
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using i128 = __int128_t;
using ui128 = __uint128_t;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int N, K, A, B, C, D;
cin >> N >> K >> A >> B >> C >> D;
if (N == 4 || K < N + 1) {
cout << -1 << nl;
return 0;
}
vector<bool> seen(N + 1, false);
seen[A] = seen[B] = seen[C] = seen[D] = true;
vector<int> ord;
for (int i = 1; i <= N; i++)
if (!seen[i]) ord.push_back(i);
cout << A << sp << C;
for (int i = 0; i < sz(ord); i++) cout << sp << ord[i];
cout << sp << D << sp << B << nl;
cout << C << sp << A;
for (int i = 0; i < sz(ord); i++) cout << sp << ord[i];
cout << sp << B << sp << D << nl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, k, a, b, c, d;
cin >> n >> k >> a >> b >> c >> d;
if (k <= n || n == 4) {
cout << -1;
exit(0);
}
cout << a << " " << c << " ";
for (int i = 1; i <= n; ++i) {
if (i != a && i != b && i != c && i != d) cout << i << " ";
}
cout << d << " " << b << '\n';
cout << c << " " << a << " ";
for (int i = 1; i <= n; ++i) {
if (i != a && i != b && i != c && i != d) cout << i << " ";
}
cout << b << " " << d << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1010;
bool used[maxn];
int ans[maxn];
int main() {
int n, k, a, b, c, d;
scanf("%d%d%d%d%d%d", &n, &k, &a, &b, &c, &d);
if (k <= n || n == 4) {
printf("-1\n");
return 0;
}
memset(used, false, sizeof(used));
ans[0] = a;
ans[1] = c;
used[a] = true;
used[b] = true;
used[c] = true;
used[d] = true;
int tot = 2;
for (int i = 1; i <= n; ++i) {
if (!used[i]) {
ans[tot++] = i;
used[i] = true;
break;
}
}
ans[tot++] = d;
for (int i = 1; i <= n; ++i) {
if (!used[i]) {
used[i] = true;
ans[tot++] = i;
}
}
ans[tot++] = b;
for (int i = 0; i < tot; ++i) printf("%d ", ans[i]);
printf("\n");
printf("%d %d %d", ans[1], ans[0], ans[2]);
for (int i = tot - 1; i >= 3; --i) printf(" %d", ans[i]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1050;
int num[N];
int main() {
int n, k;
scanf("%d %d", &n, &k);
int a, b, c, d;
scanf("%d %d %d %d", &a, &b, &c, &d);
if (n == 4) {
puts("-1");
return 0;
}
if (k == n - 1 || k == n) {
puts("-1");
return 0;
}
memset(num, -1, sizeof(num));
num[0] = a;
num[n - 1] = b;
num[1] = c;
num[3] = d;
int pt = 1;
for (int i = 0; i < n; i++) {
if (num[i] != -1) continue;
while (pt == a || pt == b || pt == c || pt == d) pt++;
num[i] = pt;
pt++;
}
vector<int> ans[2];
for (int i = 0; i < n; i++) {
ans[0].push_back(i);
}
ans[1].push_back(1);
ans[1].push_back(0);
ans[1].push_back(2);
for (int i = n - 1; i >= 3; i--) ans[1].push_back(i);
for (int t = 0; t < 2; t++) {
for (int i = 0; i < n; i++) {
printf("%d%c", num[ans[t][i]], " \n"[i + 1 == n]);
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 5005;
int a[N];
int cnt[N];
int answer[N];
int main() {
cout.sync_with_stdio(false);
cin.tie(0);
int n, k, a, b, c, d;
cin >> n >> k >> a >> b >> c >> d;
vector<int> towns;
for (int j = 1; j <= n; j++) {
if (j != a && j != b && j != c && j != d) {
towns.push_back(j);
}
}
if ((int)towns.size() == 0) {
cout << -1;
return 0;
}
int q = towns[0];
int r = n + 1;
if (r > k) {
cout << -1;
return 0;
}
cout << a << " " << d << " " << q << " " << c << " ";
for (int i = 1; i < towns.size(); i++) cout << towns[i] << " ";
cout << b << endl;
cout << c << " ";
for (int i = 1; i < towns.size(); i++) cout << towns[i] << " ";
cout << b << " " << q << " " << a << " " << d << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2000;
int n, k;
int a, b, c, d;
int num[MAXN], num_cnt = 0;
int rank[MAXN];
set<int> s;
vector<int> v;
int main() {
cin >> n >> k;
cin >> a >> b >> c >> d;
if (k <= n) {
cout << -1 << endl;
} else {
if (n >= 5) {
for (int i = 1; i <= n; ++i) {
if (i != a && i != b && i != c && i != d) {
s.insert(i);
}
}
v.push_back(a);
v.push_back(c);
while (!s.empty()) {
v.push_back(*s.begin());
s.erase(s.begin());
}
v.push_back(d);
v.push_back(b);
for (int i = 0; i < v.size(); ++i) {
cout << v[i] << " ";
}
cout << endl;
cout << c << " " << a << " ";
for (int i = (int)v.size() - 3; i >= 2; --i) {
cout << v[i] << " ";
}
cout << b << " " << d << endl;
} else if (n == 4) {
cout << -1 << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
scanf("%d %d", &n, &m);
int a, b, c, d;
scanf("%d %d %d %d", &a, &b, &c, &d);
if (m < n + 1 || n == 4) {
printf("-1");
return 0;
}
printf("%d %d ", a, c);
for (int i = 1; i <= n; i++) {
if (i != a && i != b && i != c && i != d) printf("%d ", i);
}
printf("%d %d\n", d, b);
printf("%d %d ", c, a);
for (int i = 1; i <= n; i++) {
if (i != a && i != b && i != c && i != d) printf("%d ", i);
}
printf("%d %d", b, d);
}
|
#include <bits/stdc++.h>
using namespace std;
int n, a, b, c, d, k;
set<int> good;
int main() {
cin >> n >> k;
cin >> a >> b >> c >> d;
if (k < n + 1) {
cout << "-1\n";
exit(0);
}
if (n == 4) {
cout << "-1\n";
exit(0);
}
good.insert(a);
good.insert(b);
good.insert(c);
good.insert(d);
int t = 1;
while (good.count(t)) ++t;
good.insert(t);
cout << a << " " << d << " " << t << " " << c;
for (int i = 0; i < n; ++i)
if (!good.count(i + 1)) cout << " " << i + 1;
cout << " " << b << endl;
cout << c;
for (int i = 0; i < n; ++i)
if (!good.count(i + 1)) cout << " " << i + 1;
cout << " " << b << " " << t << " " << a << " " << d << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
long long mod = 1000000007;
int main() {
std::ios::sync_with_stdio(false);
long long n, k;
int a, b, c, d;
cin >> n >> k;
cin >> a >> b >> c >> d;
vector<int> path;
if (n <= 4 || k <= n) {
cout << -1 << endl;
return 0;
}
cout << a << " " << c << " ";
for (int i = 1; i <= n; i++) {
if (!(i == a || i == b || i == c || i == d)) {
cout << i << " ";
path.push_back(i);
}
}
cout << d << " " << b << endl;
cout << c << " " << a << " ";
for (int i = 0; i < path.size(); i++) cout << path[i] << " ";
cout << b << " " << d << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, k, a, b, c, d;
cin >> n >> k >> a >> b >> c >> d;
vector<long long int> v;
for (long long int i = 1; i <= n; i++)
if (i != a && i != b && i != c && i != d) v.push_back(i);
if (k <= n || n == 4)
cout << -1;
else {
cout << a << " " << c << " ";
for (long long int i = 0; i < v.size(); i++) cout << v[i] << " ";
cout << d << " " << b << endl;
cout << c << " " << a << " ";
for (long long int i = 0; i < v.size(); i++) cout << v[i] << " ";
cout << b << " " << d;
}
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
using namespace std;
const int mod = (int)1e9 + 7;
const int N = 1e5 + 10;
const long long inf = -1e10;
const int maxm = 53;
vector<vector<char>> matrix(maxm, vector<char>(maxm));
vector<vector<int>> vt(maxm, vector<int>(maxm));
struct event {
int x, y, size;
};
int dx[] = {0, 0, 1, -1};
int dy[] = {-1, 1, 0, 0};
struct myComp {
constexpr bool operator()(pair<int, int> const& a,
pair<int, int> const& b) const noexcept {
return a.first < b.first;
}
};
void solve() {
int n, k;
cin >> n >> k;
long long a, b, c, d;
cin >> a >> b >> c >> d;
if (k < n + 1 || n < 5) {
cout << -1;
return;
}
set<int> s;
for (int i = 0; i < n; i++) s.insert(i + 1);
s.erase(a), s.erase(b), s.erase(c), s.erase(d);
cout << a << " " << c << " ";
for (auto it : s) cout << it << " ";
cout << d << " " << b << "\n";
cout << c << " " << a << " ";
for (auto it : s) cout << it << " ";
cout << b << " " << d << "\n";
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
solve();
}
|
#include <bits/stdc++.h>
using namespace std;
const long long mxn = 1005;
int n, k, a, b, c, d;
int Count[mxn][mxn];
void print(vector<int> v) {
for (int i = 0; i < v.size(); i++) {
printf("%d ", v[i]);
}
printf("\n");
return;
}
int main() {
scanf("%d%d%d%d%d%d", &n, &k, &a, &b, &c, &d);
if (k <= n || n <= 4) {
printf("-1\n");
return 0;
}
for (int i = 0; i < mxn; i++)
for (int j = 0; j < mxn; j++) Count[i][j] = 0;
vector<int> v1, v2;
v1.push_back(a);
v1.push_back(c);
for (int i = 1; i <= n; i++) {
if (i != a && i != b && i != c && i != d) v1.push_back(i);
}
v1.push_back(d);
v1.push_back(b);
v2.push_back(c);
v2.push_back(a);
for (int i = 1; i <= n; i++) {
if (i != a && i != b && i != c && i != d) v2.push_back(i);
}
v2.push_back(b);
v2.push_back(d);
print(v1);
print(v2);
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 arr[n];
long long a, b, c, d;
cin >> a >> b >> c >> d;
if (k < (n + 1) || n <= 4) {
cout << -1 << "\n";
return 0;
}
map<long long, long long> check;
vector<long long> v;
v.push_back(a);
check[a]++;
check[b]++;
v.push_back(c);
check[c]++;
check[d]++;
for (int i = 1; i <= n; i++) {
if (check[i] == false) v.push_back(i);
}
v.push_back(d);
v.push_back(b);
for (int i = 0; i < n; i++) {
cout << v[i] << " ";
}
cout << "\n";
cout << v[1] << " " << v[0] << " " << v[2] << " ";
for (int i = 3; i < n - 2; i++) {
cout << v[i] << " ";
}
cout << v[n - 1] << " " << v[n - 2] << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 50;
int probDiv[N];
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, k, a, b, c, d;
cin >> n >> k >> a >> b >> c >> d;
if (k < n + 1 || n == 4) {
cout << -1 << endl;
} else {
vector<int> path;
cout << a << " " << c;
int cur = 1;
for (int i = 0; i < n - 4; i++) {
while (cur == a || cur == b || cur == c || cur == d) cur++;
path.push_back(cur);
cout << " " << cur;
++cur;
}
cout << " " << d << " " << b << endl;
cout << c << " " << a;
for (int i = 0; i < path.size(); i++) {
cout << " " << path[i];
}
cout << " " << b << " " << d << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long n, k;
cin >> n >> k;
vector<long long> a(4);
cin >> a[0] >> a[1] >> a[2] >> a[3];
if (n == 4) {
cout << "-1";
return 0;
}
if (k < n + 1) {
cout << -1;
return 0;
}
vector<long long> ab;
ab.push_back(a[0]);
ab.push_back(a[2]);
for (long long i = 1; i <= n; i++) {
if (i != a[0] && i != a[1] && i != a[2] && i != a[3]) {
ab.push_back(i);
}
}
ab.push_back(a[3]);
ab.push_back(a[1]);
for (long long i = 0; i < n; i++) {
cout << ab[i] << ' ';
}
cout << "\n";
cout << ab[1] << ' ' << ab[0] << ' ';
for (long long i = 2; i < n - 2; i++) {
cout << ab[i] << ' ';
}
cout << ab[n - 1] << ' ' << ab[n - 2];
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void machayenge() {
long long int n, k;
cin >> n >> k;
long long int a, b, c, d;
cin >> a >> b >> c >> d;
if (k < n + 1) {
cout << -1;
return;
}
if (n <= 4) {
cout << -1;
return;
}
cout << a << " " << c << " ";
for (long long int i = 1; i <= n; ++i) {
if (i == a || i == b || i == c || i == d)
continue;
else
cout << i << " ";
}
cout << d << " " << b << "\n";
cout << c << " " << a << " ";
for (long long int i = 1; i <= n; ++i) {
if (i == a || i == b || i == c || i == d)
continue;
else
cout << i << " ";
}
cout << b << " " << d << "\n";
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
machayenge();
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int n, k;
int a, b, c, d;
scanf("%d%d", &n, &k);
scanf("%d%d%d%d", &a, &b, &c, &d);
if (n == 4 or k < n + 1) {
printf("-1");
return 0;
}
printf("%d %d ", a, c);
for (int i = 1; i <= n; i++)
if (i != a and i != b and i != c and i != d) printf("%d ", i);
printf("%d %d", d, b);
puts("");
printf("%d %d ", c, a);
for (int i = 1; i <= n; i++)
if (i != a and i != b and i != c and i != d) printf("%d ", i);
printf("%d %d", b, d);
}
|
#include <bits/stdc++.h>
using namespace std;
int N, K, A, B, C, D, T, i, j;
bool X[1001];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> N >> K >> A >> B >> C >> D;
X[A] = 1;
X[B] = 1;
X[C] = 1;
X[D] = 1;
for (i = 1; X[i]; i++) {
}
X[i] = 1;
T = i;
if (N == 4 || K <= N) {
cout << -1 << '\n';
return 0;
}
cout << A << ' ';
for (i = 1; i <= N; i++) {
if (!X[i]) {
cout << i << ' ';
}
}
cout << C << ' ' << T << ' ' << D << ' ' << B << '\n';
cout << C << ' ';
for (i = N; i >= 1; i--) {
if (!X[i]) {
cout << i << ' ';
}
}
cout << A << ' ' << T << ' ' << B << ' ' << D << '\n';
}
|
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]) {
ios::sync_with_stdio(false);
int n, k, a, b, c, d;
cin >> n >> k;
cin >> a >> b >> c >> d;
if (k <= n || n == 4) {
cout << -1 << endl;
return 0;
}
vector<int> vctmp, vctmp1;
for (int i = 0; i < (int)n; i++) {
if (i + 1 != a && i + 1 != b && i + 1 != c && i + 1 != d) {
vctmp.push_back(i + 1);
}
}
vctmp1 = vctmp;
vector<int> p1, p2;
p1.push_back(a);
p1.push_back(c);
while (vctmp.size()) {
p1.push_back(vctmp.back());
vctmp.pop_back();
}
p1.push_back(d);
p1.push_back(b);
vctmp = vctmp1;
p2.push_back(c);
p2.push_back(a);
while (vctmp.size()) {
p2.push_back(vctmp.back());
vctmp.pop_back();
}
p2.push_back(b);
p2.push_back(d);
for (int i = 0; i < (int)p1.size(); i++) {
cout << p1[i] << ' ';
}
cout << endl;
for (int i = 0; i < (int)p2.size(); i++) cout << p2[i] << ' ';
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
int a, b, c, d;
cin >> a >> b >> c >> d;
if (n == 4 || k <= n) {
cout << -1 << '\n';
return 0;
}
set<int> s;
for (int i = 0; i < n; i++) s.insert(i + 1);
s.erase(a);
s.erase(b);
s.erase(c);
s.erase(d);
cout << a << ' ' << c << ' ';
for (auto i : s) cout << i << ' ';
cout << d << ' ' << b << '\n';
cout << c << ' ' << a << ' ';
for (auto i : s) cout << i << ' ';
cout << b << ' ' << d << '\n';
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
long long n, k;
long long a, b, c, d;
void Input() { cin >> n >> k >> a >> b >> c >> d; }
void Solve() {
if (n <= 4 or k < n + 1)
cout << -1;
else {
cout << a << " " << c << " ";
for (long long i = 1; i <= n; i++)
if (i != a and i != b and i != c and i != d) cout << i << " ";
cout << d << " " << b << "\n";
cout << c << " " << a << " ";
for (long long i = 1; i <= n; i++)
if (i != a and i != b and i != c and i != d) cout << i << " ";
cout << b << " " << d << "\n";
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long T = 1;
while (T--) {
Input();
Solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <class A>
void read(vector<A>& v);
template <class A, size_t S>
void read(array<A, S>& a);
template <class T>
void read(T& x) {
cin >> x;
}
void read(double& d) {
string t;
read(t);
d = stod(t);
}
void read(long double& d) {
string t;
read(t);
d = stold(t);
}
template <class H, class... T>
void read(H& h, T&... t) {
read(h);
read(t...);
}
template <class A>
void read(vector<A>& x) {
for (auto& a : x) read(a);
}
template <class A, size_t S>
void read(array<A, S>& x) {
for (auto& a : x) read(a);
}
const int mod = 1e9 + 7;
long long int primeLimit = 1e5;
const double PI = acos(-1);
bool prime[100000];
string LongestPalindromicPrefix(string str) {
string temp = str + '?';
reverse(str.begin(), str.end());
temp += str;
long long int n = temp.length();
long long int lps[n];
fill(lps, lps + n, 0);
for (long long int i = 1; i < n; i++) {
long long int len = lps[i - 1];
while (len > 0 && temp[len] != temp[i]) {
len = lps[len - 1];
}
if (temp[i] == temp[len]) {
len++;
}
lps[i] = len;
}
return temp.substr(0, lps[n - 1]);
}
bool binarySearchFloat(float lower, float higher, float maxErrorAllowed,
long long int numberOfTimesWanttoRunCode) {
float l = lower, r = higher;
float eps = maxErrorAllowed;
long long int iteration_count = numberOfTimesWanttoRunCode;
for (long long int i = 0; i < iteration_count && l + eps < r; ++i) {
}
}
void primefinder() {
memset(prime, true, sizeof(prime));
prime[1] = false;
prime[0] = false;
for (long long int i = 2; i < primeLimit; i++) {
if (prime[i]) {
for (long long int j = i * i; j < primeLimit; j += i) {
prime[j] = false;
}
}
}
}
long long fast_pow(long long int x, long long int y) {
long long res = 1;
while (y > 0) {
if (y & 1) res = res * x;
y = y >> 1;
x = x * x;
}
return res;
}
long long Fast_pow(long long int x, long long int y, long long int p) {
long long res = 1;
x = x % p;
if (x == 0) return 0;
while (y > 0) {
if (y & 1) res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long int n, k;
cin >> n >> k;
long long int a1, b1, a2, b2;
cin >> a1 >> b1 >> a2 >> b2;
if (n == 4 || k <= n) {
cout << "-1\n";
return 0;
}
vector<long long int> ans1;
ans1.push_back(a1);
ans1.push_back(a2);
unordered_set<long long int> visited;
visited.insert(a1);
visited.insert(a2);
visited.insert(b1);
visited.insert(b2);
for (long long int i = 1; i <= n; i++) {
if (visited.find(i) == visited.end()) {
visited.insert(i);
ans1.push_back(i);
break;
}
}
ans1.push_back(b2);
for (long long int i = 1; i <= n; i++) {
if (visited.find(i) == visited.end()) {
visited.insert(i);
ans1.push_back(i);
}
}
ans1.push_back(b1);
for (long long int i = 0; i < ans1.size(); i++) {
cout << ans1[i] << " ";
}
cout << "\n";
visited.clear();
cout << a2 << " " << a1 << " " << ans1[2] << " ";
for (long long int i = ans1.size() - 1; i >= 0; i--) {
cout << ans1[i] << " ";
if (ans1[i] == b2) break;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m, a, b, c, d, co[11000], ha[5000], ans[5000];
int main() {
scanf("%d %d", &n, &m);
scanf("%d%d%d%d", &a, &b, &c, &d);
ha[1] = a;
ha[n] = b;
ha[2] = c;
ha[n - 1] = d;
co[a] = 1;
co[b] = n;
co[c] = 2;
co[d] = n - 1;
int pre = 1;
m -= n - 1;
m -= 2;
if (m < 0 || n == 4) {
printf("-1\n");
return 0;
}
for (int i = 3; i < n - 1; i++) {
while (co[pre]) pre++;
ha[i] = pre;
co[pre] = i;
}
for (int i = 1; i <= n; i++) printf("%d ", ha[i]);
printf("\n");
swap(ha[1], ha[2]);
swap(ha[n], ha[n - 1]);
for (int i = 1; i <= n; i++) printf("%d ", ha[i]);
printf("\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
inline void chkmax(T& x, U y) {
if (x < y) x = y;
}
template <typename T, typename U>
inline void chkmin(T& x, U y) {
if (y < x) x = y;
}
int main() {
int n, k;
int a, b, c, d;
scanf("%d%d", &n, &k);
scanf("%d%d%d%d", &a, &b, &c, &d);
if (n == 4) {
puts("-1");
return 0;
}
if (k <= n) {
puts("-1");
return 0;
}
printf("%d %d ", a, c);
for (int i = 1; i <= n; i++) {
if (i == a or i == b or i == c or i == d) continue;
printf("%d ", i);
}
printf("%d %d\n", d, b);
printf("%d %d ", c, a);
for (int i = 1; i <= n; i++) {
if (i == a or i == b or i == c or i == d) continue;
printf("%d ", i);
}
printf("%d %d\n", b, d);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, k, a, b, c, d;
vector<int> v;
int main() {
cin >> n >> k;
cin >> a >> b >> c >> d;
if (k <= n || n == 4) {
cout << -1 << endl;
return 0;
}
for (int i = 1; i <= n; i++) {
if (i == a || i == b || i == c || i == d) continue;
v.push_back(i);
}
cout << a << ' ';
for (int i = 0; i < v.size() - 1; i++) printf("%d ", v[i]);
int len = v.size();
cout << c << ' ' << v[len - 1] << ' ' << d << ' ' << b << endl;
cout << c << ' ';
for (int i = v.size() - 2; i >= 0; i--) printf("%d ", v[i]);
cout << a << ' ' << v[len - 1] << ' ' << b << ' ' << d << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, a, b, c, d;
while (scanf("%d%d%d%d%d%d", &n, &k, &a, &b, &c, &d) != EOF) {
int cnt = 0;
for (int i = 1; i <= n; i++)
if (i != a && i != b && i != c && i != d) cnt++;
if (a == c && b == c) {
if (k < n)
printf("-1\n");
else {
printf("%d", a);
for (int i = 1; i <= n; i++)
if (i != a && i != b) printf(" %d", i);
printf(" %d\n%d", b, a);
for (int i = 1; i <= n; i++)
if (i != a && i != b) printf(" %d", i);
printf(" %d\n", b);
}
} else if (a == d && b == c) {
if (k < n)
printf("-1\n");
else {
printf("%d", a);
for (int i = 1; i <= n; i++)
if (i != a && i != b) printf(" %d", i);
printf(" %d\n%d", b, b);
for (int i = n; i > 0; i--)
if (i != a && i != b) printf(" %d", i);
printf(" %d\n", a);
}
} else if (a == c) {
if (k <= n || cnt == 0)
printf("-1\n");
else {
printf("%d", a);
for (int i = 1; i <= n; i++)
if (i != a && i != b && i != d) printf(" %d", i);
printf(" %d %d\n%d", d, b, a);
for (int i = 1; i <= n; i++)
if (i != a && i != b && i != d) printf(" %d", i);
printf(" %d %d\n", b, d);
}
} else if (a == d) {
if (k <= n || cnt == 0)
printf("-1\n");
else {
printf("%d", a);
for (int i = 1; i <= n; i++)
if (i != a && i != b && i != c) printf(" %d", i);
printf(" %d %d\n%d %d", c, b, c, b);
for (int i = n; i > 0; i--)
if (i != a && i != b && i != c) printf(" %d", i);
printf(" %d\n", a);
}
} else if (b == c) {
if (k <= n || cnt == 0)
printf("-1\n");
else {
printf("%d %d", a, d);
for (int i = 1; i <= n; i++)
if (i != a && i != b && i != d) printf(" %d", i);
printf(" %d\n%d", b, b);
for (int i = n; i > 0; i--)
if (i != a && i != b && i != d) printf(" %d", i);
printf(" %d %d\n", a, d);
}
} else if (b == d) {
if (k <= n || cnt == 0)
printf("-1\n");
else {
printf("%d %d", a, c);
for (int i = 1; i <= n; i++)
if (i != a && i != b && i != c) printf(" %d", i);
printf(" %d\n%d %d", b, c, a);
for (int i = 1; i <= n; i++)
if (i != a && i != b && i != c) printf(" %d", i);
printf(" %d\n", b);
}
} else {
if (k < n + 1 || cnt == 0)
printf("-1\n");
else {
int p;
printf("%d %d", a, c);
for (p = 1; p <= n; p++)
if (p != a && p != b && p != c && p != d) {
printf(" %d", p);
break;
}
printf(" %d", d);
for (p++; p <= n; p++)
if (p != a && p != b && p != c && p != d) printf(" %d", p);
printf(" %d\n%d %d", b, c, a);
for (p = 1; p <= n; p++)
if (p != a && p != b && p != c && p != d) {
printf(" %d", p);
break;
}
printf(" %d", b);
for (int i = n; i > p; i--)
if (i != a && i != b && i != c && i != d) printf(" %d", i);
printf(" %d\n", d);
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cout.tie(nullptr);
int n, m, a, b, c, d;
cin >> n >> m >> a >> b >> c >> d;
if (m < n + 1 || n < 5)
cout << -1 << "\n";
else {
int mid;
for (int i = 1; i <= n; ++i)
if (i != a && i != b && i != c && i != d) {
mid = i;
break;
}
cout << a << " " << d << " " << mid << " " << c << " ";
for (int i = 1; i <= n; ++i)
if (i != a && i != b && i != c && i != d && i != mid) cout << i << " ";
cout << b << "\n";
cout << c << " ";
for (int i = 1; i <= n; ++i)
if (i != a && i != b && i != c && i != d && i != mid) cout << i << " ";
cout << b << " " << mid << " " << a << " " << d << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
const long long int INF = 2000000000000000000;
long long int MOD(long long int a, long long int b) {
if (a > b)
return a - b;
else
return b - a;
}
long long int max3(long long int a, long long int b, long long int c) {
return max(c, max(a, b));
}
long long int min3(long long int a, long long int b, long long int c) {
return min(a, min(b, c));
}
long long int power(long long int x, long long int y) {
long long int res = 1;
x = x;
while (y > 0) {
if (y & 1) res = (res * x);
y = y >> 1;
x = (x * x);
}
return res;
}
long long int logg(long long int a) {
long long int x = 0;
while (a > 1) {
x++;
a /= 2;
}
return x;
}
long long int gcd(long long int a, long long int b) {
if (a == 0) return b;
return gcd(b % a, a);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
;
int n, k;
cin >> n >> k;
int a, b, c, d;
cin >> a >> b >> c >> d;
if (k <= n || n == 4) {
cout << -1;
return 0;
} else {
vector<int> ans1;
vector<int> ans2;
ans1.push_back(a);
ans1.push_back(c);
for (int i = 1; i <= n; i++) {
if (i != a && i != b && i != c && i != d) {
ans1.push_back(i);
}
}
ans1.push_back(d);
ans1.push_back(b);
ans2.push_back(c);
ans2.push_back(a);
for (int i = 1; i <= n; i++) {
if (i != a && i != b && i != c && i != d) {
ans2.push_back(i);
}
}
ans2.push_back(b);
ans2.push_back(d);
for (int i = 0; i < n; i++) {
cout << ans1[i] << ' ';
}
cout << endl;
for (int i = 0; i < n; i++) {
cout << ans2[i] << ' ';
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
bool mark[n];
int a, b, c, d;
cin >> a >> b >> c >> d;
for (int i = 0; i < n; i++) {
mark[i] = 0;
}
mark[a - 1] = 1;
mark[b - 1] = 1;
mark[c - 1] = 1;
mark[d - 1] = 1;
if (n <= 4) {
cout << -1;
return 0;
}
if (n >= k) {
cout << -1;
return 0;
} else {
cout << a << " " << d << " ";
for (int i = 0; i < n; i++) {
if (mark[i] == 0) cout << i + 1 << " ";
}
cout << c << " " << b << "\n";
cout << c << " " << b << " ";
for (int i = 0; i < n; i++) {
if (mark[i] == 0) cout << i + 1 << " ";
}
cout << a << " " << d << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> vec(n), res;
for (auto &v : vec) {
cin >> v;
}
if (k == 1) {
return cout << vec[0], 0;
}
int l = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= i; j++) {
l++;
if (l == k) {
return cout << vec[j - 1], 0;
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, k;
cin >> n >> k;
vector<int> id(n);
for (int& v : id) cin >> v;
ll s = 1;
ll i = 1;
while (s < k) {
i++;
s += i;
}
i--;
k -= (i * (i + 1)) / 2;
cout << id[k - 1] << '\n';
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAX = 1e5 + 5;
int a[MAX];
int main() {
int n, k;
scanf("%d%d", &n, &k);
int st = 1, nd = 100000, r = 0;
while (st <= nd) {
int mid = (st + nd) >> 1;
long long v = mid * 1LL * (mid + 1) / 2LL;
if (v < k) {
r = max(r, (int)v);
st = mid + 1;
} else
nd = mid - 1;
}
for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
printf("%d\n", a[k - r]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int r[100010];
long long N, k;
int main() {
while (cin >> N >> k) {
memset(r, 0, sizeof(r));
for (int i = 0; i < N; i++) {
cin >> r[i];
}
long long ans = 0, t;
t = (sqrt(1 + 8 * k) - 1) / 2;
ans = k - (t * (t + 1)) / 2;
if (ans == 0) {
ans = t;
}
cout << r[ans - 1] << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
const long N = 300000, mx = 1000000000;
long i, m, n, k, j, w, c[N], xx, yy, w1, w2, l, a[N], b[N], s;
int main() {
cin >> n >> m;
for (i = 1; i <= n; i++) cin >> a[i];
l = m;
s = 1;
while (l > 0) {
if (s < l)
l -= s;
else
break;
s++;
}
cout << a[l];
}
|
#include <bits/stdc++.h>
using namespace std;
long int a[100100];
int main() {
long long int n;
cin >> n;
long long int k;
cin >> k;
long long int t = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
int j = 0;
for (j = 0; k >= (t + j); j++) {
t += j;
}
if (t == k) {
cout << a[j - 1];
return 0;
}
long long int x = k - t;
cout << a[x];
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
long long a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, w, x,
y, z, cnt, sum, total, ar[100005], br[100005], row, col, nx, ny, hi, lo,
mid, ans, tc;
cin >> n >> k;
for (i = 1; i <= n; i++) {
cin >> ar[i];
s = ((i + 1) * i) / 2;
br[i] = s;
}
for (i = 1; i <= n; i++) {
if (k > br[i] && k < br[i + 1]) {
d = i + 1;
f = 1;
break;
} else if (k == br[i]) {
d = i;
f = 0;
break;
}
}
if (f) {
s = k - br[i];
} else {
s = i;
}
cout << ar[s];
}
|
#include <bits/stdc++.h>
using namespace std;
long long a[1000010], b[1010][1010], d[100010], dp[1010][1010], p[1000010];
long long mn = 1e9, mx = -1e9, ans, cnt, sm = 1, n, m;
bool ok, okk, u[1000010], uu[510][510];
char ck[100010], ch[1010][1010];
int dx[5] = {0, 1, 0, -1}, dy[5] = {-1, 0, 1, 0};
vector<long long> g[100010], v, vv;
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = 1; i < 1e5 + 1; i++) {
if (i >= m) {
cnt = i;
break;
}
m -= i;
}
cout << a[m];
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
pair<long long int, long long int> ar[1000005];
int test[1000005];
int main() {
long long int n, k;
cin >> n >> k;
long long int add = 0;
long long int i = 1;
long long int len;
long long int p1 = 0;
ar[0] = make_pair(1, 0);
while (p1 <= 2000000000) {
p1 = ar[i - 1].first + add;
long long int p2 = ar[i - 1].second + 1;
ar[i] = make_pair(p1, p2);
add += 1;
i++;
}
len = i - 1;
for (long long int i = 1; i <= n; i++) {
cin >> test[i];
}
for (long long int i = 1; i <= len; i++) {
long long int x1 = ar[i].first;
long long int x2 = x1 + ar[i].second - 1;
if (k >= x1 && k <= x2) {
long long int y = k - x1 + 1;
cout << test[y];
break;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, k;
int qtd = 1;
int cnt = 1;
int ans = 0;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> k;
int robos[n];
for (int i = 0; i < n; i++) {
cin >> robos[i];
}
while (k > qtd) {
cnt++;
qtd += cnt;
}
cout << robos[cnt - (qtd - k) - 1] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k, id[100500];
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> id[i];
}
if (n == 1) {
cout << id[0];
return 0;
}
long long sum = 0;
for (int i = 1; i < k; i++) {
if (k - i > 0) {
k -= i;
} else
break;
}
cout << id[k - 1];
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100 * 1000 + 10;
int arr[MAXN];
long long n, k;
long long BS(long long s, long long e) {
if (e - s <= 1) return s;
long long m = (s + e) / 2;
long long a = m * (m + 1) / 2;
if (k > a)
return BS(m, e);
else
return BS(s, m);
}
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++) cin >> arr[i];
long long x = BS(0, n);
long long a = x * (x + 1) / 2;
cout << arr[k - a - 1] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1.0);
const int MAXN = 101111;
long long n, k, a[MAXN];
int main() {
ios::sync_with_stdio(false);
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = 1; k - i >= 1; i++) {
k -= i;
}
cout << a[k] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int i = 0, uk = 0, n, k, c;
cin >> n >> k;
cout << endl;
int str[100000];
while (i < k) {
cin >> str[uk];
uk++;
i = i + uk;
}
c = uk - (i - k + 1);
cout << endl;
cout << str[c];
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[100000];
int n, k;
int main() {
scanf("%d%d", &n, &k);
for (int i = 0; i < n; i++) scanf("%d", &a[i]);
int l = 0, r = n;
while (r - l > 1) {
int m = (l + r) / 2;
if ((long long)k > (long long)m * (m + 1) / 2)
l = m;
else
r = m;
}
printf("%d", a[k - l * (l + 1) / 2 - 1]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, k, v[100010], t, i;
int main() {
cin >> n >> k;
for (i = 1; i <= n; i++) cin >> v[i];
while (t < k) {
t++;
k -= t;
}
if (k)
cout << v[k];
else
cout << v[t];
}
|
#include <bits/stdc++.h>
using namespace std;
long long n, k;
long long ids[100005];
int main() {
cin >> n >> k;
for (int i = 0; i < n; ++i) cin >> ids[i];
for (int i = 0; i < n; ++i) {
if (k <= (i + 1)) {
cout << ids[k - 1] << endl;
break;
} else
k -= (i + 1);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
long long cnt = 0;
for (int i = 0; i < n; i++) {
cnt += 1LL * (i + 1);
if (cnt >= k) {
cnt -= i + 1;
k -= cnt;
k--;
break;
}
}
int a;
int res = -1;
for (int i = 0; i < n; i++) {
cin >> a;
if (i == k) {
res = a;
}
}
cout << res;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const int N = 100000 + 10;
const int M = N * N;
int A[N];
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;
continue;
}
cout << A[k] << endl;
break;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<long long int> v;
long long int n, k, i, j, m, x, y, z, q = 0, l, r;
cin >> n >> k;
for (i = 0; i < n; i++) {
cin >> m;
v.push_back(m);
z = ((i + 1) * (i + 2)) / 2;
if ((z - k) >= q) {
x = v[i];
q = 9999999999;
l = i;
r = z - k;
}
}
cout << v[l - r] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAX = 1e5 + 10;
int id[MAX], n, k;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> k;
for (int(i) = (1); (i) < (n + 1); (i)++) cin >> id[i];
for (int(i) = (1); (i) < (n + 1); (i)++) {
if (k <= i) {
cout << (id[k]) << "\n";
;
return 0;
}
k -= i;
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxN = 100000 + 10;
int id[maxN + 10];
int main() {
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; ++i) cin >> id[i];
for (int i = 1; i <= n; ++i)
if (k <= i) {
cout << id[k] << endl;
return 0;
} else
k -= i;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long MAXN = (1 << 20);
long long n;
long long k;
long long a[100042];
map<long long, long long> used;
map<long long, long long> which;
void read() {
cin >> n >> k;
for (long long i = 0; i < n; i++) cin >> a[i];
}
void solve() {
k--;
long long pos = 0, last_pos = 0;
if (k == 0) {
cout << a[0] << '\n';
return;
}
for (long long i = 1; i < n; i++) {
pos += i + 1;
if (last_pos < k && k <= pos) {
k -= last_pos;
cout << a[k - 1] << '\n';
return;
}
last_pos = pos;
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
read();
solve();
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, i, k;
cin >> n >> k;
long long a[n];
for (i = 0; i < n; i++) cin >> a[i];
i = 1;
while (k > i) {
k = k - i;
i++;
}
cout << a[k - 1];
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, k, x;
cin >> n >> k;
for (int i = 1; k > i; i++) {
k = k - i;
}
for (int i = 1; i <= n; i++) {
cin >> x;
if (i == k) {
cout << x << endl;
return 0;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, k, i, x, z;
cin >> n >> k;
vector<long long int> v;
for (i = 0; i < n; i++) {
cin >> x;
v.push_back(x);
}
z = (-1 + sqrt(1 + 8 * k)) / 2;
if (((z * z + z) / 2) - k == 0)
cout << v[z - 1];
else
cout << v[abs(k - (z * z + z) / 2) - 1];
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int a[1000000], b[1000000], i, j;
int q = 0, x, sira;
scanf("%d %d", &x, &sira);
for (i = 1; i <= x; i++) {
scanf("%d", &a[i]);
}
for (i = 1;; i++) {
if (q + i >= sira) {
sira -= q;
break;
}
q += i;
}
printf("%d", a[sira]);
}
|
#include <bits/stdc++.h>
using namespace std;
inline int ckmax(int &a, int b) { return a < b ? a = b, 1 : 0; }
inline int ckmin(int &a, int b) { return a > b ? a = b, 1 : 0; }
const int maxn = 100100;
int n, k;
int id[maxn];
int main() {
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; ++i) scanf("%d", id + i);
for (int i = 1; i <= n; ++i) {
if (k > i)
k -= i;
else {
printf("%d\n", id[k]);
break;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n = 0, k;
cin >> n >> k;
int *robots = new int[n];
for (int i = 0; i < n; i++) cin >> robots[i];
for (int i = 0; i < n; i++) {
if (k <= i + 1) break;
k = k - i - 1;
}
cout << robots[k - 1];
return 0;
}
|
#include <bits/stdc++.h>
const int N = 1000000;
int id[N + 10];
int main() {
int n = 0;
long long k = 0;
scanf("%d", &n);
std::cin >> k;
for (int i = 1; i <= n; i++) scanf("%d", id + i);
for (int i = 1; i <= n; i++) {
if (k <= 1LL * i) {
printf("%d\n", id[k]);
break;
}
k -= i;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long niz[1000100], n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) cin >> niz[i];
long long l = 1, r = n;
while (l < r) {
long long s = (l + r + 1) / 2;
if (s * (s + 1) / 2 >= k)
r = s - 1;
else
l = s;
}
if (k == 1)
cout << niz[0] << endl;
else
cout << niz[k - l * (l + 1) / 2 - 1] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> vec(n);
for (int i = 0; i < n; ++i) {
scanf("%d", &vec[i]);
}
int kk = 0;
for (int i = 1; i <= n; ++i) {
if (kk + i >= k)
break;
else
kk += i;
}
cout << vec[k - kk - 1];
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
};
long long n, k;
cin >> n >> k;
vector<long long> v(n);
for (long long i = (long long)0; i <= (long long)n - 1; i++) cin >> v[i];
long long cnt = 1, ans = 0;
while (ans + cnt < k) {
ans += cnt;
cnt++;
}
long long temp = k - ans - 1;
cout << v[temp] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long a[501001];
pair<int, int> v[501001];
int main() {
long long n, i, j, m, c = 1, x, y, c2 = 1, k = 1;
scanf("%lld%lld", &n, &m);
for (i = 0; i < n; i++) {
scanf("%lld", &a[i]);
}
while (c <= m) {
k = c;
c += c2;
if (k == m) {
break;
}
if (c > m) {
break;
}
c2++;
}
i = 0;
while (k <= c) {
if (k == m) {
printf("%lld\n", a[i]);
break;
}
k++;
i++;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, k, a[int(1e5) + 10];
int main() {
scanf("%d %d", &n, &k);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
for (int I = 1; I <= n; I++) {
if (k <= I) {
printf("%d", a[k - 1]);
return 0;
} else {
k -= I;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
long long int k;
cin >> n;
cin >> k;
int* all = new int[n];
for (long long int i = 1; i <= n; i++) scanf("%d", &all[i]);
long long int robot = 1;
long long int cur = 1;
while (cur < k) {
cur = (robot + 1) * (robot + 2) / 2;
robot++;
}
cur = robot * (robot - 1) / 2;
printf("%d", all[k - cur]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long n, k;
int main() {
cin >> n >> k;
int need = 0;
long long done = 0;
for (int i = 1;; ++i) {
done += i;
if (done >= k) {
need = i - (done - k);
break;
}
}
int x;
for (int i = 0; i < need; ++i) scanf("%d", &x);
printf("%d\n", x);
return 0;
}
|
#include <bits/stdc++.h>
const int N = 100100;
int a[N];
int n, k;
int main() {
scanf("%d%d", &n, &k);
for (int i = 0; i < n; ++i) scanf("%d", &a[i]);
int x = 1;
while (k > x) {
k -= x;
++x;
}
printf("%d\n", a[k - 1]);
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.