oj.uz

답안 #601294

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
601294 2022-07-21T15:36:08 Z definitelynotmee 카니발 티켓 (IOI20_tickets) C++17
100 / 100
 1169 ms 187508 KB 
#include "tickets.h"
#include <vector>
#include<bits/stdc++.h>
#define mp make_pair
#define mt make_tuple
#define all(x) x.begin(), x.end()
#define ff first
#define ss second
using namespace std;
template <typename T>
using matrix = vector<vector<T>>;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const ll INFL = (1LL<<62)-1;
const int INF = (1<<30)-1;
const double EPS = 1e-7;
const int MOD = 1e9 + 7;
const int RANDOM = chrono::high_resolution_clock::now().time_since_epoch().count();
const int MAXN = 1e6+1;

long long find_maximum(int k, std::vector<std::vector<int>> x) {
	int n = x.size();
	int m = x[0].size();
	matrix<int> group(n,vector<int>(m,-1));

	ll resp = 0;
    vector<int> minuscount(n,k);
    priority_queue<pii> pq;

    for(int i = 0; i < n; i++){
        for(int j = 0; j < k; j++){
            resp-=x[i][j];
            pq.push({x[i][j]+x[i][m+j-k],i});
        }
    }


    for(int i = 0; i < n*k/2; i++){
        pii cur = pq.top();
        pq.pop();
        resp+=cur.ff;
        minuscount[cur.ss]--;
    }

    vector<pii> minus, plus;
    minus.reserve(n*k/2);
    plus.reserve(n*k/2);

    for(int i = 0; i < n; i++){
        for(int j = 0; j < minuscount[i]; j++){
            minus.push_back({i,j});
        }
        for(int j = m-1; j >= m-(k-minuscount[i]); j--){
            plus.push_back({i,j});
        }
    }


    vector<set<int>> occupy(k);
    vector<int> curid(n);
    int id = 0;

    for(pii i : plus){
        occupy[id].insert(i.ff);
        group[i.ff][i.ss] = id;
        id = (id+1)%k;
    }

    for(pii i : minus){
        while(!(occupy[curid[i.ff]].size() < n && !occupy[curid[i.ff]].count(i.ff))){
            curid[i.ff]++;
            //assert(curid[i.ff] < k); 
        }
        occupy[curid[i.ff]].insert(i.ff);
        group[i.ff][i.ss] = curid[i.ff];
        curid[i.ff]++;
    }
    





    allocate_tickets(group);
	return resp;
}

Compilation message

tickets.cpp: In function 'long long int find_maximum(int, std::vector<std::vector<int> >)':
tickets.cpp:73:44: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   73 |         while(!(occupy[curid[i.ff]].size() < n && !occupy[curid[i.ff]].count(i.ff))){
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 724 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 18 ms 2320 KB Output is correct
6 Correct 448 ms 51464 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 2 ms 596 KB Output is correct
5 Correct 24 ms 4940 KB Output is correct
6 Correct 641 ms 115136 KB Output is correct
7 Correct 723 ms 138592 KB Output is correct
8 Correct 4 ms 1108 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 8 ms 1748 KB Output is correct
13 Correct 24 ms 4940 KB Output is correct
14 Correct 24 ms 5516 KB Output is correct
15 Correct 804 ms 157380 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 296 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 3 ms 820 KB Output is correct
5 Correct 37 ms 8192 KB Output is correct
6 Correct 6 ms 1652 KB Output is correct
7 Correct 7 ms 1852 KB Output is correct
8 Correct 1156 ms 185652 KB Output is correct
9 Correct 1025 ms 173212 KB Output is correct
10 Correct 1028 ms 173212 KB Output is correct
11 Correct 1099 ms 185608 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 2 ms 436 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 2 ms 596 KB Output is correct
5 Correct 2 ms 596 KB Output is correct
6 Correct 3 ms 820 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 2 ms 724 KB Output is correct
10 Correct 2 ms 724 KB Output is correct
11 Correct 3 ms 828 KB Output is correct
12 Correct 3 ms 852 KB Output is correct

Subtask #6
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 2 ms 436 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 2 ms 596 KB Output is correct
5 Correct 2 ms 596 KB Output is correct
6 Correct 3 ms 820 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 2 ms 724 KB Output is correct
10 Correct 2 ms 724 KB Output is correct
11 Correct 3 ms 828 KB Output is correct
12 Correct 3 ms 852 KB Output is correct
13 Correct 19 ms 3276 KB Output is correct
14 Correct 20 ms 3356 KB Output is correct
15 Correct 29 ms 5800 KB Output is correct
16 Correct 37 ms 8512 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 2 ms 692 KB Output is correct
19 Correct 2 ms 468 KB Output is correct
20 Correct 28 ms 6072 KB Output is correct
21 Correct 30 ms 6508 KB Output is correct
22 Correct 33 ms 7632 KB Output is correct
23 Correct 37 ms 7984 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 18 ms 2320 KB Output is correct
12 Correct 448 ms 51464 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 2 ms 596 KB Output is correct
17 Correct 24 ms 4940 KB Output is correct
18 Correct 641 ms 115136 KB Output is correct
19 Correct 723 ms 138592 KB Output is correct
20 Correct 4 ms 1108 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 8 ms 1748 KB Output is correct
25 Correct 24 ms 4940 KB Output is correct
26 Correct 24 ms 5516 KB Output is correct
27 Correct 804 ms 157380 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 296 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 3 ms 820 KB Output is correct
32 Correct 37 ms 8192 KB Output is correct
33 Correct 6 ms 1652 KB Output is correct
34 Correct 7 ms 1852 KB Output is correct
35 Correct 1156 ms 185652 KB Output is correct
36 Correct 1025 ms 173212 KB Output is correct
37 Correct 1028 ms 173212 KB Output is correct
38 Correct 1099 ms 185608 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 2 ms 436 KB Output is correct
41 Correct 2 ms 468 KB Output is correct
42 Correct 2 ms 596 KB Output is correct
43 Correct 2 ms 596 KB Output is correct
44 Correct 3 ms 820 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 2 ms 724 KB Output is correct
48 Correct 2 ms 724 KB Output is correct
49 Correct 3 ms 828 KB Output is correct
50 Correct 3 ms 852 KB Output is correct
51 Correct 19 ms 3276 KB Output is correct
52 Correct 20 ms 3356 KB Output is correct
53 Correct 29 ms 5800 KB Output is correct
54 Correct 37 ms 8512 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 2 ms 692 KB Output is correct
57 Correct 2 ms 468 KB Output is correct
58 Correct 28 ms 6072 KB Output is correct
59 Correct 30 ms 6508 KB Output is correct
60 Correct 33 ms 7632 KB Output is correct
61 Correct 37 ms 7984 KB Output is correct
62 Correct 53 ms 7340 KB Output is correct
63 Correct 56 ms 7632 KB Output is correct
64 Correct 108 ms 22204 KB Output is correct
65 Correct 337 ms 53424 KB Output is correct
66 Correct 454 ms 84620 KB Output is correct
67 Correct 8 ms 1876 KB Output is correct
68 Correct 6 ms 1748 KB Output is correct
69 Correct 460 ms 54080 KB Output is correct
70 Correct 763 ms 116756 KB Output is correct
71 Correct 1169 ms 187508 KB Output is correct
72 Correct 982 ms 176008 KB Output is correct
73 Correct 1029 ms 172136 KB Output is correct
74 Correct 708 ms 119648 KB Output is correct
75 Correct 776 ms 117708 KB Output is correct