oj.uz

Submission #928073

# Submission time Handle Problem Language Result Execution time Memory
928073 2024-02-15T20:12:30 Z EJIC_B_KEDAX Carnival Tickets (IOI20_tickets) C++17
11 / 100
 506 ms 72884 KB 
#include <bits/stdc++.h>
#include "tickets.h"

using ll = long long;

using namespace std;

ll find_maximum(int k, vector<vector<int>> t) {
    int n = t.size(), m = t[0].size();
    vector<int> all;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            all.push_back(t[i][j]);
        }
    }
    sort(all.begin(), all.end());
    int middle = all[all.size() / 2];
    ll res = 0;
    vector<pair<ll, int>> a(n);
    vector<int> bg(n, 0), end(n, m - 1);
    vector<vector<int>> s(n, vector<int>(m, -1));
    for (int i = 0; i < n; i++) {
        a[i].first = 0;
        a[i].second = i;
        for (int j = 0; j < m; j++) {
            t[i][j] -= middle;
            res += abs(t[i][j]);
            a[i].first += t[i][j];
        }
    }
    for (int r = 0; r < k; r++) {
        vector<int> nw;
        sort(a.begin(), a.end());
        for (int i = 0; i < n / 2; i++) {
            a[i].first -= t[a[i].second][bg[a[i].second]];
            nw.push_back(t[a[i].second][bg[a[i].second]]);
            s[a[i].second][bg[a[i].second]++] = r;
        }
        for (int i = n / 2; i < n; i++) {
            a[i].first -= t[a[i].second][end[a[i].second]];
            nw.push_back(t[a[i].second][end[a[i].second]]);
            s[a[i].second][end[a[i].second]--] = r;
        }
        assert(0 >= nw[n / 2 - 1] && 0 <= nw[n / 2]);
    }
    allocate_tickets(s);
    return res;
}

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 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 856 KB Output is correct

Subtask #2
0 / 16.0

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

Subtask #3
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 Incorrect 0 ms 348 KB Contestant returned 25 but the tickets gives a total value of 42
4 Halted 0 ms 0 KB -

Subtask #4
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 0 ms 348 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 24 ms 2516 KB Output is correct
6 Correct 4 ms 604 KB Output is correct
7 Correct 5 ms 1008 KB Output is correct
8 Runtime error 506 ms 72884 KB Execution killed with signal 6
9 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Incorrect 2 ms 804 KB Contestant returned 38993572901 but the tickets gives a total value of 1593618503176
3 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Incorrect 2 ms 804 KB Contestant returned 38993572901 but the tickets gives a total value of 1593618503176
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 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 856 KB Output is correct
7 Incorrect 0 ms 348 KB Contestant returned 860858182 but the tickets gives a total value of 1095508474
8 Halted 0 ms 0 KB -