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 "minerals.h"
#include <bits/stdc++.h>
#define All(x) x.begin(), x.end()
#define pb emplace_back
using namespace std;
#define debug(args...) kout("[ " + string(#args) + " ]", args)
void kout() { cerr << endl; }
template <class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ',kout(b...); }
template <class T> void pary(T L, T R) { while (L != R) cerr << *L << " \n"[++L==R]; }
int pre, now;
void check(vector <int> A, vector <int> B, bool flagA, bool flagB) {
if (A.size() == 1) {
Answer(A[0], B[0]);
return;
}
int len = B.size() / 2;
vector <int> LA, RA, LB, RB;
for (int i = 0; i < len; i++) {
pre = now;
now = Query(B[i]);
LB.pb(B[i]);
}
for (int i = len; i < B.size(); i++) {
RB.pb(B[i]);
}
for (int i = 0; i < A.size(); i++) {
pre = now;
now = Query(A[i]);
if ( (!flagA && !flagB && now == pre)
|| (!flagA && flagB && now == pre+1)
|| ( flagA && !flagB && now == pre)
|| ( flagA && flagB && now == pre-1)) {
LA.pb(A[i]);
} else {
RA.pb(A[i]);
}
if (LA.size() == len && !RA.size()) {
for (int j = len; j < A.size(); j++)
RA.pb(A[j]);
check(LA, LB, !flagA, !flagB);
check(RA, RB, flagA, flagB);
return;
}
if (RA.size() == B.size()-len && !LA.size()) {
for (int j = B.size()-len; j < A.size(); j++)
LA.pb(A[j]);
check(LA, LB, flagA, !flagB);
check(RA, RB, !flagA, flagB);
return;
}
}
check(LA, LB, !flagA, !flagB);
check(RA, RB, !flagA, flagB);
}
void Solve(int N) {
srand(time(NULL));
vector <int> num(2*N);
for (int i = 0; i < 2*N; i++) num[i] = i+1;
random_shuffle(All(num));
vector <int> A, B;
for (int id : num) {
pre = now;
now = Query(id);
if (now != pre + 1) {
B.pb(id);
} else {
A.pb(id);
}
}
check(A, B, true, true);
}
Compilation message (stderr)
minerals.cpp: In function 'void check(std::vector<int>, std::vector<int>, bool, bool)':
minerals.cpp:25:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
25 | for (int i = len; i < B.size(); i++) {
| ~~^~~~~~~~~~
minerals.cpp:28:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
28 | for (int i = 0; i < A.size(); i++) {
| ~~^~~~~~~~~~
minerals.cpp:39:17: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
39 | if (LA.size() == len && !RA.size()) {
| ~~~~~~~~~~^~~~~~
minerals.cpp:40:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
40 | for (int j = len; j < A.size(); j++)
| ~~^~~~~~~~~~
minerals.cpp:47:33: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
47 | for (int j = B.size()-len; j < A.size(); j++)
| ~~^~~~~~~~~~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |