oj.uz

Submission #930885

# Submission time Handle Problem Language Result Execution time Memory
930885 2024-02-20T15:05:41 Z velislavgarkov Carnival Tickets (IOI20_tickets) C++14
76 / 100
 632 ms 88440 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][j]=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 0 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 4700 KB Output is correct
5 Correct 1 ms 4652 KB Output is correct
6 Correct 2 ms 5464 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 2392 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 2 ms 4700 KB Output is correct
5 Correct 18 ms 7396 KB Output is correct
6 Correct 425 ms 73576 KB Output is correct

Subtask #3
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 Incorrect 2 ms 4780 KB Contestant returned 1521 but the tickets gives a total value of 1600
5 Halted 0 ms 0 KB -

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 2 ms 4952 KB Output is correct
5 Correct 23 ms 8028 KB Output is correct
6 Correct 4 ms 2908 KB Output is correct
7 Correct 5 ms 5724 KB Output is correct
8 Correct 580 ms 88440 KB Output is correct
9 Correct 607 ms 83608 KB Output is correct
10 Correct 583 ms 83140 KB Output is correct
11 Correct 632 ms 88400 KB Output is correct

Subtask #5
12.0 / 12.0

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

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 2 ms 4700 KB Output is correct
3 Correct 2 ms 4700 KB Output is correct
4 Correct 2 ms 4700 KB Output is correct
5 Correct 3 ms 4700 KB Output is correct
6 Correct 2 ms 4880 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 4700 KB Output is correct
9 Correct 2 ms 4696 KB Output is correct
10 Correct 2 ms 4700 KB Output is correct
11 Correct 2 ms 4700 KB Output is correct
12 Correct 3 ms 4700 KB Output is correct
13 Correct 18 ms 7516 KB Output is correct
14 Correct 18 ms 7512 KB Output is correct
15 Correct 21 ms 7772 KB Output is correct
16 Correct 24 ms 8024 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 3 ms 4888 KB Output is correct
19 Correct 2 ms 4700 KB Output is correct
20 Correct 19 ms 7672 KB Output is correct
21 Correct 20 ms 7516 KB Output is correct
22 Correct 25 ms 7768 KB Output is correct
23 Correct 24 ms 7880 KB Output is correct

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 4700 KB Output is correct
5 Correct 1 ms 4652 KB Output is correct
6 Correct 2 ms 5464 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 2 ms 4700 KB Output is correct
11 Correct 18 ms 7396 KB Output is correct
12 Correct 425 ms 73576 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Incorrect 2 ms 4780 KB Contestant returned 1521 but the tickets gives a total value of 1600
17 Halted 0 ms 0 KB -