Submission #838349

#TimeUsernameProblemLanguageResultExecution timeMemory
838349ma_moutahidCarnival Tickets (IOI20_tickets)C++17
0 / 100
1 ms340 KiB
#include "tickets.h"
#include <vector>



long long find_maximum(int k, std::vector<std::vector<int>> x) {
	int n = x.size();
	int m = x[0].size();
	long long prize=0;
	std::vector<std::vector<int>> answer;
	for(int i=0;i<n;i++){
		for(int j=0;j<m;j++){
			prize+=x[i][j];
			answer[i][j]=0;
		}
	}
	allocate_tickets(answer);
	return prize;
}
#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...