oj.uz

Submission #930789

# Submission time Handle Problem Language Result Execution time Memory
930789 2024-02-20T12:22:54 Z JooDdae Carnival Tickets (IOI20_tickets) C++17
25 / 100
 890 ms 85756 KB 
#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

ll find_maximum(int k, vector<vector<int>> x) {
    int n = x.size();
    int m = x[0].size();
    vector<vector<int>> answer;

    int N = n*m;
    vector<array<int, 2>> v;
    for(int i=0;i<n;i++) for(int j=0;j<m;j++) {
        v.push_back({x[i][j], i});
    }
    sort(v.begin(), v.end());

    ll ans = 0;
    vector<int> c(n, 0), L(n, 0);
    for(int i=0;i<N/2;i++) c[v[i][1]]++, ans += v[i+N/2][0] - v[i][0];
    vector<int> R = c;

    priority_queue<array<int, 2>> pq;
    for(int i=0;i<n;i++) pq.push({c[i], i});

    vector<vector<int>> re(n, vector<int>(m, -1));
    for(int i=0;i<m;i++) {
        set<int> s;
        for(int j=0;j<n/2;j++) s.insert(pq.top()[1]), pq.pop();

        for(int j=0;j<n;j++) {
            if(s.count(j)) re[j][L[j]++] = i;
            else re[j][R[j]++] = i;
        }

        for(auto x : s) pq.push({--c[x], x});
    }

    allocate_tickets(re);
    return ans;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Ticket 0 of color 1 is played on invalid day 1
2 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Ticket 0 of color 2 is played on invalid day 3
2 Halted 0 ms 0 KB -

Subtask #4
14.0 / 14.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 3 ms 604 KB Output is correct
5 Correct 33 ms 3640 KB Output is correct
6 Correct 4 ms 860 KB Output is correct
7 Correct 7 ms 1116 KB Output is correct
8 Correct 850 ms 85756 KB Output is correct
9 Correct 845 ms 78744 KB Output is correct
10 Correct 835 ms 80224 KB Output is correct
11 Correct 890 ms 85116 KB Output is correct

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 2 ms 604 KB Ticket 0 of color 1 is played on invalid day 1
3 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 Incorrect 2 ms 604 KB Ticket 0 of color 1 is played on invalid day 1
3 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 860 KB Output is correct
7 Incorrect 1 ms 348 KB Ticket 0 of color 1 is played on invalid day 1
8 Halted 0 ms 0 KB -