oj.uz

Submission #441114

# Submission time Handle Problem Language Result Execution time Memory
441114 2021-07-04T08:20:09 Z roseanne_pcy Carnival Tickets (IOI20_tickets) C++14
27 / 100
 625 ms 73180 KB 
#include "tickets.h"
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
 
#include <bits/stdc++.h>
 
using namespace std;
 
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef long long ll;
 
#define f first
#define s second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rsz resize
 
const int md = 1e9+7;
const ll inf = 1e18;
const int maxn = 2e3+5;
 
template<class T> void ckmin(T &a, T b) { a = min(a, b); }
template<class T> void ckmax(T &a, T b) { a = max(a, b); }
 
int lst[maxn], mst[maxn];
int n, m;

bool cmp(int x, int y)
{
	return lst[x]+mst[x] > lst[y]+mst[y];
}

long long find_maximum(int k, vector< vector<int> > b) 
{
	n = b.size(); m = b[0].size();
	vector< vi > res(n, vector<int>(m, -1));
	ll tot = 0;
	for(int i = 0; i< n; i++)
	{
		res[i][0] = 0;
		tot -= b[i][0];
		lst[i] = b[i][0];
		mst[i] = b[i][m-1];
	}
	vector<int> allnums;
	for(int i = 0; i< n; i++) allnums.pb(i);
	sort(all(allnums), cmp);
	for(int i  = 0; i< n/2; i++)
	{
		int x = allnums[i];
		res[x][0] = -1;
		res[x][m-1] = 0;
		tot += b[x][0] + b[x].back();
	}
	allocate_tickets(res);
	return tot;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 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 332 KB Output is correct
6 Correct 2 ms 716 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 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 28 ms 3164 KB Output is correct
6 Correct 625 ms 73180 KB Output is correct

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 1
2 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 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 204 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 204 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 1 ms 204 KB Output is correct
2 Correct 0 ms 204 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 332 KB Output is correct
6 Correct 2 ms 716 KB Output is correct
7 Correct 0 ms 204 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 28 ms 3164 KB Output is correct
12 Correct 625 ms 73180 KB Output is correct
13 Incorrect 0 ms 204 KB There is no ticket of color 0 on day 1
14 Halted 0 ms 0 KB -