Submission #328878

#TimeUsernameProblemLanguageResultExecution timeMemory
328878blueCarnival Tickets (IOI20_tickets)C++17
0 / 100
1 ms364 KiB
#include "tickets.h"
#include <vector>
#include <algorithm>
using namespace std;

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

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

    vector<int> t(m);
    for(int i = 0; i < m; i++) t[i] = i;
    for(int i = 0; i < n; i++) s[i] = t;

    long long res = 0;
    for(int i = 0; i < n; i++)
    {
        for(int j = 0; j < m/2; j++) res -= x[i][j];
        for(int j = m/2; j < m; j++) res += x[i][j];
    }

    allocate_tickets(s);
    return res;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...