제출 #592465

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
592465		ogibogi2004	카니발 티켓 (IOI20_tickets)	C++14	0 / 100	1 ms	212 KiB

tickets

#include "tickets.h"
#include <vector>
#include<bits/stdc++.h>
using namespace std;
#define ll long long
long long find_maximum(int k, vector<vector<int>> x1) {
    //cout<<"?\n";
    vector<vector<ll> >x;
    for(int i=0;i<x1.size();i++)
    {
        vector<ll>row;
        for(int j=0;j<x1[i].size();j++)row.push_back(x1[i][j]);
        x.push_back(row);
    }
	ll n = x.size();
	ll m = x[0].size();
	vector<vector<int>> answer;
    vector<pair<ll,ll>>smallest[n];
    int ptr1[n],ptr2[n];
    for(ll i=0;i<n;i++)
    {
        for(ll j=0;j<m;j++)smallest[i].push_back({x[i][j],j});
        sort(smallest[i].begin(),smallest[i].end());
        ptr1[i]=0;ptr2[i]=smallest[i].size()-1;
    }
    answer=x1;
    for(int i=0;i<answer.size();i++)
    {
        for(int j=0;j<answer[i].size();j++)
        {
            answer[i][j]=-1;
        }
    }
    int min0=0,max0=0;
    for(int i=0;i<n;i++)
    {
        int cnt0=0,cnt1=0;
        for(int j=0;j<m;j++)
        {
            if(x[i][j]==0)cnt0++;
            else cnt1++;
        }
        max0+=min(k,cnt0);
        min0+=max(0,k-cnt1);
    }
    int target;
    if(n*k/2>=min0&&n*k/2<=max0)target=n*k/2;
    else if(n*k/2<min0)target=min0;
    else target=max0;
    vector<int>zero[n],one[n];
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<m;j++)
        {
            if(x[i][j]==0)zero[i].push_back(j);
            else one[i].push_back(j);
        }
    }
    for(int r=0;r<k;r++)
    {
        int f=min(target,max(k/2,target-(k-r-1)*k));
        target-=f;
        vector<pair<int,int> >v;
        for(int i=0;i<n;i++)
        {
            v.push_back({zero[i].size(),i});
        }
        sort(v.rbegin(),v.rend());
        for(int j=0;j<v.size();j++)
        {
            if(j<f)
            {
                answer[v[j].second][zero[v[j].second].back()]=r;
                zero[v[j].second].pop_back();
            }
            else
            {
                answer[v[j].second][one[v[j].second].back()]=r;
                one[v[j].second].pop_back();
            }
        }
    }
    allocate_tickets(answer);
    return min((int)target,(int)n*k-target);
}
/*
2 3 2
0 2 5
1 1 3
*/
/*
4 4 3
0 1 1 1
0 1 1 1
0 1 1 1
0 0 0 1
*/

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

tickets.cpp: In function 'long long int find_maximum(int, std::vector<std::vector<int> >)':
tickets.cpp:9:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    9 |     for(int i=0;i<x1.size();i++)
      |                 ~^~~~~~~~~~
tickets.cpp:12:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   12 |         for(int j=0;j<x1[i].size();j++)row.push_back(x1[i][j]);
      |                     ~^~~~~~~~~~~~~
tickets.cpp:27:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |     for(int i=0;i<answer.size();i++)
      |                 ~^~~~~~~~~~~~~~
tickets.cpp:29:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |         for(int j=0;j<answer[i].size();j++)
      |                     ~^~~~~~~~~~~~~~~~~
tickets.cpp:69:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   69 |         for(int j=0;j<v.size();j++)
      |                     ~^~~~~~~~~
tickets.cpp:19:9: warning: variable 'ptr1' set but not used [-Wunused-but-set-variable]
   19 |     int ptr1[n],ptr2[n];
      |         ^~~~
tickets.cpp:19:17: warning: variable 'ptr2' set but not used [-Wunused-but-set-variable]
   19 |     int ptr1[n],ptr2[n];
      |                 ^~~~

• 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