#243921 (C++17) No.5002 stick xor

提出ソース

結果

問題	No.5002 stick xor
ユーザー	mai
提出日時	2018-03-13 23:13:01
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	5,751 bytes
コンパイル時間	4,818 ms
実行使用メモリ	1,484 KB
スコア	0
最終ジャッジ日時	2018-04-30 15:03:03
ジャッジサーバーID （参考情報）	judge6 /

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	WA	-
testcase_01	WA	-
testcase_02	WA	-
testcase_03	WA	-
testcase_04	WA	-
testcase_05	WA	-
testcase_06	WA	-
testcase_07	WA	-
testcase_08	WA	-
testcase_09	WA	-
testcase_10	WA	-
testcase_11	WA	-
testcase_12	WA	-
testcase_13	WA	-
testcase_14	WA	-
testcase_15	WA	-
testcase_16	WA	-
testcase_17	WA	-
testcase_18	WA	-
testcase_19	WA	-
testcase_20	WA	-
testcase_21	WA	-
testcase_22	WA	-
testcase_23	WA	-
testcase_24	WA	-
testcase_25	WA	-
testcase_26	WA	-
testcase_27	WA	-
testcase_28	WA	-
testcase_29	WA	-
testcase_30	WA	-
testcase_31	WA	-

権限があれば一括ダウンロードができます

コンパイルメッセージ

main.cpp: 関数 ‘int main()’ 内:
main.cpp:138:90: 警告: narrowing conversion of ‘y’ from ‘long long int’ to ‘int’ inside { } [-Wnarrowing]
                     maxset(best_r, array<int, 4>{rowsum[y][x + l] - rowsum[y][x], y, x, 0});
                                                                                          ^
main.cpp:138:90: 警告: narrowing conversion of ‘x’ from ‘long long int’ to ‘int’ inside { } [-Wnarrowing]
main.cpp:141:90: 警告: narrowing conversion of ‘y’ from ‘long long int’ to ‘int’ inside { } [-Wnarrowing]
                     maxset(best_r, array<int, 4>{colsum[x + l][y] - colsum[x][y], y, x, 1});
                                                                                          ^
main.cpp:141:90: 警告: narrowing conversion of ‘x’ from ‘long long int’ to ‘int’ inside { } [-Wnarrowing]

ソースコード

raw source code

#pragma GCC optimize ("O3")
#pragma GCC target ("avx")
#include "bits/stdc++.h" // define macro "/D__MAI"

using namespace std;
typedef long long int ll;

#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(auto cnt=0ll;(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))
#define MD 1000000007ll
#define PI 3.1415926535897932384626433832795
template<typename T1, typename T2> ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << "(" << p.first << ":" << p.second << ")"; return o; }
template<typename T> T& maxset(T& to, const T& val) { return to = max(to, val); }
template<typename T> 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);
inline ll rand_range(ll l, ll h) {
    return uniform_int_distribution<ll>(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 = '\n') { for (auto it = begin; it != end; ++it) *this << *it << sep; }
    };
}
MaiScanner scanner;
MaiPrinter printer;






int m, n, kei;

int len[222];
int aa[55][55];
int colsum[55][55], rowsum[55][55];

int main() {
    scanner >> n >> kei;

    scanner.in(len, len + kei);

    repeat(y, n) {
        string str;
        scanner >> str;
        repeat(x, n) {
            aa[y][x] = str[x] == '1';
        }
    }


    repeat(i, kei) {

        // 累積和
        repeat(y, n) {
            repeat(x, n) {
                rowsum[y][x + 1] = rowsum[y][x] + aa[y][x];
            }
        }
        repeat(x, n) {
            repeat(y, n) {
                colsum[x][y + 1] = colsum[x][y] + aa[y][x];
            }
        }

        // 貪欲

        int l = len[i];
        array<int, 4> best_r = {0,0,0,0};
        repeat(y, n) {
            repeat(x, n) {
                if (x + l <= n) {
                    maxset(best_r, array<int, 4>{rowsum[y][x + l] - rowsum[y][x], y, x, 0});
                }
                if (y + l <= n) {
                    maxset(best_r, array<int, 4>{colsum[x + l][y] - colsum[x][y], y, x, 1});
                }
            }
        }
        if (best_r[3] == 0) {
            printer
                << best_r[1] + 1 << ' ' << best_r[2] + 1 << ' '
                << best_r[1] + 1 << ' ' << best_r[2] + l << '\n';
            repeat(t, l)
                aa[best_r[1]][best_r[2] + t] ^= 1;
        }else if (best_r[3] == 1) {
            printer
                << best_r[1] + 1 << ' ' << best_r[2] + 1 << ' '
                << best_r[1] + l << ' ' << best_r[2] + 1 << '\n';
            repeat(t, l)
                aa[best_r[1] + t][best_r[2]] ^= 1;
        }
    }
    
    // debugaa(aa, n, n);


    return 0;
}

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード