oj.uz

Submission #734691

# Submission time Handle Problem Language Result Execution time Memory
734691 2023-05-02T21:05:46 Z Elvin_Fritl Carnival Tickets (IOI20_tickets) C++17
27 / 100
 532 ms 73048 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>> res(n, vector<int>(m, -1));
 
    vector<int> a(n);
    iota(a.begin(), a.end(), 0);
    sort(a.begin(), a.end(), [&](int lhs, int rhs) {
        return x[lhs][m - 1] + x[lhs][0] > x[rhs][m - 1] + x[rhs][0];
    });
 
    ll ans = 0;
    vector<int> s;
    for (int i = 0; i < n / 2; ++i) {
        res[a[i]][m - 1] = 0;
        s.push_back(x[a[i]][m - 1]);
    }
    for (int i = n / 2; i < n; ++i) {
        res[a[i]][0] = 0;
        s.push_back(x[a[i]][0]);
    }
    sort(s.begin(), s.end());
    for (int i = 0; i < n / 2; ++i) {
        ans -= s[i];
    }
    for (int i = n / 2; i < n; ++i) {
        ans += s[i];
    }
    allocate_tickets(res);
    return ans;
}

Subtask #1
11.0 / 11.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 1 ms 296 KB Output is correct
5 Correct 1 ms 296 KB Output is correct
6 Correct 2 ms 724 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 2 ms 436 KB Output is correct
5 Correct 22 ms 3232 KB Output is correct
6 Correct 532 ms 73048 KB Output is correct

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 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 212 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 0 ms 212 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 0 ms 212 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 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 1 ms 296 KB Output is correct
5 Correct 1 ms 296 KB Output is correct
6 Correct 2 ms 724 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 300 KB Output is correct
10 Correct 2 ms 436 KB Output is correct
11 Correct 22 ms 3232 KB Output is correct
12 Correct 532 ms 73048 KB Output is correct
13 Incorrect 1 ms 212 KB There is no ticket of color 0 on day 1
14 Halted 0 ms 0 KB -