Submission #704037

#TimeUsernameProblemLanguageResultExecution timeMemory
704037bebraCarnival Tickets (IOI20_tickets)C++17
0 / 100
1 ms212 KiB
#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;


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

    vector<vector<int>> res(n, vector<int>(m, -1));
    for (int i = 0; i < n; ++i) {
        res[i][0] = 0;
    }
    allocate_tickets(res);
    return 1;
}
#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...