제출 #581400

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
581400		MohamedFaresNebili	카니발 티켓 (IOI20_tickets)	C++14	11 / 100	2 ms	724 KiB

tickets

#include <bits/stdc++.h>
#include "tickets.h"
#include <ext/pb_ds/assoc_container.hpp>

        using namespace std;
        using namespace __gnu_pbds;

        using ll = long long;
        using pi = pair<ll, pair<ll, ll>>;
        using ii = pair<int, int>;

        #define pb push_back
        #define pp pop_back
        #define ff first
        #define ss second

        typedef tree<int, null_type, less<int>, rb_tree_tag,
            tree_order_statistics_node_update> indexed_set;

        ll find_maximum(int K, vector<vector<int>> A) {
            int N = A.size(), M = A[0].size(); 
            vector<vector<int>> S(N, vector<int> (M, -1));

            vector<pi> curr; vector<ll> arr;
            for(int l = 0; l < N; l++)
                for(int i = 0; i < M; i++)
                    curr.pb({A[l][i], {l, i}});
            sort(curr.begin(), curr.end());

            bool vis[N]; memset(vis, 0, sizeof vis);
            ll lo = 0, hi = 0, i = 0, l = (int)curr.size() - 1;
            for(; i < N / 2 && l >= 0; l--) {
                if(vis[curr[l].ss.ff]) continue;
                i++; arr.pb(curr[l].ff); S[curr[l].ss.ff][curr[l].ss.ss] = 0;
                vis[curr[l].ss.ff] = 1; lo += curr[l].ff;
            }
            for(l = 0; l < (int)curr.size(); l++) {
                if(vis[curr[l].ss.ff]) continue;
                arr.pb(curr[l].ff); S[curr[l].ss.ff][curr[l].ss.ss] = 0;
                vis[curr[l].ss.ff] = 1; hi += curr[l].ff;
            }

            ll res = lo - hi;
            allocate_tickets(S);
            return res;
        }

• Subtask 1: 11 / 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