oj.uz

Submission #625307

# Submission time Handle Problem Language Result Execution time Memory
625307 2022-08-10T02:29:21 Z Trunkty Carnival Tickets (IOI20_tickets) C++14
27 / 100
 469 ms 77892 KB 
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
//#define ll ll;

#include "tickets.h"

ll pick[1505][1505];

ll find_maximum(int k, vector<vector<int>> x) {
	ll n = x.size();
	ll m = x[0].size();
	vector<vector<ll>> v;
	for(ll i=0;i<n;i++){
		v.push_back({x[i][0]+x[i][m-1],i});
	}
	sort(v.begin(),v.end());
	vector<ll> nums;
	for(ll i=0;i<n/2;i++){
		nums.push_back(x[v[i][1]][0]);
		pick[v[i][1]][0] = 1;
	}
	for(ll i=n/2;i<n;i++){
		nums.push_back(x[v[i][1]][m-1]);
		pick[v[i][1]][m-1] = 1;
	}
	sort(nums.begin(),nums.end());
	//
	ll ret=0,comp=nums[n/2];
	for(ll i:nums){
		ret += abs(i-comp);
	}
	//
	vector<vector<int>> answer;
	for(ll i=0;i<n;i++) {
		vector<int> row(m);
		for(ll j=0;j<m;j++) {
			row[j] = pick[i][j]-1;
		}
		answer.push_back(row);
	}
	allocate_tickets(answer);
	return ret;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 1620 KB Output is correct
6 Correct 4 ms 6848 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 2 ms 852 KB Output is correct
5 Correct 28 ms 4508 KB Output is correct
6 Correct 469 ms 77892 KB Output is correct

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB There is no ticket of color 0 on day 1
2 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB There is no ticket of color 0 on day 1
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB There is no ticket of color 0 on day 1
2 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB There is no ticket of color 0 on day 1
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 1620 KB Output is correct
6 Correct 4 ms 6848 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 2 ms 852 KB Output is correct
11 Correct 28 ms 4508 KB Output is correct
12 Correct 469 ms 77892 KB Output is correct
13 Incorrect 0 ms 212 KB There is no ticket of color 0 on day 1
14 Halted 0 ms 0 KB -