Submission #430775

# Submission time Handle Problem Language Result Execution time Memory
430775 2021-06-17T04:43:19 Z juggernaut Carnival Tickets (IOI20_tickets) C++17
11 / 100
4 ms 588 KB
#include"tickets.h"
#include<bits/stdc++.h>
using namespace std;
#ifndef EVAL
#include"grader.cpp"
#endif
typedef long long ll;
bool cmp(vector<int>l,vector<int>r){
    return l[0]<r[0];
}
ll find_maximum(int k,vector<vector<int>>x){
	int n=x.size();
	int m=x[0].size();
	vector<vector<int>>answer;
	answer.assign(n,vector<int>(m,0));
	ll sum=0;
	sort(x.begin(),x.end(),cmp);
	allocate_tickets(answer);
	for(int i=0;i<n/2;i++)sum-=x[i][0];
	for(int i=n/2;i<n;i++)sum+=x[i][0];
	return sum;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 292 KB Output is correct
3 Correct 1 ms 292 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 4 ms 588 KB Output is correct
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB There is multiple tickets of color 0 on day 0
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB There is multiple tickets of color 0 on day 0
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB There is multiple tickets of color 0 on day 0
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB There is multiple tickets of color 0 on day 0
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB There is multiple tickets of color 0 on day 0
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 292 KB Output is correct
3 Correct 1 ms 292 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 4 ms 588 KB Output is correct
7 Incorrect 0 ms 204 KB There is multiple tickets of color 0 on day 0
8 Halted 0 ms 0 KB -