Submission #286977

#	Time	Username	Problem	Language	Result	Execution time	Memory
286977		HynDuf	Treasure (different grader from official contest) (CEOI13_treasure2)	C++14	100 / 100	1 ms	384 KiB

treasure

#include <bits/stdc++.h>
#include "treasure.h"
#define task ""
#define all(v) (v).begin(), (v).end()
#define rep(i, l, r) for (int i = (l); i <= (r); ++i)
#define Rep(i, r, l) for (int i = (r); i >= (l); --i)
#define DB(X) { cerr << #X << " = " << (X) << '\n'; }
#define DB1(A, _) { cerr << #A << "[" << _ << "] = " << (A[_]) << '\n'; }
#define DB2(A, _, __) { cerr << #A << "[" << _ << "][" << __ << "] = " << (A[_][__]) << '\n'; }
#define DB3(A, _, __, ___) { cerr << #A << "[" << _ << "][" << __ << "][" << ___ << "] = " << (A[_][__][___]) << '\n'; }
#define PR(A, l, r) { cerr << '\n'; rep(_, l, r) DB1(A, _); cerr << '\n';}
#define SZ(x) ((int)(x).size())
#define pb push_back
#define eb emplace_back
#define pf push_front
#define F first
#define S second
#define by(x) [](const auto& a, const auto& b) { return a.x < b.x; } // sort(arr, arr + N, by(a));
#define next ___next
#define prev ___prev
#define y1 ___y1
#define left ___left
#define right ___right
#define y0 ___y0
#define div ___div
#define j0 ___j0
#define jn ___jn

using ll = long long;
using ld = long double;
using ull = unsigned long long;
using namespace std;
typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<ll> vl;
const int N = 102;
int pre[N][N];
void findTreasure(int n)
{
    int mid = n / 2;
    Rep(i, n, 1) Rep(j, n, 1)
    {
        if (i <= mid && j <= mid) pre[i][j] = pre[n][j] + pre[i][n] - pre[n][n] + countTreasure(i + 1, j + 1, n, n);
        if (i <= mid && j > mid) pre[i][j] = pre[n][j] - countTreasure(i + 1, 1, n, j);
        if (i > mid && j <= mid) pre[i][j] = pre[i][n] - countTreasure(1, j + 1, i, n);
        if (i > mid && j > mid) pre[i][j] = countTreasure(1, 1, i, j);
    }
    rep(i, 1, n) rep(j, 1, n) if (pre[i][j] == 1 + pre[i - 1][j] + pre[i][j - 1] - pre[i - 1][j - 1]) Report(i, j);
}

• Subtask 1: 100 / 100