oj.uz

Submission #572834

# Submission time Handle Problem Language Result Execution time Memory
572834 2022-06-05T11:07:30 Z kartel Carnival Tickets (IOI20_tickets) C++14
27 / 100
 491 ms 51352 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
//#include "grader.cpp"
#include "tickets.h"
#define sz(x) (int)x.size()
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define F first
#define S second
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;

typedef tree<pair <int, int> , null_type, less<pair <int, int> >, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

long long find_maximum(int k, vector <vector <int> > x) {
    int n = sz(x);
    int m = sz(x[0]);

    vector <vector <int> > ans(n, vector <int> (m, -1));
    vector <int> le(n, 0);
    vector <int> ri(n, m - 1);
    vector <int> M(n);
    vector <vector <int> > used(k, vector <int> (n, 0));
    ll sum = 0;
    for (int it = 0; it < k; it++) {
        vector <pair<int, int> > val;
        for (int i = 0; i < n; i++) {
            val.pb({x[i][le[i]] + x[i][m - k + it], i});
        }
        sort(all(val));
        for (int i = 0; i < n / 2; i++) {
            ans[val[i].S][le[val[i].S]] = it;
            used[it][val[i].S] = 1;
            sum -= x[val[i].S][le[val[i].S]];
            le[val[i].S]++;
        }
        M[it] = x[val[n / 2 - 1].S][le[val[n / 2 - 1].S]];
    }

    for (int it = 0; it < k; it++) {
        for (int i = 0; i < n; i++) {
            if (used[it][i]) {
                continue;
            }
            while (ri[i] >= 0 && ans[i][ri[i]] != -1) {
                ri[i]--;
            }
            assert(ri[i] != -1 && x[i][ri[i]] >= M[it]);
            used[it][i] = 1;
            ans[i][ri[i]] = it;
            sum += x[i][ri[i]];
        }
    }
    allocate_tickets(ans);
    return sum;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 20 ms 2328 KB Output is correct
6 Correct 491 ms 51352 KB Output is correct

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 2 ms 436 KB Output is correct
5 Incorrect 21 ms 2652 KB Contestant returned 22499 while correct return value is 22500.
6 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 340 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 340 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 340 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 20 ms 2328 KB Output is correct
12 Correct 491 ms 51352 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 2 ms 436 KB Output is correct
17 Incorrect 21 ms 2652 KB Contestant returned 22499 while correct return value is 22500.
18 Halted 0 ms 0 KB -