oj.uz

Submission #414172

# Submission time Handle Problem Language Result Execution time Memory
414172 2021-05-30T08:11:26 Z Bill_00 Carnival Tickets (IOI20_tickets) C++14
27 / 100
 617 ms 51860 KB 
#include "tickets.h"
#include <bits/stdc++.h>
#define pb push_back
using namespace std;
int l[2005],r[2005];
long long find_maximum(int k, vector<vector<int> > x) {
	int n = x.size();
	int m = x[0].size();
	long long ans=0;
	vector<vector<int> > answer;
	for (int i = 0; i < n; i++) {
		std::vector<int> row(m);
		for (int j = 0; j < m; j++) {
			row[j]=-1;
		}
		answer.push_back(row);
	}
	for(int i=0;i<n;i++){
		l[i]=0;
		r[i]=m-1;
	}
	for(int i=0;i<k;i++){
		vector<pair<long long,int> >v;
		for(int j=0;j<n;j++){
			ans+=((long long)x[j][r[j]]);
			v.pb({x[j][l[j]]+x[j][r[j]],j});
		}
		sort(v.begin(),v.end());
		for(int j=0;j<n;j++){
			int id=v[j].second;
			if(j<(n/2)){
				ans-=((long long)v[j].first);
				answer[id][l[id]]=i;
				l[id]++;
			}
			else{
				answer[id][r[id]]=i;
				r[id]--;
			}
		}
	}
	allocate_tickets(answer);
	return ans;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 292 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 3 ms 716 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 300 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 3 ms 460 KB Output is correct
5 Correct 33 ms 3128 KB Output is correct
6 Correct 617 ms 51860 KB Output is correct

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Contestant returned 5 while correct return value is 6.
2 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Contestant returned 11 while correct return value is 13.
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Contestant returned 11 while correct return value is 13.
2 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Contestant returned 11 while correct return value is 13.
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 292 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 3 ms 716 KB Output is correct
7 Correct 1 ms 300 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 3 ms 460 KB Output is correct
11 Correct 33 ms 3128 KB Output is correct
12 Correct 617 ms 51860 KB Output is correct
13 Incorrect 1 ms 204 KB Contestant returned 5 while correct return value is 6.
14 Halted 0 ms 0 KB -