Submission #2743518


Source Code Expand

Copy
#pragma GCC optimize ("O3")
#include "bits/stdc++.h"

using namespace std;
using ll = long long int;

#define debug(v) {printf("L%d %s > ",__LINE__,#v);cout<<(v)<<endl;}
#define debugv(v) {printf("L%d %s > ",__LINE__,#v);for(auto e:(v)){cout<<e<<" ";}cout<<endl;}
#define debuga(m,w) {printf("L%d %s > ",__LINE__,#m);for(int x=0;x<(w);x++){cout<<(m)[x]<<" ";}cout<<endl;}
#define debugaa(m,h,w) {printf("L%d %s >\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[y][x]<<" ";}cout<<endl;}}
#define ALL(v) (v).begin(),(v).end()
#define repeat(cnt,l) for(remove_const<decltype(l)>::type cnt=0;(cnt)<(l);++(cnt))
#define rrepeat(cnt,l) for(auto cnt=(l)-1;0<=(cnt);--(cnt))
#define iterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);++(cnt))
#define diterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);--(cnt))
const ll MD = 1000000007ll; const long double PI = 3.1415926535897932384626433832795L;
inline void assert_call(bool assertion, function<void()> f) { if (!assertion) { cerr << "assertion fault:" << endl; f(); abort(); } }
template<typename T1, typename T2> inline ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << '(' << p.first << ':' << p.second << ')'; return o; }
template<typename Vec> inline ostream& _ostream_vecprint(ostream &o, const Vec& p) { o << '['; for (auto& e : p) o << e << ','; o << ']'; return o; }
template<typename T> inline ostream& operator<<(ostream& o, const vector<T>& v) { return _ostream_vecprint(o, v); }
template<typename T, size_t S> inline ostream& operator<<(ostream& o, const array<T, S>& v) { return _ostream_vecprint(o, v); }
template<typename T> inline T& maxset(T& to, const T& val) { return to = max(to, val); }
template<typename T> inline T& minset(T& to, const T& val) { return to = min(to, val); }
void bye(string s, int code = 0) { cout << s << endl; exit(code); }
mt19937_64 randdev(8901016);
template<typename T> inline T rand(T l, T h) { return uniform_int_distribution<T>(l, h)(randdev); }
template<> inline double rand<double>(double l, double h) { return uniform_real_distribution<double>(l, h)(randdev); }
template<> inline float rand<float>(float l, float h) { return uniform_real_distribution<float>(l, h)(randdev); }

#if defined(_WIN32) || defined(_WIN64)
#define getchar_unlocked _getchar_nolock
#define putchar_unlocked _putchar_nolock
#elif defined(__GNUC__)
#else
#define getchar_unlocked getchar
#define putchar_unlocked putchar
#endif
namespace {
#define isvisiblechar(c) (0x21<=(c)&&(c)<=0x7E)
    class MaiScanner {
    public:
        template<typename T> void input_integer(T& var) {
            var = 0; T sign = 1;
            int cc = getchar_unlocked();
            for (; cc<'0' || '9'<cc; cc = getchar_unlocked())
                if (cc == '-') sign = -1;
            for (; '0' <= cc && cc <= '9'; cc = getchar_unlocked())
                var = (var << 3) + (var << 1) + cc - '0';
            var = var * sign;
        }
        inline int c() { return getchar_unlocked(); }
        inline MaiScanner& operator>>(int& var) { input_integer<int>(var); return *this; }
        inline MaiScanner& operator>>(long long& var) { input_integer<long long>(var); return *this; }
        inline MaiScanner& operator>>(string& var) {
            int cc = getchar_unlocked();
            for (; !isvisiblechar(cc); cc = getchar_unlocked());
            for (; isvisiblechar(cc); cc = getchar_unlocked())
                var.push_back(cc);
            return *this;
        }
        template<typename IT> void in(IT begin, IT end) { for (auto it = begin; it != end; ++it) *this >> *it; }
    };
    class MaiPrinter {
    public:
        template<typename T>
        void output_integer(T var) {
            if (var == 0) { putchar_unlocked('0'); return; }
            if (var < 0)
                putchar_unlocked('-'),
                var = -var;
            char stack[32]; int stack_p = 0;
            while (var)
                stack[stack_p++] = '0' + (var % 10),
                var /= 10;
            while (stack_p)
                putchar_unlocked(stack[--stack_p]);
        }
        inline MaiPrinter& operator<<(char c) { putchar_unlocked(c); return *this; }
        inline MaiPrinter& operator<<(int var) { output_integer<int>(var); return *this; }
        inline MaiPrinter& operator<<(long long var) { output_integer<long long>(var); return *this; }
        inline MaiPrinter& operator<<(char* str_p) { while (*str_p) putchar_unlocked(*(str_p++)); return *this; }
        inline MaiPrinter& operator<<(const string& str) {
            const char* p = str.c_str();
            const char* l = p + str.size();
            while (p < l) putchar_unlocked(*p++);
            return *this;
        }
        template<typename IT> void join(IT begin, IT end, char sep = ' ') { for (bool b = 0; begin != end; ++begin, b = 1) b ? *this << sep << *begin : *this << *begin; }
    };
}
MaiScanner scanner;
MaiPrinter printer;


struct P {
    using T = int;
    T y, x;

    P(T _y = 0, T _x = 0) :y(_y), x(_x) {}

    inline bool operator == (P p) const { return y == p.y && x == p.x; }
    inline bool operator < (P p) const { return y == p.y ? x < p.x : y < p.y; }
    inline P operator+(P p) const { return P(y + p.y, x + p.x); }
    inline P operator-(P p) const { return P(y - p.y, x - p.x); }
    inline P operator+=(P p) { y += p.y; x += p.x; return *this; }
    inline P operator-=(P p) { y -= p.y; x -= p.x; return *this; }
};



template<typename T>
// using T = int;
struct F {
    int height, width;
    vector<T> data;

    F(int h = 1, int w = 1) :height(h), width(w), data(h*w) {}

    inline T& operator()(int y, int x) { return data[x + y * width]; }
    inline T& operator()(P p) { return data[p.x + p.y * width]; }
    inline T operator()(int y, int x) const { return data[x + y * width]; }
    inline T operator()(P p) const { return data[p.x + p.y * width]; }

    inline bool safe(int y, int x) const { return 0 <= y && y < height && 0 <= x && x < width; }
    inline bool safe(P p) const { return 0 <= p.y && p.y < height && 0 <= p.x && p.x < width; }

    inline void fill(T e) { std::fill(ALL(data), e); }
    inline void resize(int h, int w) { height = h; width = w; data.resize(h*w); }

    void print(ostream& os, int setw_arg = 4) {
        for (int y = 0; y < height; ++y) {
            for (int x = 0; x < width; ++x)
                os << setw(setw_arg) << operator()(y, x) << ' ';
            os << '\n';
        }
    }
};







namespace Core {

    const int N = 30;
    F<int> fieldInit(32, 32);

    // - - - - - - - - - - - - -

    void input() {
        iterate(i, 1, N + 1) {
            iterate(j, 1, N + 1) {
                scanner >> fieldInit(i, j);
            }
        }
    }

    inline void echo(int y, int x) {
        printer << y << ' ' << x << '\n';
    }

    // - - - - - - - - - - - - -

    void solve() {

        F<int> field = fieldInit;

        bool running = true;

        while (running) {
            running = false;

            iterate(i, 1, N + 1) {
                if (i & 1) {
                    iterate(j, 1, N + 1) {
                        if (field(i, j) > 0)
                            --field(i, j),
                            echo(i, j),
                            running = true;
                    }
                }
                else {
                    diterate(j, N, 0) {
                        if (field(i, j) > 0)
                            --field(i, j),
                            echo(i, j),
                            running = true;
                    }
                }
            }
        }

    }

}



int main() {
    using namespace Core;
    input(); solve();

    return 0;
}

Submission Info

Submission Time
Task A - 高橋君の山崩しゲーム
User m_buyoh
Language C++14 (GCC 5.4.1)
Score 544794
Code Size 7894 Byte
Status
Exec Time 2 ms
Memory 512 KB

Test Cases

Set Name Score / Max Score Test Cases
test_01 56170 / 100000 subtask_01_01.txt
test_02 53509 / 100000 subtask_01_02.txt
test_03 54961 / 100000 subtask_01_03.txt
test_04 52238 / 100000 subtask_01_04.txt
test_05 54921 / 100000 subtask_01_05.txt
test_06 54925 / 100000 subtask_01_06.txt
test_07 54336 / 100000 subtask_01_07.txt
test_08 55669 / 100000 subtask_01_08.txt
test_09 54248 / 100000 subtask_01_09.txt
test_10 53817 / 100000 subtask_01_10.txt
Case Name Status Exec Time Memory
subtask_01_01.txt 2 ms 512 KB
subtask_01_02.txt 2 ms 512 KB
subtask_01_03.txt 2 ms 512 KB
subtask_01_04.txt 2 ms 512 KB
subtask_01_05.txt 2 ms 512 KB
subtask_01_06.txt 2 ms 512 KB
subtask_01_07.txt 2 ms 512 KB
subtask_01_08.txt 2 ms 512 KB
subtask_01_09.txt 2 ms 512 KB
subtask_01_10.txt 2 ms 512 KB