제출 #303682

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

tickets

#include <bits/stdc++.h>
#include "tickets.h"
using namespace std;
long long int fin(vector<vector<int> > a,int n,int m){
    for(int i=0;i<n;i++){
        sort(a[i].begin(),a[i].end());
    }
     long long int ans=0;
    for(int i=0;i<n;i++){
        long long int ff=a[i][(m)/2];
        for(int j=0;j<m;j++){
            ans+=(long long int)(abs(ff-a[i][j]));
        }
    }
    return ans;
}
long long int find_maximum(int k, vector<vector<int> > x){
    int n=x.size();
    int m=x[0].size();
    if(m==1){
        vector<vector<int> > ans(n);
        vector<vector<int> > answ(k);
        for(int i=0;i<n;i++){
            ans[i].push_back(0);
            answ[0].push_back(x[i][0]);
        }
            allocate_tickets(ans);
            return fin(answ,k,n);
    }
    if(k==1){
        vector<vector<int> > a(k);
        vector<vector<int> > b(n);
        for(int i=0;i<n;i++)
            for(int j=0;j<m;j++)
                b[i][j]=-1;
        int mi[n];
        int ma[n];
        for(int i=0;i<n;i++){
            mi[i]=0;
            ma[i]=m-1;
        }
        vector<pair<int,int> > mini;
        vector<pair<int,int> > maxi;
        for(int i=0;i<n;i++){
            pair<int,int > v;
            v.first=a[i][mi[i]];
            v.second=i;
            mini.push_back(v);
            v.first=a[i][ma[i]];
            v.second=i;
            maxi.push_back(v);
        }
        sort(mini.begin(),mini.end());
        sort(maxi.begin(),maxi.end());
        for(int i=0;i<n/2;i++){
            a[0].push_back(mini[i].first);
            a[0].push_back(maxi[n-i-1].first);
            b[mini[i].second][0]=0;
            b[maxi[i].second][m-1]=0;
        }
        allocate_tickets(b);
        return fin(a,k,n);
    }
}

컴파일 시 표준 에러 (stderr) 메시지

tickets.cpp: In function 'long long int find_maximum(int, std::vector<std::vector<int> >)':
tickets.cpp:64:1: warning: control reaches end of non-void function [-Wreturn-type]
   64 | }
      | ^

• 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