oj.uz

Submission #930891

# Submission time Handle Problem Language Result Execution time Memory
930891 2024-02-20T15:17:57 Z velislavgarkov Carnival Tickets (IOI20_tickets) C++14
100 / 100
 642 ms 109796 KB 
#include "tickets.h"
#include <iostream>
#include <algorithm>
#include <cstring>
#include <queue>
#include <vector>
using namespace std;
struct Change {
    long long s;
    int col;
    int sm, b;
    bool friend operator < (Change a, Change b) {
        return a.s<b.s;
    }
};
struct Element {
    int x;
    int ind;
    bool friend operator < (Element a, Element b) {
        return a.x<b.x;
    }
};
struct Color {
    int ss;
    int ind;
    bool friend operator < (Color a, Color b) {
        return a.ss<b.ss;
    }
};
const int MAXN=1501;
priority_queue <Change> q;
bool mi[MAXN][MAXN], pl[MAXN][MAXN], positive[MAXN];
vector <vector <int> > res;
vector <vector <Element> > d;
vector <int> pos[MAXN], neg[MAXN];
Color a[MAXN];
int n, m;
long long ans;
long long find_maximum(int k, vector<vector<int> > d1) {
    n=d1.size();
    m=d1[0].size();
    res.resize(n);
    d.resize(n);
    ans=0;
    for (int i=0;i<n;i++) {
        res[i].resize(m);
        d[i].resize(m);
        for (int j=0;j<m;j++) {
            d[i][j].x=d1[i][j];
            d[i][j].ind=j;
        }
        sort(d[i].begin(),d[i].end());
        for (int j=0;j<k;j++) {
            ans-=d[i][j].x;
            mi[i][d[i][j].ind]=true;
        }
        q.push({d[i][m-1].x+d[i][k-1].x,i,k-1,m-1});
    }
    for (int times=0;times<k*n/2;times++) {
        auto t=q.top();
        ans+=t.s;
        mi[t.col][d[t.col][t.sm].ind]=false;
        pl[t.col][d[t.col][t.b].ind]=true;
        q.pop();
        if (t.sm==0) continue;
        q.push({d[t.col][t.sm-1].x+d[t.col][t.b-1].x,t.col,t.sm-1,t.b-1});
    }
    for (int i=0;i<n;i++) {
        for (int j=0;j<m;j++) {
            res[i][j]=-1;
            if (pl[i][j]) pos[i].push_back(j);
            else if (mi[i][j]) neg[i].push_back(j);
        }
    }
    for (int i=0;i<k;i++) {
        memset(positive,false,sizeof(positive));
        for (int j=0;j<n;j++) {
            if (!pos[j].empty()) a[j].ss=-pos[j].size();
            else a[j].ss=0;
            a[j].ind=j;
        }
        sort(a,a+n);
        for (int j=0;j<n/2;j++) {
            int cur=a[j].ind;
            res[cur][pos[cur].back()]=i;
            positive[cur]=true;
            pos[cur].pop_back();
        }
        for (int j=0;j<n;j++) {
            if (positive[j]) continue;
            res[j][neg[j].back()]=i;
            neg[j].pop_back();
        }
    }
    allocate_tickets(res);
    return ans;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 1 ms 4700 KB Output is correct
5 Correct 1 ms 4700 KB Output is correct
6 Correct 2 ms 5468 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 2 ms 4700 KB Output is correct
5 Correct 19 ms 8284 KB Output is correct
6 Correct 449 ms 90260 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 2 ms 4884 KB Output is correct
5 Correct 19 ms 7952 KB Output is correct
6 Correct 458 ms 85012 KB Output is correct
7 Correct 498 ms 88352 KB Output is correct
8 Correct 4 ms 4956 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2648 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 6 ms 5336 KB Output is correct
13 Correct 16 ms 7328 KB Output is correct
14 Correct 16 ms 7512 KB Output is correct
15 Correct 500 ms 90192 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 3 ms 4952 KB Output is correct
5 Correct 27 ms 9052 KB Output is correct
6 Correct 4 ms 3164 KB Output is correct
7 Correct 6 ms 5724 KB Output is correct
8 Correct 628 ms 105232 KB Output is correct
9 Correct 594 ms 99504 KB Output is correct
10 Correct 604 ms 98728 KB Output is correct
11 Correct 642 ms 105348 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 3 ms 4956 KB Output is correct
3 Correct 2 ms 4956 KB Output is correct
4 Correct 3 ms 4956 KB Output is correct
5 Correct 2 ms 4956 KB Output is correct
6 Correct 2 ms 4956 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 4700 KB Output is correct
9 Correct 3 ms 4956 KB Output is correct
10 Correct 3 ms 4956 KB Output is correct
11 Correct 3 ms 4956 KB Output is correct
12 Correct 3 ms 4952 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 3 ms 4956 KB Output is correct
3 Correct 2 ms 4956 KB Output is correct
4 Correct 3 ms 4956 KB Output is correct
5 Correct 2 ms 4956 KB Output is correct
6 Correct 2 ms 4956 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 4700 KB Output is correct
9 Correct 3 ms 4956 KB Output is correct
10 Correct 3 ms 4956 KB Output is correct
11 Correct 3 ms 4956 KB Output is correct
12 Correct 3 ms 4952 KB Output is correct
13 Correct 19 ms 8284 KB Output is correct
14 Correct 21 ms 8160 KB Output is correct
15 Correct 22 ms 8536 KB Output is correct
16 Correct 23 ms 9048 KB Output is correct
17 Correct 1 ms 2652 KB Output is correct
18 Correct 3 ms 4956 KB Output is correct
19 Correct 2 ms 4696 KB Output is correct
20 Correct 19 ms 8020 KB Output is correct
21 Correct 21 ms 8532 KB Output is correct
22 Correct 21 ms 8280 KB Output is correct
23 Correct 22 ms 8540 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 1 ms 4700 KB Output is correct
5 Correct 1 ms 4700 KB Output is correct
6 Correct 2 ms 5468 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 2 ms 4700 KB Output is correct
11 Correct 19 ms 8284 KB Output is correct
12 Correct 449 ms 90260 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 2 ms 4884 KB Output is correct
17 Correct 19 ms 7952 KB Output is correct
18 Correct 458 ms 85012 KB Output is correct
19 Correct 498 ms 88352 KB Output is correct
20 Correct 4 ms 4956 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 1 ms 2648 KB Output is correct
23 Correct 1 ms 2392 KB Output is correct
24 Correct 6 ms 5336 KB Output is correct
25 Correct 16 ms 7328 KB Output is correct
26 Correct 16 ms 7512 KB Output is correct
27 Correct 500 ms 90192 KB Output is correct
28 Correct 1 ms 2396 KB Output is correct
29 Correct 1 ms 2396 KB Output is correct
30 Correct 1 ms 2396 KB Output is correct
31 Correct 3 ms 4952 KB Output is correct
32 Correct 27 ms 9052 KB Output is correct
33 Correct 4 ms 3164 KB Output is correct
34 Correct 6 ms 5724 KB Output is correct
35 Correct 628 ms 105232 KB Output is correct
36 Correct 594 ms 99504 KB Output is correct
37 Correct 604 ms 98728 KB Output is correct
38 Correct 642 ms 105348 KB Output is correct
39 Correct 1 ms 2396 KB Output is correct
40 Correct 3 ms 4956 KB Output is correct
41 Correct 2 ms 4956 KB Output is correct
42 Correct 3 ms 4956 KB Output is correct
43 Correct 2 ms 4956 KB Output is correct
44 Correct 2 ms 4956 KB Output is correct
45 Correct 1 ms 2396 KB Output is correct
46 Correct 1 ms 4700 KB Output is correct
47 Correct 3 ms 4956 KB Output is correct
48 Correct 3 ms 4956 KB Output is correct
49 Correct 3 ms 4956 KB Output is correct
50 Correct 3 ms 4952 KB Output is correct
51 Correct 19 ms 8284 KB Output is correct
52 Correct 21 ms 8160 KB Output is correct
53 Correct 22 ms 8536 KB Output is correct
54 Correct 23 ms 9048 KB Output is correct
55 Correct 1 ms 2652 KB Output is correct
56 Correct 3 ms 4956 KB Output is correct
57 Correct 2 ms 4696 KB Output is correct
58 Correct 19 ms 8020 KB Output is correct
59 Correct 21 ms 8532 KB Output is correct
60 Correct 21 ms 8280 KB Output is correct
61 Correct 22 ms 8540 KB Output is correct
62 Correct 55 ms 14644 KB Output is correct
63 Correct 51 ms 14932 KB Output is correct
64 Correct 63 ms 16168 KB Output is correct
65 Correct 234 ms 47952 KB Output is correct
66 Correct 267 ms 50516 KB Output is correct
67 Correct 6 ms 5720 KB Output is correct
68 Correct 6 ms 3164 KB Output is correct
69 Correct 459 ms 95508 KB Output is correct
70 Correct 534 ms 102448 KB Output is correct
71 Correct 640 ms 109796 KB Output is correct
72 Correct 576 ms 94288 KB Output is correct
73 Correct 611 ms 106572 KB Output is correct
74 Correct 484 ms 86928 KB Output is correct
75 Correct 564 ms 99480 KB Output is correct