oj.uz

Submission #398654

# Submission time Handle Problem Language Result Execution time Memory
398654 2021-05-04T16:43:01 Z 4fecta Event Hopping 2 (JOI21_event2) C++17
32 / 100
 351 ms 2428 KB 
#include <bits/stdc++.h>

using namespace std;
#define ll long long
#define int ll
#define ld long double
#define pii pair<int, int>
#define f first
#define s second
#define boost() cin.tie(0), cin.sync_with_stdio(0)

bool cmp(pii p, pii q) {
    return p.s < q.s;
}

const int MN = 6005;

int n, k, vis[MN], dp1[MN], dp2[MN];
pii a[MN];
vector<int> xs, ls[MN], rs[MN];
map<int, int> mp;

int32_t main() {
    boost();

    cin >> n >> k;
    for (int i = 1; i <= n; i++) {
        cin >> a[i].f >> a[i].s;
        xs.push_back(a[i].f);
        xs.push_back(a[i].s);
    }
    sort(xs.begin(), xs.end());
    xs.erase(unique(xs.begin(), xs.end()), xs.end());
    for (int i = 0; i < xs.size(); i++) mp[xs[i]] = i + 1;
    for (int i = 1; i <= n; i++) a[i].f = mp[a[i].f], a[i].s = mp[a[i].s];
    vector<int> out;
    for (int c = 1; c <= k; c++) {
        for (int i = 1; i <= xs.size(); i++) ls[i].clear(), rs[i].clear();
        vector<pii > v;
        for (int i = 1; i <= n; i++) {
            if (vis[i]) continue;
            ls[a[i].s].push_back(a[i].f);
            rs[a[i].f].push_back(a[i].s);
        }
        memset(dp1, 0, sizeof(dp1));
        memset(dp2, 0, sizeof(dp2));
        for (int i = 1; i <= xs.size(); i++) {
            dp1[i] = dp1[i - 1];
            for (int p : ls[i]) dp1[i] = max(dp1[i], dp1[p] + 1);
        }
        for (int i = xs.size(); i > 0; i--) {
            dp2[i] = dp2[i + 1];
            for (int p : rs[i]) dp2[i] = max(dp2[i], dp2[p] + 1);
        }
        for (int i = 1; i <= n; i++) {
            if (vis[i]) continue;
            if (dp1[a[i].f] + dp2[a[i].s] >= k - c) {
                vis[i] = 1;
                for (int j = 1; j <= n; j++) {
                    if (a[j].f >= a[i].s || a[j].s <= a[i].f) continue;
                    vis[j] = 1;
                }
                out.push_back(i);
                break;
            }
        }
        if (out.size() < c) return 0 * printf("-1\n");
    }
    for (int p : out) printf("%lld\n", p);

    return 0;
}

Compilation message

event2.cpp: In function 'int32_t main()':
event2.cpp:34:23: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   34 |     for (int i = 0; i < xs.size(); i++) mp[xs[i]] = i + 1;
      |                     ~~^~~~~~~~~~~
event2.cpp:38:27: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |         for (int i = 1; i <= xs.size(); i++) ls[i].clear(), rs[i].clear();
      |                         ~~^~~~~~~~~~~~
event2.cpp:47:27: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   47 |         for (int i = 1; i <= xs.size(); i++) {
      |                         ~~^~~~~~~~~~~~
event2.cpp:67:24: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   67 |         if (out.size() < c) return 0 * printf("-1\n");
      |             ~~~~~~~~~~~^~~

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 588 KB Output is correct
2 Correct 1 ms 588 KB Output is correct
3 Correct 1 ms 588 KB Output is correct
4 Runtime error 6 ms 2428 KB Execution killed with signal 11
5 Halted 0 ms 0 KB -

Subtask #2
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 588 KB Output is correct
2 Correct 1 ms 588 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 1 ms 588 KB Output is correct
5 Correct 1 ms 588 KB Output is correct
6 Correct 1 ms 600 KB Output is correct
7 Correct 1 ms 608 KB Output is correct
8 Correct 1 ms 588 KB Output is correct
9 Correct 1 ms 588 KB Output is correct
10 Correct 1 ms 588 KB Output is correct
11 Correct 1 ms 588 KB Output is correct
12 Correct 1 ms 588 KB Output is correct
13 Correct 1 ms 588 KB Output is correct
14 Correct 1 ms 716 KB Output is correct
15 Correct 1 ms 588 KB Output is correct
16 Correct 1 ms 588 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 588 KB Output is correct
19 Correct 1 ms 588 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 1 ms 588 KB Output is correct
22 Correct 1 ms 588 KB Output is correct
23 Correct 1 ms 588 KB Output is correct
24 Correct 1 ms 588 KB Output is correct
25 Correct 1 ms 588 KB Output is correct
26 Correct 2 ms 592 KB Output is correct
27 Correct 1 ms 588 KB Output is correct

Subtask #3
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 588 KB Output is correct
2 Correct 1 ms 588 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 1 ms 588 KB Output is correct
5 Correct 1 ms 588 KB Output is correct
6 Correct 1 ms 600 KB Output is correct
7 Correct 1 ms 608 KB Output is correct
8 Correct 1 ms 588 KB Output is correct
9 Correct 1 ms 588 KB Output is correct
10 Correct 1 ms 588 KB Output is correct
11 Correct 1 ms 588 KB Output is correct
12 Correct 1 ms 588 KB Output is correct
13 Correct 1 ms 588 KB Output is correct
14 Correct 1 ms 716 KB Output is correct
15 Correct 1 ms 588 KB Output is correct
16 Correct 1 ms 588 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 588 KB Output is correct
19 Correct 1 ms 588 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 1 ms 588 KB Output is correct
22 Correct 1 ms 588 KB Output is correct
23 Correct 1 ms 588 KB Output is correct
24 Correct 1 ms 588 KB Output is correct
25 Correct 1 ms 588 KB Output is correct
26 Correct 2 ms 592 KB Output is correct
27 Correct 1 ms 588 KB Output is correct
28 Correct 12 ms 1432 KB Output is correct
29 Correct 11 ms 1356 KB Output is correct
30 Correct 8 ms 1380 KB Output is correct
31 Correct 7 ms 1356 KB Output is correct
32 Correct 6 ms 1376 KB Output is correct
33 Correct 6 ms 1356 KB Output is correct
34 Correct 5 ms 1388 KB Output is correct
35 Correct 346 ms 1580 KB Output is correct
36 Correct 351 ms 1560 KB Output is correct
37 Correct 245 ms 1428 KB Output is correct
38 Correct 4 ms 1360 KB Output is correct
39 Correct 285 ms 1480 KB Output is correct
40 Correct 272 ms 1496 KB Output is correct
41 Correct 265 ms 1736 KB Output is correct
42 Correct 4 ms 1356 KB Output is correct
43 Correct 120 ms 1444 KB Output is correct
44 Correct 101 ms 1440 KB Output is correct
45 Correct 90 ms 1440 KB Output is correct
46 Correct 5 ms 1392 KB Output is correct
47 Correct 21 ms 1448 KB Output is correct
48 Correct 19 ms 1356 KB Output is correct
49 Correct 17 ms 1452 KB Output is correct
50 Correct 5 ms 1312 KB Output is correct
51 Correct 6 ms 1356 KB Output is correct
52 Correct 6 ms 1356 KB Output is correct
53 Correct 6 ms 1356 KB Output is correct
54 Correct 5 ms 1356 KB Output is correct
55 Correct 180 ms 1236 KB Output is correct
56 Correct 177 ms 1228 KB Output is correct
57 Correct 168 ms 1264 KB Output is correct
58 Correct 173 ms 1244 KB Output is correct
59 Correct 185 ms 1380 KB Output is correct
60 Correct 177 ms 1228 KB Output is correct
61 Correct 163 ms 1228 KB Output is correct
62 Correct 156 ms 1228 KB Output is correct
63 Correct 152 ms 1492 KB Output is correct
64 Correct 3 ms 1128 KB Output is correct

Subtask #4
0 / 61.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 588 KB Output is correct
2 Correct 1 ms 588 KB Output is correct
3 Correct 1 ms 588 KB Output is correct
4 Runtime error 6 ms 2428 KB Execution killed with signal 11
5 Halted 0 ms 0 KB -