#include "tickets.h"
#include <bits/stdc++.h>
#define fi first
#define se secod
#define sz(x) (int)x.size()
#define cmin(a, b) a=min(a, b)
#define cmax(a, b) a=max(a, b)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define pb push_back
#define int long long
using namespace std;
int n, m, k;
vector<vector<int>> a;
long long find_maximum(signed K, vector<vector<signed>> x) {
n=sz(x), m=sz(x[0]), k=K;
for (int i=0; i<n; i++) for (int j=0; j<m; j++) a[i][j]=x[i][j];
int res=0; for (int i=0; i<n; i++) res+=a[i][0];
vector<vector<signed>> ans(n, vector<signed>(m, -1)); for (int i=0; i<n; i++) ans[i][0]=0;
allocate_tickets(ans);
return (res+n/2)/n;
}
# | 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... |