# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
250121 |
2020-07-17T04:10:44 Z |
dwsc |
Minerals (JOI19_minerals) |
C++14 |
|
1 ms |
384 KB |
#include "minerals.h"
#include <bits/stdc++.h>
using namespace std;
int n;
void solve(vector<int> v1,vector<int> v2,bool in1,bool in2){
if (v1.size() == 1){
Answer(v1[0],v2[0]);
return;
}
int stop = v1.size()/2;
vector<int> v1a,v1b,v2a,v2b;
int num;
for (int i = 0; i < v1.size(); i++){
if (i < stop){
num = Query(v1[i]);
v1a.push_back(v1[i]);
}
else{
v1b.push_back(v1[i]);
}
}
for (int i = 0; i < v2.size(); i++){
if (v2a.size() == stop){
v2b.push_back(v2[i]);
continue;
}
if (v2b.size() == v2.size()-stop){
v2a.push_back(v2[i]);
continue;
}
int temp = Query(v2[i]);
if (in1 && in2){
if (temp < num) v2a.push_back(v2[i]);
else v2b.push_back(v2[i]);
}
else if (in1 && !in2){
if (temp > num) v2a.push_back(v2[i]);
else v2b.push_back(v2[i]);
}
else if (!in1 && in2){
if (temp == num) v2a.push_back(v2[i]);
else v2b.push_back(v2[i]);
}
else{
if (temp == num) v2a.push_back(v2[i]);
else v2b.push_back(v2[i]);
}
}
solve(v1a,v2a,!in1,!in2);
solve(v1b,v2b,in1,!in2);
}
void Solve(int N) {
n = N;
vector<int> v1,v2;
int num = 0;
for (int i = 1; i <= 2*N; i++){
int temp = Query(i);
if (temp > num){
num++;
v1.push_back(i);
}
else{
v2.push_back(i);
}
}
solve(v1,v2,1,1);
}
Compilation message
minerals.cpp: In function 'void solve(std::vector<int>, std::vector<int>, bool, bool)':
minerals.cpp:13:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i = 0; i < v1.size(); i++){
~~^~~~~~~~~~~
minerals.cpp:22:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i = 0; i < v2.size(); i++){
~~^~~~~~~~~~~
minerals.cpp:23:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if (v2a.size() == stop){
~~~~~~~~~~~^~~~~~~
minerals.cpp:33:13: warning: 'num' may be used uninitialized in this function [-Wmaybe-uninitialized]
if (temp < num) v2a.push_back(v2[i]);
^~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
384 KB |
Wrong Answer [5] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
384 KB |
Wrong Answer [5] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
384 KB |
Wrong Answer [5] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
384 KB |
Wrong Answer [5] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
384 KB |
Wrong Answer [5] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
384 KB |
Wrong Answer [5] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
384 KB |
Wrong Answer [5] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
384 KB |
Wrong Answer [5] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
384 KB |
Wrong Answer [5] |
2 |
Halted |
0 ms |
0 KB |
- |