oj.uz

Submission #307536

# Submission time Handle Problem Language Result Execution time Memory
307536 2020-09-28T14:26:40 Z nicolaalexandra Carnival Tickets (IOI20_tickets) C++14
100 / 100
 1016 ms 54392 KB 
#include <bits/stdc++.h>
#include "tickets.h"
#define DIM 2000
#define INF 2000000000000000000LL
using namespace std;

int n,m;
priority_queue <pair<long long,int> > h;
pair <int,int> poz[DIM],v[DIM];

long long find_maximum (int k, vector<vector<int> > x){
    n = x.size(), m = x[0].size();
    int i,j;
    vector <vector<int> > ans;
    ans.resize(n);
    for (i=0;i<n;i++){
        ans[i].resize(m,-1);
        poz[i] = make_pair (k-1,m-1);
    }

    long long sum = 0;

    /// le pun de la inceput pe primele k cu minus
    for (i=0;i<n;i++)
        for (j=0;j<k;j++){
            sum -= x[i][j];
            //ans[i][j] = j;
        }

    /// vreau sa fac jumatate din minus in plus

    for (i=0;i<n;i++)
        h.push (make_pair(x[i][poz[i].first] + x[i][poz[i].second],i));

    for (i=1;i<=n*k/2;i++){

        sum += h.top().first;
        int idx = h.top().second;
        h.pop();

        poz[idx].first--, poz[idx].second--;
        if (poz[idx].first >= 0)
            h.push (make_pair(x[idx][poz[idx].first] + x[idx][poz[idx].second], idx));

    }

    for (i=0;i<n;i++)
        poz[i].second++;

    for (i=0;i<k;i++){
        /// sortez liniile dupa ultimul element
        for (j=0;j<n;j++)
            v[j] = make_pair (poz[j].first,j);

        sort (v,v+n);

        for (j=0;j<n;j++){
            int idx = v[j].second;
            if (j >= n/2){
                ans[idx][poz[idx].first] = i;
                poz[idx].first--;
            } else {
                ans[idx][poz[idx].second] = i;
                poz[idx].second++;
            }
        }

    }

    allocate_tickets(ans);

    return sum;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 768 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 288 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 31 ms 2432 KB Output is correct
6 Correct 748 ms 51448 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 26 ms 2424 KB Output is correct
6 Correct 656 ms 52472 KB Output is correct
7 Correct 681 ms 53112 KB Output is correct
8 Correct 4 ms 512 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 7 ms 896 KB Output is correct
13 Correct 23 ms 2044 KB Output is correct
14 Correct 23 ms 2048 KB Output is correct
15 Correct 709 ms 53368 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 38 ms 2424 KB Output is correct
6 Correct 6 ms 640 KB Output is correct
7 Correct 8 ms 896 KB Output is correct
8 Correct 967 ms 54300 KB Output is correct
9 Correct 941 ms 50652 KB Output is correct
10 Correct 932 ms 50808 KB Output is correct
11 Correct 1016 ms 54392 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 3 ms 512 KB Output is correct
3 Correct 4 ms 512 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 3 ms 512 KB Output is correct
6 Correct 3 ms 512 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 3 ms 512 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 3 ms 512 KB Output is correct
12 Correct 4 ms 512 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 3 ms 512 KB Output is correct
3 Correct 4 ms 512 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 3 ms 512 KB Output is correct
6 Correct 3 ms 512 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 3 ms 512 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 3 ms 512 KB Output is correct
12 Correct 4 ms 512 KB Output is correct
13 Correct 31 ms 2432 KB Output is correct
14 Correct 31 ms 2424 KB Output is correct
15 Correct 35 ms 2424 KB Output is correct
16 Correct 38 ms 2424 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 4 ms 512 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 30 ms 2424 KB Output is correct
21 Correct 36 ms 2424 KB Output is correct
22 Correct 35 ms 2344 KB Output is correct
23 Correct 37 ms 2424 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 768 KB Output is correct
7 Correct 1 ms 288 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 31 ms 2432 KB Output is correct
12 Correct 748 ms 51448 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 2 ms 512 KB Output is correct
17 Correct 26 ms 2424 KB Output is correct
18 Correct 656 ms 52472 KB Output is correct
19 Correct 681 ms 53112 KB Output is correct
20 Correct 4 ms 512 KB Output is correct
21 Correct 0 ms 256 KB Output is correct
22 Correct 1 ms 256 KB Output is correct
23 Correct 1 ms 256 KB Output is correct
24 Correct 7 ms 896 KB Output is correct
25 Correct 23 ms 2044 KB Output is correct
26 Correct 23 ms 2048 KB Output is correct
27 Correct 709 ms 53368 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 0 ms 256 KB Output is correct
30 Correct 1 ms 256 KB Output is correct
31 Correct 3 ms 512 KB Output is correct
32 Correct 38 ms 2424 KB Output is correct
33 Correct 6 ms 640 KB Output is correct
34 Correct 8 ms 896 KB Output is correct
35 Correct 967 ms 54300 KB Output is correct
36 Correct 941 ms 50652 KB Output is correct
37 Correct 932 ms 50808 KB Output is correct
38 Correct 1016 ms 54392 KB Output is correct
39 Correct 0 ms 256 KB Output is correct
40 Correct 3 ms 512 KB Output is correct
41 Correct 4 ms 512 KB Output is correct
42 Correct 3 ms 512 KB Output is correct
43 Correct 3 ms 512 KB Output is correct
44 Correct 3 ms 512 KB Output is correct
45 Correct 1 ms 384 KB Output is correct
46 Correct 1 ms 384 KB Output is correct
47 Correct 3 ms 512 KB Output is correct
48 Correct 3 ms 512 KB Output is correct
49 Correct 3 ms 512 KB Output is correct
50 Correct 4 ms 512 KB Output is correct
51 Correct 31 ms 2432 KB Output is correct
52 Correct 31 ms 2424 KB Output is correct
53 Correct 35 ms 2424 KB Output is correct
54 Correct 38 ms 2424 KB Output is correct
55 Correct 1 ms 384 KB Output is correct
56 Correct 4 ms 512 KB Output is correct
57 Correct 2 ms 384 KB Output is correct
58 Correct 30 ms 2424 KB Output is correct
59 Correct 36 ms 2424 KB Output is correct
60 Correct 35 ms 2344 KB Output is correct
61 Correct 37 ms 2424 KB Output is correct
62 Correct 84 ms 6008 KB Output is correct
63 Correct 90 ms 6008 KB Output is correct
64 Correct 107 ms 6264 KB Output is correct
65 Correct 378 ms 23800 KB Output is correct
66 Correct 419 ms 24056 KB Output is correct
67 Correct 8 ms 896 KB Output is correct
68 Correct 6 ms 640 KB Output is correct
69 Correct 753 ms 51704 KB Output is correct
70 Correct 857 ms 52472 KB Output is correct
71 Correct 964 ms 54372 KB Output is correct
72 Correct 811 ms 52476 KB Output is correct
73 Correct 964 ms 52320 KB Output is correct
74 Correct 721 ms 50808 KB Output is correct
75 Correct 852 ms 50828 KB Output is correct