#221359 (C++17) No.606 カラフルタイル

• 問題: No.606 カラフルタイル
• ユーザー: mai
• 提出日時: 2017-12-06 00:43:29
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 11 ms / 2,000 ms
• コード長: 5,547 bytes
• コンパイル時間: 3,672 ms
• コンパイル使用メモリ: 223,128 KB
• 実行使用メモリ: 6,784 KB
• 最終ジャッジ日時: 2024-11-28 19:04:14
• 合計ジャッジ時間: 4,743 ms
• ジャッジサーバーID （参考情報）: judge1 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,248 KB
testcase_02	AC	3 ms; 5,248 KB
testcase_03	AC	2 ms; 5,248 KB
testcase_04	AC	2 ms; 5,248 KB
testcase_05	AC	2 ms; 5,248 KB
testcase_06	AC	2 ms; 5,248 KB
testcase_07	AC	2 ms; 5,248 KB
testcase_08	AC	2 ms; 5,248 KB
testcase_09	AC	2 ms; 5,248 KB
testcase_10	AC	2 ms; 5,248 KB
testcase_11	AC	2 ms; 5,248 KB
testcase_12	AC	2 ms; 5,248 KB
testcase_13	AC	3 ms; 5,248 KB
testcase_14	AC	3 ms; 5,248 KB
testcase_15	AC	2 ms; 5,248 KB
testcase_16	AC	5 ms; 5,248 KB
testcase_17	AC	10 ms; 5,888 KB
testcase_18	AC	6 ms; 5,248 KB
testcase_19	AC	6 ms; 5,248 KB
testcase_20	AC	11 ms; 6,784 KB
testcase_21	AC	8 ms; 6,016 KB
testcase_22	AC	8 ms; 6,016 KB
testcase_23	AC	9 ms; 6,016 KB
testcase_24	AC	10 ms; 6,528 KB
testcase_25	AC	9 ms; 6,784 KB
testcase_26	AC	10 ms; 6,784 KB
testcase_27	AC	10 ms; 6,784 KB

ソースコード

#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 xprintf(fmt,...) fprintf(stderr,fmt,__VA_ARGS__)
#define debugv(v) {printf("L%d %s > ",__LINE__,#v);for(auto e:v){cout<<e<<" ";}cout<<endl;}
#define debugm(m) {printf("L%d %s \n",__LINE__,#m);for(auto v:m){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,w,h) {printf("L%d %s >\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[x][y]<<" ";}cout<<endl;}}
#define debugaar(m,w,h) {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=0;cnt<(l);++cnt)
#define iterate(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; }

mt19937 mt(8901016);
inline int rand_int(int l, int h) {
    return uniform_int_distribution<>(l, h)(mt);
}

#ifdef __MAI
#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<(int var) {
            output_integer<int>(var);
            putchar_unlocked(' ');
            return *this;
        }
        inline MaiPrinter& operator<(long long var) {
            output_integer<long long>(var);
            putchar_unlocked(' ');
            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;
        }
        inline MaiPrinter& operator<<(char* str_p) {
            while (*str_p) putchar_unlocked(*(str_p++));
            return *this;
        }
    };
}
MaiScanner scanner;
MaiPrinter printer;





ll n, kei, qu;
vector<array<int, 3>> queries;

int main() {
    
    scanner >> n >> kei >> qu;
    queries.reserve(qu);

    repeat(i, qu) {
        string a;
        int b, c;
        scanner >> a >> b >> c;
        --b; --c;
        queries.push_back({ int(a[0]=='C'),b,c });
    }

    vector<ll> rows(n, n);
    ll rofs = 0;
    vector<ll> cols(n, n);
    ll cofs = 0;
    vector<ll> color(kei, 0);

    for (auto it = queries.rbegin(); it != queries.rend(); ++it) {
        auto query = *it;
        if (query[0] == 0) {
            // R
            if (rows[query[1]] + rofs > 0) {
                color[query[2]] += rows[query[1]] + rofs;
                rows[query[1]] = 0;
                cofs -= 1;
            }
        }
        else {
            // C
            if (cols[query[1]] + cofs > 0) {
                color[query[2]] += cols[query[1]] + cofs;
                cols[query[1]] = 0;
                rofs -= 1;
            }
        }
        //debugv(color)
    }
    for (ll r : rows) {
        if (r + rofs > 0)
            color[0] += r + rofs;
    }
    // for (ll c : cols) {
    //     if (c + cofs > 0)
    //         color[0] += c + cofs;
    // }

    for (ll c : color) {
        printer << c << '\n';
    }


    return 0;
}