제출 #722082

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
722082		danikoynov	카니발 티켓 (IOI20_tickets)	C++14	27 / 100	463 ms	55884 KiB

tickets

#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const int maxn = 1510;

int N, M, K, used[maxn][maxn];
vector < vector < int > > answer;

struct element
{
    ll max_pos, min_pos, delta, row;

    bool operator < (const element &e) const
    {
        return delta < e.delta;
    }
};

struct box
{
    int row, col;
    ll val;

    bool operator < (const box &bx) const
    {
        return val < bx.val;
    }

};

long long find_maximum(int k, vector < vector < int > > x)
{
    N = x.size();
    M = x[0].size();
    K = k;
    answer.resize(N);
    for (int i = 0; i < N; i++)
    {
        answer[i].resize(M, - 1);
    }

    ll max_prize = 0;
    if (M == 1 || K == 1)
    {
        for (int round = 0; round < k; round ++)
        {
            vector < element > arr;
            for (int i = 0; i < N; i ++)
            {
                element cur;
                cur.row = i;
                cur.min_pos = cur.max_pos = 0;
                while(used[i][cur.min_pos] == 1)
                    cur.min_pos ++;
                cur.max_pos = cur.min_pos;
                for (int j = 0; j < M; j ++)
                {
                    if (used[i][j] == 1)
                        continue;
                    if (x[i][j] < x[i][cur.min_pos])
                        cur.min_pos = j;
                    if (x[i][j] > x[i][cur.max_pos])
                        cur.max_pos = j;
                }
                ///cout << "here " << round << " " << cur.row << " " << cur.max_pos << " " << cur.min_pos << endl;
                cur.delta =  (x[cur.row][cur.max_pos] + x[cur.row][cur.min_pos]);
                arr.push_back(cur);
            }

            sort(arr.begin(), arr.end());
            for (int i = 0; i < N; i ++)
            {
                element cur = arr[i];
                if (i < N / 2)
                {
                    max_prize = max_prize - x[cur.row][cur.min_pos];
                    ///cout << cur.row << " :: " << cur.min_pos << endl;
                    used[cur.row][cur.min_pos] = 1;
                    answer[cur.row][cur.min_pos] = round;
                }
                else
                {
                    max_prize = max_prize + x[cur.row][cur.max_pos];
                    ///cout << cur.row << " :: " << cur.max_pos << endl;
                    used[cur.row][cur.max_pos] = 1;
                    answer[cur.row][cur.max_pos] = round;
                }
            }
        }
    }
    else if (M == K)
    {
        vector < box > vec;
        for (int i = 0; i < N; i ++)
            for (int j = 0; j < M; j ++)
            {
                box b;
                b.row = i;
                b.col = j;
                b.val = x[i][j];
                vec.push_back(b);
            }

        sort(vec.begin(), vec.end());
        int turn = 0;
        for (int i = 0; i < vec.size(); i ++)
        {
            box b = vec[i];
            answer[b.row][b.col] = turn ++;
            if (turn == k)
                turn = 0;

            if (i < vec.size() / 2)
            {
                max_prize = max_prize - b.val;
            }
            else
            {
                max_prize = max_prize + b.val;
            }
        }
    }
    allocate_tickets(answer);
    return max_prize;
}

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

tickets.cpp: In function 'long long int find_maximum(int, std::vector<std::vector<int> >)':
tickets.cpp:108:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<box>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  108 |         for (int i = 0; i < vec.size(); i ++)
      |                         ~~^~~~~~~~~~~~
tickets.cpp:115:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<box>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  115 |             if (i < vec.size() / 2)
      |                 ~~^~~~~~~~~~~~~~~~

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