oj.uz

Submission #448177

# Submission time Handle Problem Language Result Execution time Memory
448177 2021-07-29T06:42:36 Z dxz05 Carnival Tickets (IOI20_tickets) C++14
27 / 100
 627 ms 73184 KB 
#include "tickets.h"
#include <bits/stdc++.h>

typedef long long ll;

#define MP make_pair

using namespace std;

long long find_maximum(int k, vector<vector<int>> a) {
	int n = a.size();
	int m = a[0].size();

	if (m == 1) {
        vector<vector<int>> answer(n, vector<int>(m, 0));
        allocate_tickets(answer);

        vector<int> v;
        for (int i = 0; i < n; i++) v.push_back(a[i][0]);

        sort(v.begin(), v.end());

        ll ans = 0;
        for (int i = 0; i < n; i++){
            if (i < n / 2) ans -= v[i]; else
                ans += v[i];
        }

        return ans;
    }

	ll ans = 0;

    vector<vector<int>> answer(n, vector<int>(m, -1));
    vector<pair<pair<ll, int>, pair<int, int>>> v;
    for (int i = 0; i < n; i++){
        int l = min_element(a[i].begin(), a[i].end()) - a[i].begin();
        int r = max_element(a[i].begin(), a[i].end()) - a[i].begin();
        answer[i][r] = 0;
        ans += a[i][r];
        v.emplace_back(MP(-a[i][r] - a[i][l], i), MP(l, r));
    }

    sort(v.rbegin(), v.rend());

    for (int i = 0; i < n / 2; i++){
        ans += v[i].first.first;
        answer[v[i].first.second][v[i].second.first] = 0;
        answer[v[i].first.second][v[i].second.second] = -1;
    }

    allocate_tickets(answer);

    return ans;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 292 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 292 KB Output is correct
6 Correct 2 ms 716 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 2 ms 460 KB Output is correct
5 Correct 27 ms 3124 KB Output is correct
6 Correct 627 ms 73184 KB Output is correct

Subtask #3
0 / 14.0

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

Subtask #4
0 / 14.0

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

Subtask #5
0 / 12.0

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

Subtask #6
0 / 23.0

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

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 292 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 292 KB Output is correct
6 Correct 2 ms 716 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 2 ms 460 KB Output is correct
11 Correct 27 ms 3124 KB Output is correct
12 Correct 627 ms 73184 KB Output is correct
13 Incorrect 1 ms 204 KB There is no ticket of color 0 on day 1
14 Halted 0 ms 0 KB -