Submission #534297

#	Time	Username	Problem	Language	Result	Execution time	Memory
534297		Monarchuwu	Monster Game (JOI21_monster)	C++17	0 / 100	199 ms	404 KiB

monster

#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
typedef long long ll;

#include "monster.h"
const int N = 200 + 2;
int cnt[N];
vector<int> Solve(int n) {
    for (int i = 0; i < n; ++i)
        for (int j = 0; j < i; ++j)
            ++cnt[Query(i, j) ? i : j];

    vector<int> ans(n, 0), vec1, vecn;
    for (int i = 0; i < n; ++i) {
        if (cnt[i] == n - 2) vecn.push_back(i);
        else if (cnt[i] == 1) vec1.push_back(i);
        else ans[cnt[i]] = i;
    }

    if (Query(vec1[0], vec1[1]))
        ans[vec1[0]] = 0, ans[vec1[1]] = 1;
    else ans[vec1[0]] = 1, ans[vec1[1]] = 0;

    if (Query(vecn[0], vecn[1]))
        ans[vecn[0]] = n - 2, ans[vecn[1]] = n - 1;
    else ans[vecn[0]] = n - 1, ans[vecn[1]] = n - 2;

    return ans;
}
/**  /\_/\
 *  (= ._.)
 *  / >0  \>1
**/

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