oj.uz

답안 #318540

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
318540 2020-11-02T09:43:31 Z katearima 카니발 티켓 (IOI20_tickets) C++14
100 / 100
 854 ms 60644 KB 
#include "tickets.h"
#include <vector>
#include <queue>
#include <bits/stdc++.h>
using namespace std;
int i,j,n,m,k;
long long sum;
pair<int,int> p;
priority_queue<pair<int,int>, vector<pair<int,int> >, greater<pair<int,int> > > pq;
long long find_maximum(int k, vector<vector<int> > x) {
	n = x.size();
	m = x[0].size();
	vector<vector<int> > ans;
	vector<int> row(m,-1),f(n),v(n);
	for (int i = 0; i < n; i++) ans.push_back(row);
	for(i=0; i<n; i++){
		for(j=m-k; j<m; j++){
			ans[i][j]=-2;
			sum+=x[i][j];
		}
	}
	for(i=0; i<n; i++){
		int y=x[i][0]+x[i][m-k];
		pq.push(make_pair(y,i));
	}
	int y=n*k/2;

	while(y--){
		int a=pq.top().first; int b=pq.top().second;
		if(f[b]>=k){
			pq.pop();
			a=pq.top().first;
			b=pq.top().second;
		}
		ans[b][m-k+v[b]]=-1; ans[b][v[b]]=-3;
		
		f[b]++; v[b]++;
		int c=v[b];
		sum-=a;
		if(m-k+c!=m&&c!=m)pq.push(make_pair(x[b][c]+x[b][m-k+c],b));
		pq.pop();	
	}
	int t=k; 
	int pos=0; int neg=0;
	for(i=0; i<n; i++){
		for(j=0; j<m; j++){
			if(ans[i][j]==-3){
				ans[i][j]=neg;
				neg++;
				if(neg>=k) neg-=k;
			}
		}pos=neg;
		for(j=0; j<m; j++){
			if(ans[i][j]==-2){
				ans[i][j]=pos;
				pos++;
				if(pos>=k) pos-=k;
			}
		}
	}


	allocate_tickets(ans);
	return sum;
}

Compilation message

tickets.cpp: In function 'long long int find_maximum(int, std::vector<std::vector<int> >)':
tickets.cpp:43:6: warning: unused variable 't' [-Wunused-variable]
   43 |  int t=k;
      |      ^

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 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 744 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 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 33 ms 3308 KB Output is correct
6 Correct 662 ms 54244 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 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 2 ms 492 KB Output is correct
5 Correct 25 ms 2668 KB Output is correct
6 Correct 617 ms 56868 KB Output is correct
7 Correct 643 ms 57316 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 7 ms 876 KB Output is correct
13 Correct 22 ms 2276 KB Output is correct
14 Correct 22 ms 2276 KB Output is correct
15 Correct 656 ms 58100 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 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 33 ms 3308 KB Output is correct
6 Correct 6 ms 876 KB Output is correct
7 Correct 7 ms 1004 KB Output is correct
8 Correct 841 ms 54756 KB Output is correct
9 Correct 779 ms 51044 KB Output is correct
10 Correct 787 ms 51172 KB Output is correct
11 Correct 836 ms 54884 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 4 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 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 3 ms 492 KB Output is correct
12 Correct 3 ms 492 KB Output is correct

Subtask #6
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 4 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 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 3 ms 492 KB Output is correct
12 Correct 3 ms 492 KB Output is correct
13 Correct 27 ms 3300 KB Output is correct
14 Correct 28 ms 3300 KB Output is correct
15 Correct 30 ms 3300 KB Output is correct
16 Correct 54 ms 3300 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 39 ms 2660 KB Output is correct
21 Correct 30 ms 3172 KB Output is correct
22 Correct 29 ms 2668 KB Output is correct
23 Correct 32 ms 3300 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 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 744 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 33 ms 3308 KB Output is correct
12 Correct 662 ms 54244 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 2 ms 492 KB Output is correct
17 Correct 25 ms 2668 KB Output is correct
18 Correct 617 ms 56868 KB Output is correct
19 Correct 643 ms 57316 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 7 ms 876 KB Output is correct
25 Correct 22 ms 2276 KB Output is correct
26 Correct 22 ms 2276 KB Output is correct
27 Correct 656 ms 58100 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 33 ms 3308 KB Output is correct
33 Correct 6 ms 876 KB Output is correct
34 Correct 7 ms 1004 KB Output is correct
35 Correct 841 ms 54756 KB Output is correct
36 Correct 779 ms 51044 KB Output is correct
37 Correct 787 ms 51172 KB Output is correct
38 Correct 836 ms 54884 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 4 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 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 3 ms 492 KB Output is correct
50 Correct 3 ms 492 KB Output is correct
51 Correct 27 ms 3300 KB Output is correct
52 Correct 28 ms 3300 KB Output is correct
53 Correct 30 ms 3300 KB Output is correct
54 Correct 54 ms 3300 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 39 ms 2660 KB Output is correct
59 Correct 30 ms 3172 KB Output is correct
60 Correct 29 ms 2668 KB Output is correct
61 Correct 32 ms 3300 KB Output is correct
62 Correct 91 ms 8420 KB Output is correct
63 Correct 78 ms 8420 KB Output is correct
64 Correct 92 ms 8676 KB Output is correct
65 Correct 344 ms 32996 KB Output is correct
66 Correct 383 ms 33380 KB Output is correct
67 Correct 9 ms 1004 KB Output is correct
68 Correct 6 ms 876 KB Output is correct
69 Correct 649 ms 51944 KB Output is correct
70 Correct 758 ms 52964 KB Output is correct
71 Correct 854 ms 54756 KB Output is correct
72 Correct 736 ms 60644 KB Output is correct
73 Correct 805 ms 52580 KB Output is correct
74 Correct 663 ms 59108 KB Output is correct
75 Correct 736 ms 51284 KB Output is correct