Submission #310295

#TimeUsernameProblemLanguageResultExecution timeMemory
310295APROHACK카니발 티켓 (IOI20_tickets)C++14
0 / 100
1 ms256 KiB
#include "tickets.h" #include <bits/stdc++.h> #include <vector> using namespace std; long long find_maximum(int k, std::vector<std::vector<int>> x) { int n = x.size(); int m = x[0].size(); std::vector<std::vector<int>> answer; /* for (int i = 0; i < n; i++) { std::vector<int> row(m); for (int j = 0; j < m; j++) { if (j < k) { row[j] = j; } else { row[j] = -1; } } answer.push_back(row); } */ for(int i = 0 ; i < n ; i ++){ vector<int>a; for(int j = 0 ; j < m ; j ++){ a.push_back(0); } answer.push_back(a); } 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...