oj.uz

Submission #428732

# Submission time Handle Problem Language Result Execution time Memory
428732 2021-06-15T14:07:36 Z Keshi Carnival Tickets (IOI20_tickets) C++17
27 / 100
 722 ms 53340 KB 
//In the name of God
#include <bits/stdc++.h>
#include "tickets.h"
using namespace std;

typedef int ll;
typedef pair<ll, ll> pll;

const ll maxn = 1510;
const ll mod = 1e9 + 7;
const ll inf = 1e9;

#define fast_io ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define Mp make_pair
#define F first
#define S second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define Sz(x) ll((x).size())

ll cnt[maxn], cn[maxn];
vector<ll> c2[maxn];
bool vis[maxn][maxn];

long long find_maximum(int k, vector<vector<int>> a) {
	ll n = Sz(a);
	ll m = Sz(a[0]);
	vector<vector<int>> answer(n);
	long long ans = 0;
	vector<pll> vec;
	for(ll i = 0; i < n; i++){
		answer[i].resize(m, -1);
		cn[i] = m - 1;
		for(ll j = 0; j < k; j++){
			ans -= a[i][j];
			vec.pb(Mp(a[i][j] + a[i][m - k + j], i));
		}
	}
	sort(all(vec), greater<pll>());
	for(ll i = 0; i < n * k / 2; i++){
		if(cnt[vec[i].S] == k) continue;
		cnt[vec[i].S]++;
		ans += vec[i].F;
	}
	for(ll i = 0; i < n; i++){
		c2[cnt[i]].pb(i);
	}
	ll tt = 0;
	for(ll i = k; i > 0; i--){
		for(ll j : c2[i]){
			answer[j][cn[j]--] = tt / (n / 2);
			tt++;
			c2[i - 1].pb(j);
		}
	}
	for(ll i = 0; i < n; i++){
		for(ll j = 0; j < m; j++){
			if(~answer[i][j]) vis[i][answer[i][j]] = 1;
		}
		cn[i] = 0;
		for(ll j = 0; j < k; j++){
			if(!vis[i][j]) answer[i][cn[i]++] = j;
		}
	}
	allocate_tickets(answer);
	return ans;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 2 ms 588 KB Output is correct
5 Correct 28 ms 2824 KB Output is correct
6 Correct 722 ms 53340 KB Output is correct

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Incorrect 1 ms 340 KB There is multiple tickets of color 7 on day 0
4 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Incorrect 2 ms 332 KB There is multiple tickets of color 0 on day 0
4 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 2 ms 588 KB Output is correct
3 Incorrect 3 ms 588 KB There is multiple tickets of color 26 on day 0
4 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 2 ms 588 KB Output is correct
3 Incorrect 3 ms 588 KB There is multiple tickets of color 26 on day 0
4 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 1 ms 716 KB Output is correct
6 Correct 3 ms 2636 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 2 ms 588 KB Output is correct
11 Correct 28 ms 2824 KB Output is correct
12 Correct 722 ms 53340 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Incorrect 1 ms 340 KB There is multiple tickets of color 7 on day 0
16 Halted 0 ms 0 KB -