#949385 (C++17) No.2623 Room Allocation

提出ソース

結果

問題	No.2623 Room Allocation
ユーザー	ningenMe
提出日時	2024-02-09 22:23:41
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	52 ms / 2,000 ms
コード長	5,385 bytes
コンパイル時間	2,199 ms
コンパイル使用メモリ	215,548 KB
実行使用メモリ	11,144 KB
最終ジャッジ日時	2024-09-28 15:37:49
合計ジャッジ時間	3,882 ms
ジャッジサーバーID （参考情報）	judge3 / judge1

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,816 KB
testcase_01	AC	1 ms 6,816 KB
testcase_02	AC	2 ms 6,820 KB
testcase_03	AC	2 ms 6,816 KB
testcase_04	AC	2 ms 6,816 KB
testcase_05	AC	1 ms 6,816 KB
testcase_06	AC	15 ms 6,820 KB
testcase_07	AC	14 ms 6,820 KB
testcase_08	AC	14 ms 6,816 KB
testcase_09	AC	13 ms 6,816 KB
testcase_10	AC	15 ms 11,064 KB
testcase_11	AC	16 ms 11,036 KB
testcase_12	AC	9 ms 7,296 KB
testcase_13	AC	9 ms 7,168 KB
testcase_14	AC	34 ms 11,144 KB
testcase_15	AC	16 ms 6,816 KB
testcase_16	AC	5 ms 6,820 KB
testcase_17	AC	1 ms 6,816 KB
testcase_18	AC	16 ms 6,816 KB
testcase_19	AC	16 ms 6,820 KB
testcase_20	AC	16 ms 6,820 KB
testcase_21	AC	17 ms 6,820 KB
testcase_22	AC	12 ms 6,816 KB
testcase_23	AC	8 ms 6,820 KB
testcase_24	AC	16 ms 6,816 KB
testcase_25	AC	15 ms 6,820 KB
testcase_26	AC	3 ms 6,820 KB
testcase_27	AC	52 ms 9,216 KB
testcase_28	AC	21 ms 7,424 KB
testcase_29	AC	14 ms 7,168 KB
testcase_30	AC	48 ms 8,192 KB
testcase_31	AC	6 ms 6,816 KB
testcase_32	AC	13 ms 8,576 KB

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

ソースコード

raw source code

#include <bits/stdc++.h>
using namespace std;
using int128 = __int128_t;
using int64 = long long;

#define ALL(obj) (obj).begin(),(obj).end()

/*
 * @title FastIO
 * @docs md/util/FastIO.md
 */
class FastIO{
private:
    inline static constexpr int ch_0='0';
    inline static constexpr int ch_9='9';
    inline static constexpr int ch_n='-';
    inline static constexpr int ch_s=' ';
    inline static constexpr int ch_l='\n';
    inline static void endline_skip(char& ch) {
        while(ch==ch_l) ch=getchar();
    }
    template<typename T> inline static void read_integer(T &x) {
        int neg=0; char ch; x=0;
        ch=getchar();
        endline_skip(ch);
        if(ch==ch_n) neg=1,ch=getchar();
        for(;(ch_0 <= ch && ch <= ch_9); ch = getchar()) x = x*10 + (ch-ch_0);
        if(neg) x*=-1;
    }
    template<typename T> inline static void read_unsigned_integer(T &x) {
        char ch; x=0;
        ch=getchar();
        endline_skip(ch);
        for(;(ch_0 <= ch && ch <= ch_9); ch = getchar()) x = x*10 + (ch-ch_0);
    }
    inline static void read_string(string &x) {
        char ch; x="";
        ch=getchar();
        endline_skip(ch);
        for(;(ch != ch_s && ch!=ch_l); ch = getchar()) x.push_back(ch);
    }
    inline static char ar[40];
    inline static char *ch_ar;
    template<typename T> inline static void write_integer(T x) {
        ch_ar=ar;
        if(x< 0) putchar(ch_n), x=-x;
        if(x==0) putchar(ch_0);
        for(;x;x/=10) *ch_ar++=(ch_0+x%10);
        while(ch_ar--!=ar) putchar(*ch_ar);
    }
public:
    inline static void read(int &x) {read_integer<int>(x);}
    inline static void read(long long &x) {read_integer<long long>(x);}
    inline static void read(unsigned int &x) {read_unsigned_integer<unsigned int>(x);}
    inline static void read(unsigned long long &x) {read_unsigned_integer<unsigned long long>(x);}
    inline static void read(string &x) {read_string(x);}
    inline static void read(__int128_t &x) {read_integer<__int128_t>(x);}
    inline static void write(__int128_t x) {write_integer<__int128_t>(x);}
    inline static void write(char x) {putchar(x);}
};
#define read(arg) FastIO::read(arg)
#define write(arg) FastIO::write(arg)

template<class T> using priority_queue_reverse = priority_queue<T,vector<T>,greater<T>>;

constexpr int64 HIGHINF = 1'000'000'000'000'000'000LL;
constexpr int64 LOWINF = 1'000'000'000'000'000LL; //'
constexpr long double PI = 3.1415926535897932384626433L;

template <class T> vector<T> multivector(size_t N,T init){return vector<T>(N,init);}
template <class... T> auto multivector(size_t N,T... t){return vector<decltype(multivector(t...))>(N,multivector(t...));}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const deque<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max(a,b);}
template <class T> void chmin(T& a, const T b){a=min(a,b);}
vector<string> split(const string &str, const char delemiter) {vector<string> res;stringstream ss(str);string buffer; while( getline(ss, buffer, delemiter) ) res.push_back(buffer); return res;}
inline constexpr int msb(int x) {return x?31-__builtin_clz(x):-1;}
inline constexpr int64 ceil_div(const int64 a,const int64 b) {return (a+(b-1))/b;}// return ceil(a/b)
void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;}

/**
 * @url 
 * @est
 */ 
int main() {
    cin.tie(0);ios::sync_with_stdio(false);
    //
    int64 N,X,Y; read(N),read(X),read(Y);
    int64 Z = X+Y;
    vector<int64> A(Z,0), B(Z,0);
    for(int i=0;i<N;++i) {
        int p; read(p);
        string c; read(c);
        if(c=="A") A[i%Z] += p;
        else B[i%Z] += p;
    }
    vector<int> idx(Z);
    iota(ALL(idx), 0);
    sort(ALL(idx), [&](int l, int r){return A[l]-B[l] > A[r]-B[r];});
    int64 sum = 0;
    for(int i=0; i<Z;++i) {
        int j = idx[i];
        if(i < X) sum += A[j];
        else sum += B[j];
    }
    cout << sum << endl;
    

    return 0;
}

yukicoder

結果

テストケース

ソースコード