oj.uz

답안 #638716

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
638716 2022-09-07T05:43:41 Z jamezzz Let's Win the Election (JOI22_ho_t3) C++17
10 / 100
 905 ms 4272 KB 
#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define sf scanf
#define pf printf
typedef long long ll;
typedef long double ld;
typedef pair<int,int> ii;

#define maxn 505
#define INF 1023456789

int n,k,a[maxn],b[maxn];
bool have[maxn];
vector<ii> v;
ld memo[maxn][maxn];

int main(){
	sf("%d%d",&n,&k);
	for(int i=0;i<n;++i){
		int x,y;
		sf("%d%d",&x,&y);
		if(y==-1)y=INF;
		v.push_back({x,y});
	}
	sort(v.begin(),v.end(),[](ii &a,ii &b){
		if(a.se==b.se)return a.fi>b.fi;
		else return a.se<b.se;
	});
	for(int i=0;i<n;++i){
		tie(a[i],b[i])=v[i];
		if(b[i]!=INF)have[i]=true;
	}
	for(int i=0;i<=n+1;++i){
		for(int j=0;j<=n+1;++j){
			memo[i][j]=INF;
		}
	}
	memo[0][0]=0;
	for(int pos=0;pos<n;++pos){
		for(int ppl=n;ppl>=0;--ppl){
			for(int vote=n;vote>=0;--vote){
				ld ans=memo[ppl][vote];
				if(vote!=0)ans=min(ans,memo[ppl][vote-1]+((ld)a[pos])/((ld)(ppl+1)));
				if(vote!=0&&ppl!=0&&have[pos]){
					ans=min(ans,memo[ppl-1][vote-1]+((ld)b[pos])/((ld)ppl));
				}
				memo[ppl][vote]=ans;
			}
		}
	}
	ld ans=INF;
	for(int i=0;i<=n;++i)ans=min(ans,memo[i][k]);
	pf("%Lf\n",ans);
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:21:4: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   21 |  sf("%d%d",&n,&k);
      |    ^
Main.cpp:24:5: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   24 |   sf("%d%d",&x,&y);
      |     ^

Subtask #1
5.0 / 5.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 595 ms 4264 KB Output is correct
6 Correct 533 ms 4260 KB Output is correct
7 Correct 585 ms 4260 KB Output is correct
8 Correct 626 ms 4268 KB Output is correct
9 Correct 562 ms 4264 KB Output is correct
10 Correct 574 ms 4268 KB Output is correct

Subtask #2
5.0 / 5.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 595 ms 4264 KB Output is correct
6 Correct 533 ms 4260 KB Output is correct
7 Correct 585 ms 4260 KB Output is correct
8 Correct 626 ms 4268 KB Output is correct
9 Correct 562 ms 4264 KB Output is correct
10 Correct 574 ms 4268 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 896 ms 4264 KB Output is correct
13 Correct 741 ms 4268 KB Output is correct
14 Correct 640 ms 4260 KB Output is correct
15 Correct 893 ms 4260 KB Output is correct
16 Correct 746 ms 4180 KB Output is correct
17 Correct 668 ms 4260 KB Output is correct
18 Correct 895 ms 4260 KB Output is correct
19 Correct 781 ms 4260 KB Output is correct
20 Correct 627 ms 4264 KB Output is correct

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Incorrect 0 ms 340 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Incorrect 0 ms 340 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Incorrect 0 ms 340 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 905 ms 4272 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 23.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 595 ms 4264 KB Output is correct
6 Correct 533 ms 4260 KB Output is correct
7 Correct 585 ms 4260 KB Output is correct
8 Correct 626 ms 4268 KB Output is correct
9 Correct 562 ms 4264 KB Output is correct
10 Correct 574 ms 4268 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 896 ms 4264 KB Output is correct
13 Correct 741 ms 4268 KB Output is correct
14 Correct 640 ms 4260 KB Output is correct
15 Correct 893 ms 4260 KB Output is correct
16 Correct 746 ms 4180 KB Output is correct
17 Correct 668 ms 4260 KB Output is correct
18 Correct 895 ms 4260 KB Output is correct
19 Correct 781 ms 4260 KB Output is correct
20 Correct 627 ms 4264 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Incorrect 0 ms 340 KB Output isn't correct
30 Halted 0 ms 0 KB -