oj.uz

Submission #318549

# Submission time Handle Problem Language Result Execution time Memory
318549 2020-11-02T10:05:58 Z giorgigagua2006 Carnival Tickets (IOI20_tickets) C++17
100 / 100
 947 ms 54500 KB 
#include<bits/stdc++.h>
#include "tickets.h"
using namespace std;
long long i,j,n,m,res;
long long find_maximum(int k, std::vector<std::vector<int>> x) 
{
	n=x.size();
	m=x[0].size();
    vector<vector<int>>answer(n,vector<int>(m,-1));
    vector<int>v(n,0);
    set<pair<long long,int>>s;
    for(int i=0;i<n;i++)
	{
        for(int j=m-k;j<m;j++)
		res+=x[i][j];
        s.insert({x[i][0]+x[i][m-k],i});
    }
    for(j=0;j<k*n/2;j++){
        auto p=*s.begin();
        int val=p.first;
        i=p.second;
        res-=val;
        s.erase(*s.begin());
        v[i]++;
        int a=v[i];
        if(a<k)
		s.insert(make_pair(x[i][a]+x[i][m-k+a],i));
    }
    int r=0;
    for(i=0;i<n;i++)
	{
        for(j=0;j<v[i];j++)
		{
            answer[i][j]=r;
            r++;
            r%=k;
        }
        int rr=r;
        for(j=m-k+v[i];j<m;j++)
		{
            answer[i][j]=rr;
            rr++;
            rr%=k;
        }
    }
    allocate_tickets(answer);
    return res;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 384 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 384 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 2 ms 492 KB Output is correct
5 Correct 27 ms 2412 KB Output is correct
6 Correct 628 ms 51504 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 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 24 ms 2412 KB Output is correct
6 Correct 613 ms 52452 KB Output is correct
7 Correct 644 ms 52860 KB Output is correct
8 Correct 4 ms 492 KB Output is correct
9 Correct 0 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 0 ms 364 KB Output is correct
12 Correct 7 ms 1004 KB Output is correct
13 Correct 22 ms 2156 KB Output is correct
14 Correct 23 ms 2156 KB Output is correct
15 Correct 654 ms 53604 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 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 3 ms 492 KB Output is correct
5 Correct 36 ms 2552 KB Output is correct
6 Correct 6 ms 620 KB Output is correct
7 Correct 8 ms 1004 KB Output is correct
8 Correct 947 ms 54372 KB Output is correct
9 Correct 877 ms 50788 KB Output is correct
10 Correct 857 ms 50916 KB Output is correct
11 Correct 916 ms 54372 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 2 ms 492 KB Output is correct
3 Correct 2 ms 492 KB Output is correct
4 Correct 3 ms 492 KB Output is correct
5 Correct 3 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 1 ms 364 KB Output is correct
9 Correct 3 ms 492 KB Output is correct
10 Correct 3 ms 492 KB Output is correct
11 Correct 4 ms 492 KB Output is correct
12 Correct 3 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 2 ms 492 KB Output is correct
3 Correct 2 ms 492 KB Output is correct
4 Correct 3 ms 492 KB Output is correct
5 Correct 3 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 1 ms 364 KB Output is correct
9 Correct 3 ms 492 KB Output is correct
10 Correct 3 ms 492 KB Output is correct
11 Correct 4 ms 492 KB Output is correct
12 Correct 3 ms 492 KB Output is correct
13 Correct 26 ms 2532 KB Output is correct
14 Correct 30 ms 2404 KB Output is correct
15 Correct 31 ms 2404 KB Output is correct
16 Correct 36 ms 2532 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 3 ms 492 KB Output is correct
19 Correct 2 ms 492 KB Output is correct
20 Correct 29 ms 2404 KB Output is correct
21 Correct 32 ms 2412 KB Output is correct
22 Correct 32 ms 2532 KB Output is correct
23 Correct 34 ms 2404 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 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 384 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 384 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 2 ms 492 KB Output is correct
11 Correct 27 ms 2412 KB Output is correct
12 Correct 628 ms 51504 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 0 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 2 ms 512 KB Output is correct
17 Correct 24 ms 2412 KB Output is correct
18 Correct 613 ms 52452 KB Output is correct
19 Correct 644 ms 52860 KB Output is correct
20 Correct 4 ms 492 KB Output is correct
21 Correct 0 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 0 ms 364 KB Output is correct
24 Correct 7 ms 1004 KB Output is correct
25 Correct 22 ms 2156 KB Output is correct
26 Correct 23 ms 2156 KB Output is correct
27 Correct 654 ms 53604 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 0 ms 364 KB Output is correct
30 Correct 0 ms 364 KB Output is correct
31 Correct 3 ms 492 KB Output is correct
32 Correct 36 ms 2552 KB Output is correct
33 Correct 6 ms 620 KB Output is correct
34 Correct 8 ms 1004 KB Output is correct
35 Correct 947 ms 54372 KB Output is correct
36 Correct 877 ms 50788 KB Output is correct
37 Correct 857 ms 50916 KB Output is correct
38 Correct 916 ms 54372 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 2 ms 492 KB Output is correct
41 Correct 2 ms 492 KB Output is correct
42 Correct 3 ms 492 KB Output is correct
43 Correct 3 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 1 ms 364 KB Output is correct
47 Correct 3 ms 492 KB Output is correct
48 Correct 3 ms 492 KB Output is correct
49 Correct 4 ms 492 KB Output is correct
50 Correct 3 ms 492 KB Output is correct
51 Correct 26 ms 2532 KB Output is correct
52 Correct 30 ms 2404 KB Output is correct
53 Correct 31 ms 2404 KB Output is correct
54 Correct 36 ms 2532 KB Output is correct
55 Correct 1 ms 364 KB Output is correct
56 Correct 3 ms 492 KB Output is correct
57 Correct 2 ms 492 KB Output is correct
58 Correct 29 ms 2404 KB Output is correct
59 Correct 32 ms 2412 KB Output is correct
60 Correct 32 ms 2532 KB Output is correct
61 Correct 34 ms 2404 KB Output is correct
62 Correct 73 ms 6116 KB Output is correct
63 Correct 95 ms 6116 KB Output is correct
64 Correct 101 ms 6244 KB Output is correct
65 Correct 348 ms 23524 KB Output is correct
66 Correct 407 ms 24164 KB Output is correct
67 Correct 8 ms 1004 KB Output is correct
68 Correct 6 ms 620 KB Output is correct
69 Correct 632 ms 51684 KB Output is correct
70 Correct 794 ms 52580 KB Output is correct
71 Correct 937 ms 54500 KB Output is correct
72 Correct 741 ms 52324 KB Output is correct
73 Correct 880 ms 52288 KB Output is correct
74 Correct 663 ms 50916 KB Output is correct
75 Correct 770 ms 50920 KB Output is correct