# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
611169 | alireza_kaviani | Minerals (JOI19_minerals) | C++17 | 32 ms | 5544 KiB |
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>
using namespace std;
#define SZ(x) int((x).size())
const int MAXN = 1e5 + 10;
const int LOG = 16;
int L[MAXN] , M[MAXN] , R[MAXN];
vector<int> v1 , v2 , Q[MAXN];
void Solve(int n) {
for(int i = 1 ; i <= 2 * n ; i++){
int x = Query(i);
if(x == SZ(v1)){
v2.push_back(i);
}
else{
v1.push_back(i);
}
}
for(int i = 0 ; i < n ; i++){
L[i] = -1; R[i] = n - 1;
}
for(int i = 0 ; i < LOG ; i++){
for(int j = 1 ; j <= 2 * n ; j++){
Query(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... |