제출 #594662

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
594662	2022-07-12 19:26:16	1ne	Let's Win the Election (JOI22_ho_t3)	C++14	10 / 100	1460 ms	8476 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);
  double long 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){
      y = 1e7;
    }
    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;
  });
  for (auto x:temp)arr.push_back(x);
  double long mxn = 1e15;
  vector<vector<double long>>dp(n + 1,vector<double long>(n + 2,mxn));
  dp[0][0] = 0.0;
  for (int i = 0;i<n;++i){
    vector<vector<double long>>cur_dp(n + 1,vector<double long>(n + 2,mxn));
    for (int j = 0;j<=i;++j){
      for (int p = 0;p <= j + 1;++p){
        cur_dp[j][p] = min(cur_dp[j][p],dp[j][p]);
        cur_dp[j + 1][p + 1] = min(cur_dp[j + 1][p + 1],dp[j + 1][p + 1]);
        cur_dp[j + 1][p] = min(cur_dp[j + 1][p],dp[j + 1][p]);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
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