| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1353678 | muhammad-ahmad | Minerals (JOI19_minerals) | C++20 | 0 ms | 344 KiB |
#include "minerals.h"
#include <bits/stdc++.h>
using namespace std;
void solve(vector<int> A, vector<int> B){
if (A.empty()) return;
if (A.size() == 1){
Answer(A[0], B[0]);
return;
}
int mid = A.size() / 2;
vector<int> A1(A.begin(), A.begin() + mid), A2(A.begin() + mid, A.end());
vector<int> B1, B2;
int bef = 0;
for (auto i : A1){
bef = Query(i);
}
for (auto i : B){
int now = Query(i);
if (now == bef) B1.push_back(i);
else B2.push_back(i);
Query(i);
}
for (auto i : A1) Query(i);
solve(A1, B1);
solve(A2, B2);
}
void Solve(int N){
vector<int> A, B;
for (int i = 1; i <= 2 * N; i++){
int before = Query(i);
if (before > A.size()){
A.push_back(i);
}
else {
B.push_back(i);
Query(i);
}
}
solve(A, B);
}| # | 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... | ||||
