제출 #1159050

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1159050		ackhava	Carnival Tickets (IOI20_tickets)	C++20	0 / 100	1 ms	328 KiB

tickets

#include "tickets.h"
#include <vector>
#include <bits/stdc++.h>
#define int long long
#define REP(v, i, j) for (long long v = i; v != j; v++)
#define FORI(v) for (auto i : v)
#define FORJ(v) for (auto j : v)

#define OUT(v, a) \
    FORI(v)       \
    cout << i << a;
#define OUTS(v, a, b)      \
    cout << v.size() << a; \
    OUT(v, b)
#define in(a, n) \
    REP(i, 0, n) \
    cin >> a[i];

#define SORT(v) sort(begin(v), end(v))
#define REV(v) reverse(begin(v), end(v))
#define MEMSET(m) memset(m, -1, sizeof m)

#define pb push_back
#define fi first
#define se second

#define detachIO                      \
    ios_base::sync_with_stdio(false); \
    cin.tie(0);                       \
    cout.tie(0);
    
using namespace std;

template<typename _Tp, typename _Alloc = std::allocator<_Tp> >
bool operator==(const vector<_Tp, _Alloc>& __x, const vector<_Tp, _Alloc>& __y) {
    if(__x.size() != __y.size()) return false;
    return std::equal(__x.begin(), __x.end(), __y.begin());
}


typedef pair<long long, long long> pii;
typedef pair<pii, long long> piii;
typedef pair<pii, pii> piiii;

const long long MOD = 1e9+7;

struct modint {
    long long val;

    modint() = default;
    modint(int _val): val(_val){}
    modint operator+(modint b){ return ((this->val + b.val)%MOD); }
    modint operator-(modint b){ return ((MOD + this->val - b.val)%MOD); }
    modint operator*(modint b){ return ((this->val * b.val)%MOD); }
    modint operator^(int a){
        if(a==0)return 1;
        if(a==1)return *this;
        return (((*this)*(*this))^(a>>1))*((*this)^(a&1)); 
    }
};

modint invert(modint a){
    return a^(MOD-2);
}

modint operator/(modint a, modint b){
    return a*invert(b);
}

struct segment_tree {
    long long n;
    typedef int T;
    vector<T> seg;
    const T e = 2e9;

    T merge(T a, T b){
        if(a==e)return b;
        if(b==e)return a;
        return min(a,b);
    }

    segment_tree(long long _n): n(_n),seg(4*_n+10,e) /** BUG: GCC does not initialize the elements properly this way */ {
        for(auto &i:seg)i=e;
    }

    void update(long long pos, long long l, long long r, long long idx, T val){
        if(r<idx)return;
        if(l>idx)return;
        if(l==r){
            seg[pos]=val;
            return;
        }
        update(pos*2+1,l,(l+r)/2,idx,val);
        update(pos*2+2,((l+r)/2)+1,r,idx,val);
        seg[pos]=merge(seg[pos*2+1],seg[pos*2+2]);
    }

    T query(long long pos, long long l, long long r, long long ql, long long qr){
        if(l > qr)return e;
        if(ql > r)return e;
        if(ql <= l && r <= qr)return seg[pos];
        if(l==r)return e;
        return merge(query(pos*2+1,l,(l+r)/2,ql,qr),query(pos*2+2,((l+r)/2)+1,r,ql,qr));
    }
};

vector<vector<signed>> backup;

long long find_maximum(signed k, std::vector<std::vector<signed>> x) {
	int n = x.size();
	int m = x[0].size();
	backup=x;
	vector<int> pick;
	pick.resize(n,0);

	REP(i,0,n)SORT(x[i]);
	vector<vector<int>> diff;
	set<pii> st;
	int ans=0;
	REP(i,0,n){
        diff.emplace_back();
		REP(j,0,k){
            ans+=x[i][m-k+j];
			diff[i].pb(-x[i][m-k+j]-x[i][j]);
		}
		st.insert({diff[i][0],i});
	}

	REP(i,0,(n*k)/2){
		auto top=*st.rbegin();
		st.erase(top);
		ans+=top.fi;
		pick[top.se]++;
        if(pick[top.se]<diff[top.se].size())st.insert({diff[top.se][pick[top.se]],top.se});
	}

    // -1: neg
    // 0: not chosen
    // 1: pos

    REP(i,0,n){
        vector<pii> vec;
        REP(j,0,m){
            vec.pb({backup[i][j],j});
            backup[i][j]=0;
        }
        SORT(vec);
        REP(j,0,pick[i])backup[i][vec[j].se]=-1;
        REP(j,0,k-pick[i])backup[i][vec[m-j-1].se]=1;
    }
    
    vector<int> neg;
    vector<int> pos;
    neg.resize(k,0);
    pos.resize(k,0);
    return -1;
    REP(i,0,n){
        vector<int> v1,v2,v3;
        // v1 -> neg
        // v2 -> pos
        REP(j,0,k){
            if(neg[j]<(n/2) && pos[j]>=(n/2))v1.pb(j);
            else if(pos[j]<(n/2) && neg[j]>=(n/2))v2.pb(j);
            else v3.pb(j);
        }
        while(v1.size()<pick[i]&&v3.size())v1.pb(v3.back()),v3.pop_back();
        while(v3.size())v2.pb(v3.back()),v3.pop_back();
        // if(v1.size()<pick[i])return -1;
        REP(j,0,m){
            if(backup[i][j]==0)backup[i][j]=-1;
            else if(backup[i][j]==-1)backup[i][j]=v1.back(),v1.pop_back(),neg[backup[i][j]]++;
            else backup[i][j]=v2.back(),v2.pop_back(),pos[backup[i][j]]++;
        }
    }
    
    
    allocate_tickets(backup);
	return ans;
}
#undef int

• Subtask 1: 0 / 11
• Subtask 2: 0 / 16
• Subtask 3: 0 / 14
• Subtask 4: 0 / 14
• Subtask 5: 0 / 12
• Subtask 6: 0 / 23
• Subtask 7: 0 / 10