oj.uz

답안 #898876

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
898876 2024-01-05T08:27:16 Z vjudge1 Magic Tree (CEOI19_magictree) C++17
3 / 100
 37 ms 9936 KB 
//In His Name
#include <bits/stdc++.h>
//#pragma GCC optimization("O3")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("avx2")
using namespace std;
#define ll long long
#define int ll
typedef pair<int, int> pii;
#define F first
#define S second
#define pb push_back
#define bug(x) cout << "Ah shit , here we go again : " << x <<endl
#define all(x) x.begin() , x.end()
const int maxn = 1e5 + 10, MOD = 1e9 + 7 ;
const ll INF = 1e18 + 100;

int n , m , k , v[maxn] ,d[maxn] , w[maxn] , dd[maxn];
vector<int> adj[maxn] , nums;


void Lis(){
    vector<int> ans;
    int N = nums.size();
    for (int i = 0; i < N; i++) {
        auto it = lower_bound(ans.begin(), ans.end(), nums[i]);
        if (it == ans.end()) {
            ans.push_back(nums[i]);
        }
        else {
            *it = nums[i];
        }
    }
    cout << ans.size();
}


int32_t main(){    
    ios_base::sync_with_stdio(false);
    cin.tie(0) , cout.tie(0);
    
    cin >> n >> m >> k;
    bool ok = true;
    for(int i = 2 ; i <= n ; i++){
        int p;
        cin >> p;
        adj[p].pb(i);
        if(p != i-1) ok = false;
    }
    int cnt = 0;
    for(int i = 1 ; i <= m ; i++){
        cin >> v[i] >> d[i] >> w[i];
        dd[v[i]] = d[i];
        cnt += w[i];
    }
    for(int i = n ; i > 1 ; i--) if(dd[i] != 0) nums.pb(dd[i]);
    if(ok) Lis();
    else cout << cnt;
}

Subtask #1
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 4696 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 7772 KB Output is correct
2 Correct 14 ms 8536 KB Output is correct
3 Correct 30 ms 9512 KB Output is correct
4 Correct 25 ms 9224 KB Output is correct
5 Correct 29 ms 9764 KB Output is correct

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 4700 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 37 ms 9936 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 4696 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 5212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 4696 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 4696 KB Output isn't correct
2 Halted 0 ms 0 KB -