This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcount
#define ll long long
#define mp make_pair
#define f first
#define s second
#define Time (double)clock()/CLOCKS_PER_SEC
void print(vector <int> a) {
cout << "cur:" << endl;
for (int i = 0; i < a.size(); i += 2)
cout << a[i] << ' ';
cout << endl;
for (int i = 1; i < a.size(); i += 2)
cout << a[i] << ' ';
cout << endl;
}
int get(vector <int> a, int x, int R) {
#ifdef HOME
cout << "GET:"<< endl;
#endif
if (a.size() == 2)
return 0;
int n = a.size() / 2;
for (int t = 0; t < R; ++t) {
for (int i = 0; i < a.size(); i += 2) {
if (a[i] > a[i + 1])
swap(a[i], a[i + 1]);
}
#ifdef HOME
print(a);
#endif
if (a[0] == 0) {
bool all2 = 1;
for (int i = 1; i < 2 * n; i += 2)
all2 &= a[i] == 2;
if (all2) {
int r = R - t;
for (int i = 0; i < a.size(); ++i)
if (a[i] == x) {
int ans = i / 2;
ans -= r;
return (ans % n + n) % n;
}
}
bool all0 = 1;
for (int i = 0; i < 2 * n; i += 2)
all0 &= a[i] == 0;
if (all0 && a[1] == 0) {
for (int i = 0; i < a.size(); ++i) {
if (a[i] == x) {
int ans = i / 2;
if (ans) {
return ans;
}
}
}
}
}
vector <int> b = a;
b[1] = a[2];
for (int i = 4; i < a.size(); i += 2) {
b[i - 2] = a[i];
}
b[(int)b.size() - 2] = a[1];
a = b;
}
for (int i = 0; i < a.size(); ++i)
if (a[i] == x)
return i / 2;
}
signed main() {
#ifdef HOME
freopen("input.txt", "r", stdin);
#else
#define endl '\n'
ios_base::sync_with_stdio(0); cin.tie(0);
#endif
int n, R;
cin >> n >> R;
R %= n;
R += 2 * n;
int my;
cin >> my;
vector <int> p(2 * n - 1);
for (int i = 0; i < 2 * n - 1; ++i) {
cin >> p[i];
if (p[i] < my)
p[i] = 0;
else
p[i] = 2;
}
my = 1;
int ans = 1e9;
int start = -1;
vector <int> nd(2 * n);
for (int i = 0; i < 2 * n; ++i) {
vector <int> t = p;
t.insert(t.begin() + i, my);
nd[i] = get(t, my, R);
}
for (int i = 0; i < 2 * n; ++i) {
if (nd[i] <= ans) {
ans = nd[i];
start = i / 2;
}
}
/*
for (int i = 0; i < 2 * n; ++i)
cout << nd[i] << ' ';
cout << endl;
*/
#ifdef HOME
cout << "ans : " << ans << endl;
#endif
cout << start + 1 << endl;
}
Compilation message (stderr)
archery.cpp: In function 'void print(std::vector<int>)':
archery.cpp:14:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i = 0; i < a.size(); i += 2)
~~^~~~~~~~~~
archery.cpp:17:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i = 1; i < a.size(); i += 2)
~~^~~~~~~~~~
archery.cpp: In function 'int get(std::vector<int>, int, int)':
archery.cpp:32:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i = 0; i < a.size(); i += 2) {
~~^~~~~~~~~~
archery.cpp:47:35: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i = 0; i < a.size(); ++i)
~~^~~~~~~~~~
archery.cpp:59:35: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i = 0; i < a.size(); ++i) {
~~^~~~~~~~~~
archery.cpp:73:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i = 4; i < a.size(); i += 2) {
~~^~~~~~~~~~
archery.cpp:80:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i = 0; i < a.size(); ++i)
~~^~~~~~~~~~
archery.cpp:83:1: warning: control reaches end of non-void function [-Wreturn-type]
}
^
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |