Submission #709603

#	Time	Username	Problem	Language	Result	Execution time	Memory
709603		null_awe	Minerals (JOI19_minerals)	C++14	40 / 100	72 ms	4084 KiB

minerals

#include <iostream>
#include <vector>
#include <set>
#include "minerals.h"
using namespace std;

set<int> on;

void solve(vector<int> a, vector<int> b) {
  if (a.size() == 1) {
    Answer(a[0], b[0]);
    return;
  }
  int n = a.size() / 2, m = a.size() - n;
  vector<int> a1(n), a2(m);
  vector<int> b1, b2;
  for (int i = 0; i < n; ++i) a1[i] = a[i];
  for (int i = 0; i < m; ++i) a2[i] = a[i + n];
  for (int i : a1) if (!on.count(i)) Query(i), on.insert(i);
  for (int i : a2) if (on.count(i)) Query(i), on.erase(i);
  for (int i : b) {
    if (b1.size() == n) {
      b2.push_back(i);
      continue;
    } else if (b2.size() == m) {
      b1.push_back(i);
      continue;
    }
    int now = Query(i);
    if (now == on.size()) b1.push_back(i);
    else b2.push_back(i);
    Query(i);
  }
  solve(a1, b1), solve(a2, b2);
}

void Solve(int n) {
  vector<int> a, b;
  int last = 0;
  for (int i = 1; i <= 2 * n; ++i) {
    int now = Query(i);
    if (now > last) a.push_back(i), on.insert(i);
    else b.push_back(i);
    last = now;
  }
  for (int i : b) Query(i);
  solve(a, b);
}

Compilation message (stderr)

minerals.cpp: In function 'void solve(std::vector<int>, std::vector<int>)':
minerals.cpp:22:19: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   22 |     if (b1.size() == n) {
      |         ~~~~~~~~~~^~~~
minerals.cpp:25:26: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   25 |     } else if (b2.size() == m) {
      |                ~~~~~~~~~~^~~~
minerals.cpp:30:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::set<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |     if (now == on.size()) b1.push_back(i);
      |         ~~~~^~~~~~~~~~~~

• Subtask 1: 6 / 6
• Subtask 2: 25 / 25
• Subtask 3: 9 / 9
• Subtask 4: 0 / 30
• Subtask 5: 0 / 5
• Subtask 6: 0 / 5
• Subtask 7: 0 / 5
• Subtask 8: 0 / 5
• Subtask 9: 0 / 10