제출 #836235

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
836235		Liudas	Minerals (JOI19_minerals)	C++17	40 / 100	27 ms	3180 KiB

minerals

#include "minerals.h"
#include "minerals.h"
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <iostream>
using namespace std;
int last = 0;
void div(vector<int> start, vector<int> end){
  int N = start.size();
  vector<int> l, r, le, re;
  if(N == 1){
    Answer(start[0], end[0]);
    return;
  }
  for(int i = 0; i < N/2; i ++){
    last = Query(start[i]);
    l.push_back(start[i]);
  }
  for(int i = N/2; i < N; i ++){
    r.push_back(start[i]);
  }
  for(int i = 0; i < N; i ++){
    int t = Query(end[i]);
    if(t != last){
      last = t;
      le.push_back(end[i]);
    }
    else{
      Query(end[i]);
      re.push_back(end[i]);
    }
  }
  div(le, l);
  div(r, re);
}
void Solve(int N) {
  vector<int> start, end;
  for(int i = 0; i < N * 2; i ++){
    int t = start.size();
    int ans = Query(i+1);
    if(ans == t + 1){
      start.push_back(i+1);
    }
    else{
      end.push_back(i+1);
      Query(i+1);
    }
  }
  last = N;
  div(start, end);
}

• 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