oj.uz

Submission #428884

# Submission time Handle Problem Language Result Execution time Memory
428884 2021-06-15T15:13:27 Z davi_bart Carnival Tickets (IOI20_tickets) C++17
100 / 100
 1071 ms 154644 KB 
#include "tickets.h"
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int ll
#define fi first
#define se second
#define ld long double
#define pb push_back
vector<std::vector<signed>> ans;
bool vis[2000][2000];
int presi[2000];
int N,M;
vector<int> x[2000],y[2000];
vector<int> start(2001);



vector<int> v[2000];
int val[2000][2000];

long long find_maximum(signed k, std::vector<std::vector<signed>> z) {
	N = z.size();
	M = z[0].size();


    int tot=0;
    vector<pair<int,int> > p;
    for(int i=0;i<N;i++){
        for(int j=0;j<M;j++){
            v[i].pb(j);
        }
        sort(v[i].begin(),v[i].end(),[&](int a,int b){
            return z[i][a]>z[i][b];
        });
        int s=0;
        for(int j=0;j<k;j++)s+=z[i][v[i][j]];
        val[i][k]=s;
        tot+=s;
        for(int j=0;j<k;j++){
            s=s-z[i][v[i][k-j-1]]-z[i][v[i][v[i].size()-j-1]];
            val[i][k-j-1]=s;
        }
        for(int j=k;j>0;j--)p.pb({val[i][j]-val[i][j-1],i});
        presi[i]=k;
    }

    sort(p.begin(),p.end());
    for(int i=0;i<N*k/2;i++){
        tot-=p[i].fi;
        presi[p[i].se]--;
    }

    for(int i=0;i<N;i++){
        //cout<<"ciao: "<<i<<" "<<presi[i]<<endl;
        for(int j=0;j<presi[i];j++)x[i].pb(v[i][j]);
        for(int j=M-1;j>=M-(k-presi[i]);j--)y[i].pb(v[i][j]);
    }


	for (int i=0;i<N;i++) {
		vector<signed> row(M,-1);
        ans.pb(row);
	}

    int pos=0;
    for(int i=0;i<N;i++){
        start[i]=pos;
        for(int j=0;j<x[i].size();j++){
            ans[i][x[i][j]]=pos;
            pos=(pos+1)%k;
        }
    }
    for(int i=0;i<N;i++){
        pos=(start[i]-1+k)%k;
        for(int j=0;j<y[i].size();j++){
            ans[i][y[i][j]]=pos;
            pos=(pos-1+k)%k;
        }
    }

	allocate_tickets(ans);
	return tot;
}

Compilation message

tickets.cpp: In function 'long long int find_maximum(int, std::vector<std::vector<int> >)':
tickets.cpp:70:22: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   70 |         for(int j=0;j<x[i].size();j++){
      |                     ~^~~~~~~~~~~~
tickets.cpp:77:22: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   77 |         for(int j=0;j<y[i].size();j++){
      |                     ~^~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 1 ms 716 KB Output is correct
5 Correct 2 ms 1740 KB Output is correct
6 Correct 5 ms 6988 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 3 ms 972 KB Output is correct
5 Correct 34 ms 5732 KB Output is correct
6 Correct 698 ms 84256 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 3 ms 1100 KB Output is correct
5 Correct 29 ms 6464 KB Output is correct
6 Correct 726 ms 115104 KB Output is correct
7 Correct 761 ms 129764 KB Output is correct
8 Correct 4 ms 1440 KB Output is correct
9 Correct 1 ms 460 KB Output is correct
10 Correct 1 ms 460 KB Output is correct
11 Correct 1 ms 460 KB Output is correct
12 Correct 8 ms 2412 KB Output is correct
13 Correct 27 ms 6876 KB Output is correct
14 Correct 25 ms 5520 KB Output is correct
15 Correct 752 ms 137420 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 4 ms 1228 KB Output is correct
5 Correct 42 ms 8788 KB Output is correct
6 Correct 7 ms 1608 KB Output is correct
7 Correct 12 ms 8016 KB Output is correct
8 Correct 1057 ms 154392 KB Output is correct
9 Correct 951 ms 148128 KB Output is correct
10 Correct 960 ms 145556 KB Output is correct
11 Correct 1020 ms 154644 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 3 ms 972 KB Output is correct
3 Correct 3 ms 1100 KB Output is correct
4 Correct 3 ms 1124 KB Output is correct
5 Correct 3 ms 1100 KB Output is correct
6 Correct 4 ms 1228 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 1 ms 844 KB Output is correct
9 Correct 3 ms 1100 KB Output is correct
10 Correct 3 ms 1228 KB Output is correct
11 Correct 3 ms 1228 KB Output is correct
12 Correct 3 ms 1164 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 3 ms 972 KB Output is correct
3 Correct 3 ms 1100 KB Output is correct
4 Correct 3 ms 1124 KB Output is correct
5 Correct 3 ms 1100 KB Output is correct
6 Correct 4 ms 1228 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 1 ms 844 KB Output is correct
9 Correct 3 ms 1100 KB Output is correct
10 Correct 3 ms 1228 KB Output is correct
11 Correct 3 ms 1228 KB Output is correct
12 Correct 3 ms 1164 KB Output is correct
13 Correct 30 ms 5784 KB Output is correct
14 Correct 30 ms 5908 KB Output is correct
15 Correct 36 ms 7216 KB Output is correct
16 Correct 41 ms 8872 KB Output is correct
17 Correct 2 ms 588 KB Output is correct
18 Correct 4 ms 1996 KB Output is correct
19 Correct 3 ms 1868 KB Output is correct
20 Correct 35 ms 6972 KB Output is correct
21 Correct 36 ms 7376 KB Output is correct
22 Correct 40 ms 7836 KB Output is correct
23 Correct 39 ms 8240 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 1 ms 716 KB Output is correct
5 Correct 2 ms 1740 KB Output is correct
6 Correct 5 ms 6988 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 1 ms 460 KB Output is correct
10 Correct 3 ms 972 KB Output is correct
11 Correct 34 ms 5732 KB Output is correct
12 Correct 698 ms 84256 KB Output is correct
13 Correct 1 ms 460 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 3 ms 1100 KB Output is correct
17 Correct 29 ms 6464 KB Output is correct
18 Correct 726 ms 115104 KB Output is correct
19 Correct 761 ms 129764 KB Output is correct
20 Correct 4 ms 1440 KB Output is correct
21 Correct 1 ms 460 KB Output is correct
22 Correct 1 ms 460 KB Output is correct
23 Correct 1 ms 460 KB Output is correct
24 Correct 8 ms 2412 KB Output is correct
25 Correct 27 ms 6876 KB Output is correct
26 Correct 25 ms 5520 KB Output is correct
27 Correct 752 ms 137420 KB Output is correct
28 Correct 1 ms 460 KB Output is correct
29 Correct 1 ms 460 KB Output is correct
30 Correct 1 ms 460 KB Output is correct
31 Correct 4 ms 1228 KB Output is correct
32 Correct 42 ms 8788 KB Output is correct
33 Correct 7 ms 1608 KB Output is correct
34 Correct 12 ms 8016 KB Output is correct
35 Correct 1057 ms 154392 KB Output is correct
36 Correct 951 ms 148128 KB Output is correct
37 Correct 960 ms 145556 KB Output is correct
38 Correct 1020 ms 154644 KB Output is correct
39 Correct 1 ms 460 KB Output is correct
40 Correct 3 ms 972 KB Output is correct
41 Correct 3 ms 1100 KB Output is correct
42 Correct 3 ms 1124 KB Output is correct
43 Correct 3 ms 1100 KB Output is correct
44 Correct 4 ms 1228 KB Output is correct
45 Correct 1 ms 460 KB Output is correct
46 Correct 1 ms 844 KB Output is correct
47 Correct 3 ms 1100 KB Output is correct
48 Correct 3 ms 1228 KB Output is correct
49 Correct 3 ms 1228 KB Output is correct
50 Correct 3 ms 1164 KB Output is correct
51 Correct 30 ms 5784 KB Output is correct
52 Correct 30 ms 5908 KB Output is correct
53 Correct 36 ms 7216 KB Output is correct
54 Correct 41 ms 8872 KB Output is correct
55 Correct 2 ms 588 KB Output is correct
56 Correct 4 ms 1996 KB Output is correct
57 Correct 3 ms 1868 KB Output is correct
58 Correct 35 ms 6972 KB Output is correct
59 Correct 36 ms 7376 KB Output is correct
60 Correct 40 ms 7836 KB Output is correct
61 Correct 39 ms 8240 KB Output is correct
62 Correct 87 ms 12608 KB Output is correct
63 Correct 83 ms 12540 KB Output is correct
64 Correct 150 ms 20116 KB Output is correct
65 Correct 391 ms 55916 KB Output is correct
66 Correct 445 ms 72312 KB Output is correct
67 Correct 12 ms 8000 KB Output is correct
68 Correct 7 ms 1608 KB Output is correct
69 Correct 738 ms 84240 KB Output is correct
70 Correct 861 ms 112848 KB Output is correct
71 Correct 1071 ms 151148 KB Output is correct
72 Correct 1002 ms 145316 KB Output is correct
73 Correct 1008 ms 142776 KB Output is correct
74 Correct 824 ms 112736 KB Output is correct
75 Correct 880 ms 111332 KB Output is correct