oj.uz

Submission #433445

# Submission time Handle Problem Language Result Execution time Memory
433445 2021-06-19T20:02:00 Z OttoTheDino Carnival Tickets (IOI20_tickets) C++17
27 / 100
 620 ms 51460 KB 
#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;

#define rep(i,s,e)                  for (int i = s; i <= e; ++i)
typedef vector<int> vi;
typedef pair<int,int> ii;

long long find_maximum(int k, vector<vi> x) {
	int n = x.size(), m = x[0].size();
    long long ans = 0;
    vector<vi> answer(n, vi(m, -1));
    priority_queue<pair<int,int>> pq;
    int used[n]={}, lo[n]={}, hi[n]={};
    rep (i,0,n-1) {
        rep (j,0,k-1) ans -= x[i][j];
        pq.push({x[i][m-1]+x[i][k-1],i});
    }
    rep (i,1,n*k/2) {
        int ma = pq.top().first, c = pq.top().second;
        pq.pop();
        ans += ma;
        if (used[c]++<k-1) pq.push({x[c][m-1-used[c]]+x[c][k-1-used[c]],c});
    }
    ii used2[n] = {};
    rep (i,0,n-1) used2[i] = {used[i],i};
    rep (i,0,k-1) {
        sort(used2, used2+n, greater<ii>());
        rep (j,0,n/2-1) {
            int c = used2[j].second;
            used2[j] = {--used[j], c};
            answer[c][m-1-hi[c]++] = i;
        }
        rep (j,n/2,n-1) {
            int c = used2[j].second;
            answer[c][lo[c]++] = i;
        }
    }
	allocate_tickets(answer);
	return ans;
}

Subtask #1
11.0 / 11.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 0 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 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 2 ms 332 KB Output is correct
5 Correct 25 ms 2368 KB Output is correct
6 Correct 620 ms 51460 KB Output is correct

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Contestant returned 5 but the tickets gives a total value of 6
2 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Incorrect 1 ms 204 KB Contestant returned 23997938844 but the tickets gives a total value of 24057831018
4 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Incorrect 2 ms 332 KB Contestant returned 190813110991 but the tickets gives a total value of 191909121109
4 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Incorrect 2 ms 332 KB Contestant returned 190813110991 but the tickets gives a total value of 191909121109
4 Halted 0 ms 0 KB -

Subtask #7
0 / 10.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 0 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 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 2 ms 332 KB Output is correct
11 Correct 25 ms 2368 KB Output is correct
12 Correct 620 ms 51460 KB Output is correct
13 Incorrect 1 ms 204 KB Contestant returned 5 but the tickets gives a total value of 6
14 Halted 0 ms 0 KB -