oj.uz

Submission #319793

# Submission time Handle Problem Language Result Execution time Memory
319793 2020-11-06T12:45:12 Z akobi Carnival Tickets (IOI20_tickets) C++14
100 / 100
 1058 ms 57704 KB 
#include "tickets.h"
#include<bits/stdc++.h>
#define ll long long
#define F first
#define S second
#define pb push_back
#define mp make_pair
using namespace std;
ll n,m,anss,c,cc;
vector< vector<int> > ans;
vector<int> temp;
vector<ll> fix;
set< pair<ll,ll> >s;
pair<ll,ll> t;
ll find_maximum(int k, vector< vector<int> > x)
{
	n=x.size();
	m=x[0].size();
    for (int i=0; i<m; i++)
        temp.pb(-1);
    for (int i=0; i<n; i++)
        ans.pb(temp);
    for (int i=0; i<n; i++)
        fix.pb(0);
    for (int i=0; i<n; i++)
    {
        for (int j=m-k; j<m; j++)
            anss+=x[i][j];
        s.insert( mp( x[i][0]+x[i][m-k] , i) );
    }
    for (int c=0; c<k*n/2; c++)
    {
        t=*s.begin();
        s.erase(*s.begin());
        anss-=t.F;
        fix[t.S]++;
        if (fix[t.S]<k)
            s.insert( mp( x[t.S][fix[t.S]] + x[t.S][m-k+fix[t.S]]   , t.S ) );
    }
    for (int i=0; i<n; i++)
    {
        for (int j=0; j<fix[i]; j++)
        {
            ans[i][j]=c;
            c++;
            c%=k;
        }
        cc=c;
        for (int j=m-k+fix[i]; j<m; j++)
        {
            ans[i][j]=cc;
            cc++;
            cc%=k;
        }
    }
    allocate_tickets(ans);
    return anss;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 2 ms 748 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 3 ms 492 KB Output is correct
5 Correct 28 ms 3428 KB Output is correct
6 Correct 671 ms 53344 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 3 ms 492 KB Output is correct
5 Correct 28 ms 2788 KB Output is correct
6 Correct 643 ms 56760 KB Output is correct
7 Correct 673 ms 57144 KB Output is correct
8 Correct 4 ms 620 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 9 ms 908 KB Output is correct
13 Correct 23 ms 2276 KB Output is correct
14 Correct 29 ms 2284 KB Output is correct
15 Correct 762 ms 57704 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 3 ms 492 KB Output is correct
5 Correct 40 ms 3428 KB Output is correct
6 Correct 6 ms 868 KB Output is correct
7 Correct 8 ms 1132 KB Output is correct
8 Correct 1024 ms 56056 KB Output is correct
9 Correct 923 ms 52320 KB Output is correct
10 Correct 925 ms 52452 KB Output is correct
11 Correct 992 ms 56044 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 3 ms 492 KB Output is correct
3 Correct 3 ms 492 KB Output is correct
4 Correct 3 ms 492 KB Output is correct
5 Correct 4 ms 492 KB Output is correct
6 Correct 3 ms 492 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 2 ms 364 KB Output is correct
9 Correct 3 ms 492 KB Output is correct
10 Correct 4 ms 484 KB Output is correct
11 Correct 3 ms 492 KB Output is correct
12 Correct 4 ms 492 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 3 ms 492 KB Output is correct
3 Correct 3 ms 492 KB Output is correct
4 Correct 3 ms 492 KB Output is correct
5 Correct 4 ms 492 KB Output is correct
6 Correct 3 ms 492 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 2 ms 364 KB Output is correct
9 Correct 3 ms 492 KB Output is correct
10 Correct 4 ms 484 KB Output is correct
11 Correct 3 ms 492 KB Output is correct
12 Correct 4 ms 492 KB Output is correct
13 Correct 29 ms 3300 KB Output is correct
14 Correct 30 ms 3308 KB Output is correct
15 Correct 38 ms 3436 KB Output is correct
16 Correct 48 ms 3428 KB Output is correct
17 Correct 2 ms 364 KB Output is correct
18 Correct 4 ms 620 KB Output is correct
19 Correct 2 ms 492 KB Output is correct
20 Correct 47 ms 2660 KB Output is correct
21 Correct 34 ms 3428 KB Output is correct
22 Correct 34 ms 2796 KB Output is correct
23 Correct 40 ms 3300 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 2 ms 748 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 3 ms 492 KB Output is correct
11 Correct 28 ms 3428 KB Output is correct
12 Correct 671 ms 53344 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 3 ms 492 KB Output is correct
17 Correct 28 ms 2788 KB Output is correct
18 Correct 643 ms 56760 KB Output is correct
19 Correct 673 ms 57144 KB Output is correct
20 Correct 4 ms 620 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 9 ms 908 KB Output is correct
25 Correct 23 ms 2276 KB Output is correct
26 Correct 29 ms 2284 KB Output is correct
27 Correct 762 ms 57704 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 3 ms 492 KB Output is correct
32 Correct 40 ms 3428 KB Output is correct
33 Correct 6 ms 868 KB Output is correct
34 Correct 8 ms 1132 KB Output is correct
35 Correct 1024 ms 56056 KB Output is correct
36 Correct 923 ms 52320 KB Output is correct
37 Correct 925 ms 52452 KB Output is correct
38 Correct 992 ms 56044 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 3 ms 492 KB Output is correct
41 Correct 3 ms 492 KB Output is correct
42 Correct 3 ms 492 KB Output is correct
43 Correct 4 ms 492 KB Output is correct
44 Correct 3 ms 492 KB Output is correct
45 Correct 1 ms 364 KB Output is correct
46 Correct 2 ms 364 KB Output is correct
47 Correct 3 ms 492 KB Output is correct
48 Correct 4 ms 484 KB Output is correct
49 Correct 3 ms 492 KB Output is correct
50 Correct 4 ms 492 KB Output is correct
51 Correct 29 ms 3300 KB Output is correct
52 Correct 30 ms 3308 KB Output is correct
53 Correct 38 ms 3436 KB Output is correct
54 Correct 48 ms 3428 KB Output is correct
55 Correct 2 ms 364 KB Output is correct
56 Correct 4 ms 620 KB Output is correct
57 Correct 2 ms 492 KB Output is correct
58 Correct 47 ms 2660 KB Output is correct
59 Correct 34 ms 3428 KB Output is correct
60 Correct 34 ms 2796 KB Output is correct
61 Correct 40 ms 3300 KB Output is correct
62 Correct 82 ms 8676 KB Output is correct
63 Correct 81 ms 8696 KB Output is correct
64 Correct 107 ms 8676 KB Output is correct
65 Correct 382 ms 27348 KB Output is correct
66 Correct 449 ms 27960 KB Output is correct
67 Correct 8 ms 1132 KB Output is correct
68 Correct 6 ms 876 KB Output is correct
69 Correct 680 ms 53268 KB Output is correct
70 Correct 851 ms 54372 KB Output is correct
71 Correct 1058 ms 56068 KB Output is correct
72 Correct 796 ms 56292 KB Output is correct
73 Correct 920 ms 53988 KB Output is correct
74 Correct 716 ms 54968 KB Output is correct
75 Correct 815 ms 52708 KB Output is correct