oj.uz

Submission #408698

# Submission time Handle Problem Language Result Execution time Memory
408698 2021-05-19T14:00:08 Z mat_v Carnival Tickets (IOI20_tickets) C++14
100 / 100
 881 ms 102712 KB 
#include "tickets.h"

#include <bits/stdc++.h>
#define ff(i,a,b) for(int (i) = (a); (i) <= (b); ++(i))
#define fb(i,a,b) for(int (i) = (a); (i) >= (b); --(i))
#define pii pair<int,int>
#define xx first
#define yy second
#define pb push_back


using namespace std;
typedef long long ll;

pii mat[1505][1505];
int ans[1505][1505];
int kol[1505];
int dole[1505];
int ima[1505];
bool uzo[1505];

long long find_maximum(int k, std::vector<std::vector<int>> x) {
	int n = x.size();
	int m = x[0].size();
	ff(i,0,n - 1){
        ff(j,0,m - 1){
            mat[i + 1][j + 1] = {x[i][j], j+1};
        }
	}
	ff(i,1,n)sort(mat[i] + 1, mat[i] + m + 1);
//	ff(i,1,n){
//        ff(j,1,m){
//            cout << mat[i][j].xx << mat[i][j].yy << " ";
//        }
//        cout << "\n";
//	}
//	cout << "\n";
    ff(i,1,n)ff(j,1,m)ans[i][j] = -1;

    ll suma = 0;
    ff(i,1,n){
        ff(j,1,k)suma -= mat[i][j].xx;
    }

    priority_queue<pii> pq;
    ff(i,1,n){
        pq.push({mat[i][m].xx + mat[i][k].xx, i});
    }
    ff(i,1,(n*k)/2){
        pii sta = pq.top();
        pq.pop();
        kol[sta.yy]++;
        suma += sta.xx;
        if(kol[sta.yy] < k){
            pq.push({mat[sta.yy][k-kol[sta.yy]].xx + mat[sta.yy][m-kol[sta.yy]].xx, sta.yy});
        }
    }
    int r = 0;
    ff(i,1,n){
        dole[i] = k - kol[i];
        assert(kol[i] <= k);
        r += kol[i];
    }
    assert(r == (n*k)/2);

    ff(j,1,k){

        int tr = 0;
        ff(i,1,n)uzo[i] = 0;
        ff(i,1,n){
            if(dole[i] == 0){
                uzo[i] = 1;
                tr++;
            }
        }
        ff(i,1,n){
            if(uzo[i])continue;
            if(tr == n/2)break;
            if(kol[i] > 0){
                tr++;
                uzo[i] = 1;
            }
        }
        ff(i,1,n){
            if(uzo[i]){
                ans[i][m - kol[i] + 1] = j-1;
                kol[i]--;
            }
            else{
                ans[i][dole[i]] = j-1;
                dole[i]--;
            }
        }
    }

//    ff(i,1,n){
//        //cout << kol[i] << "\n";
//        assert(kol[i] <= k);
//        int dole = k - kol[i];
//        ff(j,1,k){
//            if(ima[j] < n/2){
//                if(kol[i] > 0){
//                    ans[i][mat[i][m-kol[i]+1].yy] = j-1;
//                    kol[i]--;
//                    ima[j]++;
//                }
//                else{
//                    ans[i][mat[i][dole].yy] = j-1;
//                    dole--;
//                }
//            }
//            else{
//                ans[i][mat[i][dole].yy] = j-1;
//                dole--;
//            }
//        }
//    }
    vector<vector<int>>answer;
    ff(i,1,n){
        vector<int> row;
        ff(j,1,m)row.pb(ans[i][j]);
        answer.pb(row);
    }

	allocate_tickets(answer);
	return suma;
}
/*
2 3 2
0 2 5
1 1 3

*/

Compilation message

tickets.cpp: In function 'long long int find_maximum(int, std::vector<std::vector<int> >)':
tickets.cpp:4:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
    4 | #define ff(i,a,b) for(int (i) = (a); (i) <= (b); ++(i))
      |                           ^
tickets.cpp:25:2: note: in expansion of macro 'ff'
   25 |  ff(i,0,n - 1){
      |  ^~
tickets.cpp:4:27: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
    4 | #define ff(i,a,b) for(int (i) = (a); (i) <= (b); ++(i))
      |                           ^
tickets.cpp:26:9: note: in expansion of macro 'ff'
   26 |         ff(j,0,m - 1){
      |         ^~
tickets.cpp:4:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
    4 | #define ff(i,a,b) for(int (i) = (a); (i) <= (b); ++(i))
      |                           ^
tickets.cpp:30:2: note: in expansion of macro 'ff'
   30 |  ff(i,1,n)sort(mat[i] + 1, mat[i] + m + 1);
      |  ^~
tickets.cpp:4:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
    4 | #define ff(i,a,b) for(int (i) = (a); (i) <= (b); ++(i))
      |                           ^
tickets.cpp:38:5: note: in expansion of macro 'ff'
   38 |     ff(i,1,n)ff(j,1,m)ans[i][j] = -1;
      |     ^~
tickets.cpp:4:27: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
    4 | #define ff(i,a,b) for(int (i) = (a); (i) <= (b); ++(i))
      |                           ^
tickets.cpp:38:14: note: in expansion of macro 'ff'
   38 |     ff(i,1,n)ff(j,1,m)ans[i][j] = -1;
      |              ^~
tickets.cpp:4:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
    4 | #define ff(i,a,b) for(int (i) = (a); (i) <= (b); ++(i))
      |                           ^
tickets.cpp:41:5: note: in expansion of macro 'ff'
   41 |     ff(i,1,n){
      |     ^~
tickets.cpp:4:27: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
    4 | #define ff(i,a,b) for(int (i) = (a); (i) <= (b); ++(i))
      |                           ^
tickets.cpp:42:9: note: in expansion of macro 'ff'
   42 |         ff(j,1,k)suma -= mat[i][j].xx;
      |         ^~
tickets.cpp:4:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
    4 | #define ff(i,a,b) for(int (i) = (a); (i) <= (b); ++(i))
      |                           ^
tickets.cpp:46:5: note: in expansion of macro 'ff'
   46 |     ff(i,1,n){
      |     ^~
tickets.cpp:4:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
    4 | #define ff(i,a,b) for(int (i) = (a); (i) <= (b); ++(i))
      |                           ^
tickets.cpp:49:5: note: in expansion of macro 'ff'
   49 |     ff(i,1,(n*k)/2){
      |     ^~
tickets.cpp:4:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
    4 | #define ff(i,a,b) for(int (i) = (a); (i) <= (b); ++(i))
      |                           ^
tickets.cpp:59:5: note: in expansion of macro 'ff'
   59 |     ff(i,1,n){
      |     ^~
tickets.cpp:4:27: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
    4 | #define ff(i,a,b) for(int (i) = (a); (i) <= (b); ++(i))
      |                           ^
tickets.cpp:66:5: note: in expansion of macro 'ff'
   66 |     ff(j,1,k){
      |     ^~
tickets.cpp:4:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
    4 | #define ff(i,a,b) for(int (i) = (a); (i) <= (b); ++(i))
      |                           ^
tickets.cpp:69:9: note: in expansion of macro 'ff'
   69 |         ff(i,1,n)uzo[i] = 0;
      |         ^~
tickets.cpp:4:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
    4 | #define ff(i,a,b) for(int (i) = (a); (i) <= (b); ++(i))
      |                           ^
tickets.cpp:70:9: note: in expansion of macro 'ff'
   70 |         ff(i,1,n){
      |         ^~
tickets.cpp:4:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
    4 | #define ff(i,a,b) for(int (i) = (a); (i) <= (b); ++(i))
      |                           ^
tickets.cpp:76:9: note: in expansion of macro 'ff'
   76 |         ff(i,1,n){
      |         ^~
tickets.cpp:4:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
    4 | #define ff(i,a,b) for(int (i) = (a); (i) <= (b); ++(i))
      |                           ^
tickets.cpp:84:9: note: in expansion of macro 'ff'
   84 |         ff(i,1,n){
      |         ^~
tickets.cpp:4:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
    4 | #define ff(i,a,b) for(int (i) = (a); (i) <= (b); ++(i))
      |                           ^
tickets.cpp:119:5: note: in expansion of macro 'ff'
  119 |     ff(i,1,n){
      |     ^~
tickets.cpp:4:27: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
    4 | #define ff(i,a,b) for(int (i) = (a); (i) <= (b); ++(i))
      |                           ^
tickets.cpp:121:9: note: in expansion of macro 'ff'
  121 |         ff(j,1,m)row.pb(ans[i][j]);
      |         ^~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 972 KB Output is correct
5 Correct 2 ms 2764 KB Output is correct
6 Correct 8 ms 12704 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 3 ms 1100 KB Output is correct
5 Correct 27 ms 5836 KB Output is correct
6 Correct 645 ms 77944 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 3 ms 1100 KB Output is correct
5 Correct 27 ms 5928 KB Output is correct
6 Correct 633 ms 83264 KB Output is correct
7 Correct 672 ms 83632 KB Output is correct
8 Correct 6 ms 1484 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 9 ms 2252 KB Output is correct
13 Correct 24 ms 7060 KB Output is correct
14 Correct 23 ms 4296 KB Output is correct
15 Correct 669 ms 84184 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 3 ms 1144 KB Output is correct
5 Correct 33 ms 6692 KB Output is correct
6 Correct 6 ms 952 KB Output is correct
7 Correct 12 ms 13132 KB Output is correct
8 Correct 828 ms 102560 KB Output is correct
9 Correct 775 ms 97452 KB Output is correct
10 Correct 769 ms 95812 KB Output is correct
11 Correct 881 ms 102712 KB Output is correct

Subtask #5
12.0 / 12.0

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

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 3 ms 1228 KB Output is correct
3 Correct 3 ms 1228 KB Output is correct
4 Correct 3 ms 1164 KB Output is correct
5 Correct 6 ms 1228 KB Output is correct
6 Correct 3 ms 1228 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 972 KB Output is correct
9 Correct 3 ms 1220 KB Output is correct
10 Correct 3 ms 1228 KB Output is correct
11 Correct 4 ms 1100 KB Output is correct
12 Correct 5 ms 1228 KB Output is correct
13 Correct 44 ms 6648 KB Output is correct
14 Correct 28 ms 6724 KB Output is correct
15 Correct 31 ms 6740 KB Output is correct
16 Correct 34 ms 6776 KB Output is correct
17 Correct 2 ms 460 KB Output is correct
18 Correct 4 ms 3020 KB Output is correct
19 Correct 3 ms 2764 KB Output is correct
20 Correct 30 ms 6024 KB Output is correct
21 Correct 30 ms 6460 KB Output is correct
22 Correct 30 ms 6028 KB Output is correct
23 Correct 31 ms 6536 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 972 KB Output is correct
5 Correct 2 ms 2764 KB Output is correct
6 Correct 8 ms 12704 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 3 ms 1100 KB Output is correct
11 Correct 27 ms 5836 KB Output is correct
12 Correct 645 ms 77944 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 3 ms 1100 KB Output is correct
17 Correct 27 ms 5928 KB Output is correct
18 Correct 633 ms 83264 KB Output is correct
19 Correct 672 ms 83632 KB Output is correct
20 Correct 6 ms 1484 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 9 ms 2252 KB Output is correct
25 Correct 24 ms 7060 KB Output is correct
26 Correct 23 ms 4296 KB Output is correct
27 Correct 669 ms 84184 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 3 ms 1144 KB Output is correct
32 Correct 33 ms 6692 KB Output is correct
33 Correct 6 ms 952 KB Output is correct
34 Correct 12 ms 13132 KB Output is correct
35 Correct 828 ms 102560 KB Output is correct
36 Correct 775 ms 97452 KB Output is correct
37 Correct 769 ms 95812 KB Output is correct
38 Correct 881 ms 102712 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 3 ms 1228 KB Output is correct
41 Correct 3 ms 1228 KB Output is correct
42 Correct 3 ms 1164 KB Output is correct
43 Correct 6 ms 1228 KB Output is correct
44 Correct 3 ms 1228 KB Output is correct
45 Correct 1 ms 332 KB Output is correct
46 Correct 1 ms 972 KB Output is correct
47 Correct 3 ms 1220 KB Output is correct
48 Correct 3 ms 1228 KB Output is correct
49 Correct 4 ms 1100 KB Output is correct
50 Correct 5 ms 1228 KB Output is correct
51 Correct 44 ms 6648 KB Output is correct
52 Correct 28 ms 6724 KB Output is correct
53 Correct 31 ms 6740 KB Output is correct
54 Correct 34 ms 6776 KB Output is correct
55 Correct 2 ms 460 KB Output is correct
56 Correct 4 ms 3020 KB Output is correct
57 Correct 3 ms 2764 KB Output is correct
58 Correct 30 ms 6024 KB Output is correct
59 Correct 30 ms 6460 KB Output is correct
60 Correct 30 ms 6028 KB Output is correct
61 Correct 31 ms 6536 KB Output is correct
62 Correct 95 ms 15312 KB Output is correct
63 Correct 74 ms 15300 KB Output is correct
64 Correct 107 ms 15452 KB Output is correct
65 Correct 337 ms 50804 KB Output is correct
66 Correct 369 ms 51268 KB Output is correct
67 Correct 13 ms 13132 KB Output is correct
68 Correct 6 ms 972 KB Output is correct
69 Correct 725 ms 99592 KB Output is correct
70 Correct 770 ms 99380 KB Output is correct
71 Correct 832 ms 98424 KB Output is correct
72 Correct 747 ms 80132 KB Output is correct
73 Correct 779 ms 80616 KB Output is correct
74 Correct 670 ms 85532 KB Output is correct
75 Correct 727 ms 86136 KB Output is correct