oj.uz

Submission #430774

# Submission time Handle Problem Language Result Execution time Memory
430774 2021-06-17T04:40:52 Z juggernaut Carnival Tickets (IOI20_tickets) C++17
0 / 100
 1 ms 256 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);
	sum=1ll*n*1ll*x[n/2-1][0];
	for(int i=0;i<n/2;i++)sum-=x[i][0];
	return sum;
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Contestant returned 298620960 but the tickets gives a total value of 500507564
2 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# 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 -

Subtask #3
0 / 14.0

# 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 -

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 256 KB There is multiple tickets of color 0 on day 0
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# 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 -

Subtask #6
0 / 23.0

# 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 -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Contestant returned 298620960 but the tickets gives a total value of 500507564
2 Halted 0 ms 0 KB -