Submission #1367123

#	Time	Username	Problem	Language	Result	Execution time	Memory
1367123		takoshanava	Magic Tree (CEOI19_magictree)	C++20	0 / 100	55 ms	2572 KiB

magictree

#include <bits/stdc++.h>
#define int long long
#define pb push_back
#define fs first
#define sc second
using namespace std;

const int N = 1e5 + 5;
int a[N];

signed main() {
    int n, m, k;
    cin >> n >> m >> k;
    for (int i = 1; i < n; i++) {
        int a;
        cin >> a;
    }
    vector<pair<int, int>> vec;
    for (int i = 0; i < n; i++) {
        int v, d, w;
        cin >> v >> d >> w;
        vec.pb({v, d});
    }
    sort(vec.begin(), vec.end());
    vector<int> lis;
    for (auto [v, d]:vec) {
        int x = d;
        auto it = lower_bound(lis.begin(), lis.end(), x);
        if (it == lis.end()) lis.pb(x);
        else *it = x;
    }
    cout << lis.size() << endl;
}

• Subtask 1: 0 / 6
• Subtask 2: 0 / 3
• Subtask 3: 0 / 11
• Subtask 4: 0 / 12
• Subtask 5: 0 / 16
• Subtask 6: 0 / 13
• Subtask 7: 0 / 22
• Subtask 8: 0 / 17