oj.uz

답안 #743490

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
743490 2023-05-17T12:23:28 Z MohamedAhmed04 Akcija (COCI21_akcija) C++14
70 / 110
 745 ms 524288 KB 
#include <bits/stdc++.h>

using namespace std ;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()) ;

long long rand(long long l , long long r)
{
	return uniform_int_distribution<long long>(l , r)(rng) ;
}

const int MAX = 2010 ;

int arr[MAX] ;
int n , k ;

vector< pair<int , int> >vp ;
vector< array<long long , 3> >dp[MAX][MAX] ;

bool cmp(array<long long , 3>&a , array<long long , 3>&b)
{
	if(a[0] != b[0])
		return (a[0] > b[0]) ;
	else
		return (a[1] < b[1]) ;
}

long long val[MAX] ;

int main()
{
	ios_base::sync_with_stdio(0) ;
	cin.tie(0) ;
	cin>>n>>k ;
	for(int i = 1 ; i <= n ; ++i)
	{
		int w , d ;
		cin>>w>>d ;
		vp.emplace_back(d , w) ;
	}
	for(int i = 1 ; i <= n ; ++i)
		val[i] = rand(1 , 1e12) ;
	vp.emplace_back(0 , 0) ;
	sort(vp.begin() , vp.end()) ;
	for(int i = 0 ; i <= n ; ++i)
		dp[0][i].push_back({0 , 0 , 0}) ;
	for(int i = 1 ; i <= n ; ++i)
	{
		dp[i][0] = dp[i-1][0] ;
		for(int j = 1 ; j <= n ; ++j)
		{
			dp[i][j] = dp[i-1][j] ;
			for(auto &a : dp[i][j-1])
				dp[i][j].push_back(a) ;
			if(vp[j].first >= i)
			{
				for(auto &a : dp[i-1][j-1])
					dp[i][j].push_back({a[0]+1 , a[1] + vp[j].second , a[2] + val[j]}) ;
			}
			sort(dp[i][j].begin() , dp[i][j].end() , cmp) ;
			dp[i][j].erase(unique(dp[i][j].begin() , dp[i][j].end()) , dp[i][j].end()) ;
			while(dp[i][j].size() > k)
				dp[i][j].pop_back() ;
		}
	}
	for(auto &a : dp[n][n])
		cout<<a[0]<<" "<<a[1]<<"\n" ;
	return 0 ;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:62:26: warning: comparison of integer expressions of different signedness: 'std::vector<std::array<long long int, 3> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   62 |    while(dp[i][j].size() > k)
      |          ~~~~~~~~~~~~~~~~^~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 617 ms 412740 KB Output is correct
2 Correct 636 ms 438536 KB Output is correct
3 Correct 567 ms 384248 KB Output is correct
4 Correct 549 ms 379628 KB Output is correct
5 Correct 642 ms 433876 KB Output is correct
6 Correct 431 ms 300840 KB Output is correct
7 Correct 515 ms 343700 KB Output is correct
8 Correct 469 ms 308676 KB Output is correct
9 Correct 432 ms 300428 KB Output is correct
10 Correct 519 ms 355532 KB Output is correct
11 Correct 47 ms 95180 KB Output is correct
12 Correct 46 ms 95188 KB Output is correct
13 Correct 46 ms 95324 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 617 ms 412740 KB Output is correct
2 Correct 636 ms 438536 KB Output is correct
3 Correct 567 ms 384248 KB Output is correct
4 Correct 549 ms 379628 KB Output is correct
5 Correct 642 ms 433876 KB Output is correct
6 Correct 431 ms 300840 KB Output is correct
7 Correct 515 ms 343700 KB Output is correct
8 Correct 469 ms 308676 KB Output is correct
9 Correct 432 ms 300428 KB Output is correct
10 Correct 519 ms 355532 KB Output is correct
11 Correct 47 ms 95180 KB Output is correct
12 Correct 46 ms 95188 KB Output is correct
13 Correct 46 ms 95324 KB Output is correct
14 Correct 623 ms 412812 KB Output is correct
15 Correct 644 ms 438436 KB Output is correct
16 Correct 562 ms 384292 KB Output is correct
17 Correct 551 ms 379468 KB Output is correct
18 Correct 745 ms 433980 KB Output is correct
19 Correct 430 ms 300780 KB Output is correct
20 Correct 524 ms 343792 KB Output is correct
21 Correct 473 ms 308812 KB Output is correct
22 Correct 437 ms 300436 KB Output is correct
23 Correct 548 ms 355564 KB Output is correct
24 Correct 46 ms 95304 KB Output is correct
25 Correct 47 ms 95188 KB Output is correct
26 Correct 48 ms 95372 KB Output is correct

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 589 ms 524288 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 109 ms 114200 KB Output is correct
2 Correct 116 ms 116208 KB Output is correct
3 Correct 93 ms 110040 KB Output is correct
4 Correct 92 ms 108688 KB Output is correct
5 Correct 116 ms 117512 KB Output is correct
6 Correct 49 ms 95288 KB Output is correct
7 Correct 113 ms 111352 KB Output is correct
8 Correct 67 ms 100488 KB Output is correct
9 Correct 65 ms 100984 KB Output is correct
10 Correct 47 ms 95420 KB Output is correct
11 Correct 48 ms 95108 KB Output is correct
12 Correct 56 ms 95180 KB Output is correct
13 Correct 108 ms 111524 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 167 ms 155996 KB Output is correct
2 Correct 168 ms 157584 KB Output is correct
3 Correct 159 ms 147476 KB Output is correct
4 Correct 146 ms 146340 KB Output is correct
5 Correct 203 ms 159772 KB Output is correct
6 Correct 97 ms 113216 KB Output is correct
7 Correct 166 ms 140728 KB Output is correct
8 Correct 124 ms 126412 KB Output is correct
9 Correct 131 ms 129008 KB Output is correct
10 Correct 114 ms 128508 KB Output is correct
11 Correct 48 ms 95124 KB Output is correct
12 Correct 50 ms 95188 KB Output is correct
13 Correct 80 ms 107724 KB Output is correct

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 617 ms 412740 KB Output is correct
2 Correct 636 ms 438536 KB Output is correct
3 Correct 567 ms 384248 KB Output is correct
4 Correct 549 ms 379628 KB Output is correct
5 Correct 642 ms 433876 KB Output is correct
6 Correct 431 ms 300840 KB Output is correct
7 Correct 515 ms 343700 KB Output is correct
8 Correct 469 ms 308676 KB Output is correct
9 Correct 432 ms 300428 KB Output is correct
10 Correct 519 ms 355532 KB Output is correct
11 Correct 47 ms 95180 KB Output is correct
12 Correct 46 ms 95188 KB Output is correct
13 Correct 46 ms 95324 KB Output is correct
14 Correct 623 ms 412812 KB Output is correct
15 Correct 644 ms 438436 KB Output is correct
16 Correct 562 ms 384292 KB Output is correct
17 Correct 551 ms 379468 KB Output is correct
18 Correct 745 ms 433980 KB Output is correct
19 Correct 430 ms 300780 KB Output is correct
20 Correct 524 ms 343792 KB Output is correct
21 Correct 473 ms 308812 KB Output is correct
22 Correct 437 ms 300436 KB Output is correct
23 Correct 548 ms 355564 KB Output is correct
24 Correct 46 ms 95304 KB Output is correct
25 Correct 47 ms 95188 KB Output is correct
26 Correct 48 ms 95372 KB Output is correct
27 Runtime error 589 ms 524288 KB Execution killed with signal 9
28 Halted 0 ms 0 KB -