Submission #501713

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
501713	2022-01-04 10:52:20	amunduzbaev	Monster Game (JOI21_monster)	C++17	100 / 100	104 ms	536 KiB

monster

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
#include "monster.h"
#ifndef EVAL
#include "grader.cpp"
#endif
using namespace std;
 
bool qq(int a, int b) {
  return Query(a, b);
}
 
vector<int> Solve(int n) {
  function<vector<int>(int, int)> merge = [&](int l, int r){
    if(l == r) return vector<int>{l};
    int m = (l + r) >> 1;
    vector<int> lx = merge(l, m), rx = merge(m+1, r), res;
    l = 0, r = 0;
    while(l < (int)lx.size() || r < (int)rx.size()){
      if(l < (int)lx.size() && r < (int)rx.size()){
        //~ cout<<rx[r]<<" "<<lx[l]<<"\n";
        if(qq(lx[l], rx[r])) res.push_back(rx[r++]);
        else res.push_back(lx[l++]);
      } else if(l < (int)lx.size()){
        res.push_back(lx[l++]);
      } else {
        res.push_back(rx[r++]);
      }
    }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 10 / 10
• Subtask 2: 15 / 15
• Subtask 3: 75 / 75