제출 #310300

#제출 시각아이디문제언어결과실행 시간메모리
310300APROHACKCarnival Tickets (IOI20_tickets)C++17
0 / 100
1 ms256 KiB
#include "tickets.h" #include <bits/stdc++.h> using namespace std; long long find_maximum(int k, vector<vector<int> > x) { int n = x.size(); int m = x[0].size(); vector<vector<int> > answer; for (int i = 0; i < n; i++) { 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 ++){ for(int j = 0 ; j < m ; j ++){ answer[i][j]=0; } } /* set<int>pasados; for(int i = 0 ; i < n/2 ; i ++){ long long menor=INT_MAX, mayor, menorpos, mayorpos; for(int j = 0 ; j < n ; j ++){ if(pasados.find(j)!=pasados.end())continue; if(menor>=x[j][0]){ menor=x[j][0]; menorpos=j; } } } */ 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...