#include "minerals.h"
#include <bits/stdc++.h>
using namespace std;
int lim = 50;
void Solve(int N){
deque<int> indeksy;
for (int i = 1; i <= 2*N; i++){
indeksy.push_back(i);
}
vector<int> nasze;
int prev = 0;
while (indeksy.size()){
int c = indeksy.back();
indeksy.pop_back();
int n = Query(c);
//cerr << c << " " << n << " " << prev << "\n";
if (n == prev){
for (int i = 0; i < nasze.size(); i++){
int d = Query(nasze[i]);
//cer << d << " loolo\n";
if (d == n){
//cerr << nasze[i] << " " << c << "\n";
Answer(nasze[i], c);
swap(nasze[i], nasze[nasze.size()-1]);
nasze.pop_back();
prev = Query(c);
//cerr << prev << "\n";
break;
}
else Query(nasze[i]);
}
}
else if (nasze.size() < lim){
nasze.push_back(c);
prev = n;
}
else{
indeksy.push_front(c);
prev = Query(c);
}
}
}
# | 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... |