제출 #418070

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
418070	2021-06-05 03:24:06	Namnamseo	여별 열쇠 (JOI15_keys)	C++17	100 / 100	2 ms	1356 KiB

keys

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 <iostream>
#include <algorithm>
#include <utility>
#include <vector>
using namespace std;
using pp=pair<int,int>;
const int maxn = int(2e3) + 10;
#define pb push_back
int n, m, k;
pp d[maxn];
int tm[maxn*2], tn;
int user[maxn*2][2];
int F(int t) { return lower_bound(tm, tm+tn, t) - tm; }
bool vis[maxn];
int dp[2010][2010][2];
int Solve(int n, int k, vector<int> vv, vector<int> ve)
{
  const int inf = int(1e9);
  for (int j=0; j<=k; ++j) dp[0][j][0] = dp[0][j][1] = inf;
  dp[0][0][0] = 0; dp[0][1][1] = vv[0];
  for (int i=1; i<n; ++i) {
    for (int j=0; j<=k; ++j) {
      dp[i][j][0] = inf;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 10 / 10
• Subtask 2: 90 / 90