oj.uz

Submission #928609

# Submission time Handle Problem Language Result Execution time Memory
928609 2024-02-16T18:39:24 Z SUNWOOOOOOOO Carnival Tickets (IOI20_tickets) C++17
27 / 100
 417 ms 73284 KB 
#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
using pLL = array <LL, 2>;
using tLL = array <LL, 3>;

LL find_maximum(int k, vector<vector<int>> x) {
    LL ans = 0;
	int n = x.size(), m = x[0].size();
    vector <pLL> A;
    vector<vector<int>> s;
    s.resize(n, vector <int> (m, -1));
    priority_queue <tLL> pq;

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < k; j++) {
            ans -= x[i][j];
            s[i][j] = j;
        }
    }
    for (int i = 0; i < n; i++) pq.push({x[i][k - 1] + x[i][m - 1], i, k - 1});
    for (int i = 0; i < n * k / 2; i++){
        tLL now = pq.top(); pq.pop();
        ans += now[0];
        s[now[1]][now[2]] = -1;
        s[now[1]][now[2] + m - k] = now[2];
        if (now[2]) pq.push({x[now[1]][now[2] - 1] + x[now[1]][now[2] + m - k - 1], now[1], now[2] - 1});
    }
    allocate_tickets(s);
    return ans;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 600 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 0 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 16 ms 3172 KB Output is correct
6 Correct 417 ms 73284 KB Output is correct

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Contestant returned 2 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 Incorrect 0 ms 344 KB Contestant returned 5 but the tickets gives a total value of 13
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

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

Subtask #6
0 / 23.0

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

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 600 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 0 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 16 ms 3172 KB Output is correct
12 Correct 417 ms 73284 KB Output is correct
13 Incorrect 1 ms 344 KB Contestant returned 2 but the tickets gives a total value of 6
14 Halted 0 ms 0 KB -