Submission #1212766

#	Time	Username	Problem	Language	Result	Execution time	Memory
1212766		mychecksedad	Monster Game (JOI21_monster)	C++20	10 / 100	59 ms	416 KiB

monster

#include "monster.h"
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define MOD (1000000000+7)
#define MOD1 (998244353)
#define pb push_back
#define all(x) x.begin(), x.end()
#define en cout << '\n'
#define ff first
#define ss second
#define pii pair<int,int>
#define vi vector<int>
const int N = 1e6+100, M = 1e5+10, K = 52, MX = 30;

namespace {


}  // namespace

vector<int> Solve(int n) {
  vi v(n), res(n);
  vector<vi> RES(n);
  for(int i = 0; i < n; ++i){
    for(int j = i + 1; j < n; ++j){
      bool x = Query(i, j);
      x ? v[i]++ : v[j]++;
    }
  }
  for(int i = 0; i < n; ++i){
    if(v[i] != 1 && v[i] != n-2){
      res[i] = v[i];
      RES[v[i]].pb(i);
    }else{
      RES[v[i]].pb(i);
    }
  }



  bool x = !Query(RES[1][0], RES[2][0]) && (RES[2].size() == 1 ? true : !Query(RES[1][0], RES[2][1])); // whether it's beaten by both
  if(x){
    res[RES[1][0]] = 0;
    res[RES[1][1]] = 1;
  }else{
    res[RES[1][0]] = 1;
    res[RES[1][1]] = 0;
  }

  bool y = Query(RES[n-2][0], RES[n-3][0]) && (RES[n-3].size() == 1 ? true : Query(RES[n-2][0], RES[n-3][1])); // whether it's beats both
  if(y){
    res[RES[n-2][0]] = n-1;
    res[RES[n-2][1]] = n-2;
  }else{
    res[RES[n-2][0]] = n-2;
    res[RES[n-2][1]] = n-1;
  }

  vector<int> V;
  V.pb(0);
  for(int i = 1; i < n; ++i){
    int l = 0, r = int(V.size())-1, pos = V.size();  
    while(l <= r){
      int mid = l+r>>1;
      if(!Query(i, V[mid])){
        pos = mid;
        r = mid - 1;
      }else l = mid + 1;
    }
    V.insert(V.begin() + pos, i);
  }

  for(int i = 1; i < n; ++i){
    if(res[V[i]] < res[V[i - 1]]){
      assert(res[V[i]] == res[V[i - 1]] - 1);
    }
  }

  // for(int i = 0; i < n; ++i) cerr << V[i] << ' ';

  return res;
}

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