Submission #955028

# Submission time Handle Problem Language Result Execution time Memory
955028 2024-03-29T08:10:47 Z Trisanu_Das Carnival Tickets (IOI20_tickets) C++17
11 / 100
1 ms 604 KB
#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
 
long long find_maximum(int k, vector<vector<int> > x) {
	sort(x.begin(), x.end());
	int n = x.size();
	vector<vector<int> > ans(n, vector<int>(1));
	allocate_tickets(ans);
	long long res = 0;
	for(auto u : x) res += abs(u.back() - x[n / 2].back());
	return res;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 436 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB WA in grader: allocate_tickets called with parameter of wrong size
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 432 KB WA in grader: allocate_tickets called with parameter of wrong size
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB WA in grader: allocate_tickets called with parameter of wrong size
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB WA in grader: allocate_tickets called with parameter of wrong size
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB WA in grader: allocate_tickets called with parameter of wrong size
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 436 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Incorrect 1 ms 348 KB WA in grader: allocate_tickets called with parameter of wrong size
8 Halted 0 ms 0 KB -