Submission #681790

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
681790	2023-01-14 10:05:07	dsyz	Let's Win the Election (JOI22_ho_t3)	C++17	10 / 100	305 ms	4256 KiB

Main

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define MAXN (300005)
int main() {
  ios_base::sync_with_stdio(false);cin.tie(0);
  ll N,K;
  cin>>N>>K;
  pair<ll,ll> arr[N];
  for(ll i = 0;i < N;i++){
    cin>>arr[i].second>>arr[i].first;
    if(arr[i].first == -1) arr[i].first = 1e18;
  }
  sort(arr,arr + N);
  ld A[N], B[N];
  for(ll i = 0;i < N;i++){
    A[i] = arr[i].second;
    B[i] = arr[i].first;
    if(arr[i].first == 1e18){
      arr[i].first = -1;
      B[i] = -1;
    }
  }
  ld dp[K + 1][N + 1]; //number of A fufilled, number of collaborators (excluding Rie herself)
  for(ll i = 0;i <= K;i++){
    for(ll j = 0;j <= N;j++){
      dp[i][j] = 1e18;
    }
  }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 0 / 11
• Subtask 4: 0 / 12
• Subtask 5: 0 / 33
• Subtask 6: 0 / 11
• Subtask 7: 0 / 23