Submission #581237

#	Time	Username	Problem	Language	Result	Execution time	Memory
581237		MohamedFaresNebili	카니발 티켓 (IOI20_tickets)	C++14	11 / 100	30 ms	624 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();
            deque<pi> curr; ll res = 0;
            for(int l = 0; l < N; l++)
                curr.pb({A[l][0], {l, 0}}),
                curr.pb({A[l][M - 1], {l, M - 1}});
            sort(curr.begin(), curr.end());
            bool vis[N]; memset(vis, 0, sizeof vis);
            vector<vector<int>> S(N, vector<int> (M, -1));
            vector<ll> arr;
            while(arr.size() != N) {
                while(vis[curr.front().ss.ff])
                    curr.pop_front();
                while(vis[curr.back().ss.ff])
                    curr.pop_back();
 
                ll U = curr.front().ff;
                ll V = curr.back().ff;
 
                if(arr.empty()) {
                    arr.pb(curr.front().ff);
                    vis[curr.front().ss.ff] = 1;
                    S[curr.front().ss.ff][curr.front().ss.ss] = 0;
                    curr.pop_front();
                    continue;
                }
                sort(arr.begin(), arr.end());
                ll md = (arr[0] + arr[arr.size() - 1]) / 2;
 
                if(abs(U - md) >= abs(V - md)) {
                    arr.pb(curr.front().ff);
                    vis[curr.front().ss.ff] = 1;
                    S[curr.front().ss.ff][curr.front().ss.ss] = 0;
                    curr.pop_front();
                }
                else {
                    arr.pb(curr.back().ff);
                    vis[curr.back().ss.ff] = 1;
                    S[curr.back().ss.ff][curr.back().ss.ss] = 0;
                    curr.pop_back();
                }
            }
            sort(arr.begin(), arr.end());
            for(auto U : arr)
                res += abs(U - arr[N / 2]);
            allocate_tickets(S);
            return res;
        }

Compilation message (stderr)

tickets.cpp: In function 'll find_maximum(int, std::vector<std::vector<int> >)':
tickets.cpp:30:30: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   30 |             while(arr.size() != N) {
      |                   ~~~~~~~~~~~^~~~

• 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