Submission #1148872

#	Time	Username	Problem	Language	Result	Execution time	Memory
1148872		ozner77	휴가 (IOI14_holiday)	C++20	0 / 100	5093 ms	5704 KiB

holiday

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
typedef pair<ll,ll> pll;
typedef pair<int,int> pii;
typedef map<int,int> mii;
typedef map<ll,ll> mll;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<vpii> vvpii;
typedef vector<vpll> vvpll;
typedef vector<vvi> vvvi;
typedef vector<vvl> vvvl;
set<ll> s;
vector<ll> res;
int findMaxAttraction(int n, int start, int d,int attraction[]){
    if(start==0){
        res.assign(n+1,0);
        multiset<ll> S;
        unordered_map<ll,ll> M;
        ll a,b;
        if(d<n){
            a=1;
            for(ll i=0;i<d;i++){
                S.insert(attraction[i]);
                M[attraction[i]]++;
            }
            res[a]=*prev(S.end());
        }else{
            if(n*2-1<=d){
                ll ans=0;
                for(ll i=0;i<n;i++){
                    ans+=attraction[i];
                }
                return ans;
            }else{
                a=d-n+1;
                for(int i=0;i<n;i++){
                    S.insert(attraction[i]);
                    M[attraction[i]]++;
                }
                auto it=prev(S.end());
                ll suma=0;
                for(ll i=0;i<a;i++){
                    suma+=*it;
                    it=prev(it);
                }
                res[a]=suma;
            }
        }
        while(d-a>=a+1){
            a++;
            b=d-a;
            auto ite = S.find(3);
            if (ite != S.end()){
            S.erase(ite);
            }
            auto it=prev(S.end());
            ll suma=0;
            for(ll i=0;i<a;i++){
                suma+=*it;
                it=prev(it);
            }
            res[a]=suma;
        }
        ll respuesta=0;
        for(auto x:res){
            if(x>respuesta){
                respuesta=x;
            }
        }
        return respuesta;
    }else{
        return 1;
    }
}

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