oj.uz

Submission #608414

# Submission time Handle Problem Language Result Execution time Memory
608414 2022-07-27T07:30:33 Z Mher Carnival Tickets (IOI20_tickets) C++14
62 / 100
 3000 ms 203936 KB 
#include <bits/stdc++.h>
#include "tickets.h"
#include <vector>

using namespace std;

int n;
int m;
long long res = 0;
vector<int> l, r;
vector<vector<int>> sg, ans;
set<pair<int, pair<int, int>>> prio;

long long find_maximum(int k, vector<vector<int>> x) {
	n = x.size();
	m = x[0].size();
	l.resize(n, 0);
	r.resize(n, m - 1);
	sg.resize(n, vector<int>(m, 0));
	ans.resize(n, vector<int>(m, -1));
	for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < k; j++)
        {
            sg[i][j] = -1;
            int s, p;
            s = x[i][j];
            p = x[i][m - k + j];
            prio.insert(make_pair(-s - p, make_pair(i, j)));
            res -= s;
        }
    }
    int cnt = 0;
    for (auto it = prio.begin(); cnt < n * k / 2; cnt++, it++)
    {
        auto v = *it;
        res -= v.first;
        auto pos = v.second;
        sg[pos.first][pos.second] = 0;
        sg[pos.first][m - k + pos.second] = 1;
    }
    for (int t = 0; t < k; t++)
    {
        int plus = 0;
        for (int i = 0; i < n; i++)
        {
            if (sg[i][l[i]] != -1)
            {
                plus++;
            }
        }
        for (int i = 0; i < n; i++)
        {
            if (sg[i][l[i]] != -1)
            {
                ans[i][r[i]] = t;
                //res += x[i][r[i]];
                r[i]--;
            }
            else if (sg[i][r[i]] != 1)
            {
                ans[i][l[i]] = t;
                //res -= x[i][l[i]];
                l[i]++;
            }
            else
            {
                if (plus < n / 2)
                {
                    plus++;
                    ans[i][r[i]] = t;
                    //res += x[i][r[i]];
                    r[i]--;
                }
                else
                {
                    ans[i][l[i]] = t;
                    //res -= x[i][l[i]];
                    l[i]++;
                }
            }
        }
    }
    allocate_tickets(ans);
	return res;
}

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 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 852 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 468 KB Output is correct
5 Correct 21 ms 2680 KB Output is correct
6 Correct 591 ms 60312 KB Output is correct

Subtask #3
0 / 14.0

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

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 3 ms 852 KB Output is correct
5 Correct 53 ms 8292 KB Output is correct
6 Correct 6 ms 1600 KB Output is correct
7 Correct 8 ms 1876 KB Output is correct
8 Execution timed out 3036 ms 203936 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 3 ms 468 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 596 KB Output is correct
6 Correct 3 ms 724 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 2 ms 724 KB Output is correct
10 Correct 3 ms 724 KB Output is correct
11 Correct 3 ms 852 KB Output is correct
12 Correct 3 ms 852 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 3 ms 468 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 596 KB Output is correct
6 Correct 3 ms 724 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 2 ms 724 KB Output is correct
10 Correct 3 ms 724 KB Output is correct
11 Correct 3 ms 852 KB Output is correct
12 Correct 3 ms 852 KB Output is correct
13 Correct 21 ms 3648 KB Output is correct
14 Correct 21 ms 3764 KB Output is correct
15 Correct 32 ms 6420 KB Output is correct
16 Correct 49 ms 9292 KB Output is correct
17 Correct 1 ms 308 KB Output is correct
18 Correct 3 ms 724 KB Output is correct
19 Correct 2 ms 468 KB Output is correct
20 Correct 40 ms 6756 KB Output is correct
21 Correct 37 ms 7152 KB Output is correct
22 Correct 43 ms 8268 KB Output is correct
23 Correct 46 ms 8564 KB Output is correct

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 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 852 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 468 KB Output is correct
11 Correct 21 ms 2680 KB Output is correct
12 Correct 591 ms 60312 KB Output is correct
13 Incorrect 0 ms 212 KB Contestant returned 4 but the tickets gives a total value of 6
14 Halted 0 ms 0 KB -