| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 328878 | blue | Carnival Tickets (IOI20_tickets) | C++17 | 1 ms | 364 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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 time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
