Submission #328880

#	Time	Username	Problem	Language	Result	Execution time	Memory
328880		blue	Carnival Tickets (IOI20_tickets)	C++17	0 / 100	1 ms	384 KiB

tickets

#include "tickets.h"
#include <vector>
#include <algorithm>
using namespace std;

vector< vector<int> > Z;

struct ind
{
    int i;
};

bool operator < (ind A, ind B)
{
    return Z[A.i].back() - Z[A.i].front() < Z[B.i].back() - Z[B.i].front();
}

long long find_maximum(int k, vector< vector<int> > x)
{
    int n = x.size();
    int m = x[0].size();

    Z = x;

    ind I[n];
    for(int i = 0; i < n; i++) I[i] = ind{i};

    sort(I, I+n);

    vector< vector<int> > s(n);

    long long res;

    for(int i = 0; i < n/2; i++)
    {
        s[I[i].i] = vector<int>(m, -1);
        s[I[i].i][0] = 0;
        res -= x[I[i].i][0];
    }
    for(int i = n/2; i < n; i++)
    {
        s[I[i].i] = vector<int>(m, -1);
        s[I[i].i][m-1] = 0;
        res += x[I[i].i][m-1];
    }

    allocate_tickets(s);
    return res;
}

Compilation message (stderr)

tickets.cpp: In function 'long long int find_maximum(int, std::vector<std::vector<int> >)':
tickets.cpp:48:12: warning: 'res' may be used uninitialized in this function [-Wmaybe-uninitialized]
   48 |     return res;
      |            ^~~

• 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