제출 #1239916

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1239916		lrnnz	Monster Game (JOI21_monster)	C++20	10 / 100	59 ms	408 KiB

monster

#include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <queue>
#include <random>
#include "monster.h"
using namespace std;

#define all(a) (a).begin(), (a).end()
#define ll long long
#define ld long double
#define ui uint64_t
#define cont(set, element) ((set).find(element) != (set).end())

#define chmin(x, y) (x = min(x, y)) 
#define chmax(x, y) (x = max(x, y))

/********* DEBUG *********/

template <typename T>
void outvec(const vector<T>& Z){
    for (const T& x : Z)
    cout << x << ' ';
    cout << "\n";
}
void printVariable(const any& var) {
    if (!var.has_value()) {
        cout << "null";
        return;
    }

    if (var.type() == typeid(int)) {
        cout << any_cast<int>(var);
    } else if (var.type() == typeid(double)) {
        cout << any_cast<double>(var);
    } else if (var.type() == typeid(float)) {
        cout << any_cast<float>(var);
    } else if (var.type() == typeid(char)) {
        cout << any_cast<char>(var);
    } else if (var.type() == typeid(bool)) {
        cout << (any_cast<bool>(var) ? "true" : "false");
    } else if (var.type() == typeid(string)) {
        cout << any_cast<string>(var);
    } else if (var.type() == typeid(const char*)) {
        cout << any_cast<const char*>(var);
    } else if (var.type() == typeid(long long)) {
        cout << any_cast<long long>(var);
    } else {
        cout << "[unknown type]";
    }
}

template<typename... Args>
void outval(Args... args) {
    vector<any> variables = {args...};
    
    for (size_t i = 0; i < variables.size(); ++i) {
        printVariable(variables[i]);
        if (i != variables.size() - 1) {
            cout << " ";
        }
    }
    cout << "\n";
}

#define sp << " " <<
#define fi first
#define se second

/********* DEBUG *********/

const ll MOD = 1e9+7;
const ll MOD2 = 998244353;
const ll inf = 1e18;
const ll mxN = 100005;

vector<int> Solve(int N) {
    vector<int> wins(N);
    for (int i = 0; i < N-1; i++){
        for (int j = i + 1; j < N; j++){
            if (Query(i, j))
                wins[i]++;
            else
                wins[j]++;
        }
    }

    //outval("wins:");
    //outvec(wins);

    ll a=-1,b=-1,c=-1,d=-1;
    for (int i = 0; i < N; i++){
        if (wins[i] == 1)
            b = i;

        if (wins[i] == N-2)
            d = i;

        if (a==-1)
            swap(a,b);

        if (c==-1)
            swap(c,d);
    }

    //outval("a,b,c,d:",a,b,c,d);
    //return {};

    if (Query(a,b))
        wins[a]--;
    else
        wins[b]--;

    if (Query(c,d))
        wins[d]++;
    else
        wins[c]++;

    return wins;
}

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