oj.uz

Submission #242260

# Submission time Handle Problem Language Result Execution time Memory
242260 2020-06-27T07:46:27 Z tqbfjotld Magic Tree (CEOI19_magictree) C++14
11 / 100
 65 ms 3060 KB 
#include <bits/stdc++.h>
using namespace std;

int n,m,k;
int p[100005];
int d[100005];
long long w[100005];

int main(){
    scanf("%d%d%d",&n,&m,&k);
    for (int x = 1; x<n; x++){
        scanf("%d",&p[x]);
        p[x]--;
    }
    for (int x = 0; x<m; x++){
        int a,b;
        long long c;
        scanf("%d%d%lld",&a,&b,&c);
        a--;
        d[a] = b;
        w[a] = c;
    }
    vector<int> v;
    for (int x = 0; x<n; x++){
        if (w[x]==0) continue;
        if (v.empty()) v.push_back(-d[x]);
        else if (-d[x]>=v[(int)v.size()-1]){
            v.push_back(-d[x]);
        }
        else{
            int pos = upper_bound(v.begin(),v.end(),-d[x])-v.begin();
            v[pos] = -d[x];
        }
    }
    printf("%d",v.size());

}

Compilation message

magictree.cpp: In function 'int main()':
magictree.cpp:35:25: warning: format '%d' expects argument of type 'int', but argument 2 has type 'std::vector<int>::size_type {aka long unsigned int}' [-Wformat=]
     printf("%d",v.size());
                 ~~~~~~~~^
magictree.cpp:10:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d%d",&n,&m,&k);
     ~~~~~^~~~~~~~~~~~~~~~~~~
magictree.cpp:12:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d",&p[x]);
         ~~~~~^~~~~~~~~~~~
magictree.cpp:18:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d%lld",&a,&b,&c);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 3.0

# Verdict Execution time Memory Grader output
1 Incorrect 31 ms 1916 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 47 ms 2424 KB Output is correct
5 Correct 48 ms 3060 KB Output is correct
6 Correct 53 ms 2424 KB Output is correct

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 65 ms 2296 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 640 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -