# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1062681 | TlenekWodoru | Carnival Tickets (IOI20_tickets) | C++14 | 495 ms | 74192 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<bits/stdc++.h>
#include "tickets.h"
using namespace std;
int Wziety[1509];
long long suma[1509];
long long find_maximum(int k, vector<vector<int>>A)
{
int n = A.size();
int n2=n/2;
int m = A[0].size();
vector<vector<int>>answer(n,vector<int>(m,-1));
vector<deque<pair<int,int>>>D;
for(vector<int>U : A)
{
deque<pair<int,int>>T;
for(int i=0;i<(int)U.size();i++)
{
T.push_back({U[i],i});
}
sort(T.begin(),T.end());
D.push_back(T);
}
for(int i=0;i<n;i++)
{
for(int j=0;j<m;j++)
{
suma[i]+=A[i][j];
}
}
memset(Wziety,-1,sizeof(Wziety));
# | 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... |