QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#708857#7179. Fischer's Chess Guessing GamethieunguyenhuyCompile Error//C++141.9kb2024-11-04 08:48:352024-11-04 08:48:36

Judging History

你现在查看的是最新测评结果

  • [2024-11-04 08:48:36]
  • 评测
  • [2024-11-04 08:48:35]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;

#define popcount(n) (__builtin_popcountll((n)))
#define clz(n) (__builtin_clzll((n)))
#define ctz(n) (__builtin_ctzll((n)))
#define lg(n) (63 - __builtin_clzll((n)))
#define BIT(n, i) (((n) >> (i)) & 1ll)
#define MASK(i) (1ll << (i))
#define FLIP(n, i) ((n) ^ (1ll << (i)))
#define ON(n, i) ((n) | MASK(i))
#define OFF(n, i) ((n) & ~MASK(i))

#define Int __int128
#define fi first
#define se second

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef pair<long long, int> pli;
typedef pair<int, long long> pil;
typedef vector<pair<int, int>> vii;
typedef vector<pair<long long, long long>> vll;
typedef vector<pair<long long, int>> vli;
typedef vector<pair<int, long long>> vil;

template <class T1, class T2>
bool maximize(T1 &x, T2 y) {
    if (x < y) {
        x = y;
        return true;
    }
    return false;
}
template <class T1, class T2>
bool minimize(T1 &x, T2 y) {
    if (x > y) {
        x = y;
        return true;
    }
    return false;
}

template <class T>
void remove_duplicate(vector<T> &ve) {
    sort (ve.begin(), ve.end());
    ve.resize(unique(ve.begin(), ve.end()) - ve.begin());
}

mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
template <class T> T random(T l, T r) {
    return uniform_int_distribution<T>(l, r)(rng);
}
template <class T> T random(T r) {
    return rng() % r;
}

const int N = 1e6 + 5;
const int MOD = 1e9 + 7;
const int inf = 1e9;
const ll INF = 1e18;

signed main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);

    sort (d.begin(), d.end());
    do {
        if (check(d)) state.emplace_back(d);
    } while (next_permutation(d.begin(), d.end()));

    cerr << '\n'; return 0;
}

Details

answer.code: In function ‘int main()’:
answer.code:69:11: error: ‘d’ was not declared in this scope; did you mean ‘ld’?
   69 |     sort (d.begin(), d.end());
      |           ^
      |           ld
answer.code:71:13: error: ‘check’ was not declared in this scope
   71 |         if (check(d)) state.emplace_back(d);
      |             ^~~~~
answer.code:71:23: error: ‘state’ was not declared in this scope; did you mean ‘_xstate’?
   71 |         if (check(d)) state.emplace_back(d);
      |                       ^~~~~
      |                       _xstate