oj.uz

Submission #430787

# Submission time Handle Problem Language Result Execution time Memory
430787 2021-06-17T05:05:11 Z juggernaut Carnival Tickets (IOI20_tickets) C++17
0 / 100
 1 ms 204 KB 
#include"tickets.h"
#include<bits/stdc++.h>
using namespace std;
#ifndef EVAL
#include"grader.cpp"
#endif
typedef long long ll;
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,-1));
	vector<pair<int,int>>vec;
	ll sum=0;
	for(int i=0;i<n;i++)
        vec.emplace_back(x[i][m-1],i);
    sort(vec.rbegin(),vec.rend());
    for(int i=0;i<n/2;i++){
        sum+=vec[i].first;
        answer[vec[i].second][m-1]=0;
    }
    for(int i=0;i<n;i++)if(~answer[i][m-1])answer[i][0]=0,sum-=x[i][0];
	allocate_tickets(answer);
	return sum;
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB There is no ticket of color 0 on day 0
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 no ticket 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 no ticket 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 0 ms 204 KB There is no ticket 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 0 ms 204 KB There is no ticket 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 0 ms 204 KB There is no ticket 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 1 ms 204 KB There is no ticket of color 0 on day 0
2 Halted 0 ms 0 KB -