oj.uz

Submission #921242

# Submission time Handle Problem Language Result Execution time Memory
921242 2024-02-03T15:24:28 Z ksujay2 Carnival Tickets (IOI20_tickets) C++17
27 / 100
 393 ms 73336 KB 
#include <bits/stdc++.h>
#include "tickets.h"
using namespace std;
using ll = long long;

ll find_maximum(int k, vector<vector<int>> x) {
    int n = x.size(), m = x[0].size();
    vector<vector<int>> delta(n, vector<int>(k));
    ll sm = 0;
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < k; j++) {
            sm -= x[i][j];
        }
        for(int j = 0; j < k; j++) {
            delta[i][j] = x[i][m - j - 1] + x[i][k - j - 1];
        }
    }
    vector<int> pos(n), neg(n, k);
    priority_queue<pair<int, int>> pq;
    for(int i = 0; i < n; i++) {
        pq.push({delta[i][pos[i]], i});
    }
    for(int i = 0; i < n / 2 * k; i++) {
        sm += pq.top().first;
        int j = pq.top().second;
        pq.pop();
        pos[j]++;
        neg[j]--;
        if(pos[j] < k) pq.push({delta[j][pos[j]], j});
    }
    vector<vector<int>> s(n, vector<int>(m, -1));
    for(int i = 0; i < k; i++) {
        int negcnt = 0;
        for(int j = 0; j < n; j++) {
            if(negcnt < n / 2 && neg[j] > 0) {
                neg[j]--;
                s[j][neg[j]] = i;
                negcnt++;
            } else {
                s[j][m - pos[j]] = i;
                pos[j]--;
            }
        }
    }
    allocate_tickets(s);
    return sm;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 860 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 16 ms 3280 KB Output is correct
6 Correct 393 ms 73336 KB Output is correct

Subtask #3
0 / 14.0

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

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 548 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Runtime error 1 ms 348 KB Execution killed with signal 6
4 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Incorrect 2 ms 604 KB There is no ticket of color 48 on day 0
4 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Incorrect 2 ms 604 KB There is no ticket of color 48 on day 0
4 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 860 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 16 ms 3280 KB Output is correct
12 Correct 393 ms 73336 KB Output is correct
13 Incorrect 1 ms 348 KB There is no ticket of color 3 on day 0
14 Halted 0 ms 0 KB -