# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1050760 | Huseyn123 | Carnival Tickets (IOI20_tickets) | C++17 | 526 ms | 65880 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"
#include <vector>
#define pb push_back
using namespace std;
typedef long long ll;
ll find_maximum(int k, vector<vector<int>> x) {
int n = x.size();
int m = x[0].size();
ll res=0;
vector<vector<int>> answer;
for(int i=0;i<n;i++){
vector<int> d;
for(int j=0;j<m;j++){
d.pb(-1);
}
answer.pb(d);
}
int pre[n],suf[n];
for(int i=0;i<n;i++){
pre[i]=k;
suf[i]=0;
for(int j=0;j<k;j++){
res-=x[i][j];
}
}
set<pair<ll,int>> c;
for(int i=0;i<n;i++){
if(pre[i]==0){
continue;
# | 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... |