# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
742175 |
2023-05-15T17:52:57 Z |
aaaaa |
Nizovi (COI14_nizovi) |
C++14 |
|
185 ms |
308 KB |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 7;
int a,b;
int mjesto[MAXN];
int bs (int x, int lo, int hi) {
while (lo < hi) {
int mid = (lo + hi + 1) / 2;
cout << "cmp " << x << ' ' << mid + a << "\n";
cout.flush();
int c;
cin >> c;
if (c == -1) hi = mid - 1;
else lo = mid;
}
return lo;
}
int main () {
ios_base::sync_with_stdio (false);
cin.tie (0);
cin >> a >> b;
mjesto[0] = a;
for (int i = 1; i <= a; i++) mjesto[i] = bs (i, mjesto[i - 1] - a, b) + a;
int lo = 1, hi;
for (int i = 1; i <= a; i++) {
hi = mjesto[i];
int duk = hi - lo + 1, da = a - i + 1, db = duk - da;
if (duk <= 1 || da == 0 || db == 0) {
lo++;
continue;
}
cout << "reverse " << lo << ' ' << hi << "\n";
cout.flush ();
if (db > 1) {
cout << "reverse " << lo << ' ' << lo + db - 1 << "\n";
cout.flush ();
}
if (da > 1) {
cout << "reverse " << hi - da + 1 << ' ' << hi << "\n";
cout.flush ();
}
lo = hi - da + 2;
}
cout << "end";
cout.flush ();
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
208 KB |
Output is correct |
2 |
Correct |
2 ms |
208 KB |
Output is correct |
3 |
Correct |
2 ms |
208 KB |
Output is correct |
4 |
Correct |
25 ms |
208 KB |
Output is correct |
5 |
Correct |
24 ms |
300 KB |
Output is correct |
6 |
Correct |
29 ms |
208 KB |
Output is correct |
7 |
Correct |
185 ms |
308 KB |
Output is correct |
8 |
Correct |
66 ms |
308 KB |
Output is correct |
9 |
Correct |
121 ms |
308 KB |
Output is correct |
10 |
Incorrect |
182 ms |
300 KB |
Total cost of reverse commands > 3 000 000 |