oj.uz

Submission #416051

# Submission time Handle Problem Language Result Execution time Memory
416051 2021-06-01T21:03:38 Z duality Carnival Tickets (IOI20_tickets) C++14
100 / 100
 804 ms 76160 KB 
#define DEBUG 0

#include <bits/stdc++.h>
using namespace std;

#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}

// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
    public:
        template<typename T>
        _Debug& operator,(T val) {
            cout << val << endl;
            return *this;
        }
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif

// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back

// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;

// ---------- END OF TEMPLATE ----------
#include "tickets.h"

int a[1500];
priority_queue<pii> H;
long long int find_maximum(int k,vector<vector<int> > x) {
    int i,j,n = x.size(),m = x[0].size();
    LLI sum = 0;
    for (i = 0; i < n; i++) {
        for (j = 0; j < k; j++) sum -= x[i][j];
        H.push(mp(x[i][m-1]+x[i][k-1],i));
    }
    for (i = 0; i < n*k/2; i++) {
        sum += H.top().first;
        int u = H.top().second;
        H.pop(),a[u]++;
        if (a[u] < k) H.push(mp(x[u][m-a[u]-1]+x[u][k-a[u]-1],u));
    }
    int p = 0;
    vector<vi> ans(n,vi(m,-1));
    for (i = 0; i < n; i++) {
        for (j = 0; j < a[i]; j++) ans[i][m-j-1] = p,p = (p+1) % k;
        int q = p;
        for (j = 0; j < k-a[i]; j++) ans[i][j] = q,q = (q+1) % k;
    }
    allocate_tickets(ans);
    return sum;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 296 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 2 ms 716 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 3 ms 496 KB Output is correct
5 Correct 28 ms 3116 KB Output is correct
6 Correct 632 ms 73128 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 3 ms 460 KB Output is correct
5 Correct 24 ms 2524 KB Output is correct
6 Correct 573 ms 56712 KB Output is correct
7 Correct 609 ms 57076 KB Output is correct
8 Correct 4 ms 460 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 7 ms 844 KB Output is correct
13 Correct 21 ms 2140 KB Output is correct
14 Correct 21 ms 2076 KB Output is correct
15 Correct 621 ms 57700 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 3 ms 460 KB Output is correct
5 Correct 32 ms 3268 KB Output is correct
6 Correct 6 ms 696 KB Output is correct
7 Correct 8 ms 972 KB Output is correct
8 Correct 804 ms 76020 KB Output is correct
9 Correct 745 ms 70888 KB Output is correct
10 Correct 737 ms 71124 KB Output is correct
11 Correct 800 ms 76160 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 3 ms 460 KB Output is correct
3 Correct 3 ms 460 KB Output is correct
4 Correct 3 ms 460 KB Output is correct
5 Correct 3 ms 472 KB Output is correct
6 Correct 4 ms 440 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 3 ms 460 KB Output is correct
10 Correct 3 ms 460 KB Output is correct
11 Correct 3 ms 460 KB Output is correct
12 Correct 3 ms 444 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 3 ms 460 KB Output is correct
3 Correct 3 ms 460 KB Output is correct
4 Correct 3 ms 460 KB Output is correct
5 Correct 3 ms 472 KB Output is correct
6 Correct 4 ms 440 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 3 ms 460 KB Output is correct
10 Correct 3 ms 460 KB Output is correct
11 Correct 3 ms 460 KB Output is correct
12 Correct 3 ms 444 KB Output is correct
13 Correct 26 ms 3220 KB Output is correct
14 Correct 29 ms 3220 KB Output is correct
15 Correct 29 ms 3216 KB Output is correct
16 Correct 33 ms 3268 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 3 ms 460 KB Output is correct
19 Correct 2 ms 332 KB Output is correct
20 Correct 26 ms 2616 KB Output is correct
21 Correct 30 ms 3172 KB Output is correct
22 Correct 27 ms 2628 KB Output is correct
23 Correct 31 ms 3140 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 296 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 2 ms 716 KB Output is correct
7 Correct 2 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 3 ms 496 KB Output is correct
11 Correct 28 ms 3116 KB Output is correct
12 Correct 632 ms 73128 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 3 ms 460 KB Output is correct
17 Correct 24 ms 2524 KB Output is correct
18 Correct 573 ms 56712 KB Output is correct
19 Correct 609 ms 57076 KB Output is correct
20 Correct 4 ms 460 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 7 ms 844 KB Output is correct
25 Correct 21 ms 2140 KB Output is correct
26 Correct 21 ms 2076 KB Output is correct
27 Correct 621 ms 57700 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 3 ms 460 KB Output is correct
32 Correct 32 ms 3268 KB Output is correct
33 Correct 6 ms 696 KB Output is correct
34 Correct 8 ms 972 KB Output is correct
35 Correct 804 ms 76020 KB Output is correct
36 Correct 745 ms 70888 KB Output is correct
37 Correct 737 ms 71124 KB Output is correct
38 Correct 800 ms 76160 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 3 ms 460 KB Output is correct
41 Correct 3 ms 460 KB Output is correct
42 Correct 3 ms 460 KB Output is correct
43 Correct 3 ms 472 KB Output is correct
44 Correct 4 ms 440 KB Output is correct
45 Correct 1 ms 204 KB Output is correct
46 Correct 1 ms 332 KB Output is correct
47 Correct 3 ms 460 KB Output is correct
48 Correct 3 ms 460 KB Output is correct
49 Correct 3 ms 460 KB Output is correct
50 Correct 3 ms 444 KB Output is correct
51 Correct 26 ms 3220 KB Output is correct
52 Correct 29 ms 3220 KB Output is correct
53 Correct 29 ms 3216 KB Output is correct
54 Correct 33 ms 3268 KB Output is correct
55 Correct 2 ms 332 KB Output is correct
56 Correct 3 ms 460 KB Output is correct
57 Correct 2 ms 332 KB Output is correct
58 Correct 26 ms 2616 KB Output is correct
59 Correct 30 ms 3172 KB Output is correct
60 Correct 27 ms 2628 KB Output is correct
61 Correct 31 ms 3140 KB Output is correct
62 Correct 74 ms 8340 KB Output is correct
63 Correct 75 ms 8388 KB Output is correct
64 Correct 86 ms 8540 KB Output is correct
65 Correct 316 ms 33220 KB Output is correct
66 Correct 348 ms 33700 KB Output is correct
67 Correct 7 ms 880 KB Output is correct
68 Correct 6 ms 668 KB Output is correct
69 Correct 631 ms 73260 KB Output is correct
70 Correct 718 ms 74124 KB Output is correct
71 Correct 800 ms 75992 KB Output is correct
72 Correct 642 ms 60568 KB Output is correct
73 Correct 763 ms 73260 KB Output is correct
74 Correct 596 ms 58968 KB Output is correct
75 Correct 698 ms 71968 KB Output is correct