Submission #398089

#	Time	Username	Problem	Language	Result	Execution time	Memory
398089		ACmachine	Holiday (IOI14_holiday)	C++17	47 / 100	764 ms	1172 KiB

holiday

#include"holiday.h"
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using ordered_map = tree<T, U, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

typedef long long ll;
typedef long double ld;

typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vi;
typedef vector<ll> vll;

#define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
#define FORD(i,j,k,in) for(int i=(j); i >=(k);i-=in)
#define REP(i,b) FOR(i,0,b,1)
#define REPD(i,b) FORD(i,b,0,1)
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(x) begin(x), end(x)
#define MANY_TESTS int tcase; cin >> tcase; while(tcase--)

const double EPS = 1e-9;
const int MOD = 1e9+7;
const ll INFF = 1e18;
const int INF = 1e9;
const ld PI = acos((ld)-1);
const vi dy = {1, 0, -1, 0, -1, 1, 1, -1};
const vi dx = {0, 1, 0, -1, -1, 1, -1, 1};

void DBG(){cout << "]" << endl;}
template<typename T, typename ...U> void DBG(const T& head, const U... args){ cout << head << "; "; DBG(args...); }
#define dbg(...) cout << "Line(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__);
#define chk() cout << "Check at line(" << __LINE__ << ") hit." << endl;

template<class T, unsigned int U>
ostream& operator<<(ostream& out, const array<T, U> &v){out << "[";  REP(i, U) out << v[i] << ", ";  out << "]"; return out;}
template <class T, class U>
ostream& operator<<(ostream& out, const pair<T, U> &par) {out << "[" << par.first << ";" << par.second << "]"; return out;}
template <class T>
ostream& operator<<(ostream& out, const set<T> &cont) { out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template <class T, class U>
ostream& operator<<(ostream& out, const map<T, U> &cont) {out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template<class T>
ostream& operator<<(ostream& out, const vector<T> &v){ out << "[";  REP(i, v.size()) out << v[i] << ", ";  out << "]"; return out;}

template<class T>
istream& operator>>(istream& in, vector<T> &v){ for(auto &x : v) in >> x; return in; }


long long int findMaxAttraction(int n, int start, int d, int attraction[]) {
    auto solve_subtask_1 = [&](){
        vector<int> a(n);
        REP(i, n) a[i] = attraction[i];
        auto solve = [](int n, int start, int d, vector<int> a){
            ll ans = 0;
            FOR(left_start, 0, start + 1, 1){
                multiset<int> curr; ll sum = 0;
                int days = d;
                auto ins = [&](int x){
                    sum += x;
                    curr.insert(x);
                };
                auto ers = [&](int x){
                    sum -= x;
                    curr.erase(curr.find(x));
                };
                FOR(i, left_start, n, 1){
                    ins(a[i]);
                    if(i > left_start){
                        if(i <= start)
                            days -= 2;
                        else
                            days -= 1;
                    }
                    if(days <= 0) break;
                    while(curr.size() > days){
                        ers(*curr.begin());
                    }
                    ans = max(ans, sum);
                }
            }
            return ans;
        };
        ll ans = 0;
        ans = max(ans, solve(n, start, d, a));
        reverse(all(a)); start = n - 1 - start;
        ans = max(ans, solve(n, start, d, a));
        return ans;
    };
    auto solve_subtask_2 = [&](){
        int ans = 0;
        vector<int> cnt(105, 0);
        REP(i, n){
            cnt[attraction[i]]++;
            int curr = d - i;
            if(curr < 0) break;
            int res = 0;
            REPD(j, 100){
                if(cnt[j] <= curr){
                    res += cnt[j] * j; curr -= cnt[j];
                }
                else{
                    res += j * curr;
                    break;
                }
            }
            ans = max(ans, res);
        }
        return ans;
    };
    if(n <= 3000) return solve_subtask_1();
    else return solve_subtask_2();
    return 0;
}

Compilation message (stderr)

holiday.cpp: In lambda function:
holiday.cpp:85:39: warning: comparison of integer expressions of different signedness: 'std::multiset<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   85 |                     while(curr.size() > days){
      |                           ~~~~~~~~~~~~^~~~~~

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