Submission #532791

#TimeUsernameProblemLanguageResultExecution timeMemory
532791aryan12Carnival Tickets (IOI20_tickets)C++17
0 / 100
1 ms268 KiB
#include "tickets.h" #include <vector> #include <bits/stdc++.h> using namespace std; long long find_maximum(int k, std::vector<std::vector<int>> x) { int n = x.size(); int m = x[0].size(); vector<vector<int> > answer(n, vector<int> (m, -1)); for(int i = 0; i < n; i++) { for(int j = 0; j < m; j++) { answer[i][j] = 0; } } allocate_tickets(answer); 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...