제출 #285560

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
285560		2qbingxuan	휴가 (IOI14_holiday)	C++14	0 / 100	30 ms	1536 KiB

holiday

#include"holiday.h"
#include <bits/stdc++.h>
#ifdef local
#define debug(...) qqbx(#__VA_ARGS__, __VA_ARGS__)
void qqbx(const char *s) {}
template <typename H, typename ...T> void qqbx(const char *s, const H& h, T&& ...args) {
    for(; *s && *s != ','; ++s) if(*s != ' ') std::cerr << *s;
    std::cerr << " = " << h << (sizeof...(T) ? ", " : "\n");
    if(sizeof...(T)) qqbx(++s, args...);
}
#define safe std::cerr<<__PRETTY_FUNCTION__<<" line "<<__LINE__<<" safe\n"
#else
#define debug(...) ((void)0)
#define safe ((void)0)
#endif // local
#define pb emplace_back
#define all(v) begin(v),end(v)
using namespace std;

long long int findMaxAttraction(int n, int start, int d, int attraction[]) {
    if(start == 0 && *max_element(attraction,attraction+n) <= 100) {
        int cnt[101] = {};
        int mx = 0;
        for(int i = 0; i < n; i++) {
            ++cnt[attraction[i]];
            if(d - i > 0) {
                int k = d - i;
                int ans = 0;
                for(int j = 100; j >= 1; j--) {
                    if(k > cnt[j]) k -= cnt[j], ans += cnt[j] * j;
                    else ans += cnt[j] * k, k = 0;
                }
                mx = max(mx, ans);
            }
        }
        return mx;
    }
    return 0;
}

• Subtask 1: 0 / 7
• Subtask 2: 0 / 23
• Subtask 3: 0 / 17
• Subtask 4: 0 / 53