Submission #594649

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
594649	2022-07-12 19:05:22	1ne	Let's Win the Election (JOI22_ho_t3)	C++14	5 / 100	2610 ms	633344 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;
int main(){
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int n,k;cin>>n>>k;
  vector<pair<double long,double long>>arr,temp;
  for (int i = 0;i<n;++i){
    double long x,y;cin>>x>>y;
    if (y == -1){
      temp.push_back({x,y});
    }
    else{
      arr.push_back({x,y});
    }
  }
  sort(arr.begin(),arr.end(),[&](auto x,auto y){
    if (x.second == y.second)return x.first < y.first;
    return x.second < y.second;
  });
  sort(temp.begin(),temp.end(),[&](auto x,auto y){
    return x.first < y.first;
  });
  for (auto x:temp)arr.push_back(x);
  double long mxn = 1e8;
    vector<vector<unordered_map<int,double long>>>dp(n + 1,vector<unordered_map<int,double long>>(k + 1));
    function<double long(int,int,double long)>solve = [&](int i,int j,double long p){
      if (i == n){
        if (j == k)return (double long)0.0;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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