제출 #709617

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
709617		null_awe	Minerals (JOI19_minerals)	C++14	90 / 100	69 ms	3780 KiB

minerals

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

vector<bool> on;
int ans;

void solve(vector<int> a, vector<int> b) {
  if (a.size() == 1) {
    Answer(a[0], b[0]);
    return;
  }
  auto rng = default_random_engine{};
  shuffle(a.begin(), a.end(), rng);
  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];
  vector<int> chg(2);
  for (int i : a1) ++chg[on[i]];
  for (int i : a2) ++chg[1 - on[i]];
  if (chg[0] > chg[1]) swap(n, m), swap(a1, a2), swap(b1, b2);
  for (int i : a1) if (!on[i]) ans = Query(i), on[i] = 1;
  for (int i : a2) if (on[i]) ans = Query(i), on[i] = 0;
  for (int i : b) {
    if (b1.size() == n) {
      b2.push_back(i);
      continue;
    }
    if (b2.size() == m) {
      b1.push_back(i);
      continue;
    }
    int now = Query(i);
    if (now == ans) b1.push_back(i);
    else b2.push_back(i);
    ans = now;
  }
  solve(a1, b1), solve(a2, b2);
}

void Solve(int n) {
  on.resize(2 * n + 1);
  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[i] = 1;
    else b.push_back(i);
    last = ans = now;
  }
  solve(a, b);
}

컴파일 시 표준 에러 (stderr) 메시지

minerals.cpp: In function 'void solve(std::vector<int>, std::vector<int>)':
minerals.cpp:31:19: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   31 |     if (b1.size() == n) {
      |         ~~~~~~~~~~^~~~
minerals.cpp:35:19: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   35 |     if (b2.size() == m) {
      |         ~~~~~~~~~~^~~~

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